Fluctuations of Subgraph Counts in Graphon Based Random Graphs
Bhaswar B. Bhattacharya, Anirban Chatterjee, Svante Janson

TL;DR
This paper extends the understanding of subgraph count fluctuations in graphon-based random graphs from cliques to arbitrary graphs, revealing conditions for Gaussian and non-Gaussian limits based on graphon regularity.
Contribution
It introduces the concept of H-regularity of graphons and characterizes the fluctuation behavior of subgraph counts for general graphs, including the spectral analysis of associated graphons.
Findings
Gaussian fluctuations occur when W is not H-regular.
Non-Gaussian components appear when W is H-regular, involving spectral sums.
Degeneracy of limits identified for certain H-regular graphons.
Abstract
Given a graphon and a finite simple graph , with vertex set , denote by the number of copies of in a -random graph on vertices. The asymptotic distribution of was recently obtained by Hladk\'y, Pelekis, and \v{S}ileikis (2021) in the case where is a clique. In this paper, we extend this result to any fixed graph . Towards this we introduce a notion of -regularity of graphons and show that if the graphon is not -regular, then has Gaussian fluctuations with scaling . On the other hand, if is -regular, then the fluctuations are of order and the limiting distribution of can have both Gaussian and non-Gaussian components, where the non-Gaussian component is a (possibly) infinite weighted sum of centered chi-squared random variables with the weights determined…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Stochastic processes and statistical mechanics · Graph theory and applications
