A Continuous-Time Urn Model for a System of Activated Particles

被引:0
作者
Aguech, Rafik [1 ]
Mohamed, Hanene [2 ]
机构
[1] King Saud Univ, Dept Stat & Operat Res, Riyadh 11451, Saudi Arabia
[2] Univ Paris Nanterre, MODALX, UPL, CNRS, F-92000 Nanterre, France
关键词
random structure; stochastic process; continuous-time Polya urn; moment-generating method; partial differential equation; stochastic approximation; renewable energy; 05082; TRANSIENCE; RECURRENCE;
D O I
10.3390/math11244967
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study a system of M particles with jump dynamics on a network of N sites. The particles can exist in two states, active or inactive. Only the former can jump. The state of each particle depends on its position. A given particle is inactive when it is at a given site, and active when it moves to a change site. Indeed, each sleeping particle activates at a rate lambda>0, leaves its initial site, and moves for an exponential random time of parameter mu>0 before uniformly landing at a site and immediately returning to sleep. The behavior of each particle is independent of that of the others. These dynamics conserve the total number of particles; there is no limit on the number of particles at a given site. This system can be represented by a continuous-time Polya urn with M balls where the colors are the sites, with an additional color to account for particles on the move at a given time t. First, using this Polya interpretation for fixed M and N, we obtain the average number of particles at each site over time and, therefore, those on the move due to mass conservation. Secondly, we consider a large system in which the number of particles M and the number of sites N grow at the same rate, so that the M/N ratio tends to a scaling constant alpha>0. Using the moment-generating function technique added to some probabilistic arguments, we obtain the long-term distribution of the number of particles at each site.
引用
收藏
页数:13
相关论文
共 12 条
[1]   Distributions in the Ehrenfest process [J].
Balaji, S ;
Mahmoud, HM ;
Watanabe, O .
STATISTICS & PROBABILITY LETTERS, 2006, 76 (07) :666-674
[2]   ON AN EPIDEMIC MODEL ON FINITE GRAPHS [J].
Benjamini, Itai ;
Fontes, Luiz Renato ;
Hermon, Jonathan ;
Machado, Fabio Prates .
ANNALS OF APPLIED PROBABILITY, 2020, 30 (01) :208-258
[3]  
Ehrenfest PUT, 1907, PHYS Z, V8, P311
[4]  
Fricker C., 2012, P 23 INT M PROB COMB
[5]   EQUIVALENCE OF ENSEMBLES FOR LARGE VEHICLE-SHARING MODELS [J].
Fricker, Christine ;
Tibi, Danielle .
ANNALS OF APPLIED PROBABILITY, 2017, 27 (02) :883-916
[6]   Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity [J].
Fricker, Christine ;
Gast, Nicolas .
EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2016, 5 (03) :261-291
[7]   How to Spread a Rumor: Call Your Neighbors or Take a Walk? [J].
Giakkoupis, George ;
Mallmann-Trenn, Frederik ;
Saribekyan, Hayk .
PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, :24-33
[8]   RECURRENCE AND TRANSIENCE FOR THE FROG MODEL ON TREES [J].
Hoffman, Christopher ;
Johnson, Tobias ;
Junge, Matthew .
ANNALS OF PROBABILITY, 2017, 45 (05) :2826-2854
[9]   FROM TRANSIENCE TO RECURRENCE WITH POISSON TREE FROGS [J].
Hoffman, Christopher ;
Johnson, Tobias ;
Junge, Matthew .
ANNALS OF APPLIED PROBABILITY, 2016, 26 (03) :1620-1635
[10]   A zero-one law for recurrence and transience of frog processes [J].
Kosygina, Elena ;
Zerner, Martin P. W. .
PROBABILITY THEORY AND RELATED FIELDS, 2017, 168 (1-2) :317-346