Path-Based and Whole-Network Measures
- Betweenness centrality
A measure of the proportion of shortest paths in a network passing through a specific node or edge.
- Closeness centrality
A measure of how close a node is to all the other nodes of a network.
- Clustering coefficient
A measure of how much nodes tend to form groups in a network.
The maximum distance between two nodes.
- Direct connection
An edge between two nodes, usually indicating the existence of a specific relationship, e.g., a friendship between two individuals.
A group of two people.
- Geodesic distance (or distance)
Length of one of the shortest paths between two nodes.
- Indirect connection
A path between two nodes that are not directly connected through an edge.
An entity in a network, usually representing an individual.
A sequence of edges sharing common endpoints. e.g., an edge between ni and nj followed by an edge between nj and nk..
Three nodes with an...
KeywordsUndirected Graph Social Network Analysis Cluster Coefficient Betweenness Centrality Geodesic Distance
- Anthonisse JM (1971) The rush in a directed graph. Technical report BN 9/71, Stichting Mathematisch Centrum, AmsterdamGoogle Scholar
- Bacon Oracle (2016) The Oracle of Bacon. https://oracleofbacon.org/. Accessed 11 Nov 2016
- Bastian M, Heymann S, Jacomy M (2009) Gephi: an open source software for exploring and manipulating networks. http://www.aaai.org/ocs/index.php/ICWSM/09/paper/view/154
- Becchetti L, Boldi P, Castillo C, Gionis A (2008) Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ‘08. ACM, New York, pp 16–24. doi:10.1145/1401890.1401898Google Scholar
- Csardi G, Nepusz T (2006) The igraph software package for complex network research. Inter J Complex Syst 1695. http://igraph.org/
- Erdős Number Project (2006) The Erdős number project at Oakland University. https://oakland.edu/enp/. Accessed 26 Nov 2016
- Harary F, Norman RZ (1953) Graph theory as a mathematical model in the social sciences. Institute for Social Research, University of Michigan, Ann ArborGoogle Scholar
- Leskoveč J, Sosiˇč R (2016) Snap: a general-purpose network analysis and graph-mining library. ACM Trans Intell Syst Technol 8(1):20. doi:10.1145/2898361Google Scholar
- NodeXL (2012) Nodexl, a graph visualization and manipulation software. http://nodexl.codeplex.com. Accessed 6 Dec 2016
- R Core Team (2012) R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna. http://www.R-project.org. ISBN:3-900051-07-0
- Rossi L, Magnani M (2012) Conversation practices and network structure in twitter. https://www.aaai.org/ocs/index.php/ICWSM/ICWSM12/paper/view/4634
- Wang Y, Davidson A, Pan Y, Wu Y, Riffel A, Owens JD (2016) Gunrock: a high-performance graph processing library on the GPU. In: Proceedings of 21st ACM SIGPLAN symposium on principles and practice of parallel programming, PPoPP ‘16. ACM, New York, pp 11:1–11:12. doi:10.1145/2851141.2851145Google Scholar