Abstract
Markov Chain Monte Carlo (MCMC) methods have been used for sampling Online SNs. The main drawbacks are that traditional MCMC techniques such as the Metropolis-Hastings Random Walk (MHRW) suffer from slow mixing rates, and the resulting sample is usually approximate. An appealing solution is to adapt the MHRW sampler to probability coupling techniques for perfect sampling. While this MHRW coupler is theoretically advanced, it is inapplicable for sampling large SNs in practice. We develop a new coupling algorithm, called Conditional Independence Coupler (CIC), which improves existing coupling techniques by adopting a new coalescence condition, called Conditional Independence (CI), for efficient coalescence detection. The proposed CIC algorithm is outstandingly scalable for sampling large SNs without any bias as compared to previous traditional MCMC sampling algorithms.
G. Li—This research is funded by NSERC Engage and SME4SME.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Andrieu, C., de Freitas, N., Doucet, A., Jordan, M.: An introduction to MCMC for machine learning. Mach. Learn. 50(2003), 5–43 (2003)
Brooks, S.P.: Markov Chain Monte Carlo method and its application. Statistician 47, 69–100 (1998)
Geweke, J.: Evaluating the accuracy of sampling-based approaches to the calculation of posterior moments. In: Bayesian Statistics, pp. 169–193 (1992)
Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in Facebook: a case study of unbiased sampling of OSNs. In: INFOCOM 2010 Proceedings of the 29th Conference on Information Communications, pp. 2498–2506 (2010)
Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: Proceedings of the 19th International Conference on World Wide Web, pp. 591–600 (2010)
Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631–636 (2006)
Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS, Providence (2009)
Meng, X.L.: Towards a more general ProppWilson algorithm: multistage backward coupling. Monte Carlo Methods - Fields Inst. Commun. 26, 85–93 (2000)
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equations of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087–1092 (1953)
Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, New York (1993)
Murdoch, D.J., Green, P.J.: Exact sampling from a continuous state space. Scand. J. Stat. 25(3), 483–502 (1998)
Propp, J.G., Wilson, D.B.: Exact sampling with coupled Markov Chains and applications to statistical mechanics. Random Struct. Algorithms 9, 223–252 (1996)
Robert, G., Rosenthal, J.S.: Small and pseudo-small sets for Markov chains. Commun. Stat. Stoch. Models 17, 121–145 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, G. (2016). Sampling Graphical Networks via Conditional Independence Coupling of Markov Chains. In: Khoury, R., Drummond, C. (eds) Advances in Artificial Intelligence. Canadian AI 2016. Lecture Notes in Computer Science(), vol 9673. Springer, Cham. https://doi.org/10.1007/978-3-319-34111-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-34111-8_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-34110-1
Online ISBN: 978-3-319-34111-8
eBook Packages: Computer ScienceComputer Science (R0)