| EECS Joint Colloquium Distinguished Lecture Series | ||||
![]() |
Wednesday, January 22, 2003 Professor Bela Bollobas Hardin Chair of Excellence in Combinatorics,
|
|||
|
Models of Large-Scale Real-World Networks |
||||
|
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.
|
||||
| Biography: | ||||
|
Bela Bollobas is the holder of the Jabie
Hardin Chair of Excellence in Combinatorics at the University of
Memphis, and for well over thirty years has been a Fellow of
Trinity College, Cambridge, England. He has worked extensively in
functional analysis, discrete geometry, combinatorics and
probability theory; for the past ten years or so he has been
working almost exclusively in extremal and probabilistic
combinatorics, and various applications of these fields.
|
||||