The influence of search engines on preferential attachment

Internet Mathematics

Volumn 3, Issue 3, 2006, Pages 361-381

  Frieze, Alan ^a   Vera, Juan ^a   Chakrabarti, Soumen ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79952921543     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2006.10129129     Document Type: Article

References (15)

1. N. Alon and J. Spencer. The Probabilistic Method, Second Edition. New York: Wiley Interscience, 2000.
2. A. Barabási and R. Albert. “Emergence of Scaling in Random Networks.” Science 286 (1999), 509–512.
3. S. Brin and L. Page. “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” Proceedings of WWW7, Computer Networks 30:1–7 (1998), 107–117.
4. J. Cho and S. Roy. “Impact of Search Engines on Page Popularity.” In Proceedings of the International Conference on World Wide Web, pp. 20–29. New York: ACM Press, 2004.
5. C. Cooper and A. M. Frieze. “A General Model of Undirected Web Graphs.” Random Structures and Algorithms 22 (2003), 311–335.
6. E. Drinea, A.M. Frieze, and M. Mitzenmacher. “Balls and Bins Models with Feedback.” In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 308–315. Philadelphia, PA: SIAM, 2002.
7. R. Durrett. Probability: Theory and Examples. Belmont, CA: Wadsworth, 1991.
8. A. Flaxman, A. M. Frieze, and T. I. Fenner. “High-Degree Vertices and Eigenvalues in the Preferential Attachment Graph.” Internet Mathematics 2 (2005), 1–20.
9. S. Fortunato, A Flammini, F. Menczer, and A. Vespignani. “The Egalitarian Effect of Search Engines.” Preprint available at http://arxiv.org/abs/cs/0511005, 2005.
10. M. Hindman, K. Tsioutsiouliklis, and J. A. Johnson. “Googlearchy: How a Few Heavily-Linked Sites Dominate Politics on the Web.” Annual Meeting of the Midwest Political Science Association, 2003.
11. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins. “The Web as a Graph: Measurements, Models and Methods.” In Computing and Combinatorics: 5th Annual International Conference, COCOON’99, Tokyo, Japan, July 26–28, 1999, Proceedings, Lecture Notes in Computer Science 1627, pp. 1–18. Berlin: Springer, 1999.
12. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. “Stochastic Models for the Web-Graph.” In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 57–65. Los Alamitos, CA: IEEE Computer Society, 2000.
13. S. Pandey, S. Roy, C. Olston, J. Cho, and S. Chakrabarti. “Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results.” In Proceedings of the 31st International Conference on Very Large Data Bases, pp. 781–792. New York: ACM Press, 2005.
14. D. M. Pennock, G. W. Flake, S. Lawrence, C. Lee Giles, and E. J. Glover. “Winners Don’t Take All: Characterizing the Competition for Links on the Web.” Proceedings of the National Academy of Sciences 99:8 (2002), 5207–5211.
15. N.L. Johnson and S. Kotz. Urn Models and Their Application: An Approach to Modern Discrete Probability Theory. New York: Wiley, 1977.