Network Dependence Testing via Diffusion Maps and Distance-Based Correlations
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2017
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913404929703936 |
|---|---|
| author | Lee, Youjin Shen, Cencheng Priebe, Carey E. Vogelstein, Joshua T. |
| author_facet | Lee, Youjin Shen, Cencheng Priebe, Carey E. Vogelstein, Joshua T. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1703_10136 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | Network Dependence Testing via Diffusion Maps and Distance-Based Correlations Lee, Youjin Shen, Cencheng Priebe, Carey E. Vogelstein, Joshua T. Methodology 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. |
| title | Network Dependence Testing via Diffusion Maps and Distance-Based Correlations |
| topic | Methodology |
| url | https://arxiv.org/abs/1703.10136 |