Introduction to Probability · Problem 3.3.4

Conditional Probability — Grinstead & Snell

Mathematics — Probability · card-shuffling-variation-distance

Problem

Let XX denote a particular process that produces elements of SnS_n, and let UU denote the uniform process. Let the distribution functions of these processes be denoted by fXf_X and uu, respectively. Show that the variation distance ∥fX−u∥\| f_X - u \| is equal to max⁡T⊂Sn∑π∈T(fX(π)−u(π)).\max_{T \subset S_n} \sum_{\pi \in T} \Big( f_X(\pi) - u(\pi) \Big) . Hint: Write the permutations in SnS_n in decreasing order of the difference fX(π)−u(π)f_X(\pi) - u(\pi).

Related theory

Browse the problem library