A Markov chain tracks how likely a system is to move from one_state_to_another. The transition data can be stored either as an adjacency_list (per-state neighbors and weights) or as an adjacency/transition_matrix (tabular_probability_grid). The key idea is that the next state depends only on the current state - this is the Markov property. Over repeated transitions, the chain can settle into stable long-term behavior known as the stationary_distribution.