Tight lower-bound conjecture for segregation in the Offended Voter Model
Statement
Let be constant, let , and let . Let denote the segregation event, and let be the function appearing in the model's segregation lower bound. Tight-bound conjecture.
The claim says that the lower bound established earlier is asymptotically exact. The paper motivates it by simulations showing close agreement for , but does not prove the required control of the coupled edge-deletion and opinion processes.
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.