DeepAI AI Chat
Log In Sign Up

Nonparametric Two-Sample Hypothesis Testing for Random Graphs with Negative and Repeated Eigenvalues

by   Joshua Agterberg, et al.

We propose a nonparametric two-sample test statistic for low-rank, conditionally independent edge random graphs whose edge probability matrices have negative eigenvalues and arbitrarily close eigenvalues. Our proposed test statistic involves using the maximum mean discrepancy applied to suitably rotated rows of a graph embedding, where the rotation is estimated using optimal transport. We show that our test statistic, appropriately scaled, is consistent for sufficiently dense graphs, and we study its convergence under different sparsity regimes. In addition, we provide empirical evidence suggesting that our novel alignment procedure can perform better than the naïve alignment in practice, where the naïve alignment assumes an eigengap.


page 1

page 2

page 3

page 4


A Practical Two-Sample Test for Weighted Random Graphs

Network (graph) data analysis is a popular research topic in statistics ...

Training generative neural networks via Maximum Mean Discrepancy optimization

We consider training a deep neural network to generate samples from an u...

On the spectral property of kernel-based sensor fusion algorithms of high dimensional data

In this paper, we apply local laws of random matrices and free probabili...

Two-sample nonparametric test for proportional reversed hazards

Several works have been undertaken in the context of proportional revers...

RKHS-based Latent Position Random Graph Correlation

In this article, we consider the problem of testing whether two latent p...

Testing for Balance in Social Networks

Friendship and antipathy exist in concert with one another in real socia...

Statistical applications of Random matrix theory: comparison of two populations III

This paper investigates a statistical procedure for testing the equality...