Javascript must be enabled
Gerandy Brito : Alons conjecture in random bipartite biregular graphs with applications. (Nov 2, 2017 3:10 PM)
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.
- Category: Probability
- Duration: 01:24:58
- Date: November 2, 2017 at 3:10 PM
- Views: 177
- Tags: seminar, Probability Seminar
0 Comments