Edge importance in a network via line graphs and the matrix exponential

DOI10.1007/S11075-019-00704-YMaRDI QIDQ2290932zbMATH OpenOpenAlexWikidataFDO

Authors Omar De la Cruz Cabrera, Mona Matar, Lothar Reichel

Publication date 29 January 2020

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-019-00704-y

zbMATH Keywords

network analysisline graphmatrix exponentialedge importance

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Centrality measures for node-weighted networks via line graphs and the matrix exponential
• Analysis of directed networks via the matrix exponential
• On the edges’ PageRank and line graphs
• Efficient identification of link importance in dynamic networks
• Kirchhoff index as a measure of edge centrality in weighted networks: nearly linear time algorithms

Cites work

• 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 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 1518742 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 2229025 (Why is no real title available?)
• A new status index derived from sociometric analysis
• Analysis of directed networks via the matrix exponential
• Authoritative sources in a hyperlinked environment
• Edge modification criteria for enhancing the communicability of digraphs
• Network analysis via partial spectral factorization and Gauss quadrature
• Network properties revealed through matrix functions
• Networks. An introduction.
• Ranking hubs and authorities using matrix functions
• Updating and downdating techniques for optimizing network communicability

Cited in

(11)

• Centrality measures for node-weighted networks via line graphs and the matrix exponential
• Network analysis with the aid of the path length matrix
• On the stability of network indices defined by means of matrix functions
• Edge importance in complex networks
• Orthogonal expansion of network functions
• Analysis of directed networks via the matrix exponential
• Node centrality based on its edges importance: the position centrality
• Efficient identification of link importance in dynamic networks
• An Edge Centrality Measure Based on the Kemeny Constant
• Perron communicability and sensitivity of multilayer networks
• Kirchhoff index as a measure of edge centrality in weighted networks: nearly linear time algorithms

Describes a project that uses

Uses Software

• sgcen

This page was built for publication: Edge importance in a network 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 Q2290932)