A box-covering algorithm for fractal scaling in scale-free networks

DOI10.1063/1.2737827zbMath1159.37361arXivcond-mat/0701504OpenAlexW2071293538WikidataQ51910973 ScholiaQ51910973MaRDI QIDQ3624829

No author found.

Publication date: 30 April 2009

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0701504

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Related Items (22)

Complex networks modeled on the Sierpinski gasket ⋮ A small-world and scale-free network generated by Sierpinski pentagon ⋮ Scale-free and small-world properties of Sierpinski networks ⋮ Scale-free and small-world properties of a multiple-hub network with fractal structure ⋮ Generalized Hausdorff dimensions of a complex network ⋮ MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB ⋮ Maximal entropy coverings and the information dimension 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 ⋮ HAUSDORFF DIMENSION OF A FAMILY OF NETWORKS ⋮ SMALL-WORLD AND SCALE-FREE PROPERTIES OF THE n-DIMENSIONAL SIERPINSKI CUBE NETWORKS ⋮ D-summable fractal dimensions of complex networks ⋮ Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree ⋮ A generalized volume dimension of complex networks ⋮ Maximum matchings in scale-free networks with identical degree distribution ⋮ Introduction: Optimization in networks ⋮ SMALL-WORLD AND SCALE-FREE PROPERTIES OF FRACTAL NETWORKS MODELED ON n-DIMENSIONAL SIERPINSKI PYRAMID ⋮ Determination of multifractal dimensions of complex networks by means of the sandbox algorithm ⋮ Sampling-based box-covering algorithm for renormalization of networks ⋮ A novel approach to estimated Boulingand-Minkowski fractal dimension from complex networks ⋮ COMPLEX NETWORKS MODELED ON A KIND OF SIERPIŃSKI-LIKE CARPET

Cites Work

• Emergence of Scaling in Random Networks
• Unnamed Item

This page was built for publication: A box-covering algorithm for fractal scaling in scale-free networks