Groups
Category
Level
A random walk on a graph moves from a node to one of its neighbors chosen uniformly at random at each step.
The graph Laplacian translates a graph’s connectivity into a matrix that measures how much a function varies across edges.
Spectral graph theory studies graphs by looking at eigenvalues and eigenvectors of matrices like the adjacency matrix A and Laplacians L and L_norm.