Results 21 to 30 of about 125,107 (311)
Random walk with barycentric self-interaction [PDF]
We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory $(X_1,...,X_n)
Volkov, S. +13 more
core +2 more sources
Directed random walk with random restarts: The Sisyphus random walk [PDF]
In this paper we consider a particular version of the random walk with restarts: random reset events which suddenly bring the system to the starting value. We analyze its relevant statistical properties, like the transition probability, and show how an equilibrium state appears.
Montero Torralbo, Miquel +1 more
openaire +3 more sources
A Review of Random Walk-Based Method for the Identification of Disease Genes and Disease Modules
Traditional techniques for identifying disease genes and disease modules involve high-cost clinical experiments and unpredictable time consumption for analysis.
Tay Xin Hui +9 more
doaj +1 more source
Logarithmic speeds for one-dimensional perturbed random walk in random environment [PDF]
We study the random walk in random environment on Z+ = f0; 1; 2; : : :g, where the environment is subject to a vanishing (random) perturbation. The two particular cases that we consider are: (i) random walk in random environment perturbed from Sinai's ...
Menshikov, MV +7 more
core +2 more sources
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 +5 more sources
Random walk in random environment with asymptotically zero perturbation [PDF]
We give criteria for ergodicity, transience and null recurrence for the random walk in random environment on \Z+={0,1,2,…}, with reflection at the origin, where the random environment is subject to a vanishing perturbation.
Menshikov, MV +5 more
core +2 more sources
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
Local Random Walk Based Label Propagation Algorithm [PDF]
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
SARW: Similarity-Aware Random Walk for GCN [PDF]
Graph Convolutional Network (GCN) is an important method for learning graph representations of nodes. For large-scale graphs, the GCN could meet with the neighborhood expansion phenomenon, which makes the model complexity high and the training time long.
Wu, Ou +6 more
core +1 more source
On random walks and switched random walks on homogeneous spaces
AbstractWe prove new mixing rate estimates for the random walks on homogeneous spaces determined by a probability distribution on a finite group$G$. We introduce the switched random walk determined by a finite set of probability distributions on$G$, prove that its long-term behaviour is determined by the Fourier joint spectral radius of the ...
Elvira Moreno, Mauricio Velasco
openaire +3 more sources

