Text only print
Full screen print
Colloquium
Seminar information archive ～04/19｜Next seminar｜Future seminars 04/20～
| Organizer(s) | ASUKE Taro, TERADA Itaru, HASEGAWA Ryu, MIYAMOTO Yasuhito (chair) |
|---|---|
| URL | https://www.ms.u-tokyo.ac.jp/seminar/colloquium/index_e.html |
2012/07/06
16:30-17:30 Room #002 (Graduate School of Math. Sci. Bldg.)
S.R.Srinivasa Varadhan (Courant Institute of Mathematical Sciences, New York University)
Large Deviations of Random Graphs and Random Matrices (ENGLISH)
S.R.Srinivasa Varadhan (Courant Institute of Mathematical Sciences, New York University)
Large Deviations of Random Graphs and Random Matrices (ENGLISH)
[ Abstract ]
A random graph with $n$ vertices is a random symmetric matrix of $0$'s and $1$'s and they share some common aspects in their large deviation behavior. For random matrices it is the question of having large eigenvalues. For random graphs it is having too many or too few subgraph counts, like the number of triangles etc. The question that we will try to answer is what would a random matrix or a random graph conditioned to exhibit such a large deviation look like. Since the randomness is of size $n^2$ large deviation rates of order $n^2$ are possible.
A random graph with $n$ vertices is a random symmetric matrix of $0$'s and $1$'s and they share some common aspects in their large deviation behavior. For random matrices it is the question of having large eigenvalues. For random graphs it is having too many or too few subgraph counts, like the number of triangles etc. The question that we will try to answer is what would a random matrix or a random graph conditioned to exhibit such a large deviation look like. Since the randomness is of size $n^2$ large deviation rates of order $n^2$ are possible.
