Random walks on graphs involve traversing nodes in a graph in a stochastic manner, where the next node is chosen randomly from the neighbors of the current node. This concept is fundamental in various fields such as computer science, physics, and network theory, serving as a basis for algorithms and models like PageRank and diffusion processes.