Smoothness and L\'evy concentration function inequalities for distributions of random diagonal sums
Abstract
We present new explicit upper bounds for the smoothness of the distribution of the random diagonal sum Sn=Σj=1nXj,π(j) of a random n× n matrix X=(Xj,r), where the Xj,r are independent integer valued random variables, and π denotes a uniformly distributed random permutation on \1,…,n\ independent of X. As a measure of smoothness, we consider the total variation distance between the distributions of Sn and 1+Sn. Our approach uses a new auxiliary inequality for a generalized normalized matrix hafnian, which could be of independent interest. This approach is also used to prove upper bounds of the L\'evy concentration function of Sn in the case of independent real valued random variables Xj,r.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.