Related papers: Large expanders in high genus unicellular maps
The mapping class group of a surface with one boundary component admits numerous interesting representations including as a group of automorphisms of a free group and as a group of symplectic transformations. Insofar as the mapping class…
A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…
In this note we give a short proof that graphs having no linearly small F{\o}lner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal F{\o}lner sets and…
We show that expander graphs must have Gromov-hyperbolicity at least proportional to their diameter, with a constant of proportionality depending only on the expansion constant and maximal degree. In other words, expanders contain geodesic…
The Euler characteristic of a very affine variety encodes the number of critical points of the likelihood equation on this variety. In this paper, we study the Euler characteristic of the complement of a hypersurface arrangement with…
We construct a new family of trivalent expanders tessellating hyperbolic surfaces with large isometry groups. These graphs are obtained from a family of Cayley graphs of nilpotent groups via $(\Delta-Y)$-transformations. We compare this…
In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…
A common model for social networks are Geometric Inhomogeneous Random Graphs (GIRGs), in which vertices draw a random position in some latent geometric space, and the probability of two vertices forming an edge depends on their geometric…
This paper is interested in independent sets (or equivalently, cliques) in uniform random cographs. We also study their permutation analogs, namely, increasing subsequences in uniform random separable permutations. First, we prove that,…
We explore connections between the generalized multiplicities of square-free monomial ideals and the combinatorial structure of the underlying hypergraphs using methods of commutative algebra and polyhedral geometry. For instance, we show…
Given a family of varieties, the Euler discriminant locus distinguishes points where Euler characteristic differs from its generic value. We introduce a hypergeometric system associated with a flat family of very affine locally complete…
This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root…
Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…
In this paper we introduce a new geometric flow --- the hyperbolic gradient flow for graphs in the $(n+1)$-dimensional Euclidean space $\mathbb{R}^{n+1}$. This kind of flow is new and very natural to understand the geometry of manifolds. We…
Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…
We introduce a family of trivalent expanders which tessellate compact hyperbolic surfaces with large isometry groups. We compare this family with Platonic graphs and modifications of them and prove topological and spectral properties of…
We consider a complete, unbounded, hyperbolic metric space $X$ and a concave, nonzero and nondecreasing function $\omega:[0,+\infty)\to[0,+\infty)$ with $\omega(0)=0$ and study the space $\mathcal{C}_\omega(X)$ of uniformly continous…
Learning from graph-structured data is an important task in machine learning and artificial intelligence, for which Graph Neural Networks (GNNs) have shown great promise. Motivated by recent advances in geometric representation learning, we…