Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 93 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 33 tok/s Pro
GPT-4o 128 tok/s Pro
Kimi K2 202 tok/s Pro
GPT OSS 120B 449 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Phase transition for the Once-reinforced random walk on $\mathbb{Z}^d$-like trees (1604.07631v2)

Published 26 Apr 2016 in math.PR

Abstract: In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit critical parameter $a_0$ such that the Once-reinforced random walk is almost surely recurrent if $a>a_0$ and almost surely transient if $a<a_0$. This provides the first examples of phase transition for the Once-reinforced random walk.

Summary

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

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

Collections

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