Subcritical largest-component asymptotics near the hypercube scaling window
Statement
Let be the critical probability for the random subgraph of the -cube, let , and write
Assume and for every . Let be the largest component. Subcritical largest-component asymptotics conjecture. Almost surely,
If instead and , then almost surely
These assertions extend the known subcritical estimates toward and beyond the scaling window, whose width is of order .
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.