Abstract
We study the long-time asymptotics of a network of weakly reinforced Pólya urns. In this system, which extends the WARM introduced by R. van der Hofstad et. al. (2016) to countable networks, the nodes fire at times given by a Poisson point process. When a node fires, one of the incident edges is selected with a probability proportional to its weight raised to a power α<1, and then this weight is increased by 1. We show that for α<1∕2 on a network of bounded degrees, every edge is reinforced a positive proportion of time, and that the limiting proportion can be interpreted as an equilibrium in a countable network. Moreover, in the special case of regular graphs, this homogenization remains valid beyond the threshold α=1∕2.
Highlights
Pólya’s urn process is the paradigm model for a random process incorporating reinforcement effects
We show that for α < 1/2 on a network of bounded degrees, every edge is reinforced a positive proportion of time, and that the limiting proportion can be interpreted as an equilibrium in a countable network
In the field of social sciences, the formation of friendship networks could be related to reinforcement effects in social interactions [7]
Summary
Pólya’s urn process is the paradigm model for a random process incorporating reinforcement effects. Together with the analysis in [5, 6], our main result is a first step towards a network-based analog of Rubin’s dichotomy for classical Pólya urns: while for strong reinforcement some edges are only reinforced finitely often, in the weakly reinforced regime all edges are reinforced a positive proportion of time. This description outlines the broader picture, more research is needed to carve out the precise conditions for this dichotomy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.