ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every finite graph G=(V,E)G=(V,E), every edge-parameter vector (pe)e∈E∈[0,1]E(p_e)_{e\in E}\in[0,1]^E, every q∈[0,1]q\in[0,1], and every pair of distinct edges e,f∈Ee,f\in E, the random-cluster measure ϕG,p,q\phi_{G,\mathbf p,q} satisfies ϕG,p,q(e is open,f is open)≤ϕG,p,q(e is open) ϕG,p,q(f is open)\phi_{G,\mathbf p,q}(e\text{ is open},f\text{ is open})\leq \phi_{G,\mathbf p,q}(e\text{ is open})\,\phi_{G,\mathbf p,q}(f\text{ is open}). For q>0q>0, this measure assigns to each configuration ω∈{0,1}E\omega\in\{0,1\}^E probability proportional to qk(ω)∏e∈Epeω(e)(1−pe)1−ω(e)q^{k(\omega)}\prod_{e\in E}p_e^{\omega(e)}(1-p_e)^{1-\omega(e)}, where k(ω)k(\omega) is the number of connected components of the open subgraph; the case q=0q=0 is understood as the limiting measure, equivalently Bernoulli bond percolation conditioned on being connected when such configurations exist.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.