English
Related papers

Related papers: A central limit theorem for cycles of Mallows perm…

200 papers

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…

Probability · Mathematics 2015-05-19 Julia Storm , Dirk Zeindler

This paper re-examines the limit theorems of Abadie and Imbens for nearest-neighbor matching estimators of average treatment effects with a fixed number of matches. We establish, for the first time, a non-normalized central limit theorem…

Statistics Theory · Mathematics 2026-05-21 Songliang Chen , Fang Han

In this paper, we study the distribution of the number of occurrences of the simplest frame pattern, called the $\mu$ pattern, in $n$-cycles. Given an $n$-cycle $C$, we say that a pair $\langle i,j \rangle$ matches the $\mu$ pattern if $i <…

Combinatorics · Mathematics 2013-11-15 Miles Jones , Sergey Kitaev , Jeffrey Remmel

Approximating the solution of the nonlinear filtering problem with Gaussian mixtures has been a very popular method since the 1970s. However, the vast majority of such approximations are introduced in an ad-hoc manner without theoretical…

Probability · Mathematics 2014-01-28 Dan Crisan , Kai Li

We study the number of random permutations needed to invariably generate the symmetric group, $S_n$, when the distribution of cycle counts has the strong $\alpha$-logarithmic property. The canonical example is the Ewens sampling formula,…

Probability · Mathematics 2016-10-18 Gerandy Brito , Christopher Fowler , Matthew Junge , Avi Levy

We show that the Mallows measure on permutations of $1,\ldots,n$ arises as the law of the unique Gale-Shapley stable matching of the random bipartite graph conditioned to be perfect, where preferences arise from a total ordering of the…

Probability · Mathematics 2023-06-22 Omer Angel , Alexander E. Holroyd , Tom Hutchcroft , Avi Levy

We introduce a probability distribution Q on the group of permutations of the set Z of integers. Distribution Q is a natural extension of the Mallows distribution on the finite symmetric group. A one-sided infinite counterpart of Q,…

Probability · Mathematics 2013-03-04 Alexander Gnedin , Grigori Olshanski

We consider a class of self-similar, continuous Gaussian processes that do not necessarily have stationary increments. We prove a version of the Breuer-Major theorem for this class, that is, subject to conditions on the covariance function,…

Probability · Mathematics 2016-12-06 Daniel Harnett , David Nualart

We show that there exists a very natural, superstatistics-linked extension of the central limit theorem (CLT) to deformed exponentials (also called q-Gaussians): This generalization favorably compares with the one provided by S. Umarov and…

Statistical Mechanics · Physics 2007-06-04 C. Vignat , A. Plastino

We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of…

Combinatorics · Mathematics 2020-02-26 Valentin Féray

In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that,…

Probability · Mathematics 2007-05-23 L. V. Bogachev , Z. G. Su

Consider the sample covariance matrix $$\Sigma^{1/2}XX^T\Sigma^{1/2}$$ where $X$ is an $M\times N$ random matrix with independent entries and $\Sigma$ is an $M\times M$ diagonal matrix. It is known that if $\Sigma$ is deterministic, then…

Probability · Mathematics 2023-02-27 Ji Oon Lee , Yiting Li

In this paper, we are concerned with the large N limit of linear combinations of the entries of a Brownian motion on the group of N by N unitary matrices. We prove that the process of such a linear combination converges to a Gaussian one.…

Probability · Mathematics 2011-06-22 Florent Benaych-Georges

We consider $n\times n$ real symmetric and Hermitian Wigner random matrices $n^{-1/2}W$ with independent (modulo symmetry condition) entries and the (null) sample covariance matrices $n^{-1}X^*X$ with independent entries of $m\times n$…

Probability · Mathematics 2009-09-25 A. Lytova , L. Pastur

Kipnis and Varadhan showed that for an additive functional, $S_n$ say, of a reversible Markov chain the condition $E(S_n^{2})/n \to \kappa \in (0,\infty)$ implies the convergence of the conditional distribution of $S_n/\sqrt{E(S_n^{2}})$,…

Probability · Mathematics 2010-05-25 Ou Zhao , Michael Woodroofe , Dalibor Volny

We prove a central limit theorem for random sums of the form $\sum_{i=1}^{N_n} X_i$, where $\{X_i\}_{i \geq 1}$ is a stationary $m-$dependent process and $N_n$ is a random index independent of $\{X_i\}_{i\geq 1}$. Our proof is a…

Probability · Mathematics 2013-03-12 Umit Islak

In the paper [25], written in collaboration with Gesine Reinert, we proved a universality principle for the Gaussian Wiener chaos. In the present work, we aim at providing an original example of application of this principle in the…

Probability · Mathematics 2010-02-08 Ivan Nourdin , Giovanni Peccati

We study the central limit theorem in the non-normal domain of attraction to symmetric $\alpha$-stable laws for $0<\alpha\leq2$. We show that for i.i.d. random variables $X_i$, the convergence rate in $L^\infty$ of both the densities and…

Probability · Mathematics 2018-04-24 Christoph Börgers , Claude Greengard

We prove a central limit theorem for the Horvitz-Thompson estimator based on the Gram-Schmidt Walk (GSW) design, recently developed in Harshaw et al.(2022). In particular, we consider the version of the GSW design which uses randomized…

Statistics Theory · Mathematics 2023-06-06 Sabyasachi Chatterjee , Partha S. Dey , Subhajit Goswami

We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $\mu$-random permutations. We also introduce and study a new general class of…

Probability · Mathematics 2023-04-04 Jacopo Borga , Sayan Das , Sumit Mukherjee , Peter Winkler
‹ Prev 1 3 4 5 6 7 10 Next ›