Network Dependence Testing via Diffusion Maps and Distance-Based Correlations
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Mar 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1.
2 papers.
- 2021One-Hot Graph Encoder Embeddingcited by 16
- 2024Learning Joint and Individual Structure in Network Data with Covariatescited by 2
- 2024Learning Joint and Individual Structure in Network Data with Covariates13 Jun 2024
- 2021One-Hot Graph Encoder Embedding27 Sep 2021