4.4 Article

On Reverse Hypercontractivity

Journal

GEOMETRIC AND FUNCTIONAL ANALYSIS
Volume 23, Issue 3, Pages 1062-1097

Publisher

SPRINGER BASEL AG
DOI: 10.1007/s00039-013-0229-4

Keywords

-

Categories

Funding

  1. NSF [DMS 0548249, DMS 1106999]
  2. DOD ONR [N000141110140]
  3. ISF [1300/08]
  4. Minerva Grant
  5. Polish MNiSzW [N N201 397437]
  6. EPSRC [EP/G055068/1]
  7. EPSRC [EP/G055068/1] Funding Source: UKRI
  8. Engineering and Physical Sciences Research Council [EP/G055068/1] Funding Source: researchfish
  9. Direct For Mathematical & Physical Scien [1106999] Funding Source: National Science Foundation
  10. Division Of Mathematical Sciences [1106999] Funding Source: National Science Foundation

Ask authors/readers for more resources

We study the notion of reverse hypercontractivity. We show that reverse hypercontractive inequalities are implied by standard hypercontractive inequalities as well as by the modified log-Sobolev inequality. Our proof is based on a new comparison lemma for Dirichlet forms and an extension of the Stroock-Varopoulos inequality. A consequence of our analysis is that all simple operators as well as their tensors satisfy uniform reverse hypercontractive inequalities. That is, for all q < p < 1 and every positive valued function f for we have . This should be contrasted with the case of hypercontractive inequalities for simple operators where t is known to depend not only on p and q but also on the underlying space. The new reverse hypercontractive inequalities established here imply new mixing and isoperimetric results for short random walks in product spaces, for certain card-shufflings, for Glauber dynamics in high-temperatures spin systems as well as for queueing processes. The inequalities further imply a quantitative Arrow impossibility theorem for general product distributions and inverse polynomial bounds in the number of players for the non-interactive correlation distillation problem with m-sided dice.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Statistics & Probability

ROBUST DIMENSION FREE ISOPERIMETRY IN GAUSSIAN SPACE

Elchanan Mussel, Joe Neeman

ANNALS OF PROBABILITY (2015)

Article Mathematics, Applied

Robust optimality of Gaussian noise stability

Elchanan Mossel, Joe Neeman

JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY (2015)

Article Ecology

Can one hear the shape of a population history?

Junhyong Kim, Elchanan Mossel, Miklos Z. Racz, Nathan Ross

THEORETICAL POPULATION BIOLOGY (2015)

Article Mathematics

A QUANTITATIVE GIBBARD-SATTERTHWAITE THEOREM WITHOUT NEUTRALITY

Elchanan Mossel, Miklos Z. Racz

COMBINATORICA (2015)

Article Statistics & Probability

Mixing under monotone censoring

Jian Ding, Elchanan Mossel

ELECTRONIC COMMUNICATIONS IN PROBABILITY (2014)

Article Computer Science, Information Systems

On Extracting Common Random Bits From Correlated Sources on Large Alphabets

Siu On Chan, Elchanan Mossel, Joe Neeman

IEEE TRANSACTIONS ON INFORMATION THEORY (2014)

Letter Biology

Majority rule has transition ratio 4 on Yule trees under a 2-state symmetric model

Elchanan Mossel, Mike Steel

JOURNAL OF THEORETICAL BIOLOGY (2014)

Article Statistics & Probability

Asymptotic learning on Bayesian social networks

Elchanan Mossel, Allan Sly, Omer Tamuz

PROBABILITY THEORY AND RELATED FIELDS (2014)

Article Statistics & Probability

Reconstruction and estimation in the planted partition model

Elchanan Mossel, Joe Neeman, Allan Sly

PROBABILITY THEORY AND RELATED FIELDS (2015)

Article Physics, Multidisciplinary

On the Impossibility of Learning the Missing Mass

Elchanan Mossel, Mesrob I. Ohannessian

ENTROPY (2019)

Article Statistics & Probability

Harmonicity and invariance on slices of the Boolean cube

Yuval Filmus, Elchanan Mossel

PROBABILITY THEORY AND RELATED FIELDS (2019)

Article Management

Seeding with Costly Network Information

Dean Eckles, Hossein Esfandiari, Elchanan Mossel, M. Amin Rahimian

Summary: In this study, the task of selecting k nodes in a social network to maximize the expected spread size of a diffusion is examined. The authors propose algorithms and guarantees to approximate the optimal seed set while limiting the amount of collected network information. They investigate the achievable guarantees using a sublinear influence sample size and develop a probing algorithm to find the seed set with the same approximation guarantee.

OPERATIONS RESEARCH (2022)

Article Computer Science, Information Systems

Broadcasting on Two-Dimensional Regular Grids

Anuran Makur, Elchanan Mossel, Yury Polyanskiy

Summary: This paper studies the problem of broadcasting on two-dimensional regular grids, which is a specialization of the general broadcasting problem on directed acyclic graphs. The authors make progress towards establishing the conjecture that it is impossible to propagate information in a 2D regular grid regardless of the noise level and the choice of processing function. They prove that recovery of the source vertex X is impossible for any noise level between 0 and 1/2 when all vertices with indegree 2 use either AND or XOR for their processing functions.

IEEE TRANSACTIONS ON INFORMATION THEORY (2022)

Article Automation & Control Systems

Inference in Opinion Dynamics Under Social Pressure

Ali Jadbabaie, Anuran Makur, Elchanan Mossel, Rabih Salhab

Summary: This article presents a new opinion dynamics model in which a group of agents hold inherent and declared opinions. The agents' inherent opinions are fixed and cannot be observed by others. At each time step, agents share their declared opinions on a social network based on their inherent opinions and social pressure. The paper investigates the possibility of estimating agents' inherent opinions from their declared opinions, using the example of predicting election results based on voters' tweets. The analysis shows that estimation of aggregate and individual inherent opinions is possible unless there are large majorities, which cause minorities to lie over time, making asymptotic estimation impossible.

IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2023)

Article Engineering, Multidisciplinary

On the Influence of the Seed Graph in the Preferential Attachment Model

Sebastien Bubeck, Elchanan Mossel, Miklos Z. Racz

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING (2015)

No Data Available