Measures of Network Centrality
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
A random graph is generated and the radii of the nodes of the graph correspond to the magnitude of six standard measures of centrality: degree centrality, closeness centrality, betweenness centrality, cut points, and graph centers.
Contributed by: Phillip Bonacich (January 2010)
Open content licensed under CC BY-NC-SA
Snapshots
Details
detailSectionParagraphPermanent Citation
"Measures of Network Centrality"
http://demonstrations.wolfram.com/MeasuresOfNetworkCentrality/
Wolfram Demonstrations Project
Published: January 20 2010
Contagion in a Grid and a Random Network
Phillip Bonacich
Finding Cliques in Networks
Phillip Bonacich
Find Bridging Edges in Networks
Phillip Bonacich
The Power-Dependence Solution to Five Exchange Networks
Phillip Bonacich
Network Centrality Using Eigenvectors
Brian Levinstein
Network Motifs and Graphlets
Hector Zenil
Elementary Cellular Automaton with Network
Francis A. Bitonti
Complex Networks
Hector Zenil
Shakespearean Networks
Seth J. Chandler
Random Acyclic Networks
Seth J. Chandler
-
Measures of Network Centrality
author -
Finding Cliques in Networks
author -
Contagion in a Grid and a Random Network
author -
N-Step Transition Matrices for Markov Chains
author -
Find Bridging Edges in Networks
author -
Exchange Networks
author -
Simulated Epidemics in Random Networks of Varying Density and Size
author -
Contagion in Random and Scale-Free Networks
author -
The Power-Dependence Solution to Five Exchange Networks
author