World Metro Networks

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Most metro (or subway) systems are real-life examples of complex networks with different properties. This Demonstration shows the networks of 33 of the largest metro systems in the world with graph-theoretic and visual information. Node size and edge color are depicted following a heat map determined by the degree of nodes and the centrality of edges; the larger a node, the greater the link degree, and the closer to red, the more central an edge. You can select different graph embeddings to highlight different properties of the networks. Only connecting or terminal stations are considered. Some discrepancies with current systems might exist (for example, the Shanghai metro has substantially increased recently).

Contributed by: Hector Zenil and Sybil Derrible (January 2014)
Open content licensed under CC BY-NC-SA


Snapshots


Details

References

[1] S. Derrible and C. Kennedy, "The Complexity and Robustness of Metro Networks," Physica A: Statistical Mechanics and its Applications, 389(17), 2010 pp. 3678–3691. doi:10.1016/j.physa.2010.04.008.

[2] S. Derrible and C. Kennedy, "Characterizing Metro Networks: State, Form, and Structure," Transportation, March 2010, 37(2), pp. 275–297. doi:10.1007/s11116-009-9227-7.

[3] S. Derrible, "Network Centrality of Metro Systems," PLOS ONE 7(7): e40575, 2012. doi:10.1371/journal.pone.0040575.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send