HetNetEX: Exact Asymptotic Inference in Heterogeneous Biomedical Knowledge Graphs
Tusharkanti GhoshiD, Lucas A. GillenwateriD, Casey S. GreeneiD, James C. CostelloiD
Abstract
Heterogeneous biomedical knowledge networks (hetnets) integrate disparate data types, drugs, genes, diseases, and pathways, across independent sources; Hetionet (https://het.io) is a widely used example. A standard approach for assessing connectivity significance is XSwap, which permutes the hetnet P times and fits a gamma-hurdle null model to the degree-weighted path count (DWPC), pooling permuted values across pairs with matching source and target degrees to increase the effective sample size. This permutation approach has been highly successful in practice, but it faces four practical constraints in large graphs: (1) a finite resolution for the smallest reportable p-values, (2) computational cost that grows prohibitive at path lengths L [≥] 4 or 5, (3) a variance model (Var {propto} {micro}2) that departs from the configuration-model form (1 +{kappa} ){micro}, and (4) O(P 10m L) runtime. To complement this approach, we present HetNetEX (Heterogeneous Network EXact inference), which computes the null DWPC distribution analytically from degree sequences using the configuration model in O(Ln) time. In simulations at P = 200 across L = 1-4, HetNetEX achieves Spearman{rho} > 0.96 concordance with XSwap rankings while being >10,000x faster and providing analytical p-values without a resolution ceiling. High-degree pairs show larger XSwap sampling error than low-degree pairs, reflecting the finite-sample nature of permutation that analytical computation avoids.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Hetnet connectivity search provides rapid insights into how two biomedical entities are related
Daniel Himmelstein, Michael Zietz, … Casey S. Greene·GigaSciencePeer-reviewed·Dec 28, 2022
- The probability of edge existence due to node degree: a baseline for network-based predictions
Michael Zietz, Daniel Himmelstein, … Casey S. Greene·GigaSciencePeer-reviewed·Jan 1, 2024
- Spurious inference when comparing networks
D. Farine, L. M. Aplin·bioRxiv·May 2, 2019
- Permutation tests for hypothesis testing with animal social data: problems and potential solutions
D. R. Farine, G. G. Carter·bioRxiv·Aug 2, 2020
- Common Permutation Methods in Animal Social Network Analysis Do Not Control for Non-independence
J. D. A. Hart, M. N. Weiss, … D. W. Franks·bioRxiv·Jun 4, 2021
- Two distributed semi-supervised algorithms for mining of complex networks using Giraph
Erfan Farhangi Maleki, Nasser Ghadiri, … Zeinab Maleki·Expert Systems with ApplicationsPeer-reviewed·Jun 9, 2020