相关论文: On Maximal Correlation, Hypercontractivity, and th…

We study the maximal correlation coefficient $R(X,Y)$ between two stochastic processes $X$ and $Y$. In the case when $(X,Y)$ is a random walk, we find $R(X,Y)$ using the Cs\'{a}ki-Fischer identity and the lower semicontinuity of the map…

A measure of correlation is said to have the tensorization property if it is unchanged when computed for i.i.d.\ copies. More precisely, a measure of correlation between two random variables $(X, Y)$ denoted by $\rho(X, Y)$, has the…

The Hirschfeld-Gebelein-R\'{e}nyi (HGR) maximal correlation and the corresponding functions have been shown useful in many machine learning scenarios. In this paper, we study the sample complexity of estimating the HGR maximal correlation…

The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a connection between this bound and the fact that correlations between two systems cannot increase under local operations, a property known as the…

We provide necessary and sufficient conditions for hypercontractivity of the minima of nonnegative, i.i.d. random variables and of both the maxima of minima and the minima of maxima for such r.v.'s. It turns out that the idea of…

The maximal (or Hilbertian) correlation coefficient between two random variables X and Y, denoted by \{X:Y\}, is the supremum of the |Corr(f(X),g(Y))| for real measurable functions f, g, where "Corr" denotes Pearson's correlation…

For a general Dirichlet series $\sum a_n e^{-\lambda_n s}$ with frequency $\lambda=(\lambda_n)_n$, we study how horizontal translation (i.e. convolution with a Poisson kernel) improves its integrability properties. We characterize…

We introduce the maximal correlation coefficient $R(M_1,M_2)$ between two noncommutative probability subspaces $M_1$ and $M_2$ and show that the maximal correlation coefficient between the sub-algebras generated by $s_n:=x_1+\ldots +x_n$…

We consider the following non-interactive simulation problem: Alice and Bob observe sequences $X^n$ and $Y^n$ respectively where $\{(X_i, Y_i)\}_{i=1}^n$ are drawn i.i.d. from $P(x,y),$ and they output $U$ and $V$ respectively which is…

We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\H{o}s-R\'enyi (ER) graphs. For a pair of correlated graphs on the same vertex set, the correspondence between the vertices can be obscured…

Correlation analysis is a fundamental problem in statistics. In this paper, we consider the correlation detection problem between a pair of Erdos-Renyi graphs. Specifically, the problem is formulated as a hypothesis testing problem: under…

This paper studies the problem of recovering the hidden vertex correspondence between two correlated random graphs. We propose the partially correlated Erd\H{o}s-R\'enyi graphs model, wherein a pair of induced subgraphs with a certain…

We investigate the extreme values of a sparse and equicorrelated Gaussian field on a triangle: the correlations on every vertical or horizontal line are all equal to a parameter $r \in [0,1/2]$ and are zero everywhere else. This problem is…

We show that correlation functions have to satisfy contraint relations, owing to the non-negativity of the power spectrum of the underlying random process. Specifically, for any statistically homogeneous and (for more than one spatial…

The maximum correlation of functions of a pair of random variables is an important measure of stochastic dependence. It is known that this maximum nonlinear correlation is identical to the absolute value of the Pearson correlation for a…

Based on the notion of maximal correlation, Kimeldorf, May and Sampson (1980) introduce a measure of correlation between two random variables, called the "concordant monotone correlation" (CMC). We revisit, generalize and prove new…

Given low order moment information over the random variables $\mathbf{X} = (X_1,X_2,\ldots,X_p)$ and $Y$, what distribution minimizes the Hirschfeld-Gebelein-R\'{e}nyi (HGR) maximal correlation coefficient between $\mathbf{X}$ and $Y$,…

The hypergraph Moore bound is an elegant statement that characterizes the extremal trade-off between the girth - the number of hyperedges in the smallest cycle or even cover (a subhypergraph with all degrees even) and size - the number of…

Consider a nonuniformly hyperbolic map $ T $ modelled by a Young tower with tails of the form $ O(n^{-\beta}) $, $ \beta>2 $. We prove optimal moment bounds for Birkhoff sums $ \sum_{i=0}^{n-1}v\circ T^i $ and iterated sums $ \sum_{0\le…

This article investigates the phenomenon of maximal rigidity in spatial processes, where perfect interpolation of the process is possible from partial information, specifically, from its restriction to a strict subdomain, often resulting in…