Two particles' repelling random walks on the complete graph

被引:2
|
作者
Chen, Jun [1 ]
机构
[1] CALTECH, Div Humanities & Social Sci, Pasadena, CA 91125 USA
来源
关键词
Repelling random walks; Reinforced random walk; multi-particle; complete graph; stochastic approximation algorithms; dynamical approach; chain recurrent set; Lyapunov function; REINFORCED-RANDOM-WALK; STOCHASTIC APPROXIMATIONS; ATTRACTING EDGE; POINTS;
D O I
10.1214/EJP.v19-2669
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We consider two particles' repelling random walks on complete graphs. In this model, each particle has higher probability to visit the vertices which have been seldom visited by the other one. By a dynamical approach we prove that the two particles' occupation measure asymptotically has small joint support almost surely if the repulsion is strong enough.
引用
收藏
页数:17
相关论文
共 50 条
  • [41] RANDOM WALKS, CONDUCTANCE, AND RESISTANCE FOR THE CONNECTION GRAPH LAPLACIAN
    Cloninger, Alexander
    Mishne, Gal
    Oslandsbotn, Andreas
    Robertson, Sawyer J.
    Wan, Zhengchao
    Wang, Yusu
    SIAM Journal on Matrix Analysis and Applications, 2024, 45 (03) : 1541 - 1572
  • [42] The power of two choices for random walks
    Georgakopoulos, Agelos
    Haslegrave, John
    Sauerwald, Thomas
    Sylvester, John
    COMBINATORICS PROBABILITY & COMPUTING, 2022, 31 (01): : 73 - 100
  • [43] THE SPREADING BEHAVIOR OF QUANTUM WALKS INDUCED BY DRIFTED RANDOM WALKS ON SOME MAGNIFIER GRAPH
    Higuchi, Yusuke
    Segawa, Etsuo
    QUANTUM INFORMATION & COMPUTATION, 2017, 17 (5-6) : 399 - 414
  • [45] Repelling, binding, and oscillating of two-particle distrete-time quantum walks
    Wang, Qinghao
    Li, Zhi-Jian
    ANNALS OF PHYSICS, 2016, 373 : 1 - 9
  • [46] INFINITE COMPLETE SUBGRAPH OF A RANDOM GRAPH
    CLARKE, LE
    AMERICAN MATHEMATICAL MONTHLY, 1975, 82 (01): : 87 - 88
  • [47] Random matching problems on the complete graph
    Wastlund, Johan
    ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2008, 13 : 258 - 265
  • [48] Random Walks with negative particles for discontinuous diffusion and porosity
    Oukili, H.
    Ababou, R.
    Debenest, G.
    Noetinger, B.
    JOURNAL OF COMPUTATIONAL PHYSICS, 2019, 396 : 687 - 701
  • [49] Random walks of intermittently self-propelled particles
    Datta, Agniva
    Beta, Carsten
    Großmann, Robert
    Physical Review Research, 2024, 6 (04):
  • [50] Limit distributions for the number of particles in branching random walks
    Bulinskaya, E. Vl
    MATHEMATICAL NOTES, 2011, 90 (5-6) : 824 - 837