Edge modification criteria for enhancing the communicability of digraphs

DOI10.1137/15M1034131zbMATH Open1336.05120arXiv1508.01056WikidataQ125801418 ScholiaQ125801418MaRDI QIDQ2806181FDOQ2806181

Authors: Francesca Arrigo, Michele Benzi 

Publication date: 17 May 2016

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

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.

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

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

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)

Cites Work

• Functions of Matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Authoritative sources in a hyperlinked environment
• Expander graphs and their applications
• Matrices, moments and quadrature with applications
• Ranking hubs and authorities using matrix functions
• Google's PageRank and beyond. The science of search engine rankings
• Mapping directed networks
• Robustness of random graphs based on graph spectra
• Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
• Updating and Downdating Techniques for Optimizing Network Communicability
• On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
• Communicability graph and community structures in complex networks
• On generalized matrix functions

Cited In (14)

• The e-MoM approach for approximating matrix functionals
• Strengthening ties towards a highly-connected world
• A Formula for the Fréchet Derivative of a Generalized Matrix Function
• Matrix functions in network analysis
• Computation of Generalized Matrix Functions
• Edge importance in a network via line graphs and the matrix exponential
• Computation of generalized matrix functions with rational Krylov methods
• Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
• A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
• Some matrix properties preserved by generalized matrix functions
• Communication in complex networks
• Mittag--Leffler Functions and their Applications in Network Science
• Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
• Non-Backtracking Alternating Walks

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)