Related papers: $L_p$ regular sparse hypergraphs: box norms

We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular partitions of sparse hypergraphs. We also prove a corresponding…

We present a new approach to graph limit theory which unifies and generalizes the two most well developed directions, namely dense graph limits (even the more general $L^p$ limits) and Benjamini--Schramm limits (even in the stronger…

We study topological and geometric functionals of $l_\infty$-random geometric graphs on the high-dimensional torus in a sparse regime, where the expected number of neighbors decays exponentially in the dimension. More precisely, we…

We revisit Haagerup's enigmatic reduction theorem \cite[Theorems 2.1 \& 3.1]{HJX} showing how that theorem may be extended to general von Neumann algebras $\M$ equipped with an arbitrary faithful normal semifinite weight in a manner which…

We present some results concerning the $l^p$ norms of weighted mean matrices. These results can be regarded as analogues to a result of Bennett concerning weighted Carleman's inequalities.

We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of the results from [L. Lov\'asz, B.…

In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…

We study some structural aspects of the subspaces of the non-commutative (Haagerup) L_p-spaces associated with a general (non necessarily semi-finite) von Neumann algebra A. If a subspace X of L_p(A) contains uniformly the spaces \ell_p^n,…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

This paper aims to examine the characteristics of the posterior distribution of covariance/precision matrices in a "large $p$, large $n$" scenario, where $p$ represents the number of variables and $n$ is the sample size. Our analysis…

We investigate the emergence of spanning structures in sparse pseudo-random $k$-uniform hypergraphs, using the following comparatively weak notion of pseudo-randomness. A $k$-uniform hypergraph $H$ on $n$ vertices is called…

In this paper, we give constructions of strongly regular Cayley graphs and skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and our results generalize ten of the eleven sporadic…

We prove a new, efficient version of the hypergraph container theorems that is suited for hypergraphs with large uniformities. The main novelty is a refined approach to constructing containers that employs simple ideas from high-dimensional…

Using the theory of $L^p$-graphons (Borgs et al, 2014), we derive and rigorously justify the continuum limit for systems of differential equations on sparse random graphs. Specifically, we show that the solutions of the initial value…

We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex…

In this article, we present the first half of our project on the Iwasawa theory of higher rank Galois deformations over deformations rings of arbitrary dimension. We develop a theory of Coleman maps for a very general class of coefficient…

This article gives an overview of the emerging literature on large deviations for random graphs. Written for the general mathematical audience, the article begins with a short introduction to the theory of large deviations. This is followed…

Diffusion kernels over graphs have been widely utilized as effective tools in various applications due to their ability to accurately model the flow of information through nodes and edges. However, there is a notable gap in the literature…

Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…

We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements, and a new…