In a large range of random graphs of order n and size M(n) the distribution of the number of tree components of order k is asymptotically Poisson.
Random House | Graph of a function | graph | Random number generation | Random-access memory | Bipartite graph | random | planar graph | graph theory | Random Access Memories | directed graph | Under Graph | The Adventures of Roderick Random | random graph | Random effects model | random-access memory | Planar graph | Graph traversal | Graph theory | Graph (mathematics) | Gaussian random field | Gabriel graph | visibility graph | Unit distance graph | static random-access memory | rook's graph | Random walk hypothesis | Random Thoughts (Faye Wong album) | Random.org | Random neural network |
It can be used to prove that the Erdős–Rényi model of random graphs, when applied to countably infinite graphs, always produces a unique graph, the Rado graph.
Edgar Nelson Gilbert (July 25, 1923 – June 15, 2013) was an American mathematician and coding theorist, a longtime researcher at Bell Laboratories whose accomplishments include the Gilbert–Varshamov bound in coding theory, the Gilbert–Elliott model of bursty errors in signal transmission, and the Erdős–Rényi model for random graphs.