Related papers: On The Time Constant for Last Passage Percolation …

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…

For a given dimension d $\ge$ 2 and a finite measure $\nu$ on (0, +$\infty$), we consider $\xi$ a Poisson point process on R d x (0, +$\infty$) with intensity measure dc $\otimes$ $\nu$ where dc denotes the Lebesgue measure on R d. We…

We analyze the geometrical structure of the passage times in the last passage percolation model. Viewing the passage time as a piecewise linear function of the weights we determine the domains of the various pieces, which are the subsets of…

We consider the first passage percolation model on $\mathbf{Z}^2$. In this model, we assign independently to each edge $e$ a passage time $t(e)$ with a common distribution $F$. Let $T(u,v)$ be the passage time from $u$ to $v$. In this…

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 show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known…

We consider first-passage percolation (FPP) on the triangular lattice with vertex weights $(t_v)$ whose common distribution function $F$ satisfies $F(0)=1/2$. This is known as the critical case of FPP because large (critical) zero-weight…

We consider first-passage percolation on the two-dimensional integer lattice Z^2 with passage times that are IID exponentials of mean one. It has been conjectured, based on numerical evidence, that the variance of the time T(0,n) to reach…

We prove Schramm's locality conjecture for Bernoulli bond percolation on transitive graphs: If $(G_n)_{n\geq 1}$ is a sequence of infinite vertex-transitive graphs converging locally to a vertex-transitive graph $G$ and $p_c(G_n) \neq 1$…

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…

We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as…

We prove results for first-passage percolation on the configuration model with i.i.d. degrees having finite mean, infinite variance and i.i.d. weights with strictly positive support of the form Y=a+X, where a is a positive constant. We…

We consider a non trivial Boolean model $\Sigma$ on ${\mathbb R}^d$ for $d\geq 2$. For every $x,y \in {\mathbb R}^d$ we define $T(x,y)$ as the minimum time needed to travel from $x$ to $y$ by a traveler that walks at speed $1$ outside…

Consider a uniformly random regular graph of a fixed degree $d\ge3$, with $n$ vertices. Suppose that each edge is open (closed), with probability $p(q=1-p)$, respectively. In 2004 Alon, Benjamini and Stacey proved that $p^*=(d-1)^{-1}$ is…

We consider directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times on the vertices. A topic of great interest is the coupling structure of the weights of geodesics as the endpoints are varied spatially and…

In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a graph going through a contagious process. It is an open…

We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…

We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly…

A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independent of the state of edges in B. For an infinite connected…

We investigate a novel first-passage percolation model, referred to as the Brochette first-passage percolation model, where the passage times associated with edges lying on the same line are equal. First, we establish a point-to-point…