A spectral clustering-type algorithm for the consistent estimation of the Hurst distribution in moderately high dimensions
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringModel SelectionTime SeriesMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Spectral learning of multivariate extremes
We propose a spectral clustering algorithm for analyzing the dependence structure of multivariate extremes. More specifically, we focus on the asymptotic dependence of multivariate extremes characterized by the angular o…
ClusteringSpectral Clustering for Crowdsourcing with Inherently Distinct Task Types
The Dawid-Skene model is the most widely assumed model in the analysis of crowdsourcing algorithms that estimate ground-truth labels from noisy worker responses. In this work, we are motivated by crowdsourcing applicatio…
ClusteringVocal Bursts Type PredictionRobust path-based spectral clustering
Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. However, they are not robust enough again…
ClusteringImage SegmentationSegmentationSemantic SegmentationA Distributed Block Chebyshev-Davidson Algorithm for Parallel Spectral Clustering
We develop a distributed Block Chebyshev-Davidson algorithm to solve large-scale leading eigenvalue problems for spectral analysis in spectral clustering. First, the efficiency of the Chebyshev-Davidson algorithm relies …
ClusteringImproved Analysis of Spectral Algorithm for Clustering
Spectral algorithms are graph partitioning algorithms that partition a node set of a graph into groups by using a spectral embedding map. Clustering techniques based on the algorithms are referred to as spectral clusteri…
Clusteringgraph partitioning