A random multifractal tilling

DOI10.1016/J.CHAOS.2004.06.045MaRDI QIDQ1776595zbMATH OpenOpenAlexFDO

Authors M. G. Pereira, J. E. Freitas, G. Corso, L. S. Lucena

Publication date 12 May 2005

Published in Chaos, Solitons and Fractals (Search for Journal in Brave)

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

zbMATH Keywords

algorithmrandom choicefractal dimensions

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45)

Abstract: We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and anisotropic random self-affine object. The multifractal is constructed by an algorithm that makes successive sections of the square. At each $n$-step there is a random choice of a parameter $h{o}_i$ related to the section ratio. For the case of random choice between $h{o}_1$ and $h{o}_2$ we find analytically the full spectrum of fractal dimensions.

Recommendations

• Random Self-Similar Multifractals
• Multifractal spectra of random self-affine multifractal Sierpiński sponges in \(\mathbb{R}^d\)
• Random walk models for multifractals
• Random dyadic tilings of the unit square
• Lacunarity of random fractals.

Cites work

• scientific article; zbMATH DE number 194082 (Why is no real title available?)
• A review of \(E\) infinity theory and the mass spectrum of high energy particle physics

Cited in

(1)

• Maximizing circular tiles on fractals: a first step to optimization in fractals

This page was built for publication: A random multifractal tilling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1776595)