2 - Random graphs from restricted classes
Published online by Cambridge University Press: 05 May 2016
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Random Graphs, Geometry and Asymptotic Structure , pp. 28 - 66Publisher: Cambridge University PressPrint publication year: 2016
References
[3] and , Analytic Combinatorics. Cambridge University Press, Cambridge, 2009.CrossRefGoogle Scholar
[4] , , , and , Boltzmann samplers for the random generation of combinatorial structures, Comb. Probab. Comput., 13(4–5) (2004), 577–625.Google Scholar
[5] , , and , Boltzmann sampling of unlabelled structures. Pages 201–211 of: Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics. SIAM, Philadelphia, PA, 2007.Google Scholar
[6] , , , and , Boltzmann samplers, Pólya theory, and cycle pointing, SIAM J. Comput., 40(3) (2011), 721–769.CrossRefGoogle Scholar
[7] and , The Probabilistic Method. With an Appendix on the Life and Work of Paul Erdõs, 3rd edn, John Wiley & Sons, Hoboken, NJ, 2008.Google Scholar
[8] and , An elementary proof of the local central limit theorem, J. Theor. Probab., 8(3) (1995), 693–701.CrossRefGoogle Scholar
[9] , Random Trees. An Interplay between Combinatorics and Probability, Springer, Wien, 2009.Google Scholar
[10] , Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation, Probab. Surv., 9 (2012), 103–252.CrossRefGoogle Scholar
[11] , A generalization of the ballot problem and its application in the theory of queues, J. Am. Stat. Assoc., 57 (1962), 327–337.Google Scholar
[13] and , Asymptotic enumeration and limit laws of planar graphs, J. Am. Math. Soc., 22(2) (2009), 309–329.Google Scholar
[14] and , Maximal biconnected subgraphs of random planar graphs, ACM Trans. Algorithms, 6(2) (2010), 21.CrossRefGoogle Scholar
[15] and , 3-connected cores in random planar graphs, Comb. Probab. Comput., 20(3) (2011), 381–412.CrossRefGoogle Scholar
[16] , , and , Graph classes with given 3-connected components: asymptotic enumeration and random graphs, Random Struct. Algorithms, 42(4) (2013), 438–479.CrossRefGoogle Scholar
[17] , , , , and , Asymptotic study of subcritical graph classes, SIAM J. Discrete Math., 25(4) (2011), 1615–1651.CrossRefGoogle Scholar
[18] , , and , The degree sequence of random graphs from subcritical classes, Comb. Probab. Comput., 18(5) (2009), 647–681.CrossRefGoogle Scholar
[19] , , and , Degree distribution in random planar graphs, J. Comb. Theory, Ser. A, 118(7) (2011), 2102–2130.CrossRefGoogle Scholar
[20] , , and , Scaling limits of random graphs from subcritical classes, Ann. of Prob. Accepted for publication.Google Scholar
[21] , Une théorie combinatoire des séries formelles, Adv. in Math., 42(1) (1981), 1–82.CrossRefGoogle Scholar
[22] , , and , Combinatorial Species and Tree-like Structures. Encyclopedia of Mathematics and Its Applications, vol. 67. Cambridge University Press, Cambridge, 1998. Translated from the 1994 French original by Margaret Readdy, with a foreword by Gian-Carlo Rota.Google Scholar
[23] , Uniform random sampling of planar graphs in linear time, Random Struct. Algorithms, 35(4) (2009), 464–522.CrossRefGoogle Scholar
[25] , , , and , The number of graphs not containing K3,3 as a minor, Electron. J. Comb., 15(1) (2008), research paper r114, 20.Google Scholar