Effect of shortest path multiplicity on congestion of multiplex networks
Shortest paths are representative of discrete geodesic distances in graphs, and many descriptors of networks depend on their counting. In multiplex networks, this counting is radically important to quantify the switch between layers and it has crucial implications in the transportation efficiency an...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2019 |
| País: | España |
| Recursos: | Universitat Oberta de Catalunya (UOC) |
| Repositório: | O2, repositorio institucional de la UOC |
| OAI Identifier: | oai:openaccess.uoc.edu:10609/99601 |
| Acesso em linha: | http://hdl.handle.net/10609/99601 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Multiplex networks Congestion Shortest paths Multiplicity (Mathematics) Multiplicitat (Matemàtica) Matemáticas |
| Resumo: | Shortest paths are representative of discrete geodesic distances in graphs, and many descriptors of networks depend on their counting. In multiplex networks, this counting is radically important to quantify the switch between layers and it has crucial implications in the transportation efficiency and congestion processes. Here we present a mathematical approach to the computation of the joint distribution of distance and multiplicity (degeneration) of shortest paths in multiplex networks, and exploit its relation to congestion processes. The results allow us to approximate semi-analytically the onset of congestion in multiplex networks as a function of the congestion of its layers. |
|---|