Stations, trains and small-world networks

2003/11/11 by Katherine Seaton, Katherine A Seaton, Lisa Hackett +1 · 2 citations
Computer Science · Physics and Astronomy · #Advanced Clustering Algorithms Research #Complex Network Analysis Techniques #Data Management and Algorithms #cond-mat

paper · pdf · doi:10.1016/j.physa.2004.03.019

published as Physica A339 (2004) 635-644 · 6 pages, prepared in RevTeX

arxiv created 2003/11/11 · openalex publication_date 2004/04/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The clustering coefficient, path length and average vertex degree of two urban train line networks have been calculated. The results are compared with theoretical predictions for appropriate random bipartite graphs. They have also been compared with one another to investigate the effect of architecture on the small-world properties.

Citations

• Marvel Universe looks almost like a real social network
• The Structure and Function of Complex Networks

Cited by

• Spatial networks
• Statistical analysis of the Metropolitan Seoul Subway System: Network structure and passenger flows