Centrality measures for node-weighted networks via line graphs and the matrix exponential
DOI10.1007/s11075-020-01050-0zbMath1487.05249OpenAlexW3120733914WikidataQ115602964 ScholiaQ115602964MaRDI QIDQ820712
Mona Matar, Omar De la Cruz Cabrera, Lothar Reichel
Publication date: 27 September 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-01050-0
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accounting for the role of long walks on networks via a new matrix function
- Mapping directed networks
- Calculation of functions of unsymmetric matrices using Arnoldi's method
- Evaluating scientific products by means of citation-based models: a first analysis and validation
- Node-weighted Steiner tree approximation in unit disk graphs
- Edge importance in a network via line graphs and the matrix exponential
- Analysis of directed networks via the matrix exponential
- A new status index derived from sociometric analysis
- Network Analysis via Partial Spectral Factorization and Gauss Quadrature
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Network Properties Revealed through Matrix Functions
- Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Functions of Matrices
- Networks
This page was built for publication: Centrality measures for node-weighted networks via line graphs and the matrix exponential