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 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.
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.
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.
Characterizes geometric actions on graphs with flexible stabilizers.
problem Understanding geometric actions on flexible stabilizers.
method Defining generalized fine actions and proving relative quasi-convexity criteria.
result Characterizes Bowditch boundary points in relatively geometric actions.
We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain conditions. We then provide a criterion for the relative quasiconvexity of a subgroup H de…
Study homeomorphisms on fine curve graph of surfaces, revealing new types of dynamics.
problem Understanding dynamics of homeomorphisms on fine curve graphs of surfaces.
method Analyzing the action of homeomorphisms on the fine curve graph and relating to classical curve graphs.
result Homeomorphisms induce parabolic isometries, and all positive reals are realized as asymptotic translation lengths.
In the framework of homological characterizations of relative hyperbolicity, Groves and Manning posed the question of whether a simply connected 2-complex X with a linear homological isoperimetric inequality, a bound on the length of attaching maps of 2-cells and finitely many 2-cells adjacent to any edge must …
Automorphisms and subdivisions of Helly graphs are studied, leading to explicit models and rational translation lengths.
problem Understanding automorphisms and subdivisions of Helly graphs.
method Simple fine simplicial subdivisions and explicit simplicial models of the injective hull.
result Any automorphism of a Helly graph is either elliptic or hyperbolic, with rational translation lengths.
Improves few-shot learning for hierarchical data using hyperbolic space.
problem Few-shot class-incremental learning for hierarchical data.
method Contrastive learning in hyperbolic space, Poincaré ball model, hyperbolic contrastive loss, maximum entropy distribution.
result Effective improvement of coarse and fine class accuracies in few-shot conditions.
The study of topological groups with compact open subgroups and their geometric properties.
problem Characterizing and understanding topological groups with compact open subgroups.
method Geometric techniques, discrete actions on complexes, quasi-isometry invariance, and hyperbolic fine graphs.
result Generalizations of discrete group results to topological groups with compact open subgroups.
Automorphisms of fine 1-curve graph linked to surface homeomorphisms.
problem Understanding automorphisms of fine 1-curve graphs.
method Isomorphic mapping to surface homeomorphisms.
result Automorphism group is isomorphic to homeomorphism group of a surface.
Automorphisms of fine graphs for surfaces and tori are studied.
problem Understanding automorphisms of fine graphs for surfaces and tori.
method Extending previous results to tori and discussing smooth versions.
result Automorphism groups of fine graphs for surfaces and tori are naturally isomorphic to homeomorphism groups.
We prove an existence result for non rotational constant mean curvature ends in H2×R, where H2 is the hyperbolic real plane. The value of the curvature is h∈(0,1/2). We use Schauder theory and a continuity method for solution of the prescribed mean curvature equation…
Automorphisms of fine curve graphs match surface homeomorphisms for planar surfaces.
problem Understanding automorphisms of fine curve graphs on surfaces.
method Analyzing vertices and edges of fine curve graphs to match with surface homeomorphisms.
result Automorphism group of fine curve graphs is naturally isomorphic to the homeomorphism group of boundaryless planar surfaces with at least 7 punctures.
Automorphisms of fine curve graph match surface homeomorphisms.
problem Understanding automorphisms of curve graphs for surfaces.
method Building on previous work, proving isomorphism to surface homeomorphisms.
result The group of automorphisms of the fine curve graph is isomorphic to the extended mapping class group of the surface.
The paper studies the connectedness of a graph's boundary for surfaces.
problem Understanding the topology of the Gromov boundary of fine curve graphs for surfaces.
method Proved a bounded geodesic image theorem, used to show linear connectivity of the Gromov boundary.
result The Gromov boundary of fine curve graphs for surfaces is linearly connected.
Automorphism group of nonorientable surface curve graph matches surface homeomorphisms.
problem Identifying automorphisms of nonorientable surface curve graphs.
method Using Bowden, Hensel, and Webb's fine curve graph and Long, Margalit, Pham, Verberne, and Yao's proof as a foundation.
result Automorphism group of nonorientable surface curve graph is isomorphic to the surface's homeomorphism group.
Parabolic mapping class acts on curve graphs of infinite type surfaces.
problem Understanding parabolic isometries on curve graphs of infinite type surfaces.
method Fine curve graph tools to prove existence of parabolic isometries.
result Existence of parabolic isometries on graphs of curves of infinite type surfaces.
Study the Gromov boundary of fine curve graph for surface homeomorphisms.
problem Understanding the boundary of fine curve graph for surface homeomorphisms.
method Examined the Gromov boundary and local topology near specific foliations and laminations.
result Found elements with positive stable commutator length and proved a Tits alternative.
Classification of torus homeomorphisms on fine curve graph completed.
problem Classifying actions of torus homeomorphisms on fine curve graph.
method Proof involving slow rotation sets for torus homeomorphisms.
result Actions of torus homeomorphisms on fine curve graph classified.
Abstract: Proves generic torus diffeomorphisms act parabolically and non-properly on fine curve graph and have generalized rotation sets.
problem Generic torus diffeomorphisms on fine curve graph.
method Proves generic torus diffeomorphisms act parabolically and non-properly on fine curve graph.
result Generic torus diffeomorphisms have generalized rotation sets of any point-symmetric compact convex homothety type.
Study automorphisms of smooth curve graphs on surfaces.
problem Understanding automorphisms of fine curve graphs.
method Examined automorphisms of continuously differentiable curves on surfaces.
result Automorphisms on surfaces of genus ≥ 2 are induced by homeomorphisms.
Machine learning predicts minimal surfaces for knots, supporting a conjecture.
problem Predicting minimal surfaces for knots in hyperbolic space.
method Physics-Informed Neural Networks (PINNs) to solve minimal surface equation.
result Computational minimal surfaces align with Fine's Conjecture.
Fine-tunes GNNs by preserving generative patterns to improve transferability.
problem Vanilla fine-tuning fails due to structural divergence between pre-training and downstream graphs.
method G-Tuning, which reconstructs the generative patterns of the downstream graph using graphon bases.
result G-Tuning achieves an average improvement of 0.5% and 2.6% on in-domain and out-of-domain transfer learning experiments.
New framework learns labels at both bag and graph levels.
problem Learning multi-label classifiers from multi-graph bags.
method Designing scoring functions and rank-loss objective for graph and bag levels; developing sub-gradient descent algorithm.
result Superior performance over state-of-the-art algorithms.
The paper proves that relative Dehn functions are invariant under quasi-isometry.
problem Invariance of relative Dehn functions under quasi-isometry.
method Proof of quasi-isometry invariance of relative Dehn functions.
result Relative Dehn functions are invariant under quasi-isometry.
We analyse the fine convergence properties of one parameter families of hyperbolic metrics, on a fixed underlying surface, that move always in a horizontal direction, i.e. orthogonal to the action of diffeomorphisms.
Learning image representations to capture fine-grained semantics has been a challenging and important task enabling many applications such as image search and clustering. In this paper, we present Graph-Regularized Image Semantic Embedding (Graph-RISE), a large-scale neural graph learning framework that allows us to tr…
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 …
A new neural network model for molecular graphs that learns efficiently and accurately.
problem Learning on molecular graphs with cycles and complex structures.
method Hierarchical inter-message passing using raw graph and junction tree representations.
result The model outperforms classical GNNs in detecting cycles and is efficient to train.
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.
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 proposes DEA to make graph neural networks fairer in link prediction.
problem Graph neural networks can unfairly prioritize certain social groups in link prediction.
method Drop Edges and Adapt (DEA) fine-tuning strategy with covariance constraints.
result DEA improves fairness and accuracy in link prediction tasks.
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.
The dominant graph neural networks (GNNs) over-rely on the graph links, several serious performance problems with which have been witnessed already, e.g., suspended animation problem and over-smoothing problem. What's more, the inherently inter-connected nature precludes parallelization within the graph, which becomes …
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…
Graph generation techniques are increasingly being adopted for drug discovery. Previous graph generation approaches have utilized relatively small molecular building blocks such as atoms or simple cycles, limiting their effectiveness to smaller molecules. Indeed, as we demonstrate, their performance degrades significan…
New stability theorem for hyperbolic metrics without volume bounds.
problem Stability of finite volume hyperbolic metrics without upper volume bounds.
method Abstract axiomatic framework and bootstrap argument to extend stability result.
result Weaker exponential control of the metric allows for a broader application of the stability theorem.
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…