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:

    And catch the gleaming of a random light,
    That tells me that the ship I seek is passing, passing.
    Paul Laurence Dunbar (1872–1906)

    To walk through the ruined cities of Germany is to feel an actual doubt about the continuity of civilization.
    George Orwell (1903–1950)