ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a monotone property of graphs on nn vertices, let upn u_p^n denote the product measure on graphs in which each edge is present with probability pp, and let uqn u_q^n be defined similarly. For epsilon>0epsilon>0, assume

q=p+clog⁡(1/2ϵ)log⁡2n.q=p+c\frac{\log(1/2\epsilon)}{\log^2 n}.

Friedgut–Kalai conjecture. There is an absolute constant cc such that, if upn(P)>ϵ u_p^n(P)>\epsilon, then

νqn(P)>1−ϵ.\nu_q^n(P)>1-\epsilon.

This is a proposed improvement of the Friedgut–Kalai sharp-threshold bound, replacing the denominator log⁡n\log n by log⁡2n\log^2 n for arbitrary monotone graph properties. The supplied source does not state whether the question has been resolved.

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 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.