Related papers: On irreducible central limit theorems

This paper is concerned with normal approximation under relaxed moment conditions using Stein's method. We obtain the explicit rates of convergence in the central limit theorem for (i) nonlinear statistics with finite absolute moment of…

Let $C$ be a complex, reduced, locally planar curve. We extend the results of Rennemo arXiv:1308.4104 to reducible curves by constructing an algebra $A$ acting on $V=\bigoplus_{n\geq 0} H_*(C^{[n]}, \mathbb{Q})$, where $C^{[n]}$ is the…

We prove a Berry-Esseen bound in de Jong's classical CLT for normalized, completely degenerate $U$-statistics, which says that the convergence of the fourth moment sequence to three and a Lindeberg-Feller type negligibility condition are…

Extending a previous result of the first two authors, we prove a local limit theorem for the joint distribution of subgraph counts in the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$. This limit can be described as a nonlinear transformation…

We generalize ultraproducts and local-global limits of graphs to hypergraphs and other structures. We show that the local statistics of an ultraproduct of a sequence of hypergraphs are the ultralimits of the local statistics of the…

We study the error of the number of points of a unimodular lattice that fall in a strictly convex and analytic set having the origin and that is dilated by a factor $t$. The aim is to generalize the result of a previous article. We first…

We show that when a spacetime $\mathcal{M}(=M \cup \partial M)$ is globally hyperbolic with (possibly empty) smooth timelike boundary $\partial M$, a metrizable topology, the closed limit topology (CLT) introduced by F. Hausdorff himself in…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…

We exploit an identity for the gradients of Laplacian eigenfunctions on compact homogeneous Riemannian manifolds with irreducible linear isotropy group to obtain asymptotically sharp universal eigenvalue inequalities and sharp Weyl bounds…

We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…

We propose a generalisation of the Cameron-Erdos conjecture for sum-free sets to arbitrary non-translation invariant linear equations over Z in three or more variables and, using well-known methods from graph theory, prove a weak form of…

We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…

A Chung-Lu random graph is an inhomogeneous Erd\H{o}s-R\'enyi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their…

We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…

We show a Talagrand-type concentration inequality for Multi-Task Learning (MTL), using which we establish sharp excess risk bounds for MTL in terms of distribution- and data-dependent versions of the Local Rademacher Complexity (LRC). We…

The "typical" asymptotic behavior of the weighted sums of independent, identically distibuted random vectors in k-dimensional space is considered. It is shown that under finitnes of fifth absolute moment of an individual term the rate of…

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

The idea that the cohomology of finite groups might be fruitfully approached via the cohomology of ambient semisimple algebraic groups was first shown to be viable in the papers [CPS75] and [CPSvdK77]. The second paper introduced, through a…