计算多元正态分布混合矩的线性时不变空算法
A Linear Time, and Constant Space, Algorithm to Compute the Mixed Moments of the Multivariate Normal Distributions
摘要:
本文利用Apagodu-Zeilberger多元Almkvist-Zeilberger算法的递推关系,提出了一种线性时间、常空间的算法,计算任意协方差阵的k元一般正态分布的一般混合矩。除了在统计学上的重要性外,这些数字在枚举组合学中也非常重要,因为它们可以计算出在一个有k个不同性别的物种中,一群个体可以通过多少种方式结婚,从而跟踪不同类型的异性婚姻。我们完全实现了我们的算法(附带Maple包MVNM.txt),用于二元和三元情况(因此照顾到了我们自己的2性别社会和假定的3性别社会),但唉,对于较大k的实际递归计算时间太长了。我们把它们作为计算挑战。
英文摘要:
Using recurrences gotten from the Apagodu-Zeilberger Multivariate Almkvist-Zeilberger algorithm we present a linear-time, and constant-space, algorithm to compute the general mixed moments of the k-variate general normal distribution, with any covariance matrix, for any specific k. Besides their obvious importance in statistics, these numbers are also very significant in enumerative combinatorics, since they count in how many ways, in a species with k different genders, a bunch of individuals can all get married, keeping track of the different kinds of heterosexual marriages. We completely implement our algorithm (with an accompanying Maple package, MVNM.txt) for the bivariate and trivariate cases (and hence taking care of our own 2-sex society and a putative 3-sex society), but alas, the actual recurrences for larger k took too long for us to compute. We leave them as computational challenges.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。