48 citations · 169 across the 56 of their papers we have counts for
4 papers · 1 filter
On walk-regular graphs and graphs with symmetric hitting times
Agelos Georgakopoulos
Aldous [1] asked whether every graph in which the distribution of the return time of random is independent of the starting vertex must be transitive. We remark that this question c…
Delay colourings of cubic graphs
Agelos Georgakopoulos
In this note we prove the conjecture of \cite{HaWiWi} that every bipartite multigraph with integer edge delays admits an edge colouring with colours in the special case where…
A Tractable Variant of Cover Time
Agelos Georgakopoulos
We introduce a variant of the cover time of a graph, called cover cost, in which the cost of a step is proportional to the number of yet uncovered vertices. It turns out that cover…
The Liouville and the intersection properties are equivalent for planar graphs
Itai Benjamini, Nicolas Curien, Agelos Georgakopoulos
It is shown that if a planar graph admits no non-constant bounded harmonic functions then the trajectories of two independent simple random walks intersect almost surely.