Strongly reinforced Pólya urns with graph-based competition

DOI10.1214/16-AAP1153zbMath1352.60132arXiv1406.0449MaRDI QIDQ341627

Alexey Kuznetsov, Remco van der Hofstad, Wioletta M. Ruszel, Mark P. Holmes

Publication date: 16 November 2016

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

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

zbMATH Keywords

stochastic approximation algorithmPólya urnsreinforcement modelstable equilibria

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

Interacting urns on a finite directed graph ⋮ Vertex reinforced random walks with exponential interaction on complete graphs ⋮ Extremal linkage networks ⋮ Infinite WARM graphs III: strong reinforcement regime ⋮ Phase transitions in non-linear urns with interacting types ⋮ MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023 ⋮ Proof of the WARM whisker conjecture for neuronal connections ⋮ Absence of warm percolation in the very strong reinforcement regime ⋮ Nonlinear randomized urn models: a stochastic approximation viewpoint ⋮ Weakly reinforced Pólya urns on countable networks ⋮ Finding geodesics on graphs using reinforcement learning ⋮ The trace-reinforced ants process does not find shortest paths

This page was built for publication: Strongly reinforced Pólya urns with graph-based competition