Random cographs: Brownian graphon limit and asymptotic degree distribution

DOI10.1002/rsa.21033zbMath1526.05123arXiv1907.08517OpenAlexW3180425134MaRDI QIDQ6074680

Valentin Féray, Mathilde Bouvel, Lucas Gerin, Adeline Pierrot, Frédérique Bassino, Mickaël Maazoun

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.08517

zbMATH Keywords

Brownian excursioncographsdegree distributiongraphons

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items (2)

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations ⋮ Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling limits of random graphs from subcritical classes
• Fundamentals of Stein's method
• The method of moments and degree distributions for network models
• A decorated tree approach to random permutations in substitution-closed classes
• Graph limits and hereditary properties
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Random trees and applications
• Complement reducible graphs
• The Brownian limit of separable permutations
• The evolution of random graphs on surfaces
• On the shape of random Pólya structures
• A simple linear time algorithm for cograph recognition
• Some families of trees arising in permutation analysis
• Universal limits of substitution-closed permutation classes
• Scaling limits of random Pólya trees
• Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
• On a property of the class of n-colorable graphs
• Random Measures, Theory and Applications
• Threshold Graph Limits and Random Threshold Graphs
• Graph limits and exchangeable random graphs
• A Simple Linear Time LexBFS Cograph Recognition Algorithm
• A Linear Recognition Algorithm for Cographs
• Graph properties, graph limits, and entropy
• Random perfect graphs
• Full asymptotic expansion for Polya structures
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• On the Brownian separable permuton
• Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
• Graphon convergence of random cographs

This page was built for publication: Random cographs: Brownian graphon limit and asymptotic degree distribution