The birth of the giant component
- 1 January 1993
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 4 (3) , 233-358
- https://doi.org/10.1002/rsa.3240040303
Abstract
No abstract availableKeywords
All Related Versions
This publication has 28 references indexed in Scilit:
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsPublished by Elsevier ,2013
- Cycles in a random graph near the critical pointRandom Structures & Algorithms, 1991
- Component behavior near the critical point of the random graph processRandom Structures & Algorithms, 1990
- Wright and Stepanov-Wright coefficientsMathematical Notes, 1987
- An analysis of optimum cachingJournal of Algorithms, 1985
- The Evolution of Random GraphsTransactions of the American Mathematical Society, 1984
- The number of connected sparsely edged graphs. IV large nonseparable graphsJournal of Graph Theory, 1983
- The number of connected sparsely edged graphs. III. Asymptotic resultsJournal of Graph Theory, 1980
- FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHSThe Quarterly Journal of Mathematics, 1977
- Expansions of generalized Whittaker functionsMathematical Proceedings of the Cambridge Philosophical Society, 1954