Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs

DOI10.1214/16-AOP1122zbMath1418.60036arXiv1509.00807MaRDI QIDQ2406572

Debleena Thacker, Codina Cotar

Publication date: 5 October 2017

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

order statisticsbipartite graphsattraction setvertex-reinforced random walkedge-reinforced random walkRubin's constructionsuper-linear (strong) reinforcement

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (9)

On a class of random walks with reinforced memory ⋮ Scaling exponents of step-reinforced random walks ⋮ Two repelling random walks on \(\mathbb{Z}\) ⋮ Noise reinforcement for Lévy processes ⋮ Proof of the WARM whisker conjecture for neuronal connections ⋮ Vertex reinforced non-backtracking random walks: an example of path formation ⋮ On a random walk that grows its own tree ⋮ Strongly vertex-reinforced jump process on a complete graph ⋮ Vertex-reinforced jump process on the integers with nonlinear reinforcement

This page was built for publication: Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs