Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T16:47:18.401Z Has data issue: false hasContentIssue false

A rearrangement inequality for the longest run, with an application to network reliability

Published online by Cambridge University Press:  14 July 2016

Y. L. Tong*
Affiliation:
Georgia Institute of Technology
*
∗ Postal address: School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332, USA.

Abstract

Let X l, · ··, Χ n be independent binary variables with parameters θl, · ··, θ n respectively, and let R denote the length of the longest run of 1's. This note concerns a new expression for and a rearrangement inequality. The inequality is applied to solve an optimal permutation problem for consecutive-k-out-of-n: F networks, and its implications on a recent conjecture of Derman et al. (1982) are discussed.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1985 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable