Diffusion-Based Metrics for Biological Network Analysis
summary
Defines diffusion state distance as the L1 norm of difference between expected visit-count vectors from K-step random walks (converging as K→∞ and computable via eigen/inverse methods), which downweights paths through high-degree hubs. Code runs on BioGRID and STRING; complexity is dominated by matrix inversion. Replacing shortest-path similarity with DSD raises yeast function-prediction accuracy from ~50% (majority vote) to ~60%–71% when using K≈10, edge confidences and curated pathway boosts, and yields larger gains on sparse networks. Public code and PLoS ONE paper available.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 1:57Social Networks
- 5:14Distance Metric
- 5:53Diffusion Distance Metric
- 14:24Classical Function Label Prediction
- 15:11Classical Function Prediction Methods
- 15:47References
- 16:11Experimental Results
- 17:52Yeast Interaction
- 18:22Majority Vote
- 19:49Summary
- 28:14Previous Results
- 28:28Confidence
- 28:53Highway Trick
- 29:15Results
- 30:28Collaborators
- 31:00Hit Time
