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:

    It is a secret from nobody that the famous random event is most likely to arise from those parts of the world where the old adage “There is no alternative to victory” retains a high degree of plausibility.
    Hannah Arendt (1906–1975)

    Many a play is like a painted backdrop, something to be looked at from the front. An Ibsen play is like a black forest, something you can enter, something you can walk about in. There you can lose yourself: you can lose yourself. And once inside, you find such wonderful glades, such beautiful, sunlit places.
    Minnie Maddern Fiske (1865–1932)