Related papers: A multifractal random walk
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 consider simple random walks on random graphs embedded in $\mathbb{R}^d$ and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we…
Continuous Time Random Walks (CTRWs) are jump processes with random waiting times between jumps. We study scaling limits for CTRWs where the distribution of jumps and waiting times is coupled and varies in space and time. Such processes…
Quantum random walks (QRWs) are random processes in which the resulting probability density of the "walker" state, whose movement is governed by a "coin" state, is described in a non-classical manner. Previously, Q-plates have been used to…
Fluctuations in the return time statistics of a dynamical system can be described by a new spectrum of dimensions. Comparison with the usual multifractal analysis of measures is presented, and difference between the two corresponding sets…
The usual development of the continuous-time random walk (CTRW) proceeds by assuming that the present is one of the jumping times. Under this restrictive assumption integral equations for the propagator and mean escape times have been…
The Continuous Time Random Walk (CTRW) formalism is used to model the non-Poisson relaxation of a system response to perturbation. Two mechanisms to perturb the system are analyzed: a first in which the perturbation, seen as a potential…
A method is established which allows the calculation of the walk dimension for Sierpinski-type multifractals. The multifractal scaling behaviour of the average time needed to cover a distance in the mentionned multifractals is shown. For…
Based on the theory of continuous time random walks (CTRW), we build the models of characterizing the transitions among anomalous diffusions with different diffusion exponents, often observed in natural world. In the CTRW framework, we take…
Quantum walks (QWs) exhibit different properties compared with classical random walks (RWs), most notably by linear spreading and localization. In the meantime, random walks that replicate quantum walks, which we refer to as…
The Random Parameters model was proposed to explain the structure of the covariance matrix in problems where most, but not all, of the eigenvalues of the covariance matrix can be explained by Random Matrix Theory. In this article, 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…
Time evolutions whose infinitesimal generator is a fractional time derivative arise generally in the long time limit. Such fractional time evolutions are considered here for random walks. An exact relationship is given between the…
In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…
We study the persistence probability for processes with stationary increments. Our results apply to a number of examples: sums of stationary correlated random variables whose scaling limit is fractional Brownian motion, random walks in…
We present a novel mechanism to improve the accuracy of the recently-introduced class of graph random features (GRFs). Our method induces negative correlations between the lengths of the algorithm's random walks by imposing antithetic…
We give three different criteria for transience of a Branching Markov Chain. These conditions enable us to give a classification of Branching Random Walks in Random Environment (BRWRE) on Cayley Graphs in recurrence and transience. This…
We present a new paradigm for creating random features to approximate bi-variate functions (in particular, kernels) defined on general manifolds. This new mechanism of Manifold Random Features (MRFs) leverages discretization of the manifold…
Let $\mu_1,... \mu_k$ be $d$-dimensional probability measures in $\R^d$ with mean 0. At each step we choose one of the measures based on the history of the process and take a step according to that measure. We give conditions for transience…
Discriminative Random Walks (DRWs) are a simple yet powerful tool for semi-supervised node classification, but their theoretical foundations remain fragmentary. We revisit DRWs through the lens of information geometry, treating the family…