Mixing time for the Repeated Balls into Bins dynamics

被引:2
|
作者
Cancrini, Nicoletta [1 ]
Posta, Gustavo [2 ]
机构
[1] DIIIE Univ Aquila, Laquila, Italy
[2] Univ Roma La Sapienza, Dipartimento Matemat G Castelnuovo, Rome, Italy
关键词
interacting particles systems; mixing times; parallel updates; queues networks; coupling;
D O I
10.1214/20-ECP338
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We consider a nonreversible finite Markov chain called Repeated Balls-into-Bins (RBB) process. This process is a discrete time conservative interacting particle system with parallel updates. Place initially in L bins rL balls, where r is a fixed positive constant. At each time step a ball is removed from each non-empty bin. Then all these removed balls are uniformly reassigned into bins. We prove that the mixing time of the RBB process is of order L. Furthermore we show that if the initial configuration has o(L) balls per site the equilibrium is attained in o(L) steps.
引用
收藏
页码:1 / 14
页数:14
相关论文
共 50 条
  • [41] Balls-in-bins processes with feedback and Brownian Motion
    Oliveira, Roberto
    COMBINATORICS PROBABILITY & COMPUTING, 2008, 17 (01): : 87 - 110
  • [42] The missing trade of China: balls-and-bins model
    Huimin Shi
    Zheng Jiang
    Empirical Economics, 2016, 50 : 1511 - 1526
  • [43] ABBA: A Balls and Bins Approach to Secure Aggregation in WSNs
    Castelluccia, Claude
    Soriente, Claudio
    2008 6TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS AND WORKSHOPS, VOLS 1 AND 2, 2008, : 176 - +
  • [44] BALLS AND BINS: SMALLER HASH FAMILIES AND FASTER EVALUATION
    Celis, L. Elisa
    Reingold, Omer
    Segev, Gil
    Wieder, Udi
    SIAM JOURNAL ON COMPUTING, 2013, 42 (03) : 1030 - 1050
  • [45] The (1+β)-Choice Process and Weighted Balls-into-Bins
    Peres, Yuval
    Talwar, Kunal
    Wieder, Udi
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1613 - 1619
  • [46] A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds
    Gahyun Park
    Algorithmica, 2017, 77 : 1159 - 1193
  • [47] 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
  • [48] 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
  • [49] 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
  • [50] A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds
    Park, Gahyun
    ALGORITHMICA, 2017, 77 (04) : 1159 - 1193