A Random Walk Proof of Matrix Tree Theorem
A Random Walk Proof of Matrix Tree Theorem
A Random Walk Proof of Matrix Tree Theorem
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
The Graph Laplacian <strong>Matrix</strong>Recall that the graph Laplacian L is the matrix L = D −A, where D is the degreematrix and A is the adjacency matrix.y 1 y 5y 4y 3 y 2y 6L =y 1 y 2 y 3 y 4 y 5 y 6⎡y 1 3 0 −1 −1 −1 0y 2 0 2 0 −1 0 −1y 3 −1 0 3 −1 0 −1y 4 −1 −1 −1 4 −1 0⎢y 5 ⎣ −1 0 0 −1 2 0y 6 0 −1 −1 0 0 2⎤⎥⎦3
Change language