Related papers: Expanders are order diameter non-hyperbolic

In this work we prove general bounds for the diameter of random graphs generated by a preferential attachment model whose parameter is a function $f:\mathbb{N}\to[0,1]$ that drives the asymptotic proportion between the numbers of vertices…

The mapping class group $\Gamma$ of the complement of a Cantor set in the plane arises naturally in dynamics. We show that the ray graph, which is the analog of the complex of curves for this surface of infinite type, has infinite diameter…

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…

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…

The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly…

In this article, we construct a new simplicial complex for infinite-type surfaces, which we call the grand arc graph. We show that if the end space of a surface has at least three different self-similar equivalence classes of maximal ends,…

Expander graphs have been intensively studied in the last four decades. In recent years a high dimensional theory of expanders has emerged, and several variants have been studied. Among them stand out coboundary expansion and topological…

In the case of smooth non-invertible maps which are hyperbolic on folded basic sets $\Lambda$, we give approximations for the Gibbs states (equilibrium measures) of arbitrary H\"{o}lder potentials, with the help of weighted sums of atomic…

For each $m\ge 1$ and $p>2$ we characterize bounded simply connected Sobolev $L^m_p$-extension domains $\Omega\subset R^2$. Our criterion is expressed in terms of certain intrinsic subhyperbolic metrics in $\Omega$. Its proof is based on a…

We provide an upper bound on the Cheeger constant and first eigenvalue of the Laplacian of a finite-volume hyperbolic 3-manifold M, in terms of data from any surgery diagram for M. This has several consequences. We prove that a family of…

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…

We wish to bring attention to a natural but slightly hidden problem, posed by Erd\H{o}s and Ne\v{s}et\v{r}il in the late 1980s, an edge version of the degree--diameter problem. Our main result is that, for any graph of maximum degree…

Given a geodesic line $\gamma$ the hyperbolic space $\mathbb H^n$ we formulate a necessary and sufficient condition for a function along this geodesic which measure the mean curvature of totally umbilical leaves of a foliation orthogonal to…

We prove an inequality concerning isometries of a Gromov hyperbolic metric space, which does not require the space to be proper or geodesic. It involves the joint stable length, a hyperbolic version of the joint spectral radius, and shows…

Strong hyperbolicity is a coarse notion of negative curvature, stronger than Gromov hyperbolicity, that includes all CAT(-k) metrics for k positive and allows the use of dynamical techniques available in negative curvature, such as…

We study the geodesic flow of geometrically finite quotients $\Omega/{\Gamma}$ of Hilbert geometries, in particular its recurrence properties. We prove that, under a geometrical assumption on the cusps, the geodesic flow is uniformly…

We introduce the concept of boundary rigidity for Gromov hyperbolic spaces. We show that a proper geodesic Gromov hyperbolic space with a pole is boundary rigid if and only if its Gromov boundary is uniformly perfect. As an application, we…

A regular equivalence between two graphs $\Gamma,\Gamma'$ is a pair of uniformly proper Lipschitz maps $V\Gamma\to V\Gamma'$ and $V\Gamma'\to V\Gamma$. Using separation profiles we prove that there are $2^{\aleph_0}$ regular equivalence…

Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface…

This paper analyzes key properties of networks generated by geometric preferential attachment. We establish that the expected number of triangles is proportional to that of the standard preferential attachment model, with a proportionality…