相关论文: Estimates for the empirical distribution along a g…
We consider the first passage percolation model on the square lattice with an edge weight distribution F. In this paper, we consider the number of optimal paths for two points separated by a long distance. We show that there is a phase…
We give an elementary proof that Talagrand's sub-Gaussian concentration inequality implies a limit shape theorem for first passage percolation on any Cayley graph of Z^d, with a bound on the speed of convergence that slightly improves…
We investigate the distribution of lengths obtained by intersecting a random geodesic with a geodesic lamination. We give an explicit formula for the distribution for the case of a maximal lamination and show that the distribution is…
We celebrate the 50th anniversary of one the most classical models in probability theory. In this survey, we describe the main results of first passage percolation, paying special attention to the recent burst of advances of the past 5…
We establish estimates for the coalescence time of semi-infinite directed geodesics in the planar corner growth model with i.i.d. exponential weights. There are four estimates: upper and lower bounds on the probabilities of both fast and…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on…
Geodesic problems involve computing trajectories between prescribed initial and final states to minimize a user-defined measure of distance, cost, or energy. They arise throughout physics and engineering -- for instance, in determining…
We consider a sparse Erd\H{o}s--R\'{e}nyi graph $\mathcal{G}(n,\lambda/n)$ where each edge is independently assigned a random signed weight. For two uniformly chosen vertices, we study the joint distribution of the total weights and…
We present a first numerical investigation of the accuracy of the recently proposed {\em non-classical transport equation}. This equation contains an extra independent variable (the path-length $s$), and models particle transport taking…
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…
We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends…
One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical iid transmission time $L_{xy}$ is…
We endow the set of probability measures on a weighted graph with a Monge--Kantorovich metric, induced by a function defined on the set of vertices. The graph is assumed to have $n$ vertices and so, the boundary of the probability simplex…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…
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…
In this paper we study the ergodic theory of the geodesic flow on negatively curved geometrically finite manifolds. We prove that the measure theoretic entropy is upper semicontinuous when there is no loss of mass. In case we are losing…
We study electron transport at the edge of a generic disordered two-dimensional topological insulator, where some channels are topologically protected from backscattering. Assuming the total number of channels is large, we consider the edge…
We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…