Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAlgorithm to estimate the Hurst exponent of high-dimensional fractals
125
0
0.0
(
0
)
Authors
Anna Carbone
Ask ChatGPT about the research
No Arabic abstract
We 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.
rate research
Read More
We present numerical measurements of the critical correlation length exponent nu in the three-dimensional fuse model. Using sufficiently broad threshold distributions to ensure that the system is the strong-disorder regime, we determine nu to be nu = 0.86 +/- 0.06 based on analyzing the fluctuations of the survival probability. The value we find for nu is very close to the percolation value 0.88 and we propose that the three-dimensional fuse model is in the universality class of ordinary percolation.
Efficiently controlling the trapping process, especially the trapping efficiency, is central in the study of trap problem in complex systems, since it is a fundamental mechanism for diverse other dynamic processes. Thus, it is of theoretical and practical significance to study the control technique for trapping problem. In this paper, we study the trapping problem in a family of proposed directed fractals with a deep trap at a central node. The directed fractals are a generalization of previous undirected fractals by introducing the directed edge weights dominated by a parameter. We characterize all the eigenvalues and their degeneracies for an associated matrix governing the trapping process. The eigenvalues are provided through an exact recursive relation deduced from the self-similar structure of the fractals. We also obtain the expressions for the smallest eigenvalue and the mean first-passage time (MFPT) as a measure of trapping efficiency, which is the expected time for the walker to first visit the trap. The MFPT is evaluated according to the proved fact that it is approximately equal to reciprocal of the smallest eigenvalue. We show that the MFPT is controlled by the weight parameter, by modifying which, the MFPT can scale superlinealy, linearly, or sublinearly with the system size. Thus, this work paves a way to delicately controlling the trapping process in the fractals.
We apply the Principle of Maximum Entropy to the study of a general class of deterministic fractal sets. The scaling laws peculiar to these objects are accounted for by means of a constraint concerning the average content of information in those patterns. This constraint allows for a new statistical characterization of fractal objects and fractal dimension.
The well-known Vicsek model describes the dynamics of a flock of self-propelled particles (SPPs). Surprisingly, there is no direct measure of the chaotic behavior of such systems. Here, we discuss the dynamical phase transition present in Vicsek systems in light of the largest Lyapunov exponent (LLE), which is numerically computed by following the dynamical evolution in tangent space for up to one million SPPs. As discontinuities in the neighbor weighting factor hinder the computations, we propose a smooth form of the Vicsek model. We find that there is chaotic behavior in the disordered phase, which supports the claim that the LLE can be useful as an indicator of phase transitions even for this out-of-equilibrium system.
Financial correlation matrices measure the unsystematic correlations between stocks. Such information is important for risk management. The correlation matrices are known to be ``noise dressed. We develop a new and alternative method to estimate this noise. To this end, we simulate certain time series and random matrices which can model financial correlations. With our approach, different correlation structures buried under this noise can be detected. Moreover, we introduce a measure for the relation between noise and correlations. Our method is based on a power mapping which efficiently suppresses the noise. Neither further data processing nor additional input is needed.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
