2000 character limit reached
Characterization of a class of weak transport-entropy inequalities on the line
Published 14 Sep 2015 in math.PR and math.FA | (1509.04202v2)
Abstract: We study an optimal weak transport cost related to the notion of convex order between probability measures. On the real line, we show that this weak transport cost is reached for a coupling that does not depend on the underlying cost function. As an application, we give a necessary and sufficient condition for weak transport-entropy inequalities in dimension one. In particular, we obtain a weak transport-entropy form of the convex Poincar{\'e} inequality in dimension one.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.