Related papers: Asymptotic normality and greatest common divisors
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…
For a grand canonical ensemble of classical point-like particles at equilibrium in continuous space we investigate the functional relationship between a stable and regular pair potential describing the interaction of the particles and the…
Investigation of divisibility properties of natural numbers is one of the most important themes in the theory of numbers. Various tools have been developed over the centuries to discover and study the various patterns in the sequence of…
We consider a class of sparse random matrices, which includes the adjacency matrix of Erd\H{o}s-R\'enyi graph ${\bf G}(N,p)$. For $N^{-1+o(1)}\leq p\leq 1/2$, we show that the non-trivial edge eigenvectors are asymptotically jointly normal.…
The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the…
The asymptotic normality for a large family of eigenvalue statistics of a general sample covariance matrix is derived under the ultra-high dimensional setting, that is, when the dimension to sample size ratio $p/n \to \infty$. Based on this…
In the past decades, the central limit theorem (CLT) has been generalized to non-Euclidean data spaces. Some years ago, it was found that for some random variables on the circle, the sample Fr\'echet mean fluctuates around the population…
We investigate asymptotic behaviour of probabilities of large deviations for normalized combinatorial sums. We find a zone in which these probabilities are equivalent to the tail of the standard normal law. Our conditions are similar to the…
We study upper bounds for the counting function of common zeros of two meromorphic functions in various contexts. The proofs and results are inspired by recent work involving greatest common divisors in Diophantine approximation, to which…
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…
For the family of multivariate probability distributions variously denoted as unified skew-normal, closed skew-normal and other names, a number of properties are already known, but many others are not, even some basic ones. The present…
We prove that in many realistic cases, the ordinary sample mean after a group sequential trial is asymptotically normal if the maximal number of observations increases. We derive that it is often safe to use naive confidence intervals for…
Geometric properties of $N$ random points distributed independently and uniformly on the unit sphere $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ with respect to surface area measure are obtained and several related conjectures are posed. In…
Some properties of integral averages of functions on intervals and their asymptotic behavior are investigated. The results are aimed at applications to entire and subharmonic functions.
Certain extremum estimators have asymptotic distributions that are non-Gaussian, yet characterizable as the distribution of the $\argmax$ of a Gaussian process. This paper presents high-level sufficient conditions under which such…
Let $G$ be a simple undirected graph. The regular number of $G$ is defined to be the minimum number of subsets into which the edge set of $G$ can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain…
We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to…
The asymptotic behavior of the Jaccard index in $G(n,p)$, the classical Erd\"{o}s-R\'{e}nyi random graphs model, is studied in this paper, as $n$ goes to infinity. We first derive the asymptotic distribution of the Jaccard index of any pair…
We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…
We say A is a quasi-normal subgroup of the group G if the commensurator of A in G is all of G. We develop geometric versions of commensurators in finitely generated groups. In particular, g is an element of the commensurator of A in G iff…