Computing Diffusion State Distance Using Green’s Function and Heat Kernel on Graphs

DOI10.1007/978-3-319-13123-8_7zbMath1342.05147arXiv1410.3168OpenAlexW1610505438MaRDI QIDQ2945275

Linyuan Lu, Peter Chin, Edward Boehnlein, Amit K. Sinha

Publication date: 9 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.3168

zbMATH Keywords

DSD for non-bipartite graphslazy-random walks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81)

Related Items

A Hitting Time Formula for the Discrete Green's Function ⋮ Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks