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

Lin, Junyuan.

Cowen, Lenore J.

Hescott, Benjamin.

Hu, Xiaozhe.

2018

Description
  • In this paper, we consider efficient and robust algorithms for computing the diffusion state distance (DSD) metric on graphs developed recently. In order to efficiently compute DSD, we reformulate the problem into graph Laplacians and use unsmoothed aggregation algebraic multigrid to solve the resulting linear system of equations. To further reduce the computational cost, we approximate DSD by ... read more
This object is in collection Creator department Subject Permanent URL Citation
  • Lin, J, Cowen, LJ, Hescott, B, Hu, X. Computing the diffusion state distance on graphs via algebraic multigrid and random projections. Numer Linear Algebra Appl. 2018; 25:e2156. https://doi.org/10.1002/nla.2156.
ID:
k3569j20g
To Cite:
TARC Citation Guide    EndNote
Usage:
Detailed Rights