The following pages link to Random disease on the square grid (Q4705343):
Displaying 41 items.
- The complexity of the bootstraping percolation and other problems (Q393154) (← links)
- On slowly percolating sets of minimal size in bootstrap percolation (Q396751) (← links)
- The time of bootstrap percolation with dense initial sets (Q400563) (← links)
- New bounds for contagious sets (Q418891) (← links)
- Linear algebra and bootstrap percolation (Q423652) (← links)
- A sharp threshold for a modified bootstrap percolation with recovery (Q478467) (← links)
- On the maximum running time in graph bootstrap percolation (Q528995) (← links)
- Bootstrap percolation on the random graph \(G_{n,p}\) (Q691111) (← links)
- Bootstrap percolation on the hypercube (Q818817) (← links)
- Bootstrap percolation in three dimensions (Q838001) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs (Q1650096) (← links)
- Sharp thresholds for contagious sets in random graphs (Q1650097) (← links)
- Neighborhood growth dynamics on the Hamming plane (Q1676791) (← links)
- Contagious sets in dense graphs (Q1678088) (← links)
- The maximum time of 2-neighbor bootstrap percolation: complexity results (Q1686067) (← links)
- A cube dismantling problem related to bootstrap percolation (Q1938846) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) (← links)
- On the spread of influence in graphs (Q2051833) (← links)
- Computing the probability of getting infected: on the counting complexity of bootstrap percolation (Q2086726) (← links)
- Minimum degree conditions for small percolating sets in bootstrap percolation (Q2185227) (← links)
- On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
- Smallest percolating sets in bootstrap percolation on grids (Q2213811) (← links)
- Threshold behavior of bootstrap percolation (Q2214063) (← links)
- Weak saturation numbers of complete bipartite graphs in the clique (Q2221831) (← links)
- Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs (Q2225448) (← links)
- Opinion forming in Erdős-Rényi random graph and expanders (Q2306607) (← links)
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581) (← links)
- Bootstrap percolation, and other automata (Q2403699) (← links)
- Dynamic monopolies in two-way bootstrap percolation (Q2416425) (← links)
- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results (Q2827810) (← links)
- On the Convexity of Paths of Length Two in Undirected Graphs (Q2839205) (← links)
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results (Q2945205) (← links)
- Deterministic bootstrap percolation on trees (Q5045263) (← links)
- Opinion Forming in Erdös-Rényi Random Graph and Expanders (Q5090994) (← links)
- Bootstrap and diffusion percolation transitions in three-dimensional lattices (Q5135043) (← links)
- Weakly saturated hypergraphs and a conjecture of Tuza (Q5889737) (← links)
- Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three (Q6077983) (← links)
- Weak saturation stability (Q6080367) (← links)
- New ordering methods to construct contagious sets and induced degenerate subgraphs (Q6102104) (← links)
