Related papers: Greedy walks on two lines
The group of affine transformations with rational coefficients acts naturally on the real line, but also on the $p$-adic fields. The aim of this note is to show that, for random walks whose laws have a finite first moment, all these actions…
Navigation on graphs is the problem how an agent walking on the graph can get from a source to a target with limited information about the graph. The information and the way to exploit it can vary. In this paper, we study navigation on…
We study one-dimensional excited random walks with non-nearest neighbor jumps. When the process is at a vertex that has not been visited before, its next transition has a positive drift to the right, possibly with long jumps. Whenever the…
We consider a generalization of a one-dimensional stochastic process known in the physical literature as L\'evy-Lorentz gas. The process describes the motion of a particle on the real line in the presence of a random array of marked points,…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…
In this note, we compute the probability that a two-dimensional symmetric random walk visits more vertices than expected, for deviations on scales between the mean behavior and linear growth.
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 analyze a class of continuous time random walks in $\mathbb R^d,d\geq 2,$ with uniformly distributed directions. The steps performed by these processes are distributed according to a generalized Dirichlet law. Given the number of changes…
Consider the continuous greedy paths model: given a $d$-dimensional Poisson point process with positive marks interpreted as masses, let $\mathrm P(\ell)$ denote the maximum mass gathered by a path of length $\ell$ starting from the origin.…
We introduce and formulate two types of random-walk domination problems in graphs motivated by a number of applications in practice (e.g., item-placement problem in online social network, Ads-placement problem in advertisement networks, and…
The Poisson process is the most elementary continuous-time stochastic process that models a stream of repeating events. It is uniquely characterised by a single parameter called the rate. Instead of a single value for this rate, we here…
We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no…
We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…
A particle moves among the vertices of an $(m+1)$-gon which are labeled clockwise as $0,1,...,m$. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability $p$, or…
We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.
In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…
We consider the simple random walk on random graphs generated by discrete point processes. This random graph has a random subset of a cubic lattice as the vertices and lines between any consecutive vertices on lines parallel to each…
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…
We investigate the role of greed on the lifetime of a random-walking forager on an initially resource-rich lattice. Whenever the forager lands on a food-containing site, all the food there is eaten and the forager can hop $\mathcal{S}$ more…