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 条
  • [1] Self-stabilizing repeated balls-into-bins
    L. Becchetti
    A. Clementi
    E. Natale
    F. Pasquale
    G. Posta
    Distributed Computing, 2019, 32 : 59 - 68
  • [2] Self-Stabilizing Repeated Balls-into-Bins
    Becchetti, Luca
    Clementi, Andrea
    Natale, Emanuele
    Pasquale, Francesco
    Posta, Gustavo
    SPAA'15: PROCEEDINGS OF THE 27TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2015, : 332 - 339
  • [3] Self-stabilizing repeated balls-into-bins
    Becchetti, L.
    Clementi, A.
    Natale, E.
    Pasquale, F.
    Posta, G.
    DISTRIBUTED COMPUTING, 2019, 32 (01) : 59 - 68
  • [4] Propagation of chaos for a general balls into bins dynamics
    Cancrini, Nicoletta
    Posta, Gustavo
    ELECTRONIC JOURNAL OF PROBABILITY, 2021, 26
  • [5] 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
  • [6] On the power of two choices: Balls and bins in continuous time
    Luczak, MJ
    McDiarmid, C
    ANNALS OF APPLIED PROBABILITY, 2005, 15 (03): : 1733 - 1764
  • [7] On balls and bins with deletions
    Cole, R
    Frieze, A
    Maggs, BM
    Mitzenmacher, M
    Richa, AW
    Sitaraman, R
    Upfal, E
    RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE, 1998, 1518 : 145 - 158
  • [8] The forgetfulness of balls and bins
    Perkins, Will
    RANDOM STRUCTURES & ALGORITHMS, 2013, 42 (02) : 250 - 267
  • [9] Balls into Bins Made Faster
    Khosla, Megha
    ALGORITHMS - ESA 2013, 2013, 8125 : 601 - 612
  • [10] Balls and bins models with feedback
    Drinea, E
    Frieze, A
    Mitzenmacher, M
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 308 - 315