Related papers: $L_p$ regular sparse hypergraphs: box norms
In this paper a new result of recovery of sparse vectors from deterministic and noisy measurements by l1 minimization is given. The sparse vector is randomly chosen and follows a generic p-sparse model introduced by Candes and al. The main…
Given a fixed $k$-uniform hypergraph $F$, the $F$-removal lemma states that every hypergraph with few copies of $F$ can be made $F$-free by the removal of few edges. Unfortunately, for general $F$, the constants involved are given by…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…
Given a $d$-tuple $T$ of commuting contractions on Hilbert space and a polynomial $p$ in $d$-variables, we seek upper bounds for the norm of the operator $p(T)$. Results of von Neumann and And\^o show that if $d=1$ or $d=2$, the upper bound…
We prove an inverse theorem for the Gowers $U^2$-norm for maps $G\to\mathcal M$ from an countable, discrete, amenable group $G$ into a von Neumann algebra $\mathcal M$ equipped with an ultraweakly lower semi-continuous, unitarily invariant…
On any complete Riemannian manifold $M$ and for all $p\in [2,\infty)$, we prove a family of second order $L^{p}$-interpolation inequalities that arise from the following simple $L^{p}$-estimate valid for every $u \in C^{\infty}(M)$: $$…
We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…
For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…
We define Leavitt path algebras of hypergraphs generalizing simultaneously Leavitt path algebras of finitely separated graphs and Leavitt path algebras of row-finite vertex-weighted graphs. We find linear bases for those algebras, compute…
We prove a general transfer theorem for multivariate random sequences with independent random indexes in the double array limit setting. We also prove its partial inverse providing necessary and sufficient conditions for the convergence of…
Regularization using the L0 pseudo-norm is a common approach to promote sparsity, with widespread applications in machine learning and signal processing. However, solving such problems is known to be NP-hard. Recently, the L0 Bregman…
The minimum number of observations such that the maximum likelihood estimator in a Gaussian graphical model exists with probability one is called the maximum likelihood threshold of the underlying graph G. The natural algebraic relaxation…
Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…
We introduce a general framework for studying anticoncentration and local limit theorems for random variables, including graph statistics. Our methods involve an interplay between Fourier analysis, decoupling, hypercontractivity of Boolean…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…
Attention has been brought to the possibility that statistical fluctuation properties of several complex spectra, or, well-known number sequences may display strong signatures that the Hamiltonian yielding them as eigenvalues is…
The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…
This paper develops several average-case reduction techniques to show new hardness results for three central high-dimensional statistics problems, implying a statistical-computational gap induced by robustness, a detection-recovery gap and…