Network Meausres Flashcards

1
Q

What question does centrality measure?

A

Who is the most important or central person in this network.

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

The nodes with higher degree are not always more central in an undirected graph. True or False

A

False, the nodes with higher degree are always more central.

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

Define clique

A

A lique is a maximal subset of the verticies in an undirected network such that every member of the set is connected by edge to every other.

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

What k-plex on n-size

A

A k-plex of size n is a maximal subset of n vertices within anetwork such thateachvertex is connected toat least n−k of the others.

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

What is a component in an undirected graph?

A

A component in an undirected network is a maximal subset ofvertices such that each is reachable by some path from eachof the others.

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

Define transitivity

A

if a = b and b = c then a = c

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

If you have an even number of negatives, are you balanced or nah?

A

it is balanced and stable

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

What are structural holes?

A

While it is common for the neighbors of a vertex to beconnected among themselves, it happens sometimes thatthese expected connections between neighbors are missing.The missing links are called structural holes

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

Clustering Coefficient

A

We define the clustering coefficient to be the fraction of pathsof length two in the network that are closed.

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

Clustering coefficient formula

A

c = # of clothes paths of length two/number of paths of lenght 2

c = # of triangles * 6/number of paths of length 2

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

Clustering coefficient formula for single vertex

A

Ci= #of pairs of neighbours of i that are connected / number of pairs of neighbours of i

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

What is redundancy

A

The mean of the number of connections from a neighbour to i to other neighbours of i

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

What does frequency tell us?

A

it tells us how likely it is that a vertex that you point to also points back at you.

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

Formula for recoprocity

A

of reciprocated edges / # of directed edges

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

Global Clutering coefficient

A

the average of the clustering coefficients for each node

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

What is homophilily

A

it is the tendency that people of similar characterists will asosciate with other that they percieve similiar to themselves

17
Q

Define Degree

A

the number of edges connected to a node

18
Q

Define Betweenness

A

extent to which a particular nodes lies on te shortst path between other nodes

19
Q

Define closeness

A

the average of the shortest distances to all other nodes in the graph.

20
Q

Eigenvector

A

a measure of the extent to which a node is connected to influential other nodes.