Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
classification
🧮 math.PR
keywords
functionasymptoticsdensitiesgraphongraphshomomorphismrandomsampled
read the original abstract
We give asymptotics for the cumulative distribution function (CDF) for degrees of large dense random graphs sampled from a graphon. The proof is based on precise asymptotics for binomial random variables. Replacing the indicator function in the empirical CDF by a smoother function, we get general asymptotic results for functionals of homomorphism densities for partially labeled graphs with smoother functions. This general setting allows to recover recent results on asymptotics for homomorphism densities of sampled graphon.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.