|
CAM colloquium - Friday, October 13
3:30 p.m.
655 Rhodes Hall
Title: Complex Networks: An Algorithmic Perspective
Abstract: : The issue of performance scalability
is of fundamental importance in complex communications networks. How
does congestion scale on the Internet? At what rate do crawlers discover
new web pages?
In this talk, I will focus on the expansion and spectral gap of a
network and show how they help characterize the performance of many
algorithms. I use these concepts to answer the above questions in
several families of random graphs that model the Internet and WWW.
I will also talk about distributed algorithms that can measure, maintain,
or improve these metrics on a large-scale decentralized network such
as a peer-to-peer network.
Refreshments at 4:30 in 657 Rhodes Hall.
|