Edge-Isoperimetric Inequalities and Influences

DOI10.1017/S0963548306008340zbMath1134.05309arXivmath/0512636OpenAlexW1871596124MaRDI QIDQ5443800

Alex Samorodnitsky, Dvir Falik

Publication date: 22 February 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0512636

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (14)

Effective resistance of random trees ⋮ Sublinear variance in Euclidean first-passage percolation ⋮ A stability result for the cube edge isoperimetric inequality ⋮ Talagrand's influence inequality revisited ⋮ Locality of random digraphs on expanders ⋮ An Inequality for Functions on the Hamming Cube ⋮ Sharp threshold for percolation on expanders ⋮ Submean variance bound for effective resistance of random electric networks ⋮ Almost Isoperimetric Subsets of the Discrete Cube ⋮ On the structure of subsets of the discrete cube with small edge boundary ⋮ A general method to determine limiting optimal shapes for edge-isoperimetric inequalities ⋮ Exponential concentration for first passage percolation through modified Poincaré inequalities ⋮ Sublinear variance in first-passage percolation for general distributions ⋮ Fluctuations in first-passage percolation

Cites Work

• Threshold for monotone symmetric properties through a logarithmic Sobolev inequality
• Inequalities in Fourier analysis
• A note on the edges of the n-cube
• Boolean functions with low average sensitivity depend on few coordinates
• On boundaries and influences
• Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
• Logarithmic Sobolev inequalities for finite Markov chains
• Logarithmic Sobolev Inequalities
• Every monotone graph property has a sharp threshold
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Edge-Isoperimetric Inequalities and Influences