Related papers: Multivariate Central Limit Theorems for Random Cli…

In a recent work [2] with Datta, we introduced the mu vector (with respect to a given field) of simplicial complexes and used it to study tightness and lower bounds. In this paper, we modify the definition of mu vectors. With the new…

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…

We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the…

We study random compositions of transformations having certain uniform fiberwise properties and prove bounds which in combination with other results yield a quenched central limit theorem equipped with a convergence rate, also in the…

The angular bispectrum of spherical random fields has recently gained an enormous importance, especially in connection with statistical inference on cosmological data. In this paper, we provide expressions for its moments of arbitrary order…

The Central Limit Theorem (CLT) is one of the most fundamental results in statistics. It states that the standardized sample mean of a sequence of $n$ mutually independent and identically distributed random variables with finite first and…

Stochastic gradient algorithms are more and more studied since they can deal efficiently and online with large samples in high dimensional spaces. In this paper, we first establish a Central Limit Theorem for these estimates as well as for…

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

The problem of inferring the distribution of a random vector given that its norm is large requires modeling a homogeneous limiting density. We suggest an approach based on graphical models which is suitable for high-dimensional vectors. We…

We use the delta method and Stein's method to derive, under regularity conditions, explicit upper bounds for the distributional distance between the distribution of the maximum likelihood estimator (MLE) of a $d$-dimensional parameter and…

In this article we review recent generalisations of the central limit theorem for the sum of specially correlated (or q-independent) variables, focusing on q greater or equal than 1. Specifically, this kind of correlation turns the…

A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…

Ordinary differential equations obtained as limits of Markov processes appear in many settings. They may arise by scaling large systems, or by averaging rapidly fluctuating systems, or in systems involving multiple time-scales, by a…

Let F ($\nu$) be the centered Gamma law with parameter $\nu$ > 0 and let us denote by P Y the probability distribution of a random vector Y. We develop a multidimensional variant of the Stein's method for Gamma approximation that allows to…

A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…

Consider a simple random walk on a realization of an Erd\H{o}s-R\'enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture, we prove a Central Limit Theorem (CLT)…

This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. Under a generalised random dot product graph, the embedding provides uniformly…

We consider a class of elliptic random matrices which generalize two classical ensembles from random matrix theory: Wigner matrices and random matrices with iid entries. In particular, we establish a central limit theorem for linear…

We use tools from random matrix theory to study the multi-spiked tensor model, i.e., a rank-$r$ deformation of a symmetric random Gaussian tensor. In particular, thanks to the nature of local optimization methods used to find the maximum…

Computing homology and cohomology is at the heart of many recent works and a key issue for topological data analysis. Among homological objects, homology generators are useful to locate or understand holes (especially for geometric…