Weakly reinforced Pólya urns on countable networks

DOI10.1214/21-ECP404MaRDI QIDQ2064809zbMATH OpenFDO

Authors Yannick Couzinié, Christian Hirsch

Publication date 6 January 2022

Published in Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2010.03347

zbMATH Keywords

percolationnetwork formationreinforced stochastic processesPólya urn

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Sums of independent random variables; random walks (60G50)

Abstract: We study the long-time asymptotics of a network of weakly reinforced P'olya 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 $alpha<1$, and then this weight is increased by $1$. We show that for $alpha<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 $alpha=1/2$.

Recommendations

• Strongly reinforced Pólya urns with graph-based competition
• Infinite WARM graphs III: strong reinforcement regime
• A generalized Pólya's urn with graph based interactions
• Interacting urns on a finite directed graph
• A generalized Pólya's urn with graph based interactions: convergence at linearity

Cites work

• A generalized Pólya's urn with graph based interactions
• A generalized Pólya's urn with graph based interactions: convergence at linearity
• Absence of warm percolation in the very strong reinforcement regime
• An infinite stochastic model of social network formation
• Domination by product measures
• Proof of the WARM whisker conjecture for neuronal connections
• Random Geometric Graphs
• Strongly reinforced Pólya urns with graph-based competition

Cited in

(6)

• The trace-reinforced ants process does not find shortest paths
• Proof of the WARM whisker conjecture for neuronal connections
• Extremal linkage networks
• MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
• Infinite WARM graphs III: strong reinforcement regime
• Strongly reinforced Pólya urns with graph-based competition

This page was built for publication: Weakly reinforced Pólya urns on countable networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064809)