Higher-order fluctuations in dense random graph models
From MaRDI portal
Abstract: Our main results are quantitative bounds in the multivariate normal approximation of centred subgraph counts in random graphs generated by a general graphon and independent vertex labels. We are interested in these statistics because they are key to understanding fluctuations of regular subgraph counts -- a cornerstone of dense graph limit theory. We also identify the resulting limiting Gaussian stochastic measures by means of the theory of generalised -statistics and Gaussian Hilbert spaces, which we think is a suitable framework to describe and understand higher-order fluctuations in dense random graph models. With this article, we believe we answer the question "What is the central limit theorem of dense graph limit theory?". We complement the theory with some statistical applications to illustrate the use of centred subgraph counts in network modelling.
Recommendations
- Gaussian fluctuations for edge counts in high-dimensional random geometric graphs
- Fluctuations of the magnetization for Ising models on dense Erdős-Rényi random graphs
- Fluctuations in the Ising model on a sparse random graph
- Phase transitions in dynamical random graphs
- Large-scale structures in random graphs
- Progress in high-dimensional percolation and random graphs
- Phase transitions in exponential random graphs
- Fluctuations for the partition function of Ising models on Erdös-Rényi random graphs
- The phase transition in inhomogeneous random graphs
- Stochastic processes in random graphs
Cites work
- scientific article; zbMATH DE number 785439 (Why is no real title available?)
- A central limit theorem for decomposable random variables with applications to random graphs
- An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Assessment of model fit via network comparison methods based on subgraph counts
- Central limit theorems for sequences of multiple stochastic integrals
- Coupling and Poisson approximation
- Dirichlet approximation of equilibrium distributions in Cannings models with mutation
- Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
- Finitely forcible graphons
- Gaussian Hilbert Spaces
- Graph limits and exchangeable random graphs
- Graphon-valued stochastic processes from population genetics
- Large networks and graph limits
- Limits of dense graph sequences
- Local limit theorems via Landau-Kolmogorov inequalities
- Metrics for sparse graphs
- Multigraph limit of the dense configuration model and the preferential attachment graph
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Normal approximations with Malliavin calculus. From Stein's method to universality
- On Stein's method for multivariate normal approximation
- On the dependence of the Berry-Esseen bound on dimension
- Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
- Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse graphs using exchangeable random measures
- Testing for high-dimensional geometry in random graphs
- Testing permutation properties through subpermutations
- The asymptotic distributions of generalized U-statistics with applications to random graphs
- Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics
Cited in
(7)- Fluctuations of subgraph counts in graphon based random graphs
- Graphons, permutons and the Thoma simplex: three mod-Gaussian moduli spaces
- A limit theorem for small cliques in inhomogeneous random graphs
- Multivariate central limit theorems for random clique complexes
- Internal DLA on cylinder graphs: fluctuations and mixing
- Berry-Esseen bounds for generalized \(U\)-statistics
- Gaussian fluctuations for edge counts in high-dimensional random geometric graphs
This page was built for publication: Higher-order fluctuations in dense random graph models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076615)
