Scale-free Segregation in Transport Networks

Simple item page
dc.creatorBlanchard, Ph.
dc.creatorVolchenkov, D.
dc.date2007-10-08
dc.date2007-10-31
dc.date.accessioned2026-07-07T08:39:23Z
dc.date.available2026-07-07T08:39:23Z
dc.descriptionEvery 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.
dc.description8 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0710.1592
dc.identifierhttp://arxiv.org/abs/0710.1592
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141053
dc.subjectPhysics and Society
dc.subjectData Analysis, Statistics and Probability
dc.titleScale-free Segregation in Transport Networks
dc.typetext

Files

Collections

arXiv