Related papers: Activated Random Walks on $\mathbb{Z}$ with Critic…
Self-organized criticality in the Hwa-Kardar model of "running sandpile" [Phys. Rev. A 45, 7002 (1992)] with a turbulent motion of the environment taken into account is studied with the field theoretic renormalization group (RG). The…
The scaling properties of a random walker subject to the global constraint that it needs to visit each site an even number of times are determined. Such walks are realized in the equilibrium state of one dimensional surfaces that are…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
A correlated Gaussian random walk(CGRW) model is proposed as a simple model of animal dispersal. The general features of CGRW is described. We will discuss how from this single model a number of different kinds of correlated random walk can…
Using molecular simulations, we identify microscopic relaxation events of individual particles in ageing structural glasses, and determine the full distribution of relaxation times. We find that the memory of the waiting time $t_w$ elapsed…
Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by…
We discuss the model of a one-dimensional, discrete-time walk on a line with spatial heterogeneity in the form of a variable set of ultrametric barriers. Inspired by the homogeneous quantum walk on a line, we develop a formalism by which…
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and…
We consider excited random walk (ERW) on $\mathbb{Z}$ in environments with identical stacks of infinitely many cookies at each site, subject to the constraint that the total drift per site $\delta = \sum (2p_j - 1)$ is finite. Building on…
It is often asserted in the literature that one should expect positive autocorrelation for random walk Metropolis-Hastings (RWMH), especially if the typical proposal step-size is small relative to the variability in the target density. In…
We introduce a class of multifractal processes, referred to as Multifractal Random Walks (MRWs). To our knowledge, it is the first multifractal processes with continuous dilation invariance properties and stationary increments. MRWs are…
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…
The dynamics of a discrete-time quantum walk (DTQW) can be realized within a purely classical interacting particle system composed of some boxes and a large but finite number of balls, and can, in principle, be implemented in a tabletop…
Subordinating a random walk to a renewal process yields a continuous time random walk (CTRW) model for diffusion, including the possibility of anomalous diffusion. Transition densities of scaling limits of power law CTRWs have been shown to…
Active particles such as swimming bacteria or self-propelled colloids are known to spontaneously organize into fascinating large-scale dynamic structures. The emergence of these collective states from the motility pattern of the individual…
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…
The main aim of the present paper is to define an active particle in a quantum framework as a minimal model of quantum active matter and investigate the differences and similarities of quantum and classical active matter. Although the field…
The Random Walk Metropolis (RWM) algorithm is a Metropolis- Hastings MCMC algorithm designed to sample from a given target distribution \pi with Lebesgue density on R^N. RWM constructs a Markov chain by randomly proposing a new position…
We introduce a new random walk with unbounded memory obtained as a mixture of the Elephant Random Walk and the Dynamic Random Walk which we call the Dynamic Elephant Random Walk (DERW). As a consequence of this mixture the distribution of…