Related papers: Stein's method and the modular behavior of Euleria…
Stein's (1972) method is a very general tool for assessing the quality of approximation of the distribution of a random element by another, often simpler, distribution. In applications of Stein's method, one needs to establish a Stein…
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…
Stein's method of exchangeable pairs is examined through five examples in relation to Poisson and normal distribution approximation. In particular, in the case where the exchangeable pair is constructed from a reversible Markov chain, we…
The development of the theories of the second-order Eulerian polynomials began with the works of Buckholtz and Carlitz in their studies of an asymptotic expansion. Gessel-Stanley introduced Stirling permutations and presented combinatorial…
The double exponential formula was introduced for calculating definite integrals with singular point oscillation functions and Fourier integral. The double exponential transformation is not only useful for numerical computations but it is…
Stein's method allows to prove distributional convergence of a sequence of random variables and to quantify it with respect to a given metric such as Kolmogorov's (a Berry-Ess\'een type theorem). Mod-* convergence quantifies the convergence…
The Stirling permutations introduced by Gessel-Stanley have recently received considerable attention. Motivated by Ji's work on $(\alpha,\beta)$-Eulerian polynomials (Sci China Math., 2025) and Yan-Yang-Lin's work on $1/k$-Eulerian…
Random events in space and time often exhibit a locally dependent structure. When the events are very rare and dependent structure is not too complicated, various studies in the literature have shown that Poisson and compound Poisson…
We take another look at using Stein's method to establish uniform Berry-Esseen bounds for Studentized nonlinear statistics, highlighting variable censoring and an exponential randomized concentration inequality for a sum of censored…
Narayana numbers appear in many places in combinatorics and probability, and it is known that they are asymptotically normal. Using Stein's method of exchangeable pairs, we provide an error of approximation in total variation to a symmetric…
In this manuscript we review two methods to construct exact confidence bounds for an unknown real parameter in a general class of discrete statistical models. These models include the binomial family, the Poisson family as well as…
We use Stein's method to obtain distributional approximations of subgraph counts in the uniform attachment model or random directed acyclic graph; we provide also estimates of rates of convergence. In particular, we give uni- and…
The Stein Variational Gradient Descent method is a variational inference method in statistics that has recently received a lot of attention. The method provides a deterministic approximation of the target distribution, by introducing a…
We use Stein's method to obtain a bound on the distance between scaled $p$-dimensional random walks and a $p$-dimensional (correlated) Brownian Motion. We consider dependence schemes including those in which the summands in scaled sums are…
Using Stein's method and the Malliavin calculus of variations, we derive explicit estimates for the Gamma approximation of functionals of a Poisson measure. In particular, conditions are presented under which the distribution of a sequence…
In the first part of the paper we use a new Fourier technique to obtain a Stein characterizations for random variables in the second Wiener chaos. We provide the connection between this result and similar conclusions that can be derived…
A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridge's formula by using cycle…
Motivated by juggling sequences and bubble sort, we examine permutations on the set {1,2,...,n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive…
We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, $\tau=123$ and $n$ even, is a bijection that associates a Dyck prefix of…
In this paper, we investigate the behavior of the Fourier transform on finite dimensional 2-step Lie groups and develop a general theory akin to that of the whole space or the torus. We provide a familiar framework in which computations are…