Scale-free Models of Real-World Networks

Bela Bollobas

University of Memphis, TN and University of Cambridge, UK

April 25,
4:15pm
refreshments at 3:45pm
2-338

ABSTRACT 

In 1998, Watts and Strogatz observed that many large-scale real-world networks, including neural networks, power grids, collaboration graphs, and the internet, have numerous common features that resemble properties of random graphs. It was also realized that the standard mean-field and lattice-based random graphs are not appropriate models of these large-scale networks, so we should look for other classes of random graphs. One of the main features demanded of these new random graphs is that they should be scale-free. The first such model was introduced by Barabasi and Albert in 1999; by now, numerous models of scale-free random graphs have been proposed and studied, mostly by computer simulations and heuristic analysis.

In the talk we shall review a number of these models, and present several recent rigorous results obtained jointly with Oliver Riordan, and some other results proved with Noam Berger, Christian Borgs, Jennifer Chayes and Oliver Riordan.


Speaker's Contact Info: bbolloba(at-sign)memphis.edu


Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on April 04, 2003 at 01:25 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.