Pages that link to "Item:Q1771369"

The following pages link to Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering (Q1771369):

Displaying 7 items.

• Algorithms for an irreducible and lumpable strong stochastic bound (Q1434421) (← links)
• Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering (Q1771369) (← links)
• Comparing Markov chains: aggregation and precedence relations applied to sets of states, with applications to assemble-to-order systems (Q2884317) (← links)
• Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach (Q3543321) (← links)
• An Arbitrary Nonhomogeneous Markov Chain with Bounded Number of States May Be Decomposed into Asymptotically Noncommunicating Components Having the Mixing Property (Q4000564) (← links)
• Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems (Q4203792) (← links)
• A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (Q5251622) (← links)