Search arXivSearch

arXiv · 2002.00347

Limit theorems for loop soup random variables

Abstract

This article deals with limit theorems for certain loop variables for loop soups whose intensity approaches infinity. We first consider random walk loop soups on finite graphs and obtain a central limit theorem when the loop variable is the sum over all loops of the integral of each loop against a given one-form on the graph. An extension of this result to the noncommutative case of loop holonomies is also discussed. As an application of the first result, we derive a central limit theorem for windings of loops around the faces of a planar graphs. More precisely, we show that the winding field generated by a random walk loop soup, when appropriately normalized, has a Gaussian limit as the loop soup intensity tends to $\infty$, and we give an explicit formula for the covariance kernel of the limiting field. We also derive a Spitzer-type law for windings of the Brownian loop soup, i.e., we show that the total winding around a point of all loops of diameter larger than $\delta$, when multiplied by $1/\log\delta$, converges in distribution to a Cauchy random variable as $\delta \to 0$.

Explore related subjects

Keep this discovery

BibTeXRIS

Federico Camia, Yves Le Jan, Tulasi Ram Reddy. 2020-02-02. Limit theorems for loop soup random variables. https://arxiv.org/abs/2002.00347

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