Graphon convergence of random cographs
From MaRDI portal
Abstract: 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.
Recommendations
- Convergence in homogeneous random graphs
- scientific article; zbMATH DE number 1136104
- The cofinality of the random graph
- On convergence for graphexes
- Logconcave random graphs
- Concentration and regularization of random graphs
- Poisson convergence and semi-induced properties of random graphs
- scientific article; zbMATH DE number 845673
- Gonality of random graphs
Cites work
- A Simple Linear Time LexBFS Cograph Recognition Algorithm
- Algorithmic graph theory and perfect graphs
- Asymptotic enumeration of cographs
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Boltzmann sampling of unlabelled structures
- Brownian local minima, random dense countable sets and random equivalence classes
- Brownian motion. With an appendix by Oded Schramm and Wendelin Werner
- Complement reducible graphs
- Connection matrices
- Contractors and connectors of graph algebras
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Counting graph homomorphisms
- Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
- Distances of Probability Measures and Random Variables
- Finitely forcible graphons
- Generalized quasirandom graphs
- Gibbs partitions: The convergent case
- Graph limits and exchangeable random graphs
- Graph limits and hereditary properties
- Graph limits and parameter testing
- scientific article; zbMATH DE number 3124312 (Why is no real title available?)
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 3090543 (Why is no real title available?)
- Large networks and graph limits
- Limits of dense graph sequences
- Limits of random tree-like discrete structures
- On the Brownian separable permuton
- On the Construction of Almost Uniformly Convergent Random Variables with Given Weakly Convergent Image Laws
- On the shape of random Pólya structures
- Operations with structures
- Random combinatorial structures: the convergent case
- Random enriched trees with applications to random graphs
- Random trees and applications
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Scaling limits of random Pólya trees
- Schröder parenthesizations and chordates
- Sesqui-type branching processes
- Testing properties of graphs and functions
- The Brownian limit of separable permutations
- The continuum random tree is the scaling limit of unlabeled unrooted trees
- The continuum random tree. I
- The continuum random tree. III
- The CRT is the scaling limit of unordered binary trees
- The local limit of the uniform spanning tree on dense graphs
- The rank of connection matrices and the dimension of graph algebras
- The shape of unlabeled rooted random trees
- Unlabelled Gibbs partitions
Cited in
(13)- Coalescence and criticality of graphs
- Convergence theorems for some layout measures on random lattice and random geometric graphs
- scientific article; zbMATH DE number 1245629 (Why is no real title available?)
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
- A branching process approach to level‐k phylogenetic networks
- Exact-Size Sampling of Enriched Trees in Linear Time
- Random cographs: Brownian graphon limit and asymptotic degree distribution
- Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons
- The permuton limit of random recursive separable permutations
- Scaling limit of graph classes through split decomposition
- Subgraph densities and scaling limits of random graphs with a prescribed modular decomposition
- Graph classes with few P₄'s: universality and Brownian graphon limits
- Dense and nondense limits for uniform random intersection graphs
This page was built for publication: Graphon convergence of random cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074665)
