52 citations · 224 across the 34 of their papers we have counts for
4 papers · 1 filter
Scaling Limits of Random Graphs from Subcritical Classes
Konstantinos Panagiotou, Benedikt Stufler, Kerstin Weller
We study the uniform random graph with vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \s…
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…
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…
Bootstrap percolation in inhomogeneous random graphs
Hamed Amini, Nikolaos Fountoulakis, Konstantinos Panagiotou
A bootstrap percolation process on a graph G is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every un…