2006 Mount Holyoke College
Connecticut Valley Mathematics Colloquium
Speaker: Fan Chung Graham
University of California at
San Diego
Wednesday, November 15, 5:00
p.m.
Room 305 Kendade Hall
(Reception at 4:30 pm. in room
416 Clapp Laboratory)
Title: Random graphs and Internet
graphs
| We will discuss some recent
developments on random graphs with given expected degree
distributions. Such ramdom graphs can be used to model
various very large graphs arising in Internet and telecommunications.
In turn, these " massive graphs" shed insights
and lead to new directions for random graph theory. For
example, it can be shown that the sizes of connected
components depend primarily on the average degree and
the second-order average degree under certain mild conditions.
Furthermore, the spectra of the adjacency matrices of
some random power law graphs obey the power law while
the spectra of the Laplacian follow the semi-circle law.
We will mention a number of related results and problems
that are suggested by various applications of massive
graphs. |