Search

Search Funnelback University

Search powered by Funnelback
21 - 40 of 44 search results for watson |u:www.statslab.cam.ac.uk
  1. Fully-matching results

  2. 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 Galton–Watson process) is arguably the most fundamentalstochastic model for population growth. ... Stigum, A limit theorem for multidi-mensional Galton–Watson
  3. 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. Galton–Watson trees with vanishing martingale limit, N.
  4. David George Kendall Probably taken around 1975 when DGK ...

    www.statslab.cam.ac.uk/~grg/papers/dgkUS.pdf
    8 Aug 2008: One might easily believe thathe accorded greater credit to the Reverend Henry William Watson for his foundingmembership of the Alpine Club than for his (incomplete) solution to the extinctionproblem for branching
  5. 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é–Galton–Watson process) is the most
  6. Liouville quantum gravity and the Brownian map

    www.statslab.cam.ac.uk/~jpm205/slides/lqg_tbm_equivalence_oxford_2015.pdf
    24 Oct 2015: Jason Miller (MIT). Liouville quantum gravity and the Brownian map. Jason Miller and Scott Sheffield. Cambridge and MIT. July 15, 2015. Jason Miller (Cambridge) LQG and TBM July 15, 2015 1 / 24. Overview. Part I: Picking surfaces at random. 1.
  7. Convergence of percolation on random quadrangulations

    www.statslab.cam.ac.uk/~jpm205/slides/percolation_convergence_oxford_may_2017.pdf
    1 Jun 2017: Convergence of percolation on randomquadrangulations. Jason Miller. Cambridge. Ewain Gwynne (MIT). May 22, 2017. Jason Miller (Cambridge) Convergence of percolation on random s May 22, 2017 1 / 28. Outline. Part I: Introduction — percolation and
  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. UNIVERSITY OF CAMBRIDGE Faculty of Mathematics SCHEDULES OF LECTURE…

    www.statslab.cam.ac.uk/~lab85/resources/schedules2324.pdf
    31 Oct 2023: UNIVERSITY OF CAMBRIDGE. Faculty of Mathematics. SCHEDULES OF LECTURE COURSES. AND FORM OF EXAMINATIONS. FOR THE MATHEMATICAL TRIPOS 2023-24. Revised 21 August 2023. TERM COURSES. 24 24 24 24 101 Vectors and Matrices Differential Equations Groups
  10. rctree.dvi

    www.statslab.cam.ac.uk/~grg/papers/USrctree.pdf
    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.
  11. 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 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
  12. UNIVERSITY OF CAMBRIDGE Faculty of Mathematics SCHEDULES OF LECTURE…

    www.statslab.cam.ac.uk/~lab85/resources/schedules1819.pdf
    2 May 2023: UNIVERSITY OF CAMBRIDGE. Faculty of Mathematics. SCHEDULES OF LECTURE COURSES. AND FORM OF EXAMINATIONS. FOR THE MATHEMATICAL TRIPOS 2018/2019. INTRODUCTION 1. THE MATHEMATICAL TRIPOS 2018–2019. CONTENTS. This booklet is the formal description of
  13. 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
  14. 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.
  15. 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
  16. Mathematical Foundations of Infinite-Dimensional Statistical Models

    www.statslab.cam.ac.uk/~nickl/Site/__files/FULLPDF.pdf
    25 Feb 2020: Mathematical Foundations of Infinite-DimensionalStatistical Models. In nonparametric and high-dimensional statistical models, the classical Gauss–Fisher–Le Cam theory of the optimality of maximum likelihood and Bayesianposterior inference does
  17. UNIVERSITY OF CAMBRIDGE Faculty of Mathematics SCHEDULES OF LECTURE…

    www.statslab.cam.ac.uk/~lab85/resources/schedules2021.pdf
    2 May 2023: UNIVERSITY OF CAMBRIDGE. Faculty of Mathematics. SCHEDULES OF LECTURE COURSES. AND FORM OF EXAMINATIONS. FOR THE MATHEMATICAL TRIPOS 2020/2021. INTRODUCTION 1. THE MATHEMATICAL TRIPOS 2020–2021. CONTENTS. This booklet is the formal description of
  18. 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].
  19. A Counterexample to a Conjecture on Optimal List Ordering

    www.statslab.cam.ac.uk/~rrw1/publications/Anderson%20-%20Nash%20-%20Weber%201982%20A%20counterexample%20to%20a%20conjecture%20in%20optimal%20list%20ordering.pdf
    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?
  20. UNIVERSITY OF CAMBRIDGE Faculty of Mathematics SCHEDULES OF LECTURE…

    www.statslab.cam.ac.uk/~lab85/resources/schedules1920.pdf
    2 May 2023: UNIVERSITY OF CAMBRIDGE. Faculty of Mathematics. SCHEDULES OF LECTURE COURSES. AND FORM OF EXAMINATIONS. FOR THE MATHEMATICAL TRIPOS 2019/2020. INTRODUCTION 1. THE MATHEMATICAL TRIPOS 2019–2020. CONTENTS. This booklet is the formal description of
  21. 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)

Related searches for watson |u:www.statslab.cam.ac.uk

Search history