19 citations · 44 across the 12 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.PR2016
A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs
Nikolaos Fountoulakis, Mihyun Kang, Christoph Koch +1
A bootstrap percolation process on a graph with infection threshold is a dissemination process that evolves in time steps. The process begins with a subset of infected ver…
math.CO2016
Jigsaw percolation on random hypergraphs
Béla Bollobás, Oliver Cooley, Mihyun Kang +1
The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff as a model of collaborative solutions of puzzles in social networks. Percolation…
math.PR2016★ 19 cited
Bootstrap percolation on geometric inhomogeneous random graphs
Christoph Koch, Johannes Lengler
Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process model…