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 | |
Results tagged with sp.spectral-theory
Search options not deleted
user 90343
Schrodinger operators, operators on manifolds, general differential operators, numerical studies, integral operators, discrete models, resonances, non-self-adjoint operators, random operators/matrices
1
vote
What's the full assumption for Laplacian matrix $L=BB^T=\Delta-A$?
Here is one most closest to the expectation
Definition 2.5. Given a directed or undirected graph $G= (V,E)$, with $V=\{v_1,\cdots,v_m\}$,the adjacency matrix $A(G)$ of $G$ is the symmetric $m\times m …
- 211
4
votes
2
answers
1k
views
What's the full assumption for Laplacian matrix $L=BB^T=\Delta-A$?
Graph with no-selfloop, no-multi-edges, unweighted.
directed
For directed graph Adjacency matrix is a non-symmetric matrix $A_{in}$ considering indegree or $A_{out}$ considering outdegree. Degree matr …
- 211