52 citations · 224 across the 34 of their papers we have counts for
15 papers · 1 filter
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…
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…
Expansive Multisets: Asymptotic Enumeration
Konstantinos Panagiotou, Leon Ramzews
Consider a non-negative sequence , where is slowly varying, , and . We investigate the coefficients of $G(x,…
Asymptotics for Pull on the Complete Graph
Konstantinos Panagiotou, Simon Reisser
We study the randomized rumor spreading algorithm \emph{pull} on complete graphs with vertices. Starting with one informed vertex and proceeding in rounds, each vertex yet unin…
Asymptotics for Push on the Complete Graph
Rami Daknama, Konstantinos Panagiotou, Simon Reisser
We study the popular randomized rumour spreading protocol Push. Initially, a node in a graph possesses some information, which is then spread in a round based manner. In each round…