Sharpness of KKL on Schreier graphs

DOI10.1214/ECP.V18-1961zbMATH Open1455.05027OpenAlexW2125748608MaRDI QIDQ742981FDOQ742981

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)

Cited In (5)

• Log-Sobolev inequality for the multislice, with applications
• An orthogonal basis for functions over a slice of the Boolean hypercube
• Title not available (Why is that?)
• Sharpness of some graph conditioned theorems on Borel 1 selectors
• Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions

Recommendations

• Title not available (Why is that?) 👍 👎
• Sharp bounds on distance spectral radius of graphs 👍 👎
• Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model 👍 👎
• Sharp upper bounds for the Laplacian spectral radius of graphs 👍 👎
• Sharp upper bounds on the spectral radius of graphs 👍 👎
• Sharp Dirac's theorem for DP‐critical graphs 👍 👎
• On the sharpness of spectral estimates for graph Laplacians 👍 👎
• Sharp inequalities for maximal operators on finite graphs 👍 👎
• Sharp upper bounds of the spectral radius of a graph 👍 👎
• Sharp Davies-Gaffney-Grigor'yan lemma on graphs 👍 👎

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)