Related papers: Bicycling geodesics are Kirchhoff rods
The $k$-th power of the adjacency matrix of a simple undirected graph represents the number of walks with length $k$ between pairs of nodes. As a walk where no node repeats, a path is a walk where each node is only visited once. The set of…
In a digraph $D=(V,A)$, an oriented path is a sequence $P=x_1x_2\dots x_p$ of distinct vertices such that either $x_ix_{i+1}\in A$ or $x_{i+1}x_{i}\in A$ or both for every $i\in [p-1]$. If $x_ix_{i+1}\in A$ in $P$, then $x_ix_{i+1}$ is a…
The (parallel) linear transports along paths in vector bundles are axiomatically described. Their general form and certain properties are found. It is shown that these transports are locally (i.e. along every fixed path) always Euclidean…
We show that the cyclic and epicyclic categories which play a key role in the encoding of cyclic homology and the lambda operations, are obtained from projective geometry in characteristic one over the infinite semifield F of "max-plus…
We study first-passage percolation through related optimization problems over paths of restricted length. The path length variable is in duality with a shift of the weights. This puts into a convex duality framework old observations about…
The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…
A variation of Dyck paths allows for down-steps of arbitrary length, not just one. Credits for this invention are given to Emeric Deutsch. Surprisingly, the enumeration of them is somewhat akin to the analysis of Motzkin-paths; the last…
A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain…
In any network, the interconnection of nodes by means of geodesics and the number of geodesics existing between nodes are important. There exists a class of centrality measures based on the number of geodesics passing through a vertex.…
In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…
Within the Kardar-Parisi-Zhang universality class, the space-time Airy sheet is conjectured to be the canonical scaling limit for last passage percolation models. In recent work arXiv:1812.00309 of Dauvergne, Ortmann, and Vir\'ag, this…
In 1962, Oystein Ore asked in which graphs there is exactly one geodesic between any two vertices. He called such graphs geodetic. In this paper, we systematically study properties of geodetic graphs, and also consider antipodal graphs, in…
Cycling is a crucial part of sustainable urban transportation. Promoting cycling critically relies on a sufficiently developed bicycle infrastructure. However, designing efficient bike path networks constitutes a complex problem that…
The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…
A methodology is developed for data analysis based on empirically constructed geodesic metric spaces. For a probability distribution, the length along a path between two points can be defined as the amount of probability mass accumulated…
We show that, in the Teichm\"uller metric, "thin-framed triangles are thin"---that is, under suitable hypotheses, the variation of geodesics obeys a hyperbolic-like inequality. This theorem has applications to the study of random walks on…
This article explores closed geodesics on hyperbolic surfaces. We show that, for sufficiently large $k$, the shortest closed geodesics with at least $k$ self-intersections, taken among all hyperbolic surfaces, all lie on an ideal pair of…
Arguably, geodesics are the most important geometric objects on a differentiable manifold. They describe candidates for shortest paths and are guaranteed to be unique shortest paths when the starting velocity stays within the so-called…
Manifolds discovered by machine learning models provide a compact representation of the underlying data. Geodesics on these manifolds define locally length-minimising curves and provide a notion of distance, which are key for reduced-order…
Generalized Dyck paths (or discrete excursions) are one-dimensional paths that take their steps in a given finite set S, start and end at height 0, and remain at a non-negative height. Bousquet-M\'elou showed that the generating function…