Searcharxiv⌕ Search

arXiv · math/9809115

Finite time extinction of super-Brownian motions with catalysts

Abstract

Consider a catalytic super-Brownian motion $X=X^Γ$ with finite variance branching. Here `catalytic' means that branching of the reactant $X$ is only possible in the presence of some catalyst. Our intrinsic example of a catalyst is a stable random measure $Γ$ on $R$ of index $0< gamma <1$. Consequently, here the catalyst is located in a countable dense subset of $R$. Starting with a finite reactant mass $X_0$ supported by a compact set, $X$ is shown to die in finite time. Our probabilistic argument uses the idea of good and bad historical paths of reactant `particles' during time periods $[T_{n},T_{n+1})$. Good paths have a significant collision local time with the catalyst, and extinction can be shown by individual time change according to the collision local time and a comparison with Feller's branching diffusion. On the other hand, the remaining bad paths are shown to have a small expected mass at time $T_{n+1}$ which can be controlled by the hitting probability of point catalysts and the collision local time spent on them.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Donald A. Dawson, Klaus Fleischmann, Carl Mueller. 1998-09-21. Finite time extinction of super-Brownian motions with catalysts. https://arxiv.org/abs/math/9809115

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the minimum bisection of random $3$-regular graphs

In this paper we give new bounds on the bisection width of random 3-regular graphs on $n$ vertices. The main contribution is a new lower bound of $0.103295n$ based on a first moment method together with a structural analysis of the graph, thereby improving a 27-year-old result of Kostochka and Melnikov. We also give a complementary upper bound of $0.139822n$ by combining a result of Lyons with original combinatorial insights. Developping this approach further, we obtain a non-rigorous improved upper bound with the help of Monte Carlo simulations.

math.PR↗

Quantitative Propagation of Chaos for Singular Interacting Particle Systems Driven by Fractional Brownian Motion

We consider interacting systems particle driven by i.i.d. fractional Brownian motions, subject to irregular, possibly distributional, pairwise interactions. We show propagation of chaos and mean field convergence to the law of the associated McKean--Vlasov equation, as the number of particles $N\to\infty$, with quantitative sharp rates of order $N^{-1/2}$. Our results hold for a wide class of possibly time-dependent interactions, which are only assumed to satisfy a Besov-type regularity, related to the Hurst parameter $H\in (0,+\infty)\setminus \mathbb{N}$ of the driving noises. In particular, as $H$ decreases to $0$, interaction kernels of arbitrary singularity can be considered, a phenomenon frequently observed in regularization by noise results. Our proofs rely on a combinations of Sznitman's direct comparison argument with stochastic sewing techniques.

math.PR↗

Power rate of convergence of discrete curves: framework and applications

We develop a framework for power-law rates of convergence of random discrete curves to Schramm Loewner Evolution (SLE). We show that a power-law rate of convergence of a suitable martingale observable gives a power-law rate of convergence of the interface to SLE, provided the discrete curves satisfy the Kemppainen-Smirnov crossing condition; the proof uses known estimates on the derivative of the SLE map. We apply the framework to the exploration process of critical site percolation on the triangular lattice, obtaining a power-law rate of convergence to SLE$_6$.

math.PR↗