Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The influence of search engines on preferential attachment
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Evolution of page popularity under random web graph models
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Balls-in-bins processes with feedback and brownian motion
Combinatorics, Probability and Computing
From balls and bins to points and vertices
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximated two choices in randomized load balancing
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Full length article: Minority game for cognitive radios: Cooperating without cooperation
Physical Communication
Probabilistic news recommender systems with feedback
Proceedings of the sixth ACM conference on Recommender systems
| Hi-index | 0.01 |
We examine generalizations of the classical balls and bins models, where the probability a ball lands in a bin is proportional to the number of balls already in the bin raised to some exponent p. Such systems exhibit positive or negative feedback, depending on the exponent p, with a phase transition occurring at p = 1. Similar models have proven useful in economics and chemistry; for example, systems with positive feedback (p 1) tend naturally toward monopoly. We provide several results and useful heuristics for these models, including showing a bound on the time to achieve monopoly with high probability.