Enumeration of k-Exceedance Lattice Paths with an Application to Comparing Chains of Order Statistics

arXiv1201.0571MaRDI QIDQ6230041FDOQ6230041

Authors: Charles Hoffman, Corey Manack 

Publication date: 3 January 2012

Abstract: We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x(0leqkleqmleqn)$. These closed formulas consist of terms which are a product Catalan numbers, ballot numbers and binomial coefficients. We then apply the combinatorial formulas to failure analysis by deriving a probability distribution that compares the performance of a $k$-out-of-$m$ system to a $k$-out-of-$n$ system of continuous, independent, and identically distributed random variables. Lastly, we provide asymptotics in a few special cases of $k,m,n$ and leave others as conjecture.

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Sums of independent random variables; random walks (60G50) Combinatorial identities, bijective combinatorics (05A19)

This page was built for publication: Enumeration of k-Exceedance Lattice Paths with an Application to Comparing Chains of Order Statistics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6230041)