An Entity of Type: Abstraction100002137, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

Property Value
dbo:abstract
  • 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. (en)
dbo:thumbnail
dbo:wikiPageID
  • 11790568 (xsd:integer)
dbo:wikiPageLength
  • 227323 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1120931247 (xsd:integer)
dbo:wikiPageWikiLink
dbp:align
  • left (en)
dbp:caption
  • medial dual, shown in red, with medial lattice in light gray behind it (en)
  • covering/medial lattice (en)
  • covering/medial lattice, this pattern appears in Iranian tilework. Example: Western tomb tower, Kharraqan. (en)
  • covering/medial lattice , equivalent to the kagome subnet, and in black, the dual of these lattices. (en)
dbp:direction
  • horizontal (en)
dbp:image
  • 312 (xsd:integer)
  • 482 (xsd:integer)
  • 4612 (xsd:integer)
  • medial dual.png (en)
  • medial lattice.png (en)
dbp:totalWidth
  • 400 (xsd:integer)
  • 600 (xsd:integer)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • 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. (en)
rdfs:label
  • Percolation threshold (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License