2019
DOI: 10.1088/1367-2630/ab023e
|View full text |Cite
|
Sign up to set email alerts
|

Effect of shortest path multiplicity on congestion of multiplex networks

Abstract: 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 relat… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(11 citation statements)
references
References 37 publications
(64 reference statements)
0
11
0
Order By: Relevance
“…Transport in a multilayer network, where layers correspond to transport modes, is often studied using diffusion or spreading processes [1,[16][17][18]. Many of these works use shortest-path minimization [14,[19][20][21] as the main method to extract the passengers' trajectories. However, this can be a restrictive choice: on one side, this assumes that different layers share the same cost function to be minimized; on the other side, shortest-path minimization is not sensitive to traffic congestion and thus, may not be realistic in certain scenarios.…”
Section: Introductionmentioning
confidence: 99%
“…Transport in a multilayer network, where layers correspond to transport modes, is often studied using diffusion or spreading processes [1,[16][17][18]. Many of these works use shortest-path minimization [14,[19][20][21] as the main method to extract the passengers' trajectories. However, this can be a restrictive choice: on one side, this assumes that different layers share the same cost function to be minimized; on the other side, shortest-path minimization is not sensitive to traffic congestion and thus, may not be realistic in certain scenarios.…”
Section: Introductionmentioning
confidence: 99%
“…When we investigate the dynamics of multiplex network, the number of shortest paths must be considered together with the intralayer paths and interlayer paths through a certain node. e critical packet injection rate of the multiplex network is as follows [19,25,27]:…”
Section: Methodsmentioning
confidence: 99%
“…However, in a multiplex network, there are two distinct kinds of shortest paths: paths that only use a single layer and paths that use more than one layer. e dynamic process in multiplex networks is becoming a hot spot of current research [17][18][19][20][25][26][27].…”
Section: Introductionmentioning
confidence: 99%
“…Transport in a multilayer network, where layers correspond to transport modes, has often been studied using diffusion or spreading processes [1,[16][17][18]. Many of these works use shortest-path minimization [14,[19][20][21] as the main method to extract the passengers' trajectories. However, this can be a restrictive choice: on one side, this assumes that different layers share the same cost function to be minimized; on the other side, shortest-path minimization is not sensitive to traffic congestion and thus may not be realistic in certain scenarios.…”
Section: Introductionmentioning
confidence: 99%