Skip to content
  1. IB Question Bank
  2. Maths AI
  3. Statistics & Probability
Topic 4.20 · HL only

Transition matrices (higher powers), Markov chains, steady state and long term probabilities: notes and practice questions

Summary
  • State: A mutually exclusive event that can change over time.
  • Markov Chain: A mathematical model describing a sequence of states over discrete time steps.
  • The probability of the next state depends only on the current state.
  • Transition probabilities do not change over time.
  • Regular Markov Chain (HL): A Markov chain where any state is reachable from any other in a fixed number of steps (kk). All IB AI HL Markov chains are regular.
  • **Transition Matrix (TT):** A matrix representing transition probabilities.
  • Columns represent current states; rows represent next states.
  • Probabilities within any single column must sum to 1.
  • Transition State Diagram: A visual representation where vertices are states and edges show transition probabilities; probabilities on arrows coming out of a state must sum to 1.
  • Future State Probability (HL): The state probability vector after nn transitions is given by:

sn=Tns0 \mathbf{s}_n = T^n \mathbf{s}_0
where s0\mathbf{s}_0 is the initial state probability vector.

  • **Steady State Vector (s\mathbf{s}) (HL):** A probability vector that does not change when multiplied by the transition matrix.
  • Mathematically: Ts=sT\mathbf{s} = \mathbf{s}.
  • Regular Markov chains always have a unique steady state.
  • It is the eigenvector of TT corresponding to the eigenvalue 1, scaled such that its elements sum to 1.
  • Long-Term Probabilities (HL): As the number of transitions (nn) becomes very large, TnT^n tends towards a limit matrix (T∞T^\infty) where all columns are identical and equal to the steady state vector s\mathbf{s}.
  • Calculating Matrix Powers (Diagonalisation, HL): A transition matrix raised to the power of nn can be calculated as:

Tn=PDnP−1 T^n = P D^n P^{-1}
where DD is a diagonal matrix of the eigenvalues of TT, and PP is a matrix whose columns are the corresponding eigenvectors of TT. Every transition matrix has exactly one eigenvalue equal to 1, and the absolute values of all other eigenvalues are less than 1.

  • Finding Expected Populations (HL):

1. Determine the initial state probability vector s0\mathbf{s}_0.
2. Calculate the state probability vector for the desired time interval using sn=Tns0\mathbf{s}_n = T^n \mathbf{s}_0.
3. Multiply the resulting state probability vector by the total population NN.

  • Finding the Exact Steady State Vector (Algebraic, HL):

1. Set the steady state vector s\mathbf{s} with entries x1,x2,…x_1, x_2, \dots.
2. Set up the matrix equation Ts=sT\mathbf{s} = \mathbf{s}.
3. Form and solve the system of linear equations to find a proportional relationship between x1,x2,…x_1, x_2, \dots.
4. Scale the elements so that they sum to 1.

  • GDC for Steady States (HL): Calculate TnT^n for a very large value of nn (e.g., T50T^{50} or T100T^{100}); the identical columns (when rounded) represent the steady state vector.
  • Transition Matrices, Markov Chains, and Steady States are HL only topics.
  • Exam Tip: Column Check (HL): Always double-check that all probabilities within each individual column of a transition matrix sum to 1.
  • Exam Tip: Visualisation (HL): Drawing a transition state diagram can help in constructing the transition matrix.
  • Exam Tip: Diagonalisation Care (HL): Remember that PDnP−1P D^n P^{-1} requires careful matrix multiplication, not element-wise multiplication.

How it is examined

The subtopic that ties topic 1, topic 3 and topic 4 together, which is why it turns up in Paper 3. Two routes to the steady state exist and the question tells you which one it wants: raise TT to a high power on the GDC for an approximate answer, or solve the linear system for an exact one. The scaling condition (the entries sum to 1) is a marking point students drop when they go the eigenvector route. The column convention has to be respected, since transposing TT silently produces a wrong answer that still looks like a probability.

