arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0405060math.ACmath.CO
收藏

等级数据非交换傅里叶分析的马尔可夫基

Markov bases for noncommutative Fourier analysis of ranked data

Persi Diaconis, Nicholas Eriksson

摘要:

为了通过马尔可夫链蒙特卡罗技术校准$S_5$排名数据的傅里叶分析,需要一组移动(马尔可夫基)。我们计算这个基础,并使用它来提供两个数据集的新的统计分析。计算涉及到一个大的Gröbner基础计算(45825发电机),但减少到一个最小的基础和减少自然对称导致一个非常小的基础(14个元素)。虽然Gröbner基计算是不可行的$S_6$,我们利用问题的对称性计算的马尔可夫基$S_6$与7,113,390元素在58个对称类。我们改进了$S_n$的马尔可夫基的生成元的度上的界,并推测这个理想是在度3中生成的。

英文摘要:

To calibrate Fourier analysis of $S_5$ ranking data by Markov chain Monte Carlo techniques, a set of moves (Markov basis) is needed. We calculate this basis, and use it to provide a new statistical analysis of two data sets. The calculation involves a large Gröbner basis computation (45825 generators), but reduction to a minimal basis and reduction by natural symmetries leads to a remarkably small basis (14 elements). Although the Gröbner basis calculation is infeasible for $S_6$, we exploit the symmetry of the problem to calculate a Markov basis for $S_6$ with 7,113,390 elements in 58 symmetry classes. We improve a bound on the degree of the generators for a Markov basis for $S_n$ and conjecture that this ideal is generated in degree 3.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