Geodesic orbit nilmanifolds linked to graph structures.
problem Characterizing Riemannian nilmanifolds associated with graphs.
method Analyzing naturally reductive and geodesic orbit properties of nilmanifolds defined by graphs.
result Nilmanifolds are geodesic orbit if and only if naturally reductive if and only if the defining graph is a disjoint union of complete graphs.
Study geodesic flow on graph-related nilmanifolds, finding integrable and non-integrable cases.
problem Understanding geodesic flow on specific geometric structures.
method Construction of first integrals to show complete integrability.
result Examples of integrable and non-integrable geodesic flows.
Geodesic graphs for special Finsler metrics on spheres are studied.
problem Characterizing geodesic orbit Finsler metrics on spheres.
method Explicit constructions and group extensions.
result Not all projective spaces admit invariant Finsler metrics.
Optimizing quantum graphs yields geodesic nets on surfaces.
problem Finding optimal quantum graphs for geodesic nets.
method Optimizing functionals from spectral theory to find geodesic nets.
result Critical metrics for eigenvalues give rise to geodesic nets.
Study geodesics on graphs with random lengths, proving bi-infinite paths exist.
problem Existence of bi-infinite geodesic paths on graphs with random edge lengths.
method Sublinear Morse geodesics and first passage percolation analysis.
result Proves the existence of bi-infinite geodesic paths in graphs with specific properties.
Researchers describe the Gromov boundary of a graph related to surfaces.
problem Understanding the Gromov boundary of a graph associated with surfaces.
method Described a dense subset of the Gromov boundary as geodesic laminations, proving the graph satisfies a bounded geodesic image theorem.
result The boundary is not compact.
Embeds directed graphs into statistical manifolds for better geodesic preservation.
problem Preserving global geodesic information in directed graphs.
method Global minimization of pairwise relative entropy and graph geodesics.
result Our embedding outperforms existing models in various evaluation metrics.
Researchers analyze geodesic complexity in robot paths on tree graphs.
problem Understanding optimal paths for robots on tree graphs.
method Examined geodesic complexity in ordered and unordered configuration spaces of graphs in ℓ1 and ℓ2 metrics, finding explicit geodesics and families. result Geodesic complexity matches topological complexity in all cases studied.
We study the geometry of the Thurston metric on Teichmuller space by examining its geodesics and comparing them to Teichmuller geodesics. We show that, similar to a Teichmuller geodesic, the shadow of a Thurston geodesic to the curve graph is a reparametrized quasi-geodesic. However, we show that the set of short curve…
Study efficient geodesics in curve complex using dot graphs.
problem Characterize efficient geodesics in curve complexes.
method Introduced dot graphs to record intersection patterns and used them to prove existence and properties of efficient geodesics.
result The shape of dot graphs for efficient geodesics is contained within a spindle shape region, controlling curve coordinates.
In this paper we show that two Lagrangian graphs over the torus in Cn with large Lagrangian phase can be connected via Lipschitz continuous geodesic with respect to the L2 metric on the space of Lagrangian submanifolds. In particular, the geodesic for Lagrangian graphs over the torus in Cn ca…
FPP preserves sublinear Morse boundaries in geodesic graphs.
problem Preserving sublinear Morse boundaries in FPP.
method First passage percolation on geodesic graphs with i.i.d. passage times.
result Sublinear Morse boundaries are invariant under FPP.
The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of this study, we show that there exist computable bounds for Bowditch's slices on tig…
Study shows mean curvature flows converge to a geodesic graph over a totally geodesic hypersurface.
problem Mean curvature flows in warped product manifolds with closed hypersurfaces.
method Investigation of mean curvature flows in specific warped product manifolds with conditions on warping function and Ricci curvature.
result Existence and convergence of mean curvature flows for certain initial hypersurfaces.
This paper restricts efficient geodesics to non-separating curves.
problem Finding efficient geodesics in the complex of curves.
method Analysis of the dot graph and surgeries.
result Efficient geodesics can be restricted to the non-separating curve complex.
Generalizes Wolpert's formula for geodesic graphs on hyperbolic surfaces.
problem Computing symplectic forms on Teichmüller space for complex deformations.
method Defines a new infinitesimal deformation for balanced geodesic graphs and proves a generalized formula.
result Reproduces Wolpert's formula for simple closed curves and extends it to more complex graphs.
We show that for a surface S, the subgraph of the pants graph determined by fixing a collection of curves that cut S into pairs of pants, once-punctured tori, and four-times-punctured spheres is totally geodesic. The main theorem resolves a special case of a conjecture made by Aramayona, Parlier, and Shackleton and has…
The main theorem of this paper classifies the quasi-geodesics in a Coxeter group that are tracked by geodesics. As corollaries, we show that if a Coxeter group acts geometrically on a CAT(0) space X then CAT(0) rays (and lines) are tracked by Cayley graph geodesics, all special subgroups of the Coxeter group are quasi-…
For the pants graph, there is little known about the behaviour of geodesics, as opposed to quasigeodesics. Brock-Masur-Minsky showed that geodesics or geodesic segments connecting endpoints satisfying a bounded combinatorics condition, such as the stable/unstable laminations of a pseudo-Anosov, all have bounded combina…
New definition of naturally reductive Finsler manifolds using geodesic graphs.
problem Defining naturally reductive Finsler manifolds using geodesic graphs.
method Proposed a new geometrical definition using geodesic graphs and constructed examples of Finsler metrics.
result Explicit examples of Finsler naturally reductive metrics constructed.
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting of geodesics. Furthermore, the method gives inequalities with a uniform constant…
We show that the metric of nonpositively curved graph manifolds is determined by its geodesic flow. More precisely we show that if the geodesic flows of two nonpositively curved graph manifolds are C0 conjugate then the spaces are isometric.
A new discrete formula connects vertex and edge distributions on graphs.
problem Optimal transport on graphs with mixed vertex and edge distributions.
method Discrete transport equation and Benamou-Brenier formulation.
result Classification of all Wasserstein-1 geodesics on graphs.
Geodesic nets on flat spheres are studied using Gauss-Bonnet theorem.
problem Existence and non-existence of specific geodesic nets on flat spheres.
method The theorem of Gauss-Bonnet is applied to demonstrate results.
result Existence and non-existence of geodesic nets on regular doubled polygons.
First-passage percolation affects graph properties like curvature and geodesics.
problem Effect of first-passage percolation on graph curvature and geodesics.
method Randomly perturbs the metric of a graph by assigning random edge lengths.
result Non-positive curvature and geodesic properties are not preserved by first-passage percolation.
Study of mean curvature flows on graphs in warped product manifolds, focusing on behavior at infinity.
problem Behavior of mean curvature flows on graphs in warped product manifolds, especially at infinity.
method Analysis of curve shortening flow and mean curvature flow on geodesic graphs for various warping functions.
result Long-time existence of mean curvature flows and vanishing of curvature and derivatives at infinity.
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.
Asymptotic dimension of planes and graphs is at most three.
problem Understanding the geometric complexity of planes and graphs.
method Analyzing geodesic spaces and their homeomorphisms to subsets in the plane.
result The asymptotic dimension of the plane and any planar graph is at most three.
Study excursions of geodesics in RAAGs and graph products, finding a log(n) max excursion.
problem Understanding geodesic excursions in RAAGs and graph products.
method Defined and studied excursions in subgroups of groups, focusing on right-angled Artin groups and graph products.
result Max excursion of generic geodesics in flat tends to log(n) for irreducible RAAGs.
Develops active intervals for geodesics in Teichmüller space.
problem Understanding geodesics in Teichmüller space with no backtracking.
method Defines active intervals for subsurfaces along geodesics in Thurston metric.
result Active intervals represent reparametrized quasi-geodesics in curve graphs with bounded movement outside.
The study connects geodesic flows on Riemann surfaces to random walks on their dual graphs.
problem Understanding ergodicity of geodesic flows on infinite Riemann surfaces.
method Analyzing random walks on the dual graph of pants decompositions.
result Equivalence between ergodicity of geodesic flows and recurrence of random walks.
Study geodesics in 3-torus, determining complements' topology.
problem Understanding the topology of geodesic complements in 3-torus.
method Analyzes the orbit of direction vectors under PSL3(Z) action and uses Farey graph distances. result Determines homeomorphism type of geodesic complements in 3-torus.
We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be given for the diameter of the geodesic image. We also generalize the theorem for pro…
Geodesics count exponentially between triangulations of surfaces with enough topology.
problem Counting geodesics in triangulations of surfaces.
method Analyzing the flip-graph of triangulations and their geodesics.
result The number of geodesics grows exponentially for surfaces with enough topology.
The study examines graphs over domains in product manifolds, revealing properties of geodesics and constant curvature.
problem Properties of graphs over domains in product manifolds.
method Analyzes minimal, translating, and CMC graphs over domains with piecewise smooth boundaries.
result Geodesic arcs in the boundary of domains for minimal and translating graphs, and constant curvature for CMC graphs.
Study distance and intersection number in curve graphs of surfaces.
problem Understanding the relationship between distance and intersection number in curve graphs of surfaces.
method Introduced efficient geodesics and studied rectangles called spirals in the cellular decomposition.
result Developed an algorithm to reduce intersection number while preserving distance.
The study combines graph-minors and metric spaces, answering some questions and conjectures.
problem Whether geodesic metric spaces without a fat H minor are quasi-isometric to graphs without H minor. method Combining graph-minors and coarse geometry, answering affirmatively for small H. result Affirmative answer for small H in the problem statement. We characterize strongly Morse quasi-geodesics in Outer space as quasi-geodesics which project to quasi-geodesics in the free factor graph. We define convex cocompact subgroups of Out(Fn) as subgroups such that an orbit map in the free factor graph is a quasi-isometric embedding, and we characterize such groups via …
We embed directed acyclic graphs using hyperbolic spaces and geodesic cones.
problem Learning graph representations that preserve hierarchical structure.
method Use hyperbolic spaces and geodesic cones to define embeddings of directed acyclic graphs.
result Our method significantly outperforms existing approaches in graph representation learning.
Theorem shows generic metrics yield non-degenerate geodesic nets.
problem Characterizing geodesic nets on generic metrics.
method Proving all connected embedded nets are non-degenerate for Baire-generic metrics.
result All stationary geodesic nets are non-degenerate for generic metrics.
Since their introduction by Thurston, geodesic laminations on hyperbolic surfaces occur in many contexts. In this paper, we propose a generalization of geodesic laminations on locally CAT(0), complete, geodesic metric spaces, whose boundary at infinity of the universal cover is endowed with a invariant total cyclic ord…
The paper studies circle packings on surfaces with boundary and their total geodesic curvatures.
problem Existence and rigidity of circle packings with conical singularities.
method Variational principle and combinatorial Ricci flow.
result Existence and rigidity of circle packings with prescribed total geodesic curvature.
Counting periodic geodesics of bounded length and commutator structure on hyperbolic surfaces.
problem Counting periodic geodesics with specific commutator structure.
method Reduction to counting critical realizations of trivalent graphs.
result Asymptotic count of geodesics with bounded length and commutator structure.
We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve graph of a compact orientable surface. We use this to conclude that a curve graph h…
Random walks on mapping class groups identified with geodesic laminations.
problem Understanding random walks on mapping class groups.
method Electrification of curve graph, identifying Poisson boundary, using geodesic laminations.
result Random walk on mapping class group identified with geodesic laminations.
Develops a method to construct entire minimal graphs of odd dimensions.
problem Constructing entire minimal graphs of odd dimensions and arbitrary codimensions.
method Evolving-plane ansatz reducing minimal surface system to geodesic equation on Grassmannian.
result Yields a rich family of explicit entire minimal graphs of odd dimension and arbitrary codimension.
We prove that a foliation (M,F) of codimension q on a n-dimen\-sio\-nal pseudo-Riemannian manifold is pseudo-Riemannian if and only if any geodesic that is orthogonal at one point to a leaf is orthogonal to every leaf it intersects. We show that on the graph G=G(F) of a pseudo-Riemannian foliation there exis…
Geodesics in mapping class group show unexpected behaviors.
problem Understanding geodesics and quasi-geodesics in mapping class groups.
method Constructing explicit examples and analyzing projections.
result Geodesics in mapping class group can have unexpected properties, e.g., not being quasi-geodesics.