A nonreversible stationary-valley reduction for noisy majority
Statement
Noisy majority model
The noisy majority model with parameter is a spin system on a graph that is the stationary distribution of the following Markov chain on : assign each vertex a rate- Poisson clock. When the clock at a site rings, the spin at that vertex randomizes according to a with probability and chooses the majority of the spins of its neighbors and itself with probability (flipping a coin in the event of a tie).
Consider the noisy majority model on for . Show there exists a fixed such that (should be true for ).
Record
- Source
- Added
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.