Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
The Laplacian matrix is the representation of a graph in matrix form.
4
votes
Invertibility of group Laplacian in $\ell^1$
Corollary: 0 is in the spectrum of $L_1$ and the Laplacian cannot be inverted $\ell^1$.
Note the argument is true in any graph. … As a complementary remark the image of the Laplacian is not dense (in a graph with an infinite connected component). …
12
votes
Accepted
How to understand the combinatorial Laplacian $\Delta$ which is defined on the graph?
This is the Laplacian (up to a sign). … The fact that you put a "$-$" sign or not depends entirely on your taste: if you want a Laplacian with negative spectrum, you should put a "$-$", otherwise don't (it's a standard trick to see that $A^* …