A generalized Pólya's urn with graph based interactions: convergence at linearity

DOI10.1214/ECP.v19-3094zbMath1326.60135arXiv1306.5465OpenAlexW2118318313MaRDI QIDQ2514456

Jun Chen, Cyrille Lucas

Publication date: 3 February 2015

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

dynamical systemalmost sure convergencestochastic approximationsgeneralized Pólya's urn modelgraph based interactions

Mathematics Subject Classification ID

Strong limit theorems (60F15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Dynamics induced by flows and semiflows (37C10) Graph theory (05C99)

Related Items (10)

Interacting generalized Friedman's urn systems ⋮ Lyapunov function for interacting reinforced stochastic processes via Hopfield's energy function ⋮ Interacting nonlinear reinforced stochastic processes: Synchronization or non-synchronization ⋮ Synchronization of reinforced stochastic processes with a network-based interaction ⋮ Absence of warm percolation in the very strong reinforcement regime ⋮ Nonlinear randomized urn models: a stochastic approximation viewpoint ⋮ 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 ⋮ The trace-reinforced ants process does not find shortest paths

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