SearcharxivSearch

arXiv · 1206.2183

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

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 $S$ such that the Cayley graph $(Γ,S)$, without loops and multiple edges, has non-unique percolation, i.e., $p_c(Γ,S)<p_u(Γ,S)$? We show that this is true if $Γ$ contains an infinite normal subgroup $N$ such that $Γ/ N$ is non-amenable. Moreover for any finitely generated group $G$ containing $Γ$ there exists a generating set $S'$ of $G$ such that $p_c(G,S')<p_u(G,S')$. In particular this applies to free Burnside groups $B(n,p)$ with $n \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 related subjects

Keep this discovery

BibTeXRIS

Kate Juschenko, Tatiana Nagnibeda. 2015-03-13. Small spectral radius and percolation constants on non-amenable Cayley graphs. https://arxiv.org/abs/1206.2183

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR