Network analysis with the aid of the path length matrix

DOI10.1007/s11075-023-01577-yarXiv2305.07978OpenAlexW4381434905MaRDI QIDQ6145580

Lothar Reichel, Silvia Noschese

Publication date: 9 January 2024

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.07978

zbMATH Keywords

network analysisglobal efficiencyharmonic centralitypath length matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Enhancing multiplex global efficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Communication in complex networks
• Edge importance in a network via line graphs and the matrix exponential
• Analysis of directed networks via the matrix exponential
• Eigenvalue condition numbers: zero-structured versus traditional.
• Perron communicability and sensitivity of multilayer networks
• The Structure of Complex Networks
• Dynamical Processes on Complex Networks
• Estimating and increasing the structural robustness of a network
• Krylov--Schur-Type Restarts for the Two-Sided Arnoldi Method
• On the Addressing Problem for Loop Switching
• Networks

This page was built for publication: Network analysis with the aid of the path length matrix