Weakly reinforced Pólya urns on countable networks

DOI10.1214/21-ECP404zbMath1490.60266arXiv2010.03347MaRDI QIDQ2064809

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 formationPólya urnreinforced stochastic processes

Mathematics Subject Classification ID

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

Related Items (4)

Extremal linkage networks ⋮ Infinite WARM graphs III: strong reinforcement regime ⋮ MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023 ⋮ The trace-reinforced ants process does not find shortest paths

Cites Work

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

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