ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (X,p)(X,p) be a reversible Markov chain. Write d:=max⁡{1/p(x,y):p(x,y)>0}d:=\max\{1/p(x,y):p(x,y)>0\} for its sparsity constant, and let Lip⁡\operatorname{Lip} denote the Lipschitz constant with respect to the combinatorial distance, also called the hop-count distance. Suppose that the Ollivier curvature is bounded below by K>0K>0, in the sense that

Lip⁡(Ptf)≤e−KtLip⁡(f)for all f∈RX and t>0.\operatorname{Lip}(P_t f)\leq e^{-Kt}\operatorname{Lip}(f)\quad\text{for all }f\in\mathbb{R}^X\text{ and }t>0.

Salez–Youssef conjecture. There is a universal constant c>0c>0 such that

αLSI≥c⋅Klog⁡d.\alpha_{LSI}\geq c\cdot\frac{K}{\log d}.

Salez and Youssef established the analogous estimate under a Bakry–Émery curvature lower bound, while the Ollivier-curvature version would avoid the stronger non-negative sectional-curvature assumption and is often easier to compute in practice. The conjecture is presented here as the subject of the paper; the supplied text gives no resolution status.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.