Finite truncated susceptibility conjecture for supercritical percolation

Let G=(V,E)G=(V,E) be an infinite, connected, locally finite, transitive graph, and let KvK_v be the cluster of a vertex vv. The truncated susceptibility is

Ep[Kv\mathbbm1(Kv<)].\mathbf E_p\left[|K_v|\mathbbm{1}(|K_v|<\infty)\right].

Truncated susceptibility conjecture. This quantity is finite for every pc<p1p_c<p\leq1.

The source describes this as a much weaker question than the preceding cluster-size-tail conjecture and states that it remains open.

Sources & referencesView supporting material

Primary source

Jonathan Hermon and Tom Hutchcroft, “Supercritical percolation on nonamenable graphs: Isoperimetry, analyticity, and exponential decay of the cluster size distribution”, arXiv:1904.10448 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.