English
Related papers

Related papers: Recursive functions on conditional Galton--Watson …

200 papers

We investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…

Probability · Mathematics 2007-05-23 Thomas Duquesne , Jean-Francois Le Gall

In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation…

Probability · Mathematics 2011-12-19 Pierre Andreoletti , Pierre Debs

For a tree Markov random field non-reconstruction is said to hold if as the depth of the tree goes to infinity the information that a typical configuration at the leaves gives about the value at the root goes to zero. The distribution of…

Discrete Mathematics · Computer Science 2011-07-28 Nayantara Bhatnagar , Elitza Maneva

We study survival properties of inhomogeneous Galton-Watson processes. We determine the so-called branching number (which is the reciprocal of the critical value for percolation) for these random trees (conditioned on being infinite), which…

Probability · Mathematics 2011-12-22 Erik Broman , Ronald Meester

Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…

Probability · Mathematics 2025-04-16 Jean Bertoin , Nicolas Curien , Armand Riera

We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees,…

Probability · Mathematics 2021-07-01 Svante Janson

We study the estimation of flows on trees, a structured generalization of isotonic regression. A tree flow is defined recursively as a positive flow value into a node that is partitioned into an outgoing flow to the children nodes, with…

Statistics Theory · Mathematics 2017-01-04 Sabyasachi Chatterjee , John Lafferty

Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…

Probability · Mathematics 2020-03-19 Tibor Mach , Anja Sturm , Jan M. Swart

Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…

Probability · Mathematics 2015-06-18 Jakob E. Björnberg , Sigurdur Örn Stefánsson

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

We prove singularity of some distributions of random continued fractions that correspond to iterated function systems with overlap and a parabolic point. These arose while studying the conductance of Galton-Watson trees.

Probability · Mathematics 2007-05-23 Russell Lyons

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

Combinatorics · Mathematics 2010-09-27 Omer Angel , Alexander E. Holroyd

We consider Galton-Watson trees with Geom$(p)$ offspring distribution. We let $T_{\infty}(p)$ denote such a tree conditioned on being infinite. We prove that for any $1/2\leq p_1 <p_2 \leq 1$, there exists a coupling between…

Probability · Mathematics 2015-02-27 Erik I. Broman

Take a continuous-time Galton-Watson tree. If the system survives until a large time $T$, then choose $k$ particles uniformly from those alive. What does the ancestral tree drawn out by these $k$ particles look like? Some special cases are…

Probability · Mathematics 2019-02-14 Simon C. Harris , Samuel G. G. Johnston , Matthew I. Roberts

We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than $\eps$, agrees up to generation $K$ with a regular $\mu$-ary tree, where $\mu$ is the essential minimum of the offspring distribution and…

Probability · Mathematics 2012-04-16 Nathanael Berestycki , Nina Gantert , Peter Morters , Nadia Sidorova

We characterize recurrence and transience of nonnegative multivariate autoregressive processes of order one with random contractive coefficient matrix, of subcritical multitype Galton-Watson branching processes in random environment with…

Probability · Mathematics 2016-10-18 Martin P. W. Zerner

We consider Galton-Watson trees with ${\rm Bin}(d,p)$ offspring distribution. We let $T_{\infty}(p)$ denote such a tree conditioned on being infinite. For $d=2,3$ and any $1/d\leq p_1 <p_2 \leq 1$, we show that there exists a coupling…

Probability · Mathematics 2014-03-20 Erik I. Broman

We study a genealogical model for continuous-state branching processes with immigration with a (sub)critical branching mechanism. This model allows the immigrants to be on the same line of descent. The corresponding family tree is an…

Probability · Mathematics 2008-02-13 Thomas Duquesne

We give a simple new proof of a theorem of Duquesne, stating that the properly rescaled contour function of a critical aperiodic Galton-Watson tree, whose offspring distribution is in the domain of attraction of a stable law of index…

Probability · Mathematics 2014-11-14 Igor Kortchemski

A tree functional is called additive if it satisfies a recursion of the form $F(T) = \sum_{j=1}^k F(B_j) + f(T)$, where $B_1,\ldots,B_k$ are the branches of the tree $T$ and $f(T)$ is a toll function. We prove a general central limit…

Combinatorics · Mathematics 2016-05-13 Dimbinaina Ralaivaosaona , Stephan Wagner
‹ Prev 1 3 4 5 6 7 10 Next ›