SearcharxivSearch

arXiv · 2308.01874

Convergence to the uniform distribution of vectors of partial sums modulo one with a common factor

Abstract

In this work, we prove the joint convergence in distribution of $q$ variables modulo one obtained as partial sums of a sequence of i.i.d. square integrable random variables multiplied by a common factor given by some function of an empirical mean of the same sequence. The limit is uniformy distributed over $[0,1]^q$. To deal with the coupling introduced by the common factor, we assume that the joint distribution of the random variables has a non zero component absolutely continuous with respect to the Lebesgue measure, so that the convergence in the central limit theorem for this sequence holds in total variation distance. While our result provides a generalization of Benford's law to a data adapted mantissa, our main motivation is the derivation of a central limit theorem for the stratified resampling mechanism, which is performed in the companion paper \cite{echant}.

Explore related subjects

Keep this discovery

BibTeXRIS

Roberta Flenghi, Benjamin Jourdain. 2023-08-03. Convergence to the uniform distribution of vectors of partial sums modulo one with a common factor. https://arxiv.org/abs/2308.01874

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR