Results 21 to 30 of about 251,555 (277)
Current Trends in Random Walks on Random Lattices
Mathematics, 2021 In a classical random walk model, a walker moves through a deterministic d-dimensional integer lattice in one step at a time, without drifting in any direction.
Jewgeni H. Dshalalow, Ryan T. White
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 +3 more sources
Osculating Random Walks on Cylinders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before.
Saibal Mitra, Bernard Nienhuis
doaj +1 more source
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
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
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 Theoretical Probability, 2019 We introduce a new type of random walk where the definition of edge reinforcement is very different from the one in the reinforced random walk models studied so far, and investigate its basic properties, such as null/positive recurrence, transience, and speed. Two basic cases will be dubbed "impatient" and"ageing" random walks.
János Engländer, Stanislav Volkov
openaire +2 more sources
Maximal dispersion of adaptive random walks
Physical Review Research, 2022 Maximum entropy random walks (MERWs) are maximally dispersing and play a key role in optimizing information spreading in various contexts. However, building MERWs comes at the cost of knowing beforehand the global structure of the network, a requirement ...
Gabriele Di Bona +3 more
doaj +1 more source
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