First Passage Percolation

First passage percolation is a mathematical method used to describe the paths reachable in a random medium within a given amount of time.

Introduction

First passage percolation is one of the most classical areas of probability theory. It was first introduced by John Hammersley and Dominic Welsh in 1965 as a model of fluid flow in a porous media. It is part of percolation theory, and classical Bernoulli percolation can be viewed as a subset of first passage percolation.

Most of the beauty of the model lies in its simple definition (as a random metric space) and the property that several of its fascinating conjectures do not require much effort to be stated. Most times, the goal of first passage percolation is to understand a random distance on a graph, where weights are assigned to edges. Most questions are tied to either find the path with the least weight between two points, known as a geodesic, or to understand how the random geometry behaves in large scales.

Mathematics

As is the case in percolation theory in general, many of the problems related to first passage percolation involve finding optimal routes or optimal times.
The model is defined as follows.
Let $G$ be a graph. We place a non-negative random variable $t(e)$, called the passage time of the edge $e$, at each nearest-neighbor edge of the graph $G$. The collection $t(e)$ is usually assumed to be independent, identically distributed but there are variants of the model.
The random variable $t(e)$ is interpreted as the time or the cost needed to traverse edge $e$.

Since each edge in first passage percolation has its own individual weight (or time) we can write the total time of a path as the summation of weights of each edge in the path.

:$T(\gamma)= \sum_ t(e_i).$

Given two vertices $x,y$ of $G$ one then sets

:$T(x,y) = \inf_ T(\gamma),$
where the infimum is over all finite paths that start at $x$ and end at $y$.
The function $T$ induces a random pseudo-metric on $G$.

The most famous model of first passage percolation is on the lattice $\mathbb Z^d$. One of its most notorious questions is "What does a ball of large radius look like?". This question was raised in the original paper of Hammersley and Welsh in 1969 and gave rise to the Cox-Durrett limit shape theorem in 1981.
Although the Cox-Durrett theorem provides existence of the limit shape, not many properties of this set are known. For instance, it is expected that under mild assumptions this set should be strictly convex. As of 2016, the best result is the existence of the Auffinger-Damron differentiability point in the Cox-Liggett flat edge case.

There are also some specific examples of first passage percolation that can be modeled using Markov chains. For example: a complete graph can be described using Markov chains and recursive trees and 2-width strips can be described using a Markov chain and solved using a Harris chain.

Applications

First passage percolation is well-known for giving rise to other tools of mathematics, including the Subadditive Ergodic Theorem, a fundamental result in ergodic theory.

Outside mathematics, the Eden growth model is used to model bacteria growth and deposition of material. Another example is comparing a minimized cost from the Vickrey–Clarke–Groves auction (VCG-auction) to a minimized path from first passage percolation to gauge how pessimistic the VCG-auction is at its lower limit. Both problems are solved similarly and one can find distributions to use in auction theory.

References

{{Reflist

Network theory
Combinatorics
Percolation theory