On the Largest Component of the Random Graph at a Nearcritical Stage
Author:
- Boris PittelBPBoris Pittel
- 1 July 2001
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 82 (2) , 237-269
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Brownian excursions, critical random graphs and the multiplicative coalescentThe Annals of Probability, 1997
- The structure of a random graph at the point of the phase transitionTransactions of the American Mathematical Society, 1994
- The birth of the giant componentRandom Structures & Algorithms, 1993
- Components of Random ForestsCombinatorics, Probability and Computing, 1992
- On the random graph structure near the critical pointDiscrete Mathematics and Applications, 1991
- Component behavior near the critical point of the random graph processRandom Structures & Algorithms, 1990
- The asymptotic number of labeled connected graphs with a given number of vertices and edgesRandom Structures & Algorithms, 1990
- On the Behavior of a Random Graph Near a Critical PointTheory of Probability & Its Applications, 1987
- Linear probing: The probable largest search time grows logarithmically with the number of recordsJournal of Algorithms, 1987
- The Evolution of Random GraphsTransactions of the American Mathematical Society, 1984