Graph-based Pólya’s urn: Completion of the linear case

DOI10.1142/S0219493716600078zbMath1335.60185arXiv1409.7826MaRDI QIDQ2797922

Yuri Lima

Publication date: 1 April 2016

Published in: Stochastics and Dynamics (Search for Journal in Brave)

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

zbMATH Keywords

almost sure convergencegradient-like systemstochastic approximation algorithmreinforcementbalanced bipartite graphsPólya's urn

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Interacting reinforced stochastic processes: statistical inference based on the weighted empirical means ⋮ Networks of reinforced stochastic processes: asymptotics for the empirical means ⋮ The trace-reinforced ants process does not find shortest paths

Cites Work

• Unnamed Item
• A survey of random processes with reinforcement

This page was built for publication: Graph-based Pólya’s urn: Completion of the linear case