Correcting a Nonparametric Two-sample Graph Hypothesis Test for Graphs with Different Numbers of Vertices

08/21/2020
by   Anton A. Alyakin, et al.
0

Random graphs are statistical models that have many applications, ranging from neuroscience to social network analysis. Of particular interest in some applications is the problem of testing two random graphs for equality of generating distributions. Tang et al. (2017) propose a test for this setting. This test consists of embedding the graph into a low-dimensional space via the adjacency spectral embedding (ASE) and subsequently using a kernel two-sample test based on the maximum mean discrepancy. However, if the two graphs being compared have an unequal number of vertices, the test of Tang et al. (2017) may not be valid. We demonstrate the intuition behind this invalidity and propose a correction that makes any subsequent kernel- or distance-based test valid. Our method relies on sampling based on the asymptotic distribution for the ASE. We call these altered embeddings the corrected adjacency spectral embeddings (CASE). We show that CASE remedies the exchangeability problem of the original test and demonstrate the validity and consistency of the test that uses CASE via a simulation study. We also apply our proposed test to the problem of determining equivalence of generating distributions of subgraphs in Drosophila connectome.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2019

A Kernel Stein Test for Comparing Latent Variable Models

We propose a nonparametric, kernel-based test to assess the relative goo...
research
07/25/2016

A Statistical Test for Joint Distributions Equivalence

We provide a distribution-free test that can be used to determine whethe...
research
03/19/2023

RKHS-based Latent Position Random Graph Correlation

In this article, we consider the problem of testing whether two latent p...
research
05/23/2021

Hypothesis Testing for Equality of Latent Positions in Random Graphs

We consider the hypothesis testing problem that two vertices i and j of ...
research
04/18/2023

Independence testing for inhomogeneous random graphs

Testing for independence between graphs is a problem that arises natural...
research
08/03/2020

Two-sample Testing on Latent Distance Graphs With Unknown Link Functions

We propose a valid and consistent test for the hypothesis that two laten...
research
09/16/2020

Skeletonization and Reconstruction based on Graph Morphological Transformations

Multiscale shape skeletonization on pixel adjacency graphs is an advance...

Please sign up or login with your details

Forgot password? Click here to reset