Related papers: Entropy inequalities for random walks and permutat…

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 investigate the diagonal entropy for ground states of the extended Kitaev chains with extensive pairing and hopping terms. The systems contain rich topological phases equivalently represented by topological invariant winding numbers and…

For general spin systems, we prove that a contractive coupling for any local Markov chain implies optimal bounds on the mixing time and the modified log-Sobolev constant for a large class of Markov chains including the Glauber dynamics,…

We develop the optimal transportation approach to modified log-Sobolev inequalities and to isoperimetric inequalities. Various sufficient conditions for such inequalities are given. Some of them are new even in the classical log-Sobolev…

We present a new Monte Carlo algorithm that produces results of high accuracy with reduced simulational effort. Independent random walks are performed (concurrently or serially) in different, restricted ranges of energy, and the resultant…

We show that the product or convex combination of two Markov operators with equivalent stationary measures need not have a stationary measure from the same measure class. More specifically, we exhibit examples of a hitherto undescribed…

The possibility of stating the second law of thermodynamics in terms of the increasing behaviour of a physical property establishes a connection between that branch of physics and the theory of algebraic inequalities. We use this connection…

We study nontrivial entropy invariants in the class of parabolic flows on homogeneous spaces, quasi-unipotent flows. We show that topological complexity (ie, slow entropy) can be computed directly from the Jordan block structure of the…

We study the block-coordinate forward-backward algorithm in which the blocks are updated in a random and possibly parallel manner, according to arbitrary probabilities. The algorithm allows different stepsizes along the block-coordinates to…

Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters vary. Recent work has considered the relationship between…

In this paper, we study some functional inequalities (such as Poincar\'e inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy…

We consider a one-dimensional persisent random walk viewed as a deterministic process with a form of time reversal symmetry. Particle reservoirs placed at both ends of the system induce a density current which drives the system out of…

We show that the asymptotic entropy of a random walk on a nonelementary hyperbolic group, with symmetric and bounded increments, is differentiable and we identify its derivative as a correlation. We also prove similar results for the rate…

Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…

We study asymptotic properties of the Green metric associated with transient random walks on countable groups. We prove that the rate of escape of the random walk computed in the Green metric equals its asymptotic entropy. The proof relies…

A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their…

In information theory, the well-known log-sum inequality is a fundamental tool which indicates the non-negativity for the relative entropy. In this article, we establish a set of inequalities which are similar to the log-sum inequality…

Surprisingly the looking natural random walk leading to Brownian motion occurs to be often biased in a very subtle way: usually refers to only approximate fulfillment of thermodynamical principles like maximizing uncertainty. Recently, a…

In this paper we study the ergodicity and the related semigroup property for a class of symmetric Markov jump processes associated with time changed symmetric $\alpha$-stable processes. For this purpose, explicit and sharp criteria for…