相关论文: One-point large deviations of the directed landsca…
We will develop simple relations between the arc-lengths of a pair of geodesics that share common end-points. The two geodesics differ only by the requirement that one is constrained to lie in a subspace of the parent manifold. We will…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
We consider the geodesic of the directed last passage percolation with iid exponential weights. We find the explicit one-point distribution of the geodesic location joint with the last passage times, and its limit as the parameters go to…
In a recent work [Phys. Rev. E 109, L042102 (2024)], interesting dimensional crossovers [from two- to one-dimensional (2D to 1D) scaling] were found in the growth of Kardar-Parisi-Zhang (KPZ) interfaces on rectangular substrates, with…
A maximal geodesic in a graph is a geodesic (alias shortest path) which is not a subpath of a longer geodesic. The geodesic-transversal problem in a graph $G$ is introduced as the task to find a smallest set $S$ of vertices of $G$ such that…
In 2008, Vallentin made a conjecture involving the least distortion of an embedding of a distance-regular graph into Euclidean space. Vallentin's conjecture implies that for a least distortion Euclidean embedding of a distance-regular graph…
In this article, we consider the motion planning of a rigid object on the unit sphere with a unit speed. The motion of the object is constrained by the maximum absolute value, $U_{max}$ of geodesic curvature of its path; this constrains the…
We study the local geometry of the space of horizontal curves with endpoints freely varying in two given submanifolds $\mathcal P$ and $\mathcal Q$ of a manifold $\mathcal M$ endowed with a distribution $\mathcal D\subset T\M$. We give a…
The aim of this paper is to characterize in terms of coding a set of limit points considered in a paper of F. Riquelme and A. Velozo corresponding to geodesic rays which spend less time in any compact region of a pair of pants with one…
In this paper, we obtain optimal uniform lower tail estimates for the probability distribution of the properly scaled length of the longest up/right path of the last passage site percolation model considered by Johansson in [12]. The…
In first-passage percolation (FPP), one places nonnegative random variables (weights) $(t_e)$ on the edges of a graph and studies the induced weighted graph metric. We consider FPP on $\mathbb{Z}^d$ for $d \geq 2$ and analyze the geometric…
The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…
We study first-order optimization algorithms for computing the barycenter of Gaussian distributions with respect to the optimal transport metric. Although the objective is geodesically non-convex, Riemannian GD empirically converges…
In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…
The paper is a study of geodesic in two-dimensional pseudo-Riemannian metrics. Firstly, the local properties of geodesics in a neighborhood of generic parabolic points are investigated. The equation of the geodesic flow has singularities at…
A (directed) linear forest is a (di)graph whose components are (directed) paths. The linear arboricity $la(F)$ of a (di)graph $F$ is the minimum number of (directed) linear forests required to decompose its edges. Akiyama, Exoo, and Harary…
Optimal transport with quadratic cost provides a geometric framework for steering an ensemble, modeled by a probability law, with minimal effort. Yet ambient-space formulations become unwieldy in high dimensions, and sensing or actuation in…
We consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of…
This paper establishes connections between three of the most prominent metrics used in the analysis of persistence diagrams in topological data analysis: the bottleneck distance, Patel's erosion distance, and Bubenik's landscape distance.…
The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree $T$ with $k$ edges whose maximum…