{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:52:49Z","timestamp":1764841969171,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1565516","CMMI-1335155","CMMI-1462158","CNS-1161964"],"award-info":[{"award-number":["CCF-1565516","CMMI-1335155","CMMI-1462158","CNS-1161964"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-11-1-0036"],"award-info":[{"award-number":["W911NF-11-1-0036"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["W911NF-16-1-0551"],"award-info":[{"award-number":["W911NF-16-1-0551"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/tit.2017.2713828","type":"journal-article","created":{"date-parts":[[2017,6,8]],"date-time":"2017-06-08T18:30:06Z","timestamp":1496946606000},"page":"4072-4080","source":"Crossref","is-referenced-by-count":12,"title":["Learning Graphical Models From the Glauber Dynamics"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1303-582X","authenticated-orcid":false,"given":"Guy","family":"Bresler","sequence":"first","affiliation":[]},{"given":"David","family":"Gamarnik","sequence":"additional","affiliation":[]},{"given":"Devavrat","family":"Shah","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158885"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1993744.1993774"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20004"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF02096629"},{"key":"ref31","first-page":"378","article-title":"On learning discrete graphical models using group-sparse regularization","author":"jalali","year":"2011","journal-title":"Proc AISTATS"},{"key":"ref30","first-page":"1935","article-title":"On learning discrete graphical models using greedy methods","author":"jalali","year":"2011","journal-title":"Proc NIPS"},{"key":"ref37","first-page":"1741","article-title":"On the convexity of latent social network inference","author":"myers","year":"2010","journal-title":"Proc NIPS"},{"journal-title":"Uncovering the Temporal Dynamics of Diffusion Networks","year":"2011","author":"rodriguez","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254783"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF02101929"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS691"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/12-SSY073"},{"key":"ref29","first-page":"817","article-title":"Efficient structure learning of Markov networks using \n$\\ell_{1}$\n-regularization","author":"lee","year":"2006","journal-title":"Proc NIPS"},{"journal-title":"Computational implications of reducing data to sufficient statistics","year":"2014","author":"montanari","key":"ref2"},{"key":"ref1","first-page":"1062","article-title":"Hardness of parameter estimation in graphical models","author":"bresler","year":"2014","journal-title":"Proc NIPS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0609"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20236"},{"key":"ref21","first-page":"1245","article-title":"Correlation decay and deterministic FPTAS for counting list-colorings of a graph","author":"gamarnik","year":"2007","journal-title":"Proc SODA"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707063"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1009"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483471"},{"key":"ref50","doi-asserted-by":"crossref","DOI":"10.1007\/b13794","volume":"11","author":"tsybakov","year":"2009","journal-title":"Introduction to Nonparametric Estimation"},{"key":"ref10","first-page":"504","article-title":"Maximum likelihood bounded tree-width Markov networks","author":"srebro","year":"2001","journal-title":"Proc UAI"},{"key":"ref11","first-page":"1052","article-title":"Learning mixtures of tree graphical models","author":"anandkumar","year":"2012","journal-title":"Proc NIPS"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0671-5"},{"key":"ref12","first-page":"2852","article-title":"Structure learning of antiferromagnetic ising models","author":"bresler","year":"2014","journal-title":"Proc NIPS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028584"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746631"},{"key":"ref15","first-page":"2595","article-title":"Interaction screening: Efficient and sample-optimal learning of Ising models","author":"vuffray","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/educ.2013.0119"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1115049"},{"key":"ref18","first-page":"347","article-title":"Constructive criterion for the uniqueness of Gibbs field","author":"dobrushin","year":"1985","journal-title":"Statistical Physics and Dynamical Systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02199113"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.56"},{"key":"ref3","first-page":"1303","article-title":"Which graphical models are difficult to learn?","author":"montanari","year":"2009","journal-title":"Proc NIPS"},{"key":"ref6","first-page":"343","article-title":"Reconstruction of Markov random fields from samples: Some observations and algorithms","author":"bresler","year":"2008","journal-title":"Proc RANDOM"},{"key":"ref5","first-page":"1743","article-title":"Learning factor graphs in polynomial time and sample complexity","volume":"7","author":"abbeel","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000912"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191659"},{"key":"ref9","first-page":"134","article-title":"Learning polytrees","author":"dasgupta","year":"1999","journal-title":"Proc UAI"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483426"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1004098107"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129115"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"ref42","first-page":"318","article-title":"Exploiting random walks for learning","author":"bartlett","year":"1994","journal-title":"Proc COLT"},{"key":"ref41","first-page":"392","article-title":"A Markovian extension of Valiant’s learning model","author":"aldous","year":"1990","journal-title":"Proc FOCS"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806131"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.010"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8361085\/7944572-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8361085\/07944572.pdf?arnumber=7944572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:16Z","timestamp":1649444116000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7944572\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":50,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2713828","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}