Search

Search Funnelback University

Search powered by Funnelback
1 - 20 of 22 search results for `Galton Watson` |u:www.statslab.cam.ac.uk
  1. Fully-matching results

  2. RaG publications

    www.statslab.cam.ac.uk/~grg/rag-pubs.html
    24 Apr 2018: GaltonWatson trees with vanishing martingale limit.
  3. RANDOM PLANAR GEOMETRY, LENT 2020, EXAMPLE SHEET 1 Please ...

    www.statslab.cam.ac.uk/~jpm205/teaching/lent2020/example_sheet1.pdf
    4 Feb 2020: Problem 2. Suppose that τ is a Galton-Watson tree with Geometric(1/2) offspring distribution,viewed as a plane tree.
  4. Collisions of Random Walks Martin T. Barlow∗ Yuval Peres† ...

    www.statslab.cam.ac.uk/~ps422/collisions-rws.pdf
    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.
  5. Probability J.R. Norris January 22, 2024 1 Contents 1 ...

    www.statslab.cam.ac.uk/~james/Lectures/p.pdf
    22 Jan 2024: 42. 14 Branching processes. 14.1 Definition. A branching process or GaltonWatson process is a random process (Xn : n 0) with thefollowing structure:.
  6. NEW FRONTIERS IN RANDOM GEOMETRY (RaG) EP/103372X/1 REPORT 1/9/11 ...

    www.statslab.cam.ac.uk/~grg/rag-reports/report2012.pdf
    28 Jul 2015: Kozma5. GaltonWatson trees with vanishing martingale limit, N. Berestycki,. N. Gantert, P.
  7. Optimal Search for a Randomly Moving Object

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%201986%20Optimal%20search%20for%20a%20randomly%20moving%20object.pdf
    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.
  8. PUBLICATIONS OF HARRY KESTEN 1950 1960 1970 1980 1990 ...

    www.statslab.cam.ac.uk/~grg/papers/kesten-bib.pdf
    18 Oct 2021: Kesten and B. P. Stigum. Additional limit theorems for in-decomposable multidimensional GaltonWatson processes. ... A limit theorem for multidimen-sional GaltonWatson processes. Ann. Math. Statist., 37:1211–1223, 1966.
  9. Cutoff for Random Walk on Dynamical Erdős-Rényi Graph Perla ...

    www.statslab.cam.ac.uk/~ps422/ER_Annealed.pdf
    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 =
  10. NEW FRONTIERS IN RANDOM GEOMETRY (RaG) EP/103372X/1 REPORT 1/7/12 ...

    www.statslab.cam.ac.uk/~grg/rag-reports/report2013.pdf
    28 Jul 2015: Kozma. 6. GaltonWatson trees with vanishing martingale limit, N. Berestycki,N. Gantert, P.
  11. NEW FRONTIERS IN RANDOM GEOMETRY (RaG) EP/103372X/1 REPORT 1/7/14 ...

    www.statslab.cam.ac.uk/~grg/rag-reports/report2015.pdf
    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. GaltonWatson trees with
  12. NEW FRONTIERS IN RANDOM GEOMETRY (RaG)EP/I03372X/1 REPORT 1/7/15 – ...

    www.statslab.cam.ac.uk/~grg/rag-reports/report2016.pdf
    16 Jul 2016: Kozma, Bull. Soc. Math. France 143 (2015), 265–280. 52. GaltonWatson trees with vanishing martingale limit, N.
  13. NEW FRONTIERS IN RANDOM GEOMETRY (RaG)EP/103372X/1 REPORT 1/7/13 – ...

    www.statslab.cam.ac.uk/~grg/rag-reports/report2014.pdf
    28 Jul 2015: Kozma, Bull. Soc. Math. France. 22. GaltonWatson trees with vanishing martingale limit, N.
  14. Harry Kesten (1931–2019) A personal and scientific tribute Geoffrey…

    www.statslab.cam.ac.uk/~grg/papers/kesten-ams3-small.pdf
    20 Mar 2020: to the discretecase. Branching processes. The branching process (sometimes called the GaltonWatson process) is arguably the most fundamentalstochastic model for population growth. ... Stigum, A limit theorem for multidi-mensional GaltonWatson
  15. NEW FRONTIERS IN RANDOM GEOMETRY (RaG)EP/I03372X/1 REPORT 1/7/16 – ...

    www.statslab.cam.ac.uk/~grg/rag-reports/report2017.pdf
    23 Oct 2017: Kozma, Bull. Soc. Math. France 143 (2015), 265–280. 65. GaltonWatson trees with vanishing martingale limit, N.
  16. Abstract We survey the published work of Harry Kesten ...

    www.statslab.cam.ac.uk/~grg/papers/kesten-ptrf-final.pdf
    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é–GaltonWatson process) is the most
  17. 2 Jul 2009: Remark 3.2. It is easily seen, using (3.3), that ξ̂ equals the extinctionprobability of a GaltonWatson process with offspring distribution. ... Notethat φS1(µ) = φ′S(µ).) Hence γ̂, the asymptotic relative size of Γn,λn/n;S,equals by (3.4)
  18. notes.dvi

    www.statslab.cam.ac.uk/~grg/papers/USrednotes.pdf
    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
  19. elec.dvi

    www.statslab.cam.ac.uk/~grg/papers/USelec.pdf
    15 Aug 2012: See Harris (1963)Ch. I; this book uses the more traditional name GaltonWatson process for thebranching process). ... is any Bienaymé–GaltonWatson branching process with the mean number γ of offspring per individualstrictly greater than 1, but
  20. J. Appl. Prob. 23, 841-847 (1986) Printed in Israel ...

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%20Varaiya%20Walrand%201986%20Scheduling%20jobs%20with%20stochastically%20ordered%20processing%20requirements%20to%20minimize%20expected%20flowtime.pdf
    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].
  21. notes-reprint2012.dvi

    www.statslab.cam.ac.uk/~grg/papers/notes-reprint2012.pdf
    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

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Your search history is empty.