Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon

DOI10.1002/rsa.20965arXiv1807.09989OpenAlexW3091602563MaRDI QIDQ6049917

Marion Sciauveau, Jean-Stéphane Dhersin, Jean-François Delmas

Publication date: 11 October 2023

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

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

zbMATH Keywords

graphonbinomial distributionrandom measurehomomorphism densitydense graphcumulative distribution function of degreespartially labeled graph

Mathematics Subject Classification ID

Statistics (62-XX) Combinatorics (05-XX)

Related Items (3)

A Comparative Study of Polynomial-Type Chaos Expansions for Indicator Functions ⋮ Random cographs: Brownian graphon limit and asymptotic degree distribution ⋮ Fluctuations of subgraph counts in graphon based random graphs

Cites Work

• Unnamed Item
• A non-uniform bound of the remainder term in the central limit theorem for Bernoulli random variables
• Random graphs with a given degree sequence
• The method of moments and degree distributions for network models
• The asymptotic distributions of generalized U-statistics with applications to random graphs
• Limits of dense graph sequences
• Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• When are small subgraphs of a random graph normally distributed?
• Asymptotic normality of graph statistics
• Subgraph counts in random graphs using incomplete U-statistics methods
• A central limit theorem for decomposable random variables with applications to random graphs
• On the dependence of the Berry-Esseen bound on dimension
• Mod-ϕ Convergence
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Poisson approximation of subgraph counts in stochastic block models and a graphon model
• Normal Approximation and Asymptotic Expansions
• Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
• Metrics for sparse graphs
• Asymptotic Statistics
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• Graphons, permutons and the Thoma simplex: three mod‐Gaussian moduli spaces
• Limiting Behavior of Posterior Distributions when the Model is Incorrect
• A local central limit theorem for triangles in a random graph
• A Class of Statistics with Asymptotically Normal Distribution

This page was built for publication: Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon