Hutchcroft's weighted-amenability threshold conjecture
Statement
Let be a graph, let be a closed subgroup of acting transitively on , and let be the induced relative weight function. Let be the heavy-cluster threshold and let be the uniqueness threshold. Hutchcroft's conjecture. The graph is -amenable if and only if
This is presented as a generalization of the Benjamini–Schramm conjecture relating amenability to equality of percolation thresholds. Its status is not resolved in the supplied text.
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.