Theory and applications of probability and stochastic processes.
Unfolding and refolding witness graphs lets the authors characterize critical activation density for every fixed graph H, including witnesses larger than the host graph.
Expected self-intersection time is O(√n log n) on bounded-degree graphs and O(√n) for regular graphs with a uniform spectral gap.
A cone-preservation proof handles one fast and two identical slow servers, closing the first nontrivial case beyond Lin-Kumar’s two-server model.
A BBGKY argument couples entropy and Fisher-information inequalities to extend Lacker’s chaos method to smooth mean-field diffusions.
