Pairwise negative-correlation conjecture for the random-cluster model
Statement
For every finite graph , every edge-parameter vector , every , and every pair of distinct edges , the random-cluster measure satisfies . For , this measure assigns to each configuration probability proportional to , where is the number of connected components of the open subgraph; the case is understood as the limiting measure, equivalently Bernoulli bond percolation conditioned on being connected when such configurations exist.
Record
- 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.