As An Approximation To The Negative Continuous Laplacian
The graph Laplacian matrix can be further viewed as a matrix form of an approximation to the negative Laplacian operator obtained by the finite difference method. In this interpretation, every graph vertex is treated as a grid point; the local connectivity of the vertex determines the finite difference approximation stencil at this grid point, the grid size is always one for every edge, and there are no constraints on any grid points, which corresponds to the case of the homogeneous Neumann boundary condition, i.e., free boundary.
Read more about this topic: Laplacian Matrix
Famous quotes containing the words negative and/or continuous:
“The negative always wins at last, but I like it none the better for that.”
—Mason Cooley (b. 1927)
“The problem, thus, is not whether or not women are to combine marriage and motherhood with work or career but how they are to do so—concomitantly in a two-role continuous pattern or sequentially in a pattern involving job or career discontinuities.”
—Jessie Bernard (20th century)