This is a request for reference. Where can I find discussion of the Erdős–Rényi random graph in the regime between "giant-component" and "fully connected"? e.g. a detailed picture for say, $p_n=\frac{(\log n)^\gamma}{n}$, with $0<\gamma<1$
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
4
|
|
|
|
|
2
|
This may not satisfy your needs, but this recent (Fall 2012) paper, or its references might help:
Among other results, they have a new proof that
|
||
|
|
You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.
|
1
|
"Random Graphs" by Bollobas has an extensive discussion of the thresholds at which various properties appear in the Erdos-Renyi model, for example the appearance of the first cycles. It's quite well-written, too. I'm familiar with the first edition, which is a little behind the times, but I see a new edition was published in 2001, which should be fairly up-to-date (the field has cooled down in the last decade). |
||
|
|


