A Markov Chain Approach to Win Probability in Rugby Union
summary
The gist
Rugby Union’s continuous play, variable-length possessions, and multiple scoring outcomes make it difficult to model with standard approaches The resulting model supports simulation and analysis of…
In short
The model uses a Markov Chain to analyze Rugby Union by defining states based on time remaining, field position, and score differential. This generative approach allows for simulating full match trajectories rather than just predicting win probabilities from a single point. The result is a data-efficient model that provides dynamic estimates of win probability and outcome distributions.
Key concepts
- State Space S
- The state space represents every possible situation in the game, defined by a tuple of (time bucket, field position, score bucket). This decomposition allows the model to capture the complex context of Rugby Union at any given moment.
- Time Bucket T
- Time is divided into six segments based on seconds remaining in each half. These buckets help capture how different stages of the match—like the start, middle, or end of a half—influence future game dynamics.
- First-Order Markov Chain
- This framework assumes that the next state depends only on the current state and not on the entire history of previous states. This 'memoryless' property makes the model computationally efficient for predicting immediate transitions in Rugby Union.
- Monte Carlo Simulation
- This technique runs the Markov chain forward many times starting from a specific game state to generate a distribution of possible final outcomes. This is used to calculate win probability by counting how often each team wins across all simulations.
Terminology used across episodes
This episode discusses
The paper
A Markov Chain Approach to Win Probability in Rugby Union · Read on arXiv
University of Virginia · University of Pennsylvania
Win probability tells us how likely a team is to win, but says little about how the rest of the match might play out. We develop a Markov chain model for rugby union that follows changes in score, time, field position, and possession, with transition probabilities estimated from phase-level match data. The same model lets us estimate win probabilities and expected points, calculate distributions for the next score and final margin, and simulate the remainder of a match from its current state. We assess predictive accuracy and calibration on 27 held-out matches after fitting the model to 105 matches from the same season. The model achieves similar test error to logistic regression and XGBoost, showing that we can model the progression of play while remaining competitive with methods that predict final outcomes directly.
Transcript
Introduction to the show: ident: Statistics. The day in statistics: methods, theory and the inference under them.
Tom: We're looking at the paper: "A Markov Chain Approach to Win Probability in Rugby Union".
Jane: Here's the gist of the paper. Rugby Union’s continuous play, variable-length possessions, and multiple scoring outcomes make it difficult to model with standard approaches The resulting model supports simulation and analysis of in-game trajectories, including win probability and expected point estimates from any given state.
Tom: Markov Chain Framework The authors present a Markov Chain framework that represents Rugby Union as a finite state space over score differential, remaining time, and pitch location This approach has two practical advantages for the setting.
Jane: First, because the chain is generative rather than purely predictive, it produces full match trajectories rather than isolated point estimates, meaning we can simulate forward from any given state to recover not just a win probability but a distribution over final margins, time-to-nextscore, and momentum shifts.
Tom: Second, and more importantly given our data constraints, the model is substantially more data-efficient.
Paper summary: Jane: So we’ve seen the high-level idea—the paper by Watts and Pipping-Gamón proposes using a Markov Chain framework to model rugby union as a finite state space defined by time, field position, and score difference. They claim this helps move beyond models that only predict final outcomes to actually simulate game evolution.
Tom: Right, the core thesis is that because of rugby union’s continuous play and variable possessions, standard approaches struggle with those complexities, so they build a state-space model that captures the context at any given possession.
Lu: The methodology involves defining the state as a tuple of time bucket, field position in meters from the try line, and score bucket based on the signed difference from whichever team has possession. This gives them a total of three hundred thirty-six possible states they work with.
Meng: I’m wondering about those buckets again; specifically how they handle the score grouping into seven buckets and the time division into six segments—does that granularity create too many variables to manage during training?
Lalam: They use those specific buckets to define their transition probabilities, which are estimated empirically from historical match data, meaning each entry in the transition matrix represents a specific observed frequency of moving between those states.
Jane: And they emphasize that because it’s generative, you get full trajectories rather than just isolated point estimates for win probability. This lets you see not just the win chance but the distribution over final margins and time to next score.
Tom: It’s a big shift from static prediction; now you can simulate forward from any state to recover a whole picture of what might happen in terms of momentum shifts during the game.
Lu: They also compare their method against existing work in American football, noting that while models like random forests and XGBoost are used, this Markov chain estimates transition probabilities from a larger pool of in-game state transitions.
Meng: So they’re saying that instead of learning how to predict the final outcome directly from match results, this method learns the probabilities of moving between states during actual play, which should lead to more stable estimates with less data.
Lalam: The paper suggests this is particularly valuable because it produces transition probability estimates that are considerably more stable given a one season sample than a model that must learn its structure solely from final match outcomes alone.
Jane: That stability is crucial for real-world application, and they show that their model performs similarly to other win probability models in terms of accuracy on the training set.
Tom: And they quantify that performance by showing a twenty one point four percent reduction in mean square error relative to the naive baseline model, which predicted a fifty percent win probability for each team.
Lu: The calibration analysis confirms that their Markov chain model is well-calibrated, with an R squared of zero point nine seven four on the training set and zero point nine one five out of sample <ref:2610.04813#pg3>.
Meng: I’m still focused on deployment costs; how much computational overhead does running this forward simulation for a single game state entail? If we have to run thousands of Monte Carlo simulations, that adds significant operational cost.
Lalam: The paper confirms they use Monte Carlo simulation to estimate win probabilities by running the Markov chain forward many times from a given state to generate the distribution of possible outcomes.
Conclusion: Jane: So, looking at the title and authors of this paper, A Markov Chain Approach to Win Probability in Rugby Union, what’s the big picture implication for people who don't read technical papers?
Tom: Essentially, it means we’ve moved past just trying to guess who wins based on final scores; now we have a way to understand the underlying mechanics of how a game unfolds moment by moment.
Lu: The authors are using this state-space modeling approach specifically because rugby union’s continuous nature makes standard models inadequate for capturing the sequence of events accurately.
Meng: For someone who only listens to the show, this means instead of just getting a final prediction, you get a dynamic view of how likely a certain outcome is based on where the game is right now.
Lalam: It changes things because it allows you to estimate win probabilities for any specific game state in real time, factoring in the stochastic nature of rugby and all those different pathways through which a match can go.
Tom: It’s about providing a tool that supports simulation and analysis of those in-game trajectories, including expected point estimates from any given state.
Jane: So it offers a way to analyze how games evolve between states, giving you insight into the evolution of momentum during the match, which is what this Markov Chain Approach to Win Probability in Rugby Union is all about.
More episodes
- Daily Summary for 2026-11-19
- 2310.07973-Statistical Performance Guarantee for Subgroup Identification with Generic Machine Learning
- 2408.09155-Learning Robust Treatment Rules for Censored Data
- Daily Summary for 2026-11-19
- 2603.23397-Kinetic Langevin Splitting Schemes for Constrained Sampling
- 2606.09906-An information-geometric framework for mapping maximum potential biodiversity
- 2603.27718-Induced replication and the assessment of models
- 1307.0898-Entropy of a Zipfian Distributed Lexicon
- 2406.19974-Generalizing self-normalized importance sampling with couplings
- 2412.10213-Collaborative Optimal Design of Controlled Experiments with Subject Covariates