Wired random-cluster boundary condition (source code)

= Wired random-cluster boundary condition
{title2=$\xi=\{\partial\Lambda\}$}

= Fully wired random-cluster boundary condition
{synonym}

All boundary <graph vertices>[vertices] are identified into one <graph vertex>[vertex] for component counting. This is the most wired <random-cluster boundary condition> on a fixed boundary, and maximizes increasing-event <probabilities> when $q\geq1$ by <boundary monotonicity of the random-cluster measure>.