Groups
A Markov chain is a random process where the next state depends only on the current state, not the full history.
Spectral graph theory studies graphs by looking at eigenvalues and eigenvectors of matrices like the adjacency matrix A and Laplacians L and L_norm.