相关论文: Combinatorics of geometrically distributed random …

We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting…

We revisit, beyond the uniform case, some aspects of the convergence of the cumulative shape of the RSK Young diagrams associated with random words, obtaining rates of convergence in Kolmogorov's distance. Since the length of the top row of…

For a sequence $\{X_{n}, \, n \geqslant 1 \}$ of random variables satisfying $\mathbb{E} \lvert X_{n} \rvert < \infty$ for all $n \geqslant 1$, a maximal inequality is established, and used to obtain strong law of large numbers for…

Let $X$ and $Y$ be independent variance-gamma random variables with zero location parameter; then the exact probability density function of the ratio $X/Y$ is derived. Some basic distributional properties are also derived, including…

Multivariate extreme-value analysis is concerned with the extremes in a multivariate random sample, that is, points of which at least some components have exceptionally large values. Mathematical theory suggests the use of max-stable models…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

For $r \ge 2$ and a graph $G$, let $\alpha_{{r}}(G)$ be the maximum number of vertices in a $K_r$-free subgraph of $G$. We investigate the value $\alpha_{r}(G)$ when $G$ is the random graph $G \sim G_{n, 1/2}$ and discover the following…

The distributions of the $m$-th longest runs of multivariate random sequences are considered. For random sequences made up of $k$ kinds of letters, the lengths of the runs are sorted in two ways to give two definitions of run length…

Let i.i.d. symmetric Bernoulli random variables be associated to the edges of a binary tree having n levels. To any leaf of the tree, we associate the sum of variables along the path connecting the leaf with the tree root. Let M_n denote…

We consider languages generated by weighted context-free grammars. It is shown that the behaviour of large texts is controlled by saddle-point equations for an appropriate generating function. We then consider ensembles of grammars, in…

This paper considers the problem of variable-length intrinsic randomness. We propose the average variational distance as the performance criterion from the viewpoint of a dual relationship with the problem formulation of variable-length…

The law of large numbers extends to random sets by employing Minkowski addition. Above that, a central limit theorem is available for set-valued random variables. The existing results use abstract isometries to describe convergence of the…

A pedagogical account of some aspects of Extreme Value Statistics (EVS) is presented from the somewhat non-standard viewpoint of Large Deviation Theory. We address the following problem: given a set of $N$ i.i.d. random variables…

Suppose that there is a family of $n$ random points $X_v$ for $v \in V$, independently and uniformly distributed in the square $\left[-\sqrt{n}/2,\sqrt{n}/2\right]^2$ of area $n$. We do not see these points, but learn about them in one of…

A random geometric graph $G_n$ is given by picking $n$ vertices in $\mathbb{R}^d$ independently under a common bounded probability distribution, with two vertices adjacent if and only if their $l^p$-distance is at most $r_n$. We investigate…

We describe the behavior of the expectation of the maximum for a random assignment process built upon a square matrix with independent entries. Under mild assumptions on the underlying distribution, the answer is expressed in terms of its…

An exact upper bound on the Winsorised-tilted mean of a symmetric random variable in terms of its second moment is given. Such results are used in work on nonuniform Berry--Esseen-type bounds for general nonlinear statistics.

We present some product representations for random variables with the Linnik, Mittag-Leffler and Weibull distributions and establish the relationship between the mixing distributions in these representations. Based on these representations,…