page_title: Percolation threshold
section_title: Thresholds on 2D random and quasi-lattices
hierarchical_section_title: Percolation threshold / Percolation on 2D lattices / Thresholds on 2D random and quasi-lattices
caption_attribution_description: English: The Relative Neighborhood Graph (RNG) superimposed on the underlying Delaunay Triangulation (grey).
context_page_description: 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, 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₁, p₂, ..., such that infinite connectivity first occurs.
context_section_description: *Theoretical estimate
caption: The Relative Neighborhood Graph (black lines)[103] superimposed on the Delaunay triangulation (black plus grey lines).
exif: {"Image XResolution": "150", "Image YResolution": "150", "Image ResolutionUnit": "Pixels/Inch", "Image ExifOffset": "78", "EXIF ExifImageWidth": "1022", "EXIF ExifImageLength": "1010"}