1 citations · 2 across the 4 of their papers we have counts for
1 paper · 1 filter
Rohan Shah, Dirk P. Kroese
Computation of the probability that a random graph is connected is a challenging problem, so it is natural to turn to approximations such as Monte Carlo methods. We describe sequen…