# Percolation threshold

## Threshold of percolation theory models / From Wikipedia, the free encyclopedia

#### Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about Percolation threshold?

Summarize this article for a 10 year old

The **percolation threshold** is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below the threshold a giant connected component does not exist; while above it, there exists a giant component of the order of system size. In engineering and coffee making, percolation represents the flow of fluids through porous media, but in the mathematics and physics worlds it generally refers to simplified lattice models of random systems or networks (graphs), and the nature of the connectivity in them. The percolation threshold is the critical value of the occupation probability *p*, or more generally a critical surface for a group of parameters *p*_{1}, *p*_{2}, ..., such that infinite connectivity (*percolation*) first occurs.^{[1]}

This article may be too technical for most readers to understand. (March 2021) |