Ergodic Theory
An adjacency matrix is a square matrix used to represent a finite graph, where the elements indicate whether pairs of vertices are adjacent or not in the graph. Each row and column corresponds to a vertex, and a '1' in the matrix indicates that there is an edge connecting the two vertices, while a '0' indicates no edge. In the context of topological entropy in symbolic systems, the adjacency matrix plays a crucial role in determining the complexity and behavior of symbolic dynamical systems.
congrats on reading the definition of adjacency matrix. now let's actually learn it.