Permutation Distributions via Generating Functions with Applications to Sensitivity Analysis of Discrete Data
通过生成函数计算置换分布及离散数据敏感性分析
Generating functions provide a simple and elegant way to describe probability or frequency distributions of discrete statistics and, in particular, permutation distributions. They are also a computational tool. Many efficient algorithms, including those described as fast Fourier transform methods, network methods, and multiple shift methods, are different implementations of the recursions needed to evaluate generating functions efficiently. Our goals here are twofold. First,…