English
Related papers

Related papers: A Gibbsian random tree with nearest neighbour inte…

200 papers

We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…

Probability · Mathematics 2016-03-07 Alexey Lindo , Serik Sagitov

We consider a system of real-valued spins interacting with each other through a mean-field Hamiltonian that depends on the empirical magnetization of the spins via a general potential. The system is subjected to a stochastic dynamics where…

Probability · Mathematics 2014-10-29 Frank den Hollander , Frank Redig , Willem van Zuijlen

As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…

Probability · Mathematics 2011-01-24 Gerard Ben Arous , Alan Hammond

We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…

Probability · Mathematics 2018-08-14 Yevgeniy Kovchegov , Ilya Zaliapin

We study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution…

Probability · Mathematics 2014-11-14 Nicolas Curien , Igor Kortchemski

We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph. In particular, each vertex can be either infected or…

Probability · Mathematics 2026-01-21 Zsolt Bartha , Júlia Komjáthy , Daniel Valesin

We consider an interacting particle system on trees known as the frog model: initially, a single active particle begins at the root and i.i.d.~$\mathrm{Poiss}(\lambda)$ many inactive particles are placed at each non-root vertex. Active…

Probability · Mathematics 2024-01-24 Marcus Michelen , Josh Rosenberg

We consider the biased random walk on a critical Galton-Watson tree conditioned to survive, and confirm that this model with trapping belongs to the same universality class as certain one-dimensional trapping models with slowly-varying…

Probability · Mathematics 2012-03-20 David A. Croydon , Alexander Fribergh , Takashi Kumagai

We study the exploration (or height) process of a continuous time non-binary Galton-Watson random tree, in the subcritical, critical and supercritical cases. Thus we consider the branching process in continuous time (Z_{t})_{t\geq 0}, which…

Probability · Mathematics 2016-02-08 Ibrahima Dramé , Etienne Pardoux , Ahmadou Bamba Sow

We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…

Probability · Mathematics 2014-09-08 Louigi Addario-Berry , Nicolas Broutin , Cecilia Holmgren

We introduce multi-type Markov Branching trees, which are simple random population tree models where individuals are characterized by their size and type and give rise to (size,type)-children in a Galton-Watson fashion, with the rule that…

Probability · Mathematics 2019-12-17 Bénédicte Haas , Robin Stephenson

We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with…

Probability · Mathematics 2014-12-08 Xin He

Consider the supercritical branching random walk on the real line in the boundary case and the associated Gibbs measure $\nu_{n,\beta}$ on the $n^\text{th}$ generation, which is also the polymer measure on a disordered tree with inverse…

Probability · Mathematics 2017-03-30 Michel Pain

We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in…

Probability · Mathematics 2011-12-05 Svante Janson

The goal of this article is to contribute towards the conceptual and quantitative understanding of the evolutionary benefits for (microbial) populations to maintain a seed bank (consisting of dormant individuals) when facing fluctuating…

Probability · Mathematics 2024-07-02 Jochen Blath , Felix Hermann , Martin Slowik

In this paper we study random partitions of 1,...n, where every cluster of size j can be in any of w\_j possible internal states. The Gibbs (n,k,w) distribution is obtained by sampling uniformly among such partitions with k clusters. We…

Probability · Mathematics 2007-05-23 Nathanael Berestycki , Jim Pitman

By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…

Statistical Mechanics · Physics 2007-05-23 L. Pal

We study the genealogies of samples of $k$ distinguished particles drawn from the population alive at some fixed time in a continuous-time multitype Bienaym\'e-Galton-Watson (MBGW) process under two different type dependent sampling…

Probability · Mathematics 2026-05-15 Osvaldo Angtuncio Hernández , Simon C. Harris , Juan Carlos Pardo

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

Probability · Mathematics 2025-09-30 George Andriopoulos

We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…

Probability · Mathematics 2025-08-06 Benedikt Jahnel , Lukas Lüchtrath , Christian Mönch