Enhancing multiplex global efficiency
Silvia Noschese, Lothar Reichel

TL;DR
This paper introduces a tensor-based method to measure and improve the efficiency of multiplex networks by analyzing communication paths and identifying key edges for enhancement.
Contribution
It generalizes existing single-layer network efficiency measures to multiplex networks and develops algorithms for path computation and edge importance analysis.
Findings
Algorithm for multiplex path length matrix construction
Lower bounds for multiplex global efficiency derived
Identification of edges that most improve efficiency when strengthened
Abstract
Modeling complex systems that consist of different types of objects leads to multilayer networks, in which vertices are connected by both inter-layer and intra-layer edges. In this paper, we investigate multiplex networks, in which vertices in different layers are identified with each other, and the only inter-layer edges are those that connect a vertex with its copy in other layers. Let the third-order adjacency tensor and the parameter , which is associated with the ease of communication between layers, represent a multiplex network with vertices and layers. To measure the ease of communication in a multiplex network, we focus on the average inverse geodesic length, which we refer to as the multiplex global efficiency by means of the multiplex path length matrix . This paper…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Tensor decomposition and applications · Matrix Theory and Algorithms
