Computing the diffusion state distance on graphs via algebraic multigrid and random projections.

DOI10.1002/NLA.2156MaRDI QIDQ4684529zbMATH OpenOpenAlexFDO

Authors Junyuan Lin, X. Hu, Lenore J. Cowen, Benjamin Hescott

Publication date 1 October 2018

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.2156

zbMATH Keywords

algebraic multigriddiffusion state distancerandom projections

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Recommendations

• Computing diffusion state distance using Green's function and heat kernel on graphs
• Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
• Diffusion state distances: multitemporal analysis, fast algorithms, and applications to biological networks
• Algebraic distance on graphs
• An efficient tree-based computation of a metric comparable to a natural diffusion distance

Cited in

(6)

• Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
• Computing diffusion state distance using Green's function and heat kernel on graphs
• Algebraic distance on graphs
• Diffusion state distances: multitemporal analysis, fast algorithms, and applications to biological networks
• A posteriori error estimates for multilevel methods for graph Laplacians
• An adaptive multigrid method based on path cover

Describes a project that uses

Uses Software

• Matlab
• BioGRID

This page was built for publication: Computing the diffusion state distance on graphs via algebraic multigrid and random projections.

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