相关论文: Expected number of distinct part sizes in a random…

We compute an asymptotic expansion with precision 1/n of the moments of the expected empirical spectral measure of Wigner matrices of size n with independent centered entries. We interpret this expansion as the moments of the addition of…

Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…

For a random partition, one of the most basic questions is: what can one expect about the parts which arise? For example, what is the distribution of the parts of random partitions modulo $N$? Since most partitions contain a $1$, and indeed…

Rejection sampling is a popular method used to generate numbers that follow some given distribution. We study the use of this method to generate random numbers in the unit interval from increasing probability density functions. We focus on…

We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time $\theta$. This limit is increasing in…

We study the high dimensional asymptotics of the expected number of critical points of a given Morse index of Gaussian random holomorphic sections over complex projective space. We explicitly compute the exponential growth rate of the…

A survey of recent results in elementary number theory is presented in this paper. Special attention is given to structure and asymptotic properties of certain families of positive integers.

A \emph{composition} is a sequence of positive integers, called \emph{parts}, having a fixed sum. By an \emph{$m$-congruence succession}, we will mean a pair of adjacent parts $x$ and $y$ within a composition such that $x\equiv y(\text{mod}…

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

Frequentist-style large-sample properties of Bayesian posterior distributions, such as consistency and convergence rates, are important considerations in nonparametric problems. In this paper we give an analysis of Bayesian asymptotics…

Let $f(j,k,n)$ denote the expected number of $j$-faces of a random $k$-section of the $n$-cube. A formula for $f(0,k,n)$ is presented, and for $j\geq 1$, a lower bound for $f(j,k,n)$ is derived, which implies a precise asymptotic formula…

In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for $ n $ large enough, the two…

While conformal predictors reap the benefits of rigorous statistical guarantees on their error frequency, the size of their corresponding prediction sets is critical to their practical utility. Unfortunately, there is currently a lack of…

Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…

We consider the problem of estimating the number of types in a corpus using the number of types observed in a sample of tokens from that corpus. We derive exact and asymptotic distributions for the number of observed types, conditioned upon…

In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…

We derive an asymptotic lower bound on the Shannon entropy $H$ of sums of $N$ arbitrary iid discrete random variables. The derived bound $H \geq \frac{r(X)}{2}\log(N) + {\it cst}$ is given in terms of the incommensurability rank $r(X)$ of…

We determine the true asymptotic behaviour for the expected number of connected components for a model of random lemniscates proposed recently by Lerario and Lundberg. These are defined as the subsets of the Riemann sphere, where the…

For $\widetilde{\cal R} = 1 - \exp(- {\cal R})$ a random closed set obtained by exponential transformation of the closed range ${\cal R}$ of a subordinator, a regenerative composition of generic positive integer $n$ is defined by recording…