Abstract
Vertex-reinforced random walk is a random process which visits a site with probability proportional to the weight w k of the number k of previous visits. We show that if w k ∼ k α, then there is a large time T 0 such that after T 0 the walk visits 2, 5, or ∞ sites when α 1, respectively. More general results are also proven.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.