Given in the booklet

sn=Tns0s_n = T^n s_0.

Key ideas
  • Transition matrices.
  • Powers of transition matrices.
  • Regular Markov chains.
  • Initial state probability matrices.

Linking questions

  • Other contexts: absorbing states for Markov chains, the gambler's ruin problem.
  • Website: simulation for Markov chains, setosa.io/blog/2014/07/26/markov-chains/
  • Enrichment only, so not examinable: Leslie matrices, which are used extensively in biology.

Practice questions

13 questions · 8 medium · 5 hard
Showing 13 of 13

Question 1

MediumPaper 1 · calculator7 marks
(a)

A market research company studies the customer loyalty between two competing streaming services, StreamSphere (S) and CineFlow (C), over a number of months.

Each month, customers either maintain their current subscription or switch to the other service.

In any given month, it is observed that the probability of a StreamSphere customer remaining with StreamSphere the following month is 0.85, and the probability of a CineFlow customer switching to StreamSphere the following month is 0.20.

This situation can be represented by the transition matrix

T=(0.850.200.150.80)\mathbf{T} = \begin{pmatrix} 0.85 & 0.20 \\ 0.15 & 0.80 \end{pmatrix}

Interpret the value 0.15 in T\mathbf{T} in terms of the changes in customer loyalty between the streaming services.

[1]
(b)

Find the eigenvalues of matrix T\mathbf{T}.

[3]
(c)

One of the eigenvectors of T\mathbf{T} is (1−1)\begin{pmatrix} 1 \\ -1 \end{pmatrix}.

Find another, non-parallel, eigenvector and interpret it in context.

[3]

Question 2

HardPaper 1 · calculator9 marks
(a)

A new streaming service, CineStream (C), enters the market, competing with the established service, FilmFlick (F).

Market research shows that each month:

  • 10% of CineStream subscribers switch to FilmFlick.
  • 30% of FilmFlick subscribers switch to CineStream.

The transition matrix TT describing these changes, where the rows and columns are ordered (CineStream, FilmFlick), is given as T=(0.900.300.100.70)T = \begin{pmatrix} 0.90 & 0.30 \\ 0.10 & 0.70 \end{pmatrix}.

The two eigenvalues for this matrix are 11 and 0.600.60. An eigenvector corresponding to the eigenvalue of 11 is (31)\begin{pmatrix} 3 \\ 1 \end{pmatrix}.

Find an eigenvector corresponding to the eigenvalue of 0.600.60.

[2]
(b)

A diagonal matrix of eigenvalues is D=(0.60001)D = \begin{pmatrix} 0.60 & 0 \\ 0 & 1 \end{pmatrix}.

Write down an expression for DnD^n, giving your answer as a 2×22 \times 2 matrix in terms of nn.

[1]
(c)

When CineStream and FilmFlick first launched, there were a total of 80008000 users, all of whom initially subscribed to CineStream.

Assuming the total number of users remains constant, find an expression for the number of users who will favour FilmFlick after nn months.

[6]

Question 3

MediumPaper 1 · calculator6 marks
(a)

(a) A study models student engagement with two online learning platforms, LearnFlow (L) and EduQuest (E), using a Markov chain. The transition matrix PP describes the probability of a student moving between platforms each week:

P=(a1−b1−ab)P = \begin{pmatrix} a & 1-b \\ 1-a & b \end{pmatrix}

where aa is the probability a student using LearnFlow stays on LearnFlow, and bb is the probability a student using EduQuest stays on EduQuest.

One of the eigenvalues for this matrix is equal to 1.

Find the eigenvector corresponding to the eigenvalue of 1.

[3]
(b)

(b) Hence, find an expression, in terms of aa and bb, for the long-term proportion of students using LearnFlow.

[2]
(c)

(c) Hence or otherwise, find the long-term proportion of students using LearnFlow when a=0.7a = 0.7 and b=0.4b = 0.4.

[1]

Question 4

HardPaper 2 · calculator16 marks
(a)

(a) A student's study habits are modelled by a Markov chain. If the student studies Mathematics (M) on a given day, the probability they study Mathematics the following day is 0.750.75. If the student studies Physics (P) on a given day, the probability they study Physics the following day is 0.850.85.

Write down a transition matrix, TT, that shows the movement of the student's study focus between Mathematics and Physics.

[2]
(b)

(b) On Monday, a student spent their study time on Mathematics. Find the probability that the student will be studying Physics on Friday.

[3]
(c)

(c) Write down the characteristic polynomial for the matrix TT. Give your answer in the form λ2+bλ+c=0\lambda^2 + b\lambda + c = 0.

[2]
(d)

(d) Calculate the eigenvectors for the matrix TT.

[4]
(e)

(e) Write down matrices PP and DD such that T=PDP−1T= PDP^{-1}, where DD is a diagonal matrix.

[2]
(f)

(f) Hence, find the long-term probability that the student is studying Physics.

[3]

Question 5

MediumPaper 2 · calculator13 marks
(a)

A financial analyst models the daily price movement of a tech company's stock using a transition matrix. If the stock price increases on a particular day, the probability that it will increase the following day is 0.70.7. If the stock price decreases on a particular day, the probability that it will increase the following day is 0.40.4.

The transition matrix TT for this model is given by T=(0.70.40.30.6)T = \begin{pmatrix} 0.7 & 0.4 \\ 0.3 & 0.6 \end{pmatrix}, where the rows/columns represent 'Increase' and 'Decrease' respectively.

(a) Given that the stock price increased today, calculate the probability that the stock price will increase in two days' time.

[2]
(b)

(b) Find the eigenvalues and corresponding eigenvectors of TT.

[5]
(c)(i)

(c) The matrix TT can be written in the form PDP−1PDP^{-1}, where DD is a diagonal matrix.

(i) Write down a possible matrix PP.

[1]
(c)(ii)

(ii) Write down the corresponding matrix DD.

[1]
(d)

(d) Hence, determine the long-term percentage of days that the stock price will increase.

[4]

Question 6

HardPaper 2 · calculator27 marks
(a)

(a) A single data packet can be transferred between three servers, S1, S2, and S3, in a network. The possible direct transfers are:

  • From S1, the packet can be sent to S2 or stay in S1.
  • From S2, the packet can be sent to S1 or S3.
  • From S3, the packet can be sent to S2 or stay in S3.

Write down the adjacency matrix for the directed graph representing these possible direct data transfers, ordering the servers S1, S2, S3.

[2]
(b)

(b) Find the total number of distinct data paths of length 5 from server S1 to server S2.

[3]
(c)(i)

(c.i) Every possible sequence of 5 data transfers has the same probability of occurring. State this probability.

[3]
(c)(ii)

(c.ii) Use your answer to part (b) to find the probability that if a data packet was initially on server S1, it will be on server S2 after 5 transfers.

[3]
(d)(i)

(d.i) A network administrator monitors the movement of two data packets. The possible combined states of the two packets (assuming they occupy distinct servers) are S12S_{12} (packets on S1 and S2), S13S_{13} (packets on S1 and S3), and S23S_{23} (packets on S2 and S3).

The transitions between these states are modelled by the following transition matrix TT, where rows represent the current state and columns represent the next state, in the order S12,S13,S23S_{12}, S_{13}, S_{23}:

T=(00.250.40.60.50.60.40.250)T = \begin{pmatrix} 0 & 0.25 & 0.4 \\ 0.6 & 0.5 & 0.6 \\ 0.4 & 0.25 & 0 \end{pmatrix}

State the probability that if the packets are currently in state S12S_{12}, they will be in state S13S_{13} after one transfer.

[3]
(d)(ii)

(d.ii) Using the transition matrix TT from part (d.i), state the probability that if the packets are currently in state S13S_{13}, they will be in state S23S_{23} after one transfer.

