4 citations · 4 across the 4 of their papers we have counts for
6 papers
Asymptotic normality of pattern counts in random maps II
Eva-Maria Hainzl
In a recent work, a central limit theorem for pattern counts in random planar maps was proven by reducing the problem to a face count problem. We provide a shorter proof by circumv…
Singularly perturbed discrete differential equations
Michael Drmota, Eva-Maria Hainzl
Discrete differential equations appear most prominently in planar map and lattice path enumeration. In this work we consider discrete differential equations with an additional para…
Formulas and asymptotics of hypergraph Catalan numbers
Eva-Maria Hainzl
Tree walks are a class of closed walks on a complete graph constrained to span trees. In this work, we focus on a special subclass called -tours, which were recently introduced…
Asymptotic normality of pattern occurrences in random maps
Michael Drmota, Eva-Maria Hainzl, Nick Wormald
The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it patter…
Tree walks and the spectrum of random graphs
Eva-Maria Hainzl, Élie de Panafieu
It is a classic result in spectral theory that the limit distribution of the spectral measure of random graphs G(n, p) converges to the semicircle law in case np tends to infinity…
Geometric Dominating Sets
Oswin Aichholzer, David Eppstein, Eva-Maria Hainzl
We consider a minimizing variant of the well-known \emph{No-Three-In-Line Problem}, the \emph{Geometric Dominating Set Problem}: What is the smallest number of points in an $n\time…