Related papers: Renewal theory for random walks on surface groups

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

Certain renewal theorems are extended to the case that the rate of the renewal process goes to 0 and, more generally, to the case that the drift of the random walk goes to infinity. These extensions are motivated by and applied to the…

In a recent paper of Eichelsbacher and Koenig (2008) the model of ordered random walks has been considered. There it has been shown that, under certain moment conditions, one can construct a k-dimensional random walk conditioned to stay in…

Annealed functional CLT in the rough path topology is proved for the standard class of ballistic random walks in random environment. Moreover, the `area anomaly', i.e. a deterministic linear correction for the second level iterated integral…

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

We prove a quenched central limit theorem for random walks with bounded increments in a randomly evolving environment on $\mathbb{Z}^d$. We assume that the transition probabilities of the walk depend not too strongly on the environment and…

We consider recurrent diffusive random walks on a strip. We present constructive conditions on Green functions of finite sub-domains which imply a Central Limit Theorem with polynomial error bound, a Local Limit Theorem, and mixing of…

We consider continuous time random walks (CTRW) for open systems that exchange energy and matter with multiple reservoirs. Each waiting time distribution (WTD) for times between steps is characterized by a positive parameter a, which is set…

Starting from a simple animal-biology example, a general, somewhat counter-intuitive property of diffusion random walks is presented. It is shown that for any (non-homogeneous) purely diffusing system, under any isotropic uniform incidence,…

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

We consider random walk on the structure given by a random hypergraph in the regime where there is a unique giant component. We give the asymptotics for hitting times, cover times, and commute times and show that the results obtained for…

In this article, the continuous time random walk on the circle is studied. We derive the corresponding generalized master equation and discuss the effects of topology, especially important when Levy flights are allowed. Then, we work out…

We introduce a new type of random walk where the definition of edge reinforcement is very different from the one in the reinforced random walk models studied so far, and investigate its basic properties, such as null/positive recurrence,…

We consider nonintersecting random walks satisfying the condition that the increments have a finite moment generating function. We prove that in a certain limiting regime where the number of walks and the number of time steps grow to…

There exist important stochastic physical processes involving infinite mean waiting times. The mean divergence has dramatic consequences on the process dynamics. Fractal time random walks, a diffusion process, and subrecoil laser cooling, a…

Renewal theorems are developed for point processes with interarrival times $W_n=\xi(X_{n+1}X_n\cdots)$, where $(X_n)_{n\in\mathbb Z}$ is a stochastic process with finite state space $\Sigma$ and $\xi\colon\Sigma_A\to\mathbb R$ is a H\"older…

We construct, for each real number $0\leq \alpha \leq 1$, a random walk on a finitely generated semigroup whose speed exponent is $\alpha$. We further show that the speed function of a random walk on a finitely generated semigroup can be…

Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…

Using the results of Ding, Lee, Peres [3], we develop formulas to compute the hitting times and cover times for random walks on groups. We developed an explicit formula for hitting times in terms of the irreducible representations of the…

In this paper we consider a particular version of the random walk with restarts: random reset events which bring suddenly the system to the starting value. We analyze its relevant statistical properties like the transition probability and…