Reference articles on history, science, culture and more
Encyclopedia

Multiplicative cascade

Fractal distribution of random points

In mathematics, a multiplicative cascade is a fractal/multifractal distribution of points produced via an iterative and multiplicative random process.

01Definition

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 cells which will be our underlying probability density field.

Secondly, an iterative process is followed to create multiple levels of the lattice: at each iteration the cells are split into four equal parts (cells). Each new cell is then assigned a probability randomly from the set \lbrace p_{1},p_{2},p_{3},p_{4}\rbrace without replacement, where p_{i}\in [0,1]. This process is continued to the Nth level. For example, in constructing such a model down to level 8 we produce a 48 array of cells.

Thirdly, the cells are filled as follows: We take the probability of a cell being occupied as the product of the cell's own pi and those of all its parents (up to level 1). A Monte Carlo rejection scheme is used repeatedly until the desired cell population is obtained, as follows: x and y cell coordinates are chosen randomly, and a random number between 0 and 1 is assigned; the (x, y) cell is then populated depending on whether the assigned number is lesser than (outcome: not populated) or greater or equal to (outcome: populated) the cell's occupation probability.

Three multiplicative cascades.Generators (left to right): , ,
Three multiplicative cascades.Generators (left to right): , ,

02Examples

To produce the plots above, the probability density field is filled with 5,000 points in a space of 256 × 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 Rényi (generalized) dimensions can be theoretically predicted. It can be shown that as N\rightarrow \infty,

D_{q}={\frac {\log _{2}\left(f_{1}^{q}+f_{2}^{q}+f_{3}^{q}+f_{4}^{q}\right)}{1-q}},

where N is the level of the grid refinement and,

f_{i}={\frac {p_{i}}{\sum _{i}p_{i}}}.
Watch videos about Multiplicative cascadeExplainers and documentaries on YouTube (opens in a new tab)

Sources and credits

This article is adapted from the Wikipedia article Multiplicative cascade, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.

Images, from Wikimedia Commons:

Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.