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

We present an assessment of the distance in total variation of \textit{arbitrary} collection of prime factor multiplicities of a random number in $[n]=\{1,\dots, n\}$ and a collection of independent geometric random variables. More…

Let $f(N)$ denote the least integer $k$ such that, if $G$ is an abelian group of order $N$ and $A \subseteq G$ is a uniformly random $k$-element subset, then with probability at least $\tfrac12$ the subset-sum set $\{ \sum_{x \in S} x : S…

In the present work we use maximum entropy methods to derive several theorems in probabilistic number theory, including a version of the Hardy-Ramanujan Theorem. We also provide a theoretical argument explaining the experimental…

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

It is well known that the independence of the sample mean and the sample variance characterizes the normal distribution. By using Anosov's theorem, we further investigate the analogous characteristic properties in terms of the sample mean…

We consider first passage percolation on the Erd\H{o}s--R\'{e}nyi graph with $n$ vertices in which each pair of distinct vertices is connected independently by an edge with probability $\lambda/n$ for some $\lambda>1$. The edges of the…

In this article, we consider the following family of random trigonometric polynomials $p_n(t,Y)=\sum_{k=1}^n Y_{k,1} \cos(kt)+Y_{k,2}\sin(kt)$ for a given sequence of i.i.d. random variables $\{Y_{k,1},Y_{k,2}\}_{k\ge 1}$ which are centered…

Estimating the normalizing constant of an unnormalized probability distribution has important applications in computer science, statistical physics, machine learning, and statistics. In this work, we consider the problem of estimating the…

The stage of evolution is the population of reproducing individuals. The structure of the population is know to affect the dynamics and outcome of evolutionary processes, but analytical results for generic random structures have been…

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

One of the main concepts in quantum physics is a density matrix, which is a symmetric positive definite matrix of trace one. Finite probability distributions can be seen as a special case when the density matrix is restricted to be…

We provide an elementary proof for a theorem due to Petz and R\'effy which states that for a random $n\times n$ unitary matrix with distribution given by the Haar measure on the unitary group U(n), the upper left (or any other) $k\times k$…

The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong…

This paper deals with the problem of quantifying the approximation a probability measure by means of an empirical (in a wide sense) random probability measure, depending on the first n terms of a sequence of random elements. In Section 2,…

The Ewens-Pitman model defines a distribution on random partitions of $\{1,\ldots,n\}$, with parameters $\alpha \in [0,1)$ and $\theta > -\alpha$; the case $\alpha=0$ reduces to the classical Ewens model from population genetics. We…

We study the full distribution $P_{N}\left(A\right)$ of sums $A = \sum_{i=1}^N$ where $x_1, \dots, x_N$ are $N \gg 1$ independent and identically distributed random variables each sampled from a given distribution $p(x)$ with a…

For regularized distributions we establish stability of the characterization of the normal law in Cramer's theorem with respect to the total variation norm and the entropic distance. As part of the argument, Sapogov-type theorems are…

We prove that $\frac{\log n}{n}$ is the sharp threshold for universality of the distribution of cokernels of random matrices over $\mathbb{Z}_p$. More precisely, let $\alpha_n = \frac{c\log n}{n}$ for a constant $c>0$ and let $A(n)$ be an…

Let $P(n)$ be the probability that two independent, uniformly random permutations of $[n]$ have the same order, and let $K(n)$ be the probability that they are in the same conjugacy class. Answering a question of Thibault Godin, we prove…

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1917, Hardy and Ramanujan proved that $\omega(n)$ has normal order $\log \log n$ over naturals. In this work, we establish the first and the second…