IB Math AI HL Paper 3: Modelling and Graph Theory Guide

9 min read

Oct 25, 2026

#IB Math AI HL#Math AI HL Paper 3#IB Graph Theory#Markov Chains
IB Math AI HL Paper 3: Modelling and Graph Theory Guide cover image

A graph with unfamiliar labels. A matrix describing people moving between locations. A final question asking whether your mathematical answer is realistic. These are the kinds of situations that make IB Mathematics: Applications and Interpretation HL Paper 3 challenging. The issue is rarely just remembering a formula. It is recognising which model fits, carrying out a calculation and explaining what its result means.

An April 2026 r/IBO post shared a student-created investigation involving graph theory, Markov chains and optimisation. Other students asked about the markscheme. Such practice can be useful, but a student prediction does not establish what the IB will examine next.

Here is a repeatable approach to unfamiliar investigations, with original worked examples and explicit checks on model limitations.

What Is the Current IB Math AI HL Paper 3 Format?

For examinations through November 2028, AI HL Paper 3 contains two compulsory extended response problem-solving questions, worth 55 marks altogether and 20% of the final subject grade. A graphic display calculator (GDC) is required. The IB May 2026 examination schedule confirms a duration of 75 minutes.

Some older copies of the IB Mathematics: Applications and Interpretation guide display a 60 minute duration, despite listing 55 marks. For the live course, the examination schedule and current assessment arrangements take precedence when planning timed practice.

The IB's 2029 course update introduces a 60 minute, 50 mark Paper 3 for first assessment in May 2029. That change does not apply to students taking examinations in 2027 or 2028. Check the assessment session rather than following a revision website that mixes the two specifications.

A Five Step Approach to Unfamiliar Modelling Questions

When you first read an extended investigation, avoid jumping to the most advanced technique you know. Use a fixed sequence:

  1. Define the decision. What is being minimised, predicted, connected or compared? Note units and restrictions.
  2. Translate the context. Identify vertices and edges, states and probabilities, variables or functions. State relevant assumptions.
  3. Choose and execute a method. Use the graph algorithm, transition matrix or optimisation method that answers the actual question.
  4. Check the mathematics. Verify totals, matrix orientation, route feasibility and whether an optimum has been established.
  5. Interpret and evaluate. Explain the result in context, then identify which real-world features the model leaves out.

This is a study framework, not an official IB marking rubric. Its purpose is to keep your mathematical reasoning visible when the question changes direction.

Worked Example One: A Minimum Spanning Tree

Suppose a fictional town wants to install communication cables connecting five public facilities, labelled A, B, C, D and E. The table gives estimated construction costs in thousands of currency units. Every connection is bidirectional.

ConnectionABACAEBCBDCDCEDE
Cost47926385

Step 1: Select the correct model. Every facility must be connected, but there is no requirement to travel along every edge or return to a starting vertex. This is a minimum spanning tree (MST) problem, not a travelling salesperson or Chinese postman problem.

Step 2: Apply Kruskal's algorithm. Order edges by cost: BC 2, CD 3, AB 4, DE 5, BD 6, AC 7, CE 8, AE 9. Add the cheapest edge that does not form a cycle. Choose BC, then CD, then AB, then DE.

Four edges now connect all five vertices. The total cost is 2 + 3 + 4 + 5 = 14 thousand units. Kruskal's algorithm establishes that this tree has minimum total edge weight for the given connected, undirected graph.

Step 3: Change a condition. Suppose the CD connection cannot be built. Remove that edge and rerun the algorithm. The new choices are BC 2, AB 4, DE 5 and BD 6. The minimum total becomes 17 thousand units, an increase of 3 thousand units.

Step 4: Interpret. The change reveals that CD is particularly useful in the cheapest network. However, the solution ignores maintenance, capacity, terrain and the consequences if a single cable fails. An MST provides connectivity at minimum modelled construction cost, not necessarily maximum resilience.

How to Distinguish Graph Theory Algorithms

Before applying an algorithm, translate the instruction into a route or network objective.

ObjectiveAppropriate ideaCommon confusion
Connect every location at minimum total edge weightMinimum spanning tree using Prim or KruskalDoes not produce a tour of every location
Traverse every edge and return to the start with minimum repetitionChinese postman problemFocuses on edges, not visiting vertices once
Visit every vertex and return to the start at minimum total distanceTravelling salesperson problemNearest neighbour offers an upper bound, not necessarily the optimum
Count walks of a specified lengthPowers of an adjacency matrixCounts possible walks rather than shortest routes

These methods appear in the current AI HL syllabus, including topics AHL 3.14 to 3.16. A real road network may require shortest path distances between locations before a travelling salesperson model can be applied. Always check whether direction and edge weight have practical meanings.

