Self-similarity

Last updated

A Koch snowflake has an infinitely repeating self-similarity when it is magnified. KochSnowGif16 800x500 2.gif
A Koch snowflake has an infinitely repeating self-similarity when it is magnified.
Standard (trivial) self-similarity. Standard self-similarity.png
Standard (trivial) self-similarity.

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. [2] 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. The non-trivial similarity evident in fractals is distinguished by their fine structure, or detail on arbitrarily small scales. As a counterexample, whereas any portion of a straight line may resemble the whole, further detail is not revealed.

Contents

A time developing phenomenon is said to exhibit self-similarity if the numerical value of certain observable quantity measured at different times are different but the corresponding dimensionless quantity at given value of remain invariant. It happens if the quantity exhibits dynamic scaling. The idea is just an extension of the idea of similarity of two triangles. [3] [4] [5] Note that two triangles are similar if the numerical values of their sides are different however the corresponding dimensionless quantities, such as their angles, coincide.

Peitgen et al. explain the concept as such:

If parts of a figure are small replicas of the whole, then the figure is called self-similar....A figure is strictly self-similar if the figure can be decomposed into parts which are exact replicas of the whole. Any arbitrary part contains an exact replica of the whole figure. [6]

Since mathematically, a fractal may show self-similarity under indefinite magnification, it is impossible to recreate this physically. Peitgen et al. suggest studying self-similarity using approximations:

In order to give an operational meaning to the property of self-similarity, we are necessarily restricted to dealing with finite approximations of the limit figure. This is done using the method which we will call box self-similarity where measurements are made on finite stages of the figure using grids of various sizes. [7]

This vocabulary was introduced by Benoit Mandelbrot in 1964. [8]

Self-affinity

A self-affine fractal with Hausdorff dimension=1.8272. Self-affine set.png
A self-affine fractal with Hausdorff dimension=1.8272.

In mathematics, self-affinity is a feature of a fractal whose pieces are scaled by different amounts in the x- and y-directions. This means that to appreciate the self similarity of these fractal objects, they have to be rescaled using an anisotropic affine transformation.

Definition

A compact topological space X is self-similar if there exists a finite set S indexing a set of non-surjective homeomorphisms for which

If , we call X self-similar if it is the only non-empty subset of Y such that the equation above holds for . 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.

A more general notion than self-similarity is Self-affinity.

Examples

Self-similarity in the Mandelbrot set shown by zooming in on the Feigenbaum point at (-1.401155189..., 0) Feigenbaumzoom.gif
Self-similarity in the Mandelbrot set shown by zooming in on the Feigenbaum point at (−1.401155189..., 0)
An image of the Barnsley fern which exhibits affine self-similarity Fractal fern explained.png
An image of the Barnsley fern which exhibits affine self-similarity

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. [9] 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. [10] Andrew Lo describes stock market log return self-similarity in econometrics. [11]

Finite subdivision rules are a powerful technique for building self-similar sets, including the Cantor set and the Sierpinski triangle.

A triangle subdivided repeatedly using barycentric subdivision. The complement of the large circles becomes a Sierpinski carpet RepeatedBarycentricSubdivision.png
A triangle subdivided repeatedly using barycentric subdivision. The complement of the large circles becomes a Sierpinski carpet

In cybernetics

The viable system model of Stafford Beer is an organizational model with an affine self-similar hierarchy, where a given viable system is one element of the System One of a viable system one recursive level higher up, and for whom the elements of its System One are viable systems one recursive level lower down.

In nature

Close-up of a Romanesco broccoli. Flickr - cyclonebill - Romanesco.jpg
Close-up of a Romanesco broccoli.

Self-similarity can be found in nature, as well. To the right is a mathematically generated, perfectly self-similar image of a fern, which bears a marked resemblance to natural ferns. Other plants, such as Romanesco broccoli, exhibit strong self-similarity.

In music

See also

Related Research Articles

<span class="mw-page-title-main">Benoit Mandelbrot</span> French-American mathematician (1924–2010)

