Strongly vertex-reinforced-random-walk on a complete graph

From MaRDI portal
Publication:2866841

zbMATH Open1277.60169arXiv1208.6375MaRDI QIDQ2866841FDOQ2866841


Authors: Michel Benaïm, Olivier Raimond, Bruno Schapira Edit this on Wikidata


Publication date: 9 December 2013

Published in: ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)

Abstract: We study Vertex-Reinforced-Random-Walk on the complete graph with weights of the form w(n)=nalpha, with alpha>1. Unlike for the Edge-Reinforced-Random-Walk, which in this case localizes a.s. on 2 sites, here we observe various phase transitions, and in particular localization on arbitrary large sets is possible, provided alpha is close enough to 1. Our proof relies on stochastic approximation techniques. At the end of the paper, we also prove a general result ensuring that any strongly reinforced VRRW on any bounded degree graph localizes a.s. on a finite subgraph.


Full work available at URL: https://arxiv.org/abs/1208.6375




Recommendations





Cited In (15)





This page was built for publication: Strongly vertex-reinforced-random-walk on a complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866841)