Percolation threshold
http://dbpedia.org/resource/Percolation_threshold an entity of type: Abstraction100002137
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 p1, p2, ..., such that infinite connectivity (percolation) first occurs.
rdf:langString
rdf:langString
Percolation threshold
xsd:integer
11790568
xsd:integer
1120931247
rdf:langString
left
rdf:langString
medial dual, shown in red, with medial lattice in light gray behind it
rdf:langString
covering/medial lattice
rdf:langString
covering/medial lattice, this pattern appears in Iranian tilework. Example: Western tomb tower, Kharraqan.
rdf:langString
covering/medial lattice , equivalent to the kagome subnet, and in black, the dual of these lattices.
rdf:langString
horizontal
xsd:integer
312
xsd:integer
482
xsd:integer
4612
rdf:langString
medial dual.png
rdf:langString
medial lattice.png
xsd:integer
400
600
rdf:langString
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 p1, p2, ..., such that infinite connectivity (percolation) first occurs.
xsd:nonNegativeInteger
227323
