Encores on cores
The electronic journal of combinatorics, Tome 13 (2006)
We give a new derivation of the threshold of appearance of the $k$-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on random functions, and the pairing or configuration model for random graphs with given degree sequence. Our approach also gives a simple derivation of properties of the degree sequence of the $k$-core of a random graph, in particular its relation to multinomial and hence independent Poisson variables. The method is also applied to $d$-uniform hypergraphs.
DOI :
10.37236/1107
Classification :
05C80
Mots-clés : random graph, degree sequence, Poisson variables
Mots-clés : random graph, degree sequence, Poisson variables
@article{10_37236_1107,
author = {Julie Cain and Nicholas Wormald},
title = {Encores on cores},
journal = {The electronic journal of combinatorics},
year = {2006},
volume = {13},
doi = {10.37236/1107},
zbl = {1112.05094},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1107/}
}
Julie Cain; Nicholas Wormald. Encores on cores. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1107
Cité par Sources :