A generalized Pólya's urn with graph based interactions
From MaRDI portal
Publication:5265339
Abstract: Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability proportional to its current number of balls raised by some fixed power a>0. We characterize the limiting behavior of the proportion of balls in the bins. The proof uses a dynamical approach to relate the proportion of balls to a vector field. Our main result is that the limit set of the proportion of balls is contained in the equilibria set of the vector field. We also prove that if a<1 then there is a single point v=v(G,a) with nonzero entries such that the proportion converges to v almost surely. A special case is when G is regular and a is at most 1. We show e.g. that if G is non-bipartite then the proportion of balls in the bins converges to the uniform measure almost surely.
Recommendations
Cites work
Cited in
(35)- Synchronization of reinforced stochastic processes with a network-based interaction
- Synchronization and functional central limit theorems for interacting reinforced random walks
- Weakly reinforced Pólya urns on countable networks
- 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
- Vertex reinforced random walks with exponential interaction on complete graphs
- 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
- Networks of reinforced stochastic processes: asymptotics for the empirical means
- Interacting generalized Friedman's urn systems
- A generalized Pólya's urn with graph based interactions: convergence at linearity
- Analysis of large urn models with local mean-field interactions
- Phase transitions in non-linear urns with interacting types
- Graph-based Pólya's urn: completion of the linear case
- Proof of the WARM whisker conjecture for neuronal connections
- A finite memory interacting Pólya contagion network and its approximating dynamical systems
- Localisation in a growth model with interaction. Arbitrary graphs
- Coexistence in preferential attachment networks
- Interacting urns on a finite directed graph
- Infinite WARM graphs III: strong reinforcement regime
- 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
- Networks of reinforced stochastic processes: probability of asymptotic polarization and related general results
- Asymptotics of generalized Pólya urns with non-linear feedback
- Networks of reinforced stochastic processes: a complete description of the first-order asymptotics
- Multi-colour competition with reinforcement
- Urns with multiple drawings and graph-based interaction
- An urn model for social dynamics on networks
- Planar reinforced k-out percolation
- Multi-colour interacting urns on complete graphs
- Pólya urns on hypergraphs
- Localisation in a growth model with interaction
- Reinforced dynamics for interacting agents in competitive or cooperative environments
This page was built for publication: A generalized Pólya's urn with graph based interactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265339)
