Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1311.7595

The Characteristic Function of the Renormalized Intersection Local Time of the Planar Brownian Motion

Daniel Hoef
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article we study the distribution of the number of points of a simple random walk, visited a given number of times (the k-multiple point range). In a previous article we had developed a graph theoretical approach which is now extended from the closed to the the non restricted walk. Based on a study of the analytic properties of the first hit determinant a general method to define and calculate the generating functions of the moments of the distribution as analytical functions and express them as an absolutely converging series of graph contributions is given. So a method to calculate the moments for large length in any dimension d > 1 is developed. As an application the centralized moments of the distribution in two dimensions are completely calculated for the closed and the non restricted simple random walk in leading order with all logarithmic corrections of any order. As is well known we therefore have also calculated the characteristic function of the distribution of the renormalized intersection local time of the planar Brownian motion. It turns out to be closely related to the planar Phi-4 theory.

Explore related subjects

math.PR

Keep this discovery

BibTeXRIS

Daniel Hoef. 2013-11-29. The Characteristic Function of the Renormalized Intersection Local Time of the Planar Brownian Motion. https://arxiv.org/abs/1311.7595

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