Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2016/iii/paper-204/1/a/solution
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 204 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
In bond percolation on an undirected graph , a configuration is . The edge is open when and closed when . Under , the coordinates are independent and identically distributed random variables with the Bernoulli distribution of parameter . For a countable edge set, use the product sigma-algebra and the product measureThe open edges form a random subgraph with the original graph vertices. Its connected components of a graph are the percolation clusters. Write when an open graph path joins to ; a zero-length graph path is allowed, so always holds. The randomness is in the independently open bonds; all vertices remain present.
New to topics? Read the docs here!