10680
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Measures of Network Centrality
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
SNAPSHOTS
PERMANENT CITATION
Phillip Bonacich
"
Measures of Network Centrality
"
http://demonstrations.wolfram.com/MeasuresOfNetworkCentrality/
Wolfram Demonstrations Project
Published: January 20, 2010
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Contagion in a Grid and a Random Network
Phillip Bonacich
Find Bridging Edges in Networks
Phillip Bonacich
Finding Cliques 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
Related Topics
Graph Theory
Networks
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+