One-survivor conjecture for multitype urns on cycles
Statement
Let be the cycle graph of length , and consider the -type urn model on , with balls of colours and each urn monochromatic. At each step, a uniformly chosen ball adds a ball of its colour to each neighbouring urn, with one-to-one annihilation against balls of another colour when necessary. A colour survives if it is present at arbitrarily large times. Cycle urn conjecture. For every and every finite initial configuration, the -type urn model on almost surely has only one surviving colour. The corresponding two-type urn result is proved, but this multitype extension is not known; it would imply the related multitype growth result in the relevant setting.
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.