We will discuss some recent developments
on random graphs with given expected degree distributions.
Such ramdom graphs can be used to model various very large graphs
arising in Internet and telecommunications. In turn, these
"massive graphs" shed insights and lead to new directions for
random graph theory. For example, it can be shown that the sizes of
connected components depend primarily on the average degree and
the second-order average degree under certain mild conditions.
We will also mention a number of problems that are suggested by
various applications of massive graphs.
Copyright. All Rights Reserved.