Markov Chain Models of Refugee Migration Data
Vincent Huang, James Unwin
TL;DR
This work presents a geography-aware, non-homogeneous Markov-chain framework to model local refugee movements on a daily timescale, using a graph of cities connected by roads and controlled by a distance threshold $D$. The approach computes transition probabilities from intermediate probabilities based on edge distances, enabling $B(t+1)=A(t)B(t)$ evolution and accommodating changing site types (Camp/Conflict/Neutral). Applied to the Burundi crisis with four variants (Initial Graph, Graph-adjusted, Camp-adjusted, Time-adjusted) and UNHCR data, the Camp-adjusted and Graph-adjusted variants yield improved long-term fit over the initial graph, with Time-adjusted removing the need for post-hoc rescaling while maintaining accuracy; the Camp-adjusted model achieves the best long-term ARD and outperforms a leading agent-based model by about 24% in long-term error. Overall, the Markov-chain framework offers a more efficient and scalable alternative to agent-based models for near-real-time refugee-flow forecasting and resource allocation.
Abstract
The application of Markov chains to modelling refugee crises is explored, focusing on local migration of individuals at the level of cities and days. As an explicit example we apply the Markov chains migration model developed here to UNHCR data on the Burundi refugee crisis. We compare our method to a state-of-the-art `agent-based' model of Burundi refugee movements, and highlight that Markov chain approaches presented here can improve the match to data while simultaneously being more algorithmically efficient.
