相关论文: First-passage percolation on ladder-like graphs wi…

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 consider the first-passage percolation problem on effectively one-dimensional graphs with vertex set {1,...,n}\times{0,1} and translation-invariant edge-structure. For three of six non-trivial cases we obtain exact expressions for the…

We consider the first-passage percolation problem on the random graph with vertex set N\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for…

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 prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…

A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…

As a first step in the first passage problem for passive tracer in stratified porous media, we consider the case of a two-dimensional system consisting of two layers with different convection velocities. Using a lattice generating function…

In this paper we consider first-passage percolation on certain 1-dimensional periodic graphs, such as the $\Z\times\{0,1,\ldots,K-1\}^{d-1}$ nearest neighbour graph for $d,K\geq1$. We find that both length and weight of minimal-weight paths…

We study first-passage percolation where edges in the left and right half-planes are assigned values according to different distributions. We show that the asymptotic growth of the resulting inhomogeneous first-passage process obeys a shape…

First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…

Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…

We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…

We consider first passage percolation on the Erd\H{o}s--R\'{e}nyi graph with $n$ vertices in which each pair of distinct vertices is connected independently by an edge with probability $\lambda/n$ for some $\lambda>1$. The edges of the…

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 percolation model with independent and identically distributed…

First passage percolation with recovery is a process aimed at modeling the spread of epidemics. On a graph $G$ place a red particle at a reference vertex $o$ and colorless particles (seeds) at all other vertices. The red particle starts…

We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…

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 consider first-passage percolation on the edges of $\mathbb{Z}^2 \times k,$ namely the slab of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $1-p_c(\mathbb{S}_k)$) or 1 ((with probability…

This paper is a survey of various results and techniques in first passage percolation, a random process modeling a spreading fluid on an infinite graph. The latter half of the paper focuses on the connection between first passage…

In this paper, we study the maximal edge-traversal time (simply we call maximal weight hereafter) on the optimal paths in the first passage percolation for several edge distributions, including the Pareto and Weibull distributions. It is…