Metraipolis › archive › dc_08a8b68d423e

Laplacian matrix — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Laplacian_matrix
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-07T16:15:13.131Z
SHA-256 of the archived text
96f9bf2beb9eba251c716d3b8c516e137f192c6282c3b08c4744926a296d25b1
Stable URL of this page
https://metraipolis.com/documento/dc_08a8b68d423e

How to cite

Laplacian matrix — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Laplacian_matrix (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_08a8b68d423e (Metraipolis archive dc_08a8b68d423e, sha256 96f9bf2beb9eba251c716d3b8c516e137f192c6282c3b08c4744926a296d25b1)
BibTeX
@misc{dc08a8b68d423e,
  title = {Laplacian matrix — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Laplacian_matrix},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_08a8b68d423e; sha256 96f9bf2beb9eba251c716d3b8c516e137f192c6282c3b08c4744926a296d25b1},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Laplacian_matrix. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In the mathematical field of graph theory, the Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix, or discrete Laplacian, is a matrix representation of a graph. Named after Pierre-Simon Laplace, the graph Laplacian matrix can be viewed as a matrix form of the negative discrete Laplace operator on a graph approximating the negative continuous Laplacian obtained by the finite difference method. The Laplacian matrix relates to many functional graph properties. Kirchhoff's theorem can be used to calculate the number of spanning trees for a given graph. The sparsest cut of a graph can be approximated through the Fiedler vector — the eigenvector corresponding to the second smallest eigenvalue of the graph Laplacian — as established by Cheeger's inequality. The spectral decomposition of the Laplacian matrix allows the construction of low-dimensional embeddings that appear in many machine learning applications and determines a spectral layout in graph drawing. Graph-based signal processing is based on the graph Fourier transform that extends the traditional discrete Fourier transform by substituting the standard basis of complex sinusoids for eigenvectors of the Laplacian matrix of a graph corresponding to the signal. The Laplacian matrix is the easiest to define for a simple graph but is more common in applications for an edge-weighted graph, i.e., with weights on its edges — the entries of the graph adjacency matrix. Spectral graph theory relates properties of a graph to a spectrum, i.e., eigenvalues and eigenvectors of matrices associated with the graph, such as its adjacency matrix or Laplacian matrix. Imbalanced weights may undesirably affect the matrix spectrum, leading to the need of normalization — a column/row scaling of the matrix entries — resulting in normalized adjacency and Laplacian matrices.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Laplacian matrix» — https://en.wikipedia.org/wiki/Laplacian_matrix
Wikidata Q772067: «matrix representation of a graph» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q772067
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Laplacian_matrix?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378459363, consultata il 2026-11-07T16:10:57.051Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 63771be2b55499bce345a4c2732ecdc5daff1752e028cdb4c030cd358c6aea52