English
Related papers

Related papers: The global and local limit of the continuous-time …

200 papers

We prove two theorems related to the Central Limit Theorem (CLT) for Martin-L\"of Random (MLR) sequences. Martin-L\"of randomness attempts to capture what it means for a sequence of bits to be "truly random". By contrast, CLTs do not make…

Probability · Mathematics 2022-01-31 Anton Vuerinckx , Yves Moreau

We prove a central limit theorem (CLT) for the number of joint orbits of random tuples of commuting permutations. In the uniform sampling case this generalizes the classic CLT of Goncharov for the number of cycles of a single random…

Probability · Mathematics 2026-02-20 Abdelmalek Abdesselam , Shannon Starr

Let $(\Omega,\mathcal{F}, \mathbb{P})$ be a probability space and $E$ be a finite set. Assume that $X=(X_n)$ is an irreducible and aperiodic Markov chain, defined on $(\Omega,\mathcal{F}, \mathbb{P})$, with values in $E$ and with transition…

Probability · Mathematics 2017-12-05 Yinna Ye

In this paper some general theory is presented for locally stationary processes based on the stationary approximation and the stationary derivative. Laws of large numbers, central limit theorems as well as deterministic and stochastic bias…

Statistics Theory · Mathematics 2017-11-21 Rainer Dahlhaus , Stefan Richter , Wei Biao Wu

Langevin Monte Carlo (LMC) is an iterative algorithm used to generate samples from a distribution that is known only up to a normalizing constant. The nonasymptotic dependence of its mixing time on the dimension and target accuracy is…

Machine Learning · Statistics 2020-02-26 Niladri S. Chatterji , Jelena Diakonikolas , Michael I. Jordan , Peter L. Bartlett

The law of the iterated logarithm (LIL) for the time-homogeneous Markov process with a unique invariant measure characterizes the almost sure maximum possible fluctuation of time averages around the ergodic limit. Whether a numerical…

Numerical Analysis · Mathematics 2025-11-10 Chuchu Chen , Xinyu Chen , Jialin Hong

We consider regular lattices of coupled chaotic maps. Depending on lattice size, there may exist a window in parameter space where complete synchronization is eventually attained after a transient regime. Close outside this window, an…

Chaotic Dynamics · Physics 2009-11-11 C. Anteneodo , A. M. Batista , R. L. Viana

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where basically $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that $X_1$ is…

Probability · Mathematics 2012-02-16 Fabienne Castell , Nadine Guillotin--Plantard , Françoise Pène , Bruno Schapira

We investigate a piecewise-deterministic Markov process, evolving on a Polish metric space, whose deterministic behaviour between random jumps is governed by some semi-flow, and any state right after the jump is attained by a randomly…

Probability · Mathematics 2020-12-04 Dawid Czapla , Sander C. Hille , Katarzyna Horbacz , Hanna Wojewódka-Ściążko

We prove a scaling limit theorem for discrete Galton-Watson processes in varying environments. A simple sufficient condition for the weak convergence in the Skorokhod space is given in terms of probability generating functions. The limit…

Probability · Mathematics 2022-04-14 Fang Rongjuan , Li Zenghu , Liu Jiawei

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

Probability · Mathematics 2008-05-07 Mathias Becker , Wolfgang Konig

We consider a random process with discrete time formed by singular values of products of truncations of Haar distributed unitary matrices. We show that this process can be understood as a scaling limit of the Schur process, which gives…

Mathematical Physics · Physics 2020-07-24 Alexei Borodin , Vadim Gorin , Eugene Strahov

Iteration of randomly chosen quadratic maps defines a Markov process: X_{n+1}=\epsilon_{n+1}X_n(1-X_n), where \epsilon_n are i.i.d. with values in the parameter space [0,4] of quadratic maps F_{\theta}(x)=\theta x(1-x). Its study is of…

Probability · Mathematics 2007-05-23 Rabi Bhattacharya , Mukul Majumdar

We establish integral tests and laws of the iterated logarithm for the upper envelope of the future infimum of positive self-similar Markov processes and for increasing self-similar Markov processes at 0 and infinity. Our proofs are based…

Probability · Mathematics 2007-05-23 J. C. Pardo

We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a regular (aperiodic and irreducible) finite Markov chain. Specially, consider a random walk on a regular Markov chain and a Hermitian matrix-valued…

Machine Learning · Statistics 2020-10-30 Jiezhong Qiu , Chi Wang , Ben Liao , Richard Peng , Jie Tang

It is well known that a Lorenz curve, derived from the distribution function of a random variable, can itself be viewed as a probability distribution function of a new random variable [4]. In a previous work of ours [26], we proved the…

Probability · Mathematics 2026-03-03 Vilimir Yordanov

We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…

Probability · Mathematics 2018-06-05 Vadim Gorin , Leonid Petrov

Our principal aim is to observe the Markov discrete-time process of population growth with long-living trajectory. First we study asymptotical decay of generating function of Galton-Watson process for all cases as the Basic Lemma.…

Probability · Mathematics 2020-04-21 Azam A. Imomov

Dynamical systems with $\epsilon$ small random perturbations appear in both continuous mechanical motions and discrete stochastic chemical kinetics. The present work provides a detailed analysis of the central limit theorem (CLT), with a…

Mathematical Physics · Physics 2021-03-17 Yu-Chen Cheng , Hong Qian

We give a Markov chain based algorithm for sampling almost uniform solutions of constraint satisfaction problems (CSPs). Assuming a canonical setting for the Lov\'asz local lemma, where each constraint is violated by a small number of…

Data Structures and Algorithms · Computer Science 2021-04-13 Weiming Feng , Kun He , Yitong Yin
‹ Prev 1 8 9 10 Next ›