Edge importance in complex networks

DOI10.1007/S11075-024-01881-1MaRDI QIDQ6992057zbMATH OpenFDO

Authors Silvia Noschese, Lothar Reichel

Publication date 28 April 2025

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-024-01881-1

zbMATH Keywords

edge importancenetwork analysissensitivity analysis

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphical methods in numerical analysis (65S05) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• 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
• Computing low‐rank approximations of the Fréchet derivative of a matrix function using Krylov subspace methods
• Edge importance in a network via line graphs and the matrix exponential
• Edge modification criteria for enhancing the communicability of digraphs
• Eigenvalue condition numbers: zero-structured versus traditional.
• Estimating and increasing the structural robustness of a network
• Functions of Matrices
• High performance computing of the matrix exponential
• scientific article; zbMATH DE number 3988607 (Why is no real title available?)
• scientific article; zbMATH DE number 3791531 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• Inexact rational Krylov Subspace methods for approximating the action of functions of matrices
• Krylov-Schur-type restarts for the two-sided Arnoldi method
• Mittag-Leffler functions and their applications in network science
• Network analysis via partial spectral factorization and Gauss quadrature
• Network analysis with the aid of the path length matrix
• Network properties revealed through matrix functions
• Networks. An introduction.
• Numerical methods for large eigenvalue problems
• Perron communicability and sensitivity of multilayer networks
• Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
• The Structure of Complex Networks

Cited in

(5)

• Communication in multiplex transportation networks
• A novel Krylov subspace method for approximating Fréchet derivatives of large-scale matrix functions
• A distance-based algorithm for ranking motifs in complex networks
• Edge-based Katz centralities for spatio-temporal multiplex networks
• Network connectivity analysis via shortest paths

This page was built for publication: Edge importance in complex networks

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