Graphon convergence of random cographs
From MaRDI portal
Publication:6074665
DOI10.1002/rsa.21002zbMath1526.05127arXiv1906.10355OpenAlexW3191504171MaRDI QIDQ6074665
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.10355
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Testing properties of graphs and functions
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- The shape of unlabeled rooted random trees
- The continuum random tree. I
- Brownian local minima, random dense countable sets and random equivalence classes
- Limits of dense graph sequences
- Graph limits and hereditary properties
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Random trees and applications
- Complement reducible graphs
- Schröder parenthesizations and chordates
- Sesqui-type branching processes
- The local limit of the uniform spanning tree on dense graphs
- Random enriched trees with applications to random graphs
- The Brownian limit of separable permutations
- On the shape of random Pólya structures
- Random combinatorial structures: the convergent case
- Algorithmic graph theory and perfect graphs
- Limits of random tree-like discrete structures
- Finitely forcible graphons
- The continuum random tree. III
- Scaling limits of random Pólya trees
- Generalized quasirandom graphs
- The rank of connection matrices and the dimension of graph algebras
- Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
- Graph limits and parameter testing
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Graph limits and exchangeable random graphs
- Contractors and connectors of graph algebras
- A Simple Linear Time LexBFS Cograph Recognition Algorithm
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Gibbs partitions: The convergent case
- On the Brownian separable permuton
- Unlabelled Gibbs partitions
- Boltzmann Sampling of Unlabelled Structures
- The CRT is the scaling limit of unordered binary trees
- The continuum random tree is the scaling limit of unlabeled unrooted trees
- Distances of Probability Measures and Random Variables
- Operations with structures
- On the Construction of Almost Uniformly Convergent Random Variables with Given Weakly Convergent Image Laws
- Brownian Motion
