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 &gt;0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>γ</mml:mi> <mml:mo>&gt;</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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Communication in multiplex transportation networks

Silvia Noschese, Lothar Reichel
1 citations
Numerical Algorithms
Network Traffic and Congestion Control
0.35
article

Communication in multiplex transportation networks

Silvia Noschese, Lothar Reichel
article en
1 citations

Abstract

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 &gt;0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>γ</mml:mi> <mml:mo>&gt;</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.

Numerical AlgorithmsVol. 100(4)
Kent State University (US), Sapienza University of Rome (IT)
Istituto Nazionale di Alta Matematica "Francesco Severi", Sapienza Università di Roma, Gruppo Nazionale per il Calcolo Scientifico
Openalex Percentile: Top 39%
Network Traffic and Congestion Control
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Communication in multiplex transportation networks — Silvia Noschese, Lothar Reichel · Numerical Algorithms (2024) | TGRS Research Map | TGRS