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...

Full description

Bibliographic Details
Main Authors: Albert Solé-Ribalta, Alex Arenas, Sergio Gómez
Format: Article
Language:English
Published: IOP Publishing 2019-01-01
Series:New Journal of Physics
Subjects:
Online Access:https://doi.org/10.1088/1367-2630/ab023e
_version_ 1797750140914630656
author Albert Solé-Ribalta
Alex Arenas
Sergio Gómez
author_facet Albert Solé-Ribalta
Alex Arenas
Sergio Gómez
author_sort Albert Solé-Ribalta
collection DOAJ
description 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.
first_indexed 2024-03-12T16:29:25Z
format Article
id doaj.art-5da8d75374d4453eb7016f5af10b96a8
institution Directory Open Access Journal
issn 1367-2630
language English
last_indexed 2024-03-12T16:29:25Z
publishDate 2019-01-01
publisher IOP Publishing
record_format Article
series New Journal of Physics
spelling doaj.art-5da8d75374d4453eb7016f5af10b96a82023-08-08T15:34:26ZengIOP PublishingNew Journal of Physics1367-26302019-01-0121303500310.1088/1367-2630/ab023eEffect of shortest path multiplicity on congestion of multiplex networksAlbert Solé-Ribalta0https://orcid.org/0000-0002-2953-5338Alex Arenas1https://orcid.org/0000-0003-0937-0334Sergio Gómez2https://orcid.org/0000-0003-1820-0062Internet Interdisciplinary Institute, Universitat Oberta de Catalunya , E-08018 Barcelona, Catalonia, Spain; URPP Social Networks, University of Zurich, CH-8050 Zurich, SwitzerlandDepartament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili , E-43007 Tarragona, Catalonia, SpainDepartament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili , E-43007 Tarragona, Catalonia, SpainShortest 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.https://doi.org/10.1088/1367-2630/ab023emultiplex networkscongestionshortest paths
spellingShingle Albert Solé-Ribalta
Alex Arenas
Sergio Gómez
Effect of shortest path multiplicity on congestion of multiplex networks
New Journal of Physics
multiplex networks
congestion
shortest paths
title Effect of shortest path multiplicity on congestion of multiplex networks
title_full Effect of shortest path multiplicity on congestion of multiplex networks
title_fullStr Effect of shortest path multiplicity on congestion of multiplex networks
title_full_unstemmed Effect of shortest path multiplicity on congestion of multiplex networks
title_short Effect of shortest path multiplicity on congestion of multiplex networks
title_sort effect of shortest path multiplicity on congestion of multiplex networks
topic multiplex networks
congestion
shortest paths
url https://doi.org/10.1088/1367-2630/ab023e
work_keys_str_mv AT albertsoleribalta effectofshortestpathmultiplicityoncongestionofmultiplexnetworks
AT alexarenas effectofshortestpathmultiplicityoncongestionofmultiplexnetworks
AT sergiogomez effectofshortestpathmultiplicityoncongestionofmultiplexnetworks