相关论文: On the variational distance of independently repea…

If one seeks to estimate the total variation between two product measures $||P^\otimes_{1:n}-Q^\otimes_{1:n}||$ in terms of their marginal TV sequence $\delta=(||P_1-Q_1||,||P_2-Q_2||,\ldots,||P_n-Q_n||)$, then trivial upper and lower…

Let $\Gamma_n$ be an $n\times n$ Haar-invariant orthogonal matrix. Let $ Z_n$ be the $p\times q$ upper-left submatrix of $\Gamma_n,$ where $p=p_n$ and $q=q_n$ are two positive integers. Let $G_n$ be a $p\times q$ matrix whose $pq$ entries…

We study the problem of approximating the total variation distance between two mixtures of product distributions over an $n$-dimensional discrete domain. Given two mixtures $\mathbb{P}$ and $\mathbb{Q}$ with $k_1$ and $k_2$ product…

Total variation distance (TV distance) is a fundamental notion of distance between probability distributions. In this work, we introduce and study the problem of computing the TV distance of two product distributions over the domain…

We show that computing the total variation distance between two product distributions is $\#\mathsf{P}$-complete. This is in stark contrast with other distance measures such as Kullback-Leibler, Chi-square, and Hellinger, which tensorize…

We give an easy counter-example to Problem 7.20 from C. Villani's book on mass transport: in general, the quadratic Wasserstein distance between $n$-fold normalized convolutions of two given measures fails to decrease monotonically.

Let $f_n$ be a random polynomial of degree $n\ge 2$ whose coefficients are independent and identically distributed random variables. We study the separation distances between roots of $f_n$ and prove that the set of these distances,…

We introduce the random graph $\mathcal{P}(n,q)$ which results from taking the union of two paths of length $n\geq 1$, where the vertices of one of the paths have been relabelled according to a Mallows permutation with parameter $0<q(n)\leq…

We consider some general facts concerning convergence P_{n}-Q_{n}\to 0 as n\to \infty, where P_{n} and Q_{n} are probability measures in a complete separable metric space. The main point is that the sequences {P_{n}} and {Q_{n}} are not…

Consider a random polynomial $Q_n$ of degree $n+1$ whose zeroes are i.i.d. random variables $\xi_0,\xi_1,\ldots,\xi_n$ in the complex plane. We study the pairing between the zeroes of $Q_n$ and its critical points, i.e. the zeroes of its…

We consider two independent q-Gaussian random variables X and Y and a function f chosen in such a way that f(X) and X have the same distribution. For 0 < q < 1 we find that at least the fourth moments of X + Y and f(X) + Y are different. We…

We obtain some new results concerning the small deviation problem for $S=\sum_n q^n X_n$ and $M=\sup_n q^n X_n$, where $0<q<1$ and $(X_n)$ are i.i.d. non-negative random variables. In particular, the asymptotics is shown to be the same for…

Let $V$ be an $n$-dimensional vector space over the finite field consisting of $q$ elements and let $\Gamma_{k}(V)$ be the Grassmann graph formed by $k$-dimensional subspaces of $V$, $1<k<n-1$. Denote by $\Gamma(n,k)_{q}$ the restriction of…

We study the total variation distance (TV) between two $n$-fold Bernoulli product measures parametrized by $\vec p=(p_1,\ldots,p_n)$ and $\vec q=(q_1,\ldots,q_n)$, respectively, in the \emph{tiny} and \emph{small} regimes. In the tiny…

We study the problems of identity and closeness testing of $n$-dimensional product distributions. Prior works by Canonne, Diakonikolas, Kane and Stewart (COLT 2017) and Daskalakis and Pan (COLT 2017) have established tight sample complexity…

We prove a $pre$-$asymptotic$ bound on the total variation distance between the uniform distribution over two types of undirected graphs with $n$ nodes. One distribution places a prescribed number of $k_T$ triangles and $k_S$ edges not…

Suppose that $\xi^{(n)}_1,\xi^{(n)}_2,...,\xi^{(n)}_n$ are i.i.d with $P(\xi^{(n)}_i=1)=p_n=1-P(\xi^{(n)}_i=0)$. Let $U^{(n)}$ and $W^{(n)}$ be the longest length of arithmetic progressions and of arithmetic progressions mod $n$ relative to…

In this work, we continue the line of research on the complexity of distributions (Viola, Journal of Computing 2012), and study samplers defined by low degree polynomials. An $n$-tuple $P = (P_1,\dots, P_n)$ of functions $P_i \colon…

A widely studied model for generating sequences is to ``evolve'' them on a tree according to a symmetric Markov process. We prove that model trees tend to be maximally ``far apart'' in terms of variational distance.

We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…