A betweenness structural entropy of complex networks

DOI10.1016/j.chaos.2022.112264zbMath1504.05269OpenAlexW4282914797MaRDI QIDQ2112857

Qi Zhang, Meizhu Li

Publication date: 12 January 2023

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2022.112264

zbMATH Keywords

complex networksnetwork stabilitystructural entropybetweenness structural entropy

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items (1)

Efficient approaches for attaining epidemic-free networks with minimum edge removal set

Uses Software

• Pajek datasets

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• Matrices with prescribed row and column sums
• Networks beyond pairwise interactions: structure and dynamics
• Influential nodes ranking in complex networks: an entropy-based approach
• Ensemble equivalence for dense graphs
• Measure the structure similarity of nodes in complex networks based on relative entropy
• Information Theory and Statistical Mechanics
• On the strength of connectedness of a random graph
• Binary versus non-binary information in real time series: empirical results and maximum-entropy matrix models
• Maximum-Entropy Networks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: A betweenness structural entropy of complex networks