English
Related papers

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

200 papers

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…

Probability · Mathematics 2024-04-22 Anja Sturm , Moritz Wemheuer

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…

Probability · Mathematics 2019-02-20 Thibault Espinasse , Nadine Guillotin-Plantard , Philippe Nadeau

This paper quantifies the asymptotic order of the largest singular value of a centered random matrix built from the path of a Block Markov Chain (BMC). In a BMC there are $n$ labeled states, each state is associated to one of $K$ clusters,…

Probability · Mathematics 2021-11-12 Jaron Sanders , Albert Senen-Cerda

Let $C\geq 2$ be a positive integer. Consider the set of $n\times n$ non-negative integer matrices whose row sums and column sums are all equal to $Cn$ and let $X=(X_{ij})_{1\leq i,j\leq n}$ be uniformly distributed on this set. This $X$ is…

Probability · Mathematics 2023-01-18 Da Wu

In this paper, we analyze the random fluctuations in a one dimensional stochastic homogenization problem and prove a central limit result, i.e., the first order fluctuations can be described by a Gaussian process that solves an SPDE with…

Probability · Mathematics 2015-08-24 Yu Gu

Let $\beta > 1$ be a real number and $x \in [0,1)$ be an irrational number. Denote by $k_n(x)$ the exact number of partial quotients in the continued fraction expansion of $x$ given by the first $n$ digits in the $\beta$-expansion of $x$…

Number Theory · Mathematics 2016-07-05 Lulu Fang , Min Wu , Bing Li

The asymptotic behaviour of a generalised P\'olya--Eggenberger urn is well--known to depend on the spectrum of its replacement matrix: If its dominant eigenvalue $r$ is simple and no other eigenvalue is `large' in the sense that its real…

Probability · Mathematics 2019-03-13 Noela Müller

We prove a quenched central limit theorem for random walks in i.i.d. weakly elliptic random environments in the ballistic regime. Such theorems have been proved recently by Rassoul-Agha and Sepp\"al\"ainen in [10] and Berger and Zeitouni in…

Probability · Mathematics 2014-09-22 Elodie Bouchet , Christophe Sabot , Renato Soares Dos Santos

We prove the Central Limit Theorem and superpolynomial mixing for environment viewed for the particle process in quasi periodic Diophantine random environment. The main ingredients are smoothness estimates for the solution of the Poisson…

Dynamical Systems · Mathematics 2024-07-24 Klaudiusz Czudek , Dmitry Dolgopyat

We study the linear eigenvalue statistics of large random graphs in the regimes when the mean number of edges for each vertex tends to infinity. We prove that for a rather wide class of test functions the fluctuations of linear eigenvalue…

Mathematical Physics · Physics 2015-06-03 Maria Shcherbina , Brunello Tirozzi

We examine the reset threshold of randomly generated deterministic automata. We present a simple proof that an automaton with a random mapping and two random permutation letters has a reset threshold of $\mathcal{O}\big( \sqrt{n \log^3 n}…

Combinatorics · Mathematics 2023-12-05 Balázs Gerencsér , Zsombor Várkonyi

We obtain large deviations estimates for both sequential and random compositions of intermittent maps. We also address the question of whether or not centering is necessary for the quenched central limit theorems (CLT) obtained by Nicol,…

Dynamical Systems · Mathematics 2020-08-14 Matthew Nicol , Felipe Perez Pereira , Andrew Torok

We obtain the law of large numbers (LLN) and the central limit theorem (CLT) for weakly dependent non-stationary arrays of random fields with asymptotically unbounded moments. The weak dependence condition for arrays of random fields is…

Statistics Theory · Mathematics 2024-08-15 Yue Pan , Jiazhu Pan

The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the intermediate sets remain independent. Extremal problems on…

Combinatorics · Mathematics 2023-01-06 Nicolas Bousquet , Bastien Durain , Théo Pierron , Stéphan Thomassé

The paper provides a connection between Commutative Algebra and Integer Programming and contains two parts. The first one is devoted to the asymptotic behavior of integer programs with a fixed cost linear functional and the constraint sets…

Commutative Algebra · Mathematics 2020-11-03 Le Tuan Hoa

We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of…

Machine Learning · Computer Science 2020-08-13 Rui Liu , Alex Olshevsky

The distribution of descents in fixed conjugacy classes of $S_n$ has been studied, and it is shown that its moments have interesting properties. Fulman proved that the descent numbers of permutations in conjugacy classes with large cycles…

Combinatorics · Mathematics 2018-03-29 Gene B. Kim , Sangchul Lee

We give optimal convergence rates in the central limit theorem for a large class of martingale difference sequences with bounded third moments. The rates depend on the behaviour of the conditional variances and for stationary sequences the…

Probability · Mathematics 2007-05-23 Mohamed El Machkouri , Lahcen Ouchti

We obtain functional central limit theorems for both discrete time expressions of the form $1/\sqrt{N}\sum_{n=1}^{[Nt]}(F(X(q_1(n)),\ldots, X(q_{\ell}(n)))-\bar{F})$ and similar expressions in the continuous time where the sum is replaced…

Probability · Mathematics 2014-02-26 Yuri Kifer , S. R. S. Varadhan

We consider N single server infinite buffer queues with service rate \beta. Customers arrive at rate N\alpha, choose L queues uniformly, and join the shortest. We study the processes R^N for large N, where R^N_t(k) is the fraction of queues…

Probability · Mathematics 2007-05-23 Carl Graham