相关论文: A note on edge oriented reinforced random walks an…

This paper introduces a new Importance Sampling scheme, called Adaptive Twisted Importance Sampling, which is adequate for the improved estimation of rare event probabilities in he range of moderate deviations pertaining to the empirical…

Issues of resonance that appear in non-standard random walk models are discussed. The first walk is called repulsive delayed random walk, which is described in the context of a stick balancing experiment. It will be shown that a type of…

The loop-erased random walk (LERW) in $ \Z^d, d \geq 2$, is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW…

We extend the notion of the associated random walk and the Wald martingale in random walks where the increments are independent and identically distributed to the more general case of stationary ergodic increments. Examples are given where…

We develop nonlinear renewal theorems for a perturbed random walk without assuming stochastic boundedness of centered perturbation terms. A second order expansion of the expected stopping time is obtained via the uniform integrability of…

Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the `quenched' and the `averaged' case.

This paper introduces a flight envelope protection algorithm on a longitudinal axis that leverages reinforcement learning (RL). By considering limits on variables such as angle of attack, load factor, and pitch rate, the algorithm…

We prove that the only nearest neighbor jump process with local dependence on the occupation times satisfying the partial exchangeability property is the vertex reinforced jump process, under some technical conditions. This result gives a…

The step-reinforced random walk (SRRW), where each step may replicate a randomly chosen past step, exhibits complex dependencies on the history. This paper introduces a generalized SRRW on groups, incorporating arbitrary transformations of…

We consider simple random walks on random graphs embedded in $\mathbb{R}^d$ and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we…

Graph embedding has recently gained momentum in the research community, in particular after the introduction of random walk and neural network based approaches. However, most of the embedding approaches focus on representing the local…

In the information overloaded web, personalized recommender systems are essential tools to help users find most relevant information. The most heavily-used recommendation frameworks assume user interactions that are characterized by a…

We develop a technique that provides a lower bound on the speed of transient random walk in a random environment on regular trees. A refinement of this technique yields upper bounds on the first regeneration level and regeneration time. In…

We study the range of a planar random walk on a randomly oriented lattice, already known to be transient. We prove that the expectation of the range grows linearly, in both the quenched (for a.e. orientation) and annealed ("averaged")…

We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition…

We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…

These notes cover one of the topics programmed for the St Petersburg School in Probability and Statistical Physics of June 2012. The aim is to review recent mathematical developments in the field of random walks in random environment. Our…

A random walk with echoed steps (RWES) is a process $\{\tilde{S}_n\}_{n\geq1}=\{\tilde{X}_1+\cdots+\tilde{X}_n\}_{n\geq1}$ that inserts memory and echo into an ordinary random walk (ORW) with i.i.d. steps, $X_1+\cdots+X_n$. The RWES is…

A $\delta$ once-reinforced random walk ($\delta$-ORRW) on connected graph is a self-interacting random walk which moves to its neighbors at each step according to the weights of the edges at that time, where the weights are $1$ on edges…

We consider a recurrent random walk (RW) in random environment (RE) on a strip. We prove that if the RE is i. i. d. and its distribution is not supported by an algebraic subsurface in the space of parameters defining the RE then the RW…