Hostname: page-component-6898cfcb55-zsp5v Total loading time: 0 Render date: 2026-11-11T06:11:09.077Z Has data issue: false hasContentIssue false

Synchronization via Interacting Reinforcement

Published online by Cambridge University Press:  19 February 2016

Paolo Dai Pra*
Affiliation:
Università degli Studi di Padova
Pierre-Yves Louis*
Affiliation:
Université de Poitiers
Ida G. Minelli*
Affiliation:
Università degli Studi dell'Aquila
*
∗ Postal address: Dipartimento di Matematica, Università degli Studi di Padova, via Trieste 63, I-35121 Padova, Italy. Email address: daipra@math.unipd.it.
∗∗ Postal address: Laboratoire de Mathématiques et Applications, UMR 7348 CNRS, Université de Poitiers, 11 Boulevard Marie et Pierre Curie, 86962 Technopole du Futuroscope, Chasseneuil Cedex, France. Email address: Email address: pierre.yves.louis@univ-poitiers.fr.
∗∗∗ Postal address: Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica, Università degli Studi dell'Aquila, Via Vetoio (Coppito 1), 67100 Coppito (AQ), Italy. Email address: ida.minelli@dm.univaq.it.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a system of urns of Pólya type, containing balls of two colors; the reinforcement of each urn depends on both the content of the urn and the average content of all urns. We show that the urns synchronize almost surely, in the sense that the fraction of balls of a given color converges almost surely as time tends to ∞ to the same limit for all urns. A normal approximation for a large number of urns is also obtained.

Information

Type
Research Article
Copyright
© Applied Probability Trust