相关论文: A Generalization of the Erd\H{o}s-Kac Theorem

In 2020, Bergelson and Richter gave a dynamical generalization of the classical Prime Number Theorem, which has been generalized by Loyd in a disjoint form with the Erd\H{o}s-Kac Theorem. These generalizations reveal the rich ergodic…

The famous \emph{circular law} asserts that if $M_n$ is an $n \times n$ matrix with iid complex entries of mean zero and unit variance, then the empirical spectral distribution (ESD) of the normalized matrix $\frac{1}{\sqrt{n}} M_n$…

Let $\{X_{n}, n\ge 1\}$ be a sequence of independent random variables with common general error distribution $GED(v)$ with shape parameter $v>0$, and let $M_{n,r}$ denote the $r$th largest order statistics of $X_{1}, X_{2}, \cdots, X_{n}$.…

Stochastic processes play a key role for modeling a huge variety of transport problems out of equilibrium, with manifold applications throughout the natural and social sciences. To formulate models of stochastic dynamics the conventional…

We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…

We consider a number $\nu_n$ of components in a random graph $G(n,p)$ with $n$ vertices, where the probability of an edge is equal to $p$. By operating with special generating functions we shows the next asymptotic relation for factorial…

This paper introduces a new generalized polynomial chaos expansion (PCE) comprising measure-consistent multivariate orthonormal polynomials in dependent random variables. Unlike existing PCEs, whether classical or generalized, no…

We consider ensembles of random polynomials of the form $p(z)=\sum_{j = 1}^N a_j P_j$ where $\{a_j\}$ are independent complex normal random variables and where $\{P_j\}$ are the orthonormal polynomials on the boundary of a bounded simply…

Every element $\theta=(\theta_1,\ldots,\theta_n)$ of the probability $n$-simplex induces a probability distribution $P_\theta$ of a random variable $X$ that can assume only a finite number of real values $x_1 < \cdots < x_n$ by defining…

Erd\"os conjectured that the set J of limit points of d_n/logn contains all nonnegative numbers, where d_n denotes the nth primegap. The author proved a year ago (arXiv: 1305.6289) that J contains an interval of type [0,c] with a positive…

The Katz centrality of a node in a complex network is a measure of the node's importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like and undirected random graphs, this observable is…

Let $n$ be a sufficiently large natural number and let $B$ be an origin-symmetric convex body in $R^n$ in the $\ell$-position, and such that the normed space $(R^n,\|\cdot\|_B)$ admits a $1$-unconditional basis. Then for any…

Given an integer $k\ge2$, let $\omega_k(n)$ denote the number of primes that divide $n$ with multiplicity exactly $k$. We compute the density $e_{k,m}$ of those integers $n$ for which $\omega_k(n)=m$ for every integer $m\ge0$. We also show…

Motivated by an application in community detection, we consider an \ER random graph conditioned on the rare event that all connected components are fully connected. Such graphs can be considered as partitions of vertices into cliques.…

We establish large deviation formulas for linear statistics on the $N$ transmission eigenvalues $\{T_i\}$ of a chaotic cavity, in the framework of Random Matrix Theory. Given any linear statistics of interest $A=\sum_{i=1}^N a(T_i)$, the…

Let $\omega(n)$ (resp. $\Omega(n)$) denote the number of prime divisors (resp. with multiplicity) of a natural number $n$. In 1917, Hardy and Ramanujan proved that the normal order of $\omega(n)$ is $\log\log n$, and the same is true of…

We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…

Let $\Omega(n)$ denote the number of prime factors of a positive integer $n$ counted with multiplicities. We show that for any bounded functions $a,b\colon\mathbb{N}\to\mathbb{C}$, $$\frac{1}{\log{N}}\sum_{n=1}^N…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly…