Open Access
Translator Disclaimer
2014 Two particles' repelling random walks on the complete graph
Jun Chen
Author Affiliations +
Electron. J. Probab. 19: 1-17 (2014). DOI: 10.1214/EJP.v19-2669

Abstract

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.

Citation

Download Citation

Jun Chen. "Two particles' repelling random walks on the complete graph." Electron. J. Probab. 19 1 - 17, 2014. https://doi.org/10.1214/EJP.v19-2669

Information

Accepted: 12 December 2014; Published: 2014
First available in Project Euclid: 4 June 2016

zbMATH: 1307.60048
MathSciNet: MR3296529
Digital Object Identifier: 10.1214/EJP.v19-2669

JOURNAL ARTICLE
17 PAGES


SHARE
Vol.19 • 2014
Back to Top