Leon Ramzews

activity

20182022

most citedAsymptotic Enumeration of Graph Classes with Many Components

1 citations · 2 across the 3 of their papers we have counts for

collaborators

5 papers

math.PR2022

Expansive Multisets: Asymptotic Enumeration

Konstantinos Panagiotou, Leon Ramzews

Consider a non-negative sequence $c_{n} = h (n) \cdot n^{α - 1} \cdot ρ^{- n}$ , where $h$ is slowly varying, $α > 0$ , $0 < ρ < 1$ and $n \in N$ . We investigate the coefficients of $G(x,…

math.CO2021★ 1 cited

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…

math.CO2020

Asymptotic Enumeration and Limit Laws for Multisets: the Subexponential Case

Konstantinos Panagiotou, Leon Ramzews

For a given combinatorial class $C$ we study the class $G = MSET (C)$ satisfying the multiset construction, that is, any object in $\mathcal{G…

math.PR2018

Simply Generated Unrooted Plane Trees

Leon Ramzews, Benedikt Stufler

We study random unrooted plane trees with $n$ vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of…

math.CO2018★ 1 cited

Asymptotic Enumeration of Graph Classes with Many Components

Konstantinos Panagiotou, Leon Ramzews

We consider graph classes $G$ in which every graph has components in a class $C$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\…