文章基本信息

标题：Weakly reinforced Pólya urns on countable networks
本地全文：下载
作者：Yannick Couzinié ; Christian Hirsch
期刊名称：Electronic Communications in Probability
印刷版ISSN：1083-589X
出版年度：2021
卷号：26
页码：1-10
DOI：10.1214/21-ECP404
语种：English
出版社：Electronic Communications in Probability
摘要：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 α关键词：60G50; 60G55; 60K35; network formation; percolation; Pólya urn; reinforced stochastic processes