Minimal partition coverings and generalized dimensions of a complex network

DOI10.1016/j.physleta.2017.03.004zbMath1374.90090OpenAlexW2601038094MaRDI QIDQ1680197

Eric Rosenberg

Publication date: 23 November 2017

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

Full work available at URL: https://doi.org/10.1016/j.physleta.2017.03.004

zbMATH Keywords

partition functionmultifractalscomplex networksbox countinggeneralized dimensions

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80)

Related Items (4)

Generalized Hausdorff dimensions of a complex network ⋮ Non-monotonicity of the generalized dimensions of a complex network ⋮ Node similarity measuring in complex networks with relative entropy ⋮ Identifying influential nodes based on fuzzy local dimension in complex networks

Cites Work

• Unnamed Item
• The infinite number of generalized dimensions of fractals and strange attractors
• Renormalization group analysis of the small-world network model
• Maximal entropy coverings and the information dimension of a complex network
• Information Theory and Statistical Mechanics
• 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: Minimal partition coverings and generalized dimensions of a complex network