Related papers: A multifractal random walk
Continuous-time random walks (CTRW) play important role in understanding of a wide range of phenomena. However, most theoretical studies of these models concentrate only on stationary-state dynamics. We present a new theoretical approach,…
Standard continuous time random walk (CTRW) models are renewal processes in the sense that at each jump a new, independent pair of jump length and waiting time are chosen. Globally, anomalous diffusion emerges through action of the…
In this paper, we present a numerical framework for constructing bounds on stationary performance measures of random walks in the positive orthant using the Markov reward approach. These bounds are established in terms of stationary…
In this paper, we consider a spectral analysis of the Correlated Random Walk (CRW) on the path. We apply an analytical method for the Quantum Walk to CRW. For the isospectral coin cases, we obtain all of the eigenvalues and the…
We study multifractal properties in time evolution of a single particle subject to repeated measurements. For quantum systems, we consider circuit models consisting of local unitary gates and local projective measurements. For classical…
We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any $m$ and $k$ a random walk with $k$-wise independent steps which has no stationary distribution modulo $m$.
We obtain expected number of arrivals, probability of arrival, absorption probabilities and expected time before absorption for a modified discrete random walk on the (sub)set of integers. In a [pqrs] random walk the particle can move one…
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…
In this paper, we determine the almost sure multifractal spectrum of a class of random functions constructed as sums of pulses with random dilations and translations. In addition, the continuity modulii of these functions is investigated.
Continuous time random walks have been developed as a straightforward generalisation of classical random walk processes. Some 10 years ago, Fogedby introduced a continuous representation of these processes by means of a set of Langevin…
We study the noncolliding random walk (RW), which is a particle system of one-dimensional, simple and symmetric RWs starting from distinct even sites and conditioned never to collide with each other. When the number of particles is finite,…
Branching processes are widely used to model the viral epidemic evolution. For more adequate investigation of viral epidemic modelling, we suggest to apply branching processes with transport of particles usually called branching random…
The random walk is a fundamental stochastic process that underlies many numerical tasks in scientific computing applications. We consider here two neural algorithms that can be used to efficiently implement random walks on spiking…
Various methods have been developed independently to study the multifractality of measures in many different contexts. Although they all convey the same intuitive idea of giving a "dimension" to sets where a quantity scales similarly within…
We introduce tools for inference in the multifractal random walk introduced by Bacry et al. (2001). These tools include formulas for smoothing, filtering and volatility forecasting. In addition, we present methods for computing conditional…
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…
We consider random walks in dynamic random environments and propose a criterion which, if satisfied, allows to decompose the random walk trajectory into i.i.d. increments, and ultimately to prove limit theorems. The criterion involves the…
The Maximal Entropy Random Walk (MERW) is a natural process on a finite graph, introduced a few years ago with motivations from theoretical physics. The construction of this process relies on Perron-Frobenius theory for adjacency matrices.…
The random walk Metropolis (RWM) is one of the most common Markov chain Monte Carlo algorithms in practical use today. Its theoretical properties have been extensively explored for certain classes of target, and a number of results with…
We analyze invariant measures of two coupled piecewise linear and everywhere expanding maps on the synchronization manifold. We observe that though the individual maps have simple and smooth functions as their stationary densities, they…