Technical comment. A problem on Markov chains
A problem (arisen from applications to networks) is posed about the principal minors of the matrix of transition probabilities of a Markov chain.
A problem (arisen from applications to networks) is posed about the principal minors of the matrix of transition probabilities of a Markov chain.
A problem (arisen from applications to networks) is posed about the principal minors of the matrix of transition probabilities of a Markov chain.
We generalize the theory of positive diagonal scalings of real positive definite matrices to complex diagonal scalings of complex positive definite matrices. A matrix A is a diagonal scaling of a positive definite matrix M if there exists an invertible complex diagonal matrix D such that A = D*MD and where every row and every column of A sums to one. We look at some of the key properties of complex diagonal scalings and we conjecture that every n by n positive definite matrix has at most 2n−1 scalings...
En la Teoría de la Decisión en Grupo, cuando los expertos emiten su información sobre los objetos de una manera probabilística, se pueden construir Principios de Consistencia que satisfagan los cinco principios de racionalidad y no sean dictatoriales [ver Sánchez-Pérez-Domench (1986)].Partiendo de esta situación, en el presente artículo se analizan y proponen diferentes métodos y algoritmos para transformar relaciones sociales aleatorias en determinísticas, continuando y completando así investigaciones...
We show that each element in the semigroup of all non-singular upper (or lower) triangular stochastic matrices is generated by the infinitesimal elements of , which form a cone consisting of all upper (or lower) triangular intensity matrices.