On Some Features of the Structure of a Random Graph Near a Critical Point

Abstract

Next article On Some Features of the Structure of a Random Graph Near a Critical PointV. E. StepanovV. E. Stepanovhttps://doi.org/10.1137/1132091PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] P. Erdös and , A. Rényi, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl., 5 (1960), 17–61 23:A2338 0103.16301 Google Scholar[2] V. E. Stepanov , Random graphs , Problems of Cybernetics, USSR Academy of Sciences scientific committee on the comprehensive problem “Cybernetics” , Moscow , 1973 , 164 – 185 , (In Russian.) Google Scholar[3] V. E. Stepanov, Phase transitions, Theory Probab. Appl., 15 (1970), 187–204 10.1137/1115027 LinkGoogle Scholar[4] V. E. Stepanov, The structure of the random graphs $\mathcal{G}_{m}(x/h)$, Theory Probab. Appl., 17 (1972), 227–242 10.1137/1117028 0264.90048 LinkGoogle Scholar[5] V. F. Kolchin, On the behavior of a random graph near a critical point, Theory Probab. Appl., 31 (1986), 439–451 10.1137/1131058 0616.60013 LinkGoogle Scholar[6] Béla Bollobás, The evolution of random graphs, Trans. Amer. Math. Soc., 286 (1984), 257–274 85k:05090 0579.05046 CrossrefGoogle Scholar[7] Nicholas C. Wormald, The asymptotic connectivity of labelled regular graphs, J. Combin. Theory Ser. B, 31 (1981), 156–167 83e:05077 0442.05043 CrossrefGoogle Scholar Next article FiguresRelatedReferencesCited byDetails Counting strongly-connected, moderately sparse directed graphs6 June 2012 | Random Structures & Algorithms, Vol. 43, No. 1 Cross Ref On the Largest Component of the Random Graph at a Nearcritical StageJournal of Combinatorial Theory, Series B, Vol. 82, No. 2 Cross Ref On a random graph with immigrating vertices: Emergence of the giant component1 January 2000 | Random Structures and Algorithms, Vol. 17, No. 2 Cross Ref To Prove and Conjecture: Paul Erdős and His Mathematics23 April 2018 | The American Mathematical Monthly, Vol. 105, No. 3 Cross Ref The Origins of the Theory of Random Graphs Cross Ref Phase transition phenomena in random discrete structuresDiscrete Mathematics, Vol. 136, No. 1-3 Cross Ref The structure of a random graph at the point of the phase transition1 January 1994 | Transactions of the American Mathematical Society, Vol. 341, No. 2 Cross Ref The birth of the giant componentRandom Structures and Algorithms, Vol. 4, No. 3 Cross Ref Components of Random Forests12 September 2008 | Combinatorics, Probability and Computing, Vol. 1, No. 1 Cross Ref Cycles in a random graph near the critical point5 July 2007 | Random Structures & Algorithms, Vol. 2, No. 4 Cross Ref Volume 32, Issue 4| 1988Theory of Probability & Its Applications History Submitted:17 November 1986Published online:17 July 2006 InformationCopyright © 1987 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1132091Article page range:pp. 573-594ISSN (print):0040-585XISSN (online):1095-7219Publisher:Society for Industrial and Applied Mathematics