Published December 12, 2014
| Version Published
Journal Article
Open
Two particles' repelling random walks on the complete graph
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.
Additional Information
© 2014 Institute of Mathematical Statistics. This work is licensed under a Creative Commons Attribution 3.0 License. Publication Date: December 12, 2014. During the preparation of this manuscript, the author was a student at the Weizmann Institute of Science, and this work was supported by the ISF. The author thanks Itai Benjamini for his very stimulating question and Gady Kozma for reading the draft and giving many comments. The author is indebted to Ofer Zeitouni for his patient guidance and numerous insights on this work. The author is also thankful to Omri Sarig and Yuri Lima for the discussions on dynamical systems.Attached Files
Published - 2669-19660-1-PB.pdf
Files
2669-19660-1-PB.pdf
Additional details
Identifiers
- Eprint ID
- 55961
- Resolver ID
- CaltechAUTHORS:20150323-091451806
Funding
- Israel Science Foundation (ISF)
Dates
- Created
-
2015-03-23Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field