Interacting urns on a finite directed graph

DOI10.1017/jpr.2022.29OpenAlexW2945176229MaRDI QIDQ5880991

Gursharn Kaur, Neeraja Sahasrabudhe

Publication date: 9 March 2023

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

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

zbMATH Keywords

limit theoremssynchronisationreinforcementPólya urnsFriedman urnsopinion dynamics on networks

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly reinforced Pólya urns with graph-based competition
• Randomized urn models revisited using stochastic approximation
• Central limit theorems of a recursive stochastic algorithm with applications to adaptive designs
• A survey of random processes with reinforcement
• Semimartingales: A course on stochastic processes
• Synchronization and functional central limit theorems for interacting reinforced random walks
• Interacting reinforced stochastic processes: statistical inference based on the weighted empirical means
• Synchronization and fluctuation theorems for interacting Friedman urns
• Polya Urn Models
• Synchronization via Interacting Reinforcement
• A generalized Pólya's urn with graph based interactions
• Bernard Friedman's Urn
• Fluctuation theorems for synchronization of interacting Pólya's urns

This page was built for publication: Interacting urns on a finite directed graph