Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Laplacian matrix
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Symmetric Laplacian for a directed graph=== Just like for simple graphs, the Laplacian matrix of a directed weighted graph is by definition generally non-symmetric. The symmetry can be enforced by turning the original directed graph into an undirected graph first before constructing the Laplacian. The adjacency matrix of the undirected graph could, e.g., be defined as a sum of the adjacency matrix <math>A</math> of the original directed graph and its [[matrix transpose]] <math>A^T</math> as in the following example: {|class="wikitable" ! [[Adjacency matrix]] ! Symmetrized adjacency matrix ! Symmetric Laplacian matrix |- | <math display="inline">\left(\begin{array}{rrr} 0 & 1 & 1\\ 0 & 0 & 1\\ 1 & 0 & 0\\ \end{array}\right)</math> | <math display="inline">\left(\begin{array}{rrr} 0 & 1 & 2\\ 1 & 0 & 1\\ 2 & 1 & 0\\ \end{array}\right)</math> | <math display="inline">\left(\begin{array}{rrr} 3 & -1 & -2\\ -1 & 2 & -1\\ -2 & -1 & 3\\ \end{array}\right)</math> |} where the zero and one entries of <math>A</math> are treated as numerical, rather than logical as for simple graphs, values, explaining the difference in the results - for simple graphs, the symmetrized graph still needs to be simple with its symmetrized adjacency matrix having only logical, not numerical values, e.g., the logical sum is 1 v 1 = 1, while the numeric sum is 1 + 1 = 2. Alternatively, the symmetric Laplacian matrix can be calculated from the two Laplacians using the [[degree (graph theory)|indegree and outdegree]], as in the following example: {|class="wikitable" ! [[Adjacency matrix]] ! Out-Degree matrix ! Out-Degree Laplacian ! In-Degree matrix ! In-Degree Laplacian |- | <math display="inline">\left(\begin{array}{rrr} 0 & 1 & 1\\ 0 & 0 & 1\\ 1 & 0 & 0\\ \end{array}\right)</math> | <math display="inline">\left(\begin{array}{rrr} 2 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & 1\\ \end{array}\right)</math> | <math display="inline">\left(\begin{array}{rrr} 2 & -1 & -1\\ 0 & 1 & -1\\ -1 & 0 & 1\\ \end{array}\right)</math> | <math display="inline">\left(\begin{array}{rrr} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & 2\\ \end{array}\right)</math> | <math display="inline">\left(\begin{array}{rrr} 1 & -1 & -1\\ 0 & 1 & -1\\ -1 & 0 & 2\\ \end{array}\right)</math> |} The sum of the out-degree Laplacian transposed and the in-degree Laplacian equals to the symmetric Laplacian matrix.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)