SearcharxivSearch

arXiv · 1205.2137

Conditioning super-Brownian motion on its boundary statistics, and fragmentation

Abstract

We condition super-Brownian motion on "boundary statistics" of the exit measure $X_D$ from a bounded domain $D$. These are random variables defined on an auxiliary probability space generated by sampling from the exit measure $X_D$. Two particular examples are: conditioning on a Poisson random measure with intensity $\beta X_D$ and conditioning on $X_D$ itself. We find the conditional laws as $h$-transforms of the original SBM law using Dynkin's formulation of $X$-harmonic functions. We give explicit expression for the (extended) $X$-harmonic functions considered. We also obtain explicit constructions of these conditional laws in terms of branching particle systems. For example, we give a fragmentation system description of the law of SBM conditioned on $X_D=\nu$, in terms of a particle system, called the backbone. Each particle in the backbone is labeled by a measure $\tilde{\nu}$, representing its descendants' total contribution to the exit measure. The particle's spatial motion is an $h$-transform of Brownian motion, where $h$ depends on $\tilde{\nu}$. At the particle's death two new particles are born, and $\tilde{\nu}$ is passed to the newborns by fragmentation.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas S. Salisbury, A. Deniz Sezer. 2012-05-10. Conditioning super-Brownian motion on its boundary statistics, and fragmentation. https://doi.org/10.1214/12-aop778

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