Results 21 to 30 of about 1,809,097 (279)
Random walks with barriers [PDF]
Nature Physics, 2011 Restrictions to molecular motion by barriers (membranes) are ubiquitous in porous media, composite materials and biological tissues. A major challenge is to characterize the microstructure of a material or an organism nondestructively using a bulk transport measurement.
Novikov, Dmitry S. +3 more
openaire +2 more sources
Multifractal random walk [PDF]
Physical Review E, 2001 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 very attractive alternative processes to classical cascade-like multifractal models since they do not involve any ...
Bacry, Emmanuel, Delour, J., Muzy, J. F.
openaire +4 more sources
Continuous-time random walks and Lévy walks with stochastic resetting
Physical Review Research, 2020 Intermittent stochastic processes appear in a wide field, such as chemistry, biology, ecology, and computer science. This paper builds up the theory of intermittent continuous-time random walk (CTRW) and Lévy walk, in which the particles are ...
Tian Zhou, Pengbo Xu, Weihua Deng
doaj +1 more source
Electronic Journal of Probability, 2015 42 pages, 6 ...
Hilário, M.R. +4 more
openaire +8 more sources
Random Walk on the Range of Random Walk [PDF]
Journal of Statistical Physics, 2009 We study the random walk $X$ on the range of a simple random walk on $\mathbb{Z}^d$ in dimensions $d\geq 4$. When $d\geq 5$ we establish quenched and annealed scaling limits for the process $X$, which show that the intersections of the original simple random walk path are essentially unimportant.
openaire +4 more sources
Quantum walk neural networks with feature dependent coins
Applied Network Science, 2019 Recent neural networks designed to operate on graph-structured data have proven effective in many domains. These graph neural networks often diffuse information using the spatial structure of the graph.
Stefan Dernbach +4 more
doaj +1 more source
Journal of Applied Probability, 2014 This paper provides tools for the study of the Dirichlet random walk in Rd. We compute explicitly, for a number of cases, the distribution of the random variable W using a form of Stieltjes transform of W instead of the Laplace transform, replacing the Bessel functions with hypergeometric functions. This enables us to simplify some existing results, in
G. Letac, PICCIONI, MAURO
openaire +6 more sources
Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted.
Lorenz A. Gilch
doaj +1 more source
Combinatorics, Probability and Computing, 2013 We study a discrete time self-interacting random process on graphs, which we call greedy random walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not yet been crossed by the walker.
Orenshtein T., Shinkar I.
openaire +4 more sources
A Note on k-Bonacci Random Walks
Fractal and Fractional, 2023 In this work, the probability of return for random walks on Z, whose increment is given by the k-bonacci sequence, is determined. Additionally, the Hausdorff, packing and box-counting dimensions of the set of these walks that return an infinite number of
Najmeddine Attia +3 more
doaj +1 more source