• FODE

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

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

  • Referenced in 44 articles [sw27202]
  • network neighborhood and design a biased random walk procedure, which efficiently explores diverse neighborhoods...
  • 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...
  • CCLS

  • Referenced in 16 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 16 articles [sw17890]
  • adapting the shape of the random walk Metropolis proposal as specified by robust adaptive Metropolis...
  • 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...
  • 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...
  • momentuHMM

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

  • Referenced in 4 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...
  • metapath2vec

  • Referenced in 6 articles [sw37749]
  • metapath2vec model formalizes meta-path-based random walks to construct the heterogeneous neighborhood...
  • 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...
  • CRYPTIM

  • Referenced in 28 articles [sw02442]
  • vertices of a graph as messages and walks of a certain length as encryption tools ... random with the probability to break the key, i.e. to guess the encoding walk...
  • HIN2Vec

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

  • Referenced in 4 articles [sw36846]
  • implemented using a carefully designed random walk, so that DeleteMin returns an element among...
  • QSWalk.m

  • Referenced in 3 articles [sw27610]
  • include both quantum walks and classical random walks as special cases. The incoherent component allows...
  • OptQC

  • Referenced in 2 articles [sw22212]
  • process in favour of a descending random walk. We have also introduced a new method ... iteratively generating permutation matrices during the random walk process, providing a reduced total cost...