相关论文: Central limit theorems for iterated random Lipschi…

We show central limit theorems (CLT) for the Stieltjes transforms or more general analytic functions of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of $\alpha$-stable laws and…

This paper surveys various results about Markov chains on general (non-countable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivation and context for the theory which…

Central limit theorems for linear statistics of lattice random fields (including spin models) are usually proven under suitable mixing conditions or quasi-associativity. Many interesting examples of spin models do not satisfy mixing…

Consider a critical branching random walk on $\mathbb{R}$. Let $Z^{(n)}(A)$ be the number of individuals in the $n$-th generation located in $A\in \mathcal{B}(\mathbb{R})$ and $Z_{n}:=Z^{(n)}(\mathbb{R})$ denote the population of the $n$-th…

Let A(n) be a sequence of i.i.d. topical (i.e. isotone and additively homogeneous) operators. Let $x(n,x_0)$ be defined by $x(0,x_0)=x_0$ and $x(n,x_0)=A(n)x(n-1,x_0)$. This can modelize a wide range of systems including, task graphs, train…

Let $\{X, X_{n}; n \geq 1 \}$ be a sequence of i.i.d. $\mathbf{B}$-valued random variables and set $S_{n} = \sum_{i=1}^{n}X_{i},~n \geq 1$. This note is devoted to study the classical central limitr theorem for subsequences of sums of…

Let $(X_{jk})_{j,k\geq 1}$ be an infinite array of i.i.d. complex random variables, with mean 0 and variance 1. Let $\la_{n,1},...,\la_{n,n}$ be the eigenvalues of $(\frac{1}{\sqrt{n}}X_{jk})_{1\leq j,k\leq n}$. The strong circular law…

Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…

The random transposition shuffle on repeated cards induces a Markov chain on the quotient space of arrangements with multiplicities, and is equivalent to the many-urn mean-field Bernoulli-Laplace model introduced by Scarabotti. Writing…

We study quasi-stationary distributions and quasi-limiting behavior of Markov chains in general reducible state spaces with absorption. We propose a set of assumptions dealing with particular situations where the state space can be…

In this paper, we establish an almost sure central limit theorem for a general random sequence under a strong approximation condition. Additionally, we derive the law of the iterated logarithm for the center of mass corresponding to a…

We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…

This paper is concerned with the limiting spectral behaviors of large dimensional Kendall's rank correlation matrices generated by samples with independent and continuous components. We do not require the components to be identically…

We investigate the problem of quantifying contraction coefficients of Markov transition kernels in Kantorovich ($L^1$ Wasserstein) distances. For diffusion processes, relatively precise quantitative bounds on contraction rates have recently…

We prove an asymptotic Cram\'er's theorem, that is, if the sequence $(X_{n}+ Y_{n})_{n\geq 1}$ converges in law to the standard normal distribution and for every $n\geq 1$ the random variables $X_{n}$ and $Y_{n}$ are independent, then…

Let $(Z_n)_{n\geq 0}$ be a critical branching process in a random environment defined by a Markov chain $(X_n)_{n\geq 0}$ with values in a finite state space $\mathbb X$. Let $ S_n = \sum_{k=1}^n \ln f_{X_k}'(1)$ be the Markov walk…

Suppose $B_i:= B(p,r_i)$ are nested balls of radius $r_i$ about a point $p$ in a dynamical system $(T,X,\mu)$. The question of whether $T^i x\in B_i$ infinitely often (i. o.) for $\mu$ a.e.\ $x$ is often called the shrinking target problem.…

We consider the first-passage percolation problem on the random graph with vertex set N\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for…

Let $(X_{n,i})_{1\le i\le n,n\in\mathbb{N}}$ be a triangular array of row-wise stationary $\mathbb{R}^d$-valued random variables. We use a "blocks method" to define clusters of extreme values: the rows of $(X_{n,i})$ are divided into $m_n$…

We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the…