Def :- Its a subject describing connected clusters in random graph.
The main objective of this subject could be explained by the following example :- Suppose a liquid is pour on the top of a porous material. Will the liquid be able to make its way from hole to hole and reach the bottom?
The problem is simulated as follow. A n*n or higher size grid is assumed and where each edge/bond is opens with probability p and close with probability 1-p. We have to find that whether there is a way from one side of the grid to other side.
One interesting result is here. We can found a probability p* higher than this the graph will almost be connected and lower than this the graph has higher probability to not to be connected.
The main objective of this subject could be explained by the following example :- Suppose a liquid is pour on the top of a porous material. Will the liquid be able to make its way from hole to hole and reach the bottom?
The problem is simulated as follow. A n*n or higher size grid is assumed and where each edge/bond is opens with probability p and close with probability 1-p. We have to find that whether there is a way from one side of the grid to other side.
 |
| Percolation Graph in a 3D grid |
 |
| Bond Percolation |
No comments:
Post a Comment