SearcharxivSearch

arXiv · 2603.07104

Stochastic analysis for the Dirichlet--Ferguson process

Abstract

We study a Dirichlet--Ferguson process $\zeta$ on a general phase space. First we reprove the chaos expansion from Peccati (2008), providing an explicit formula for the kernel functions. Then we proceed with developing a Malliavin calculus for $\zeta$. To this end we introduce a gradient, a divergence and a generator which act as linear operators on random variables or random fields and which are linked by some basic formulas such as integration by parts. While this calculus is strongly motivated by Malliavin calculus for isonormal Gaussian processes and the general Poisson process, the strong dependence properties of $\zeta$ require considerably more combinatorial efforts. We apply our theory to identify our generator as the generator of the Fleming--Viot process and to describe the associated Dirichlet form explicitly in terms of the chaos expansion. We also establish the product and chain chain rule for the gradient and an integral representation of the divergence. Finally we give a short direct proof of the Poincar\'e inequality.

Explore related subjects

Keep this discovery

BibTeXRIS

Günter Last, Babette Picker. 2026-03-07. Stochastic analysis for the Dirichlet--Ferguson process. https://arxiv.org/abs/2603.07104

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