Probability Seminar
Thursday, November 2, 2017, 3:15pm, 119 Physics
Gerandy Brito (Georgia Tech)
Alon's conjecture in random bipartite biregular graphs with applications.

Abstract:

This talk concerns to spectral gap in random regular graphs. We prove that almost all bipartite biregular graphs are almost Ramanujan by providing a tight upper bound for the second eigenvalue of its adjacency operator. The proof relies on a technique introduced recently by Massoullie, which we developed for random regular graphs. The same analysis allow us to recover hidden communities in random networks via spectral algorithms. [video]

---

Generated at 8:07am Friday, April 19, 2024 by Mcal.   Top * Reload * Login