Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2006 | ELECTRONIC JOURNAL OF COMBINATORICS | degree sequence,random graph,random function |
Field | DocType | Volume |
Random element,Random regular graph,Discrete mathematics,Combinatorics,Random graph,Random field,Random permutation,Multivariate random variable,Mathematics,Random function,Random compact set | Journal | 13.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 14 |
PageRank | References | Authors |
0.88 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julie Cain | 1 | 14 | 0.88 |
| Nicholas C. Wormald | 2 | 1506 | 230.43 |