Collecting Random Samples from Facebook: An Efficient Heuristic for Sampling Large and Undirected Graphs via a Metropolis-Hastings Random Walk.
C. A. Piña-GarcíaDongbing GuPublished in: SMC (2013)
Keyphrases
- random walk
- metropolis hastings
- random samples
- directed graph
- undirected graph
- random sampling
- sampling algorithm
- sample size
- markov chain
- posterior distribution
- markov chain monte carlo
- directed acyclic graph
- active learning
- hyperparameters
- particle filtering
- social networks
- optimal solution
- dynamic programming
- approximation algorithms
- graph structure
- minimum cost
- sliding window
- higher order