Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Percolation theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Mathematical theory on behavior of connected clusters in a random graph}} {{Network science}} In [[statistical physics]] and [[mathematics]], '''percolation theory''' describes the behavior of a network when nodes or links are added. This is a geometric type of [[phase transition]], since at a critical fraction of addition the network of small, disconnected clusters merge into significantly larger [[Glossary of graph theory|connected]], so-called spanning clusters. The applications of percolation theory to [[materials science]] and in many other disciplines are discussed here and in the articles [[Network theory]] and [[Percolation (cognitive psychology)]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)