SearcharxivSearch

arXiv · 1103.1839

Blowup and Conditionings of $ψ$-super Brownian Exit Measures

Abstract

We extend earlier results on conditioning of super-Brownian motion to general branching rules. We obtain representations of the conditioned process, both as an $h$-transform, and as an unconditioned superprocess with immigration along a branching tree. Unlike the finite-variance branching setting, these trees are no longer binary, and strictly positive mass can be created at branch points. This construction is singular in the case of stable branching. We analyze this singularity first by approaching the stable branching function via analytic approximations. In this context the singularity of the stable case can be attributed to blow up of the mass created at the first branch of the tree. Other ways of approaching the stable case yield a branching tree that is different in law. To explain this anomaly we construct a family of martingales whose backbones have multiple limit laws.

Explore related subjects

Keep this discovery

BibTeXRIS

Siva R. Athreya, Thomas S. Salisbury. 2011-03-09. Blowup and Conditionings of $ψ$-super Brownian Exit Measures. https://arxiv.org/abs/1103.1839

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