The Upper Tail Problem in Random Regular Graphs
Probability Seminar
Dec 2, 2020, 03:10 PM - 04:00 PM | Zoom link: https://berkeley.zoom.us/j/93030418340 Evans Hall | Happening As Scheduled
Benjamin Gunby, Harvard University
Fix a graph K. What is the probability that a large random graph contains many more copies of K than expected? We discuss this question when our random graph model is that of a sparse random regular graph.