Balls and bins models with feedback
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Random Structures & Algorithms
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Shuffling a stacked deck: the case for partially randomized ranking of search engine results
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Evolution of page popularity under random web graph models
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Web dynamics and their ramifications for the development of web search engines
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Crawl ordering by search impact
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
PageRank and the random surfer model
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Information Systems Research
A meaningful model for computing users' importance scores in Q&A systems
Proceedings of the Second Symposium on Information and Communication Technology
The Brand Effect of Key Phrases and Advertisements in Sponsored Search
International Journal of Electronic Commerce
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Research issues of Internet-integrated cognitive style
Computers in Human Behavior
| Hi-index | 0.00 |
There is much current interest in the evolution of social networks, especially, the Web graph, through time. "Preferential attachment" and the "copying model" are well-known models which explain the observed degree distribution of the Web graph reasonably closely. We claim that the presence of highly popular search engines like Google substantially mediate the act of hyperlink creation by limiting the author's attention to a small set of "celebrity" URLs. Page authors (who are also Web surfers) frequently (with probability p) locate pages using a search engine. Then they link to popular pages among those they visit. We initiate an analysis of this more realistic process, and show that the celebrity nodes eventually accumulate a constant fraction of all links created whp, and that the degrees of the other nodes still follow a power-law distribution, but with a steeper power: Pr(degree = k) α k-(1+2/(1-p)) Whp. Our analysis adds evidence to the recent concern that search engines offer new Web pages a steep, self-sustaining barrier to entry to well-connected, entrenched Web communities.