To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Two Badly Behaved Percola… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Two Badly Behaved Percolation Processes on a Nonunimodular Graph

Journal article
Authors Olle Häggström
Published in Journal of Theoretical Probability
Volume 26
Issue 4
Pages 1165-1180
ISSN 0894-9840
Publication year 2013
Published at Department of Mathematical Sciences, Mathematical Statistics
Pages 1165-1180
Language en
Keywords Percolation, Random walk, Encounter points, Unimodularity, Mass, transport, invariant percolation, infinite clusters, spanning forests, uniqueness, trees
Subject categories Mathematics


We provide nonunimodular counterexamples to two properties that are well known for automorphism invariant percolation on unimodular transitive graphs. The first property is that the number of encounter points in an infinite cluster is almost surely 0 or a. The second property is that speed of random walk on an infinite cluster is almost surely well defined.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?