Inversion 2

In a permutation a 1 , a 2 , , a n a_{1}, a_2, \ldots, a_{n} of n n distinct integers, an inversion is a pair ( a i , a j ) (a_{i}, a_{j}) such that i < j i < j and a i > a j a_{i} > a_{j} .

If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of 1 , 2 , 3 , , n 1,2,3,\ldots,n ?

n ( n 1 ) 4 \frac{n(n-1)}{4} n ( n + 1 ) 2 \frac{n(n+1)}{2} n ( n 1 ) 6 \frac{n(n-1)}{6} n ( n 1 ) 2 \frac{n(n-1)}{2}

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Abhishek Sinha
Mar 13, 2016

There are ( n 2 ) \binom{n}{2} pairs and each pair is inverted with probability 1 2 \frac{1}{2} . Hence the expected number of inversion is 1 2 ( n 2 ) = n ( n 1 ) 4 . \frac{1}{2}\binom{n}{2}=\frac{n(n-1)}{4}.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...