20 citations · 75 across the 14 of their papers we have counts for
Showing 2017 · math.PRShow all
2 papers · 2 filters
math.PR2017★ 8 cited
Sharp threshold for -percolation
Brett Kolesnik
We locate the critical threshold at which it becomes likely that the complete graph can be obtained from the Erdős-Rényi graph by iteratively completin…
math.PR2017★ 8 cited
Large deviations for subcritical bootstrap percolation on the random graph
Omer Angel, Brett Kolesnik
We study atypical behavior in bootstrap percolation on the Erdős-Rényi random graph. Initially a set is infected. Other vertices are infected once at least of their neighbo…