Statistical inference for network samples using subgraph counts

  title={Statistical inference for network samples using subgraph counts},
  author={Pierre-Andr{\'e} G. Maugis and Carey E. Priebe and Sofia C. Olhede and Patrick J. Wolfe},
We consider that a network is an observation, and a collection of observed networks forms a sample. In this setting, we provide methods to test whether all observations in a network sample are draw... 

Figures and Tables from this paper

Testing for Global Network Structure Using Small Subgraph Statistics
This work proposes a simple test for the existence of communities based only on the frequencies of three-node subgraphs, and demonstrates how the method can be effective for detecting structure in social networks, citation networks for scientific articles, and correlations of stock returns between companies on the S\&P 500.
Nonparametric regression for multiple heterogeneous networks
A multi- graphon model is proposed which allows node-level as well as network-level heterogeneity, and it is shown how information from multiple networks can be leveraged to enable estimation of the multi-graphon via standard nonparametric regression techniques, e.g. kernel regression, orthogonal series estimation.
Bootstrapping Networks with Latent Space Structure
The first method generates bootstrap replicates of network statistics that can be represented as U-statistics in the latent positions, and avoids actually constructing new bootstrapped networks.
Central limit theorems for local network statistics
This work derives the asymptotic joint distribution of rooted subgraph counts in inhomogeneous random graphs, a model which generalizes many popular statistical network models and enables a shift in the statistical analysis of large graphs, from estimating network summaries, to estimating models linking local network structure and vertex-specific covariates.
Identifying networks with common organizational principles
This paper introduces a new network comparison methodology that is aimed at identifying common organizational principles in networks that is simple, intuitive and applicable in a wide variety of settings ranging from the functional classification of proteins to tracking the evolution of a world trade network.
Subgraphs in preferential attachment models
Abstract We consider subgraph counts in general preferential attachment models with power-law degree exponent $\tau > 2$ . For all subgraphs H, we find the scaling of the expected number of subgraphs
Testing Network Structure Using Relations Between Small Subgraph Probabilities
The results show how global structural characteristics of networks can be inferred from local subgraph frequencies, without requiring the global community structure to be explicitly estimated.
Degree‐based goodness‐of‐fit tests for heterogeneous random graph models: Independent and exchangeable cases
This paper introduces goodness‐of‐fit tests for two classes of models such as the heterogeneous Erdös‐Rényi model and a generic model for exchangeable random graphs called the W‐graph and proves the asymptotic normality under specific sparsity regimes.
Preferential attachment models for dynamic networks
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of
Optimal adaptivity of signed-polygon statistics for network testing
This work proposes the Signed Polygon as a class of new tests and shows that both the SgnT and SgnQ tests satisfy (a)-(d), and especially, they work well for both very sparse and less sparse networks.


A semiparametric two-sample hypothesis testing problem for random graphs
Two-sample hypothesis testing for random graphs arises naturally in neuroscience, social networks, and machine learning. In this article, we consider a semiparametric problem of two-sample hypothes...
Geometric Network Comparison
A principled statistical approach to network comparison is proposed that approximates networks as probability distributions on negatively curved manifolds and is implemented on simulated networks.
Subsampling bootstrap of count features of networks
This is the publisher’s final pdf. The published article is copyrighted by Institute of Mathematical Statistics and can be found at:
The method of moments and degree distributions for network models
Probability models on graphs are becoming increasingly important in many applications, but statistical tools for fitting such models are not yet well developed. Here we propose a general method of
Two-Sample Tests for Large Random Graphs Using Network Statistics
The main contribution of the paper is a general formulation of the problem based on concentration of network statistics, and consequently, a consistent two-sample test that arises as the natural solution for this problem.
Latent Space Approaches to Social Network Analysis
This work develops a class of models where the probability of a relation between actors depends on the positions of individuals in an unobserved “social space,” and proposes Markov chain Monte Carlo procedures for making inference on latent positions and the effects of observed covariates.
Testing and Modeling Dependencies Between a Network and Nodal Attributes
This article uses a previously developed latent variable model to obtain a low-dimensional representation of the network in terms of node-specific network factors and presents a joint model for the network relations and attributes, for use if the hypothesis of independence is rejected.
Random graphs
  • A. Frieze
  • Mathematics, Computer Science
    SODA '06
  • 2006
Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Higher-order organization of complex networks
A generalized framework for clustering networks on the basis of higher-order connectivity patterns provides mathematical guarantees on the optimality of obtained clusters and scales to networks with billions of edges.
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts
A sampling algorithm that provably and accurately approximates the frequencies of all 4-vertex pattern subgraphs is provided, based on a novel technique of 3-path sampling and a special pruning scheme to decrease the variance in estimates.