Copyright © 2005 Elsevier Inc. All rights reserved.
On certain connectivity properties of the internet topology
Received 31 March 2004;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the number of nodes. Another immediate implication is constant spectral gap between the first and second eigenvalues of the random walk matrix associated with these graphs. We also show that the expected frugality (overpayment in the Vickrey–Clarke–Groves mechanism for shortest paths) of a sparse Erdős–Renyi random graph is bounded by a small constant.
Keywords: Conductance; Scale-free networks; Internet; Frugality; Random graphs






E-mail Article
Add to my Quick Links

Cited By in Scopus (4)






