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 “"Bootstrap Percolation"”.
-
Extremal and probabilistic bootstrap percolation
… several extremal and probabilistic problems in bootstrap percolation on various families 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 …
-
Four Problems in Probability and Optimization
This thesis studies bootstrap percolation, a problem in probability, as well as several topics in the application of sums of squares to combinatorial optimization. In the chapter on percolation, we bound the critical probability for bootstrap percolation on the Hamming torus, as well as the …
-
Diffusion in heterogeneous networks
… Specifically,we create a generalization of bootstrap percolation which incorporates any number of societies and an arbitrary weight matrix W. The code was created from the start to be as general as possible and to easily be modified with further complications. With it we simulate and analyze …
-
Extremal Combinatorics and Universal Algorithms
… The last topic we consider is a deterministic bootstrap percolation type problem. More specifically, we prove several extremal results about fast 2-neighbour percolation on the two dimensional grid.
-
Extremal results for graphs and hypergraphs and other combinatorial problems
… Erdős–Gyárfás function. In Chapter 8, we study bootstrap percolation for hypergraphs. Consider the process in which, given a fixed r-uniform hypergraph H and starting with a given n-vertex r-uniform hypergraph G, at each step we add to G all edges that create a new copy of H. We are interested …