Maximal entropy coverings and the information dimension of a complex network
From MaRDI portal
Publication:2410054
DOI10.1016/j.physleta.2016.12.015zbMath1375.91213OpenAlexW2562672634MaRDI QIDQ2410054
Publication date: 17 October 2017
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physleta.2016.12.015
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80) Measures of information, entropy (94A17)
Related Items (8)
An information dimension of weighted complex networks ⋮ Generalized Hausdorff dimensions of a complex network ⋮ Minimal partition coverings and generalized dimensions of a complex network ⋮ A box-covering Tsallis information dimension and non-extensive property of complex networks ⋮ Non-monotonicity of the generalized dimensions of a complex network ⋮ Node similarity measuring in complex networks with relative entropy ⋮ D-summable fractal dimensions of complex networks ⋮ Fractional information dimensions of complex networks
Cites Work
- Unnamed Item
- Unnamed Item
- Measuring the strangeness of strange attractors
- Dual ascent for uncapacitated telecommunications network design with access, backbone, and switch costs
- Information Theory and Statistical Mechanics
- The Claude Bernard Lecture, 1989 - Deterministic chaos: the science and the fiction
- A box-covering algorithm for fractal scaling in scale-free networks
- The Structure and Function of Complex Networks
- A new information dimension of complex networks
This page was built for publication: Maximal entropy coverings and the information dimension of a complex network