Related papers: A Universal Algorithm for Continuous Time Random W…
In this issue we demonstrate the very inspiring role of the continuous-time random walk (CTRW) formalism and its numerous modifications thanks to their flexibility and various applications as well its promising perspectives in different…
We study financial distributions within the framework of the continuous time random walk (CTRW). We review earlier approaches and present new results related to overnight effects as well as the generalization of the formalism which embodies…
We briefly review the principles, mathematical bases, numerical shortcuts and applications of fast random walk (FRW) algorithms. This Monte Carlo technique allows one to simulate individual trajectories of diffusing particles in order to…
This paper derives and analyzes continuous time random walk (CTRW) models in radial flow geometries for the quantification of non-local solute transport induced by heterogeneous flow distributions and by mobile-immobile mass transfer…
Continuous time random Walk model has been versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as disordered or porous media. We are studying the continuous limits of Heterogeneous…
We introduce a discrete-time quantum random walk (QRW) framework for spatial epidemic modelling on a two-dimensional square lattice and compare its dynamics to classical random-walk SIR models. In our model, each infected site spawns a…
We give a complete and unified description -- under some stability assumptions -- of the functional scaling limits associated with some persistent random walks for which the recurrent or transient type is studied in [1]. As a result, we…
Random walks (RWs) are fundamental stochastic processes with applications across physics, computer science, and information processing. A recent extension, the laser chaos decision-maker, employs chaotic time series from semiconductor…
In this note we study dynamical random walks (DRW) with internal states. We consider a particle which performs a dynamical random walk on $\mathbb{Z}$ and whose local dynamics is given by expanding maps. We provide sufficient conditions for…
It is proved that the distributions of scaling limits of Continuous Time Random Walks (CTRWs) solve integro-differential equations akin to Fokker-Planck Equations for diffusion processes. In contrast to previous such results, it is not…
Due to the massively increasing amount of available geospatial data and the need to present it in an understandable way, clustering this data is more important than ever. As clusters might contain a large number of objects, having a…
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 develop the idea of non-Markovian CTRW (continuous time random walk) approximation to the evolution of interacting particle systems, which leads to a general class of fractional kinetic measure-valued evolutions with variable order. We…
Flow and multicomponent reactive transport in saturated/unsaturated porous media are modeled by ensembles of computational particles moving on regular lattices according to specific random walk rules. The occupation number of the lattice…
Continuous-time random walks (CTRWs) with drift and position-dependent jumps provide a general framework for describing a wide range of natural and engineered systems. We analyze the stochastic differential equation associated with this…
We define the probability structure of a continuous-time time-homogeneous Markov jump process, on a finite graph, that represents the continuous-time counterpart of the so-called Ruelle-Bowen discrete-time random walk. It constitutes the…
A physical-mathematical approach to anomalous diffusion may be based on generalized diffusion equations (containing derivatives of fractional order in space or/and time) and related random walk models. The fundamental solution (for the…
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we focus on the problem of sampling random walks efficiently in a…
This paper reviews recent advances in continuous-time quantum walks (CTQW) and their application to transport in various systems. The introduction gives a brief survey of the historical background of CTQW. After a short outline of the…
We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC'10] show…