Davies et al.'s variance lower-bound conjecture for the hard-core model
Statement
Let be an -vertex graph, and let denote the variance parameter of the hard-core model on at fugacity . Write for the complete graph on vertices, and let be the maximum degree of .
Davies et al.'s variance conjecture. For any ,
If has maximum degree , then the stronger bound
should hold.
This conjecture proposes the complete graph as the minimizer of the variance parameter, with a sharper comparison determined by the maximum degree. The source reports it as a conjecture posed by Davies et al.; its resolution is not specified here.
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.