Non-amenability conjecture for traces of branching random walks

Let a transient branching random walk (BRW) be given on a unimodular random graph (URG), and let μ\mu be the probability measure governing its trace, viewed as a random rooted graph. A measure on rooted graphs is non-amenable in the unimodular sense when it has positive expansion.

Non-amenability conjecture. Let μ\mu be the measure of the trace of a transient BRW on a URG. Then μ\mu is non-amenable.

This is known for the trace of a transient BRW on a unimodular random tree with infinitely many ends. The conjecture would imply further percolation consequences under a first-moment condition, but remains open in general.

Sources & referencesView supporting material

Primary source

Itai Benjamini and Sebastian Müller, “On the trace of branching random walks”, arXiv:1002.2781 (2010).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.