A log-sobolev inequality for the multislice, with applications

Yuval Filmus, Ryan O’Donnell, Xinyu Wu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Let κ ϵ N+ satisfy κ1+···+κ = n, and let Uκ denote the multislice of all strings u ∈ [ℓ]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 (Formula presented), 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.

Original languageEnglish
Title of host publication10th Innovations in Theoretical Computer Science, ITCS 2019
EditorsAvrim Blum
ISBN (Electronic)9783959770958
DOIs
StatePublished - 1 Jan 2019
Event10th Innovations in Theoretical Computer Science, ITCS 2019 - San Diego, United States
Duration: 10 Jan 201912 Jan 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume124
ISSN (Print)1868-8969

Conference

Conference10th Innovations in Theoretical Computer Science, ITCS 2019
Country/TerritoryUnited States
CitySan Diego
Period10/01/1912/01/19

Keywords

  • Combinatorics
  • Conductance
  • Fourier analysis
  • Hypercontractivity
  • Log-Sobolev inequality
  • Markov chains
  • Representation theory
  • Small-set expansion

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'A log-sobolev inequality for the multislice, with applications'. Together they form a unique fingerprint.

Cite this