Related papers: A probabilistic approach to convex $(\phi)$-entrop…

Continuous-time Markov chains associated to finite-volume discretization schemes of Fokker-Planck equations are constructed. Sufficient conditions under which quantitative exponential decay in the $\phi$-entropy and Wasserstein distance are…

We obtain estimates on the exponential rate of decay of the relative entropy from equilibrium for Markov processes with a non-local infinitesimal generator. We adapt some of the ideas coming from the Bakry-Emery approach to this setting. In…

We develop a method, based on a Bochner-type identity, to obtain estimates on the exponential rate of decay of the relative entropy from equilibrium of Markov processes in discrete settings. When this method applies the relative entropy…

We study Markov chains with non-negative sectional curvature on finite metric spaces. Neither reversibility, nor the restriction to a particular combinatorial distance are imposed. In this level of generality, we prove that a 1-step…

We study the temporal dissipation of variance and relative entropy for ergodic Markov Chains in continuous time, and compute explicitly the corresponding dissipation rates. These are identified, as is well known, in the case of the variance…

Discrete convex Sobolev inequalities and Beckner inequalities are derived for time-continuous Markov chains on finite state spaces. Beckner inequalities interpolate between the modified logarithmic Sobolev inequality and the Poincar\'e…

In the study of Markovian processes, one of the principal achievements is the equivalence between the $\Phi$-Sobolev inequalities and an exponential decrease of the $\Phi$-entropies. In this work, we develop a framework of Markov semigroups…

The dissipation of general convex entropies for continuous time Markov processes can be described in terms of backward martingales with respect to the tail filtration. The relative entropy is the expected value of a backward submartingale.…

A classical approach for the analysis of the longtime behavior of Markov processes is to consider suitable Lyapunov functionals like the variance or more generally $\Phi$-entropies. Via purely analytic arguments it can be shown that these…

We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for…

Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…

We show that if the random walk on a graph has positive coarse Ricci curvature in the sense of Ollivier, then the stationary measure satisfies a W^1 transport-entropy inequality. Peres and Tetali have conjectured a stronger consequence,…

We study the convergence analysis for general degenerate and non-reversible stochastic differential equations (SDEs). We apply the Lyapunov method to analyze the Fokker-Planck equation, in which the Lyapunov functional is chosen as a…

While one-dimensional Markov processes are well understood, going to higher dimensions there are only a few analytically solved Ising-like models, in practice requiring to use relatively costly, uncontrollable and inaccurate Monte-Carlo…

We study long-time dynamical behaviors of weakly self-consistent Vlasov-Fokker-Planck equations. We introduce Hessian matrix conditions on mean-field kernel functions, which characterizes the exponential convergence of solutions in $L^1$…

There is a lack of methodological results for continuous time change detection due to the challenges of noninformative prior specification and efficient posterior inference in this setting. Most methodologies to date assume data are…

We study Markov processes associated with stochastic differential equations, whose non-linearities are gradients of convex functionals. We prove a general result of existence of such Markov processes and a priori estimates on the transition…

We consider a new functional inequality controlling the rate of relative entropy decay for random walks, the interchange process and more general block-type dynamics for permutations. The inequality lies between the classical logarithmic…

This paper considers the speed of convergence (mixing) of a finite Markov kernel $P$ with respect to the Kullback-Leibler divergence (entropy). Given a Markov kernel one defines either a discrete-time Markov chain (with the $n$-step…

In this paper, we establish moment and Bernstein-type inequalities for additive functionals of geometrically ergodic Markov chains. These inequalities extend the corresponding inequalities for independent random variables. Our conditions…