Results 1 to 10 of about 2,612,449 (235)
RRW: repeated random walks on genome-scale protein networks for local cluster discovery [PDF]
BMC Bioinformatics, 2009 Background We propose an efficient and biologically sensitive algorithm based on repeated random walks (RRW) for discovering functional modules, e.g., complexes and pathways, within large-scale protein networks.
Can Tolga, Macropol Kathy, Singh Ambuj K
doaj +9 more sources
Repeated Measurements and Random Scattering in Quantum Walks [PDF]
Journal of Physics A: Mathematical and TheoreticalWe study the effect of random scattering in quantum walks on a finite graph and compare it with the effect of repeated measurements. To this end, a constructive approach is employed by introducing a localized and a delocalized basis for the underlying ...
Klaus Ziegler
exaly +6 more sources
Repeated Quantum Interactions and Unitary Random Walks [PDF]
Journal of Theoretical Probability, 2010 Among the discrete evolution equations describing a quantum system $\rH_S$ undergoing repeated quantum interactions with a chain of exterior systems, we study and characterize those which are directed by classical random variables in $\RR^N$. The characterization we obtain is entirely algebraical in terms of the unitary operator driving the elementary ...
Ameur Dhahri, Stephane Attal
exaly +10 more sources
Repeated Bond Traversal Probabilities for the Simple Random Walk [PDF]
Journal of Physics A, 2002 We consider the average number B_m(t) of bonds traversed exactly m times by a t step simple random walk. We determine B_m(t) explicitly in the scaling limit t -> oo with m/sqrt(t) fixed in dimension d=1 and m/log(t) fixed in dimension d=2. The scaling function is an erfc in d=1 and an exponential in d=2.
Royce King-Ping Zia +2 more
exaly +4 more sources
Strong Convergence of Quantum Random Walks Via Semigroup Decomposition [PDF]
Annales de l'Institute Henri Poincare. Physique theorique, 2017 We give a simple and direct treatment of the strong convergence of quantum random walks to quantum stochastic operator cocycles, via the semigroup decomposition of such cocycles.
A. Belton, Michał Gnacik, J. Lindsay
semanticscholar +4 more sources
Journal of Statistical Physics, 1985 The previously developed formalism for the calculation of asymptotic properties of multistate random walks is used to study random walks on several inhomogeneous periodic lattices, where the periodically repeated unit cell contains a number of ...
J. Roerdink, K. E. Shuler
exaly +2 more sources
Strong limit theorems for step-reinforced random walks [PDF]
Stochastic Processes and their Applications, 2023 A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at random, and with ...
Zhi-Shui Hu, Yiting Zhang
semanticscholar +1 more source
On a Class of Random Walks with Reinforced Memory [PDF]
Journal of statistical physics, 2019 This paper deals with different models of random walks with a reinforced memory of preferential attachment type. We consider extensions of the Elephant Random Walk introduced by Schütz and Trimper (Phys Rev E 70:044510(R), 2004) with stronger ...
Erich Baur
semanticscholar +2 more sources
SUREL+: Moving from Walks to Sets for Scalable Subgraph-based Graph Representation Learning [PDF]
Proceedings of the VLDB Endowment, 2023 Subgraph-based graph representation learning (SGRL) has recently emerged as a powerful tool in many prediction tasks on graphs due to its advantages in model expressiveness and generalization ability.
Hao-Teng Yin +3 more
semanticscholar +1 more source
Uncertainty Relation between Detection Probability and Energy Fluctuations
Entropy, 2021 A classical random walker starting on a node of a finite graph will always reach any other node since the search is ergodic, namely it fully explores space, hence the arrival probability is unity.
Felix Thiel +3 more
doaj +1 more source