SearcharxivSearch

arXiv subjects

Dinh-Toan Nguyen

Publications and source records attributed to Dinh-Toan Nguyen.

3 recordsLinked to original sources

Measure estimation on a manifold explored by a diffusion process

From the observation of a diffusion path $(X_t)_{t\in [0,T]}$ on a compact connected $d$-dimensional manifold $\mathcal{M}$ without boundary, we consider the problem of estimating the stationary measure $μ$ of the process. Wang and Zhu (2023) showed that for the Wasserstein metric $\mathcal{W}_2$ and for $d\geq 5$, the convergence rate of $T^{-1/(d-2)}$ is attained by the occupation measure of the path $(X_t)_{t\in [0,T]}$ when $(X_t)_{t\in [0,T]}$ is a Langevin diffusion. We extend their result in several directions. First, we show that the rate of convergence holds for a large class of diffusion paths, whose generators are uniformly elliptic. Second, the regularity of the density $p$ of the stationary measure $μ$ with respect to the volume measure of $\mathcal{M}$ can be leveraged to obtain faster estimators: when $p$ belongs to a Sobolev space of order $\ell\geq 2$, smoothing the occupation measure by convolution with a kernel yields an estimator whose rate of convergence is of order $T^{-(\ell+1)/(2\ell+d-2)}$. We further show that this rate is the minimax rate of estimation for this problem.

math.ST

Strong uniform convergence of Laplacians of random geometric and directed kNN graphs on compact manifolds

Consider $n$ points independently sampled from a density $p$ of class $\mathcal{C}^2$ on a smooth compact $d$-dimensional sub-manifold $\mathcal{M}$ of $\mathbb{R}^m$, and consider the generator of a random walk visiting these points according to a transition kernel $K$. We study the almost sure uniform convergence of this operator to the diffusive Laplace-Beltrami operator when $n$ tends to infinity. This work extends known results of the past 15 years. In particular, our result does not require the kernel $K$ to be continuous, which covers the cases of walks exploring $k$NN-random and geometric graphs, and convergence rates are given. The distance between the random walk generator and the limiting operator is separated into several terms: a statistical term, related to the law of large numbers, is treated with concentration tools and an approximation term that we control with tools from differential geometry. The convergence of $k$NN Laplacians is detailed.

math.PR

Scaling limit of the collision measures of multiple random walks

For an integer $k\ge 2$, let $S^{(1)}, S^{(2)}, \dots, S^{(k)}$ be $k$ independent simple symmetric random walks on $\mathbb{Z}$. A pair $(n,z)$ is called a collision event if there are at least two distinct random walks, namely, $S^{(i)},S^{(j)}$ satisfying $S^{(i)}_n= S^{(j)}_n=z$. We show that under the same scaling as in Donsker's theorem, the sequence of random measures representing these collision events converges to a non-trivial random measure on $[0,1]\times \mathbb{R}$. Moreover, the limit random measure can be characterized using Wiener chaos. The proof is inspired by methods from statistical mechanics, especially, by a partition function that has been developed for the study of directed polymers in random environments.

math.PR