Results 31 to 40 of about 125,107 (311)
Edge reinforced random walk on Galton-Watson trees [PDF]
, 2023 reservedConsider a random walk in a graph and introduce a reinforcement on the edges so that the ones already traversed are more likely to be traversed in the future. We call such a process edge reinforced random walk (ERRW).
CARLON, GIOVANNI
core
RAM. Revista de Administração Mackenzie, 2021 Purpose: This research examines the superiority of analysts over random walk models in forecasting the results of publicly-traded Brazilian companies in the short and long term. Originality/value: The literature indicates the uncontested superiority
Rafael C. Gatsios +3 more
doaj +1 more source
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
Random Walks with Invariant Loop Probabilities: Stereographic Random Walks [PDF]
Entropy, 2021 Random walks with invariant loop probabilities comprise a wide family of Markov processes with site-dependent, one-step transition probabilities. The whole family, which includes the simple random walk, emerges from geometric considerations related to the stereographic projection of an underlying geometry into a line.
openaire +4 more sources
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
Random walks on the random graph [PDF]
The Annals of Probability, 2018 We study random walks on the giant component of the Erdős–Rényi random graph G(n,p) where p=λ/n for λ>1 fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald, to have order log2n.
Berestycki, Nathanaël +3 more
openaire +6 more sources
Identifying diseases-related metabolites using random walk
BMC Bioinformatics, 2018 Background Metabolites disrupted by abnormal state of human body are deemed as the effect of diseases. In comparison with the cause of diseases like genes, these markers are easier to be captured for the prevention and diagnosis of metabolic diseases ...
Yang Hu +5 more
doaj +1 more source
Critical dimensions for random walks on random-walk chains [PDF]
Physical Review E, 1996 The probability distribution of random walks on linear structures generated by random walks in $d$-dimensional space, $P_d(r,t)$, is analytically studied for the case $ξ\equiv r/t^{1/4}\ll1$. It is shown to obey the scaling form $P_d(r,t)=ρ(r) t^{-1/2} ξ^{-2} f_d(ξ)$, where $ρ(r)\sim r^{2-d}$ is the density of the chain. Expanding $f_d(ξ)$ in powers of
Rabinovich S. +3 more
openaire +3 more sources
A Novel Algorithm of Quantum Random Walk in Server Traffic Control and Task Scheduling
Journal of Applied Mathematics, 2014 A quantum random walk optimization model and algorithm in network cluster server traffic control and task scheduling is proposed. In order to solve the problem of server load balancing, we research and discuss the distribution theory of energy field in ...
Dong Yumin, Xiao Shufen
doaj +1 more source
A random walk down Main Street
TeMA: Journal of Land Use, Mobility and Environment, 2016 US suburbs have often been characterized by their relatively low walk accessibility compared to more urban environments, and US urban environments have been char- acterized by low walk accessibility compared to cities in other countries.
David Matthew Levinson
doaj +1 more source