Laplacian Matrix - Random Walk Normalized Laplacian

The random walk normalized Laplacian is defined as

where A is the adjacency matrix and D is the degree matrix. Since the degree matrix D is diagonal, its inverse is simply defined as a diagonal matrix, having diagonal entries which are the reciprocals of the corresponding positive diagonal entries of D.

Read more about this topic:  Laplacian Matrix

Famous quotes containing the words random and/or walk:

    Assemble, first, all casual bits and scraps
    That may shake down into a world perhaps;
    People this world, by chance created so,
    With random persons whom you do not know—
    Robert Graves (1895–1985)

    Pioneers lay the roads for those who follow to walk on.
    Chinese proverb.