Related papers: Asymptotic Statistics of Odd Unimodal Sequences: R…
We study the asymptotic behavior of the rank statistic for unimodal sequences. We use analytic techniques involving asymptotic expansions in order to prove asymptotic formulas for the moments of the rank. Furthermore, when appropriately…
We compute an asymptotic estimate for odd balanced unimodal sequences for ranks congruent to $a \pmod{c}$ for $c\neq 1$ odd. We find the interesting result that the odd balanced unimodal sequences are asymptotically related to the…
We study combinatorial and asymptotic properties of the rank of strongly unimodal sequences. We find a generating function for the rank enumeration function, and give a new combinatorial interpretation of the ospt-function introduced by…
We prove a number of limiting distributions for statistics for unimodal sequences of positive integers by adapting a probabilistic framework for integer partitions introduced by Fristedt. The difficulty in applying the direct analogue of…
The classical theory of rank-based inference is entirely based either on ordinary ranks, which do not allow for considering location (intercept) parameters, or on signed ranks, which require an assumption of symmetry. If the median, in the…
We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…
We study partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. These permutations are the linear…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…
We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…
By a classical result of Weyl, for any increasing sequence $(n_k)_{k \geq 1}$ of integers the sequence of fractional parts $(\{n_k x\})_{k \geq 1}$ is uniformly distributed modulo 1 for almost all $x \in [0,1]$. Except for a few special…
Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…
We study the asymptotic distribution, as the volume parameter goes to 1, of the peak (largest part) of finite- or slowly-growing-width cylindric plane partitions weighted by their trace, seam, and volume. There are two natural asymptotic…
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blocks are permuted arbitrarily. The distribution of these statistics is closely related to the q-Stirling numbers of the second kind. Some of…
A strongly concave composition of $n$ is an integer partition with strictly decreasing and increasing parts. In this paper we give a uniform asymptotic formula for the rank statistic of a strongly concave composition introduced by Andrews,…
We study a new kind of proximity graphs called proportional-edge proximity catch digraphs (PCDs)in a randomized setting. PCDs are a special kind of random catch digraphs that have been developed recently and have applications in statistical…
Properties of the set $T_s$ of "particularly non-normal numbers" of the unit interval are studied in details ($T_s$ consists of real numbers $x$, some of whose s-adic digits have the asymptotic frequencies in the nonterminating $s-$ adic…
In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…
We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…
We give asymptotic expansions for the moments of the $M_2$-rank generating function and for the $M_2$-rank generating function at roots of unity. For this we apply the Hardy-Ramanujan circle method extended to mock modular forms. Our…