91Ó°ÊÓ

A transition matrix is a fundamental concept when dealing with systems that undergo transitions from one state to another. It is typically denoted as matrix \( P \). This matrix represents the probabilities of moving from one state to another in a system. Each column in the transition matrix corresponds to a specific state, and the rows indicate the potential future states the system can transition into.

For example, in our given exercise, the transition matrix describes how a system might move from one state to another. The specific matrix is:

• 0.7 means there is a 70% probability to stay in the first state.
• 0.2 indicates a 20% chance of moving to another state.
• Other numbers follow the same principle, highlighting the chances of transitioning to different states.

Understanding the transition matrix helps us determine the steady-state vector, which represents a situation where the system's probabilities do not change over time.

A probability vector is a vector that represents the distribution of probabilities across different states in a system. In the context of our chosen exercise, the probability vector is denoted as \( \vec{v} = [v_1, v_2, v_3]^T \). Each component \( v_i \) in the vector represents the probability of the system being in state \( i \) when the system reaches equilibrium.

Key features of a probability vector include:

• All components of the vector are non-negative, meaning each probability is zero or more.
• The sum of all components equals 1, ensuring that probabilities capture the full scope of possible outcomes.

In our exercise, the probability vector becomes the steady-state vector when, upon multiplication by the transition matrix, we obtain the vector itself back. Thus, it reflects the probabilities once the system reaches a point where these probabilities remain constant through transitions.

To find the steady-state vector, we often need to solve a system of equations derived from the equation \( P \vec{v} = \vec{v} \), where \( P \) is our transition matrix, and \( \vec{v} \) is the probability vector. In this case, the multiplication results in a vector equation leading to multiple linear equations that must be solved simultaneously.

From our exercise, the system of equations is:

• \( 0.7v_1 + 0.2v_2 + 0.2v_3 = v_1 \)
• \( 0v_1 + 0.2v_2 + 0.4v_3 = v_2 \)
• \( 0.3v_1 + 0.6v_2 + 0.4v_3 = v_3 \)

Rearranging these equations helps to set each equal to zero, simplifying the solving process. Coupled with the constraint \( v_1 + v_2 + v_3 = 1 \), this provides a complete system of equations that, once solved, delivers the steady-state probabilities.

Matrix multiplication is essential for calculating how systems transition from one state to another. It involves multiplying a matrix by a vector, resulting in another vector. In our exercise, we multiply the transition matrix \( P \) by the probability vector \( \vec{v} \) to find the steady-state vector.

The steps for matrix multiplication include:

• Take each row of the matrix and multiply it by the corresponding component in the vector.
• Sum up the results to form the component for the resultant vector.
• The final product vector represents the updated probabilities after the transition.

In our exercise, the process of multiplying the transition matrix by a probability vector initially gives us a system of linear equations to solve. The final multiplication should confirm the steady-state vector does indeed recreate itself, indicating the system is in equilibrium.