vix.ing · top · new · best · stats · spec

Scale-free Segregation in Transport Networks

2007/10/08 by Ph. Blanchard, Blanchard, Ph., Dimitri Volchenkov +2
Environmental Science · Physics and Astronomy · Social Sciences · #Complex Network Analysis Techniques #Data Analysis #FOS: Physical sciences #Physics and Society (physics.soc-ph) #Statistics and Probability (physics.data-an) #Transportation Planning and Optimization #Wildlife-Road Interactions and Conservation #physics.data-an #physics.soc-ph

paper · pdf · doi:10.48550/arxiv.0710.1592

8 pages, 2 figures

openalex publication_date 2007/10/08 · arxiv created 2007/10/31 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related