Search

Search Funnelback University

Search powered by Funnelback
51 - 61 of 61 search results for `Galton Watson`
  1. Fully-matching results

  2. notes.dvi

    www.statslab.cam.ac.uk/~grg/papers/USstflour.pdf
    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
  3. https://www.ccimi.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=https%3…

    https://www.ccimi.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=https%3A%2F%2Fwww.ccimi.maths.cam.ac.uk%2Fevents-archive%2Fthe-structure-of-extreme-level-sets-in-branching-brownian-motion%2F&format=xml
    Galton Watson process.
  4. 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
  5. https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=http…

    https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=https%3A%2F%2Farchive.cmih.maths.cam.ac.uk%2Fevents-archive%2Fdiffusion-processes-on-branching-brownian-motion%2F&format=xml
    branching according to a Galton Watson process.
  6. https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=http…

    https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=https%3A%2F%2Farchive.cmih.maths.cam.ac.uk%2Fevents-archive%2Flarge-degrees-yield-short-trees%2F&format=xml
    We use these results to obtain new height bounds on conditioned Bienaymé-Galton-Watson…Read more.
  7. https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=http…

    https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=https%3A%2F%2Farchive.cmih.maths.cam.ac.uk%2Fevents-archive%2Frandom-trees-conditioned-on-the-number-of-vertices-and-leaves%2F&format=xml
    of vertices and leaves I will talk about Galton-Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$.
  8. https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=http…

    https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=https%3A%2F%2Farchive.cmih.maths.cam.ac.uk%2Fevents-archive%2Fthe-structure-of-extreme-level-sets-in-branching-brownian-motion%2F&format=xml
    in Branching Brownian Motion Branching Brownian motion (BBM) is a classical process in probability, describing a population of particles performing independent Brownian motion and branching according to a Galton Watson process.
  9. https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=http…

    https://archive.cmih.maths.cam.ac.uk/wp-json/oembed/1.0/embed?url=https%3A%2F%2Farchive.cmih.maths.cam.ac.uk%2Fevents-archive%2Fscaling-limit-of-a-branching-process-in-a-varying-environment%2F&format=xml
    in a varying environment A branching process in varying environment is a Galton-Watson tree whose offspring distribution can change at each generation.
  10. 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.
  11. 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].
  12. 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?

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.