52 citations · 224 across the 34 of their papers we have counts for
17 papers · 1 filter
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…
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…
Mutual Information, Information-Theoretic Thresholds and the Condensation Phenomenon at Positive Temperature
Konstantinos Panagiotou, Matija Pasch
There is a vast body of recent literature on the reliability of communication through noisy channels, the recovery of community structures in the stochastic block model, the limiti…
Exact-size Sampling of Enriched Trees in Linear Time
Konstantinos Panagiotou, Leon Ramzews, Benedikt Stufler
Various combinatorial classes such as outerplanar graphs and maps, series-parallel graphs, substitution-closed classes of permutations and many more allow bijective encodings by so…
Asymptotic Enumeration and Limit Laws for Multisets: the Subexponential Case
Konstantinos Panagiotou, Leon Ramzews
For a given combinatorial class we study the class satisfying the multiset construction, that is, any object in $\mathcal{G…