Related papers: Transience and recurrence of sets for branching ra…
We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…
For a branching process in random environment it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. Interestingly there is the possibility that the…
The notion of degree and related notions concerning recurrence and transience for a class of L'evy processes on metric Abelian groups are studied. The case of random walks on a hierarchical group is examined with emphasis on the role of the…
For a random walk $S_n$ on $\mathbb{R}^d$ we study the asymptotic behaviour of the associated centre of mass process $G_n = n^{-1} \sum_{i=1}^n S_i$. For lattice distributions we give conditions for a local limit theorem to hold. We prove…
In this work we consider a stochastic movement process with random resets to the origin followed by a random residence time there before the walker restarts its motion. First, we study the transport properties of the walker, we derive an…
We study recurrence properties and the validity of the (weak) law of large numbers for (discrete time) processes which, in the simplest case, are obtained from simple symmetric random walk on $\Z$ by modifying the distribution of a step…
We study the occupation measure of various sets for a symmetric transient random walk in $Z^d$ with finite variances. Let $\mu^X_n(A)$ denote the occupation time of the set $A$ up to time $n$. It is shown that $\sup_{x\in…
We study branching processes in an i.i.d. random environment, where the associated random walk is of the oscillating type. This class of processes generalizes the classical notion of criticality. The main properties of such branching…
We study the recurrence behaviour of random walks on partially oriented honeycomb lattices. The vertical edges are undirected while the orientation of the horizontal edges is random: depending on their distribution, we prove a.s. transience…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
We study memory based random walk models to understand diffusive motion in crowded heterogeneous environment. The models considered are non-Markovian as the current move of the random walk models is determined by randomly selecting a move…
We study, on a $d$ dimensional hypercubic lattice, a random walk which is homogeneous except for one site. Instead of visiting this site, the walker hops over it with arbitrary rates. The probability distribution of this walk and the…
This paper is concerned with the limit theory of the extreme order statistics derived from random walks. We establish the joint convergence of the order statistics near the minimum of a random walk in terms of the Feller chains. Detailed…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical…
The aim of this note is to extend the result of Angel and Holroyd concerning the transience and the recurrence of transfinite rotor-router walks, for random initial configuration of rotors on homogeneous trees. We address the same question…
We prove that if $(X_n)_{n\geq 0}$ is a random walk on a transient graph such that the Green's function decays at least polynomially along the random walk, then $(X_n)_{n\geq 0}$ has infinitely many cut times almost surely. This condition…
Aldous [1] asked whether every graph in which the distribution of the return time of random is independent of the starting vertex must be transitive. We remark that this question can be reduced into a purely graph-theoretic one that had…