Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation

DOI10.1007/s10618-021-00802-3zbMath1501.60042arXiv2012.03879OpenAlexW4205945602MaRDI QIDQ832666

N. E. Zubov

Publication date: 25 March 2022

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.03879

zbMATH Keywords

Markov chain Monte Carlorandom walksubgraph countinggraph miningmotif analysisregenerative sampling

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Uses Software

• SNAP
• Algorithm 447

Cites Work

• Unnamed Item
• Geometric bounds for eigenvalues of Markov chains
• Random sampling with a reservoir
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• A splitting technique for Harris recurrent Markov chains
• A New Approach to the Limit Theory of Recurrent Markov Chains
• Markov Chains
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Regeneration in Markov Chain Samplers
• Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Unbiased Markov Chain Monte Carlo Methods with Couplings
• Peer counting and sampling in overlay networks
• Exact estimation for Markov chain equilibrium expectations
• Monte Carlo sampling methods using Markov chains and their applications
• Fast Low-Cost Estimation of Network Properties Using Random Walks