Total disconnectedness and percolation for the supports of super-tree random measures

Abstract

Super-tree random measures (STRMs) were introduced by Allouba, Durrett, Hawkes and Perkins as a simple stochastic model which emulates a superprocess at a fixed time. A STRM arises as the a.s. limit of a sequence of empirical measures for a discrete time particle system which undergoes independent supercritical branching and independent random displacement (spatial motion) of children from their parents. We study the connectedness properties of the closed support of a STRM (supp()) for a particular choice of random displacement. Our main results are distinct sufficient conditions for the a.s. total disconnectedness (TD) of supp(), and for percolation on supp() which will imply a.s. existence of a non-trivial connected component in supp(). We illustrate a close connection between a subclass of these STRM's and super-Brownian motion (SBM). For these particular STRM's the above results give a.s. TD of the support in three and higher dimensions and the existence of a non-trivial connected component in two dimensions, with the three-dimensional case being critical. The latter two-dimensional result assumes that pc(Z2), the critical probability for site percolation on Z2, is less than 1-e-1. (There is strong numerical evidence supporting this condition although the known rigorous bounds fall just short.) This gives evidence that the same connectedness properties should hold for SBM. The latter remains an interesting open problem in dimensions 2 and 3 ever since it was first posed by Don Dawson over 30 years ago.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…