Self-similarity

related topics
{math, number, function}
{system, computer, user}
{@card@, make, design}
{rate, high, increase}
{math, energy, light}
{area, part, region}

In mathematics, a self-similar object is exactly or approximately similar to a part of itself (i.e. the whole has the same shape as one or more of the parts). Many objects in the real world, such as coastlines, are statistically self-similar: parts of them show the same statistical properties at many scales.[1] Self-similarity is a typical property of fractals.

Scale invariance is an exact form of self-similarity where at any magnification there is a smaller piece of the object that is similar to the whole. For instance, a side of the Koch snowflake is both symmetrical and scale-invariant; it can be continually magnified 3x without changing shape.

Definition

A compact topological space X is self-similar if there exists a finite set S indexing a set of non-surjective homeomorphisms \{ f_s \}_{s\in S} for which

If X\subset Y, we call X self-similar if it is the only non-empty subset of Y such that the equation above holds for \{ f_s \}_{s\in S}. We call

a self-similar structure. The homeomorphisms may be iterated, resulting in an iterated function system. The composition of functions creates the algebraic structure of a monoid. When the set S has only two elements, the monoid is known as the dyadic monoid. The dyadic monoid can be visualized as an infinite binary tree; more generally, if the set S has p elements, then the monoid may be represented as a p-adic tree.

The automorphisms of the dyadic monoid is the modular group; the automorphisms can be pictured as hyperbolic rotations of the binary tree.

Examples

The Mandelbrot set is also self-similar around Misiurewicz points.

Self-similarity has important consequences for the design of computer networks, as typical network traffic has self-similar properties. For example, in teletraffic engineering, packet switched data traffic patterns seem to be statistically self-similar[2]. This property means that simple models using a Poisson distribution are inaccurate, and networks designed without taking self-similarity into account are likely to function in unexpected ways.

Similarly, stock market movements are described as displaying self-affinity, i.e. they appear self-similar when transformed via an appropriate affine transformation for the level of detail being shown.[3]

Full article ▸

related documents
Timeline of programming languages
Gauss–Legendre algorithm
Krull dimension
Two-out-of-five code
Integer sequence
Probability axioms
Catalan's constant
Laurent polynomial
HTML scripting
Senary
Almost all
Leaf node
Mary (programming language)
Prime ideal
Power associativity
NP-easy
Normed division algebra
Bilinear map
Arithmetic-geometric mean
Monoid ring
Wikipedia:Searching bug reports
Co-NP-complete
Church–Rosser theorem
Continuity property
Digital Signature Algorithm
Measurable function
Almost everywhere
Gabriel Lamé
EXPSPACE
Center (group theory)