A central limit theorem for a new statistic on permutations |
| |
Authors: | Sourav Chatterjee Persi Diaconis |
| |
Affiliation: | 1.Stanford,USA |
| |
Abstract: | This paper does three things: It proves a central limit theorem for novel permutation statistics (for example, the number of descents plus the number of descents in the inverse). It provides a clear illustration of a new approach to proving central limit theorems more generally. It gives us an opportunity to acknowledge the work of our teacher and friend B. V. Rao. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|