Vertex (N) Smallest unit in a network
Line (L) Link between vertices
• Undirected- > edge
• Directed -> Arc
Degree in directed networks X influences Y
• outdegree measures power
• Indegree measures dependency or influenceability
X likes Y
• Indegree measures popularity
• Outdegree agreeableness
Average degree Undirected-> 2L/N
Directed -> L/N
Degree distribution Probability a randomly selected vertex has degree k
Adjacency matrices N vertices -> N rows and columns Aij
Friendship paradox Assume people base their decision on the majority
Importance of position Popular, better connected, acces to information, powerful
Degree centrality Number of connections an actor has
Betweenness centrality How often actor is between others.
Geodesics -> shortest paths between the pair
Sum of geodesics/geodesics including actor
Normalized: division by (n-1)/(n-2)/2 (undirected links)
Eigenvector centrality How well can I reach others, measure that includes how well-connected firends (and their fri
Line (L) Link between vertices
• Undirected- > edge
• Directed -> Arc
Degree in directed networks X influences Y
• outdegree measures power
• Indegree measures dependency or influenceability
X likes Y
• Indegree measures popularity
• Outdegree agreeableness
Average degree Undirected-> 2L/N
Directed -> L/N
Degree distribution Probability a randomly selected vertex has degree k
Adjacency matrices N vertices -> N rows and columns Aij
Friendship paradox Assume people base their decision on the majority
Importance of position Popular, better connected, acces to information, powerful
Degree centrality Number of connections an actor has
Betweenness centrality How often actor is between others.
Geodesics -> shortest paths between the pair
Sum of geodesics/geodesics including actor
Normalized: division by (n-1)/(n-2)/2 (undirected links)
Eigenvector centrality How well can I reach others, measure that includes how well-connected firends (and their fri
