Motif estimation via subgraph sampling: the fourth-moment phenomenon

DOI10.1214/21-AOS2134zbMath1486.62079arXiv2011.03026MaRDI QIDQ2131263

Bhaswar B. Bhattacharya, Sumit Mukherjee, Sayan Kumar Das

Publication date: 25 April 2022

Published in: The Annals of Statistics (Search for Journal in Brave)

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

zbMATH Keywords

Stein's methodrandom graphsnetwork analysisasymptotic inferencefourth moment phenomenonmotif counting

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Nonparametric estimation (62G05) Random graphs (graph-theoretic aspects) (05C80) Probabilistic graphical models (62H22)

Related Items (1)

A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universally consistent vertex classification for latent positions graphs
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Universal limit theorems in graph coloring problems with connections to extremal combinatorics
• Random graphs with a given degree sequence
• The method of moments and degree distributions for network models
• On triangle estimation using tripartite independent set queries
• Stein's method on Wiener chaos
• Small subgraphs of random regular graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Modeling social networks from sampled data
• Statistical analysis of network data. Methods and models
• Finite exchangeable sequences
• Sublinear-time algorithms for counting star subgraphs via edge sampling
• Normal approximation under local dependence.
• Invariance principles for homogeneous sums: universality of Gaussian Wiener chaos
• Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
• Estimating the number of connected components in a graph via subgraph sampling
• Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks
• Estimating and understanding exponential random graph models
• Sampling algorithms.
• Central limit theorems for sequences of multiple stochastic integrals
• Random regular graphs of high degree
• Normal Approximations with Malliavin Calculus
• Empirical Processes in Survey Sampling with (Conditional) Poisson Designs
• On Testing Expansion in Bounded-Degree Graphs
• Random Fields on the Sphere
• An efficient algorithm for random sampling without replacement
• Counting Stars and Other Small Subgraphs in Sublinear-Time
• Snowball Sampling
• Approximating average parameters of graphs
• Percolation
• On the cost of algorithms for random selection
• Approximately Counting Triangles in Sublinear Time
• An Introduction to Stein's Method
• On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
• Topics at the Frontier of Statistics and Network Analysis
• A Generalization of Sampling Without Replacement From a Finite Universe

This page was built for publication: Motif estimation via subgraph sampling: the fourth-moment phenomenon