let a and b be n × m matrices. the matrix b is said to be g-row majorized (respectively g-column majorized) by a, if every row (respectively column) of b, is g-majorized by the corresponding row (respectively column) of a. in this paper all kinds of g-majorization are studied on mn,m, and the possible structure of their linear preservers will be found. also all linear operators t : mn,m ---> mn...

let a and b be n × m matrices. the matrix b is said to be g-row majorized (respectively g-column majorized) by a, if every row (respectively column) of b, is g-majorized by the corresponding row (respectively column) of a. in this paper all kinds of g-majorization are studied on mn,m, and the possible structure of their linear preservers will be found. also all linear operators t : mn,m ---> mn...

Let Mn,m be the set of all n × m matrices with entries in F, where F is the field of real or complex numbers. A matrix R ∈ Mn with the property Re=e, is said to be a g-row stochastic (generalized row stochastic) matrix. Let A,B∈ Mn,m, so B is said to be gw-majorized by A if there exists an n×n g-row stochastic matrix R such that B=RA. In this paper we characterize all linear operators that stro...

We present a transformation for stochastic matrices and analyze the effects of using it in stochastic comparison with the strong stochastic (st) order. We show that unless the given stochastic matrix is row diagonally dominant, the transformed matrix provides better st bounds on the steady state probability distribution.

We prove that the set of n×n positive (row-)stochastic matrices and the corresponding set of doubly-stochastic matrices are asymptotically close. More specifically, random matrices within each of these classes are arbitrarily close in sufficiently high dimensions. AMS 2000 subject classifications:Primary 15A51,15A52,15A60, Stochastic Matrices. Let Sn denote the set of n × n stochastic matrices ...

for vectors x, y ∈ rn, it is said that x is left matrix majorizedby y if for some row stochastic matrix r; x = ry. the relationx ∼` y, is defined as follows: x ∼` y if and only if x is leftmatrix majorized by y and y is left matrix majorized by x. alinear operator t : rp → rn is said to be a linear preserver ofa given relation ≺ if x ≺ y on rp implies that t x ≺ ty onrn. the linear preservers o...