An approximative calculation of the fractal structure in self-similar tilings

Abstract

Fractal structures emerge from statistical and hierarchical processes in urban development or network evolution. In a class of efficient and robust geographical networks, we derive the size distribution of layered areas, and estimate the fractal dimension by using the distribution without huge computations. This method can be applied to self-similar tilings based on a stochastic process.

5 pages, 6 figures

References in corpus (6)

• Geographical dispersal of mobile communication networks
• Fractal and Transfractal Recursive Scale-Free Nets
• Self-similar disk packings as model spatial scale-free networks
• Random Sierpinski network with scale-free small-world and modular structure
• Evolutionary Construction of Geographical Networks with Nearly Optimal Robustness and Efficient Routing Properties
• Geographical networks stochastically constructed by a self-similar tiling according to population

Cited by in corpus (2)

• Combinatorial and approximative analyses in a spatially random division process
• Simple Derivation of the Lifetime and the Distribution of Faces for a Binary Subdivision Model