Learning Loosely Connected Markov Random Fields

References

• Alon, N. and Spencer, J. H. (1992). The Probabilistic Method. Wiley, New York. MR1140703Google Scholar
• Anandkumar, A., Tan, V. and Willsky, A. (2010). High Dimensional Structure Learning of Ising Models on Sparse Random Graphs.Google Scholar
• Anandkumar, A., Tan, V. Y. F. and Willsky, A. S. (2011). High-Dimensional Structure Estimation in Ising Models: Tractable Graph Families.Google Scholar
• Banerjee, O., El Ghaoui, L. and d’Aspremont, A. (2008). Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data. J. Mach. Learn. Res. 9 485–516. MR2417243Google Scholar
• Berger, N., Kenyon, C., Mossel, E. and Peres, Y. (2005). Glauber dynamics on trees and hyperbolic graphs. Probability Theory and Related Fields 131 311–340. 10.1007/s00440-004-0369-4. MR2123248Google Scholar
• Boyd, S. and Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press, New York, NY, USA. MR2061575Google Scholar
• Bresler, G., Mossel, E. and Sly, A. (2008). Reconstruction of Markov random fields from samples: Some observations and algorithms. In APPROX-RANDOM 343–356. MR2538799Google Scholar
• Cover, T. M. and Thomas, J. A. (1991). Elements of Information Theory. Wiley-Interscience, New York, NY, USA. MR1122806Google Scholar
• Esary, J. D., Proschan, F. and Walkup, D. W. (1967). Association of random variables, with applications. Annals of Mathematical Statistics 38 1466–1473. MR0217826Google Scholar
• Hastie, T., Tibshirani, R. and Friedman, J. H. (2003). The Elements of Statistical Learning, Corrected ed. Springer. MR2722294Google Scholar
• Jung, K. and Shah, D. (2006). Local Approximate Inference Algorithms.Google Scholar
• Liggett, T. M. (2010). Stochastic models for large interacting systems and related correlation inequalities. Proceedings of the National Academy of Sciences 107 16413–16419. MR2726545Google Scholar
• Montanari, A. and Pereira, J. A. (2009). Which graphical models are difficult to learn? In Advances in Neural Information Processing Systems 22 (Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams and A. Culotta, eds.) 1303–1311.Google Scholar
• Mossel, E. and Sly, A. (2008). Rapid mixing of Gibbs sampling on graphs that are sparse on average. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA ’08 238–247. MR2485309Google Scholar
• Netrapalli, P., Banerjee, S., Sanghavi, S. and Shakkottai, S. (2010). Greedy learning of Markov network structure. In Allerton Conf. on Communication, Control and Computing.Google Scholar
• Quinn, C. J., Kiyavash, N. and Coleman, T. P. (2012). Directed information graphs. CoRR, abs/1204.2003Google Scholar
• Ravikumar, P., Wainwright, M. J. and Lafferty, J. (2010). High-dimensional Ising model selection using l1-regularized logistic regression. Annals of Statistics 38 1287–1319. MR2662343Google Scholar
• Ray, A., Sanghavi, S. and Shakkottai, S. (2012). Greedy learning of graphical models with small girth. In Allerton Conf. on Communication, Control and Computing.Google Scholar
• Santhanam, N. P. and Wainwright, M. J. (2012). Information-theoretic limits of selecting binary graphical models in high dimensions. IEEE Transactions on Information Theory 58 4117–4134. MR2943079Google Scholar
• Uhler, C., Raskutti, G., Bühlmann, P. and Yu, B. (2012). Geometry of Faithfulness Assumption in Causal Inference. MR3099109Google Scholar
• Weitz, D. (2006). Counting independent sets up to the tree threshold. In Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing. STOC ’06 140–149. MR2277139Google Scholar
• Zhang, J., Liang, H. and Bai, F. (2011). Approximating partition functions of the two-state spin system. Inf. Process. Lett. 111 702–710. MR2840539Google Scholar