Computing diffusion state distance using Green's function and heat kernel on graphs

From MaRDI portal



Abstract: 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.











This page was built for publication: Computing diffusion state distance using Green's function and heat kernel on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945275)