Network connectivity analysis via shortest paths

DOI10.1007/S11075-025-02225-3MaRDI QIDQ7353615zbMATH OpenFDO

Authors Silvia Noschese, Lothar Reichel

Publication date 18 September 2026

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11075-025-02225-3

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30) Information theory (general) (94A15)

Cites work

• An Edge Centrality Measure Based on the Kemeny Constant
• Analysis of directed networks via partial singular value decomposition and Gauss quadrature
• Analysis of directed networks via the matrix exponential
• Centrality measures for node-weighted networks via line graphs and the matrix exponential
• Communication in complex networks
• Community structure in social and biological networks
• Dynamical Processes on Complex Networks
• Edge importance in a network via line graphs and the matrix exponential
• Edge importance in complex networks
• Edge modification criteria for enhancing the communicability of digraphs
• Network analysis via partial spectral factorization and Gauss quadrature
• Network analysis with the aid of the path length matrix
• Networks. An introduction.
• Orthogonal expansion of network functions
• Roots of the Reliability Polynomials
• Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
• The Structure of Complex Networks
• Über ein Paradoxon aus der Verkehrsplanung

This page was built for publication: Network connectivity analysis via shortest paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353615)