Small spectral radius and percolation constants on non-amenable Cayley graphs

preprint2015arXivOpen access

Abstract

Motivated by the Benjamini-Schramm non-unicity of percolation conjecture we study the following question. For a given finitely generated non-amenable group ΓΓ, does there exist a generating set SS such that the Cayley graph (Γ,S)(Γ,S), without loops and multiple edges, has non-unique percolation, i.e., pc(Γ,S)<pu(Γ,S)p_c(Γ,S)<p_u(Γ,S)? We show that this is true if ΓΓ contains an infinite normal subgroup NN such that Γ/NΓ/ N is non-amenable. Moreover for any finitely generated group GG containing ΓΓ there exists a generating set S′S' of GG such that pc(G,S′)<pu(G,S′)p_c(G,S')<p_u(G,S'). In particular this applies to free Burnside groups B(n,p)B(n,p) with n≥2,p≥665n \geq 2, p \geq 665. We also explore how various non-amenability numerics, such as the isoperimetric constant and the spectral radius, behave on various growing generating sets in the group.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.