REVIEW 1 cited by
Subgraph densities and scaling limits of random graphs with a prescribed modular decomposition
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a consequence, we obtain the convergence of a uniform random graph in such classes to a Brownian limit object in the space of graphons. Our proofs rely on combinatorial arguments, computing generating series using the symbolic method and deriving asymptotics using singularity analysis.
Forward citations
Cited by 1 Pith paper
-
The longest increasing subsequence of Brownian separable permutons
For permutations sampled from the Brownian separable permuton, LIS(σ_n)/n^{α(p)} converges almost surely to a positive finite random variable, and α(p) is the explicit solution of a Gamma-function equation.
Discussion (0). Continue with ORCID to comment.