ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a Cayley graph of a finitely generated group. A probability measure on the set of infinite self-avoiding paths from a fixed vertex is SIT if its two independent samples have a summable intersection tail, and it is EIT if there exists varepsilon>0varepsilon>0 such that

E⁡μ⊗μevarepsilon∣α∩β∣E<∞.\operatorname{\mathbb{E}}_{\mu\otimes\mu} e^{varepsilon |\alpha\cap\beta|_E}<\infty.

A graph is SIT, respectively EIT, if it admits such a measure. Yadin's SIT–EIT equivalence conjecture. GG is SIT if and only if GG is EIT. The conjecture compares two path-measure conditions related to transience and percolation on Cayley graphs; the supplied source does not state whether it has been resolved.

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.