Benoit B.Mandelbrot was a Polish-born French-American mathematician and polymath with broad interests in the practical sciences, especially regarding what he labeled as "the art of roughness" of physical phenomena and "the uncontrolled element in life". He referred to himself as a "fractalist" and is recognized for his contribution to the field of fractal geometry, which included coining the word "fractal", as well as developing a theory of "roughness and self-similarity" in nature.

In mathematics, the Cantor set is a set of points lying on a single line segment that has a number of unintuitive properties. It was discovered in 1874 by Henry John Stephen Smith and mentioned by German mathematician Georg Cantor in 1883.

<span class="mw-page-title-main">Fractal</span> Infinitely detailed mathematical structure

In mathematics, a fractal is a geometric shape containing detailed structure at arbitrarily small scales, usually having a fractal dimension strictly exceeding the topological dimension. Many fractals appear similar at various scales, as illustrated in successive magnifications of the Mandelbrot set. This exhibition of similar patterns at increasingly smaller scales is called self-similarity, also known as expanding symmetry or unfolding symmetry; if this replication is exactly the same at every scale, as in the Menger sponge, the shape is called affine self-similar. Fractal geometry lies within the mathematical branch of measure theory.

<span class="mw-page-title-main">Hausdorff dimension</span> Invariant measure of fractal dimension

In mathematics, Hausdorff dimension is a measure of roughness, or more specifically, fractal dimension, that was introduced in 1918 by mathematician Felix Hausdorff. For instance, the Hausdorff dimension of a single point is zero, of a line segment is 1, of a square is 2, and of a cube is 3. That is, for sets of points that define a smooth shape or a shape that has a small number of corners—the shapes of traditional geometry and science—the Hausdorff dimension is an integer agreeing with the usual sense of dimension, also known as the topological dimension. However, formulas have also been developed that allow calculation of the dimension of other less simple objects, where, solely on the basis of their properties of scaling and self-similarity, one is led to the conclusion that particular objects—including fractals—have non-integer Hausdorff dimensions. Because of the significant technical advances made by Abram Samoilovitch Besicovitch allowing computation of dimensions for highly irregular or "rough" sets, this dimension is also commonly referred to as the Hausdorff–Besicovitch dimension.

<span class="mw-page-title-main">Mandelbrot set</span> Fractal named after mathematician Benoit Mandelbrot

The Mandelbrot set is a two-dimensional set with a relatively simple definition that exhibits great complexity, especially as it is magnified. It is popular for its aesthetic appeal and fractal structures. The set is defined in the complex plane as the complex numbers for which the function does not diverge to infinity when iterated starting at , i.e., for which the sequence , , etc., remains bounded in absolute value.

<span class="mw-page-title-main">Fractal antenna</span> Antenna with a fractal shape

A fractal antenna is an antenna that uses a fractal, self-similar design to maximize the effective length, or increase the perimeter, of material that can receive or transmit electromagnetic radiation within a given total surface area or volume.

In mathematics, a fractal dimension is a term invoked in the science of geometry to provide a rational statistical index of complexity detail in a pattern. A fractal pattern changes with the scale at which it is measured. It is also a measure of the space-filling capacity of a pattern, and it tells how a fractal scales differently, in a fractal (non-integer) dimension.

<span class="mw-page-title-main">Cantor function</span> Continuous function that is not absolutely continuous

In mathematics, the Cantor function is an example of a function that is continuous, but not absolutely continuous. It is a notorious counterexample in analysis, because it challenges naive intuitions about continuity, derivative, and measure. Though it is continuous everywhere and has zero derivative almost everywhere, its value still goes from 0 to 1 as its argument reaches from 0 to 1. Thus, in one sense the function seems very much like a constant one which cannot grow, and in another, it does indeed monotonically grow.

<span class="mw-page-title-main">Iterated function system</span> Method for the construction of fractals

In mathematics, iterated function systems (IFSs) are a method of constructing fractals; the resulting fractals are often self-similar. IFS fractals are more related to set theory than fractal geometry. They were introduced in 1981.

