~/conference

Functional Inequalities in Discrete Spaces with Applications 2013

The goal of this program is to bring together mathematicians and computer scientists to study influences, measures of complexity of discrete functions, functional inequalities, invariance principles, non-classical norms, representation theory and other modern topics in mathematical analysis and their applications to theoretical computer science.

theoretical computer scientists, probability theorists, analysis researchers, combinatorics researchers, machine learning researchers, graph algorithm designers, statistical learning theorists

total influence of Boolean functions; Rademacher sums and high frequencies; maximal averages on hypercube; Grothendieck inequality constructions; Johnson-Lindenstrauss for SVMs; concentration for non-Lipschitz functions; strong Rayleigh and determinantal measures; suprema of Bernoulli processes; spectral gap of constrained spin models; discrete Ricci curvature on graphs; displacement convexity of entropy; small-set expansion and Cheeger generalizations

titleauthorlength
A Structure Theorem for Boolean Functions with Small Total InfluencesHamed Hatami47m
A structural theorem says Boolean functions on a product probability space with constant total influence are L2-close to a K-pseudo-junta defined by a family…
Talk on
On Mimicking Rademacher SumsKrzysztof Oleszkiewicz01h 00m
For the discrete cube with fixed cutoff K the L1 distance from the Rademacher sum to the subspace of only high frequencies is Θ(K): an explicit function is…
Talk
Maximal Inequalities on the HypercubeAlexandra Kolla50m
Proves a dimension-independent L2 bound for the maximal average over Hamming spheres on {0,1}^n, so the number of vertices ruined by an adversary that colours…
Talk
Variants of Parseval's Formula and the Grothendieck InequalityRon Blei54m
Constructs a Riesz products-based, explicit continuous injection from the l2 unit ball into L∞(Ω) that registers dot products by an integral, giving a…
Talk
Concentration Inequalites in Learning with KernelsDevdatt Dubhashi44m
Shows that Johnson–Lindenstrauss preserves margins up to (1+ε) while projecting to k = O(ε^-2 log n) dimensions, so SVM decision boundary and pairwise…
Talk on
Concentration Inequalities for Non-Lipschitz FunctionsPaweł Wolff01h 02m
Shows that if a vector satisfies a Sobolev-type inequality (e.g. log-Sobolev/Gaussian) then moments and tails of C^d functions are controlled by concrete norms…
Talk
Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh MeasuresYuval Peres56m
Proves that homogeneous measures with the stochastic covering property (including strong Rayleigh/determinantal and balanced matroid laws such as uniform…
Talk
On the Suprema of Bernoulli ProcessesRafal Latala53m
Proves the Bernoulli Conjecture: the expected supremum of a Bernoulli process is equivalent (up to universal constants) to the infimum over decompositions of T…
Talk
Spectral Gap of a Kinetically Constrained Spin Model on Trees: Power Law Scaling at CriticalityCyrille Roberto58m
Kinetically constrained 0–1 spins on a k‑ary tree use product Bernoulli(p) equilibrium and flip a site only when all children are empty; the bootstrap critical…
Talk
Discrete Ricci Curvature via Convexity of the EntropyJan Maas56m
Shows W2 fails on discrete graphs (two‑point case gives no W2 geodesics), so builds a new Riemannian‑type transport metric using a logarithmic mean to pair…
Talk
Displacement Convexity of Entropy on GraphsPrasad Tetali01h 05m
Defines Mt(A,B) as the set of graph midpoints and builds an explicit interpolation μ_t^π by choosing a random geodesic + binomial sampling with number of…
Talk
On Graph Spectra and Small Set ExpansionPrasad Raghavendra59m
Gives concrete algorithms and constructions: shows you can distinguish small‑set expansion up to a barrier of sqrt(ε log(1/δ)) and proves a higher‑order…
Talk
Two Generalizations of Cheeger's InequalityLuca Trevisan01h 00m
Claims that Cheeger’s inequality extends to higher eigenvalues: lambda_k small ⇔ k disjoint low‑conductance sets, with a quantitative relation between the…
Talk
On Hyperboundedness and Spectrum of Markov OperatorsLaurent Miclo53m
For reversible Markov kernels on a probability space, existence of hyperboundedness (Pt or M mapping L2 into Lp for some p>2) forces a positive spectral gap…
Talk
A Removal Lemma for Kneser Graphs and Product GraphsEhud Friedgut58m
Proves a removal lemma for sparse product-type graphs (notably the Kneser graph layer and the triangle-power product graph): any vertex subset that spans at…
Talk
Approximations of Submodular, XOS and Self-Bounding Functions by JuntasJan Vondrák54m
Proves a real-valued Friedgut theorem and shows which influence norms control L2 approximation, using hypercontractive inequalities and a boosting lemma…
Talk
Noise Stability and Central Limit Theorem for Random Effective ResistanceRaphaël Rossignol56m
Model assumes IID resistances in [1,Λ] on Z^d and identifies effective conductance ~n^{d-2} (so resistance ~n^{2-d}). Variance has expected lower bound…
Talk
Strong Noise Sensitivity and Random GraphsJeffrey Steif55m
Defines strong noise sensitivity via conditioning on a particular one witness and connects it to witness geometry and influences; uses second moment and…
Talk
Majority is Stablest for Dependent VariablesJoe Neeman55m
Extends Majority is Stablest to dependent X,Y by proving for rho-correlated joint laws that E[J(f(X),g(Y))] ≤ J(Ef,Eg) plus an explicit error controlled by the…
Talk
A Two-Sided Estimate for the Gaussian Noise Stability DeficitRonen Eldan56m
Proves a quantitative two‑sided bound that controls the Gaussian noise‑stability deficit by a centroid metric (norm difference between Gaussian centers) up to…
Talk
Reversing HypercontractivityElchanan Mossel52m
Shows a uniform reverse hypercontractivity inequality: for any product space and any nonnegative f, T_t raises q‑seminorms above p‑seminorms with no factor…
Talk
Influences in Gaussian SpaceArnab Sen49m
Defines a new geometric influence by integrating one-dimensional boundary (lower Minkowski) measures of coordinate fibers, shows it equals an L∞ surface…
Talk on
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.