Related papers: A Note on the Stanley Distribution
We find out that the main result of the article The asymptotic uniform distribution of subset sums can be proven much more easily, using an explicit formula proposed by Li and Wan.
Odlyzko and Stanley introduced a greedy algorithm for constructing infinite sequences with no 3-term arithmetic progressions when beginning with a finite set with no 3-term arithmetic progressions. The sequences constructed from this…
Grimmett and McDiarmid suggested a simple heuristic for finding stable sets in random graphs. They showed that the heuristic finds a stable set of size $\sim\log_2 n$ (with high probability) on a $G(n, 1/2)$ random graph. We determine the…
Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…
We propose a new asymptotic test to assess the stationarity of a time series' mean that is applicable in the presence of both heteroscedasticity and short-range dependence. Our test statistic is composed of Gini's mean difference of local…
We investigate a class of stochastic fragmentation processes involving stable and unstable fragments. We solve analytically for the fragment length density and find that a generic algebraic divergence characterizes its small-size tail.…
We consider an ensemble of nxn real symmetric random matrices A whose entries are determined by independent identically distributed random variables that have symmetric probability distribution. Assuming that the moment 12+2delta of these…
Given a set of integers containing no 3-term arithmetic progressions, one constructs a Stanley sequence by choosing integers greedily without forming such a progression. Independent Stanley sequences are a "well-structured" class of Stanley…
In this paper non-asymptotic exponential and moment estimates are derived for tail of distribution for discrete time martingale under norming sequence 1/n, as in the classical Law of Large Numbers (LLN), by means of martingale differences…
We study randomly stopped sums via their asymptotic scales. First, finiteness of moments is considered. To generalise this study, asymptotic scales applicable to the class of all heavy-tailed random variables are used. The stopping is…
Counting permutations of $[n]$ by the number of records, i.e. left-to-right maxima, is a classic problem in combinatorial enumeration. In the first volume of ``The Art of Computer Programming", Donald Knuth demonstrated its relevance for…
We propose a new nonparametric test for the supposition of independence between two continuous random variables. The test is based on the size of the longest increasing subsequence of a random permutation. We identified the independence…
\cite{HillMotegi2017} present a new general asymptotic theory for the maximum of a random array $\{\mathcal{X}_{n}(i)$ $:$ $1$ $\leq $ $i$ $\leq $ $\mathcal{L}\}_{n\geq 1}$, where each $\mathcal{X}_{n}(i)$ is assumed to converge in…
Bringmann, Mahlburg, and Rhoades have found asymptotic expressions for all moments of the partition statistics rank and crank. In this work we extend their methods to higher ranks. The $T$-rank, introduced by Garvan, for odd integers T=3 is…
Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…
The longest stretch $L(n)$ of consecutive heads in $n$ i.i.d. coin tosses is seen from the prism of large deviations. We first establish precise asymptotics for the moment generating function of $L(n)$ and then show that there are precisely…
Two new test statistics are introduced to test the null hypotheses that the sampling distribution has an increasing hazard rate on a specified interval [0,a]. These statistics are empirical L_1-type distances between the isotonic estimates,…
We investigate the order of the $r$-th, $1\le r < +\infty$, central moment of the length of the longest common subsequence of two independent random words of size $n$ whose letters are identically distributed and independently drawn from a…
We characterize Schwartz distributions having a value at a single point in the sense introduced by means of nonstandard analysis by A. Robinson. They appear to be distributions continuous in a neighborhood of the point.
Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated , in particular when X 1 is not…