Ratio convergence rates for Euclidean first-passage percolation: Applications to the graph
infinity Laplacian Page 1 The Annals of Applied Probability 2024, Vol. 34, No. 4, 3870–3910 …

The reaction medium controls polymerization with highly active (κ2-P, O)-
phosphinesulfonato nickel methyl complexes to afford polyethylenes ranging from low …

For rotationally invariant first passage percolation (FPP) on the plane, we use a multi-scale
argument to prove stretched exponential concentration of the first passage times at the scale …

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 …

This doctoral thesis undertakes an in-depth exploration of limiting shape theorems across
diverse mathematical structures, with a specific focus on subadditive processes within …

Given a cost functional F on paths γ in a domain D⊂ ℝ d, in the form F (γ)=∫ 0 1 f (γ (t), γ˙(t))
dt, it is of interest to approximate its minimum cost and geodesic paths. Let X ₁,..., Xn be …

We consider first passage percolation on the Erd\H {o} sR\'{e} nyi graph with $ n $ vertices in
which each pair of distinct vertices is connected independently by an edge with probability …

Let a random geometric graph be defined in the supercritical regime for the existence of a
unique infinite connected component in Euclidean space. Consider the first-passage …

We consider asymptotic properties of two functionals on Euclidean shortest-path trees
appearing in random geometric graphs in R 2 which can be used, for example, as models …

Abstract We extend the Stochastic Subscriber Line Model by the introduction of shortest-path
trees which are obtained by splitting up the segment system of the typical serving zone at its …