Related papers: Dobrushin ergodicity coefficient for Markov operat…
We give a characterization of the contraction ratio of bounded linear maps in Banach space with respect to Hopf's oscillation seminorm, which is the infinitesimal distance associated to Hilbert's projective metric, in terms of the extreme…
In this paper the stability and the perturbation bounds of Markov operators acting on abstract state spaces are investigated. Here, an abstract state space is an ordered Banach space where the norm has an additivity property on the cone of…
Dynamical systems that are contracting on a subspace are said to be semicontracting. Semicontraction theory is a useful tool in the study of consensus algorithms and dynamical flow systems such as Markov chains. To develop a comprehensive…
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. Tsitsiklis Lyapunov function is shown to be the Hilbert distance to consensus in log coordinates. Birkhoff theorem, which proves contraction of…
It is known that Dobrushin's ergodicity coefficient is one of the effective tools in the investigations of limiting behavior of Markov processes. Several interesting properties of the ergodicity coefficient of a positive mapping defined on…
We provide explicit expressions for the constants involved in the characterisation of ergodicity of sub-geometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation…
In order to successfully explore quantum systems which are perturbations of simple models, it is essential to understand the complexity of perturbation bounds. We must ask ourselves: How quantum many-body systems can be artificially…
We develop a novel stability theory for Sinkhorn semigroups based on Lyapunov techniques and quantitative contraction coefficients, and establish exponential convergence of Sinkhorn iterations on weighted Banach spaces. This…
This paper develops a novel operator theoretic framework to study the contraction properties of Markov semigroups with respect to a general class of Kantorovich semi-distances, which notably includes Wasserstein distances. The rather simple…
Entropic optimal transport problems play an increasingly important role in machine learning and generative modelling. In contrast with optimal transport maps which often have limited applicability in high dimensions, Schrodinger bridges can…
Consensus is a well-studied problem in distributed sensing, computation and control, yet deriving useful and easily computable bounds on the rate of convergence to consensus remains a challenge. This paper discusses the use of seminorms for…
In our earlier paper, a generalized Dobrushin ergodicity coefficient of Markov operators (acting on abstract state spaces) with respect to a projection $P$, has been introduced and studied. It turned out that the introduced coefficient was…
In many branches of engineering, Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. Randomized versions of these algorithms have been developed that have proved useful in…
We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…
We investigate the problem of quantifying contraction coefficients of Markov transition kernels in Kantorovich ($L^1$ Wasserstein) distances. For diffusion processes, relatively precise quantitative bounds on contraction rates have recently…
Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empirical dynamic…
We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…
The data processing inequality is central to information theory and motivates the study of monotonic divergences. However, it is not clear operationally we need to consider all such divergences. We establish a simple method for Pinsker…
We introduce and apply Hilbert's projective metric in the context of quantum information theory. The metric is induced by convex cones such as the sets of positive, separable or PPT operators. It provides bounds on measures for statistical…
In the paper, we study a new rate of convergence estimate for homogeneous discrete-time nonlinear Markov chains based on the Markov-Dobrushin condition. This result generalizes the convergence estimates for any positive number of transition…