Related papers: GUE Correlators and Large Genus Asymptotics
We review and announce recent results on the asymptotic behavior of asymptotically Euclidean relativistic initial data sets and asymptotic foliations thereof. In particular, we discuss the geometrization of asymptotic flatness and of…
The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…
I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k=m-n.
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
In this paper, we study the asymptotic behavior of the traces of Hecke operators for spherical discrete automorphic representations of fixed level on general split reductive groups over $\mathbb{Q}$. Under a condition on the analytic…
The Gaussian $\beta$-ensemble (G$\beta$E) is a fundamental model in random matrix theory. In this paper, we provide a comprehensive asymptotic description of the characteristic polynomial of the G$\beta$E anywhere in the bulk of the…
We consider the behaviors of selected unitary 9 coefficients in the large j limit.
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large $n$, a networked data…
We present some review material relating to the topic of optimal asymptotic expansions of correlation functions and associated observables for $\beta$ ensembles in random matrix theory. We also give an introduction to a related line of…
Normal forms for wide classes of closed IL formulas were given in [4]. Here we quantify asymptotically, in exact numbers, how wide those classes are. As a consequence, we show that the "majority" of closed IL formulas have GL-equivalents,…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
We present an asymptotic expansion for quaternionic self-adjoint matrix integrals. The Feynman diagrams appearing in the expansion are ordinary ribbon graphs and their non-orientable counterparts. The result exhibits a striking duality…
A relatively fast algorithm for evaluating Weil-Petersson volumes of moduli spaces of complex algebraic curves is proposed. On the basis of numerical data, a conjectural large genus asymptotics of the Weil-Petersson volumes is computed.…
We give a new combinatorial proof of Parraud's formula for the asymptotic expansion in powers of $1/N^2$ for the expected trace of polynomials of several independent $N \times N$ GUE matrices, which expresses the result using a mixture of…
Let G be a family of n-vertex graphs of uniform degree 2 with the property that the union of any two member graphs has degree four. We determine the leading term in the asymptotics of the largest cardinality of such a family. Several…
We extract the long-distance asymptotic behaviour of two-point correlation functions in massless quantum integrable models containing multi-species excitations. For such a purpose, we extend to these models the method of a large-distance…
We study averages of multiplicative eigenvalue statistics in ensembles of orthogonal Haar distributed matrices, which can alternatively be written as Toeplitz+Hankel determinants. We obtain new asymptotics for symbols with Fisher-Hartwig…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
We construct sequences of pseudo-Anosov mapping classes whose dilatations behave asymptotically like the inverse of the Euler characteristic of the surface they are defined on. These sequences are used to show that if the genus, g, and…