1 citations · 2 across the 5 of their papers we have counts for
6 papers
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,…
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…
Simply Generated Unrooted Plane Trees
Leon Ramzews, Benedikt Stufler
We study random unrooted plane trees with vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of…
Asymptotic Enumeration of Graph Classes with Many Components
Konstantinos Panagiotou, Leon Ramzews
We consider graph classes in which every graph has components in a class of connected graphs. We provide a framework for the asymptotic study of $\lvert\…