Last week I reviewed the statistical properties of real-world networks
(small world, degree distributions, clustering, network motifs, network
densificaton, etc.) and developed tools to measure them.
In this talk I will complete the treatment of the topic by presenting models that help us understand and reason about these properties. We will start with the simplest and probably most well understood Erdos-Renyi random graph model, and continue with exponential random graphs, small-world model and bow-tie model of the web. Last I will spend some time on greedy routing in networks, and dynamical processes are talking place on the networks.
Back to the Main Page
Pradeep Ravikumar Last modified: Fri Mar 2 12:40:58 EST 2007