Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 26 tok/s Pro
GPT-4o 98 tok/s
GPT OSS 120B 470 tok/s Pro
Kimi K2 216 tok/s Pro
2000 character limit reached

Two repelling random walks on $\mathbb Z$ (2005.00666v2)

Published 2 May 2020 in math.PR

Abstract: We consider two interacting random walks on $\mathbb{Z}$ such that the transition probability of one walk in one direction decreases exponentially with the number of transitions of the other walk in that direction. The joint process may thus be seen as two random walks reinforced to repel each other. The strength of the repulsion is further modulated in our model by a parameter $\beta \geq 0$. When $\beta = 0$ both processes are independent symmetric random walks on $\mathbb{Z}$, and hence recurrent. We show that both random walks are further recurrent if $\beta \in (0,1]$. We also show that these processes are transient and diverge in opposite directions if $\beta > 2$. The case $\beta \in (1,2]$ remains widely open. Our results are obtained by considering the dynamical system approach to stochastic approximations.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.