Related papers: A probabilistic approach to convex $(\phi)$-entrop…
We consider continuous-time (not necessarily finite) Markov chains on discrete spaces and identify a curvature-dimension inequality, the condition $CD_\Upsilon(\kappa,\infty)$, which serves as a natural analogue of the classical…
A time-dependent finite-state Markov chain that uses doubly stochastic transition matrices, is considered. Entropic quantities that describe the randomness of the probability vectors, and also the randomness of the discrete paths, are…
Traditional thermodynamic trade-off relations usually apply to quantities that depend linearly on probability distributions. In contrast, many important information-theoretic measures, such as entropies, are nonlinear and therefore…
In this work, we consider an inhomogeneous (discrete time) Markov chain and are interested in its long time behavior. We provide sufficient conditions to ensure that some of its asymptotic properties can be related to the ones of a…
We establish a new Bernstein-type deviation inequality for general (non-reversible) discrete-time Markov chains via an elementary approach. More robust than existing works in the literature, our result only requires the Markov chain to…
We investigate the application of Weak Poincar\'e Inequalities (WPI) to Markov chains to study their rates of convergence and to derive complexity bounds. At a theoretical level we investigate the necessity of the existence of WPIs to…
Exponential inequalities are main tools in machine learning theory. To prove exponential inequalities for non i.i.d random variables allows to extend many learning techniques to these variables. Indeed, much work has been done both on…
We consider discrete time Markov chains with Polish state space. The large deviations principle for empirical measures of a Markov chain can equivalently be stated in Laplace principle form, which builds on the convex dual pair of relative…
We offer a new point of view on the (Modified) Log-Sobolev inequality and lower bounds on the Ricci-curvature in the setting where the dynamics are obtained as the limit of Markov processes. In this setting, the large deviation rate…
We study a Markov process with two components: the first component evolves according to one of finitely many underlying Markovian dynamics, with a choice of dynamics that changes at the jump times of the second component. The second…
Through this paper we analyze the ergodic properties of continuous time Markov chains with values on the one-dimensional spin lattice 1,...,d}^N (also known as the Bernoulli space). Initially, we consider as the infinitesimal generator the…
Entropy estimation, due in part to its connection with mutual information, has seen considerable use in the study of time series data including causality detection and information flow. In many cases, the entropy is estimated using…
We develop a new framework for establishing approximate factorization of entropy on arbitrary probability spaces, using a geometric notion known as non-negative sectional curvature. The resulting estimates are equivalent to entropy…
We formulate a trajectorial version of the relative entropy dissipation identity for McKean$-$Vlasov diffusions, extending the results of the papers [FJ16,KST20a], which apply to non-interacting diffusions. Our stochastic analysis approach…
Convexity properties of the entropy along displacement interpolations are crucial in the Lott-Sturm-Villani theory of lower bounded curvature of geodesic measure spaces. As discrete spaces fail to be geodesic, an alternate analogous theory…
This study in centered on models accounting for stochastic deformations of sample paths of random walks, embedded either in $\mathbb{Z}^2$ or in $\mathbb{Z}^3$. These models are immersed in multi-type particle systems with exclusion.…
We study the mixing time of two popular discrete-time Markov chains in continuous space, the Unadjusted Langevin Algorithm and the Proximal Sampler, which are discretizations of the Langevin dynamics. We extend mixing time analyses for…
Parameter estimation in Markov random fields (MRFs) is a difficult task, in which inference over the network is run in the inner loop of a gradient descent procedure. Replacing exact inference with approximate methods such as loopy belief…
Inspired by the approach of Ivanisvili and Volberg towards functional inequalities for probability measures with strictly convex potentials, we investigate the relationship between curvature bounds in the sense of Bakry-Emery and local…
We consider degenerate diffusion equations of the form $\partial_tp_t = \Delta f(p_t)$ on a bounded domain and subject to no-flux boundary conditions, for a class of nonlinearities $f$ that includes the porous medium equation. We derive for…