A spectral clustering-type algorithm for the consistent estimation of the Hurst distribution in moderately high dimensions
Not on the map. Why?
Abstract (arXiv)
Scale invariance (fractality) is a prominent feature of the large-scale behavior of many stochastic systems. In this work, we construct an algorithm for the statistical identification of the Hurst distribution (in particular, the scaling exponents) undergirding a high-dimensional fractal system. The algorithm is based on wavelet random matrices, modified spectral clustering and a model selection step for picking the value of the clustering precision hyperparameter. In a moderately high-dimensional regime where the dimension, the sample size and the scale go to infinity, we show that the algorithm consistently estimates the Hurst distribution. Monte Carlo simulations show that the proposed methodology is efficient for realistic sample sizes and outperforms another popular clustering method based on mixed-Gaussian modeling. We apply the algorithm in the analysis of real-world macroeconomic time series to unveil evidence for cointegration.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 110 references that are in the map. First posted on arXiv 30 Jan 2025.
Builds on
6 of 110 references.
References · 6
- 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 409
- 2022An Equivalence Principle for the Spectrum of Random Inner-Product Kernel Matrices with Polynomial Scalingscited by 27
- 2020Graph Laplacians, Riemannian Manifolds and their Machine-Learningcited by 12
- 2013Joint Estimation of Multiple Graphical Models from High Dimensional Time Seriescited by 7
- 2021Scale-invariant Learning by Physics Inversioncited by 6
- 2019Modeling Dynamic Functional Connectivity with Latent Factor Gaussian Processescited by 3
Built on by
Not cited yet.