Worked Example Two: A Three State Markov Chain

Now imagine a hypothetical transport network with three interchange hubs, A, B and C. Each week, users may change the hub they primarily use. Assume a fixed set of users, constant transition probabilities and that the next week's hub depends only on the current week's hub.

Use the convention in the IB guide: columns describe the hub users are leaving, and rows describe the hub they move to. Let the transition matrix be:

T = [[0.6, 0.2, 0.1], [0.3, 0.6, 0.3], [0.1, 0.2, 0.6]]

Each column sums to 1. For example, someone currently at A has probabilities 0.6 of remaining at A, 0.3 of moving to B and 0.1 of moving to C. The initial state is:

s0 = [0.5, 0.3, 0.2] (written as a column vector).

Step 1: Predict one week. Multiply the transition matrix by the state vector:

s1 = T s0 = [0.38, 0.39, 0.23].

Thus the model predicts that 39% of users will primarily use B after one week, up from 30%. All three proportions still sum to 1.

Step 2: Predict two weeks. Multiply again, or calculate T² s0:

s2 = [0.329, 0.417, 0.254].

Under these assumed probabilities, hub B's share grows further to 41.7%.

Step 3: Find the long-term proportions. At a steady state, a probability vector p satisfies Tp = p and its entries sum to 1. Solving these equations gives:

p = [2/7, 3/7, 2/7] ≈ [0.286, 0.429, 0.286].

Because the transition matrix has all positive entries, it represents a regular Markov chain and repeated multiplication converges to this unique stationary distribution. Hub B's long-term modelled share is approximately 42.9%.

Step 4: Evaluate the prediction. The model assumes that switching probabilities remain unchanged, users do not enter or leave the system and their next choice depends only on the current hub. Fares, disruptions, travel times or seasonal changes could invalidate those assumptions. The stationary distribution is a mathematical result under the model, not evidence that real ridership will follow it.

What a GDC Should and Should Not Do

Technology is central to AI HL, but calculator output still needs interpretation. For graph problems, a sketch or clearly labelled weighted edge table can prevent omissions. For Markov chains, store the matrix and initial vector, check dimensions and confirm whether the problem uses row or column state vectors before multiplying.

After obtaining T² s0, check that all values are between zero and one and sum to one. When solving a steady state, substitute your answer back into Tp = p. A numerical result that does not meet the model's defining conditions is not a valid final answer.

Show representative calculations and state what a numerical solution means. Correct entries on a calculator screen are not a substitute for communicating mathematical reasoning on an examination script.

How to Recover When an Investigation Reaches a Dead End

If you cannot proceed, reread the action verb. Connect suggests spanning trees; inspect every road suggests the Chinese postman problem; visit every destination suggests a travelling salesperson route. After n transitions suggests a matrix power, while long term proportion suggests a steady-state equation.

Check a small case manually. If your Markov probabilities do not sum to one, inspect the matrix orientation. If your graph algorithm selects five edges for five vertices in a supposed spanning tree, you have probably formed a cycle. If a route is called optimal without a supporting algorithm or comparison, rethink the claim.

Record valid intermediate work rather than deleting it. A clearly constructed matrix, ordered edge list or correctly formed equation can demonstrate your method even when you cannot reach the final extension.

Timed Revision Without Relying on Predictions

For the current 75 minute paper, read both investigations first and plan time according to their mark allocations. Secure accessible early parts before committing too long to one difficult extension. Leave a short final period to verify calculations and interpretations.

Practise graph algorithms, transition matrices, calculus, statistics and other syllabus areas in mixed investigations. An unofficial Reddit prediction is useful as practice material only, not evidence that those topics will appear. Ask teachers for relevant official specimen material and markschemes via the IB Programme Resource Centre.

After each attempt, write down one modelling assumption you overlooked and one mathematical step you could communicate more clearly. Revisiting these errors is more valuable than simply accumulating difficult questions.

Final Paper 3 Checklist

Before leaving an answer, confirm that your variables and units are defined, your selected method matches the objective, the calculation is reproducible and your result is interpreted in context. Check whether the model actually proves a minimum or only supplies a bound, and distinguish a long-term Markov prediction from a certainty about the real world.

IB Math AI HL Paper 3 rewards more than computation. The transferable skill is moving from an unfamiliar situation to a sensible mathematical model, a justified calculation and a qualified conclusion. That habit prepares you for graph theory and Markov chains without pretending to know the next examination paper.

Written By

Author Profile Picture

Aditi Sneha

Growth Strategist

Reviewed by Ayisha Shahani, IB Content Head at Koncepts.

Loading suggested posts