Conditions guaranteeing a linear-size supercritical component

Determine natural conditions on a finite graph G that guarantee that, whenever p cgeq (1+cepsilon)/clambda(G), the percolated graph G_p contains a component of order cOmega(|G|) with constant probability.

Background

The paper establishes that 1/clambda(G) is the critical probability for producing a component of order cOmega(clambda(G)) in an arbitrary finite graph, but this component need not contain a positive proportion of all vertices. The authors explain that the spectral radius may be localized in a small part of the graph: an induced subgraph on (1-o(1))|G| vertices can have substantially smaller spectral radius, causing that large portion of the graph to remain subcritical at p=(1+cepsilon)/clambda(G).

The unresolved problem is to identify natural structural or spectral hypotheses that overcome this localization issue and force a component of linear order in the supercritical percolated graph. The authors specifically caution that ordinary robust-connectivity assumptions may not suffice because they may fail to detect localization of the spectral radius.

References

A natural question one can still ask is under what additional assumptions on the graph $G$ we get a component of size $\Omega({G})$ in $G_p$. This question was addressed in the work of Chung, Horn and Lu, yet the conditions they put on the graph $G$ are rather restrictive.

The critical probability for percolation on finite graphs  (2608.19145 - Christoph et al., 19 Aug 2026) in Question 1, Section 6, Concluding remarks (question:omega n supercritical)