44 citations · 327 across the 39 of their papers we have counts for
3 papers · 1 filter
A time-invariant random graph with splitting events
Agelos Georgakopoulos, John Haslegrave
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming ed…
The Power of Two Choices for Random Walks
Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald +1
We apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving to a uniform random neighbour at each step, a controller is allowed to choose from two in…
Site percolation and isoperimetric inequalities for plane graphs
John Haslegrave, Christoforos Panagiotis
We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In th…