We study the behavior of the co-spectral radius of a subgroup H of a discrete group $\Gamma $ under taking intersections. Our main result is that the co-spectral radius of an invariant random subgroup does not drop upon intersecting with a deterministic co-amenable subgroup. As an application, we find that the intersection of independent co-amenable invariant random subgroups is co-amenable.

Let $G$ be a group acting properly by isometries and with a strongly contracting element on a geodesic metric space. Let $N$ be an infinite normal subgroup of $G$ and let $\unicode[STIX]{x1D6FF}_{N}$ and $\unicode[STIX]{x1D6FF}_{G}$ be the growth rates of $N$ and $G$ with respect to the pseudo-metric induced by the action. We prove that if $G$ has purely exponential growth with respect to the pseudo-metric, then $\unicode[STIX]{x1D6FF}_{N}/\unicode[STIX]{x1D6FF}_{G}>1/2$. Our result applies to suitable actions of hyperbolic groups, right-angled Artin groups and other CAT(0) groups, mapping class groups, snowflake groups, small cancellation groups, etc. This extends Grigorchuk’s original result on free groups with respect to a word metric and a recent result of Matsuzaki, Yabuki and Jaerisch on groups acting on hyperbolic spaces to a much wider class of groups acting on spaces that are not necessarily hyperbolic.

Let $X$ be a locally finite, connected graph without vertices of degree 1. Non-backtracking random walk moves at each step with equal probability to one of the “forward” neighbours of the actual state, i.e., it does not go back along the preceding edge to the preceding state. This is not a Markov chain, but can be turned into a Markov chain whose state space is the set of oriented edges of $X$. Thus we obtain for infinite $X$ that the $n$-step non-backtracking transition probabilities tend to zero, and we can also compute their limit when $X$ is finite. This provides a short proof of an old result concerning cogrowth of groups, and makes the extension of that result to arbitrary regular graphs rigorous. Even when $X$ is non-regular, but small cycles are dense in$X$, we show that the graph $X$ is non-amenable if and only if the non-backtracking $n$-step transition probabilities decay exponentially fast. This is a partial generalization of the cogrowth criterion for regular graphs which comprises the original cogrowth criterion for finitely generated groups of Grigorchuk and Cohen.