42 citations · 132 across the 20 of their papers we have counts for
Showing 2014 · math.PRShow all
2 papers · 2 filters
math.PR2014
Connectivity Thresholds for Bounded Size Rules
Hafsteinn Einarsson, Johannes Lengler, Konstantinos Panagiotou +2
In an Achlioptas process, starting with a graph that has n vertices and no edge, in each round edges are drawn uniformly at random, and using some rule exactly one of th…
math.PR2014
Bootstrap percolation with inhibition
Hafsteinn Einarsson, Johannes Lengler, Konstantinos Panagiotou +2
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in roun…