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

DOI10.1007/S11075-019-00704-YOpenAlexW2943011962WikidataQ115602975 ScholiaQ115602975MaRDI QIDQ2290932FDOQ2290932

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

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

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)

Cites Work

• Network analysis via partial spectral factorization and Gauss quadrature
• Network properties revealed through matrix functions
• Title not available (Why is that?)
• A new status index derived from sociometric analysis
• Networks. An introduction.
• Title not available (Why is that?)
• Authoritative sources in a hyperlinked environment
• Title not available (Why is that?)
• Ranking hubs and authorities using matrix functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Updating and Downdating Techniques for Optimizing Network Communicability
• Title not available (Why is that?)
• Analysis of directed networks via the matrix exponential
• Edge modification criteria for enhancing the communicability of digraphs

Cited In (5)

• Centrality measures for node-weighted networks via line graphs and the matrix exponential
• Orthogonal expansion of network functions
• An Edge Centrality Measure Based on the Kemeny Constant
• Perron communicability and sensitivity of multilayer networks
• Network analysis with the aid of the path length matrix

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)