2014/10/13 by Edward Boehnlein, Boehnlein, Edward, Peter Chin +5
Biochemistry, Genetics and Molecular Biology · Computer Science · #05C50 #Bioinformatics and Genomic Networks #Combinatorics (math.CO) #Computational Drug Discovery Methods #FOS: Mathematics #Gene Regulatory Network Analysis
paper · pdf · doi:10.48550/arxiv.1410.3168
openalex publication_date 2014/10/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The diffusion state distance (DSD) was introduced by Cao-Zhang-Park-Daniels-Crovella-Cowen-Hescott [\em PLoS ONE, 2013] to capture functional similarity in protein-protein interaction networks. They proved the convergence of DSD for non-bipartite graphs. In this paper, we extend the DSD to bipartite graphs using lazy-random walks and consider the general Lq-version of DSD. We discovered the connection between the DSD Lq-distance and Green's function, which was studied by Chung and Yau [\em J. Combinatorial Theory (A), 2000]. Based on that, we computed the DSD Lq-distance for Paths, Cycles, Hypercubes, as well as random graphs G(n,p) and G(w1,..., wn). We also examined the DSD distances of two biological networks.