Page 1

Displaying 1 – 16 of 16

Showing per page

On a bound on algebraic connectivity: the case of equality

Stephen J. Kirkland, Neumann, Michael, Bryan L. Shader (1998)

Czechoslovak Mathematical Journal

In a recent paper the authors proposed a lower bound on 1 - λ i , where λ i , λ i 1 , is an eigenvalue of a transition matrix T of an ergodic Markov chain. The bound, which involved the group inverse of I - T , was derived from a more general bound, due to Bauer, Deutsch, and Stoer, on the eigenvalues of a stochastic matrix other than its constant row sum. Here we adapt the bound to give a lower bound on the algebraic connectivity of an undirected graph, but principally consider the case of equality in the bound when...

On a class of linear models.

Radu Theodorescu (1985)

Trabajos de Estadística e Investigación Operativa

This paper is concerned with classification criteria, asymptotic behaviour and stationarity of a non-Markovian model with linear transition rule, called a linear OM-chain. This problems are solved by making use of the structure of the stochastic matrix appearing in the definition of such a model. The model studied includes as special cases the Markovian model as well as the linear learning model, and has applications in psychological and biological research, in control theory, and in adaptation...

On Nilpotent Subsemigroups in some Matrix Semigroups

Ganyushkin, Olexandr, Mazorchuk, Volodymyr (2007)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 20M20, 20M10.We describe maximal nilpotent subsemigroups of a given nilpotency class in the semigroup Ωn of all n × n real matrices with non-negative coefficients and the semigroup Dn of all doubly stochastic real matrices.

On the cardinality of complex matrix scalings

George Hutchinson (2016)

Special Matrices

We disprove a conjecture made by Rajesh Pereira and Joanna Boneng regarding the upper bound on the number of doubly quasi-stochastic scalings of an n × n positive definite matrix. In doing so, we arrive at the true upper bound for 3 × 3 real matrices, and demonstrate that there is no such bound when n ≥ 4.

Currently displaying 1 – 16 of 16

Page 1