{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:39:37Z","timestamp":1759963177328},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,6]],"date-time":"2015-03-06T00:00:00Z","timestamp":1425600000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s13278-015-0247-3","type":"journal-article","created":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T16:21:19Z","timestamp":1425572479000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["GLMLE: graph-limit enabled fast computation for fitting exponential random graph models to large social networks"],"prefix":"10.1007","volume":"5","author":[{"given":"Ran","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,6]]},"reference":[{"key":"247_CR1","doi-asserted-by":"crossref","unstructured":"Besag J (1975) Statistical analysis of non-lattice data. The statistician. pp 179\u2013195","DOI":"10.2307\/2987782"},{"key":"247_CR2","doi-asserted-by":"crossref","unstructured":"Bhamidi S, Bresler G, Sly A (2008) Mixing time of exponential random graphs. In: Foundations of Computer Science, 2008. FOCS\u201908. IEEE 49th Annual IEEE Symposium on, IEEE, pp 803\u2013812","DOI":"10.1109\/FOCS.2008.75"},{"issue":"50","key":"247_CR3","doi-asserted-by":"crossref","first-page":"21068","DOI":"10.1073\/pnas.0907096106","volume":"106","author":"PJ Bickel","year":"2009","unstructured":"Bickel PJ, Chen A (2009) A nonparametric view of network models and newman-girvan and other modularities. Proc Natl Acad Sci 106(50):21068\u201321073","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"247_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20334","volume":"39","author":"B Bollob\u00e1s","year":"2011","unstructured":"Bollob\u00e1s B, Riordan O (2011) Sparse graphs: metrics and random models. Random Struct Algorithms 39(1):1\u201338","journal-title":"Random Struct Algorithms"},{"issue":"6","key":"247_CR5","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1016\/j.aim.2008.07.008","volume":"219","author":"C Borgs","year":"2008","unstructured":"Borgs C, Chayes JT, Lov\u00e1sz L, S\u00f3s VT, Vesztergombi K (2008) Convergent sequences of dense graphs i: subgraph frequencies, metric properties and testing. Adv Math 219(6):1801\u20131851","journal-title":"Adv Math"},{"issue":"7","key":"247_CR6","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1016\/j.ejc.2011.03.014","volume":"32","author":"S Chatterjee","year":"2011","unstructured":"Chatterjee S, Varadhan S (2011) The large deviation principle for the erd\u0151s-r\u00e9nyi random graph. Eur J Comb 32(7):1000\u20131017","journal-title":"Eur J Comb"},{"issue":"5","key":"247_CR7","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1214\/13-AOS1155","volume":"41","author":"S Chatterjee","year":"2013","unstructured":"Chatterjee S, Diaconis P et al (2013) Estimating and understanding exponential random graph models. Ann Stat 41(5):2428\u20132461","journal-title":"Ann Stat"},{"issue":"1","key":"247_CR8","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.socnet.2008.10.003","volume":"31","author":"MA Duijn van","year":"2009","unstructured":"van Duijn MA, Gile KJ, Handcock MS (2009) A framework for the comparison of maximum pseudo-likelihood and maximum likelihood estimation of exponential family random graph models. Soc Netw 31(1):52\u201362","journal-title":"Soc Netw"},{"issue":"395","key":"247_CR9","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1080\/01621459.1986.10478342","volume":"81","author":"O Frank","year":"1986","unstructured":"Frank O, Strauss D (1986) Markov graphs. J Am Stat Assoc 81(395):832\u2013842","journal-title":"J Am Stat Assoc"},{"key":"247_CR10","unstructured":"Geyer CJ, Thompson EA (1992) Constrained monte carlo maximum likelihood for dependent data. J Royal Stat Soc Ser B (Methodological):657\u2013699"},{"key":"247_CR11","first-page":"229","volume":"126","author":"MS Handcock","year":"2003","unstructured":"Handcock MS (2003) Statistical models for social networks: inference and degeneracy. Dyn Soc Netw Model Anal 126:229\u2013252","journal-title":"Dyn Soc Netw Model Anal"},{"issue":"1","key":"247_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1214\/08-AOAS221","volume":"4","author":"MS Handcock","year":"2010","unstructured":"Handcock MS, Gile KJ (2010) Modeling social networks from sampled data. Ann Appl Stat 4(1):5\u201325","journal-title":"Ann Appl Stat"},{"key":"247_CR13","unstructured":"Handcock MS, Robins G, Snijders TA, Moody J, Besag J (2003) Assessing degeneracy in statistical models of social networks. Tech rep, Working paper"},{"issue":"1","key":"247_CR14","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.18637\/jss.v024.i01","volume":"24","author":"MS Handcock","year":"2008","unstructured":"Handcock MS, Hunter DR, Butts CT, Goodreau SM, Morris M (2008) statnet: software tools for the representation, visualization, analysis and simulation of network data. J Stat Softw 24(1):1548","journal-title":"J Stat Softw"},{"key":"247_CR15","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1214\/09-EJS548","volume":"4","author":"S Hanneke","year":"2010","unstructured":"Hanneke S, Fu W, Xing EP (2010) Discrete temporal models of social networks. Electron J Stat 4:585\u2013605","journal-title":"Electron J Stat"},{"key":"247_CR16","doi-asserted-by":"crossref","unstructured":"Hunter DR, Handcock MS, Butts CT, Goodreau SM, Morris M (2008) ergm: A package to fit, simulate and diagnose exponential-family models for networks. J Stat Softw 24(3):nihpa54860","DOI":"10.18637\/jss.v024.i03"},{"key":"247_CR17","unstructured":"Kolaczyk ED, Krivitsky PN (2011) On the question of effective sample size in network modeling. arXiv preprint arXiv:11120840"},{"issue":"1","key":"247_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"key":"247_CR19","volume-title":"Monte Carlo strategies in scientific computing","author":"JS Liu","year":"2008","unstructured":"Liu JS (2008) Monte Carlo strategies in scientific computing. Springer, New York"},{"issue":"6","key":"247_CR20","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1016\/j.jctb.2006.05.002","volume":"96","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz L, Szegedy B (2006) Limits of dense graph sequences. J Combin Theory Ser B 96(6):933\u2013957","journal-title":"J Combin Theory Ser B"},{"issue":"4","key":"247_CR21","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder JA, Mead R (1965) A simplex method for function minimization. Comput J 7(4):308\u2013313","journal-title":"Comput J"},{"key":"247_CR22","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1214\/11-EJS664","volume":"6","author":"S Okabayashi","year":"2012","unstructured":"Okabayashi S, Geyer CJ (2012) Long range search for maximum likelihood in exponential families. Electron J Stat 6:123\u2013147","journal-title":"Electron J Stat"},{"key":"247_CR23","doi-asserted-by":"crossref","unstructured":"Robbins H, Monro S (1951) A stochastic approximation method. Ann Math Stat:400\u2013407","DOI":"10.1214\/aoms\/1177729586"},{"issue":"2","key":"247_CR24","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.socnet.2006.08.003","volume":"29","author":"G Robins","year":"2007","unstructured":"Robins G, Snijders T, Wang P, Handcock M, Pattison P (2007) Recent developments in exponential random graph (p*) models for social networks. Soc Netw 29(2):192\u2013215","journal-title":"Soc Netw"},{"issue":"2","key":"247_CR25","first-page":"1","volume":"3","author":"TA Snijders","year":"2002","unstructured":"Snijders TA (2002) Markov chain monte carlo estimation of exponential random graph models. J Soc Struct 3(2):1\u201340","journal-title":"J Soc Struct"},{"issue":"1","key":"247_CR26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1111\/j.1467-9531.2006.00176.x","volume":"36","author":"TA Snijders","year":"2006","unstructured":"Snijders TA, Pattison PE, Robins GL, Handcock MS (2006) New specifications for exponential random graph models. Sociol Methodol 36(1):99\u2013153","journal-title":"Sociol Methodol"},{"issue":"409","key":"247_CR27","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1080\/01621459.1990.10475327","volume":"85","author":"D Strauss","year":"1990","unstructured":"Strauss D, Ikeda M (1990) Pseudolikelihood estimation for social networks. J Am Stat Assoc 85(409):204\u2013212","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"247_CR28","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1214\/aoms\/1177732360","volume":"9","author":"SS Wilks","year":"1938","unstructured":"Wilks SS (1938) The large-sample distribution of the likelihood ratio for testing composite hypotheses. Ann Math Stat 9(1):60\u201362","journal-title":"Ann Math Stat"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0247-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-015-0247-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0247-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T19:31:46Z","timestamp":1553715106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-015-0247-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,6]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["247"],"URL":"https:\/\/doi.org\/10.1007\/s13278-015-0247-3","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,6]]},"article-number":"8"}}