<span class="mw-page-title-main">Minkowski's question-mark function</span> Function with unusual fractal properties

In mathematics, Minkowski's question-mark function, denoted ?(x), is a function with unusual fractal properties, defined by Hermann Minkowski in 1904. It maps quadratic irrational numbers to rational numbers on the unit interval, via an expression relating the continued fraction expansions of the quadratics to the binary expansions of the rationals, given by Arnaud Denjoy in 1938. It also maps rational numbers to dyadic rationals, as can be seen by a recursive definition closely related to the Stern–Brocot tree.

<span class="mw-page-title-main">Blancmange curve</span> Fractal curve resembling a blancmange pudding

In mathematics, the blancmange curve is a self-affine fractal curve constructible by midpoint subdivision. It is also known as the Takagi curve, after Teiji Takagi who described it in 1901, or as the Takagi–Landsberg curve, a generalization of the curve named after Takagi and Georg Landsberg. The name blancmange comes from its resemblance to a Blancmange pudding. It is a special case of the more general de Rham curve.

In mathematics, a de Rham curve is a continuous fractal curve obtained as the image of the Cantor space, or, equivalently, from the base-two expansion of the real numbers in the unit interval. Many well-known fractal curves, including the Cantor function, Cesàro–Faber curve, Minkowski's question mark function, blancmange curve, and the Koch curve are all examples of de Rham curves. The general form of the curve was first described by Georges de Rham in 1957.

<span class="mw-page-title-main">Coastline paradox</span> Counterintuitive observation that the coastline of a landmass does not have a well-defined length

The coastline paradox is the counterintuitive observation that the coastline of a landmass does not have a well-defined length. This results from the fractal curve–like properties of coastlines; i.e., the fact that a coastline typically has a fractal dimension. Although the "paradox of length" was previously noted by Hugo Steinhaus, the first systematic study of this phenomenon was by Lewis Fry Richardson, and it was expanded upon by Benoit Mandelbrot.

<span class="mw-page-title-main">Multifractal system</span> System with multiple fractal dimensions

A multifractal system is a generalization of a fractal system in which a single exponent is not enough to describe its dynamics; instead, a continuous spectrum of exponents is needed.

The Hurst exponent is used as a measure of long-term memory of time series. It relates to the autocorrelations of the time series, and the rate at which these decrease as the lag between pairs of values increases. Studies involving the Hurst exponent were originally developed in hydrology for the practical matter of determining optimum dam sizing for the Nile river's volatile rain and drought conditions that had been observed over a long period of time. The name "Hurst exponent", or "Hurst coefficient", derives from Harold Edwin Hurst (1880–1978), who was the lead researcher in these studies; the use of the standard notation H for the coefficient also relates to his name.

<span class="mw-page-title-main">Tricorn (mathematics)</span> Mandelbar Set

In mathematics, the tricorn, sometimes called the Mandelbar set, is a fractal defined in a similar way to the Mandelbrot set, but using the mapping instead of used for the Mandelbrot set. It was introduced by W. D. Crowe, R. Hasson, P. J. Rippon, and P. E. D. Strain-Clark. John Milnor found tricorn-like sets as a prototypical configuration in the parameter space of real cubic polynomials, and in various other families of rational maps.

<span class="mw-page-title-main">Misiurewicz point</span> Parameter in the Mandelbrot set

In mathematics, a Misiurewicz point is a parameter value in the Mandelbrot set and also in real quadratic maps of the interval for which the critical point is strictly pre-periodic. By analogy, the term Misiurewicz point is also used for parameters in a multibrot set where the unique critical point is strictly pre-periodic. This term makes less sense for maps in greater generality that have more than one free critical point because some critical points might be periodic and others not. These points are named after the Polish-American mathematician Michał Misiurewicz, who was the first to study them.

<span class="mw-page-title-main">Seven states of randomness</span> Extensions of the concept of randomness

