Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Galton-Watson trees"”.

  1. Percolation On Galton-Watson Trees

    … both Bernoulli and invasion percolation on Galton-Watson trees. In the former case, we show that the quenched survival function is smooth on the supercritical window and smooth from the right at criticality. We also study critical percolation conditioned to reach depth $n$, and construct the …

    penn Repository record for Percolation On Galton-Watson Trees (opens in a new tab)

  2. Probability theory on Galton-Watson trees

    By a Galton-Watson tree T we mean an infinite rooted tree that starts with one node and where each node has a random number of children independently of the rest of the tree. In the first chapter of this thesis, we prove a conjecture made in [7] for Galton-Watson trees where vertices have bounded …

    mit Repository record for Probability theory on Galton-Watson trees (opens in a new tab)

  3. Extremal and probabilistic bootstrap percolation

    … of graphs, including grids, hypercubes and trees. Bootstrap percolation is one of the simplest cellular automata. The most widely studied model is the so-called r-neighbour bootstrap percolation, in which we consider the spread of infection on a graph G according to the following …

    cambridge Repository record for Extremal and probabilistic bootstrap percolation (opens in a new tab)

  4. Channel Comparison Methods and Statistical Problems on Graphs

    … relationship between random graphs and random Galton-Watson trees, we demonstrate that many important problems on these graphical models can be reduced to problems on trees. We apply various channel comparison methods to solve these tree problems, demonstrating that different methods are …

    mit Repository record for Channel Comparison Methods and Statistical Problems on Graphs (opens in a new tab)