Lecture 4 Flashcards

1
Q

Two ways of delimiting a graph

A
  • Normalist: determined by criteria of researchers
  • Realist: network as recognized by its actors
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

… data: analysis of variables

A

Attribute

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

… data: network analysis

A

Relational

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

One mode network

A

Network comprised of one category of actors, e.g. companies, individuals

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Two-mode network

A

Network comprised of two categories of nodes, e.g. Individuals & events, companies & directors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Data collection sources: survey research

A
  • Row-based: relations going to other actors
  • Row and column based: relations coming from and going to other actors
  • Consensus method: indicate relations among every pair of actors
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Data collection sources: ethnographic research

A

Observer records all interactions and relations that take place in front of observer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Data collection sources: documentary research

A

Gather data from written/stored documents, databases

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Data collection sources: experimental research

A

Data gathered under experimental conditions, e.g. computer simulations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Adjacency matrix

A

Squared, one mode (m • m)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Affiliation/incidence matrix

A

Rectangular, two-mode (m • n). Can extract information to form adjacency matrix (m • m OR n • n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Degree centrality

A

Number of incoming (indegree) and outgoing (outdegree) linkages against rest of nodes. Local centrality measure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Closeness centrality

A

Centrality based on closeness to all other nodes, against other nodes’ closeness. Global centrality measure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Betweenness centrality

A

Centrality based on how many geodesic paths cross the node, against other nodes’ betweenness centrality. Global centrality measure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Status

A

Total weighted number of paths reaching a node, compared to its eigenvector

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

High density → high …

A

Closure