相关论文: On the Limiting Distribution for the Longest Alter…

A restricted growth function (RGF) of length n is a sequence w = w_1 w_2 ... w_n of positive integers such that w_1 = 1 and w_i is at most 1 + max{w_1,..., w_{i-1}} for i at least 2. RGFs are of interest because they are in natural…

Given n observations, we study the consistency of a batch of k new observations, in terms of their distribution function. We propose a non-parametric, non-likelihood test based on Edgeworth expansion of the distribution function. The…

We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…

We study the rate of convergence of the Markov chain on $S_n$ which starts with a random $(n-k)$-cycle for a fixed $k \geq 1$, followed by random transpositions. The convergence to the stationary distribution turns out to be of order $n$.…

A curious connection exists between the theory of optimal stopping for independent random variables, and branching processes. In particular, for the branching process $Z_n$ with offspring distribution $Y$, there exists a random variable $X$…

It is a classical fact that for any $\varepsilon > 0$, a random permutation of length $n = (1 + \varepsilon) k^2 / 4$ typically contains a monotone subsequence of length $k$. As a far-reaching generalization, Alon conjectured that a random…

We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…

Fix a word $w$ in a free group $F$ on $r$ generators. A $w$-random permutation in the symmetric group $S_N$ is obtained by sampling $r$ independent uniformly random permutations $\sigma_{1},\ldots,\sigma_{r}\in S_{N}$ and evaluating…

In [1] a detailed analysis was given of the large-time asymptotics of the total mass of the solution to the parabolic Anderson model on a supercritical Galton-Watson random tree with an i.i.d. random potential whose marginal distribution is…

We calculate the large deviations for the length of the longest alternating subsequence and for the length of the longest increasing subsequence in a uniformly random permutation that avoids a pattern of length three. We treat all six…

This paper explores the problem of generative modeling, aiming to simulate diverse examples from an unknown distribution based on observed examples. While recent studies have focused on quantifying the statistical precision of popular…

We prove a formula for the number of permutations in $S_n$ such that their first $n-k$ entries are increasing and their longest increasing subsequence has length $n-k$. This formula first appeared as a consequence of character polynomial…

Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…

Gessel's famous Bessel determinant formula gives the generating function of the number of permutations without increasing subsequences of a given length. Ekhad and Zeilberger proposed the challenge of finding a suitable generalization for…

The gaps in the sequence $\{\sqrt{n}\}$ were shown by Elkies-McMullen (2004) to have a limiting distribution which is not the exponential distribution. However it is conjectured that the distribution of gaps in the sequence…

Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of…

In this work the asymptotic properties of $Q_t(N)$ ,the probability of the number of renewals ($N$), that occur during time $t$ are explored. While the forms of the distribution at very long times, i.e. $t\to\infty$, are very well known and…

We propose a new method for the calculation of the statistical properties, as e.g. the entropy, of unknown generators of symbolic sequences. The probability distribution $p(k)$ of the elements $k$ of a population can be approximated by the…

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

In a 1977 paper, Diaconis and Graham studied what Knuth calls the total displacement of a permutation $w$, which is the sum of the distances $|w(i)-i|$. In recent work of the first author and Tenner, this statistic appears as twice the type…