Related papers: First passage percolation in Euclidean space and o…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [9]. We describe our results…
We study geodesics in the Brochette first-passage percolation model, where edges on the same axis-parallel line share a common random passage time, inducing long-range dependence. We focus on the maximal transversal deviation H n of…
For a connected network on Poisson points in the plane, consider the route-length $D(r,\theta) $ between a point near the origin and a point near polar coordinates $(r,\theta)$, and suppose $E D(r,\theta) = O(r)$ as $r \to \infty$. By…
We introduce and study a non-oriented first passage percolation model having a property of statistical invariance by time reversal. This model is defined in a graph having directed edges and the passage times associated with each set of…
We study a random perturbation of the Euclidean plane, and show that it is unlikely that the distance-minimizing path between the two points can be extended into an infinite distance-minimizing path. More precisely, we study a large class…
We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an…
We study in this paper, the first passage percolation on a random graph model, the configuration model. We first introduce, the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two…
A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…
We consider a model of long-range first-passage percolation on the $d$ dimensional square lattice $Z^d$ in which any two distinct vertices $x, y \in Z^d$ are connected by an edge having exponentially distributed passage time with mean…
The $n$-dimensional binary hypercube is the graph whose vertices are the binary $n$-tuples $\{0, 1\}^n$ and where two vertices are connected by an edge if they differ at exactly one coordinate. We prove that if the edges are assigned…
A random recursive cell splitting scheme of the $2$-dimensional unit sphere is considered, which is the spherical analogue of the STIT tessellation process from Euclidean stochastic geometry. First-order moments are computed for a large…
We consider the standard model of i.i.d. first passage percolation on Z^d given a distribution G on [0, +$\infty$] (including +$\infty$). We suppose that G({0}) > 1 -- p\_c(d), i.e., the edges of positive passage time are in the subcritical…
We extend the random walk framework to include compounded steps, providing first-passage time (FPT) properties for a new class of superdiffusive processes, which are governed by the space-fractional spectral Fokker-Planck equation. This…
We consider two different objects on super-critical Bernoulli percolation on $\mathbb{Z}^d$ : the time constant for i.i.d. first-passage percolation (for $d\geq 2$) and the isoperimetric constant (for $d=2$). We prove that both objects are…
We prove Airy process variational formulas for the one-point probability distribution of (discrete time parallel update) TASEP with general initial data, as well as last passage percolation from a general lattice path to a point. We also…
In [2], it was claimed that the time constant $\mu_{d}(e_{1})$ for the first-passage percolation model on $\mathbb Z^{d}$ is $\mu_{d}(e_{1}) \sim \log d/(2ad)$ as $d\to \infty$, if the passage times $(\tau_{e})_{e\in \mathbb E^{d}}$ are…
We study a geometric property related to spherical hyperplane tessellations in $\mathbb{R}^{d}$. We first consider a fixed $x$ on the Euclidean sphere and tessellations with $M \gg d$ hyperplanes passing through the origin having normal…
We consider the first passage percolation model on the ${\bf Z}^d$ lattice. In this model, we assign independently to each edge $e$ a non-negative passage time $t(e)$ with a common distribution $F$. Let $a_{0,n}$ be the passage time from…
In this article, we consider a generalized First-passage percolation model, where each edge in $\mathbb{Z}^d$ is independently assigned an infinite weight with probability $1-p$, and a random finite weight otherwise. The existence and…
We consider first passage percolation on certain isotropic random graphs in $\mathbb{R}^d$. We assume exponential concentration of passage times $T(x,y)$, on some scale $\sigma_r$ whenever $|y-x|$ is of order $r$, with $\sigma_r$ "growning…