Structural Information and Dynamical Complexity of Networks
The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Abstract
In 1953, Shannon proposed the question of quantification of structural information to analyze communication systems. The question has become one of the longest great challenges in information science and computer science. Here, we propose the first metric for structural information. Given a graph G , we define the K-dimensional structural information of G (or structure entropy of G), denoted by HK(G) , to be the minimum overall number of bits required to determine the K-dimensional code of the node that is accessible from random walk in G. The K-dimensional structural information provides the principle for completely detecting the natural or true structure, which consists of the rules, regulations, and orders of the graphs, for fully distinguishing the order from disorder in structured noisy data, and for analyzing communication systems, solving the Shannon's problem and opening up new directions. The K-dimensional structural information is also the first metric of dynamical complexity of networks, measuring the complexity of interactions, communications, operations, and even evolution of networks. The metric satisfies a number of fundamental properties, including additivity, locality, robustness, local and incremental computability, and so on. We establish the fundamental theorems of the one- and two-dimensional structural information of networks, including both lower and upper bounds of the metrics of classic data structures, general graphs, the networks of models, and the networks of natural evolution. We propose algorithms to approximate the K-dimensional structural information of graphs by finding the K-dimensional structure of the graphs that minimizes the K-dimensional structure entropy. We find that the K-dimensional structure entropy minimization is the principle for detecting the natural or true structures in real-world networks. Consequently, our structural information provides the foundation for knowledge discovering from noisy data. We establish a black hole principle by using the two-dimensional structure information of graphs. We propose the natural rank of locally listing algorithms by the structure entropy minimization principle, providing the basis for a next-generation search engine.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Current AI and robotics research often operates on a pair of related, flawed assumptions about complexity: (i) that human-similarity is a barometer for complexity, and (ii) that the complexity of an agent is essentially the complexity of its centralized information processing (its biological or artificial brain) Tononi et al. ( 1999); Li and Pan (2016); Sporns (2022).”
From Understanding Agent Complexity Through Affordances (2025) · cites this paper as Li and Pan (2016)
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 3×
“For community detection, Newman and Girvan [42] had proposed the modularity maximisation principle.”
BackgroundMethodInfluentialFortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“A standard null model assumes that the expected degree after averaging over all possible configurations matches the actual degree of the original graph [27].”
BackgroundDistinct types of diffuse large B-cell lymphoma identified by gene expression profiling
Alizadeh, A. A., Eisen, M. B., Davis, R. E., Ma, C., Lossos, I. S., Rosenwald, A., Boldrick, J. C., Sabet, H., Tran, T., Yu, X., et al. (2000) · Nature · doi:10.1038/35000501 · Cited by 9,925
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Darwin, C., Burndy Library, Darwin, C., Edmonds & Remnants, & Henry Sotheran Ltd. (1859) · J. Murray eBooks · doi:10.5962/bhl.title.59991 · Cited by 6,984
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Maps of random walks on complex networks reveal community structure
Rosvall, M., & Bergstrom, C. T. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0706851105 · Cited by 4,583
Research works printed but not linked: 3
- ?uczak, 1989, Sparse random graphs with a given degree sequence, Proc Symp Random Graphs, 165
- erdõs, 1959, On random graphs I, Publ Math Inst Hungar Acad Sci, 6, 290
- konstantinova, 1990, Sensitivity of topological indices of polycyclic graphs, Vych Sistemy, 136, 38
Cited by
A Comprehensive Survey on Deep Graph Representation Learning
Ju, W., Fang, Z., Gu, Y., Liu, Z., Long, Q., Qiao, Z., Qin, Y., Shen, J., Sun, F., Xiao, Z., et al. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106207 · Cited by 341
Li, A., Yin, X., Xu, B., Wang, D., Han, J., Wei, Y., Deng, Y. K., Xiong, Y., & Zhang, Z. (2018) · Nature Communications · doi:10.1038/s41467-018-05691-7 · Cited by 155
Self-citationUnsupervised Social Bot Detection via Structural Information Theory
Peng, H. M., Zhang, J., Huang, X., Hao, Z., Li, A., Yu, Z., & Yu, P. S. (2024) · ACM Transactions on Information Systems · doi:10.1145/3660522 · Cited by 114
Self-citationZou, D., Peng, H., Huang, X., Yang, R., Li, J., Wu, J. X., Liu, C., & Yu, P. S. (2023) · International World Wide Web Conference (WWW) · doi:10.1145/3543507.3583453 · Cited by 102
Effective and Stable Role-Based Multi-Agent Collaboration by Structural Information Principles
Zeng, X., Peng, H. M., & Li, A. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i10.26390 · Cited by 83
Self-citation
Metadata
- Authors
- Li, A., & Pan, Y.
- Affiliations
- Chinese Academy of Sciences (CN)
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-06
- Volume
- 62
- Issue
- 6
- Pages
- 3290-3339
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2338678442
- Cited by
- 200
- References
- 51
- Citations by year
- 2026: 36 · 2025: 51 · 2024: 32 · 2023: 23 · 2022: 17 · 2021: 22 · 2020: 5 · 2019: 5 · 2018: 6 · 2017: 2 · 2016: 1
- FWCI
- 2.61
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- Funders
- Hundred Talent Program of Chinese Academy of Sciences
- China Basic Research Program (973) (2014CB340302)
- Institute of Software, Chinese Academy of Sciences through the Grand Project entitled Network Algorithms and Digital Information
- National Natural Science Foundation of China (61161130530)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Systems and Dynamics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- structural information, structure entropy, random walks on graphs, noisy data, search engines, network evolution
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.