k-超越格路的Enumeration及其在顺序统计量比较链中的应用
Enumeration of k-Exceedance Lattice Paths with an Application to Comparing Chains of Order Statistics
摘要:
我们列举了从$(0,0)$开始并终止于$(m,n)$的单调格路径的数目,其中第一个$k$步骤的$l$位于线$y=x\ (0\leq k\leq m\leq n)$之下。这些封闭的公式包括的条款是一个产品加泰罗尼亚数,选票数和二项式系数。然后,我们将组合公式应用于故障分析,通过推导出一个概率分布,比较性能的一个$k$ -出-$m$系统的一个$k$ -出- $n$系统的连续的,独立的,同分布的随机变量。最后,我们提供了$k,m,n$的几个特殊情况下的渐近性,并留下其他的猜测。
英文摘要:
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\ (0\leq k\leq m\leq n)$. 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。