Combinatorial Laplacian
Материал из WikiGrapp
Combinatorial Laplacian — комбинаторный лапласиан.
Let be a locally finite graph without isolated vertices.
Let
be the space of all
-valued functions on
. The combinatorial Laplacian
of
is given by
for any ,
. Here
is the degree of a vertex
and we write
if the vertices
and
are adjacent in
. Inasmuch as
is a discrete analogue of a Riemannian manifold,
is a discrete analogue of the ordinary Laplace—Beltrami operator in Riemannian geometry. This analogy has been widely exploited both in the development of a harmonic analysis on graphs and within the spectral geometry of graphs.
Литература
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.