Congestion and centrality in traffic flow on complex networks
| dc.creator | Holme, Petter | |
| dc.date | 2003-01-02 | |
| dc.date.accessioned | 2026-07-07T02:48:59Z | |
| dc.date.available | 2026-07-07T02:48:59Z | |
| dc.description | The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the underlying network structure. In this work we investigate the relationship between centrality measures and the density of traffic for some simple particle hopping models on networks with emerging scale-free degree distributions. We also study how the speed of the dynamics are affected by the underlying network structure. Among other conclusions, we find that, even at low traffic densities, the dynamical measure of traffic density (the occupation ratio) has a non-trivial dependence on the static centrality (quantified by "betweenness centrality"), which non-central vertices getting a comparatively large portion of the traffic. | |
| dc.description | To appear in Advances in Complex Systems | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0301013 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0301013 | |
| dc.identifier | Advances in Complex Systems 6, 163-176 (2003). | |
| dc.identifier | doi:10.1142/S0219525903000803 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/20624 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | Congestion and centrality in traffic flow on complex networks | |
| dc.type | text |