Urns with multiple drawings and graph-based interaction

DOI10.1007/S10959-024-01365-XMaRDI QIDQ6633180zbMATH OpenFDO

Authors Yogesh Dahiya, Neeraja Sahasrabudhe

Publication date 5 November 2024

Published in Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10959-024-01365-X

zbMATH Keywords

bipartite graphsstochastic approximationsynchronizationurn processes

Mathematics Subject Classification ID

Combinatorial probability (60C05) Central limit and other weak theorems (60F05) Strong limit theorems (60F15) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Recommendations

• Interacting urns on a finite directed graph
• A generalized Pólya's urn with graph based interactions: convergence at linearity
• Synchronization via interacting reinforcement
• Synchronization and fluctuation theorems for interacting Friedman urns
• Graph-based Pólya's urn: completion of the linear case

Cites work

• A generalized Pólya's urn with graph based interactions
• A generalized Pólya's urn with graph based interactions: convergence at linearity
• A generalized urn with multiple drawing and random addition
• A new urn model
• Addendum and corrigendum to: ``Randomized urn models revisited using stochastic approximation.
• Analysis of a generalized Friedman's urn with multiple drawings
• Central limit theorems of a recursive stochastic algorithm with applications to adaptive designs
• Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema
• Fluctuation theorems for synchronization of interacting Pólya's urns
• scientific article; zbMATH DE number 5348356 (Why is no real title available?)
• Interacting generalized Friedman's urn systems
• Interacting reinforced-urn systems
• Interacting urns on a finite directed graph
• Multiple drawing multi-colour urns by stochastic approximation
• Networks of reinforced stochastic processes: asymptotics for the empirical means
• Pólya urn schemes with infinitely many colors
• Semimartingales: A course on stochastic processes
• Synchronization and fluctuation theorems for interacting Friedman urns
• Synchronization and functional central limit theorems for interacting reinforced random walks
• Synchronization of reinforced stochastic processes with a network-based interaction
• Synchronization via interacting reinforcement
• The Laplacian spectrum of a mixed graph
• Two-color balanced affine urn models with multiple drawings

Cited in

(2)

• Multi-colour competition with reinforcement
• Interacting urns on directed networks with node-dependent sampling and reinforcement

This page was built for publication: Urns with multiple drawings and graph-based interaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633180)