Related papers: Central limit theorems for the Euler characteristi…

We prove a central limit theorem for a sequence of random variables whose means are ambiguous and vary in an unstructured way. Their joint distribution is described by a set of measures. The limit is (not the normal distribution and is)…

Random features models play a distinguished role in the theory of deep learning, describing the behavior of neural networks close to their infinite-width limit. In this work, we present a thorough analysis of the generalization performance…

We consider a finite simplicial complex $K$ together with its successive barycentric subdivisions $Sd^d(K), d\geq0,$ and study the expected topology of a random subcomplex in $Sd^d(K), d\gg0$. We get asymptotic upper and lower bounds for…

Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…

We consider generalized inversions and descents in finite Weyl groups. We establish Coxeter-theoretic properties of indicator random variables of positive roots such as the covariance of two such indicator random variables. We then compute…

We prove the Central Limit Theorem for finite-dimensional vectors of linear eigenvalue statistics of submatrices of Wigner random matrices under the assumption that test functions are sufficiently smooth. We connect the asymptotic…

We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…

We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…

We consider sequences of needlet random fields defined as weighted averaged forms of spherical Gaussian eigenfunctions. Our main result is a Central Limit Theorem in the high energy setting, for the boundary lengths of their excursion sets.…

Inspired by the Erd\H{o}s R\'enyi model, we propose a new model for freesquare random monomial ideals generated by edges and covers of a graph. This permit us to investigate the conditions of normality for which we obtain asymptotic…

We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We…

Let $\{X_n, n \ge 1\}$ be a sequence of stationary associated random variables. We discuss another set of conditions under which a central limit theorem for U-statistics based on $\{X_n, n \ge 1\}$ holds. We look at U-statistics based on…

Exponential random graph models (ERGMs), also known as p* models, have been utilized extensively in the social science literature to study complex networks and how their global structure depends on underlying structural components. However,…

Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of random monomial ideals. We prove theorems about the…

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…

Performing statistical analyses on collections of graphs is of import to many disciplines, but principled, scalable methods for multi-sample graph inference are few. Here we describe an "omnibus" embedding in which multiple graphs on the…

A central limit theorem is proved for some strictly stationary sequences of random variables that satisfy certain mixing conditions and are subjected to the "shrinking operators" $U_r(x):=[\max\{|x|-r,0\}]\cdot x/|x|,\ r \ge 0$. For…

The growing availability of network data and of scientific interest in distributed systems has led to the rapid development of statistical models of network structure. Typically, however, these are models for the entire network, while the…

We prove a central limit theorem for smooth linear statistics associated with zero divisors of standard Gaussian holomorphic sections in a sequence of holomorphic line bundles with Hermitian metrics of class $\mathscr{C}^{3}$ over a compact…