Multiplicative Cascade

Multiplicative Cascade

A Multiplicative Cascade [ [Meakin P, PRA vol 36 No 6(1987) "Diffusion-limited aggregation on multifractal lattices"] ] [ [http://uk.arxiv.org/abs/0803.3212 Cristano G. Sabiu, Luis Teodoro, Martin Hendry, arXiv:0803.3212v1 "Resolving the universe with multifractals"] ] is a generic name given to a fractal / multifractal distribution of points, produced via an iterative and multiplicative random process.


Model I (left plot):lbrace p_1,p_2,p_3,p_4 brace = lbrace 1,1,1,0 brace Model II (middle plot):lbrace p_1,p_2,p_3,p_4 brace = lbrace 1,0.75,0.75,0.5 brace Model III (right plot):lbrace p_1,p_2,p_3,p_4 brace = lbrace 1,0.5,0.5,0.25 brace

The plots above are examples of Multiplicative Cascade multifractals.To create these distributions there are a few steps to take. Firstly, we must create a lattice of points which will be our underlying probability density field. Then we will populate this lattice with randomly placed points, insisting that the probability that the points be placed are proportional to the cell probability.

The fractal is constructed as follows: The space is split into four equal parts. Each part is then assigned a probability from the set lbrace p_1,p_2,p_3,p_4 brace without replacement, where p_i in [0,1] . Each subspace is then divided again and assigned probabilities randomly from the same set and this is continued to the N^{th} level.

At the N^{th} level the probability of a cell being occupied is the product of the cell's p_i and its parents and ancestors up to level 1 i.e. all the cells above it. In constructing this model down to level 8 we produce a 4^8 array of cells each with its own probability. To then place particle in the space we invoke a Monte Carlo rejection scheme. Choosing x and y coordinates randomly we simply test if a random number between 0 and 1 is less or greater than the cell probability. To produce the plots above we dust the probability density field with 5,000 points in a space of 256 x 256.

An example of the probability density field:

The fractals are generally not scale invariant and therefore cannot be considered "standard" fractals. They can however be considered multifractals. The Renyi (generalized) dimensions can be theoretically predicted. It can be shown [Martinez et.al ApJ 357 50M "Clustering Paradigms and Multifractal Measures"] that as L ightarrow infty,

D_q=frac{log_2left( f^q_1+f^q_2+f^q_3+f^q_4 ight)}{1-q},

where

f_i=frac{p_i}{sum_i p_i}.

References

See also

* Fractal dimension
* Hausdorff dimension
* Scale invariance


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Multiplicative cascade — In mathematics, a multiplicative cascade[1][2] is a fractal/multifractal distribution of points produced via an iterative and multiplicative random process. Model I (left plot): {p1,p2,p3,p4} = {1,1,1,0} Model II (middle plot): {p1 …   Wikipedia

  • Multifractal system — A multifractal system is a generalization of a fractal system in which a single exponent (the fractal dimension) is not enough to describe its dynamics; instead, a continuous spectrum of exponents (the so called singularity spectrum) is needed.… …   Wikipedia

  • List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… …   Wikipedia

  • Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and …   Wikipedia

  • MultiSwap — General Designers Microsoft First published April 1999 Cipher detail Key sizes 374 bits Block sizes 64 bits Best public …   Wikipedia

  • Logistic map — The logistic map is a polynomial mapping of degree 2, often cited as an archetypal example of how complex, chaotic behaviour can arise from very simple non linear dynamical equations. The map was popularized in a seminal 1976 paper by the… …   Wikipedia

  • Maximum sustainable yield — In population ecology and economics, maximum sustainable yield or MSY is, theoretically, the largest yield (or catch) that can be taken from a species stock over an indefinite period. Fundamental to the notion of sustainable harvest, the concept… …   Wikipedia

  • Minimum phase — In control theory and signal processing, a linear, time invariant system is said to be minimum phase if the system and its inverse are causal and stable.[1][2] For example, a discrete time system with rational transfer function H(z) can only… …   Wikipedia

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • Distributed amplifier — Distributed amplifiers are circuit designs that incorporate transmission line theory into traditional amplifier design to obtain a larger gain bandwidth product than is realizable by conventional circuits. N stage traveling wave amplifier …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”