Related papers: The Mahonian probability distribution on words is …
This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length $n$ of the Sturmian…
Motivated by the need, in some Bayesian likelihood free inference problems, of imputing a multivariate counting distribution based on its vector of means and variance-covariance matrix, we define a generic multivariate discrete…
Models with intractable normalizing functions arise frequently in statistics. Common examples of such models include exponential random graph models for social networks and Markov point processes for ecology and disease modeling. Inference…
An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…
This paper investigates the asymptotic behavior of the Multi-set Allocation Occupancy (MAO) distribution, which models the count vector $X=(X_{=0},\ldots,X_{=T})$ from $T$ independent rounds of sampling without replacement of size $m$ from…
An asymptotic expansion for inverse moments of positive binomial and Poisson distributions is derived. The expansion coefficients of the asymptotic series are given by the positive central moments of the distribution. Compared to previous…
We study statistical properties of the random variables $X_{\sigma}(\pi)$, the number of occurrences of the pattern $\sigma$ in the permutation $\pi$. We present two contrasting approaches to this problem: traditional probability theory and…
Two well-known distributions in the study of permutation statistics are the Mahonian and Eulerian distributions. Mahonian statistics include the major index MAJ and the number of inversions INV, while examples of Eulerian statistics are the…
This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of…
We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to…
Babson and Steingr\'{\i}msson introduced generalized permutation patterns and showed that most of the Mahonian statistics in the literature can be expressed by the combination of generalized pattern functions. Particularly, they defined a…
We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…
We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…
The Conway-Maxwell-Poisson (CMP) distribution is a natural two-parameter generalisation of the Poisson distribution which has received some attention in the statistics literature in recent years by offering flexible generalisations of some…
The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…
We give a direct combinatorial proof of the $q,t$-symmetry relation $\tilde H_{\mu}(X;q,t)=\tilde H_{\mu'}(X;t,q)$ in the Macdonald polynomials $\tilde H_\mu$ at the specialization $q=1$. The bijection demonstrates that the Macdonald inv…
We use recurrences (alias difference equations) to prove the longstanding conjecture that the two most important permutation statistics, namely the number of inversions and the major index, are asymptotically joint-independently-normal. We…
We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patterns. The Mallows distribution behaves like a $q$-analogue of…
The probability of finding a prime multiplet, i.e., a sequence of primes $p$ and $p+a_i$, $i=1... m$, being all primes where $p$ is some prime less than the integer $n$ is naively $1/log(n)^{m+1}$. It is shown that, in reality, it is…
Let a word be a sequence of $n$ i.i.d. integer random variables. The perimeter $P$ of the word is the number of edges of the word, seen as a polyomino. In this paper, we present a probabilistic approach to the computation of the moments of…