English
Related papers

Related papers: On the genealogy on conditioned stable L\'evy fore…

200 papers

We consider branching random walks built on Galton--Watson trees with offspring distribution having a bounded support, conditioned to have $n$ nodes, and their rescaled convergences to the Brownian snake. We exhibit a notion of ``globally…

Probability · Mathematics 2008-01-28 Jean-François Marckert

We consider a population with non-overlapping generations, whose size goes to infinity. It is described by a discrete genealogy which may be time non-homogeneous and we pay special attention to branching trees in varying environments. A…

Probability · Mathematics 2013-05-22 Vincent Bansaye , Chunmao Huang

We consider sequences of tree-valued Markov chains that describe evolving genealogies in Cannings models, and we show their convergence in distribution to tree-valued Fleming-Viot processes. Under the conditions of M\"ohle and Sagitov, this…

Probability · Mathematics 2017-02-27 Stephan Gufler

Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…

Probability · Mathematics 2015-10-19 Itai Benjamini , Eric Foxall , Ori Gurel-Gurevich , Matthew Junge , Harry Kesten

We study the genealogy of a sample of $k$ individuals taken uniformly without replacement from a continuous-time multitype Bienaym\'e--Galton--Watson process at fixed times. Our results are quite general, requiring only that the process be…

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

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 show that the number of copies of a given rooted tree in a conditioned Galton-Watson tree satisfies a law of large numbers under a minimal moment condition on the offspring distribution.

Probability · Mathematics 2020-11-10 Svante Janson

This paper deals with branching processes in varying environment, namely, whose offspring distributions depend on the generations. We provide sufficient conditions for survival or extinction which rely only on the first and second moments…

Probability · Mathematics 2017-09-29 Daniela Bertacchi , Pablo M. Rodriguez , Fabio Zucca

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

Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…

Probability · Mathematics 2017-09-28 Romain Abraham , Aymen Bouaziz , Jean-François Delmas

We study biased random walk on subcritical and supercritical Galton-Watson trees conditioned to survive in the transient, sub-ballistic regime. By considering offspring laws with infinite variance, we extend previously known results for the…

Probability · Mathematics 2016-05-18 Adam Bowditch

We consider a random walk with a negative drift and with a jump distribution which under Cram\'er's change of measure belongs to the domain of attraction of a spectrally positive stable law. If conditioned to reach a high level and suitably…

Probability · Mathematics 2012-08-20 Sergey G. Foss , Anatolii A. Puhalskii

We are interested in modeling Darwinian evolution resulting from the interplay of phenotypic variation and natural selection through ecological interactions. The population is modeled as a stochastic point process whose generator captures…

Probability · Mathematics 2011-02-01 Benjamin Jourdain , Sylvie Méléard , Wojbor Woyczynski

Tree-structured data naturally appear in various fields, particularly in biology where plants and blood vessels may be described by trees, but also in computer science because XML documents form a tree structure. This paper is devoted to…

Statistics Theory · Mathematics 2019-04-09 Romain Azaïs , Alexandre Genadot , Benoît Henry

We provide a simple forest model to encode the genealogical structure of a multitype Galton-Watson process with immigration. We provide two encodings of these forests by stochastic processes. We show, under appropriate conditions, the…

Probability · Mathematics 2021-05-10 David Clancy

Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…

Probability · Mathematics 2007-05-23 Amir Dembo , Peter Morters , Scott Sheffield

We study the heavy path decomposition of conditional Galton-Watson trees. In a standard Galton-Watson tree conditional on its size $n$, we order all children by their subtree sizes, from large (heavy) to small. A node is marked if it is…

Probability · Mathematics 2017-01-11 Luc Devroye , Cecilia Holmgren , Henning Sulzbach

Drmota and Gittenberger (1997) proved a conjecture due to Aldous (1991) on the height profile of a Galton-Watson tree with an offspring distribution of finite variance, conditioned on a total size of $n$ individuals. The conjecture states…

Probability · Mathematics 2011-01-20 Götz Kersting

By decomposing the random walk path, we construct a multitype branching process with immigration in random environment for corresponding random walk with bounded jumps in random environment. Then we give two applications of the branching…

Probability · Mathematics 2010-03-22 Wenming Hong , Huaming Wang

We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…

Probability · Mathematics 2012-05-03 Alan Hammond