Please note, this is archived content and is no longer being updated. It is provided for historical records. Links on the pages may be broken or redirect to our current site.
You are here: MIMS > events > colloquia > Fan Chung Graham

Random Graphs and Internet Graphs

Professor Fan Chung Graham

Professor Fan Chung Graham, University of California, San Diego

Thursday June 9, 2005, 2:00 pm. MSS Building, Room C019


We will discuss some recent developments on random graphs with given expected degree distributions. Such random 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.

Materials and further information


Valid HTML 4.01! Valid CSS!