Information theory perspective on network robustness

DOI10.1016/j.physleta.2015.10.055zbMath1349.94178arXiv1410.8525OpenAlexW1937640584MaRDI QIDQ341919

Osvaldo A. Rosso, Tiago A. Schieber, Panos M. Pardalos, Alejandro C. Frery, Laura C. Carpi, Martín Gómez Ravetti

Publication date: 17 November 2016

Published in: Physics Letters. A (Search for Journal in Brave)

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

zbMATH Keywords

information theorycomplex networksnetwork robustness

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Circuits, networks (94C99)

Related Items (2)

Efficient methods for the distance-based critical node detection problem in complex networks ⋮ White Noise Test from Ordinal Patterns in the Entropy–Complexity Plane

Uses Software

• ANF

Cites Work

• Unnamed Item
• Analyzing complex networks evolution through Information Theory quantifiers
• Polynomial-time identification of robust network flows under uncertain arc failures
• Detecting critical nodes in sparse graphs
• Robustness analysis of static routing on networks
• Efficiency of scale-free networks: Error and attack tolerance
• A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs
• Divergence measures based on the Shannon entropy
• Evaluation of the Copycat Model for Predicting Complex Network Growth
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Information theory perspective on network robustness