Two badly behaved percolation processes on a nonunimodular graph (Q2636935): Difference between revisions

The author discusses the point of view in accordance of which the unimodularity distinction is of paramount importance in percolation, by considering some known properties of automorphism invariant percolation on unimodular graphs on the one hand, and using counterexamples to these properties for a special nonunimodular graph refereed to as Trofimov's graph on the other hand. In particular, he considers the number of so-called encounter points in infinite clusters, and simple random walk on an infinite cluster of automorphism invariant percolation.