Probability theory and stochastic processes Definition
Percolation theory
Definition
Let be a graph with countably many vertices, each of finite degree, and let . Bernoulli bond percolation on with parameter is the product probability measure on . Under the coordinates , , are independent and . An edge is open if and closed otherwise. The open cluster of a vertex is the vertex set of the connected component of in the subgraph . For a fixed vertex , the percolation probability is . Site percolation is defined in the same way, with open and closed vertices in place of edges. Percolation theory is the study of these random clusters.
Remarks
Example: on the line graph , a cluster is infinite only if all edges on one side of up to infinity are open. This has probability for , so for and . Non-example: a random subgraph in which two edges at the same vertex are never both open is not Bernoulli percolation, since its edge states are not independent. The function is nondecreasing in , by coupling all with one family of uniform random variables on .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Connected component concept
- Graph concept
- Probability measure concept
- Percolation theory definition
Further reading
About this page
| Tag | 4QAQ2TRAY0 |
|---|---|
| URI | m2://4QAQ2TRAY0 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 60K35, 82B43 |
| Defines | Percolation theory |
| Uses | Graph, Connected component, Probability measure |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.