Skip to Main content Skip to Navigation
Conference papers

Rigorous Result for the CHKNS Random Graph Model

Abstract : We study the phase transition in a random graph in which vertices and edges are added at constant rates. Two recent papers in Physical Review E by Callaway, Hopcroft, Kleinberg, Newman, and Strogatz, and Dorogovstev, Mendes, and Samukhin have computed the critical value of this model, shown that the fraction of vertices in finite clusters is infinitely differentiable at the critical value, and that in the subcritical phase the cluster size distribution has a polynomial decay rate with a continuously varying power. Here we sketch rigorous proofs for the first and third results and a new estimates about connectivity probabilities at the critical value.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01183940
Contributor : Coordination Episciences Iam <>
Submitted on : Wednesday, August 12, 2015 - 9:08:24 AM
Last modification on : Tuesday, September 22, 2020 - 3:49:49 AM
Long-term archiving on: : Friday, November 13, 2015 - 11:38:14 AM

File

dmAC0109.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01183940, version 1

Collections

Citation

Rick Durrett. Rigorous Result for the CHKNS Random Graph Model. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.95-104. ⟨hal-01183940⟩

Share

Metrics

Record views

222

Files downloads

1021