Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2003.05179

Entropic curvature on graphs along Schr{ö}dinger bridges at zero temperature

Paul-Marie Samson
View original source ↗Read source document ↗Export metadata ↓

Abstract

Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{é}onard by replacing W2-Wasserstein geodesics by Schr{ö}odinger bridges in the definition of entropic curvature [23, 25, 24]. As a remarkable fact, as a temperature parameter goes to zero, these Schr{ö}dinger bridges are supported by geodesics of the space. We analyse this property on discrete graphs to reach entropic curvature on discrete spaces. Our approach provides lower bounds for the entropic curvature for several examples of graph spaces: the lattice Z n endowed with the counting measure, the discrete cube endowed with product probability measures, the circle, the complete graph, the Bernoulli-Laplace model. Our general results also apply to a large class of graphs which are not specifically studied in this paper. As opposed to Erbar-Maas results on graphs [27, 10, 11], entropic curvature results of this paper imply new Pr{é}kopa-Leindler type of inequalities on discrete spaces, and new transport-entropy inequalities related to refined concentration properties for the graphs mentioned above. For example on the discrete hypercube {0, 1} n and for the Bernoulli Laplace model, a new W2 -- W1 transport-entropy inequality is reached, that can not be derived by usual induction arguments over the dimension n. As a surprising fact, our method also gives improvements of weak transport-entropy inequalities (see [28, 15]) associated to the so-called convex-hull method by Talagrand [38].

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul-Marie Samson. 2022-10-05. Entropic curvature on graphs along Schr{ö}dinger bridges at zero temperature. https://doi.org/10.1007/s00440-022-01167-4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR↗
arXiv2026

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR↗
arXiv2026

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR↗