A nonparametric two-sample hypothesis testing problem for random dot product graphs
arXiv:1409.2344
Abstract
We consider the problem of testing whether two finite-dimensional random dot product graphs have generating latent positions that are independently drawn from the same distribution, or distributions that are related via scaling or projection. We propose a test statistic that is a kernel-based function of the adjacency spectral embedding for each graph. We obtain a limiting distribution for our test statistic under the null and we show that our test procedure is consistent across a broad range of alternatives.
arXiv comment24 pages, 1 figures
References in corpus (11)
- Modularity and community structure in networks
- Community detection in graphs
- Stochastic blockmodels and community structure in networks
- Structural Properties of the Caenorhabditis elegans Neuronal Network
- Brownian distance covariance
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- Graph limits and exchangeable random graphs
- Stochastic blockmodels with growing number of classes
- Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel
- Nonparametric graphon estimation
- Locality statistics for anomaly detection in time series of graphs
Cited by in corpus (12)
- Statistical inference on random dot product graphs: a survey
- A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference
- GraSPy: Graph Statistics in Python
- Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral
- Link prediction for egocentrically sampled networks
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks
- Network Dependence Testing via Diffusion Maps and Distance-Based Correlations
- On consistent vertex nomination schemes
- Numerical tolerance for spectral decompositions of random matrices
- Valid Two-Sample Graph Testing via Optimal Transport Procrustes and Multiscale Graph Correlation with Applications in Connectomics
- A model selection approach for clustering a multinomial sequence with non-negative factorization