Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/99601
Título : | Effect of shortest path multiplicity on congestion of multiplex networks |
Autoría: | Solé-Ribalta, Albert ![]() Arenas, Alex ![]() Gómez Jiménez, Sergio |
Citación : | Solé Ribalta, A., Arenas Moreno, A. & Gómez, S. (2019). Effect of shortest path multiplicity on congestion of multiplex networks. New Journal of Physics, 21(), 035003-. doi: 10.1088/1367-2630/ab023e |
Resumen : | 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. |
Palabras clave : | Multiplex networks Congestion Shortest paths |
DOI: | 10.1088/1367-2630/ab023e |
Tipo de documento: | info:eu-repo/semantics/article |
Versión del documento: | info:eu-repo/semantics/publishedVersion |
Fecha de publicación : | 15-mar-2019 |
Licencia de publicación: | http://creativecommons.org/licenses/by/3.0/es/ ![]() |
Aparece en las colecciones: | Articles Articles cientÍfics |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
congestion_multiplexnetworks.pdf | 985,41 kB | Adobe PDF | ![]() Visualizar/Abrir |
Comparte:
![]( /image/googleScholar.png)
![](/image/microsoftAcademic.png)
Los ítems del Repositorio están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.