Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 38 min ago
PreprintarXiv licencearXiv

Homogenization of weakly reinforced Pólya urns on countable networks

Abstract

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 α∈[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.

Related

  1. Pólya’s conjecture for thin products
    Xiang He, Zuoqin Wang
    International Mathematics Research NoticesPeer-reviewedLicence not statedFull text12 citedMathematical physicsOpenAlex
  2. Pólya's Conjecture Up to ε‐loss and Quantitative Estimates for the Remainder of Weyl's Law
    Renjin Jiang, Fanghua Lin
    Communications on Pure and Applied MathematicsPeer-reviewedLicence not statedFull text12 citedMathematical physicsOpenAlex
  3. Failure of the Pólya-Szegő inequality for the fractional gradient
    Giorgio Stefani
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. The Jensen--Pólya program and inequalities for arithmetic sequences
    Koustav Banerjee, Kathrin Bringmann, Larry Rolen
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. Strict Dirichlet Pólya Inequality for Simply Connected Planar Domains
    Quanyu Tang, Zuoqin Wang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
BibTeX
@misc{qin2026homogenization,
  title = {{Homogenization of weakly reinforced Pólya urns on countable networks}},
  author = {Shuo Qin},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.11780},
  eprint = {2610.11780},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.11780},
}
RIS
TY  - UNPB
TI  - Homogenization of weakly reinforced Pólya urns on countable networks
AU  - Shuo Qin
PY  - 2026
DA  - 2026/10/08
PB  - arXiv
DO  - 10.48550/arxiv.2610.11780
UR  - https://arxiv.org/abs/2610.11780
AB  - 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 α∈[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.
ER  -