Abstract
We describe a general model of a random graph process whose degree sequence obeys a power law. Such laws have recently been observed in graphs associated with the world wide web.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Adler and M. Mitzenmacher, Toward Compressing Web Graphs, To appear in the 2001 Data Compression Conference.
R. Albert, A. Barabasi and H. Jeong. Diameter of the world wide web. Nature 401:103–131 (1999) see also http://xxx.lanl.gov/abs/cond-mat/9907038
B. Bollobás, O. Riordan and J. Spencer, The degree sequence of a scale free random graph process, to appear.
B. Bollobás and O. Riordan, The diameter of a scale free random graph, to appear.
A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins and J. Wiener. Graph structure in the web. http://gatekeeper.dec.com/pub/DEC/SRC/publications/stata/www9.htm
C. Cooper, A. M. Frieze. General models of web graphs. Submitted to Random Structures and Algorithms (2001).
E. Drinea, M. Enachescu and M. Mitzenmacher, Variations on random graph models for the web.
W. Hoeffding, Probability inequalities for sums of bounded random variables, Jornal of the American Statistical Association.
S. Janson, T. Łuczak and A. Ruciński, Random Graphs, John Wiley and Sons, 2000.
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal. The web as a graph. http://www.almaden.ibm.com
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal. Stochastic models for the web graph. http://www.almaden.ibm.com
I. M. Milne-Thomson. The Calculus of Finite Differences. Macmillian, London (1951).
G. Pólya and G. Szego. Problems and Theorems in Analysis I. Springer, Berlin (1970).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cooper, C., Frieze, A.M. (2001). A General Model of Undirected Web Graphs. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_42
Download citation
DOI: https://doi.org/10.1007/3-540-44676-1_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42493-2
Online ISBN: 978-3-540-44676-7
eBook Packages: Springer Book Archive