Get the Laplacian matrix of an observed graph. Both unnormalised and symmetric normalised Laplacian matrices are included.

1 |

`A` |
input matrix – adjacency matrix of an observed graph, of dimension n-nodes x n-nodes. |

`normalised` |
whether the Laplacian matrix is normalised or not. |

if `normalised = F`

, an unnormalised Laplacian matrix is returned, i.e. *L = D - A*; if `normalised = T`

, a symmetric normalised Laplacian matrix is returned, i.e. *L = D^{-1/2}(D - A)D^{-1/2}*. *D* is the degree diagonal matrix, with diagonal entries *d_i = ∑_{j = 1}^nA_{ij}*.

Yang Feng, Richard J. Samworth and Yi Yu

Yang Feng, Richard J. Samworth and Yi Yu, Fused Community Detection, manuscript.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.