Bootstrap percolation on the random graph Gn,p is a process of spread of “activation” on a given realization of the graph with a given number of initially active nodes. At each step those vertices… (More)

Bootstrap percolation on the random graph Gn,p is a process of spread of “activation” on a given realization of the graph with a given number of initially active nodes. At each step those vertices… (More)

Bootstrap percolation on the random graph Gn,p is a process of spread of “activation” on a given realization of the graph with a given number of initially active nodes. At each step those vertices… (More)

We study a random graph model which is a superposition of the bond percolation model on Zd with probability p of an edge, and a classical random graph G(n, c/n). We show that this model, being a… (More)

We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph,… (More)

We study a random graph model which combines properties of the edge percolation model on Zd and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a… (More)

Two preferential attachment type graph models which allow for dynamic addition/deletion of edges/vertices are considered. The focus of this paper is on the limiting expected degree of a fixed vertex.… (More)

Bootstrap percolation on a graph G is defined as the spread of activation or infection according to the following rule, with a given threshold r ≥ 2: We start with a set A(0) ⊆ V (G) of active… (More)