Searcharxiv⌕ Search

arXiv · math/9811066

Continuum-sites stepping-stone models, coalescing exhcangeable partitions, and random trees

Abstract

Analogues of stepping--stone models are considered where the site--space is continuous, the migration process is a general Markov process, and the type--space is infinite. Such processes were defined in previous work of the second author by specifying a Feller transition semigroup in terms of expectations of suitable functionals for systems of coalescing Markov processes. An alternative representation is obtained here in terms of a limit of interacting particle systems. It is shown that, under a mild condition on the migration process, the continuum--sites stepping--stone process has continuous sample paths. The case when the migration process is Brownian motion on the circle is examined in detail using a duality relation between coalescing and annihilating Brownian motion. This duality relation is also used to show that a random compact metric space that is naturally associated to an infinite family of coalescing Brownian motions on the circle has Hausdorff and packing dimension both almost surely equal to 1/2 and, moreover, this space is capacity equivalent to the middle--1/2 Cantor set (and hence also to the Brownian zero set).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Donnelly, Steven N. Evans, Klaus Fleischmann, Thomas G. Kurtz, Xiaowen Zhou. 1998-11-10. Continuum-sites stepping-stone models, coalescing exhcangeable partitions, and random trees. https://arxiv.org/abs/math/9811066

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↗