The Number of Inversions and the Major Index of Permutations are Asymptotically Joint-Independently-Normal

نویسندگان

  • Andrew BAXTER
  • Doron ZEILBERGER
چکیده

Human statistics are numerical attributes defined on humans, for example, longevity, height, weight, IQ, and it is well-known, at least empirically, that these are, each separately, asymptotically normal, which means that if you draw a histogram with the statistical data, it would look like a bell-curve. It is also true that they are usually joint-asymptotically-normal, but usually not independently so. But if you compute empirically the correlation matrix, you would get, asymptotically (i.e. for “large” populations) that they are close to being distributed according to a multivariate (generalized) Gaussian exp(−Q(x1, x2, ...)) with Q(x1, x2, . . .) a certain quadratic form that can be deduced from the correlation matrix.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Number of Inversions and the Major Index of Permutations

We use recurrences (alias difference equations) to prove that the two most important permutation statistics, namely the number of inversions and the major index, are asymptotically joint-independently-normal. We even derive more-precise-than-needed asymptotic formulas for the (normalized) mixed moments.

متن کامل

Generalized Worpitzky Identities with Applications to Permutation Enumeration

The enumeration of permutations by inversions often leads to a q-analog of the usual generating 'nnetic,n. In this paper, two generalizations of the Worpitzky identity for the Eulerian numbers are obtained and used to enumerate permutations by the descent number and the major index of their inverses. The resulting (t, q)-generating series do in fact generalize the q-series obtainc? when countin...

متن کامل

On the revised edge-Szeged index of graphs

The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...

متن کامل

Study of Temperature and Salinity Inversions in the Oman Sea

In this research, observational data are analyzed to explain temperature and salinity inversions and double diffusion in the Oman Sea. The results of this paper show that intrusive structures extend over a depth of about 100-450 meters in the Oman Sea. Temperature and salinity inversions observed depth of 250 m in winter and summer in the Oman Sea. Steps thickness is about 10 to 20 meters. A wa...

متن کامل

A CAT algorithm for generating permutations with a fixed number of inversions

We develop a constant amortized time (CAT) algorithm for generating permutations with a given number of inversions. We also develop an algorithm for the generation of permutations with given index.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010