Scalable Uniform Graph Sampling by Local Computation

DOI10.1137/080716086zbMath1227.60095OpenAlexW2018405656MaRDI QIDQ3006147

Satu Elisa Schaeffer

Publication date: 10 June 2011

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c0a225ea0d9f4971d97305766a54b37c9c20c4ac

zbMATH Keywords

graphMarkov chainrandom walkrapid mixingsampling uniform distribution

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Sampling theory, sample surveys (62D05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Numerical analysis or methods applied to Markov chains (65C40)

Uses Software

• ARPACK
• Walksat
• Unnamed Item

This page was built for publication: Scalable Uniform Graph Sampling by Local Computation