Search Results for ""

Fatou dust is a Fatou set for a point outside the underlying set. Such a set has zero area and has an infinite number of disconnected components.

A one-dimensional map whose increments are distributed according to a normal distribution. Let y(t-Deltat) and y(t+Deltat) be values, then their correlation is given by the ...

A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...

The Goffinet dragon is the fractal obtained by plotting all points spanned by powers of the complex number p=0.65-0.3i (Trott 2004, p. 9).

D_(KY)=j+(sigma_1+...+sigma_j)/(|sigma_(j+1)|), (1) where sigma_1<=sigma_n are Lyapunov characteristic exponents and j is the largest integer for which ...

A curve on which points of a map z_n (such as the Mandelbrot set) diverge to a given value r_(max) at the same rate. A common method of obtaining lemniscates is to define an ...

The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...

A fractal based on iterating the map F(x)=ax+(2(1-a)x^2)/(1+x^2) (1) according to x_(n+1) = by_n+F(x_n) (2) x_(y+1) = -x_n+F(x_(n+1)). (3) The plots above show 10^4 ...

A measure for which the q-dimension D_q varies with q.

The number of outward directed graph edges from a given graph vertex in a directed graph.