Related papers: The dependency digraph for irreducible finite-rang…
The probability distribution of random walks on linear structures generated by random walks in $d$-dimensional space, $P_d(r,t)$, is analytically studied for the case $\xi\equiv r/t^{1/4}\ll1$. It is shown to obey the scaling form…
In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…
We present a probabilistic theory of random walks in turbid media with non-scattering regions. It is shown that important characteristics such as diffusion constants, average step lengths, crossing statistics and void spacings can be…
We consider a basic one-dimensional model of diffusion which allows to obtain a diversity of diffusive regimes whose speed depends on the moments of the per-site trapping time. This model is closely related to the continuous time random…
We present a systematic analytical approach to the trapping of a random walk by a finite density rho of diffusing traps in arbitrary dimension d. We confirm the phenomenologically predicted e^{-c_d rho t^{d/2}} time decay of the survival…
This paper is concerned with random walks on a family of dyadic-valued solvable matrix groups. A description of the Poisson boundary of these groups for probability measures of finite first moment and non-zero displacements (or drifts) is…
Vertex-Reinforced Random Walk (VRRW), defined by Pemantle (1988a), is a random process in a continuously changing environment which is more likely to visit states it has visited before. We consider VRRW on arbitrary graphs and show that on…
Simple time-reversible systems can generate {\it irreversible} flows satisfying the Second Law of Thermodynamics. Maps, and equivalent random walks, can also do this. We study a pair of time-reversible Baker Maps, $N2$ and $N3$, which…
We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…
We investigate a self-interacting random walk, whose dynamically evolving environment is a random tree built by the walker itself, as it walks around. At time $n=1,2,\dots$, right before stepping, the walker adds a random number (possibly…
In this paper, we study the critical branching random walk in the critical dimension, $Z^4$. We provide the asymptotics of the probability of visiting a fixed finite subset and the range of the critical branching random walk conditioned on…
We study the isoperimetric profiles of certain families of finitely generated groups defined via marked Schreier graphs and permutation wreath products. The groups we study are among the "simplest" examples within a much larger class of…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
In this paper, we consider fixed edgelength $n$-step random walks in $\mathbb{R}^d$. We give an explicit construction for the closest closed equilateral random walk to almost any open equilateral random walk based on the geometric median,…
We study the discrete quantum groups $\Gamma$ whose group algebra has an inner faithful representation of type $\pi:C^*(\Gamma)\to M_K(\mathbb C)$. Such a representation can be thought of as coming from an embedding $\Gamma\subset U_K$. Our…
A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is…
Let $(Z_n)_{n\in\N}$ be a $d$-dimensional {\it random walk in random scenery}, i.e., $Z_n=\sum_{k=0}^{n-1}Y(S_k)$ with $(S_k)_{k\in\N_0}$ a random walk in $\Z^d$ and $(Y(z))_{z\in\Z^d}$ an i.i.d. scenery, independent of the walk. The…
We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is a.s. transient for the simple random walk. In addition, it has a.s. critical percolation…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…