相关论文: Computing the norm of nonnegative matrices and the…

Motivated by the theory of inhomogeneous Markov chains, we determine a sufficient condition for the convergence to 0 of a general product formed from a sequence of real or complex matrices. When the matrices have a common invariant subspace…

To prove that a measure, linearly representable by means of a finite set of nonnegative matrices $\mathcal M$, has the weak-Gibbs property, one check the uniform convergence (on $\mathcal M^\mathbb N$) of the sequence of vectors…

This paper studies Hoeffding's inequality for Markov chains under the generalized concentrability condition defined via integral probability metric (IPM). The generalized concentrability condition establishes a framework that interpolates…

We prove that in the context of general Markov semigroups Beckner inequalities with constants separated from zero as $p\to 1^+$ are equivalent to the modified log Sobolev inequality (previously only one implication was known to hold in this…

We obtain universal estimates on the convergence to equilibrium and the times of coupling for continuous time irreducible reversible finite-state Markov chains, both in the total variation and in the L^2 norms. The estimates in total…

We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we prove that every finite dimensional GNS-symmetric quantum…

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…

We prove that the complete modified logarithmic Sobolev constant of a quantum Markov semigroup is bounded by the inverse of its complete positivity mixing time. For classical Markov semigroups, this implies that every sub-Laplacian given by…

We observe that the technique of Markov contraction can be used to establish measure concentration for a broad class of non-contracting chains. In particular, geometric ergodicity provides a simple and versatile framework. This leads to a…

We consider the problem of computing the q->p norm of a matrix A, which is defined for p,q \ge 1, as |A|_{q->p} = max_{x !=0 } |Ax|_p / |x|_q. This is in general a non-convex optimization problem, and is a natural generalization of the…

This paper is about the rate of convergence of the Markov chain $X_{n+1}=AX_{n}+B_{n}$ (mod $p$), where $A$ is an integer matrix with nonzero eigenvalues and ${B_{n}}_{n}$ is a sequence of independent and identically distributed integer…

The problem of low-rank matrix completion has recently generated a lot of interest leading to several results that offer exact solutions to the problem. However, in order to do so, these methods make assumptions that can be quite…

Under reasonable algebraic assumptions and under an infinite second order moment assumption, we show that the logarithm of the norm (log-norm) of a product of random i.i.d. matrices with entries in $\mathbb{R}$ or in any other local field…

A new approach is developed for evaluating the convergence rate for nonlinear Markov chains (MC) based on the recently developed spectral radius technique of markovian coupling for linear MC and the idea of small nonlinear perturbations of…

Let $(\xi_n)_{n=0}^\infty$ be a nonhomogeneous Markov chain taking values from finite state-space of $\mathbf{X}=\{1,2,\ldots,b\}$. In this paper, we will study the generalized entropy ergodic theorem with almost-everywhere and…

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…

Through a Metropolis-like algorithm with single step computational cost of order one, we build a Markov chain that relaxes to the canonical Fermi statistics for k non-interacting particles among m energy levels. Uniformly over the…

We prove the mixed-norm Sobolev estimates for solutions to both divergence and non-divergence form time-dependent Stokes systems with unbounded measurable coefficients having small mean oscillations with respect to the spatial variable in…

Computing $p \rightarrow q$ norm for matrices is a classical problem in computational mathematics and power iteration is a well-known method for computing $p \rightarrow q $ norm for a matrix with nonnegative entries. Here we define an…

We consider the convergence of iterative solvers for problems of nonlinear magnetostatics. Using the equivalence to an underlying minimization problem, we can establish global linear convergence of a large class of methods, including the…