[3]
(d)(iii)

(d.iii) Using the transition matrix TT from part (d.i), state the probability that if the packets are currently in state S23S_{23}, they will be in state S12S_{12} after one transfer.

[3]
(e)

(e) Given that the two data packets are initially in state S12S_{12} (on servers S1 and S2), find the probability that they will be in state S23S_{23} (on servers S2 and S3) after 5 transfers.

[4]
(f)

(f) The data packets continue this pattern of transfers for a long period. Find the server that is occupied least and the proportion of the time it is free.

[3]

Question 7

MediumPaper 2 · calculator12 marks
(a)(i)

A market research firm models customer loyalty between two competing coffee shops, "The Daily Grind" (D) and "Bean There, Done That" (B), using a Markov chain. Each day, a customer may switch between the two shops.

The model is of the form

(Dn+1Bn+1)=M(DnBn)\begin{pmatrix} D_{n+1} \\ B_{n+1} \end{pmatrix} = M \begin{pmatrix} D_n \\ B_n \end{pmatrix}

where DnD_n is the probability a customer chooses "The Daily Grind" on day nn, and BnB_n is the probability a customer chooses "Bean There, Done That" on day nn, where n∈Nn \in \mathbb{N}.

The transition matrix MM is found to be (0.85k0.150.90)\begin{pmatrix} 0.85 & k \\ 0.15 & 0.90 \end{pmatrix}.

Write down the value of kk.

[1]
(a)(ii)

State what kk represents in this context.

[1]
(b)

Find the eigenvalues of MM.

[3]
(c)

Find the eigenvectors of MM.

[3]
(d)(i)

A new customer initially chooses 'The Daily Grind'. Calculate the probability that this customer chooses 'The Daily Grind' after 3 days.

[2]
(d)(ii)

Calculate the probability that this customer chooses 'The Daily Grind' in the long term.

[2]

Question 8

HardPaper 2 · calculator21 marks
(a)(i)

On any given day, the probability that a customer buys a particular product depends only on which product they bought the previous day.

If a customer bought Product A on the previous day, the probability they buy Product A again today is 0.70.7.

If a customer bought Product B on the previous day, the probability they buy Product A today is qq.

On day nn this can be represented using the vector vnv_n where

vn=(probability that a customer buys Product A on day nprobability that a customer buys Product B on day n)v_n = \begin{pmatrix} \text{probability that a customer buys Product A on day } n \\ \text{probability that a customer buys Product B on day } n \end{pmatrix}

A Markov chain model is formed where

vn+1=Mvnv_{n+1} = Mv_n

Matrix MM is of the form (aqb1−q)\begin{pmatrix} a & q \\ b & 1-q \end{pmatrix}

Write down the value of

(i) aa.

[2]
(a)(ii)

Write down the value of

(ii) bb.

[2]
(b)(i)

On day zero, a customer buys Product A. Find the probability

(i) that the customer buys Product A for all days from n=1n = 1 to n=4n = 4.

[2]
(b)(ii)

On day zero, a customer buys Product A. Find the probability

(ii) that the customer buys Product A on day 4, when q=0.2q = 0.2.

[5]
(c)

Demonstrate that, for all values of qq, one eigenvector of MM is (1−1)\begin{pmatrix} 1 \\ -1 \end{pmatrix} and hence state the associated eigenvalue.

[4]
(d)

Find, in terms of qq, the steady state probability that a customer buys Product A on a given day.

[4]
(e)

In the long term, the company wants Product A to have at least 70% market share.

Find the minimum value of qq required for this to occur.

[2]

Question 9

MediumPaper 2 · calculator17 marks
(a)

A large university offers three primary study modes for its students: Online (O), Hybrid (H), and In-person (I). Each academic year, students may choose to switch between these modes based on their preferences and circumstances.

