Metraipolis › archive › dc_f219084e6742
Homogenization of weakly reinforced Pólya urns on countable networks — arXiv:2610.11780
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11780
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:28:23.827Z
- SHA-256 of the archived text
0be71e376f78fe0c118a30421c502b52331b0fca2df813f7c7fe08cb5f8918f3- Stable URL of this page
https://metraipolis.com/documento/dc_f219084e6742
How to cite
Homogenization of weakly reinforced Pólya urns on countable networks — arXiv:2610.11780 — arXiv (en), https://arxiv.org/abs/2610.11780 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f219084e6742 (Metraipolis archive dc_f219084e6742, sha256 0be71e376f78fe0c118a30421c502b52331b0fca2df813f7c7fe08cb5f8918f3)
BibTeX
@misc{dcf219084e6742,
title = {Homogenization of weakly reinforced Pólya urns on countable networks — arXiv:2610.11780},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11780},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f219084e6742; sha256 0be71e376f78fe0c118a30421c502b52331b0fca2df813f7c7fe08cb5f8918f3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11780. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider weakly reinforced Pólya urns on a countable graph of uniformly bounded degree. The vertices have positive bounded firing rates, which need not be bounded away from zero. For every reinforcement exponent $\alpha\in[0,1)$ and every deterministic choice of finite positive initial weights, the normalized edge weights converge almost surely, coordinate-wise, to a deterministic vector independent of the initial weights. We identify this vector as the unique non-vanishing equilibrium of the limiting equation. This proves the homogenization conjecture of Couzinié and Hirsch, including its formulation for non-uniform firing rates in the MATRIX open-problems report. The main step is a Liouville theorem for the limiting equation, established by a logarithmic-norm comparison of complete solutions using the row-sum balance at each vertex. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno). Categorie arXiv: Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2610.11780 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:53:01.689Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).