SearcharxivSearch

arXiv · 1302.0968

Local conditioning in Dawson-Watanabe superprocesses

Abstract

Consider a locally finite Dawson-Watanabe superprocess $\xi=(\xi_t)$ in $\mathsf{R}^d$ with $d\geq2$. Our main results include some recursive formulas for the moment measures of $\xi$, with connections to the uniform Brownian tree, a Brownian snake representation of Palm measures, continuity properties of conditional moment densities, leading by duality to strongly continuous versions of the multivariate Palm distributions, and a local approximation of $\xi_t$ by a stationary cluster $\tilde{\eta}$ with nice continuity and scaling properties. This all leads up to an asymptotic description of the conditional distribution of $\xi_t$ for a fixed $t>0$, given that $\xi_t$ charges the $\varepsilon$-neighborhoods of some points $x_1,\ldots,x_n\in \mathsf{R}^d$. In the limit as $\varepsilon\to0$, the restrictions to those sets are conditionally independent and given by the pseudo-random measures $\tilde{\xi}$ or $\tilde{\eta}$, whereas the contribution to the exterior is given by the Palm distribution of $\xi_t$ at $x_1,\ldots,x_n$. Our proofs are based on the Cox cluster representations of the historical process and involve some delicate estimates of moment densities.

Explore related subjects

Keep this discovery

BibTeXRIS

Olav Kallenberg. 2013-02-05. Local conditioning in Dawson-Watanabe superprocesses. https://doi.org/10.1214/11-aop702

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