Related papers: Geodesic trees in last passage percolation and som…
We consider the coarse-geometric notion of ends in the context of coarse homotopy. We show that, when recontextualized as a functor from an appropriate coarse category of proper geodesic spaces, the set of ends $\mathcal{E}\text{nds}(-)$ is…
Hammersley's Last-Passage Percolation (LPP), also known as Ulam's problem, is a well-studied model that can be described as follows: consider $m$ points chosen uniformly and independently in $[0,1]^2$, then what is the maximal number…
We present two algorithms for computing the geodesic distance between phylogenetic trees in tree space, as introduced by Billera, Holmes, and Vogtmann (2001). We show that the possible combinatorial types of shortest paths between two trees…
Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…
We consider directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times on the vertices. A topic of great interest is the coupling structure of the weights of geodesics as the endpoints are varied spatially and…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
This article studies several properties of the half-space last passage percolation, in particular the two-time covariance. We show that, when the two end-points are at small macroscopic distance, then the first order correction to the…
A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…
For directed Bernoulli last passage percolation with i.i.d.~weights on vertices over a $n\times n$ grid and for $n$ large enough, the geodesics are shown to be concentrated in a cylinder, centered on the main diagonal and of width of order…
In this paper we continue our earlier work about topological first passage percolation and answer certain questions asked in our previous paper. Notably, we prove that apart from trivialities, in the generic configuration there exists…
In this paper we study stationary last passage percolation (LPP) in half-space geometry. We determine the limiting distribution of the last passage time in a critical window close to the origin. The result is a new two-parameter family of…
We consider planar stationary exponential Last Passage Percolation in the positive quadrant with boundary weights. For $\rho\in (0,1)$ and points $v_N=((1-\rho)^2 N,\rho^2 N)$ going to infinity along the characteristic direction, we…
Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer $s$ such that every vertex lies in at most $s$ bags. A…
An optimal transport path may be viewed as a geodesic in the space of probability measures under a suitable family of metrics. This geodesic may exhibit a tree-shaped branching structure in many applications such as trees, blood vessels,…
In proper hyperbolic geodetic spaces we construct rooted $\mathbb R$-trees with the following properties. On the one hand, every ray starting at the root is quasi-geodetic; so these $\mathbb R$-trees represent the space itself well. At the…
In this article, we study the geodesic problem in a generalized metric space, in which the distance function satisfies a relaxed triangle inequality $d(x,y)\leq \sigma (d(x,z)+d(z,y))$ for some constant $\sigma \geq 1$, rather than the…
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…
We consider fixed-point equations for probability distributions on isometry classes of measured metric spaces. The construction is required to be recursive and tree-like, but we allow loops for the geodesics between points in the support of…