Related papers: Directed distances in bipolar-oriented triangulati…
The notions of unimodular Minkowski and Hausdorff dimensions are defined in [arXiv:1807.02980] for unimodular random discrete metric spaces. The present paper is focused on the connections between these notions and the polynomial growth…
This work is the first in a series of papers devoted to the construction and study of scaling limits of dynamical and near-critical planar percolation and related objects like invasion percolation and the Minimal Spanning Tree. We show here…
Optimal Transport has received much attention in Machine Learning as it allows to compare probability distributions by exploiting the geometry of the underlying space. However, in its original formulation, solving this problem suffers from…
We continue the study of the analogue of Thurston's metric on the Teichm{\"u}ller space of Euclidean triangle which was started by Saglam and Papadopoulos in [1].By direct calculation, we give explicit expressions of the distance function…
Let $\eta_t$ be a Poisson point process of intensity $t\geq 1$ on some state space $\Y$ and $f$ be a non-negative symmetric function on $\Y^k$ for some $k\geq 1$. Applying $f$ to all $k$-tuples of distinct points of $\eta_t$ generates a…
We present different continuous models of random geometry that have been introduced and studied in the recent years. In particular, we consider the Brownian map, which is the universal scaling limit of large planar maps in the…
In recent decades, much attention has been focused on the topic of optimal paths in weighted networks due to its broad scientific interest and technological applications. In this work we revisit the problem of the optimal path between two…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
We study the graph structure of large random dissections of polygons sampled according to Boltzmann weights, which encompasses the case of uniform dissections or uniform $p$-angulations. As their number of vertices $n$ goes to infinity, we…
We study the total $\alpha$-powered length of the rooted edges in a random minimal directed spanning tree - first introduced in Bhatt and Roy (2004) - on a Poisson process with intensity $s \ge 1$ on the unit cube $[0,1]^d$ for $d \ge 3$.…
We study three kinetic Langevin samplers including the Euler discretization, the BU and the UBU splitting scheme. We provide contraction results in $L^1$-Wasserstein distance for non-convex potentials. These results are based on a carefully…
Coalescing simple random walks in the plane form an infinite tree. A natural directed distance on this tree is given by the number of jumps between branches when one is only allowed to move in one direction. The Brownian web distance is the…
We consider the continuum directed random polymer (CDRP) model that arises as a scaling limit from $1+1$ dimensional directed polymers in the intermediate disorder regime. We show that for a point-to-point polymer of length $t$ and any…
The Busemann function has recently found much interest in a variety of geometric machine learning problems, as it naturally defines projections onto geodesic rays of Riemannian manifolds and generalizes the notion of hyperplanes. As several…
We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process. The approaches are (i) shortest path from origin through some…
We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in $\mathbb{R}^d$. These metrics are natural discrete counterparts to the Kantorovich metric $\mathbb{W}_2$, defined using a…
Let $\{U^N_t\}_{t\ge 0}$ be a standard Brownian motion on $\mathbb{U}(N)$. For fixed $N\in\mathbb{N}$ and $t>0$, we give explicit bounds on the $L_1$-Wasserstein distance of the empirical spectral measure of $U^N_t$ to both the…
Two recent landmark experiments have performed Gaussian boson sampling (GBS) with a non-programmable linear interferometer and threshold detectors on up to 144 output modes (see Refs.~\onlinecite{zhong_quantum_2020,zhong2021phase}). Here we…
We prove a limit shape theorem describing the asymptotic shape of bumping routes when the Robinson-Schensted algorithm is applied to a finite sequence of independent, identically distributed random variables with the uniform distribution…
We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when distances are measured using a somewhat unorthodox but natural measure: the distance between $u$ and $v$ is the minimum of the shortest path…