We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disc graph and the electrified disc graph of a handlebody H of genus g>1 are hyperbolic, and we determine their Gromov boundaries.
Graphs of multicurves are hyperbolic, relatively hyperbolic, or thick.
problem Characterizing graphs of multicurves based on their geometric properties.
method Proving graphs of multicurves are hyperbolic, relatively hyperbolic, or thick based on subsurface intersections.
result Geometric characterization of graphs of multicurves.
Hensel-Przytycki-Webb proved that all curve graphs of orientable surfaces are 17-hyperbolic. In this paper, we show that curve graphs of non-orientable surfaces are 17-hyperbolic by applying Hensel-Przytycki-Webb's argument. We also show that arc graphs of non-orientable surfaces are 7-hyperbolic, and arc-curve graphs …
New findings on hyperbolicity of fine curve graphs and their subgraphs.
problem Investigating hyperbolicity of fine curve graphs and their subgraphs.
method Analyzing large subgraphs of fine curve graphs and computing distances in specific cases.
result Large subgraphs of fine curve graphs contain flats of every finite dimension, indicating they are not hyperbolic.
The study shows that certain curve graphs are hierarchically hyperbolic but not Gromov hyperbolic.
problem Characterizing the hyperbolicity of curve graphs and their boundaries.
method Using hierarchical hyperbolicity and framed curves, the study examines the properties of curve graphs and their boundaries.
result The curve graphs and their boundaries are hierarchically hyperbolic but not Gromov hyperbolic.
New findings on algebraic structure of hyperbolic graph braid groups.
problem Classifying and understanding the algebraic structure of hyperbolic graph braid groups.
method Analyzing specific graph types (sun and pulsar graphs) and proving theorems about their braid groups.
result 3-strand braid groups of sun graphs are free, while most pulsar graphs contain surface subgroups.
Simple Euclidean models outperform hyperbolic graph learning models.
problem The effectiveness of hyperbolic graph learning models is questioned.
method Careful analysis of hyperbolic graph representation learning, identifying and addressing issues with baselines, modeling assumptions, and metric usage.
result Simple Euclidean models often outperform hyperbolic graph learning models, even on hyperbolic datasets.
New hyperbolic graph constructed from projections of free splitting graph.
problem Constructing a new hyperbolic graph from projections of free splitting graph.
method Using submanifold projections and geometric realization of free splitting graph.
result A new hyperbolic graph constructed for n≥3. Graph conditions ensure matching arc complexes are connected and hyperbolic.
problem Conditions for connectedness and hyperbolicity of matching arc complexes.
method Conditions on finite simplicial graphs guaranteeing connectedness and hyperbolicity of matching arc complexes.
result Conditions on finite simplicial graphs ensure connectedness and hyperbolicity of matching arc complexes.
Uniform hyperbolicity proved for nonorientable surface curve graphs.
problem Proving uniform hyperbolicity for nonorientable surface curve graphs.
method Using bicorn curves and arguments from orientable surfaces.
result Graph of nonseparating curves is uniformly hyperbolic.
We describe unicorn paths in the arc graph and show that they form 1-slim triangles and are invariant under taking subpaths. We deduce that all arc graphs are 7-hyperbolic. Considering the same paths in the arc and curve graph, this also shows that all curve graphs are 17-hyperbolic, including closed surfaces.
Stable cylinders found in hyperbolic groups and curve graphs.
problem Torsionfree hyperbolic groups and curve graphs of surfaces have globally stable cylinders.
method Generalised Sageev's construction to improve fine properties of hyperbolic spaces.
result Proved curve graphs of surfaces admit equivariant quasi-isometric embeddings in finite products of quasitrees.
Proposes HypCSE for enhanced hierarchical clustering.
problem Challenges in existing hierarchical clustering methods.
method Hyperbolic Continuous Structural Entropy (HypCSE) neural networks.
result Superior performance on seven datasets.
The paper characterizes hyperbolic manifolds and graphs verifying a specific isoperimetric inequality.
problem Understanding the relationship between hyperbolicity and isoperimetric inequalities in manifolds and graphs.
method Characterization of hyperbolic manifolds and graphs with isoperimetric inequality, using Gromov boundary.
result Having a pole is a necessary condition for verifying the isoperimetric inequality, which can be removed.
We prove that the separating curve graph of a connected, compact, orientable surface with genus at least 3 and a single boundary component is not relatively hyperbolic. This completes the classification of when the separating curve graph is hyperbolic and relatively hyperbolic initiated by previous works of the authors…
The study proves conditions for hyperbolic isometries on fine curve graphs of higher genus surfaces.
problem Conditions for hyperbolic isometries on fine curve graphs of higher genus surfaces.
method Proves equivalence of conditions involving isotopic maps, pseudo-Anosov maps, and ergodic rotation sets.
result Ergodic homological rotation sets have nonempty interior for certain isotopic maps.
The pants graph has proved to be influential in understanding 3-manifolds concretely. This stems from a quasi-isometry between the pants graph and the Teichmüller space with the Weil-Petersson metric. Currently, all estimates on the quasi-isometry constants are dependent on the surface in an undiscovered way. This pape…
The fine curve graph is hyperbolic and contains all countable graphs as induced subgraphs.
problem Characterizing the structure and properties of fine curve graphs.
method Analyzing the hyperbolicity and induced subgraph properties of fine curve graphs and their direct limits.
result The finitary curve graph has diameter 2, contains every countable graph as an induced subgraph, and has the homeomorphism group of the surface as its automorphism group.
Study the geometry of graph product extension graphs.
problem Properties of graph products.
method Introduce and study the extension graph of graph products of groups.
result Extension graph is isomorphic to crossing graph of a quasi-median graph and exhibits asymptotic dimension similar to quasi-trees.
We show that the graphs of nonseparating curves for oriented finite type surfaces are uniformly hyperbolic. Our proof follows the proof of uniform hyperbolicity of the graphs of curves for closed surfaces due to Przytycki-Sisto, while introducing new arguments using homology to certify that certain curves are nonsepara…
New graphs show hierarchical hyperbolic properties, extending previous work.
problem Characterizing hierarchically hyperbolic properties of multiarc and curve graphs.
method Analyzing the geometric intersection number and using PMod(S) action.
result Multiarc and curve graphs are hierarchically hyperbolic.
Infinite hyperbolic knots yield unusual surgeries.
problem Finding knots with specific surgery results.
method Examined infinite families of hyperbolic knots and their surgeries.
result Discovered knots with surgeries producing graph manifolds with five disjoint, non-parallel incompressible tori.
This note addresses some questions that arise in the series of works by Kyoji Saito on the growth functions of graphs. We study "hyperbolike" graphs, which include Cayley graphs of hyperbolic groups. We generalize some well-known results on hyperbolic groups to the hyperbolike setting, including rationality of generati…
The study shows acylindrical hyperbolicity for Artin groups not associated with joins or cones.
problem Proving acylindrical hyperbolicity for Artin groups of infinite type not associated with joins or cones.
method Developing and extending the clique-cube complex and action studies of Charney and Morris-Wright.
result Acylindrical hyperbolicity demonstrated for Artin groups of infinite type associated with graphs that are not cones.
Graph products inherit Morse local-to-global property from their components.
problem Generalizing local-to-global property to graph products of infinite groups.
method Generalizing maximization procedure for relatively hierarchically hyperbolic groups and showing stable embeddings.
result Graph products of infinite Morse local-to-global groups have the Morse local-to-global property.
A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in this paper. This enable us to show that certain classes of knots can yield hyperb…
Sharp bounds for spanning tree entropy in planar lattices.
problem Estimating spanning tree entropy in planar lattice graphs.
method Using hyperbolic geometry and polyhedra volumes.
result Proved bounds are easy to compute and provide excellent estimates.
Random subsurfaces of hyperbolic surfaces equidistribute to ribbon graphs.
problem Distribution of shapes of complementary subsurfaces in moduli space.
method Study of shapes of complementary subsurfaces in moduli space as boundary lengths go to infinity.
result Random subsurfaces look like random ribbon graphs.
Graph neural network (GNN) has shown superior performance in dealing with graphs, which has attracted considerable research attention recently. However, most of the existing GNN models are primarily designed for graphs in Euclidean spaces. Recent research has proven that the graph data exhibits non-Euclidean latent ana…
New research shows hyperbolic embeddings are useful for global consistency tasks in graphs.
problem The usefulness of hyperbolic representations in graph learning tasks.
method Computed hyperbolic embeddings for node classification and link prediction tasks, addressing optimization issues at zero curvature.
result Hyperbolic embeddings are more effective for tasks requiring global consistency, while Euclidean models are superior for other tasks.
Study shows RAAG automorphisms and outer automorphisms are not relatively hyperbolic.
problem Characterizing automorphism and outer automorphism groups of RAAGs.
method Analyzing groups of RAAGs with at least 3 vertices, categorizing based on graph structure.
result Automorphism and outer automorphism groups of RAAGs are not relatively hyperbolic.
We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by Bowditch. Consequences for such graphs include a distance formula analogous to Mas…
Graph convolutional neural networks (GCNs) embed nodes in a graph into Euclidean space, which has been shown to incur a large distortion when embedding real-world graphs with scale-free or hierarchical structure. Hyperbolic geometry offers an exciting alternative, as it enables embeddings with much smaller distortion. …
We prove that the curve graph $\calC^{(1)}(S)$ is Gromov-hyperbolic with a constant of hyperbolicity independent of the surface S. The proof is based on the proof of hyperbolicity of the free splitting complex by Handel and Mosher, as interpreted by Hilion and Horbez.
Study connects flow dynamics to 3D geometry via surface intersections.
problem Relating flow dynamics to geometric properties of 3-manifolds.
method Relates pseudo-Anosov flow dynamics to hyperbolic geometry via curve graphs.
result Established a link between flow invariants and geometric features of 3-manifolds.
Researchers prove constant mean curvature graphs in hyperbolic 3-space for specific domains.
problem Existence of hyperbolic Killing graphs with constant mean curvature in exterior domains.
method Existence proof using CMC graphs and Killing vector fields.
result Existence of hyperbolic Killing graphs of constant mean curvature H in exterior domains.
Percolation study in non-hyperbolic groups proves non-uniqueness phase.
problem Percolation in acylindrically hyperbolic groups.
method Analyzing Bernoulli bond percolation on Cayley graphs of groups.
result Non-uniqueness phase in percolation on Cayley graphs of acylindrically hyperbolic groups.
The study proves conjecture for specific Artin groups.
problem Proving conjecture about Artin groups' properties.
method Analyzing Artin groups associated to triangle-free graphs and cones over square-free bipartite graphs.
result Proves conjecture for specific Artin groups.
The paper studies hyperbolic phenomena on closed surfaces using bicorn curves.
problem Understanding hyperbolic phenomena on curve graphs of closed surfaces.
method Using the theory of bicorn curves to analyze the curve graphs of closed surfaces.
result Proves that the curve graph of any closed surface is 15-hyperbolic with one exception.
Surjectivity of Cannon-Thurston map proven for metric graph bundles.
problem Proving surjectivity of Cannon-Thurston map in metric graph bundles.
method Generalized Mj-Sardar's result to include more types of fibers.
result Continuous extension map between boundaries is surjective.
Hyperbolic groups' infinite orbits spread evenly in spaces.
problem Equidistribution of hyperbolic groups in homogeneous spaces.
method Averaging measures along spheres in Cayley graphs converges to Haar measure.
result Infinite orbits of hyperbolic groups equidistribute in homogeneous spaces.
A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups is virtually cocompact special in the sense of Haglund and Wise. The proof of th…
Nonexistence results for semilinear parabolic and hyperbolic inequalities on metric graphs
problem Nonexistence of solutions to semilinear parabolic and hyperbolic inequalities on metric graphs
method Construction of a new pseudo-metric and space-time test functions
result All solutions must be identically zero
The study examines groups acting loxodromically on hyperbolic graph products.
problem Understanding groups acting loxodromically on hyperbolic graph products.
method Examined groups acting on finite products of hyperbolic graphs, focusing on loxodromic elements.
result Strong structure theorems for groups in this subclass, excluding mapping class groups of genus at least 3 and certain automorphism groups.
The paper proves drilled bundles over graphs are virtually special cubulable.
problem Proving drilled bundles over graphs are virtually special cubulable.
method Starting with a Gromov-hyperbolic surface bundle, drilling out essential curves, and using relative hyperbolicity and Wise's theorem.
result Proves drilled bundles over graphs are virtually special cubulable.
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 propose a novel GNN architecture for learning representations on Riemannian man…
Quotients of Gordian and H(2)-Gordian graphs are hyperbolic.
problem Investigate quotients of Gordian and H(2)-Gordian graphs under knot invariants.
method Defined equivalence relations by knot invariants (det, Jones span, tricolorability) and showed quotient graphs are Gromov hyperbolic.
result Quotients of H(2)-Gordian graph of links modulo span of Jones polynomial is isomorphic to complete graph.
Carrier graphs were first introduced for closed hyperbolic 3-manifolds by White. In this paper, we first generalize this definition to carrier graphs for representations of a rank two free group into the isometry group of hyperbolic three space. Then we prove the existence and the finiteness of minimal carrier graphs f…