ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pc(n)p_c(n) be the critical probability for the random subgraph of the nn-cube, let V=2nV=2^n, and write

p=pc(n)−ϵn−1.p=p_c(n)-\epsilon n^{-1}.

Assume ϵ→0\epsilon\rightarrow0 and ϵeδn→∞\epsilon e^{\delta n}\rightarrow\infty for every δ>0\delta>0. Let Cmax{\mathcal C}_{\rm max} be the largest component. Subcritical largest-component asymptotics conjecture. Almost surely,

∣Cmax∣=2log⁡Vϵ2[1+o(1)].|{\mathcal C}_{\rm max}|=\frac{2\log V}{\epsilon^2}[1+o(1)].

If instead ϵ→0\epsilon\rightarrow0 and ϵ2n/3→∞\epsilon 2^{n/3}\rightarrow\infty, then almost surely

∣Cmax∣=Θ(2log⁡(ϵ3V)ϵ2).|{\mathcal C}_{\rm max}|=\Theta\left(\frac{2\log(\epsilon^3V)}{\epsilon^2}\right).

These assertions extend the known subcritical estimates toward and beyond the scaling window, whose width is of order V−1/3V^{-1/3}.

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.