Related papers: Martingales and descent statistics

We introduce new natural generalizations of the classical descent and inversion statistics for permutations, called width-$k$ descents and width-$k$ inversions. These variations induce generalizations of the excedance and major statistics,…

The hypothesis of randomness is fundamental in statistical machine learning and in many areas of nonparametric statistics; it says that the observations are assumed to be independent and coming from the same unknown probability…

We prove several identities expressing polynomials counting permutations by various descent statistics in terms of Eulerian polynomials, extending results of Stembridge, Petersen, and Br\"and\'en. Additionally, we find $q$-exponential…

For a branching random walk that drifts to infinity, consider its Malthusian martingale, i.e.~the additive martingale with parameter $\theta$ being the smallest root of the characteristic equation. When particles are killed below the…

Suppose that the (normalised) partial sum of a stationary sequence converges to a standard normal random variable. Given sufficiently moments, when do we have a rate of convergence of $n^{-1/2}$ in the uniform metric, in other words, when…

We show, how the classical Berry-Esseen theorem for normal approximation may be used to derive rates of convergence for random sums of centerd, real-valued random variables with respect to a certain class of probability metrics, including…

Biggins [Uniform convergence of martingales in the branching random walk. {\em Ann. Probab.}, 20(1):137--151, 1992] proved local uniform convergence of additive martingales in $d$-dimensional supercritical branching random walks at complex…

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a {\em stochastic maximal inequality} derived by using the formula for…

We consider the joint distribution of the area and perimeter statistics on the set I_n of inversion sequences of length n represented as bargraphs. Functional equations for both the ordinary and exponential generating functions are derived…

In this thesis, we study asymptotic properties of the standard branching Brownian motion, with a specific emphasis on the additive martingales at high temperature. We start by presenting classic and fundamental tools for our investigation.…

We study the asymptotic behaviour of the statistic (des+ides) which assigns to an element w of a finite Coxeter group W the number of descents of w plus the number of descents of its inverse. Our main result is a central limit theorem for…

For self-normalized martingales with conditionally symmetric differences, de la Pe\~{n}a [A general class of exponential inequalities for martingales and ratios. Ann. Probab. 27, No.1, 537-564] established the Gaussian type exponential…

We present (bi-)symmetric generating functions for the joint distributions of Euler-Stirling statistics on permutations, including the number of descents ($\mathsf{des}$), inverse descents ($\mathsf{ides}$), the number of left-to-right…

We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…

We prove a quantitative local limit theorem for the number of descents in a random permutation. Our proof uses a conditioning argument and is based on bounding the characteristic function $\phi(t)$ of the number of descents. We also…

Stochastic gradient descent is a classic algorithm that has gained great popularity especially in the last decades as the most common approach for training models in machine learning. While the algorithm has been well-studied when…

We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main technique consists in using Stanley's standardization to obtain a transport theorem between primitive modified ascent sequences and permutations…

We extend the notion of consecutive pattern avoidance to considering sums over all permutations where each term is a product of weights depending on each consecutive pattern of a fixed length. We study the problem of finding the asymptotics…

We consider random walks conditioned to stay positive. When the mean of increments is zero and variance is finite it is known that they converge to the Rayleigh distribution. In the present paper we derive a Berry-Esseen type estimate and…

Using a modification of Stein's method, we generalize the results of Bentkus, G{\"o}tze, and Tikhomirov \cite{bentkus1997berry} to obtain Berry-Esseen bounds for a broad class of statistics of sequences of $\phi$-mixing, non-stationary…