Department of Mathematics,
University of California San Diego
****************************
Math 269 - Combinatorics
Prof. Tom Bohman
Carnegie Mellon University
Notes on 2-point concentration in the random graph
Abstract:
We say that an integer-valued random variable $X$ defined on $G_{n,p}$ is concentrated on 2 values if there is a function $f(n)$ such that the probability that $X$ equals $f(n)$ or $ f(n)+1$ tends to 1 as $n$ goes to infinity. 2-point concentration has been a central issue in the study of random graphs from the beginning. In this talk we survey some recent progress in our understanding of this phenomenon, with an emphasis on the independence number and domination number of the random graph.
Joint work with Jakob Hofstad, Lutz Warnke and Emily Zhu.
Host: Lutz Warnke
March 5, 2024
2:00 PM
APM 7321
Research Areas
Combinatorics****************************
