A generalized Pólya's urn with graph based interactions

DOI10.1002/rsa.20523zbMath1317.05103arXiv1211.1247OpenAlexW1968473473MaRDI QIDQ5265339

Yuri Lima, Michel Benaïm, Itai Benjamini, Jun Chen

Publication date: 23 July 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

gradient-like systemreinforcementstochastic approximation algorithmsPólya's urnunstable equilibria

Mathematics Subject Classification ID

Approximation algorithms (68W25) Connectivity (05C40) Random walks on graphs (05C81)

Related Items (22)

Interacting urns on a finite directed graph ⋮ Interacting generalized Friedman's urn systems ⋮ Vertex reinforced random walks with exponential interaction on complete graphs ⋮ A Finite Memory Interacting Pólya Contagion Network and Its Approximating Dynamical Systems ⋮ 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 ⋮ Lyapunov function for interacting reinforced stochastic processes via Hopfield's energy function ⋮ Interacting nonlinear reinforced stochastic processes: Synchronization or non-synchronization ⋮ Coexistence in Preferential Attachment Networks ⋮ Synchronization of reinforced stochastic processes with a network-based interaction ⋮ Proof of the WARM whisker conjecture for neuronal connections ⋮ Absence of warm percolation in the very strong reinforcement regime ⋮ Synchronization and functional central limit theorems for interacting reinforced random walks ⋮ Nonlinear randomized urn models: a stochastic approximation viewpoint ⋮ Localisation in a growth model with interaction. Arbitrary graphs ⋮ Localisation in a growth model with interaction ⋮ Interacting reinforced stochastic processes: statistical inference based on the weighted empirical means ⋮ Weakly reinforced Pólya urns on countable networks ⋮ Networks of reinforced stochastic processes: asymptotics for the empirical means ⋮ Quenched law of large numbers and quenched central limit theorem for multiplayer leagues with ergodic strengths ⋮ The trace-reinforced ants process does not find shortest paths

Cites Work

• A survey of random processes with reinforcement
• A strong law for some generalized urn processes
• Vertex-reinforced random walk
• Analysis of recursive stochastic algorithms
• A dynamic model of social network formation
• A Dynamical System Approach to Stochastic Approximations
• A Stochastic Approximation Method

This page was built for publication: A generalized Pólya's urn with graph based interactions