Log-Sobolev inequality for the multislice, with applications
From MaRDI portal
Publication:2119683
DOI10.1214/22-EJP749zbMath1486.60089arXiv1809.03546MaRDI QIDQ2119683
Yuval Filmus, Ryan O'Donnell, Xin-Yu Wu
Publication date: 30 March 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.03546
combinatoricsMarkov chainsFourier analysisrepresentation theorylog-Sobolev inequalityhypercontractivityconductancesmall-set expansion
Combinatorics in computer science (68R05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Group actions on combinatorial structures (05E18)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of the density Hales-Jewett theorem
- Time to reach stationarity in the Bernoulli-Laplace diffusion model with many urns
- Sharpness of KKL on Schreier graphs
- A generalization of the Kruskal-Katona theorem
- A note on the edges of the n-cube
- Boolean functions with low average sensitivity depend on few coordinates
- Logarithmic Sobolev inequality for some models of random walks
- Another generalization of the Kruskal-Katona theorem
- On Russo's approximate zero-one law
- On the degree of Boolean functions as real polynomials
- Yet another generalization of the Kruskal-Katona theorem
- Boolean degree 1 functions on some classical association schemes
- Random walks on trees and matchings
- An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function
- A sharp log-Sobolev inequality for the multislice
- The free Markoff field
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Logarithmic Sobolev inequalities for finite Markov chains
- An orthogonal basis for functions over a slice of the Boolean hypercube
- On “stability” in the Erdös--Ko--Rado Theorem
- Faster mixing via average conductance
- Graph expansion and the unique games conjecture
- Friedgut--Kalai--Naor theorem for slices of the Boolean cube
- Generating a random permutation with random transpositions
- Logarithmic Sobolev Inequalities
- Assignment of Numbers to Vertices
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems
- On Quantitative Noise Stability and Influences for Discrete and Continuous Models
- On the structure of subsets of the discrete cube with small edge boundary
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
- Harmonic analysis on a finite homogeneous space II: The Gelfand–Tsetlin decomposition
- Invariance Principle on the Slice
- On independent sets, 2-to-2 games, and Grassmann graphs
- Quantum entanglement, sum of squares, and the log rank conjecture
- Analysis of Boolean Functions
- Towards a proof of the 2-to-1 games conjecture?
- On non-optimally expanding sets in Grassmann graphs
- Harmonicity and invariance on slices of the Boolean cube
- KKL, Kruskal--Katona, and Monotone Nets
- Maximally Connected Arrays on the n-Cube
- Optimal Assignments of Numbers to Vertices
- Intersecting families of permutations
