Abstract
We consider a new model of the web graph and related networks. The model is motivated by the copying models of the web graph, where new nodes copy the link structure of existing nodes, and a certain number of additional random links are introduced. Our model parametrizes the number of random links, thereby allowing for the analysis of threshold behaviour. We consider infinite limits of graphs generated by our model, and compare properties of these limits with orientations of the infinite random graph. We analyze the power law behaviour of the in-degree distribution of graphs generated by our model.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: Poceedings of the IEEE Data Compression Conference, DCC (2001)
Aiello, W., Chung, F., Lu, L.: Random evolution in massive graphs. In: Abello, J., et al. (eds.) Handbook on Massive Data Sets, pp. 97–122. Kluwer Academic Publishers, Dordrecht (2002)
Albert, R., Barabási, A.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Structures Algorithms 18, 279–290 (2001)
Bonato, A., Janssen, J.: Infinite limits of copying models of the web graph. Internet Mathematics 1, 193–213 (2003)
Cameron, P.J.: The random graph. In: Graham, R.L., Nešetřil, J. (eds.) Algorithms and Combinatorics, vol. 14, pp. 333–351. Springer, New York (1997)
Cameron, P.J.: The random graph revisited. In: European Congress of Mathematics, Barcelona, vol. I, pp. 267–274 (2000); Progr. Math., vol. 201. Birkhäuser, Basel (2001)
Diestel, R., Leader, I., Scott, A., Thomassé, S.: Partitions and orientations of the Rado graph (submitted)
Erdős, P., Rényi, A.: Asymmetric graphs. Acta Math. Acad. Sci. Hungar. 14, 295–315 (1963)
An, Y., Janssen, J., Milios, E.: Characterizing the citation graph of computer science literature. Accepted in Knowledge and Inf. Systems (KAIS)
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: Proceedings of the 41th IEEE Symp. on Foundations of Computer Science (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonato, A., Janssen, J. (2005). Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces. In: López-Ortiz, A., Hamel, A.M. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2004. Lecture Notes in Computer Science, vol 3405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527954_5
Download citation
DOI: https://doi.org/10.1007/11527954_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27873-3
Online ISBN: 978-3-540-31860-6
eBook Packages: Computer ScienceComputer Science (R0)