SearcharxivSearch

arXiv · 2606.03122

Propagation of support for super-Brownian motion with general branching mechanism

Abstract

We study the spatial propagation of super-Brownian motion on $\mathbb{R}^d$ with general critical or subcritical (spatially dependent) branching mechanisms. Under local spatial lower bounds satisfying a Keller-Osserman type integrability condition, we establish a quantitative upper bound for the short-time probability that the support exits a prescribed neighborhood of its initial support. The estimate has a Gaussian-tail form and is obtained through weighted occupation times, Feynman-Kac representations, singular elliptic boundary blow-up estimates, and mild comparison arguments for log-Laplace equations. As an application, we derive the compact support property directly for spatially dependent branching mechanisms satisfying suitable local lower bounds. This yields a sufficient compact-support criterion expressed in terms of the inverse Keller integral. In particular, for spatially dependent super-Brownian motions with stable branching, we generalize the compact support results of Engl\"ander-Pinsky and Ren.

Explore related subjects

Keep this discovery

BibTeXRIS

Wenjing Zhang, Xiaowen Zhou. 2026-06-02. Propagation of support for super-Brownian motion with general branching mechanism. https://arxiv.org/abs/2606.03122

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