English
Related papers

Related papers: A central limit theorem for a card shuffling probl…

200 papers

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

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…

Combinatorics · Mathematics 2025-01-14 Boris Pittel

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

We consider the asymptotic normalcy of families of random variables $X$ which count the number of occupied sites in some large set. We write $Prob(X=m)=p_mz_0^m/P(z_0)$, where $P(z)$ is the generating function $P(z)=\sum_{j=0}^{N}p_jz^j$…

Combinatorics · Mathematics 2015-08-19 J. L. Lebowitz , B. Pittel , D. Ruelle , E. R. Speer

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Probability · Mathematics 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

This paper presents the asymptotic theory for nondegenerate $U$-statistics of high frequency observations of continuous It\^{o} semimartingales. We prove uniform convergence in probability and show a functional stable central limit theorem…

Probability · Mathematics 2014-09-10 Mark Podolskij , Christian Schmidt , Johanna F. Ziegel

In this paper we characterize all distributional limits of the random quadratic form $T_n =\sum_{1\le u< v\le n} a_{u, v} X_u X_v$, where $((a_{u, v}))_{1\le u,v\le n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal and…

Probability · Mathematics 2024-09-17 Bhaswar B. Bhattacharya , Sayan Das , Somabha Mukherjee , Sumit Mukherjee

A new type of stochastic dependence for a sequence of random variables is introduced and studied. Precisely, (X_n)_{n\geq 1} is said to be conditionally identically distributed (c.i.d.), with respect to a filtration (G_n)_{n\geq 0}, if it…

Probability · Mathematics 2007-05-23 Patrizia Berti , Luca Pratelli , Pietro Rigo

We investigate here the behaviour of a large typical meandric system, proving a central limit theorem for the number of components of given shape. Our main tool is a theorem of Gao and Wormald, that allows us to deduce a central limit…

Probability · Mathematics 2024-11-20 Svante Janson , Paul Thévenin

We explore an asymptotic behavior of R\'enyi entropy along convolutions in the central limit theorem with respect to the increasing number of i.i.d. summands. In particular, the problem of monotonicity is addressed under suitable moment…

Probability · Mathematics 2018-03-01 Sergey G. Bobkov , Arnaud Marsiglietti

We study dynamical systems arising as time-dependent compositions of Pomeau-Manneville-type intermittent maps. We establish central limit theorems for appropriately scaled and centered Birkhoff-like partial sums, with estimates on the rate…

Dynamical Systems · Mathematics 2020-01-14 Olli Hella , Juho Leppänen

We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…

Probability · Mathematics 2024-10-14 Santiago Arenas-Velilla , Octavio Arizmendi , J. E. Paguyo

A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the…

History and Overview · Mathematics 2024-04-08 Michaël Bensimhoun

The problem of convergence in law of normed sums of exchangeable random variables is examined. First, the problem is studied w.r.t. arrays of exchangeable random variables, and the special role played by mixtures of products of stable laws…

Probability · Mathematics 2012-04-20 Sandra Fortini , Lucia Ladelli , Eugenio Regazzini

We investigate the probability density of rescaled sums of iterates of deterministic dynamical systems, a problem relevant for many complex physical systems consisting of dependent random variables. A Central Limit Theorem (CLT) is only…

Statistical Mechanics · Physics 2007-05-23 Ugur Tirnakli , Christian Beck , Constantino Tsallis

We investigate the random permutation matrices induced by the Chinese restaurant processes with $(\alpha,\theta)$-seating. When $\alpha=0,\theta>0$, the permutations are those following Ewens measures on symmetric groups, and have been…

Probability · Mathematics 2024-12-20 Jaime Garza , Yizao Wang

Let $K$ be a smooth convex set with volume one in $\BBR^d$. Choose $n$ random points in $K$ independently according to the uniform distribution. The convex hull of these points, denoted by $K_n$, is called a {\it random polytope}. We prove…

Probability · Mathematics 2007-05-23 Van Vu

It is known that the fluctuations of suitable linear statistics of Haar distributed elements of the compact classical groups satisfy a central limit theorem. We show that if the corresponding test functions are sufficiently smooth, a rate…

Probability · Mathematics 2012-09-25 Christian Döbler , Michael Stolz

In this paper we investigate a sequence of square integrable random processes with space varying memory. We establish sufficient conditions for the central limit theorem in the space $L^2(\mu)$ for the partial sums of the sequence of random…

Probability · Mathematics 2015-09-02 Vaidotas Characiejus , Alfredas Račkauskas

Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…

Combinatorics · Mathematics 2015-08-18 Sergey Bereg , Alexander E. Holroyd , Lev Nachmanson , Sergey Pupyrev