A rearrangement inequality for the longest run, with an application to network reliability
From MaRDI portal
Publication:3678429
Recommendations
Cited in
(16)- The reliability of exchangeable binary systems
- The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\)
- Importance measures in reliability and mathematical programming
- A note on the proof for the optimal consecutive-k-out-of-n:G line for n 2k
- Reliability evaluation of multi-state consecutive \(k\)-out-of-\(r\)-from-\(n:G\) system
- Discrete scan statistics generated by exchangeable binary trials
- Linear Dependence in Consecutive k-out-of-n: F Systems
- Formulas for the reliability of a consecutive-K-Out-of-n: F system
- Combined \(m\)-consecutive and \(k\)-out-of-\(n\) sliding window systems
- Mean Residual Lifetimes of Consecutive-k-out-of-n Systems
- Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities
- On a generalizedk-out-of-nsystem and its reliability
- A limit theorem of certain repairable systems
- A general model for consecutive-k-out-of-n:F repairable system with exponential distribution and (k-1)-step Markov dependence.
- Uneven allocation of elements in linear multi-state sliding window system
- Random subnetworks of random sorting networks
This page was built for publication: A rearrangement inequality for the longest run, with an application to network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678429)
