paper

Bootstrap percolation in random -uniform hypergraphs

arXiv:1704.07144 · doi:10.1016/j.endm.2015.06.081

Abstract

We investigate bootstrap percolation with infection threshold on the binomial -uniform random hypergraph in the regime , when the initial set of infected vertices is chosen uniformly at random from all sets of given size. We establish a threshold such that if there are less vertices in the initial set of infected vertices, then whp only a few additional vertices become infected, while if the initial set of infected vertices exceeds the threshold then whp almost every vertex becomes infected. In addition, for , we show that the probability of failure decreases exponentially.

arXiv commentExtended abstract presented at the European Conference on Combinatorics, Graph Theory and Applications 2015

References in corpus (3)

Cited by in corpus (2)