Related papers: First passage percolation and escape strategies
New theorems for the moments of the first passage time of one dimensional nonlinear stochastic processes with an entrance boundary are formulated. This important class of one dimensional stochastic processes results among others from…
Many transport processes in ecology, physics and biochemistry can be described by the average time to first find a site or exit a region, starting from an initial position. Typical mathematical treatments are based on formulations that…
The L\'evy walk process for the lower interval of the time of flight distribution ($\alpha<1$) and with finite resting time between consecutive flights is discussed. The motion is restricted to a region bounded by two absorbing barriers and…
The non-random fluctuation is one of the central objects in first passage percolation. It was proved in [Shuta Nakajima. Divergence of non-random fluctuation in First Passage Percolation. {\em Electron. Commun. Probab.} 24 (65), 1-13.…
We present a survey of techniques to obtain upper bounds for the variance of the passage time in first-passage percolation. The methods discussed are a combination of tools from the theory of concentration of measure, some of which we…
It is well known that a continuous phase transition in Bernoulli bond percolation on the integer lattice is equivalent to a vanishing probability a vertex is invaded in invasion percolation. We provide a coupling between invasion…
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 branching random walk $\{\mathcal R^N_z: z\in V_N\}$ with Gaussian increments indexed over a two-dimensional box $V_N$ of side length $N$, and we study the first passage percolation where each vertex is assigned weight…
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…
We consider first-passage percolation with positive, stationary-ergodic weights on the square lattice $\mathbb{Z}^d$. Let $T(x)$ be the first-passage time from the origin to a point $x$ in $\mathbb{Z}^d$. The convergence of the scaled…
We study first-passage percolation through related optimization problems over paths of restricted length. The path length variable is in duality with a shift of the weights. This puts into a convex duality framework old observations about…
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…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
We study the rate of convergence in the Shape Theorem of first-passage percolation, obtaining the precise asymptotic rate of decay for the probability of linear order deviations under a moment condition. Our results are stated for a given…
For first passage percolation on $\mathbb{Z}^2$ with i.i.d. bounded edge weights, we consider the upper tail large deviation event; i.e., the rare situation where the first passage time between two points at distance $n$, is macroscopically…
We discuss the first passage time problem in the semi-infinite interval, for homogeneous stochastic Markov processes with L{\'e}vy stable jump length distributions $\lambda(x)\sim\ell^{\alpha}/|x|^{1+\alpha}$ ($|x|\gg\ell$), namely,…
We investigate the behavior of L\'{e}vy processes with convolution equivalent L\'{e}vy measures, up to the time of first passage over a high level u. Such problems arise naturally in the context of insurance risk where u is the initial…
We study a geometric version of first-passage percolation on the complete graph, known as long-range first-passage percolation. Here, the vertices of the complete graph $\mathcal K_n$ are embedded in the $d$-dimensional torus $\mathbb…
We consider directed first passage percolation on the integer lattice, with time constant $\mu$ and passage time $a_{0n}$ from the origin to $(n,0,...,0)$. It is shown that under certain conditions on the passage time distribution, $Ea_{0n}…
The global first passage time density of a network is the probability that a random walker released at a random site arrives at an absorbing trap at time T. We find simple expressions for the mean global first passage time <T> for five…