Separation profile, isoperimetry, growth and compression
Separation profile, isoperimetry, growth and compression
We give lower and upper bounds for the separation profile (introduced by Benjamini, Schramm & Timár) for various graphs using isoperimetric profile, volume growth and Hilbertian compression. For graphs which have polynomial isoperimetry and growth, we show that the separation profile is bounded between n a and n b for …