Topological reconstruction of compact supports of dependent stationary random variables
Sadok Kallel, Sana Louhichi
TL;DR
This work develops a unified framework for topological reconstruction of the common support of dependent stationary vector sequences with compact, positive-reach supports. By combining a deterministic reconstruction theorem based on offsets and positive reach with probabilistic blocking techniques, the authors derive conditions under which finite samples are asymptotically (ε,α)-dense for a broad class of dependence structures, including m-dependent, m-approximable, β-mixing, and weakly dependent sequences, and apply these results to stationary Markov chains. In particular, explicit density bounds and sample-size thresholds are obtained for random difference equations and the Möbius Markov chain on the circle, with simulations confirming the topological recovery of the support (e.g., the circle). The framework thus extends manifold-learning-type reconstruction to dependent data, offering practical criteria for topology inference from correlated observations in diverse applications. The results bridge probabilistic dependence, geometric regularity via positive reach, and topological inference, enabling robust reconstruction of complex supports from real-world time series.
Abstract
In this paper we extend results on reconstruction of probabilistic supports of random i.i.d variables to supports of dependent stationary $\mathbb R^d$-valued random variables. All supports are assumed to be compact of positive reach in Euclidean space. Our main results involve the study of the convergence in the Hausdorff sense of a cloud of stationary dependent random vectors to their common support. A novel topological reconstruction result is stated, and a number of illustrative examples are presented. The example of the Möbius Markov chain on the circle is treated at the end with simulations.
