相关论文: Finite-Memory Elephant Random Walk and the Central…

In this paper we develop non-stationary martingale techniques for dependent data. We shall stress the non-stationary version of the projective Maxwell-Woodroofe condition, which will be essential for obtaining maximal inequalities and…

We consider the open quantum random walks on the crystal lattices and investigate the central limit theorems for the walks. On the integer lattices the open quantum random walks satisfy the central limit theorems as was shown by Attal, {\it…

Recent work in dynamic causal inference introduced a class of discrete-time stochastic processes that generalize martingale difference sequences and arrays as follows: the random variates in each sequence have expectation zero given certain…

Large language models (LLMs) solve problems more accurately and interpretably when instructed to work out the answer step by step using a ``chain-of-thought'' (CoT) prompt. One can also improve LLMs' performance on a specific task by…

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. Motivated by the functional estimation of the density of the…

Our purpose of this paper is to study stochastic control problem for systems driven by mean-field stochastic differential equations with elephant memory, in the sense that the system (like the elephants) never forgets its history. We study…

The continuous time random walks (CTRWs) are typically defned in the way that their trajectories are discontinuous step fuctions. This may be a unwellcome feature from the point of view of application of theese processes to model certain…

We prove annealed central limit theorems for finite pattern counts in the measurement record of discrete-time quantum trajectories generated by repeated measurements in a disordered environment. Under summable mixing assumptions on the…

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…

Chain-of-thought (CoT) reasoning enables large language models (LLMs) to break down complex problems into interpretable intermediate steps, significantly enhancing model transparency and performance in reasoning tasks. However, conventional…

In this paper, we provide general central limit theorems (CLT's) for associated random variables (rv's) following the approaches used by Newman (1980) and Olivera et al.(2012). Given some assumptions, a Lyapounov-Feller-Levy type theorem is…

The latent multinomial model (LMM) model of Link et al. (2010) provided a general framework for modelling mark-recapture data with potential errors in identification. Key to this approach was a Markov chain Monte Carlo (MCMC) scheme for…

The general model of coagulation is considered. For basic classes of unbounded coagulation kernels the central limit theorem (CLT) is obtained for the fluctuations around the dynamic law of large numbers (LLN). A rather precise rate of…

Let $(W_n(\theta))_{n\in\mathbb N_0}$ be the Biggins martingale associated with a supercritical branching random walk and denote by $W_\infty(\theta)$ its limit. Assuming essentially that the martingale $(W_n(2\theta))_{n\in\mathbb N_0}$ is…

The paper is devoted to an invariance principle for Kemperman's model of oscillating random walk on $\mathbb{Z}$. This result appears as an extension of the invariance principal theorem for classical random walks on $\mathbb{Z}$ or…

We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…

We study the fluctuations of the eigenvalues of real valued large centrosymmetric random matrices via its linear eigenvalue statistic. This is essentially a central limit theorem (CLT) for sums of dependent random variables. The dependence…

We obtain sufficient conditions for belonging of almost all paths of a random process to some fixed rearrangement invariant (r.i.) Banach functional space, and to satisfying the Central Limit Theorem (CLT) in this space. We describe also…

Random walks cannot, in general, be pushed forward by quasi-isometries. Tame Markov chains were introduced as a `quasi-isometry invariant' are a generalization of random walks. In this paper, we construct several examples of tame Markov…

In this paper, under mild assumptions, we derive a law of large numbers, a central limit theorem with an error estimate, an almost sure invariance principle and a variant of Chernoff bound in finite-state hidden Markov models. These limit…