Percolation threshold is a mathematical concept related to percolation theory, which is 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.
How can we calculate a percolation threshold of a graph/network using Mathematica?
The question is how to exctract the probability that these networks are being connected? What is the critical treshold or bond percolation?