A log-Sobolev inequality for the multislice, with applications
Abstract
Let ∈ N+ satisfy 1 + … + = n and let U denote the "multislice" of all strings u in []n having exactly i coordinates equal to i, for all i ∈ []. Consider the Markov chain on U, where a step is a random transposition of two coordinates of u. We show that the log-Sobolev constant for the chain satisfies ()-1 ≤ n Σi=1 12 2(4n/i), which is sharp up to constants whenever is constant. From this, we derive some consequences for small-set expansion and isoperimetry in the multislice, including a KKL Theorem, a Kruskal--Katona Theorem for the multislice, a Friedgut Junta Theorem, and a Nisan--Szegedy Theorem.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.