Name
Abstract | ||
|---|---|---|
We investigate bootstrap percolation with infection threshold r>1 on the binomial k-uniform random hypergraph Hk(n,p) in the regime n−1≪nk−2p≪n−1/r, 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 k=2, we show that the probability of failure decreases exponentially. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2015.06.081 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
bootstrap percolation,random hypergraph,branching process | Discrete mathematics,Combinatorics,Vertex (geometry),Bootstrap percolation,Hypergraph,Probability of failure,Binomial,Constraint graph,Mathematics,Branching process | Journal |
Volume | ISSN | Citations |
49 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mihyun Kang | 1 | 163 | 29.18 |
| Christoph Koch | 2 | 0 | 0.34 |
| Tamás Makai | 3 | 3 | 2.17 |