48 citations · 169 across the 56 of their papers we have counts for
6 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…
Convergence of square tilings to the Riemann map
Agelos Georgakopoulos, Christoforos Panagiotis
A well-known theorem of Rodin \& Sullivan, previously conjectured by Thurston, states that the circle packing of the intersection of a lattice with a simply connected planar domain…
On the exponential growth rates of lattice animals and interfaces
Agelos Georgakopoulos, Christoforos Panagiotis
We introduce a formula for translating any upper bound on the percolation threshold of a lattice \g into a lower bound on the exponential growth rate of lattice animals and…
On planar Cayley graphs and Kleinian groups
Agelos Georgakopoulos
Let be a finitely generated group acting faithfully and properly discontinuously by homeomorphisms on a planar surface . We prove that admits such…
The planar Cayley graphs are effectively enumerable II
Agelos Georgakopoulos, Matthias Hamann
We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Plan…