Balls and bins models with feedback

被引:0
|
作者
Drinea, E [1 ]
Frieze, A [1 ]
Mitzenmacher, M [1 ]
机构
[1] Harvard Univ, Cambridge, MA 02138 USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:308 / 315
页数:8
相关论文
共 50 条
  • [41] Negative dependence in the balls and bins experiment with applications to order statistics
    Hu, Taizhong
    Xie, Chaode
    JOURNAL OF MULTIVARIATE ANALYSIS, 2006, 97 (06) : 1342 - 1354
  • [42] Brief Announcement: A Generalization of Multiple Choice Balls-into-Bins
    Park, Gahyun
    PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 297 - 298
  • [43] Balls and Bins Distributed Load Balancing Algorithm for Channel Allocation
    Petrova, Marina
    Olano, Natalia
    Maehoenen, Petri
    WONS 2010: SEVENTH INTERNATIONAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES, 2010, : 25 - 30
  • [44] A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds
    Park, Gahyun
    ALGORITHMICA, 2017, 77 (04) : 1159 - 1193
  • [45] Brief Announcement: Tight Bounds for Repeated Balls-into-Bins
    Los, Dimitrios
    Sauerwald, Thomas
    PROCEEDINGS OF THE 34TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2022, 2022, : 419 - 421
  • [46] Balls, bins, and embeddings of partial k-star designs
    Noble, Matt
    Richardson, Shayne N.
    DISCRETE MATHEMATICS, 2019, 342 (12)
  • [47] Balls into bins via local search: cover time and maximum load
    Bringmann, Karl
    Sauerwald, Thomas
    Stauffer, Alexandre
    Sun, He
    31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 187 - 198
  • [48] Balls into bins via local search: Cover time and maximum load
    Bringmann, Karl
    Sauerwald, Thomas
    Stauffer, Alexandre
    Sun, He
    RANDOM STRUCTURES & ALGORITHMS, 2016, 48 (04) : 681 - 702
  • [49] Modified Go-Left Balls and Bins Algorithm for Server Load Balancing
    Banerjee, Prasun
    D'Costa, Stephan
    Bhattacharya, Sukriti
    INFORMATION AND COMMUNICATION TECHNOLOGIES, 2010, 101 : 237 - 242
  • [50] On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation
    Atsonios, Ioannis
    Beaumont, Olivier
    Hanusse, Nicolas
    Kim, Yusik
    ALGORITHMS AND COMPUTATION, 2011, 7074 : 504 - +