A study tracked student movement between these modes over a single academic year, revealing the following transition probabilities:

  • Of students initially studying Online, 85% remained Online, 10% switched to Hybrid, and 5% switched to In-person.
  • Of students initially studying Hybrid, 8% switched to Online, 80% remained Hybrid, and 12% switched to In-person.
  • Of students initially studying In-person, 3% switched to Online, 7% switched to Hybrid, and 90% remained In-person.

Assume that these transition probabilities remain constant each year and that the total number of students in the university remains constant.

Represent this information in a transition matrix TT, ordering the states as Online, Hybrid, and In-person.

[3]
(b)

At the start of the study, the university had 5000 students studying Online, 8000 students studying Hybrid, and 7000 students studying In-person.

By using TT, find the expected number of students studying in the Hybrid mode 5 academic years after the start of the study.

[4]
(c)(i)

For matrix TT there exists a steady state vector

u=(u1u2u3)u = \begin{pmatrix} u_1 \\ u_2 \\ u_3 \end{pmatrix},

where u1,u2u_1, u_2 and u3u_3 are the proportions of the total student population in the Online, Hybrid, and In-person modes respectively, in the long term.

The steady state vector uu may be found by solving a system of equations.

Determine these equations that are to be solved.

[3]
(c)(ii)

By solving your system of equations, find uu.

[3]
(d)

Use your answer to part (c)(ii) to determine the long-term expected population of the In-person mode.

[2]
(e)

Suggest two reasons why your answer to part (d) is not likely to be accurate. You may comment on both the model and the situation in context.

[2]

Question 10

HardPaper 2 · calculator14 marks
(a)

A competitive market has two dominant smartphone brands, Aura and Zenith. Each year, it is observed that 15%15\% of Aura customers switch to Zenith, while 5%5\% of Zenith customers switch to Aura. All other customer movements are negligible.

Write down a transition matrix TT representing the customer movements between the two brands in a particular year. Assume the order of brands is Aura, then Zenith.

[2]
(b)

Find the eigenvalues and corresponding eigenvectors of TT.

[4]
(c)

Hence write down matrices PP and DD such that T=PDP−1T = PDP^{-1}.

[2]
(d)

Initially, Brand Aura has 100 000100\,000 customers and Brand Zenith has 200 000200\,000 customers.

Find an expression for the number of customers Brand Aura has after nn years, where n∈Nn \in \mathbb{N}.

[5]
(e)

Hence write down the number of customers that Brand Aura can expect to have in the long term.

[1]

Question 11

MediumPaper 1 · calculator7 marks
(a)

A streaming service offers two subscription plans: Premium and Basic. The service has found that customers' choices follow a pattern. If a customer has the Premium plan in a given month, the probability they will keep the Premium plan the next month is 0.8. If a customer has the Basic plan in a given month, the probability they will upgrade to the Premium plan the next month is 0.1.

(a) Let the states be Premium (State 1) and Basic (State 2). Write down the transition matrix, T, for this Markov chain.

[2]
(b)

(b) A new customer subscribes to the Premium plan in their first month, January. Find the probability that this customer will have the Premium plan in March of the same year.

[2]
(c)

(c) Find the steady state probability vector for this Markov chain.

[3]

Question 12

MediumPaper 1 · calculator9 marks
(a)

A marketing analyst models the monthly customer loyalty for two companies, Innovate Inc. and Legacy Corp., using the transition matrix T=(p1−q1−pq)T = \begin{pmatrix} p & 1-q \\ 1-p & q \end{pmatrix}, where 0<p<10 < p < 1 and 0<q<10 < q < 1. `p` is the probability a customer of Innovate Inc. remains with them the next month, and `q` is the probability a customer of Legacy Corp. remains with them the next month.

(a) Find the eigenvalues of the matrix T in terms of `p` and `q`.

[4]
(b)

(b) In the long term, the market share for the two companies reaches a steady state. Find the proportion of customers that are with Innovate Inc. and Legacy Corp. at this steady state, in terms of `p` and `q`.

[5]

Question 13

