Papers
Topics
Authors
Recent
Search
2000 character limit reached

First passage percolation and escape strategies

Published 14 Jul 2012 in math.PR | (1207.3456v2)

Abstract: Consider first passage percolation on $\mathbb{Z}d$ with passage times given by i.i.d. random variables with common distribution $F$. Let $t_\pi(u,v)$ be the time from $u$ to $v$ for a path $\pi$ and $t(u,v)$ the minimal time among all paths from $u$ to $v$. We ask whether or not there exist points $x,y \in \mathbb{Z}d$ and a semi-infinite path $\pi=(y_0=y,y_1,\dots)$ such that $t_\pi(y, y_{n+1})<t(x,y_n)$ for all $n$. Necessary and sufficient conditions on $F$ are given for this to occur. When the support of $F$ is unbounded, we also obtain results on the number of edges with large passage time used by geodesics.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.