Scale-free Segregation in Transport Networks
Physics and Society
2007-10-31 v2 Data Analysis, Statistics and Probability
Abstract
Every route of a transport network approaching equilibrium can be represented by a vector of Euclidean space which length quantifies its segregation from the rest of the graph. We have empirically observed that the distribution of lengths over the edge connectivity in many transport networks exhibits scaling invariance phenomenon. We give an example of the canal network of Veneice to demonstrate our result. The method is applicable to any transport network.
Cite
@article{arxiv.0710.1592,
title = {Scale-free Segregation in Transport Networks},
author = {Ph. Blanchard and D. Volchenkov},
journal= {arXiv preprint arXiv:0710.1592},
year = {2007}
}
Comments
8 pages, 2 figures