Tuned communicability metrics in networks. The case of alternative routes for urban traffic

Grant Silver, Meisam Akbarzadeh and Ernesto Estrada

Chaos, Solitons & Fractals, 2018, vol. 116, issue C, 402-413

Abstract: We generalize here the communicability metric on graphs/networks to include a tuning parameter that accounts for the level of edge “deterioration”. This generalized metric covers a wide range of realistic scenarios in networks, which includes shortest-path metric as a particular case. We study the communicability metric on an urban street network, and show that communicability shortest paths in this city accounts for most of the traffic between series of origin-destination points. Particularly, we show that the traffic flow and congestion in the shortest communicability paths is much bigger than in the corresponding shortest paths. This indicates that under certain conditions drivers in a city avoid long paths but also avoid the most interconnected street intersections, which typically may be the most congested ones. We develop here a diffusion-like model on the network based on a particle-hopping scheme inspired by “tight-binding” quantum mechanical Hamiltonian, which offers a solid explanation on why traffic is diverted through the shortest communicability routes instead of the shortest-paths.

Keywords: Networks; Matrix functions; Euclidean distances; Urban traffic; Random geometric graphs (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077918309901
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:116:y:2018:i:c:p:402-413

DOI: 10.1016/j.chaos.2018.09.044

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().