English
Related papers

Related papers: Geodesics and Spanning Trees for Euclidean First-P…

200 papers

Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges. An open question attributed to Furstenberg is whether there exists a two-sided infinite geodesic in first passage…

Probability · Mathematics 2025-12-29 Itai Benjamini , Romain Tessera

For planar landmark based shapes, taking into account the non-Euclidean geometry of the shape space, a statistical test for a common mean first geodesic principal component (GPC) is devised. It rests on one of two asymptotic scenarios, both…

Methodology · Statistics 2010-09-17 Stephan Huckemann

Consider the geodesic flow on a real-analytic closed hypersurface $M$ of $\mathbb{R}^n$, equipped with the standard Euclidean metric. The flow is entirely determined by the manifold and the Riemannian metric. Typically, geodesic flows are…

Dynamical Systems · Mathematics 2022-09-13 Andrew Clarke

The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…

Probability · Mathematics 2017-07-04 M. T. Barlow , D. A. Croydon , T. Kumagai

We show existence, uniqueness, and directedness properties for infinite geodesics in the FPP model. After giving the fundamental definitions, we describe results by Newman and collaborators giving existence and uniqueness of directed…

Probability · Mathematics 2018-04-17 Jack Hanson

We investigate first passage percolation on inhomogeneous random graphs. The random graph model G(n,kappa) we study is the model introduced by Bollob\'as, Janson and Riordan, where each vertex has a type from a type space S and edge…

Probability · Mathematics 2016-11-14 István Kolossváry , Júlia Komjáthy

In this paper we explore first passage percolation (FPP) on the Erd\H{o}s-R\'enyi random graph $G_n(p_n)$, where each edge is given an independent exponential edge weight with rate 1. In the sparse regime, i.e., when $np_n\to \lambda>1,$ we…

Probability · Mathematics 2010-05-25 Shankar Bhamidi , Remco van der Hofstad , Gerard Hooghiemstra

Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric…

Computational Geometry · Computer Science 2024-11-26 Emilio Di Giacomo , Walter Didimo , Eleni Katsanou , Lena Schlipf , Antonios Symvonis , Alexander Wolff

For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined as $\sum_{i=1}^d…

Combinatorics · Mathematics 2024-03-14 Debsoumya Chakraborti , Ben Lund

In this note we study the geometry of the component of the origin in the Uniform Spanning Forest of $\mathbb{Z}^d$, as well as in the Uniform Spanning Tree of wired subgraphs of $\mathbb{Z}^d$, when $d \ge 5$. In particular, we study…

Probability · Mathematics 2016-02-05 Martin T. Barlow , Antal A. Járai

We establish inequalities for assessing the distance between the distribution of a (possibly multidimensional) functional of a Poisson random measure and that of a Gaussian element. Our bounds only involve add-one cost operators at the…

Probability · Mathematics 2020-10-27 Raphaël Lachièze-Rey , Giovanni Peccati , Xiaochuan Yang

We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…

Probability · Mathematics 2016-04-21 Michael Damron , Naoki Kubota

We study Busemann functions, semi-infinite geodesics, and competition interfaces in the exactly solvable last-passage percolation with inhomogeneous exponential weights. New phenomena concerning geodesics arise due to inhomogeneity. These…

Probability · Mathematics 2025-09-08 Elnur Emrah , Christopher Janjigian , Timo Seppäläinen

In this paper we prove the first quantitative convergence rates for the graph infinity Laplace equation for length scales at the connectivity threshold. In the graph-based semi-supervised learning community this equation is also known as…

Probability · Mathematics 2024-02-23 Leon Bungert , Jeff Calder , Tim Roith

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,…

Metric Geometry · Mathematics 2021-09-02 Qinglan Xia

Geodesic distance, commonly called shortest path length, has proved useful in a great variety of disciplines. It has been playing a significant role in search engine at present and so attracted considerable attention at the last few…

Combinatorics · Mathematics 2019-09-17 Xudong Luo , Fei Ma , Wentao Xu

It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which…

Geometric Topology · Mathematics 2010-02-08 Álvaro Martínez-Pérez

In this paper we study the ergodic theory and thermodynamic formalism of the geodesic flow on non-compact pinched negatively curved manifolds. We consider two notions of entropy at infinity, the topological and the measure theoretic entropy…

Dynamical Systems · Mathematics 2019-03-06 Anibal Velozo

Liouville first passage percolation (LFPP) with parameter $\xi >0$ is the family of random distance functions $\{D_h^\epsilon\}_{\epsilon >0}$ on the plane obtained by integrating $e^{\xi h_\epsilon}$ along paths, where $h_\epsilon$ for…

Probability · Mathematics 2021-03-22 Jian Ding , Ewain Gwynne

A Euclidean noncrossing Steiner $(1+\epsilon)$-spanner for a point set $P\subset\mathbb{R}^2$ is a planar straight-line graph that, for any two points $a, b \in P$, contains a path whose length is at most $1+\epsilon$ times the Euclidean…

Computational Geometry · Computer Science 2026-02-23 Sujoy Bhore , Sándor Kisfaludi-Bak , Lazar Milenković , Csaba D. Tóth , Karol Węgrzycki , Sampson Wong
‹ Prev 1 3 4 5 6 7 10 Next ›