Higher-order fluctuations in dense random graph models
From MaRDI portal
Publication:2076615
DOI10.1214/21-EJP708zbMath1483.05159arXiv2006.15805OpenAlexW4206171429MaRDI QIDQ2076615
Publication date: 22 February 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.15805
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Stochastic calculus of variations and the Malliavin calculus (60H07) Approximations to statistical distributions (nonasymptotic) (62E17) Exchangeability for stochastic processes (60G09)
Related Items (3)
A limit theorem for small cliques in inhomogeneous random graphs ⋮ Fluctuations of subgraph counts in graphon based random graphs ⋮ Berry-Esseen bounds for generalized \(U\)-statistics
Cites Work
- Unnamed Item
- Unnamed Item
- Multigraph limit of the dense configuration model and the preferential attachment graph
- Testing permutation properties through subpermutations
- 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
- A central limit theorem for decomposable random variables with applications to random graphs
- Coupling and Poisson approximation
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- On the dependence of the Berry-Esseen bound on dimension
- Graphon-valued stochastic processes from population genetics
- Finitely forcible graphons
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Local limit theorems via Landau-Kolmogorov inequalities
- Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
- Central limit theorems for sequences of multiple stochastic integrals
- Testing for high-dimensional geometry in random graphs
- Normal Approximations with Malliavin Calculus
- On Stein’s method for multivariate normal approximation
- Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics
- Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
- Graph limits and exchangeable random graphs
- Metrics for sparse graphs
- Gaussian Hilbert Spaces
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse Graphs Using Exchangeable Random Measures
- Assessment of model fit via network comparison methods based on subgraph counts
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Dirichlet approximation of equilibrium distributions in Cannings models with mutation
This page was built for publication: Higher-order fluctuations in dense random graph models
