Strongly reinforced Pólya urns with graph-based competition

R.W. Hofstad, van der, M.P. Holmes, A. Kuznetsov, W.M. Ruszel

Research output: Book/ReportReportAcademic

78 Downloads (Pure)


We introduce a class of reinforcement models where, at each time step t, one ¿rst chooses a random subset A_t of colours (independent of the past) from n colours of balls, and then chooses a colour i from this subset with probability proportional to the number of balls of colour i in the urn raised to the power a > 1. We consider stability of equilibria for such models and establish the existence of phase transitions in a number of examples, including when the colours are the edges of a graph, a context which is a toy model for the formation and reinforcement of neural connections. Keywords: reinforcement model, Pólya urn, stochastic approximation algorithm, stable equilibria
Original languageEnglish
Place of PublicationEindhoven
Number of pages32
Publication statusPublished - 2014

Publication series

NameReport Eurandom
ISSN (Print)1389-2355

Fingerprint Dive into the research topics of 'Strongly reinforced Pólya urns with graph-based competition'. Together they form a unique fingerprint.

Cite this