Graphon convergence of random cographs

We study the behaviour of random labelled and unlabelled cographs with n vertices as n tends to infinity. Our main result is a novel probabilistic limit in the space of graphons.

[1]  Benedikt Stufler.  Limits of random tree-like discrete structures , 2016, Probability Surveys.

[2]  Mathilde Bouvel,et al.  The Brownian limit of separable permutations , 2016, The Annals of Probability.

[3]  Richard Ehrenborg,et al.  Schröder Parenthesizations and Chordates , 1994, J. Comb. Theory, Ser. A.

[4]  Benedikt Stufler.  Random Enriched Trees with Applications to Random Graphs , 2018, Electron. J. Comb..

[5]  S. Janson,et al.  Sesqui-type branching processes , 2017, Stochastic Processes and their Applications.

[6]  Guy Louchard,et al.  Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

[7]  K. Chung,et al.  Limit Distributions for Sums of Independent Random Variables , 1955 .

[8]  Vlady Ravelomanana,et al.  Asymptotic enumeration of cographs , 2001, Electron. Notes Discret. Math..

[9]  Frédérique Bassino,et al.  Universal limits of substitution-closed permutation classes , 2017, 1706.08333.

[10]  K. Panagiotou,et al.  Scaling limits of random Pólya trees , 2015, 1502.07180.

[11]  B. Gnedenko,et al.  Limit Distributions for Sums of Independent Random Variables , 1955 .

[12]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[13]  P. Diaconis,et al.  Graph limits and exchangeable random graphs , 2007, 0712.2749.

[14]  S. Janson,et al.  Graph limits and exchangeable random graphs , 2007, 0712.2749.

[15]  B'en'edicte Haas,et al.  Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered trees , 2010, 1003.3632.

[16]  Frédérique Bassino,et al.  Scaling limits of permutation classes with a finite specification: A dichotomy , 2019, Advances in Mathematics.

[17]  Michel Habib,et al.  A Simple Linear Time LexBFS Cograph Recognition Algorithm , 2003, WG.

[18]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[19]  Manuel Bodirsky,et al.  Boltzmann Samplers, Pólya Theory, and Cycle Pointing , 2010, SIAM J. Comput..

[20]  David Aldous,et al.  The Continuum Random Tree III , 1991 .

[21]  Philippe Flajolet,et al.  Boltzmann Sampling of Unlabeled Structures , 2007, ANALCO.

[22]  A. Shiryaev,et al.  Limit Theorems for Stochastic Processes , 1987 .

[23]  Jean-François Marckert,et al.  The CRT is the scaling limit of unordered binary trees , 2009, Random Struct. Algorithms.

[24]  O. Riordan,et al.  The phase transition in bounded-size Achlioptas processes , 2017, 1704.08714.

[25]  N. Sadagopan,et al.  On some combinatorial problems in cographs , 2018, ArXiv.

[26]  M. Bouvel,et al.  A decorated tree approach to random permutations in substitution-closed classes , 2019, Electronic Journal of Probability.