Self-Repellent Random Walks on General Graphs - Achieving Minimal Sampling Variance via Nonlinear Markov Chains.
Vishwaraj DoshiJie HuDo Young EunPublished in: ICML (2023)
Keyphrases
- markov chain
- random walk
- transition probabilities
- directed graph
- monte carlo
- stationary distribution
- steady state
- finite state
- markov chain monte carlo
- spectral methods
- markov process
- markov model
- markov random walk
- state space
- link prediction
- transition probability matrix
- markov processes
- confidence intervals
- web graph
- probabilistic automata
- long run
- graph mining
- sample size
- sufficient conditions
- variance reduction
- objective function