OpenAlex ·
Homogenization of weakly reinforced Pólya urns on countable networks
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.11780
- Original
- Read it at the publisher
- Topics
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 $α\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.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Mathematical Physics
A structure-preserving neural density functional for the ions of a polymer electrolyte
Block encoding of semiseparable matrices via their generators
asdex: Automatic Sparse Differentiation in JAX
Sustainable Cloud-Fog-Edge Systems for Smart Buildings: Algorithmic Adaptation under Memory Constraints and Dynamic Orchestration Strategies
Mesh-Native Tokenisation: Retrofitting Foundation Models to Unstructured Data
Get the few papers worth your time in Mathematical Physics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.