The seven states of randomness in probability theory, fractals and risk analysis are extensions of the concept of randomness as modeled by the normal distribution. These seven states were first introduced by Benoît Mandelbrot in his 1997 book Fractals and Scaling in Finance, which applied fractal analysis to the study of risk and randomness. This classification builds upon the three main states of randomness: mild, slow, and wild.

Dynamic scaling is a litmus test that shows whether an evolving system exhibits self-similarity. In general a function is said to exhibit dynamic scaling if it satisfies:

References

  1. Mandelbrot, Benoit B. (1982). The Fractal Geometry of Nature, p.44. ISBN   978-0716711865.
  2. Mandelbrot, Benoit B. (5 May 1967). "How long is the coast of Britain? Statistical self-similarity and fractional dimension". Science . New Series. 156 (3775): 636–638. Bibcode:1967Sci...156..636M. doi:10.1126/science.156.3775.636. PMID   17837158. S2CID   15662830. Archived from the original on 19 October 2021. Retrieved 12 November 2020. PDF
  3. Hassan M. K., Hassan M. Z., Pavel N. I. (2011). "Dynamic scaling, data-collapseand Self-similarity in Barabasi-Albert networks". J. Phys. A: Math. Theor. 44 (17): 175101. arXiv: 1101.4730 . Bibcode:2011JPhA...44q5101K. doi:10.1088/1751-8113/44/17/175101. S2CID   15700641.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  4. Hassan M. K., Hassan M. Z. (2009). "Emergence of fractal behavior in condensation-driven aggregation". Phys. Rev. E. 79 (2): 021406. arXiv: 0901.2761 . Bibcode:2009PhRvE..79b1406H. doi:10.1103/physreve.79.021406. PMID   19391746. S2CID   26023004.
  5. Dayeen F. R., Hassan M. K. (2016). "Multi-multifractality, dynamic scaling and neighbourhood statistics in weighted planar stochastic lattice". Chaos, Solitons & Fractals. 91: 228. arXiv: 1409.7928 . Bibcode:2016CSF....91..228D. doi:10.1016/j.chaos.2016.06.006.
  6. Peitgen, Heinz-Otto; Jürgens, Hartmut; Saupe, Dietmar; Maletsky, Evan; Perciante, Terry; and Yunker, Lee (1991). Fractals for the Classroom: Strategic Activities Volume One, p.21. Springer-Verlag, New York. ISBN   0-387-97346-X and ISBN   3-540-97346-X.
  7. Peitgen, et al (1991), p.2-3.
  8. Comment j'ai découvert les fractales, Interview de Benoit Mandelbrot, La Recherche https://www.larecherche.fr/math%C3%A9matiques-histoire-des-sciences/%C2%AB-comment-jai-d%C3%A9couvert-les-fractales-%C2%BB
  9. Leland, W.E.; Taqqu, M.S.; et al. (January 1995). "On the self-similar nature of Ethernet traffic (extended version)" (PDF). IEEE/ACM Transactions on Networking. 2 (1): 1–15. doi:10.1109/90.282603. S2CID   6011907.
  10. Benoit Mandelbrot (February 1999). "How Fractals Can Explain What's Wrong with Wall Street". Scientific American.
  11. Campbell, Lo and MacKinlay (1991) "Econometrics of Financial Markets ", Princeton University Press! ISBN   978-0691043012
  12. Foote, Jonathan (30 October 1999). "Visualizing music and audio using self-similarity". Proceedings of the seventh ACM international conference on Multimedia (Part 1) (PDF). pp. 77–80. CiteSeerX   10.1.1.223.194 . doi:10.1145/319463.319472. ISBN   978-1581131512. S2CID   3329298. Archived (PDF) from the original on 9 August 2017.
  13. Pareyon, Gabriel (April 2011). On Musical Self-Similarity: Intersemiosis as Synecdoche and Analogy (PDF). International Semiotics Institute at Imatra; Semiotic Society of Finland. p. 240. ISBN   978-952-5431-32-2. Archived from the original (PDF) on 8 February 2017. Retrieved 30 July 2018. (Also see Google Books)

Self-affinity