This paper analyzes various questions pertaining to bootstrap percolation on the $d$-dimensional Hamming torus where each node is open with probability $p$ and the percolation threshold is 2. For each $d
The Hamming graph H(d, n) is the Cartesian product of d complete graphs on n vertices. Let be the de...
Consider a graph G and an initial random configuration, where each node is black with probability p ...
International audienceVe prove that the threhold regime for bootstrap percolation in a d-dimensional...
This paper analyzes various questions pertaining to bootstrap percolation on the $d$-dimens...
The Hamming torus of dimension $d$ is the graph with vertices $\{1,\dots,n\}^d$ and an edge...
By bootstrap percolation we mean the following deterministic process on a graph G. Given a set A of ...
In the standard bootstrap percolation on the d-dimensional grid double-struck G signnd, in the initi...
We study the percolation time of the r-neighbour bootstrap percolation model on the discrete torus (...
Let r σ N. In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initial...
In majority bootstrap percolation on a graph G, an infection spreads according to the following dete...
Graph bootstrap percolation is a deterministic cellular automaton which was introduced by Bollobás i...
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A ⊂ V(G) is ...
In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially \u27infec...
This dissertation considers a Turán-type problem in extremal graph theory and critical probabilities...
AbstractWe prove that the threshold regime for bootstrap percolation in a d-dimensional box of diame...
The Hamming graph H(d, n) is the Cartesian product of d complete graphs on n vertices. Let be the de...
Consider a graph G and an initial random configuration, where each node is black with probability p ...
International audienceVe prove that the threhold regime for bootstrap percolation in a d-dimensional...
This paper analyzes various questions pertaining to bootstrap percolation on the $d$-dimens...
The Hamming torus of dimension $d$ is the graph with vertices $\{1,\dots,n\}^d$ and an edge...
By bootstrap percolation we mean the following deterministic process on a graph G. Given a set A of ...
In the standard bootstrap percolation on the d-dimensional grid double-struck G signnd, in the initi...
We study the percolation time of the r-neighbour bootstrap percolation model on the discrete torus (...
Let r σ N. In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initial...
In majority bootstrap percolation on a graph G, an infection spreads according to the following dete...
Graph bootstrap percolation is a deterministic cellular automaton which was introduced by Bollobás i...
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A ⊂ V(G) is ...
In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially \u27infec...
This dissertation considers a Turán-type problem in extremal graph theory and critical probabilities...
AbstractWe prove that the threshold regime for bootstrap percolation in a d-dimensional box of diame...
The Hamming graph H(d, n) is the Cartesian product of d complete graphs on n vertices. Let be the de...
Consider a graph G and an initial random configuration, where each node is black with probability p ...
International audienceVe prove that the threhold regime for bootstrap percolation in a d-dimensional...
Add to ORKG