CoChat

Structural Information and Dynamical Complexity of Networks

Li, Angsheng, Pan, Yicheng · 2016 · IEEE Transactions on Information Theory

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

Crossref · 10.1109/tit.2016.2555904

Cites

51 of 51 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 51 references

Research works printed but not linked: 3

  1. ?uczak, 1989, Sparse random graphs with a given degree sequence, Proc Symp Random Graphs, 165
  2. erdõs, 1959, On random graphs I, Publ Math Inst Hungar Acad Sci, 6, 290
  3. konstantinova, 1990, Sensitivity of topological indices of polycyclic graphs, Vych Sistemy, 136, 38

Cited by

Items 101–200 of 269

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.