Related papers: A sharp threshold for a modified bootstrap percola…

For a graph $H$ and an $n$-vertex graph $G$, the $H$-bootstrap process on $G$ is the process which starts with $G$ and, at every time step, adds any missing edges on the vertices of $G$ that complete a copy of $H$. This process eventually…

We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a…

Bootstrap percolation models have been extensively studied during the two past decades. In this article, we study the following "anisotropic" bootstrap percolation model: the neighborhood of a point (m,n) is the set…

We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{Poisson}(\lambda)$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping.…

We study competing first passage percolation on graphs generated by the configuration model. At time 0, vertex 1 and vertex 2 are infected with the type 1 and the type 2 infection, respectively, and an uninfected vertex then becomes type 1…

The critical properties of a cellular automaton model describing the spreading of infection of the Herpes Simplex Virus in corneal tissue are investigated through the dynamic Monte Carlo method. The model takes into account different cell…

The quadratic contact process (QCP) is a natural extension of the well studied linear contact process where infected (1) individuals infect susceptible (0) neighbors at rate $\lambda$ and infected individuals recover ($1 \longrightarrow 0$)…

We introduce the heterogeneous-$k$-core, which generalizes the $k$-core, and contrast it with bootstrap percolation. Vertices have a threshold $k_i$ which may be different at each vertex. If a vertex has less than $k_i$ neighbors it is…

We study two-dimensional critical bootstrap percolation models. We establish that a class of these models including all isotropic threshold rules with a convex symmetric neighbourhood, undergoes a sharp metastability transition. This…

Percolation on complex networks has been used to study computer viruses, epidemics, and other casual processes. Here, we present conditions for the existence of a network specific, observation dependent, phase transition in the updated…

We show existence of a non-trivial phase transition for the contact process, a simple model for infection without immunity, on a network which reacts dynamically to the infection trying to prevent an epidemic. This network initially has the…

Bootstrap percolation is a well-known model to study the spreading of rumors, new products or innovations on social networks. The empirical studies show that community structure is ubiquitous among various social networks. Thus, studying…

We consider Susceptible-Infected-Recovered (SIR) models on dense dynamic random graphs, in which the joint dynamics of vertices and edges are co-evolutionary, i.e., they influence each other bidirectionally. In particular, edges appear and…

Stochastic infection processes are continuous-time Markov chains on graphs that assign each vertex one of multiple states, such as susceptible, infected, or recovered. Depending on the model, vertices change their state based on random…

We study an extremal question for the (reversible) $r-$bootstrap percolation processes. Given a graph and an initial configuration where each vertex is active or inactive, in the $r-$bootstrap percolation process the following rule is…

An irreversible $k$-threshold process (also a $k$-neighbor bootstrap percolation) is a dynamic process on a graph where vertices change color from white to black if they have at least $k$ black neighbors. An irreversible $k$-conversion set…

We develop the theory of the k-core (bootstrap) percolation on uncorrelated random networks with arbitrary degree distributions. We show that the k-core percolation is an unusual, hybrid phase transition with a jump emergence of the k-core…

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…

First passage percolation with recovery is a process aimed at modeling the spread of epidemics. On a graph $G$ place a red particle at a reference vertex $o$ and colorless particles (seeds) at all other vertices. The red particle starts…