• FODE

  • Referenced in 296 articles [sw08377]
  • scenarios such as continuous time random walk models, generalized Langevin equations, or the generalized master...
  • t-SNE

  • Referenced in 176 articles [sw22300]
  • show how t-SNE can use random walks on neighborhood graphs to allow the implicit...
  • node2vec

  • Referenced in 79 articles [sw27202]
  • network neighborhood and design a biased random walk procedure, which efficiently explores diverse neighborhoods...
  • DeepWalk

  • Referenced in 63 articles [sw39604]
  • uses local information obtained from truncated random walks to learn latent representations by treating walks...
  • ALO

  • Referenced in 27 articles [sw41901]
  • hunting prey such as the random walk of ants, building traps, entrapment of ants...
  • CCLS

  • Referenced in 20 articles [sw36049]
  • CCMP variable. By combining CCM with random walk, we design a simple SLS algorithm dubbed ... WPM2 on most industrial, crafted and random instances, indicating the efficiency and the robustness...
  • ramcmc

  • Referenced in 19 articles [sw17890]
  • adapting the shape of the random walk Metropolis proposal as specified by robust adaptive Metropolis...
  • mcmc

  • Referenced in 12 articles [sw14648]
  • unnormalized density. Algorithms are random walk Metropolis algorithm (function metrop), simulated tempering (function temper ... morphometric random walk Metropolis (Johnson and Geyer, Annals of Statistics, 2012, function morph.metrop), which achieves...
  • SA-cluster

  • Referenced in 9 articles [sw06867]
  • performs matrix multiplication to calculate the random walk distances between graph vertices. As part ... clustering process to recalculate the random walk distances which are affected by the edge weight ... Cluster to incrementally update the random walk distances given the edge weight increments. Complexity analysis...
  • metapath2vec

  • Referenced in 10 articles [sw37749]
  • metapath2vec model formalizes meta-path-based random walks to construct the heterogeneous neighborhood...
  • momentuHMM

  • Referenced in 9 articles [sw21676]
  • behavior states; 3) biased and correlated random walk movement models, including ”activity centers” associated with...
  • crawl

  • Referenced in 6 articles [sw21678]
  • package crawl: Fit Continuous-Time Correlated Random Walk Models to Animal Movement Data. Fit continuous ... time correlated random walk models with time indexed covariates to animal telemetry data. The model...
  • Inc-cluster

  • Referenced in 5 articles [sw06866]
  • performs matrix multiplication to calculate the random walk distances between graph vertices. As part ... clustering process to recalculate the random walk distances which are affected by the edge weight ... Cluster to incrementally update the random walk distances given the edge weight increments. Complexity analysis...
  • Bubble-FOS/C

  • Referenced in 8 articles [sw06814]
  • aforementioned relation between FOS/C and random walks, we prove that in vertex-transitive graphs both...
  • CCEHC

  • Referenced in 7 articles [sw36050]
  • hard clauses, and a biased random walk component. Extensive experiments demonstrate that CCEHC significantly outperforms...
  • BayesEstDiffusion.jl

  • Referenced in 7 articles [sw40280]
  • these approaches work. We define a random-walk type Metropolis-Hastings sampler for updating diffusion...
  • HIN2Vec

  • Referenced in 6 articles [sw37750]
  • negative sampling, and cycles in random walks, are examined. To validate our ideas, we learn...
  • Grapham

  • Referenced in 5 articles [sw08541]
  • Grapham: graphical models with adaptive random walk Metropolis algorithms. Recently developed adaptive Markov chain Monte...
  • exitbm

  • Referenced in 3 articles [sw33270]
  • Monte Carlo methods such as the random walk on squares and on rectangles, which ... variant to the random walk on spheres with the advantage of having explicitly and exactly...
  • FOS/C

  • Referenced in 3 articles [sw06840]
  • crucial component. By relating FOS/C to random walks, we obtain precise characterizations of the behavior ... aforementioned relation between FOS/C and random walks, we prove that in vertex-transitive graphs both...