Sharpness of KKL on Schreier graphs

DOI10.1214/ECP.v18-1961zbMath1455.05027OpenAlexW2125748608MaRDI QIDQ742981

Ryan O'Donnell, Karl Wimmer

Publication date: 22 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/ecp.v18-1961

zbMATH Keywords

Boolean functionsCayley graphsOrlicz normsSchreier graphsKKLlog-Sobolev constant

Mathematics Subject Classification ID

Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Log-Sobolev inequality for the multislice, with applications ⋮ An orthogonal basis for functions over a slice of the Boolean hypercube ⋮ Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions ⋮ Unnamed Item

This page was built for publication: Sharpness of KKL on Schreier graphs