Bounds for Exponents of Doubly Stochastic Primitive Matrices.
Characterizations of embeddable stochastic matrices with a negative eigenvalue.
Coefficients of ergodicity generated by non-symmetrical vector norms
Comparability and conditional maximality of measures supported by finite sets of real numbers
Comparison of Metric Spectral Gaps
Let A = (aij) ∊ Mn(ℝ) be an n by n symmetric stochastic matrix. For p ∊ [1, ∞) and a metric space (X, dX), let γ(A, dpx) be the infimum over those γ ∊ (0,∞] for which every x1, . . . , xn ∊ X satisfy [...] Thus γ (A, dpx) measures the magnitude of the nonlinear spectral gap of the matrix A with respect to the kernel dpX : X × X →[0,∞). We study pairs of metric spaces (X, dX) and (Y, dY ) for which there exists Ψ: (0,∞)→(0,∞) such that γ (A, dpX) ≤Ψ (A, dpY ) for every symmetric stochastic A ∊ Mn(ℝ)...
Conditioning properties of the stationary distribution for a Markov chain.
Constructions of trace zero symmetric stochastic matrices for the inverse eigenvalue problem.
Directed forests with application to algorithms related to Markov chains
This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.
Doubly stochastic matrices and the Bruhat order
The Bruhat order is defined in terms of an interchange operation on the set of permutation matrices of order which corresponds to the transposition of a pair of elements in a permutation. We introduce an extension of this partial order, which we call the stochastic Bruhat order, for the larger class of doubly stochastic matrices (convex hull of permutation matrices). An alternative description of this partial order is given. We define a class of special faces of induced by permutation matrices,...
Dynamics of doubly stochastic quadratic operators on a finite-dimensional simplex
The present paper focuses on the dynamics of doubly stochastic quadratic operators (d.s.q.o) on a finite-dimensional simplex. We prove that if a d.s.q.o. has no periodic points then the trajectory of any initial point inside the simplex is convergent. We show that if d.s.q.o. is not a permutation then it has no periodic points on the interior of the two dimensional (2D) simplex. We also show that this property fails in higher dimensions. In addition, the paper also discusses the dynamics classifications...
Efficient measurement of higher-order statistics of stochastic processes
This paper is devoted to analysis of block multi-indexed higher-order covariance matrices, which can be used for the least-squares estimation problem. The formulation of linear and nonlinear least squares estimation problems is proposed, showing that their statements and solutions lead to generalized `normal equations', employing covariance matrices of the underlying processes. Then, we provide a class of efficient algorithms to estimate higher-order statistics (generalized multi-indexed covariance...
Eine Eigenwertabschätzung für Integraloperatoren mit stochastischen Kernen
Entropy for a pair of subalgebras via automorphisms.
Evaluating scientific products by means of citation-based models: a first analysis and validation.
Extremal quantum states in coupled systems
Factorisation d'opérateurs aléatoires, d'après Benyamini et Gordon
Girth and subdominant eigenvalues for stochastic matrices.
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the...
Green's relations for stochastic matrices
Inclusion Domains for the Eigenvalues of Stochastic Matrices.