Related papers: On Maximal Correlation, Hypercontractivity, and th…
In this paper, we consider the hypothesis testing of correlation between two $m$-uniform hypergraphs on $n$ unlabelled nodes. Under the null hypothesis, the hypergraphs are independent, while under the alternative hypothesis, the hyperdges…
We introduce a new paradigm, $\textit{measure synchronization}$, for synchronizing graphs with measure-valued edges. We formulate this problem as maximization of the cycle-consistency in the space of probability measures over relative…
We resolve a folklore problem of determining the optimal hypercontractive constants $r_{p,q}(\mathbb{Z}_3)$ for the cyclic group $\mathbb{Z}_3$ for all $1 < p < q < \infty$. More precisely, we have \[ r_{p,q}(\mathbb{Z}_3) = \frac{(1 +…
Given two jointly distributed random variables $(X,Y)$, a functional representation of $X$ is a random variable $Z$ independent of $Y$, and a deterministic function $g(\cdot, \cdot)$ such that $X=g(Y,Z)$. The problem of finding a minimum…
We investigate percolation on growing networks where the evolution of connected components resembles a non-equilibrium version of the multiplicative coalescent. The supercritical $\pi> \pi_c$ regime for a host of such models was conjectured…
We investigate perfect matchings and essential spanning forests in planar hyperbolic graphs via circle packings. We prove the existence of nonconstant harmonic Dirichlet functions that vanish in a closed set of the boundary, generalizing a…
Let X=(V, E) be a digraph. X is maximally connected, if \kappa(X)=\delta(X). X is maximally arc-connected, if \lambda(X)=\delta(X). And X is super arc-connected, if every minimum arc-cut of X is either the set of inarcs of some vertex or…
The present paper is a follow up of our paper \cite{nS}. We investigate here the maximization of higher order eigenvalues in a conformal class on a smooth compact boundaryless Riemannian surface. Contrary to the case of the first nontrivial…
In the zero-error Slepian-Wolf source coding problem, the optimal rate is given by the complementary graph entropy $\overline{H}$ of the characteristic graph. It has no single-letter formula, except for perfect graphs, for the pentagon…
A graph $G$ percolates in the $K_{r,s}$-bootstrap process if we can add all missing edges of $G$ in some order such that each edge creates a new copy of $K_{r,s}$, where $K_{r,s}$ is the complete bipartite graph. We study…
We study decay of correlations, the asymptotic distribution of hitting times and fluctuations of the return times for a robust class of multidimensional non-uniformly hyperbolic transformations. Oliveira and Viana [15] proved that there is…
We prove optimal concentration of measure for lifted functions on high dimensional expanders (HDX). Let $X$ be a $k$-dimensional HDX. We show for any $i\leq k$ and $f:X(i)\to [0,1]$: \[\Pr_{s\in X(k)}\left[\left|\underset{{t\subseteq…
Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson. Although the optimization and decision variants of finding connected vertex covers of minimum size or…
We prove an almost optimal hypercontractive inequality for products of quantum erasure channels, generalizing the hypercontractivity for classical binary erasure channels. To our knowledge, this is the first tensorization-type…
We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…
Rigidity Percolation with g degrees of freedom per site is analyzed on randomly diluted Erdos-Renyi graphs with average connectivity gamma, in the presence of a field h. In the (gamma,h) plane, the rigid and flexible phases are separated by…
We study the problem of maximizing R{\'e}nyi entropy of order $2$ (equivalently, minimizing the index of coincidence) over the set of joint distributions with prescribed marginals. A closed-form optimizer is known under a feasibility…
This work studies fundamental limits for recovering the underlying correspondence among multiple correlated graphs. In the setting of inhomogeneous random graphs, we present and analyze a matching algorithm: first partially match the graphs…
Let $\mathcal{C}(S_{g,p})$ denote the curve complex of the closed orientable surface of genus $g$ with $p$ punctures. Masur-Minksy and subsequently Bowditch showed that $\mathcal{C}(S_{g,p})$ is $\delta$-hyperbolic for some…
The goal of this work is to obtain optimal rates for the convergence problem in mean field control. Our analysis covers cases where the solutions to the limiting problem may not be unique nor stable. Equivalently the value function of the…