0

Fix $0 < p < 1$ and let $G$ be a random graph on elements $\mathbb{N}$ where for $n,m \in \mathbb{N}$, the probability that there is an edge between $n$ and $m$ will $p$. What is the probability (in terms of $p$) that $G$ will be connected?

JustAskin
  • 802
  • 6
  • 14
  • See this question: http://math.stackexchange.com/questions/584228/exact-probability-of-random-graph-being-connected Edit: nevermind I misread the question I wasn't thinking about infinite graphs. – Ben Oct 28 '15 at 00:54
  • 1
    Hint: you can actually prove that between every pair of distinct vertices there is (with probability 1) a path of length 2. – David Hackenger Oct 28 '15 at 01:01
  • @DavidHackenger Well that's that. If you type that into an answer I'll accept it. – JustAskin Oct 28 '15 at 01:08

1 Answers1

0

Hint: you can actually prove that between every pair of distinct vertices there is a path of length 2 (with probability 1).

David Hackenger
  • 518
  • 2
  • 8