Search

24 Apr 2018: Galton–Watson trees with vanishing martingale limit.

4 Feb 2020: Problem 2. Suppose that τ is a Galton-Watson tree with Geometric(1/2) offspring distribution,viewed as a plane tree.

20 Apr 2012: For background on the critical Galton Watson tree conditioned to survive, see [16]. ... SeeCorollary 3.5 for a class of critical Galton-Watson trees with infinite variance.

22 Jan 2024: 42. 14 Branching processes. 14.1 Definition. A branching process or Galton–Watson process is a random process (Xn : n 0) with thefollowing structure:.

28 Jul 2015: Kozma5. Galton–Watson trees with vanishing martingale limit, N. Berestycki,. N. Gantert, P.

18 Oct 2021: Kesten and B. P. Stigum. Additional limit theorems for in-decomposable multidimensional Galton–Watson processes. ... A limit theorem for multidimen-sional Galton–Watson processes. Ann. Math. Statist., 37:1211–1223, 1966.

21 Nov 2018: Cutoff for Random Walk on Dynamical Erdős-Rényi Graph. Perla Sousi Sam Thomas. Abstract. We consider dynamical percolation on the complete graph Kn, where each edge refreshes itsstate at rate µ 1/n, and is then declared open with probability p =

28 Jul 2015: Kozma. 6. Galton–Watson trees with vanishing martingale limit, N. Berestycki,N. Gantert, P.

28 Jul 2015: Po(λ) Galton-Watson tree. The results extend to graphs with prescribeddegree sequences, where cutoff is shown both for the simple and for thenon-backtracking random walk. ... Berestycki, G. Kozma, Bull. Soc. Math. France. 33. Galton–Watson trees with

16 Jul 2016: Kozma, Bull. Soc. Math. France 143 (2015), 265–280. 52. Galton–Watson trees with vanishing martingale limit, N.

28 Jul 2015: Kozma, Bull. Soc. Math. France. 22. Galton–Watson trees with vanishing martingale limit, N.

20 Mar 2020: to the discretecase. Branching processes. The branching process (sometimes called the Galton–Watson process) is arguably the most fundamentalstochastic model for population growth. ... Stigum, A limit theorem for multidi-mensional Galton–Watson

23 Oct 2017: Kozma, Bull. Soc. Math. France 143 (2015), 265–280. 65. Galton–Watson trees with vanishing martingale limit, N.

15 Aug 2012: We consider a (Galton–Watson) branching process with family-size probabilitygenerating function G satisfying. ... Consider a multi-type (Galton–Watson) branching process with a set I of types;I may be finite or countably infinite.

13 Nov 2020: Harry Kesten’s work in probability theory 19. 6 Branching processes. The branching process (or, as Harry liked in later years to write, the Bienaymé–Galton–Watson process) is the most

2 Jul 2009: Remark 3.2. It is easily seen, using (3.3), that ξ̂ equals the extinctionprobability of a Galton–Watson process with offspring distribution. ... Notethat φS1(µ) = φ′S(µ).) Hence γ̂, the asymptotic relative size of Γn,λn/n;S,equals by (3.4)

15 Aug 2012: PERCOLATION ANDDISORDERED SYSTEMSGeorey GRIMMETT. 2PREFACEThis course aims to be a (nearly) self-contained account of part of the mathematicaltheory of percolation and related topics. The rst nine chapters summarise rigorousresults in percolation

15 Sep 2011: 563-584]. Bisexual Galton-Watson Branching Processes with Superadditive Mating Functions [pp. 585-600]. ... The Maximum in Critical Galton-Watson and Birth and Death Processes [pp.

15 Aug 2012: See Harris (1963)Ch. I; this book uses the more traditional name Galton–Watson process for thebranching process). ... is any Bienaymé–Galton–Watson branching process with the mean number γ of offspring per individualstrictly greater than 1, but

15 Aug 2012: PERCOLATION AND. DISORDERED SYSTEMS. Geoffrey GRIMMETT. Percolation and Disordered Systems 143. PREFACE. This course aims to be a (nearly) self-contained account of part of the math-ematical theory of percolation and related topics. The first nine

15 Sep 2011: Bisexual Galton-Watson Branching Processes with Superadditive Mating Functions [pp.585-600]. The Maximum in Critical Galton-Watson and Birth and Death Processes [pp.601-613].

15 Sep 2011: 500-509]. Asymptotic Properties of Subcritical Galton-Watson Processes [pp. 510-517]. How Many Random Digits Are Required until Given Sequences Are Obtained?

15 Aug 2012: PERCOLATION ANDDISORDERED SYSTEMS. Georey GRIMMETT. 2PREFACEThis course aims to be a (nearly) self-contained account of part of the mathematicaltheory of percolation and related topics. The rst nine chapters summarise rigorousresults in percolation