Related papers: Large expanders in high genus unicellular maps
In the present work the rooted and unrooted d-regular maps on 2-dimentional oriented surfaces of genus g are enumerated. Separately and in more detail the case of d-regular maps with a single face are considered.
In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…
In this paper, we use a formula obtained in [8] to study certain asymptotic behaviors of GUE (Gaussian unitary ensemble) correlators. More precisely, we obtain large genus asymptotics of enumerations of ordinary graphs and ribbon graphs…
We investigate how thin sheets of arbitrary shapes morph under the isotropic in-plane expansion of their top surface, which may represent several stimuli such as nonuniform heating, local swelling and differential growth. Inspired by…
For several instances of metric largeness like enlargeability or having hyperspherical universal covers, we construct non-large vector subspaces in the rational homology of finitely generated groups. The functorial properties of this…
We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…
We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…
Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks…
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
We prove that if a unimodular random graph is almost surely planar and has finite expected degree, then it has a combinatorial embedding into the plane which is also unimodular. This implies the claim in the title immediately by a theorem…
We consider a one-dimensional family of rational surfaces with automorphisms. In a degeneration of this family, the limiting map is the identity map on a special fiber. We check that the map on the total space of the family has…
We study the geometry and spectral theory of Weil-Petersson random surfaces with genus-$g$ and $n$ cusps in the large-$n$ limit. We show that for a random hyperbolic surface in $\mathcal{M}_{g,n}$ with $n$ large, the number of small…
Due to the fact that the numbers of annually published papers have witnessed a linear growth in some citation networks, a geometric model is thus proposed to predict some statistical features of those networks, in which the academic…
The uniform infinite planar quadrangulation is an infinite random graph embedded in the plane, which is the local limit of uniformly distributed finite quadrangulations with a fixed number of faces. We study asymptotic properties of this…
In this note, we prove that a random extension of either the free group $F_N$ of rank $N\ge3$ or of the fundamental group of a closed, orientable surface $S_g$ of genus $g\ge2$ is a hyperbolic group. Here, a random extension is one…
We perform a large deviations analysis of homological growth rates of oriented geodesics on hyperbolic surfaces. For surfaces uniformized by a wide class of Fuchsian groups of the first kind, we prove the existence of the rate function…
Superbubbles are acyclic induced subgraphs of a digraph with single entrance and exit that naturally arise in the context of genome assembly and the analysis of genome alignments in computational biology. These structures can be computed in…
Three-dimensional random tensor models are a natural generalization of the celebrated matrix models. The associated tensor graphs, or 3D maps, can be classified with respect to a particular integer or half-integer, the degree of the…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique…