Network Meausres Flashcards
What question does centrality measure?
Who is the most important or central person in this network.
The nodes with higher degree are not always more central in an undirected graph. True or False
False, the nodes with higher degree are always more central.
Define clique
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.
What k-plex on n-size
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.
What is a component in an undirected graph?
A component in an undirected network is a maximal subset ofvertices such that each is reachable by some path from eachof the others.
Define transitivity
if a = b and b = c then a = c
If you have an even number of negatives, are you balanced or nah?
it is balanced and stable
What are structural holes?
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
Clustering Coefficient
We define the clustering coefficient to be the fraction of pathsof length two in the network that are closed.
Clustering coefficient formula
c = # of clothes paths of length two/number of paths of lenght 2
c = # of triangles * 6/number of paths of length 2
Clustering coefficient formula for single vertex
Ci= #of pairs of neighbours of i that are connected / number of pairs of neighbours of i
What is redundancy
The mean of the number of connections from a neighbour to i to other neighbours of i
What does frequency tell us?
it tells us how likely it is that a vertex that you point to also points back at you.
Formula for recoprocity
of reciprocated edges / # of directed edges
Global Clutering coefficient
the average of the clustering coefficients for each node
What is homophilily
it is the tendency that people of similar characterists will asosciate with other that they percieve similiar to themselves
Define Degree
the number of edges connected to a node
Define Betweenness
extent to which a particular nodes lies on te shortst path between other nodes
Define closeness
the average of the shortest distances to all other nodes in the graph.
Eigenvector
a measure of the extent to which a node is connected to influential other nodes.
