Scribd
Upload
68 views9 pages

Key Concepts in Social Network Analysis

Social network analysis examines relationships and flows between nodes in a network. Key concepts include nodes, edges, weights, density, degree, diameter, transitivity, eccentricity, closeness centrality, eigenvector centrality, and betweenness centrality. These metrics help characterize network structure and identify important nodes. For example, closeness centrality identifies nodes with the shortest average path to all others, while eigenvector centrality considers the importance of a node's neighbors.

Uploaded by

Vibha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
68 views9 pages

Key Concepts in Social Network Analysis

Social network analysis examines relationships and flows between nodes in a network. Key concepts include nodes, edges, weights, density, degree, diameter, transitivity, eccentricity, closeness centrality, eigenvector centrality, and betweenness centrality. These metrics help characterize network structure and identify important nodes. For example, closeness centrality identifies nodes with the shortest average path to all others, while eigenvector centrality considers the importance of a node's neighbors.

Uploaded by

Vibha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Social Network Analysis

• https://en.wikipedia.org/wiki/Analytics

Visit
https://densitydesign.github.io/strumentalia-seealsology/
• Node -
• Edge –
• Weight – how important/strong the relationship is.
• Density - ratio of actual edges connected to all the possible edges.
It gives sense of how closely knit your network is.
• Degree - who is the most important node. A node’s degree is the sum
of its edges
• Characteristics of a small world graph(i) a small average shortest path length,
and (ii) a large clustering coefficient. 

• These 2 characteristics are summed up in parameters like Omega and Sigma.


•  A clustering coefficient is a measure of the degree to which nodes in a graph
tend to cluster together. Evidence suggests that in most real-world networks,
and in particular social networks, nodes tend to create tightly knit groups
characterised by a relatively high density of ties; this likelihood tends to be
greater than the average probability of a tie randomly established between
two nodes (Holland and Leinhardt, 1971;[1] Watts and Strogatz, 1998[2]).
Some graph characteristics
• Diameter: the longest of all shortest paths. The measure is designed to give you a sense of the
network’s overall size.
• Transitivity: the ratio of all triangles over all possible triangles. It expresses how
interconnected a graph is. Triangles because to find the closed groups
Centrality Measures
• Eccentricity: The maximum distance between a vertex to all other vertices is considered as
the eccentricity of the vertex
• Closeness Centrality: Determine closeness to all other nodes. Used for finding out importance
of a node. For example who to get hold of to spread a news fast to all other employees
• Eigenvector centrality: It looks at a combination of a node’s edges and the edges of that
node’s neighbors. You may be important but are you connected to important people or not.
• Betweenness centrality: It finds 'broker' who connects two clusters.
Calculate Eccentricity
Closeness Centrality

Closeness Centrality (node D) = 1/average of the shortest path length = 1/1.71 = 0.58
Eigen vector Centrality
• Eigenvector centrality measures a node's importance while giving
consideration to the importance of its neighbors. For example, a node with
300 relatively unpopular friends on Facebook would have lower eigenvector
centrality than someone with 300 very popular friends (like Barack Obama).
• A node may have a high degree score ( i.e., too many connections) but may
score low on the eigen-vector centrality.

• Moreover, a node may have a high betweenness score ( it connects


disparate parts of a network) but still may be distance from the powers of
the network.

You might also like