For any set of N points in an m-dimensional space
where then the correlation integral is calculated by:
where is the total number of pairs of points which have a distance between them that is less than distance (a graphical representation of such close pairs is the recurrence plot). As the number of points tends to infinity, and the distance between them tends to zero, the correlation integral, for small values of , will take the form:
If the number of points is sufficiently large, and evenly distributed, a Log-log graph of the correlation integral versus will yield an estimate of ν. This idea can be qualitatively understood by realizing that for higher dimensional objects, there will be more ways for points to be close to each other, and so the number of pairs close to each other will rise more rapidly for higher dimensions.
Grassberger and Procaccia introduced the technique in 1983; the article gives the results of such estimates for a number of fractal objects, as well as comparing the values to other measures of fractal dimension. The technique can be used to distinguish between chaotic and truly random behavior. As another example, in the "Sun in Time" article, the method was used to show that the number of sunspots on the sun, after accounting for the known cycles such as the daily and 11-year cycles, is very likely not random noise, but rather chaotic noise, with a low-dimensional fractal attractor.
See also
References
This article is licensed under the GNU Free Documentation License.
Last updated on Thursday July 03, 2008 at 14:36:42 PDT (GMT -0700)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation
Copyright © 2009, Dictionary.com, LLC. All rights reserved.