Percolation/Mean cluster density: Difference between revisions
Content added Content deleted
(Promote to full task from draft.) |
|||
| Line 1: | Line 1: | ||
{{ |
{{task|Percolation Simulations}}{{Percolation Simulation}} |
||
Let <math>c</math> be a 2D boolean square matrix of <math>n \times n</math> values of either <tt>1</tt> or <tt>0</tt> where the |
Let <math>c</math> be a 2D boolean square matrix of <math>n \times n</math> values of either <tt>1</tt> or <tt>0</tt> where the |
||
probability of any value being <tt>1</tt> is <math>p</math>, (and of <tt>0</tt> is therefore <math>1-p</math>). |
probability of any value being <tt>1</tt> is <math>p</math>, (and of <tt>0</tt> is therefore <math>1-p</math>). |
||