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

The Zygmund vector field maximal function conjecture is a long-standing open problem. This paper establishes a new boundedness criterion that significantly weakens the existing conditions in the literature. Specifically, the required decay…

We study correlation decay for the maximum weight matching problem on sparse graphs with i.i.d. edge weights. We show exponential decay of correlations when the underlying graphs are locally tree-like with uniformly bounded degree and the…

We study mixing of the Metropolis algorithm for a distribution on the hypercube that corresponds to the Erd\H{o}s-R\'enyi random graph with edge probability p. This Markov chain has cutoff at max{p,1-p} n log n with window size n, a result…

Let $X,Y$ be jointly Gaussian vectors, and consider random variables $U,V$ that satisfy the Markov constraint $U-X-Y-V$. We prove an extremal inequality relating the mutual informations between all ${4 \choose 2}$ pairs of random variables…

We characterize two of the most studied non-uniform hyperbolicity conditions for rational maps, semi-hyperbolicity and the topological Collet-Eckmann condition, in terms of the maximal entropy measure. Using the same tools in the proof of…

This paper establishes the exact strong converse exponent of the soft covering problem in the classical setting. This exponent characterizes the slowest achievable convergence speed of the total variation to one when a code of rate below…

A maximal inequality is an inequality which involves the (absolute) supremum $\sup_{s\leq t}|X_{s}|$ or the running maximum $\sup_{s\leq t}X_{s}$ of a stochastic process $(X_t)_{t\geq 0}$. We discuss maximal inequalities for several classes…

A data processing inequality states that the quantity of shared information between two entities (e.g. signals, strings) cannot be significantly increased when one of the entities is processed by certain kinds of transformations. In this…

The geometry of Arithmetic Random Waves has been extensively investigated in the last fifteen years, starting from the seminal papers [RW08, ORW08]. In this paper we study the correlation structure among different functionals such as nodal…

In a graph $G=(V,E)$, a bisection $(X,Y)$ is a partition of $V$ into sets $X$ and $Y$ such that $|X|\le |Y|\le |X|+1$. The size of $(X,Y)$ is the number of edges between $X$ and $Y$. In the Max Bisection problem we are given a graph…

We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute…

A model of correlated random networks is examined, i.e. networks with correlations between the degrees of neighboring nodes. These nodes do not necessarily have to be direct neighbors, the maximum range of the correlations can be…

Networks (graphs) permeate scientific fields such as biology, social science, economics, etc. Empirical studies have shown that real-world networks are often heterogeneous, that is, the degrees of nodes do not concentrate on a number.…

In this paper, we study the asymptotic behavior of radial extremal functions to an inequality involving Hardy potential and critical Sobolev exponent. Based on the asymptotic behavior at the origin and the infinity, we shall deduce a strict…

We are interested in investigating the statistical properties of extreme values for strongly correlated variables. The starting motivation is to understand how the strong-correlation properties of power-law distributed processes affect the…

We tighten the Entropy Power Inequality (EPI) when one of the random summands is Gaussian. Our strengthening is closely connected to the concept of strong data processing for Gaussian channels and generalizes the (vector extension of)…

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

We prove hypercontractive inequalities on high dimensional expanders. As in the settings of the p-biased hypercube, the symmetric group, and the Grassmann scheme, our inequalities are effective for global functions, which are functions that…

We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…

A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…