I am thinking about this problem that come up in some of my work, I think this has been solved before, though I am not aware where I could find the solution. Here is the question:(adsbygoogle = window.adsbygoogle || []).push({});

Suppose a graph has say 20 nodes with no edge initially, and at each instance, 4 (different) nodes are randomly drawn with equal probability and all 6 edges among them are added to the graph. How do I estimate the expected number of iterations before the graph become connected (just connected, no need to be completed)? Thanks.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Estimation for a Graph Theory problem

Loading...

Similar Threads - Estimation Graph Theory | Date |
---|---|

A Error estimation in linear regression | Monday at 8:18 AM |

I Why is the maximum likelihood estimation accurate? | Dec 20, 2017 |

I Checking for Biased/Consistency | May 29, 2017 |

**Physics Forums - The Fusion of Science and Community**