Stations, trains and small-world networks

Preprint

11 November 2003

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0311254

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.

Keywords

CLUSTERING COEFFICIENT
TRAINS AND SMALL
RANDOM BIPARTITE
WORLD NETWORKS
ARCHITECTURE
URBAN TRAIN
SMALL WORLD
PATH LENGTH
GRAPHS

All Related Versions

Version 1, 2003-11-11, ArXiv
Published version: Physica A: Statistical Mechanics and its Applications, 339 (3-4), 635.

This publication has 0 references indexed in Scilit: