Communication in multiplex transportation networks
Abstract Complex networks are made up of vertices and edges. The edges, which may be directed or undirected, are equipped with positive weights. Modeling complex systems that consist of different types of objects leads to multilayer networks, in which vertices in distinct layers represent different kinds of objects. Multiplex networks are special vertex-aligned multilayer networks, in which vertices in distinct layers are identified with each other and inter-layer edges connect each vertex with its copy in other layers and have a fixed weight $$\gamma >0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>γ</mml:mi> <mml:mo>></mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> associated with the ease of communication between layers. This paper discusses two different approaches to analyze communication in a multiplex. One approach focuses on the multiplex global efficiency by using the multiplex path length matrix, the other approach considers the multiplex total communicability. The sensitivity of both the multiplex global efficiency and the multiplex total communicability to structural perturbations in the network is investigated to help to identify intra-layer edges that should be strengthened to enhance communicability.
Authors
- Silvia Noschese (ORCID: https://orcid.org/0000-0002-2995-9245)
- Lothar Reichel (ORCID: https://orcid.org/0000-0003-1729-6816)
Institutions
- Kent State University (US)
- Sapienza University of Rome (IT)
Publication Details
- Journal
- Numerical Algorithms
- Published
- 2024-09-17
- DOI
- https://doi.org/10.1007/s11075-024-01943-4
- Citations
- 1
- Primary Topic
- Network Traffic and Congestion Control
- Type
- article
- Field-Weighted Citation Impact
- 0.35
Funders
- Istituto Nazionale di Alta Matematica "Francesco Severi"
- Sapienza Università di Roma
- Gruppo Nazionale per il Calcolo Scientifico