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 条

[31] Random Walks on the Bipartite-Graph for Personalized Recommendation
Pei, Zhong-you
Chiang, Chun-heng
Lin, Wen-bin
2013 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE (ICCSAI 2013), 2013, : 97 - 102
[32] Estimating graph parameters via random walks with restarts
Ben-Hamou, Anna
Oliveira, Roberto I.
Peres, Yuval
SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1702 - 1714
[33] Protein Function Prediction by Random Walks on a Hybrid Graph
Liu, Jie
Wang, Jun
Yu, Guoxian
CURRENT PROTEOMICS, 2016, 13 (02) : 130 - 142
[34] Recommendation algorithm based on random walks in a bipartite graph
Gama, Ricardo
André, Nuno
Pereira, César
Almeida, Luís
Pinto, Pedro
RISTI - Revista Iberica de Sistemas e Tecnologias de Informacao, 2011, (08): : 15 - 24
[35] Random Walks Analysis on Graph Modelled Multimodal Collections
Sabetghadam, Serwah
Lupu, Mihai
Rauber, Andreas
SEMANTIC KEYWORD-BASED SEARCH ON STRUCTURED DATA SOURCES, IKC 2016, 2017, 10151 : 76 - 88
[36] String edit distance, random walks and graph matching
Robles-Kelly, A
Hancock, ER
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2004, 18 (03) : 315 - 327
[37] Effective drift estimates for random walks on graph products
Chawla, Kunal
ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2023, 28
[38] Graph Clustering Based on Mixing Time of Random Walks
Avrachenkov, Konstantin
El Chamie, Mahmoud
Neglia, Giovanni
2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2014, : 4089 - 4094
[39] Exact and approximate graph matching using random walks
Gori, M
Maggini, M
Sarti, L
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (07) : 1100 - 1111
[40] Learning of Multimodal Representations With Random Walks on the Click Graph
Wu, Fei
Lu, Xinyan
Song, Jun
Yan, Shuicheng
Zhang, Zhongfei
Rui, Yong
Zhuang, Yueting
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2016, 25 (02) : 630 - 642

← 1 2 3 4 5 →