Stein's Method for Queueing Approximations Lecture 4 (SNAPP Summer School 2025)

Course homepage: https://sites.google.com/view/snappse...
Notes: https://drive.google.com/file/d/1eWr_...

This is lecture 4 of virtual lecture series held on Zoom with the aim of teaching an advanced but broadly applicable topic to researchers in applied probability.

For the inaugural summer school, we are delighted to have Anton Braverman (Northwestern University) teach a 10-lecture course about Stein's method for queueing approximations. Lectures will be recorded and posted to the SNAPP YouTube channel.

Course Description:
The generator comparison approach of Stein’s method is a framework used to compare the stationary distributions of any two Markov processes and derive bounds on their distance under some integral probability metric. Notably, the approach does not require coupling the two distributions.

Roughly ten years ago, the generator approach was introduced to queueing theory and, specifically, to the area of fluid and diffusion approximations of queueing models. The ability to compare the steady-state distribution of the fluid/diffusion approximation to the original (often intractable) queueing model spurred a variety of interesting research questions. The past ten years have provided answers to many of these questions. Some highlights:

We now have a theory to derive rates of convergence of the original queueing model to its diffusion/fluid approximation
We now know that diffusion/fluid models can perform well universally, across multiple parameter regimes (as opposed to heavy-traffic limit theorems which assume that the model primitives converge to one particular limit; e.g., the Halfin-Whitt regime).
We have learned of higher-order approximations whose approximation error goes to zero an order of magnitude faster than “classical” approximations
The generator approach has been extended to the setting of dynamic control (MDPs) where it quantifies the error of approximating an MDP by the continuous Brownian control problem, resulting in an approximate DP state-space aggregation algorithm.
The generator approach has been extended to “non-Markovian” models; e.g., queueing models with general inter-arrival and service time distributions.

The purpose of this course is to disseminate the developments in the generator approach (with a focus on queueing) over the past ten years. No prior knowledge is assumed. We begin with the basic generator approach for a simple one-dimensional birth-death process, and then add complexity by considering multidimensional CTMCs and, eventually, piecewise-deterministic Markov processes where jumps are driven by general clocks.

At the end of the course students will be familiar with using the generator approach and will be able to apply it to their own research. They will also know the state-of-the-art of the theory, including some open problems.

A lecture-by-lecture topic schedule:
https://docs.google.com/spreadsheets/...

Instructor Bio
Anton Braverman is an associate professor who joined the Operations group at Kellogg in 2017. He completed his PhD in Operations Research from Cornell University, and holds a Bachelor’s degree in Mathematics and Statistics from the University of Toronto. Anton’s research is focused on stochastic modelling and applied probability. Some application domains of interest include ridesharing services and revenue management.