Yadin's SIT–EIT equivalence conjecture for Cayley graphs
Statement
Let 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 such that
A graph is SIT, respectively EIT, if it admits such a measure. Yadin's SIT–EIT equivalence conjecture. is SIT if and only if 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.