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 (7)
- Measuring and testing dependence by correlation of distances
- Stochastic blockmodels and community structure in networks
- Theory of Rumour Spreading in Complex Social Networks
- Nonoptimal Component Placement, but Short Processing Paths, due to Long-Distance Projections in Neural Systems
- From Distance Correlation to Multiscale Graph Correlation
- Subsampling large graphs and invariance in networks
- Nonlinear signaling on biological networks: the role of stochasticity and spectral clustering