Expand description
Random walk algorithms
This module contains algorithms related to random walks on graphs.
Structs§
- Batch
Random Walker - SIMD-optimized batch random walk with precomputed transition probabilities More efficient for large-scale embedding generation
Functions§
- node2vec_
walk - Node2Vec biased random walk with SIMD optimizations Implements the p and q parameters for controlling exploration vs exploitation
- parallel_
node2vec_ walks - Parallel Node2Vec walk generation for large-scale embedding
- parallel_
random_ walks - Parallel random walk generator for multiple walks simultaneously Optimized for embedding algorithms like Node2Vec and DeepWalk
- personalized_
pagerank - Compute personalized PageRank from a given source node
- random_
walk - Perform a random walk on the graph
- simd_
random_ walk_ with_ restart - SIMD-optimized random walk with restart for large graphs Uses vectorized operations for better performance on large node sets
- transition_
matrix - Compute the transition matrix for random walks on the graph