AbstractWe extend the Markov Chain Tree Theorem to general commutative semirings, and we generalize the State Reduction Algorithm to general commutative semifields. This leads to a new universal algorithm, whose prototype is the State Reduction Algorithm which computes the Markov chain tree vector of a stochastic matrix
International audienceWe propose several algorithms to obtain bounds based on Censored Markov Chains...
States of a Markov chain may be reordered to reduce the magnitude of the subdominant eigenvalue of t...
The original publication can be found at www.springerlink.comIn this paper we introduce a structure ...
We extend the Markov Chain Tree Theorem to general commutative semirings, and we generalize the Stat...
AbstractWe extend the Markov Chain Tree Theorem to general commutative semirings, and we generalize ...
A discrete-time Markov chain on a state space S is a sequence of random variables X = fx0; x1; : : ...
On s'intéresse à deux classes de chaînes de Markov combinatoires. On commence avec les chaînes de Ma...
The aim of this paper is to study markovianity for states on von Neumann algebras generated by the u...
AbstractGómez and Salazar showed that for n⩽3, the spanning tree invariants of the loop systems of a...
AbstractGustafson and Styan (Gustafson and Styan, Superstochastic matrices and Magic Markov chains, ...
AbstractA number of important theorems arising in connection with Gaussian elimination are derived, ...
AbstractIn this paper, we investigate the ordering on a semiring of monotone doubly stochastic trans...
The operation of squaring (coproduct followed by product) in a combinatorial Hopf algebra is shown t...
AbstractThe spanning tree invariant of Lind and Tuncel [12] is observed in the context of loop syste...
AbstractWe discuss the State Reduction/GTH (Grassmann, Taksar, Heyman) algorithm for recursively fin...
International audienceWe propose several algorithms to obtain bounds based on Censored Markov Chains...
States of a Markov chain may be reordered to reduce the magnitude of the subdominant eigenvalue of t...
The original publication can be found at www.springerlink.comIn this paper we introduce a structure ...
We extend the Markov Chain Tree Theorem to general commutative semirings, and we generalize the Stat...
AbstractWe extend the Markov Chain Tree Theorem to general commutative semirings, and we generalize ...
A discrete-time Markov chain on a state space S is a sequence of random variables X = fx0; x1; : : ...
On s'intéresse à deux classes de chaînes de Markov combinatoires. On commence avec les chaînes de Ma...
The aim of this paper is to study markovianity for states on von Neumann algebras generated by the u...
AbstractGómez and Salazar showed that for n⩽3, the spanning tree invariants of the loop systems of a...
AbstractGustafson and Styan (Gustafson and Styan, Superstochastic matrices and Magic Markov chains, ...
AbstractA number of important theorems arising in connection with Gaussian elimination are derived, ...
AbstractIn this paper, we investigate the ordering on a semiring of monotone doubly stochastic trans...
The operation of squaring (coproduct followed by product) in a combinatorial Hopf algebra is shown t...
AbstractThe spanning tree invariant of Lind and Tuncel [12] is observed in the context of loop syste...
AbstractWe discuss the State Reduction/GTH (Grassmann, Taksar, Heyman) algorithm for recursively fin...
International audienceWe propose several algorithms to obtain bounds based on Censored Markov Chains...
States of a Markov chain may be reordered to reduce the magnitude of the subdominant eigenvalue of t...
The original publication can be found at www.springerlink.comIn this paper we introduce a structure ...