On the effect of very large nodes in Internet graphs

We analyse a random graph where the node degrees are (almost) independent and have a distribution with finite mean but infinite variance - a region observed in empirical studies of the Internet. We show that the existence of very large nodes has a great influence on the connectivity. If N denotes the number of nodes it seems that the distance between two randomly chosen nodes of the giant component grows as slowly as log log(N). The essential observation is that very large nodes form a spontaneously arising "core network", which plays a crucial role in the connectivity, although its proportional size goes to zero as N /spl rarr/ /spl infin/. Several results related to the core are proven rigorously, and a sketch of a full proof is given. Some simulations providing illustration of the findings are presented. Consequences of the results are discussed.