Edge modification criteria for enhancing the communicability of digraphs

DOI10.1137/15M1034131MaRDI QIDQ2806181zbMATHWikidataFDO

Authors Francesca Arrigo, Michele Benzi

Publication date 17 May 2016

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.01056

zbMATH Keywords

network analysismatrix functiondirected networkcommunicabilityedge modificationauthorityhub

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Matrix exponential and similar functions of matrices (15A16) Numerical computation of matrix exponential and similar matrix functions (65F60)

Abstract: We introduce new broadcast and receive communicability indices that can be used as global measures of how effectively information is spread in a directed network. Furthermore, we describe fast and effective criteria for the selection of edges to be added to (or deleted from) a given directed network so as to enhance these network communicability measures. Numerical experiments illustrate the effectiveness of the proposed techniques.

Recommendations

• Updating and downdating techniques for optimizing network communicability
• Communication in complex networks
• Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
• On reliability indices of communication networks
• Communicability angle and the spatial efficiency of networks

Cites work

• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Authoritative sources in a hyperlinked environment
• Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
• Communicability graph and community structures in complex networks
• Expander graphs and their applications
• Functions of Matrices
• Google's PageRank and beyond. The science of search engine rankings
• Mapping directed networks
• Matrices, moments and quadrature with applications
• On generalized matrix functions
• On the limiting behavior of parameter-dependent network centrality measures
• Ranking hubs and authorities using matrix functions
• Robustness of random graphs based on graph spectra
• Updating and downdating techniques for optimizing network communicability

Cited in

(15)

• A formula for the Fréchet derivative of a generalized matrix function
• Matrix functions in network analysis
• Strengthening ties towards a highly-connected world
• Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
• Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
• Mittag-Leffler functions and their applications in network science
• A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
• The e-MoM approach for approximating matrix functionals
• Computation of generalized matrix functions with rational Krylov methods
• Updating and downdating techniques for optimizing network communicability
• Edge importance in a network via line graphs and the matrix exponential
• Communication in complex networks
• Non-backtracking alternating walks
• Some matrix properties preserved by generalized matrix functions
• Computation of generalized matrix functions

Describes a project that uses

Uses Software

• SparseMatrix
• mftoolbox

This page was built for publication: Edge modification criteria for enhancing the communicability of digraphs

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