Influences of variables and threshold intervals under group symmetries

DOI10.1007/s000390050015zbMath0982.20004OpenAlexW2094776848MaRDI QIDQ1365201

Gil Kalai, Jean Bourgain

Publication date: 13 January 2002

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000390050015

zbMATH Keywords

phase transitionspermutation groupsrandom graphssubgroupsproduct measurestransitive groupsmonotone \(G\)-invariant propertiesthreshold intervals

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Subgroups of symmetric groups (20B35) Multiply transitive finite groups (20B20)

Related Items

Boolean functions: influence, threshold and noise, Sharp thresholds of graph properties, and the $k$-sat problem, Around two theorems and a lemma by Lucio Russo, Threshold for monotone symmetric properties through a logarithmic Sobolev inequality, Upper bounds on Fourier entropy, Upper Bounds on Fourier Entropy, Hypercontractivity for global functions and sharp thresholds, KKL's influence on me, Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome?, A structure theorem for Boolean functions with small total influences, Towards a proof of the Fourier-entropy conjecture?, Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality, Noise sensitivity of Boolean functions and applications to percolation, Noise stability of functions with low influences: invariance and optimality, Nonembeddability theorems via Fourier analysis, Asymptotic behavior of finite permutation groups acting on subsets., Monotone properties of random geometric graphs have sharp thresholds, A note on the entropy/influence conjecture, Proof of a hypercontractive estimate via entropy, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Primitive permutation groups satisfying the small orbit property and a problem of Bourgain and Kalai, Reed-Muller Codes