Search Results for ""

The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].

For a fractal process with values y(t-Deltat) and y(t+Deltat), the correlation between these two values is given by the Brown function r=2^(2H-1)-1, also known as the ...

A Mandelbrot set-like fractal obtained by iterating the map z_(n+1)=z_n^3+(z_0-1)z_n-z_0.

Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.

A measure nu of a strange attractor which allows the presence of chaos to be distinguished from random noise. It is related to the capacity dimension D and information ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...

A portion of the Mandelbrot set centered around 0.3+0i with size approximately 0.1+0.1i.

A type of dimension which can be used to characterize fat fractals.

A Cantor set with Lebesgue measure greater than 0.