Related papers: On Maximal Correlation, Hypercontractivity, and th…

The hypercontractive inequality on the discrete cube plays a crucial role in many fundamental results in the Analysis of Boolean functions, such as the KKL theorem, Friedgut's junta theorem and the invariance principle. In these results the…

We prove a homogeneous, quantitative version of Ehrling's inequality for the function spaces $H^1(\Omega)\subset\subset L^2(\partial\Omega)$, $H^1(\Omega)\hookrightarrow L^2(\Omega)$ which reflects geometric properties of a given…

A class of examples concerning the relationship of linear regression and maximal correlation is provided. More precisely, these examples show that if two random variables have (strictly) linear regression on each other, then their maximal…

This work provides data-processing and majorization inequalities for $f$-divergences, and it considers some of their applications to coding problems. This work also provides tight bounds on the R\'{e}nyi entropy of a function of a discrete…

For critical bond-percolation on high-dimensional torus, this paper proves sharp lower bounds on the size of the largest cluster, removing a logarithmic correction in the lower bound in Heydenreich and van der Hofstad (2007). This…

Young's convolution inequality provides an upper bound for the convolution of functions in terms of $L^p$ norms. It is known that for certain groups, including Heisenberg groups, the optimal constant in this inequality is equal to that for…

We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…

We are concerned with the optimal constants: in the Korn inequality under tangential boundary conditions on bounded sets $\Omega \subset \mathbb{R}^n$, and in the geometric rigidity estimate on the whole $\mathbb{R}^2$. We prove that the…

We study the maximum dimension $d=d(n,p)$ for which an Erd\H{o}s-R\'enyi $G(n,p)$ random graph is $d$-rigid. Our main results reveal two different regimes of rigidity in $G(n,p)$ separated at $p_c=C_*\log n/n,~C_*=2/(1-\log 2)$ -- the point…

For fixed $r\geq 2$, we consider bootstrap percolation with threshold $r$ on the Erd\H{o}s-R\'enyi graph ${\cal G}_{n,p}$. We identify a threshold for $p$ above which there is with high probability a set of size $r$ which can infect the…

The problem of detecting edge correlation between two Erd\H{o}s-R\'enyi random graphs on $n$ unlabeled nodes can be formulated as a hypothesis testing problem: under the null hypothesis, the two graphs are sampled independently; under the…

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential…

We consider skew-products with concave interval fiber maps over a certain subshift obtained as the projection of orbits staying in a given region. It generates a new type of (essentially) coded shift. The fiber maps have expanding and…

Strong data processing inequalities (SDPI) are an important object of study in Information Theory and have been well studied for $f$-divergences. Universal upper and lower bounds have been provided along with several applications,…

Succinct representations of a graph have been objects of central study in computer science for decades. In this paper, we study the operation called \emph{Distance Preserving Graph Contractions}, which was introduced by Bernstein et al.…

We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…

For independent random variables $(X_i)_{1\leq i\leq n}$, we consider the maximal correlation coefficient $R=R(\min_{i:1\leq i\leq m}X_i,\min_{j:\ell+1\leq j\leq n}X_j)$. If $X_1,X_2,\ldots,X_n$ are identically distributed with the same…

Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…

We propose a coefficient that measures dependence in paired samples of functions. It has properties similar to the Pearson correlation, but differs in significant ways: (i) it is designed to measure dependence between curves, (ii) it…

In this paper we prove the first quantitative convergence rates for the graph infinity Laplace equation for length scales at the connectivity threshold. In the graph-based semi-supervised learning community this equation is also known as…