Two particles' repelling random walks on the complete graph

被引：2
|
作者：
Chen, Jun [1 ]
机构：
[1] CALTECH, Div Humanities & Social Sci, Pasadena, CA 91125 USA
来源：
ELECTRONIC JOURNAL OF PROBABILITY | 2014年 / 19卷
关键词：
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 条
  • [1] Two repelling random walks on Z
    Prado, Fernando P. A.
    Coletti, Cristian F.
    Rosales, Rafael A.
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2023, 160 : 72 - 88
  • [2] Random walks on a complete graph: A model for infection
    Datta, N
    Dorlas, TC
    JOURNAL OF APPLIED PROBABILITY, 2004, 41 (04) : 1008 - 1021
  • [3] PAINTING A GRAPH WITH COMPETING RANDOM WALKS
    Miller, Jason
    ANNALS OF PROBABILITY, 2013, 41 (02): : 636 - 670
  • [4] Vertex reinforced random walks with exponential interaction on complete graphs
    Rosales, Rafael A. A.
    Pires, Benito
    Prado, Fernando P. A.
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2022, 148 : 353 - 379
  • [5] Strongly Vertex-Reinforced-Random-Walk on a complete graph
    Benaim, Michel
    Raimond, Olivier
    Schapira, Bruno
    ALEA-LATIN AMERICAN JOURNAL OF PROBABILITY AND MATHEMATICAL STATISTICS, 2013, 10 (02): : 767 - 782
  • [6] Recurrence and windings of two revolving random walks
    Bosi, Gianluca
    Hu, Yiping
    Peres, Yuval
    ELECTRONIC JOURNAL OF PROBABILITY, 2022, 27
  • [7] Complete Graphs and Bipartite Graphs in a Random Graph
    Feng, Lijin
    Barr, Jackson
    2021 5TH INTERNATIONAL CONFERENCE ON VISION, IMAGE AND SIGNAL PROCESSING (ICVISP 2021), 2021, : 259 - 266
  • [8] On recurrence and transience of self-interacting random walks
    Peres, Yuval
    Popov, Serguei
    Sousi, Perla
    BULLETIN OF THE BRAZILIAN MATHEMATICAL SOCIETY, 2013, 44 (04): : 841 - 867
  • [9] Random Walk in the Complete Graph : Hitting and Cover Times
    François Castella
    Bruno Sericola
    Methodology and Computing in Applied Probability, 2025, 27 (2)
  • [10] Transient random walks in random environment on a Galton–Watson tree
    Elie Aidékon
    Probability Theory and Related Fields, 2008, 142 : 525 - 559
12345