52 citations · 224 across the 34 of their papers we have counts for
45 papers
Limit Laws for Consensus Protocols on the Complete Graph
Julian Becker, Konstantinos Panagiotou
We study a distributed consensus problem on a complete communication network of vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the…
Improved Universal Graphs for Trees
Julian Becker, Konstantinos Panagiotou, Matija Pasch
A graph is universal for a class of graphs , if, up to isomorphism, contains every graph in as a subgraph. In 1978, Chung and Graham asked for th…
Limit Laws for Critical Dispersion on Complete Graphs
Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou +1
We consider a synchronous process of particles moving on the vertices of a graph , introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, particles ar…
Colouring random graphs: Tame colourings
Annika Heckel, Konstantinos Panagiotou
Given a graph G, a colouring is an assignment of colours to the vertices of G so that no two adjacent vertices are coloured the same. If all colour classes have size at most t, the…
Dispersion on the Complete Graph
Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou
We consider a synchronous process of particles moving on the vertices of a graph , introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, particles ar…
Cluster Statistics in Expansive Combinatorial Structures
Konstantinos Panagiotou, Leon Ramzews
We develop a simple and unified approach to investigate several aspects of the cluster statistics of random expansive (multi-)sets. In particular, we determine the limiting distrib…