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

We study random composite structures considered up to symmetry that are sampled according to weights on the inner and outer structures. This model may be viewed as an unlabelled version of Gibbs partitions and encompasses multisets of…

For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To…

A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…

A finite set is "hidden" if its elements are not directly enumerable or if its size cannot be ascertained via a deterministic query. In public health, epidemiology, demography, ecology and intelligence analysis, researchers have developed a…

Asymptotics are derived for the scaling of the total diffraction intensity for the set of $k$-free integers near the origin, which is a measure for the degree of patch fluctuations.

We analyse the asymptotic behaviour of the probability of observing the expected number of successes at each stage of a sequence of nested Bernoulli trials. Our motivation is the attempt to give a genuinely frequentist interpretation to the…

Asymptotic expansions are derived for the tail distribution of the product of two correlated normal random variables with non-zero means and arbitrary variances, and more generally the sum of independent copies of such random variables.…

For random maps, the expected value of the order (i.e. the period of the sequence of compositional iterates) is approximated asymptotically. It is much smaller than the expected value for the product of the cycle lengths.

For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions. Under a classical scheme of assumptions on the…

Generalizing Reiner's notion of set partitions of type $B_n$, we define colored $B_n$-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored $B_n$-partitions, we get the…

Specimens are collected from $N$ different sources. Each specimen has probability $p$ of being contaminated, independently of the other specimens. We assume group testing is applicable, namely one can take small portions from several…

In this paper we consider the palindromes that can be formed by taking unordered sets of $n$ elements from an alphabet of $b$ letters. In particular, we seek to find the probability that given a random member of this space we are able to…

The norm of an integer partition is defined as the product of its parts. This statistic was recently introduced by Schneider in connection to partition zeta functions. In this note, we use the method of moments to study the distribution of…

For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We…

Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…

In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…

We obtain the asymptotic behavior of hole probability for random holomorphic sections on a compact Riemann surface with respect to the hole size.

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

We write down a one-dimensional integral formula and compute large-n asymptotics for the expectation of the absolute value of the smallest component of a unit vector in n-dimensional Euclidean space. The method is general, and allows to…

Let \{X_1, X_2, ...\} be a sequence of independent and identically distributed positive random variables of Pareto-type with index \alpha>0 and let \{N(t); t\geq 0\} be a counting process independent of the X_i's. For any fixed t\geq 0,…