Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2012

Highly Cited

2012

Majority bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realisation of the… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A ⊂ V(G) is chosen independently at… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

By bootstrap percolation we mean the following deterministic process on a graph G. Given a set A of vertices "infected" at time 0… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2008

Highly Cited

2008

We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

The k-parameter bootstrap percolation on a graph is a model of an interacting particle system, which can also be viewed as a… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability $p… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Abstract. In the bootstrap percolation model, sites in an L by L square are initially independently declared active with… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

Bootstrap percolation models, or equivalently certain types of cellular automata, exhibit interesting finite-volume effects… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

We consider the problem of bootstrap percolation on a three-dimensional lattice and we study its finite size scaling behavior… Expand

Is this relevant?