2 problems

The soficity conjecture for minor-excluded unimodular random rooted graphs
Minor-excluded soficity conjecture. Every such unimodular random rooted graph $(G,\rho)$ is sofic.
openFrom papersgraph-minors sofic-groups unimodular-random-graphs
0 responses
5
Non-amenability conjecture for traces of branching random walks
Non-amenability conjecture. Let $\mu$ be the measure of the trace of a transient BRW on a URG. Then $\mu$ is non-amenable.
openFrom papersbranching-random-walks non-amenable-graphs unimodular-random-graphs
0 responses
4

The soficity conjecture for minor-excluded unimodular random rooted graphs