State Vector — Definition, Formula & Examples
A state vector is a list of probabilities that tells you how likely a system is to be in each of its possible states at a given moment. For example, it might give the chance that tomorrow is sunny and the chance that it is rainy.
For a Markov chain with states, the state vector at step is a row vector , where . Every entry satisfies , and . A vector with these properties is also called a probability vector.
Key Formula
Where:
- = State vector (row vector) at step n
- = Initial state vector
- = Transition matrix; entry in row i, column j is the probability of moving from state i to state j, and each row sums to 1
- = Number of steps (a nonnegative integer)
Worked Example
Problem: A town's weather is either Sunny (S) or Rainy (R). If today is sunny, tomorrow is sunny with probability 0.8. If today is rainy, tomorrow is sunny with probability 0.3. Today's state vector is . Find tomorrow's state vector .
Step 1: Build the transition matrix. Row 1 is "from Sunny" and row 2 is "from Rainy." Each row must sum to 1.
Step 2: Multiply the row vector by . Each entry of the result is the dot product of with one column of .
Step 3: Check that the result is a valid state vector. Both entries are nonnegative, and they add to 1.
Answer: , so tomorrow there is a 55% chance of sun and a 45% chance of rain.
Why It Matters
State vectors let you predict long-run behavior. Examples include the share of customers who stay with a brand, or how a population moves between cities. Markov chains are not part of the core AP Statistics exam, but they show up in finite math, linear algebra, and probability courses, and they underlie models such as Google's original PageRank.
Common Mistakes
Mistake: Confusing a state vector with a unit vector, and scaling it so its length equals 1.
Correction: A state vector's entries must add to 1. Its length does not have to be 1. For example, is a valid state vector, but its length is .
