LRLeon Ramzews
Leon Ramzews
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Leon Ramzews has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Konstantinos Panagiotou
Department of Mathematics University of Munich Theresienstraße 39 80333 Munich Germany
2 shared publications
Latest Publications
- Open Access
Asymptotic Enumeration and Limit Laws for Multisets: the Subexponential Case
For a given combinatorial class $\mathcal{C}$ we study the class $\mathcal{G} = \mathrm{MSET}(\mathcal{C})$ satisfying the multiset construction, that is, any object in $\mathcal{G}$ is uniquely determined by a set of $\mathcal{C}$-objects paired with their multiplicities. For example, $\mathrm{MSET}(\mathbb{N})$ is (isomorphic to) the class of number partitions of positive integers, a prominent and well-studied case. The multiset construction appears naturally in the study of unlabelled objects, for example graphs or various structures related to number partitions. Our main result establishes the asymptotic size of the set $\mathcal{G}_{n,N}$ that contains all multisets in $\mathcal{G}$ having size $n$ and being comprised of $N$ objects from $\mathcal{C}$, as $n$ \emph{and} $N$ tend to infinity and when the counting sequence of $\mathcal{C}$ is governed by subexponential growth; this is a particularly important setting in combinatorial applications. Moreover, we study the component distribution of random objects from $\mathcal{G}_{n,N}$ and we discover a phenomenon that we baptise \emph{extreme condensation}: taking away the largest component as well as all the components of the smallest possible size, we are left with an object which converges in distribution as $n,N\to\infty$. The distribution of the limiting object is also retrieved. Moreover and rather surprisingly, in stark contrast to analogous results for labelled objects, the results here hold uniformly in $N$.Open AccessAsymptotic Enumeration and Limit Laws for Multisets: the Subexponential Case
For a given combinatorial class $\mathcal{C}$ we study the class $\mathcal{G} = \mathrm{MSET}(\mathcal{C})$ satisfying the multiset construction, that is, any object in $\mathcal{G}$ is uniquely determined by a set of $\mathcal{C}$-objects paired with their multiplicities. For example, $\mathrm{MSET}(\mathbb{N})$ is (isomorphic to) the class of number partitions of positive integers, a prominent and well-studied case. The multiset construction appears naturally in the study of unlabelled objects, for example graphs or various structures related to number partitions. Our main result establishes the asymptotic size of the set $\mathcal{G}_{n,N}$ that contains all multisets in $\mathcal{G}$ having size $n$ and being comprised of $N$ objects from $\mathcal{C}$, as $n$ \emph{and} $N$ tend to infinity and when the counting sequence of $\mathcal{C}$ is governed by subexponential growth; this is a particularly important setting in combinatorial applications. Moreover, we study the component distribution of random objects from $\mathcal{G}_{n,N}$ and we discover a phenomenon that we baptise \emph{extreme condensation}: taking away the largest component as well as all the components of the smallest possible size, we are left with an object which converges in distribution as $n,N\to\infty$. The distribution of the limiting object is also retrieved. Moreover and rather surprisingly, in stark contrast to analogous results for labelled objects, the results here hold uniformly in $N$. - Open Access
Asymptotic Enumeration of Graph Classes with Many Components
We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in $\mathcal{G}$ with $n$ vertices and $N:=\lfloor\lambda n\rfloor$ components, where $\lambda\in(0,1)$. Assuming that the number of graphs with $n$ vertices in $\mathcal{C}$ satisfies \begin{align*} \lvert \mathcal{C}_n\rvert\sim b n^{-(1+\alpha)}\rho^{-n}n!, \quad n\to \infty \end{align*} for some $b,\rho>0$ and $\alpha>1$ -- a property commonly encountered in graph enumeration -- we show that \begin{align*} \lvert\mathcal{G}_{n,N}\rvert\sim c(\lambda) n^{f(\lambda)} (\log n)^{g(\lambda)} \rho^{-n}h(\lambda)^{N}\frac{n!}{N!}, \quad n\to \infty \end{align*} for explicitly given $c(\lambda),f(\lambda),g(\lambda)$ and $h(\lambda)$. These functions are piecewise continuous with a discontinuity at a critical value $\lambda^{*}$, which we also determine. The central idea in our approach is to sample objects of $\cal G$ randomly by so-called Boltzmann generators in order to translate enumerative problems to the analysis of iid random variables. By that we are able to exploit local limit theorems and large deviation results well-known from probability theory to prove our claims. The main results are formulated for generic combinatorial classes satisfying the SET-construction.Open AccessAsymptotic Enumeration of Graph Classes with Many Components
We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in $\mathcal{G}$ with $n$ vertices and $N:=\lfloor\lambda n\rfloor$ components, where $\lambda\in(0,1)$. Assuming that the number of graphs with $n$ vertices in $\mathcal{C}$ satisfies \begin{align*} \lvert \mathcal{C}_n\rvert\sim b n^{-(1+\alpha)}\rho^{-n}n!, \quad n\to \infty \end{align*} for some $b,\rho>0$ and $\alpha>1$ -- a property commonly encountered in graph enumeration -- we show that \begin{align*} \lvert\mathcal{G}_{n,N}\rvert\sim c(\lambda) n^{f(\lambda)} (\log n)^{g(\lambda)} \rho^{-n}h(\lambda)^{N}\frac{n!}{N!}, \quad n\to \infty \end{align*} for explicitly given $c(\lambda),f(\lambda),g(\lambda)$ and $h(\lambda)$. These functions are piecewise continuous with a discontinuity at a critical value $\lambda^{*}$, which we also determine. The central idea in our approach is to sample objects of $\cal G$ randomly by so-called Boltzmann generators in order to translate enumerative problems to the analysis of iid random variables. By that we are able to exploit local limit theorems and large deviation results well-known from probability theory to prove our claims. The main results are formulated for generic combinatorial classes satisfying the SET-construction.