相关论文: Active Phase for Activated Random Walk on $\mathbb…
In this note, we prove without using Fourier analysis that the symmetric square integrable random walks in $\Z^{2}$ are recurrent.
We study the critical behavior of the dissipative abelian sandpile model on Z with dissipative sites at arbitrary positions (x_k). This is equivalent to studying whether the expected stopping time of a trapped random walk on Z is finite.…
We study driven-dissipative activated random walk with sleep probability $p$ on an $n$-vertex complete graph with a sink that traps jumping particles with probability $q_n$. We show that the number of sleeping particles $S_n$ left by the…
We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…
In this paper, we study a spatial model for dormancy in random environment via a two-type branching random walk in continuous-time, where individuals can switch between dormant and active states through spontaneous switching independent of…
The jump processes W(t) on [0,\infty[ with transitions w -> alpha w at rate b*w^beta (0 =< alpha =< 1, b>0, beta>0) are considered. Their moments are shown to decay not faster than algebraically for t -> \infty, and an equilibrium…
The Random Walk Pinning Model (RWPM) is a statistical mechanics model in which the trajectory of a continuous time random walk $X=(X_t)_{t\geq 0}$ is rewarded according to the time it spends together with a moving catalyst. More…
We prove that the critical value of the one-dimensional Stochastic Sandpile Model is less than one. This verifies a conjecture of Rolla and Sidoravicius.
The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…
This is an expository paper on the asymptotic results concerning path behaviour of the anisotropic random walk on the two-dimensional square lattice Z^2. In recent years Mikl\'os and the authors of the present paper investigated the…
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…
In this work, we study the effect of a moving detector on a discrete time one dimensional Quantum Random Walk where the movement is realized in the form of hopping/shifts. The occupation probability $f(x,t;n,s)$ is estimated as the number…
We study a system of simple random walks on graphs, known as frog model. This model can be described as follows: There are active and sleeping particles living on some graph G. Each active particle performs a simple random walk with…
In this article, we study the existence of an absorbing-state phase transition of an Abelian process that generalises the Activated Random Walk (ARW). Given a vertex transitive $G=(V,E)$, we associate to each site $x \in V$ a capacity $w_x…
In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…
We prove a quenched functional central limit theorem for a one-dimensional random walk driven by a simple symmetric exclusion process. This model can be viewed as a special case of the random walk in a balanced random environment, for which…
Spatially homogeneous random walks in $(\mathbb{Z}_{+})^{2}$ with non-zero jump probabilities at distance at most 1, with non-zero drift in the interior of the quadrant and absorbed when reaching the axes are studied. Absorption…
We prove a quenched central limit theorem for random walks in i.i.d. weakly elliptic random environments in the ballistic regime. Such theorems have been proved recently by Rassoul-Agha and Sepp\"al\"ainen in [10] and Berger and Zeitouni in…
Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based…
We introduce range-controlled random walks with hopping rates depending on the range $\mathcal{N}$, that is, the total number of previously distinct visited sites. We analyze a one-parameter class of models with a hopping rate…