ABSTRACT


We will discuss some recent developments on random graphs with given expected degree distributions. Such graphs can be used to model various very large graphs arising in Internet and telecommunications and such "massive graphs" in turn shed insight and new directions to random graph theory. For example, it can be shown that the evolution of the sizes of connected components depends primarily on the average degree and the secondorder average degree under certain mild conditions. We will also mention a number of problems in random graphs and algorithmic design suggested by various applications of these massive graphs. Return to Applied Math Colloquium home page 