Colloquium

Department of Mathematics


Random Graphs and Internet Graphs


Fan Chung

University of California at San Diego

Abstract

Many very large graphs that arise in Internet and telecommunications applications share various properties with random graphs (while some differences remain). We will discuss some recent developments and mention a number of problems and results in random graphs and algorithmic design suggested by the study of these "massive" graphs.

Monday, September 19th, 2005
10:40 AM
Room: MEC 106
Refreshments: TBA.


All interested persons are welcome.