ALGORITHMS FOR FRACTAL DIMENSION CALCULATION

DOI10.1142/S0217984908015048zbMath1151.82329OpenAlexW1984232809MaRDI QIDQ3532441

O. Shanker

Publication date: 3 November 2008

Published in: Modern Physics Letters B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217984908015048

zbMATH Keywords

fractal dimensiongraph algorithmscomplex networks

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Fractals (28A80)

Related Items (3)

RANDOM WALK IN SHORTCUT MODELS ⋮ EXACT SOLUTION OF ISING MODEL IN 2D SHORTCUT NETWORK ⋮ EPIDEMIOLOGY MODEL ON SHORTCUT AND SMALL WORLD NETWORKS

Cites Work

• Unnamed Item
• Unnamed Item
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
• Finite-state dimension
• The dimensions of individual strings and sequences
• Kolmogorov complexity and Hausdorff dimension
• Effective fractal dimensions
• DEFINING DIMENSION OF A COMPLEX NETWORK
• Dimension in Complexity Classes
• GRAPH ZETA FUNCTION AND DIMENSION OF COMPLEX NETWORK

This page was built for publication: ALGORITHMS FOR FRACTAL DIMENSION CALCULATION