Groups
Category
A random walk on a graph moves from a node to one of its neighbors chosen uniformly at random at each step.
Graph isomorphism asks whether two graphs are the same up to renaming vertices; the WeisfeilerโLeman (WL) test is a powerful heuristic that often distinguishes non-isomorphic graphs quickly.