Search

Search Funnelback University

Search powered by Funnelback
10 results 20 results 50 results
Relevance Date (Newest first) Date (Oldest first) Title (A-Z) Title (Z-A) Distance URL (A-Z) URL (Z-A) Shuffle
1 - 10 of 23 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: Galton–Watson 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 Galton–Watson 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. Galton–Watson trees with vanishing martingale limit, N. Berestycki,. N. Gantert, P.

  7. 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 Galton–Watson processes. ... A limit theorem for multidimen-sional Galton–Watson processes. Ann. Math. Statist., 37:1211–1223, 1966.

  8. 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 =

  9. 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. Galton–Watson trees with vanishing martingale limit, N. Berestycki,N. Gantert, P.

  10. 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. Galton–Watson trees with

  11. 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. Galton–Watson trees with vanishing martingale limit, N.

Refine your results

Date

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.