Results 41 to 50 of about 4,476,990 (351)
Adjusting the Trapping Process of a Directed Weighted Edge-Iteration Network
Frontiers in Physics, 2022 Controlling the trapping process is one of the important themes in the study of random walk in real complex systems. We studied two types of random walks that are different from the traditional random walk on a directed weighted network.
Jing Su +7 more
doaj +1 more source
Central limit theorem and related results for the elephant random walk [PDF]
, 2016 We study the so-called elephant random walk (ERW) which is a non-Markovian discrete-time random walk on ℤ with unbounded memory which exhibits a phase transition from a diffusive to superdiffusive behavior.
Cristian F. Coletti, R. Gava, G. Schutz
semanticscholar +1 more source
Random walk polynomials and random walk measures
Journal of Computational and Applied Mathematics, 1993 AbstractRandom walk polynomials and random walk measures play a prominent role in the analysis of a class of Markov chains called random walks. Without any reference to random walks, however, a random walk polynomial sequence can be defined (and will be defined in this paper) as a polynomial sequence{Pn(x)} which is orthogonal with respect to a measure
Pauline Schrijner, Erik A. van Doorn
openaire +3 more sources
Random walks with random velocities [PDF]
Physical Review E, 2008 We consider a random walk model that takes into account the velocity distribution of random walkers. Random motion with alternating velocities is inherent to various physical and biological systems. Moreover, the velocity distribution is often the first characteristic that is experimentally accessible. Here, we derive transport equations describing the
Zaburdaev, Vasily +2 more
openaire +3 more sources
Random walk over a hypersphere
International Journal of Mathematics and Mathematical Sciences, 1985 In a recent paper the author had shown that a special case of S. M. Joshi transform (so named after the author's reverent father) of distributions (Sba f)(x)=〈f(y), lFl(a0;b0;ixy) lFl(a;b;−2ixy)〉 is a characteristic function of a spherical ...
J. M. C. Joshi
doaj +1 more source
Strategies and first-absorption times in the random walk game [PDF]
Известия высших учебных заведений: Прикладная нелинейная динамика, 2023 Purpose of this work is to determine the average time to reach the boundaries, as well as to identify the strategy in the game between two players, controlling point movements on the finite square lattice using an independent choice of strategies.
Krivonosov, Mikhail Igorevich +1 more
doaj +1 more source
The Annals of Probability, 1996 We estimate the expected mixing time of a random walk on a finite group supported by a random polylogarithmic set of elements. Following the spectral approach of Broder and Shamir, we present an alternative proof of the Dou-Hildebrand estimate and show that it holds almost surely. Good bounds on diameters follow from these results.
openaire +3 more sources
Statistical modelling of rate gyros based on fully overlapping Allan variance
IET Science, Measurement & Technology, 2022 Angular random walk and rate random walk are two dominant random noise components which are inherent in almost gyroscopes. Therefore, modelling these noise components accurately is very important. Here, a modified algorithm is proposed for estimating the
Yong Gil Ri +2 more
doaj +1 more source
Local Random Walk Based Label Propagation Algorithm [PDF]
Jisuanji kexue, 2022 Community structure is one of the important characteristics of complex networks.Identifying communities of different functions in a network plays an important role for revealing important characteristics of complex networks.The community discovery ...
LIU Yang, ZHENG Wen-ping, ZHANG Chuan, WANG Wen-jian
doaj +1 more source
Random recursive trees and the elephant random walk. [PDF]
Physical Review E, 2015 One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees.
R. Kürsten
semanticscholar +1 more source