Algorithm to estimate the Hurst exponent of high-dimensional fractals

Simple item page
dc.creatorCarbone, Anna
dc.date2007-11-19
dc.date.accessioned2026-07-07T08:43:43Z
dc.date.available2026-07-07T08:43:43Z
dc.descriptionWe propose an algorithm to estimate the Hurst exponent of high-dimensional fractals, based on a generalized high-dimensional variance around a moving average low-pass filter. As working examples, we consider rough surfaces generated by the Random Midpoint Displacement and by the Cholesky-Levinson Factorization algorithms. The surrogate surfaces have Hurst exponents ranging from 0.1 to 0.9 with step 0.1, and different sizes. The computational efficiency and the accuracy of the algorithm are also discussed.
dc.identifierhttps://arxiv.org/abs/0711.2892
dc.identifierhttp://arxiv.org/abs/0711.2892
dc.identifierPhys. Rev. E 76, 056703 (2007)
dc.identifierdoi:10.1103/PhysRevE.76.056703
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142415
dc.subjectStatistical Mechanics
dc.titleAlgorithm to estimate the Hurst exponent of high-dimensional fractals
dc.typetext

Files

Collections

arXiv