MediumPaper 1 · calculator5 marks
(a)

Two coffee shops, Bean Buzz and Daily Grind, compete for customers in a small town. A market analysis shows that customer loyalty changes from month to month.

A customer who went to Bean Buzz in one month has a 60% probability of switching to Daily Grind the next month. A customer who went to Daily Grind in one month has a 30% probability of switching to Bean Buzz the next month.

This situation can be modelled by the transition matrix T=(0.40.30.60.7)T=\begin{pmatrix} 0.4 & 0.3 \\ 0.6 & 0.7 \end{pmatrix}, where the first column represents the initial state of being a Bean Buzz customer and the second column represents the initial state of being a Daily Grind customer. The eigenvalues of TT are 11 and 0.10.1.

(a) Find an eigenvector corresponding to the eigenvalue of 11. Give your answer in the form (xy)\begin{pmatrix} x \\ y \end{pmatrix}, where x,y∈Z+x, y \in \mathbb{Z}^+.

[3]
(b)

(b) Using your answer to part (a), or otherwise, find the long-term market share for Bean Buzz. Give your answer as a percentage to one decimal place.

[2]

Every Transition matrices (higher powers), Markov chains, steady state and long term probabilities question, marked for you

Every answer is marked mark by mark, IB-style, and the AI tutor helps when you are stuck.

Where marks are lost

  • Leaving an answer in calculator notation. Never accepted in a final answer, and AI's constant calculator use makes this the easiest slip in the whole subject.
Free. Every IB subject.
No card, no trial that runs out. Just a free account.
  • 50 marked answers a month
    Marked mark by mark, IB-style
  • Hints and mark schemes
    On every part of every question
  • 3,000+ questions
    All 6 subjects, SL and HL, mapped to the syllabus
  • Progress that adapts
    Your Study Profile picks what to practise next

Practise this topic as a session

Pick a difficulty and paper, and FourtyFive tracks your progress on this topic as you go.

or with email
FAQ

Questions,
answered.

Can't find what you're looking for? Email our student team.

What does Transition matrices (higher powers), Markov chains, steady state and long term probabilities cover in IB Maths AI?

State: A mutually exclusive event that can change over time. Markov Chain: A mathematical model describing a sequence of states over discrete time steps. The probability of the next state depends only on the current state.

Is Transition matrices (higher powers), Markov chains, steady state and long term probabilities SL or HL?

Transition matrices (higher powers), Markov chains, steady state and long term probabilities is HL only. SL students are not examined on it.

How do I revise Transition matrices (higher powers), Markov chains, steady state and long term probabilities for IB Maths AI?

Start from the core idea: state: A mutually exclusive event that can change over time. In the exam: the subtopic that ties topic 1, topic 3 and topic 4 together, which is why it turns up in Paper 3. Two routes to the steady state exist and the question tells you which one it wants: raise T to a high power on the GDC for an approximate answer, or solve the linear system for an exact one. Then practise exam-style questions, easiest first, writing out every step of your working before you check it.

How does FourtyFive help me practise Transition matrices (higher powers), Markov chains, steady state and long term probabilities?

FourtyFive has 13 Transition matrices (higher powers), Markov chains, steady state and long term probabilities questions. Every answer you write is marked mark by mark, IB-style, and you see where each mark was won or lost. Every part has a hint, the AI tutor helps you through the step you are stuck on, and your Study Profile picks what to practise next.

Is FourtyFive free for Transition matrices (higher powers), Markov chains, steady state and long term probabilities practice?

Yes. A free account gives you 50 marked answers a month, and you do not need a card to sign up.

Can I handwrite Transition matrices (higher powers), Markov chains, steady state and long term probabilities answers on an iPad?

Yes. In the FourtyFive iPad app you write your working by hand with Apple Pencil, the way you would on paper, and it is marked the same way.

Start with the IB question
bank built for you.

Free to start, no card needed. Thousands of syllabus-mapped questions, AI Examiner marking, your weakest topics first.