Seminar
Speaker
Siva Theja Maguluri (Georgia Institute of Technology (USA))
Date & Time
Mon, 23 November 2026, 15:00 to 15:50
Venue
Emmy Noether Seminar Room
Abstract

One of the first results we learn in Probability Theory is the Central Limit Theorem (CLT). While it characterizes the complete distribution in the limit, it doesn't tell us anything about the prelimit behavior. In contrast, concentration inequalities such as the Chernoff bound provide us prelimit bounds that have the right tail decay, but cannot recover the CLT. Efficient concentration asks for tail bounds that have the right tail scaling, but can also recover the limit theorem. Such results in the CLT context were obtained only recently. Inspired by these developments, we obtain similar efficient concentration for a load balancing systems consisting of queues where jobs are allowed to abandon. We study this system in the heavily overloaded regime where a limit theorem converging to a Gaussian is known in the literature. We obtain efficient concentration by showing that the tail probability is upper bounded by a sum of two terms. The first is the tail of the limiting Gaussian, and the second is a term that goes to zero in the limit as the abandonment rate goes to zero. These results are obtained by first showing a rate of convergence to the limiting Gaussian in the Wasserstein-p distance, which is of independent interest. The Wasserstein-p bounds are in turn obtained using the Stein's method. 

Zoom Link: https://us02web.zoom.us/j/88670406480
 Meeting ID: 886 7040 648