The degree sequence of a random graph. I. The models
From MaRDI portal
Publication:4358436
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199709)11:2<97::AID-RSA1>3.0.CO;2-O" /><97::AID-RSA1>3.0.CO;2-O 10.1002/(SICI)1098-2418(199709)11:2<97::AID-RSA1>3.0.CO;2-OzbMath0884.05081OpenAlexW1964810500MaRDI QIDQ4358436
Brendan D. McKay, Nicholas C. Wormald
Publication date: 8 March 1998
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199709)11:2<97::aid-rsa1>3.0.co;2-o
Related Items (17)
Bins and balls: Large deviations of the empirical occupancy process ⋮ Power-law decay of the degree-sequence probabilities of multiple random graphs with application to graph isomorphism ⋮ On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) ⋮ Concentration of maximum degree in random planar graphs ⋮ On anti-stochastic properties of unlabeled graphs ⋮ Asymptotic enumeration of digraphs and bipartite graphs by degree sequence ⋮ Global information from local observations of the noisy voter model on a graph ⋮ Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph ⋮ Sparse random graphs: Eigenvalues and eigenvectors ⋮ Sparse regular random graphs: spectral density and eigenvectors ⋮ Sharp thresholds for Hamiltonicity in random intersection graphs ⋮ Unveiling the interplay between degree-based graph invariants of a graph and its random subgraphs ⋮ On perfectly friendly bisections of random graphs ⋮ On isomorphism-invariant antistochastic properties of random graphs ⋮ Counting loopy graphs with given degrees ⋮ Asymptotic Enumeration of Hypergraphs by Degree Sequence ⋮ Joint Vertex Degrees in the Inhomogeneous Random Graph Model ℊ(n,{pij})
This page was built for publication: The degree sequence of a random graph. I. The models
