Centrality measures for node-weighted networks via line graphs and the matrix exponential
From MaRDI portal
Publication:820712
Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of matrix exponential and similar matrix functions (65F60) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cites work
- A new status index derived from sociometric analysis
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Accounting for the role of long walks on networks via a new matrix function
- Analysis of directed networks via the matrix exponential
- Calculation of functions of unsymmetric matrices using Arnoldi's method
- Edge importance in a network via line graphs and the matrix exponential
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Evaluating scientific products by means of citation-based models: a first analysis and validation
- Functions of Matrices
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 5977361 (Why is no real title available?)
- scientific article; zbMATH DE number 53892 (Why is no real title available?)
- scientific article; zbMATH DE number 1323248 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 1745012 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 1426314 (Why is no real title available?)
- Mapping directed networks
- Network analysis via partial spectral factorization and Gauss quadrature
- Network properties revealed through matrix functions
- Networks. An introduction.
- Node-weighted Steiner tree approximation in unit disk graphs
- Telecommunication node clustering with node compatibility and network survivability requirements
Cited in
(16)- New models for multi-class networks
- Communication in complex networks
- Functions and eigenvectors of partially known matrices with applications to network analysis
- Edge importance in a network via line graphs and the matrix exponential
- Analysis of directed networks via the matrix exponential
- Perron communicability and sensitivity of multilayer networks
- Network properties revealed through matrix functions
- Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
- One-alpha weighted network descriptors
- Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
- Enhancing multiplex global efficiency
- Weighted graph vertices ranking using absolute potentials of electric circuit nodes
- Edge importance in complex networks
- Laplacian centrality: A new centrality measure for weighted networks
- Edge-based Katz centralities for spatio-temporal multiplex networks
- Network connectivity analysis via shortest paths
This page was built for publication: Centrality measures for node-weighted networks via line graphs and the matrix exponential
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820712)
