Related papers: GUE Correlators and Large Genus Asymptotics
The complex Ginibre ensemble is an $N\times N$ non-Hermitian random matrix over $\mathbb{C}$ with i.i.d. complex Gaussian entries normalized to have mean zero and variance $1/N$. Unlike the Gaussian unitary ensemble, for which the…
In this paper we analyze the large genus asymptotics for intersection numbers between $\psi$-classes, also called correlators, on the moduli space of stable curves. Our proofs proceed through a combinatorial analysis of the recursive…
We determine the asymptotic behaviour of the number of the Eulerian circuits in undirected simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). We also prove some new properties of the…
Following ideas from [14], we give a uniform large genus asymptotics for primitive psi-class intersection numbers on the moduli space of stable algebraic curves, and extend this result including insertions of zeros in a certain uniform way.…
Based on an explicit formula of the generating series for the $n$-point psi-class intersection numbers (cf. Bertola et. al. [4]), we give a novel proof of a conjecture of Delecroix et. al. [9] regarding the large genus uniform leading…
In this paper, based on the value of central character on the transposition, we find structure and large genus asymptotics of certain Hurwitz numbers.
We calculate a general spectral correlation function of products and ratios of characteristic polynomials for a $N\times N$ random matrix taken from the chiral Gaussian Unitary Ensemble (chGUE). Our derivation is based upon finding an…
We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
We generalize the results on the asymptotic expansion from Gaussian Unitary Ensembles case to all Gaussian Ensembles. We derive differential equations on densities and their moment generating functions for all Gaussian Ensembles. Also, we…
We prove an asymptotic formula for the number of orientations with given out-degree (score) sequence for a graph $G$. The graph $G$ is assumed to have average degrees at least $n^{1/3 + \varepsilon}$ for some $\varepsilon > 0$, and to have…
We compare two classes of functions arising from genus-one superstring amplitudes: modular and holomorphic graph functions. We focus on their analytic properties, we recall the known asymptotic behaviour of modular graph functions and we…
In this paper, we study the asymptotic behavior of the sum of twisted traces of self-dual or conjugate self-dual discrete automorphic representations of $\mathrm{GL}_n$ for the level aspect of principal congruence subgroups under some…
Siegel-Veech constants are powerful tools for counting saddle connections on a translation surface. Their computation can be involved, most famously with recursive formulas that use intricate combinatorics or intersection theory. From these…
We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…
Galton's rank order statistic is one of the oldest statistical tools for two-sample comparisons. It is also a very natural index to measure departures from stochastic dominance. Yet, its asymptotic behaviour has been investigated only…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
In this paper we study random representations of fundamental groups of surfaces into special unitary groups. The random model we use is based on a symplectic form on moduli space due to Atiyah, Bott, and Goldman. Let $\Sigma_{g}$ denote a…
In this paper, we study combinatorial and asymptotic properties of some interesting rational numbers called the Br\'ezin--Gross--Witten (BGW) numbers, which can be represented as the intersection numbers of psi and Theta classes on the…
In this paper, we obtain the asymptotic expansions of super intersection numbers and prove that the associated coefficients are polynomials. Moreover, we give an algorithm which can explicitly compute these coefficients. As an application,…