Related papers: Random walk and Fibonacci matrices

We define a random walk on the set of primitive points of $\mathbb{Z}^d$. We prove that for walks generated by measures satisfying mild conditions these walks are recurrent in a strong sense. That is, we show that the associated Markov…

We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found…

In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…

Prudent walks are self-avoiding walks which cannot step towards an already occupied vertex. We introduce a new model of adsorbing prudent walks on the square lattice, which start on an impenetrable surface and accrue a fugacity $a$ with…

First passage under restart has recently emerged as a conceptual framework to study various stochastic processes under restart mechanism. Emanating from the canonical diffusion problem by Evans and Majumdar, restart has been shown to…

The distribution of the first positive position reached by a random walker starting from the origin is fundamental for understanding the statistics of extremes and records in one-dimensional random walks. We present a comprehensive study of…

We consider the discrete time unitary dynamics given by a quantum walk on the lattice $\Z^d$ performed by a quantum particle with internal degree of freedom, called coin state, according to the following iterated rule: a unitary update of…

We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…

Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

We calculate the diffusion coefficients of persistent random walks on cubic and hypercubic lattices, where the direction of a walker at a given step depends on the memory of one or two previous steps. These results are then applied to study…

We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are…

There have been extensive studies of a random walk among a field of immobile traps (or obstacles), where one is interested in the probability of survival as well as the law of the random walk conditioned on its survival up to time $t$. In…

We study the discrete-time quantum walk in one-dimension governed by the Fibonacci transformation .We show localization does not occur for the Fibonacci quantum walk by investigating the stationary distribution of the walk, in addition, we…

A Lindley process arises from classical studies in queueing theory and it usually reflects waiting times of customers in single server models. In this note we study recurrence of its higher dimensional counterpart under some mild…

A return probability of random walks is one of the interesting subjects. As it is well known, the return probability strongly depends on the structure of the space where the random waker moves. On the other hand, the return probability of…

We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…

Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…