Network Dependence Testing via Diffusion Maps and Distance-Based Correlations
arXiv:1703.10136 · doi:10.1093/biomet/asz045
Abstract
Deciphering the associations between network connectivity and nodal attributes is one of the core problems in network science. The dependency structure and high-dimensionality of networks pose unique challenges to traditional dependency tests in terms of theoretical guarantees and empirical performance. We propose an approach to test network dependence via diffusion maps and distance-based correlations. We prove that the new method yields a consistent test statistic under mild distributional assumptions on the graph structure, and demonstrate that it is able to efficiently identify the most informative graph embedding with respect to the diffusion time. The methodology is illustrated on both simulated and real data.
References in corpus (18)
- Measuring and testing dependence by correlation of distances
- Stochastic blockmodels and community structure in networks
- Structural Properties of the Caenorhabditis elegans Neuronal Network
- Theory of Rumour Spreading in Complex Social Networks
- Nonoptimal Component Placement, but Short Processing Paths, due to Long-Distance Projections in Neural Systems
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- Spectral clustering and the high-dimensional stochastic blockmodel
- The ground truth about metadata and community detection in networks
- A consistent multivariate test of association based on ranks of distances
- Large-Scale Kernel Methods for Independence Testing
- Consistent distribution-free -sample and independence tests for univariate random variables
- From Distance Correlation to Multiscale Graph Correlation
- Discovering and Deciphering Relationships Across Disparate Data Modalities
- A nonparametric two-sample hypothesis testing problem for random dot product graphs
- Manifold Matching using Shortest-Path Distance and Joint Neighborhood Selection
- Subsampling large graphs and invariance in networks
- Robust Vertex Classification
- Nonlinear signaling on biological networks: the role of stochasticity and spectral clustering