Title: Probabilistic
Tail Bounds From "Breaking the VLB Barrier for Oblivious Reconfigurable Networks"
Abstract: This
talk will be a lecture-style talk about a single Lemma/Theorem that shows up in my STOCâ24 paper, "Breaking the VLB Barrier for Oblivious Reconfigurable Networks." In this work, we prove a general tail bound on the distribution of values from a bilinear form
on an orbit of a permutation group action. (In other wordsâ a probabilistic tail bound on sums of random variables that are structured in a particular way.) In this talk, I will walk us through this bound, and motivate it with some simple examples. I do not
expect the audience to have familiarity with my line of work, only an interest in proofs about random variables.
This talk is based on joint work with Daniel Amir, Nitika Saran, Robert Kleinberg, Vishal Shrivastav, and Hakim Weatherspoon.
Bio: Tegan is a Distinguished Postdoc at Northeastern working under Rajmohan, and is generally interested
in algorithms, graph theory, networks and routing, and combinatorics. She received her PhD from Cornell University, advised by Robert Kleinberg. Her recent work has focused on network and routing design for reconfigurable datacenter networks.
![[Computer Systems Lab]](http://www.cs.wisc.edu/pics/csl_logo.gif){kind=logo}