English
Related papers

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

200 papers

Consider a random walk $S_n=\sum_{i=1}^n X_i$ with independent and identically distributed real-valued increments $X_i$ of zero mean and finite variance. Assume that $X_i$ is non-lattice and has a moment of order $2+\delta$. For any $x\geq…

Probability · Mathematics 2021-10-12 Ion Grama , Hui Xiao

We consider sequences of needlet random fields defined as weighted averaged forms of spherical Gaussian eigenfunctions. Our main result is a Central Limit Theorem in the high energy setting, for the boundary lengths of their excursion sets.…

Probability · Mathematics 2020-11-06 Radomyra Shevchenko , Anna Paola Todino

We study the first passage time $\tau_u = \inf \{ n \geq 1: |V_n| > u \}$ for the multivariate perpetuity sequence $V_n = Q_1 + M_1 Q_2 + \cdots + (M_1 \ldots M_{n-1}) Q_n$, where $(M_n, Q_n)$ is a sequence of independent and identically…

Probability · Mathematics 2024-12-11 Sebastian Mentemeier , Hui Xiao

Let $(\tau_n)$ be a sequence of toral automorphisms $\tau_n : x \rightarrow A_n x \hbox{mod}\ZZ^d$ with $A_n \in {\cal A}$, where ${\cal A}$ is a finite set of matrices in $SL(d, \mathbb{Z})$. Under some conditions the method of…

Probability · Mathematics 2010-06-22 Jean-Pierre Conze , Stéphane Le Borgne , Mikaël Roger

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…

Probability · Mathematics 2013-10-28 Valentin Féray

Consider a centred random walk in dimension one with a positive finite variance $\sigma^2$, and let $\tau_B$ be the hitting time for a bounded Borel set $B$ with a non-empty interior. We prove the asymptotic $P_x(\tau_B > n) \sim \sqrt{2 /…

Probability · Mathematics 2014-01-30 Vladislav Vysotsky

Let M be a noncompact metric space in which every closed ball is compact, and let G be a semigroup of Lipschitz mappings of M. Denote by (Y_n)_{n\geq1} a sequence of independent G-valued, identically distributed random variables (r.v.'s),…

Probability · Mathematics 2016-09-07 Hubert Hennion , Loic Herve

Consider the following method of card shuffling. Start with a deck of $N$ cards numbered 1 through N. Fix a parameter $p$ between 0 and 1. In this model a ``shuffle'' consists of uniformly selecting a pair of adjacent cards and then…

Probability · Mathematics 2007-05-23 Itai Benjamini , Noam Berger , Christopher Hoffman , Elchanan Mossel

Consider a sequence of $n$ independent random variables with a common continuous distribution $F$, and consider the task of choosing an increasing subsequence where the observations are revealed sequentially and where an observation must be…

Probability · Mathematics 2016-08-02 Alessandro Arlotto , Vinh V. Nguyen , J. Michael Steele

We consider a random walk $(Y_N)_{N\geq 0}$ on $\mathbb{R}^2$ generated by successively applying independent random isometries, drawn from a fixed measure $\mu$, to the point $0$. When the support of $\mu$ is finite and includes an…

Probability · Mathematics 2026-01-26 Reuben Drogin , Felipe Hernández

We prove central limit theorems for the number of descents and the number of inversions after a shelf-shuffle. In particular, we bound the convergence rate for the number of inversions independently of the number of shelves. Along the way,…

Probability · Mathematics 2025-10-02 Alexander Clay

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

Probability · Mathematics 2023-01-03 Tiefeng Jiang , Ke Wang

We analyze the asymptotic behavior of random variables $x(n,x\_0)$ defined by $x(0,x\_0)=x\_0$ and $x(n+1,x\_0)=A(n)x(n,x\_0)$, where $\sAn$ is a stationary and ergodic sequence of random matrices with entries in the semi-ring…

Probability · Mathematics 2007-05-23 Glenn Merlet

In the averaging process on a graph $G = (V, E)$, a random mass distribution $\eta$ on $V$ is repeatedly updated via transformations of the form $\eta_{v}, \eta_{w} \mapsto (\eta_{v} + \eta_{w})/2$, with updates made according to…

Probability · Mathematics 2024-04-04 Austin Eide

A deck of $n$ cards are shuffled by repeatedly taking off the top card, flipping it with probability $1/2$, and inserting it back into the deck at a random position. This process can be considered as a Markov chain on the group $B_n$ of…

Combinatorics · Mathematics 2023-03-15 Fumihiko Nakano , Taizo Sadahiro , Tetsuya Sakurai

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

Let $X_p, p\in\cP$ be a sequence of independent random variables s.t. $\bbP(X_p=\pm 1)=1/2$. Let $\te_j=\prod_{p|j}X_p$ if $j$ is square free and $\te_j=0$ otherwise. Denote $S_n=\sum_{\ell=1}^n\te_\ell$. The from this point of view proving…

Probability · Mathematics 2026-05-12 Yeor Hafouta

In this paper we establish a general dynamical Central Limit Theorem (CLT) for group actions which are exponentially mixing of all orders. In particular, the main result applies to Cartan flows on finite-volume quotients of simple Lie…

Dynamical Systems · Mathematics 2017-06-29 Michael Björklund , Alexander Gorodnik

We consider the process $\{x-N(t):t\geq 0\}$, where $x\in\mathbb{R}_+$ and $\{N(t):t\geq 0\}$ is a renewal process with light-tailed distributed holding times. We are interested in the joint distribution of $(\tau(x),A(x))$ where $\tau(x)$…

Probability · Mathematics 2022-02-23 Claudio Macci , Barbara Pacchiarotti

In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…

Combinatorics · Mathematics 2025-01-28 Margalit Glasgow , Matthew Kwan , Ashwin Sah , Mehtaab Sawhney
‹ Prev 1 3 4 5 6 7 10 Next ›