Dependence in Lag for Markov Chains on Partially Ordered State Spaces with Applications to Degradable Networks
From MaRDI portal
(Redirected from Publication:3548761)
Recommendations
- DEPENDENCE ORDERING FOR QUEUING NETWORKS WITH BREAKDOWN AND REPAIR
- scientific article; zbMATH DE number 125969
- Dependence ordering for Markov processes on partially ordered spaces
- Comparisons of dependence for stationary Markov processes
- Stochastic Orderings for Markov Processes on Partially Ordered Spaces
Cites work
- A monotonicity result for the workload in Markov-modulated queues
- A NOTE ON THE INCREASING DIRECTIONALLY CONCAVE MONOTONICITY IN QUEUES
- Availability Formulas and Performance Measures for Separable Degradable Networks
- Comparison methods for stochastic models and risks
- Dependence ordering for Markov processes on partially ordered spaces
- DEPENDENCE ORDERING FOR QUEUING NETWORKS WITH BREAKDOWN AND REPAIR
- Lagged queue-length correlations in two-node networks
- MONOTONICITY IN LAG FOR NONMONOTONE MARKOV CHAINS
- Monotonicity of positive dependence with time for stationary reversible Markov chains
- Ross-Type Conjectures on Monotonicity of Queues
- Stochastic product form networks with unreliable nodes: analysis of performance and availability.
- Stochastically monotone Markov Chains
- The serial correlation coefficients of waiting times in a stationary single server queue
Cited in
(2)
This page was built for publication: Dependence in Lag for Markov Chains on Partially Ordered State Spaces with Applications to Degradable Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548761)