相关论文: Non-Markovian random walks with memory lapses

We study the closure properties of the class of Bivariate Regular Variation, symbolically BRV , in standard and nonstandard cases, with respect to the randomly weighted sums. However, we take into consideration a weak dependence structure…

Random walks process on networks plays a fundamental role in understanding the importance of nodes and the similarity of them, which has been widely applied in PageRank, information retrieval, and community detection, etc. Individual's…

We consider the linear stochastic recursion $x_{i+1} = a_{i}x_{i}+b_{i}$ where the multipliers $a_i$ are random and have Markovian dependence given by the exponential of a standard Brownian motion and $b_{i}$ are i.i.d. positive random…

We show that memory, feedback, and activity are all describable by the same unifying concept, that is non-reciprocal (NR) coupling. We demonstrate that characteristic thermodynamic features of these intrinsically nonequilibrium systems are…

While classical concentration inequalities are typically restricted to two special cases -- independence and martingale difference sequences -- we extend concentration inequalities to a much broader class of stochastic processes by relaxing…

We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties for the environment as seen from the position of the walker,…

We study how the Hurst exponent $\alpha$ depends on the fraction $f$ of the total time $t$ remembered by non-Markovian random walkers that recall only the distant past. We find that otherwise nonpersistent random walkers switch to…

This paper deals with different models of random walks with a reinforced memory of preferential attachment type. We consider extensions of the Elephant Random Walk introduced by Sch\"utz and Trimper [2004] with a stronger reinforcement…

We present a randomization-based inferential framework for experiments characterized by a strongly ignorable assignment mechanism where units have independent probabilities of receiving treatment. Previous works on randomization tests often…

Motivated by the psychological literature on the "peak-end rule" for remembered experience, we perform an analysis within a random walk framework of a discrete choice model where agents' future choices depend on the peak memory of their…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…

Probabilistic models of random walks in random sceneries give rise to examples of probability-preserving dynamical systems. A point in the state spaces consists of a walk-trajectory and a scenery, and its `motion' corresponds to shifting…

We study properties of a non-Markovian random walk $X^{(n)}_l$, $l =0,1,2, >...,n$, evolving in discrete time $l$ on a one-dimensional lattice of integers, whose moves to the right or to the left are prescribed by the…

We present a random walk model that exhibits asymptotic subdiffusive, diffusive, and superdiffusive behavior in different parameter regimes. This appears to be the first instance of a single random walk model leading to all three forms of…

Many consumer decisions are repeated choices under uncertainty. Standard models capture these decisions using Bayesian learning and dynamic programming: consumers update beliefs from feedback and use those beliefs to guide future choices.…

Let $\{\boldsymbol{X}_n\}$ be a discrete-time $d$-dimensional process on $\mathbb{Z}_+^d$ with a supplemental (background) process $\{J_n\}$ on a finite set and assume the joint process $\{\boldsymbol{Y}_n\}=\{(\boldsymbol{X}_n,J_n)\}$ to…

Discrete random structures are important tools in Bayesian nonparametrics and the resulting models have proven effective in density estimation, clustering, topic modeling and prediction, among others. In this paper, we consider nested…

We initiate a study of supervised learning from many independent sequences ("trajectories") of non-independent covariates, reflecting tasks in sequence modeling, control, and reinforcement learning. Conceptually, our multi-trajectory setup…

We consider a model, introduced by Boldrighini, Minlos and Pellegrinotti, of random walks in dynamical random environments on the integer lattice Z^d with d>=1. In this model, the environment changes over time in a Markovian manner,…