Homogenization conjecture for weakly reinforced Pólya urns on countable graphs
Statement
Let be a countable graph with uniformly bounded degrees. Let be the system of edge weights initialized at and evolving according to the continuous-time weakly reinforced Pólya urn dynamics with parameter , and set
An equilibrium is a non-negative vector satisfying
for every edge with . Homogenization conjecture. The equilibrium measure exists, is unique, and almost surely. This conjecture asserts that the normalized edge weights of weakly reinforced Pólya urns on every countable uniformly bounded-degree graph converge almost surely to a unique deterministic equilibrium; the supplied source does not indicate whether it has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.