Related papers: Martingales and descent statistics

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…

This paper studies the asymptotic distribution of descents $\des(w)$ in a permutation $w$, and its inverse, distributed according to the Mallows measure. The Mallows measure is a non-uniform probability measure on permutations introduced to…

A Berry-Esseen bound is obtained for self-normalized martingales under the assumption of finite moments. The bound coincides with the classical Berry-Esseen bound for standardized martingales. An example is given to show the optimality of…

Renz (Ann. Probab. 1996) has established a rate of convergence $1/\sqrt{n}$ in the central limit theorem for martingales with some restrictive conditions. In the present paper a modification of the methods, developed by Bolthausen (Ann.…

We establish nonuniform Berry-Esseen bounds for martingales under the conditional Bernstein condition. These bounds imply Cram\'er type large deviations for moderate $x$'s, and are of exponential decay rate as de la Pe\~na's inequality when…

This paper studies statistics of riffle shuffles by relating them to random word statistics with the use of inverse shuffles. Asymptotic normality of the number of descents and inversions in riffle shuffles with convergence rates of order…

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…

Since the early work of Richard Stanley, it has been observed that several permutation statistics have a remarkable property with respect to shuffles of permutations. We formalize this notion of a shuffle-compatible permutation statistic…

We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillations and show that this rate is asymptotically close to the…

We give some rates of convergence in the distances of Kolmogorov and Wasserstein for standardized martingales with differences having finite variances. For the Kolmogorov distances, we present some exact Berry-Esseen bounds for martingales,…

We develop a numerical method for the martingale analogue of the Benamou--Brenier optimal transport problem, which seeks a martingale interpolating two prescribed marginals which is closest to the Brownian motion. Recent contributions have…

Simsun permutations, Andr\'e I permutations and Andr\'e II permutations are three combinatorial models for Euler numbers. It's known that the descent statistic is equidistributed over the set of Andr\'e I permutations and the set of simsun…

The goal of this paper is to go further in the analysis of the behavior of the number of descents in a random permutation. Via two different approaches relying on a suitable martingale decomposition or on the Irwin-Hall distribution, we…

The length $\mathsf{is}(\pi)$ of a longest increasing subsequence in a permutation $\pi$ has been extensively studied. An increasing subsequence is one that has no descents. We study generalizations of this statistic by finding longest…

In this paper, several variants of the ascent-plateau statistic are introduced, including flag ascent-plateau, double ascent and descent-plateau. We first study the flag ascent-plateau statistic on Stirling permutations by using…

A desarrangement is a permutation whose first ascent is even. Desarrangements were introduced in the 1980s by Jacques D\'{e}sarm\'{e}nien, who proved that they are in bijection with derangements. We revisit the study of desarrangements,…

We establish convergence theorems for Riemannian stochastic gradient descents in which the underlying probability spaces vary from iteration to iteration. As applications, we deduce convergence results for Riemannian stochastic gradient…

This paper introduces a new approach to the study of rates of convergence for posterior distributions. It is a natural extension of a recent approach to the study of Bayesian consistency. In particular, we improve on current rates of…

There has been a resurgence of interest in incomplete U-statistics that only sum over a subset of kernel evaluations, due to their computational efficiency and asymptotic normality which can be leveraged to quantify the uncertainty of…