← All problems

Strict monotonicity of percolation thresholds under weak coverings

Let G\mathcal{G} and H\mathcal{H} be connected locally finite graphs, and let π:G→H\pi:\mathcal{G}\to\mathcal{H} be a weak covering map. Determine hypotheses on π\pi, the fibres, and the graphs that guarantee strict monotonicity of the percolation thresholds, in particular inequalities of the form pc(G)<pc(H)p_c(\mathcal{G})<p_c(\mathcal{H}) whenever pc(G)<1p_c(\mathcal{G})<1, and strict comparison of the uniqueness thresholds pu(G)p_u(\mathcal{G}) and pu(H)p_u(\mathcal{H}). The corresponding question is also open for weighted inhomogeneous Bernoulli percolation, where an edge ee with weight w(e)>0w(e)>0 is open at intensity λ\lambda with probability 1−exp⁡(−λw(e))1-\exp(-\lambda w(e)), and one seeks strict inequalities between the associated critical and connection thresholds under weak covering maps.

References

Progress summary

Refreshed
Open · progress reported

A new paper reports stricter threshold comparisons for several weighted covering constructions, but the broad weak-covering conjectures remain open.

The problem asks when a weak covering forces a strict inequality between percolation thresholds, including critical and uniqueness thresholds. The established theory covers important cases with geometric hypotheses, but not arbitrary weak coverings or the full conjectural picture.

Known results

  • Martineau and Severo (2018): for bounded-degree graphs with a weak covering having tame fibres and disjoint tree-lifting, pc(G)<pc(H)p_c(\mathcal{G})<p_c(\mathcal{H}) when pc(G)<1p_c(\mathcal{G})<1.
  • Martineau and Severo (2018): under bounded-fibre assumptions, pu(G)≤pu(H)p_u(\mathcal{G})\le p_u(\mathcal{H}), with strictness under additional non-injectivity and tree-lifting hypotheses.
  • The same work shows that the boundedness and finiteness assumptions cannot generally be discarded.

October 2026 weighted-covering result

Jing Liu, Kainan Xiang, and Lang Zou report strict monotonicity for weighted inhomogeneous percolation and connection thresholds in several covering-compatible settings, including a general-profile theorem. This is claimed progress, not a resolution: the stated geometric and regularity assumptions leave the broader conjectures open.

Current status (as of October 2026): strictness is proved in several restricted weak-covering settings and newly claimed for weighted variants, while the general problem remains open.

Sources

Solutions 0

No solutions have been posted yet.