Related papers: Exact propagators of one-dimensional self-interact…
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We suppose that the distributions of…
The problem of a random walk in a disordered media is mapped into a model of a random walk with memory. The latter model, as opposed to the former one, does not make reference to a particular realization of the disorder. The equivalence of…
In the broadcasting problem on trees, a $\{-1,1\}$-message originating in an unknown node is passed along the tree with a certain error probability $q$. The goal is to estimate the original message without knowing the order in which the…
The Activated Random Walk (ARW) model is a promising candidate for demonstrating self-organized criticality due to its potential for universality. Recent studies have shown that the ARW model exhibits a well-defined critical density in one…
The uncoupled Continuous Time Random Walk (CTRW) in one space-dimension and under power law regime is splitted into three distinct random walks: (rw_1), a random walk along the line of natural time, happening in operational time; (rw_2), a…
Long-distance characteristics of small-world networks have been studied by means of self-avoiding walks (SAW's). We consider networks generated by rewiring links in one- and two-dimensional regular lattices. The number of SAW's $u_n$ was…
This paper is devoted to the study of a new class of random evolutions (RE), so-called self-exciting random evolutions (SEREs), and their applications. We also introduce a new random process $x(t)$ such that it is based on a superposition…
This is a rather personal review of the problem of self-avoiding walks and polygons. After defining the problem, and outlining what is known rigorously and what is merely conjectured, I highlight the major outstanding problems. I then give…
A novel version of the Continuous-Time Random Walk (CTRW) model with memory is developed. This memory means the dependence between arbitrary number of successive jumps of the process, while waiting times between jumps are considered as…
In this thesis, we study the diffusive and ballistic behaviors of random walk in random environment (RWRE) in an integer lattice with dimension at least 2. Our contributions are in three directions: a conditional law of large numbers and…
We offer theoretical explanations for some recent observations in numerical simulations of quantum random walks (QRW). Specifically, in the case of a QRW on the line with one particle (walker) and two entangled coins, we explain the…
We generalize a result from Volkov [Ann. Probab. 29 (2001) 66--91] and prove that, on a large class of locally finite connected graphs of bounded degree $(G,\sim)$ and symmetric reinforcement matrices $a=(a_{i,j})_{i,j\in G}$, the…
We analyze the dynamics of the Sisyphus random walk model, a discrete Markov chain in which the walkers may randomly return to their initial position $x_0$. In particular, we present a remarkably compact derivation of the time-dependent…
A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the…
The continuous-time random walk (CTRW) model is useful for alleviating the computational burden of simulating diffusion in actual media. In principle, isotropic CTRW only requires knowledge of the step-size, $P_l$, and waiting-time, $P_t$,…
Daily, are reported systems in nature that present anomalous diffusion phenomena due to irregularities of medium, traps or reactions process. In this scenario, the diffusion with traps or localised--reactions emerge through various…
It is well known that the weak limit of a suitably scaled continuous-time random walk (CTRW) is the Brownian motion. We investigate the convergence of certain patterned random matrices whose entries are independent CTRWs and their…
The random walk is one of the most basic dynamic properties of complex networks, which has gradually become a research hotspot in recent years due to its many applications in actual networks. An important characteristic of the random walk…
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 propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…