A graph class $\mathcal{C}$ has polynomial expansion if there is a polynomial function $f$ such that for every graph $G\in \mathcal{C}$, each of the depth-$r$ minors of $G$ has average degree at most $f(r)$. In this note, we study bounded-radius variants of some classical graph parameters such as bramble number, linkedness and well-linkedness, and we show that they are pairwise polynomially related. Furthermore, in a monotone graph class with polynomial expansion they are all uniformly bounded by a polynomial in $r$.12 pages, final version