Sharpness of KKL on Schreier graphs

DOI10.1214/ECP.V18-1961MaRDI QIDQ742981zbMATH OpenOpenAlexFDO

Authors 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

Cayley graphsBoolean functionsOrlicz normsSchreier graphsKKLlog-Sobolev constant

Mathematics Subject Classification ID

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

Recommendations

• Sharp Davies-Gaffney-Grigor'yan lemma on graphs
• scientific article; zbMATH DE number 1877024
• Sharpness in the \(k\)-nearest-neighbours random geometric graph model
• On the sharpness of spectral estimates for graph Laplacians
• Sharp Dirac's theorem for DP-critical graphs
• Sharp inequalities for maximal operators on finite graphs
• Sharp bounds on distance spectral radius of graphs
• Sharp upper bounds for the Laplacian spectral radius of graphs
• Sharp upper bounds of the spectral radius of a graph
• Sharp upper bounds on the spectral radius of graphs

Cited in

(6)

• Sharpness of some graph conditioned theorems on Borel 1 selectors
• Log-Sobolev inequality for the multislice, with applications
• An orthogonal basis for functions over a slice of the Boolean hypercube
• KKL, Kruskal-Katona, and monotone nets
• scientific article; zbMATH DE number 7559077 (Why is no real title available?)
• Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742981)