Fetching the paper…
Reading the bibliography…
We develop approximate estimation methods for exponential random graph models (ERGMs), whose likelihood is proportional to an intractable normalizing constant.
Bickel, Peter, David Choi, Xiangyu Chang and Hai Zhang (2013), ‘Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels’, Ann. Statist
1943
Earlier work this paper cites.
Besag, Julian (1974), ‘Spatial interaction and the statistical analysis of lattice systems’, Journal of the Royal Statistical Society Series B (Methodological)
1974
Earlier work this paper cites.
Geyer, Charles and Elizabeth Thompson (1992), ‘Constrained Monte Carlo maximum likelihood for dependent data’, Journal of the Royal Statistical Society, Series B (Methodological)
1992
Earlier work this paper cites.
Blume, Lawrence E. (1993), ‘The statistical mechanics of strategic interaction’, Games and Economic Behavior
1993
Earlier work this paper cites.
Monderer, Dov and Lloyd Shapley (1996), ‘Potential games’, Games and Economic Behavior
1996
Earlier work this paper cites.
Wasserman, Stanley and Philippa Pattison (1996), ‘Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p*’, Psychometrika
1996
Earlier work this paper cites.
Moody, James (2001), ‘Race, school integration, and friendship segregation in America’, American Journal of Sociology
2001
Earlier work this paper cites.
Snijders, Tom A.B (2002), ‘Markov chain Monte Carlo estimation of exponential random graph models’, Journal of Social Structure
2002
Earlier work this paper cites.
Xing, Eric P., Michael I. Jordan and Stuart Russell (2003), A generalized mean field algorithm for variational inference in exponential families, in
2003
Earlier work this paper cites.
Koskinen, Johan (2004), Bayesian analysis of exponential random graphs - estimation of parameters and model selection, Research report 2004:2, Department of Statistics, Stockholm University
2004
Earlier work this paper cites.
Moller, Jesper and Rasmus Plenge Waagepetersen (2004), Statistical inference and simulation for spatial point processes
2004
Earlier work this paper cites.
Bishop, Christopher (2006), Pattern Recognition and Machine Learning
2006
Earlier work this paper cites.
Murray, Iain A., Zoubin Ghahramani and David J. C. MacKay (2006), MCMC for doubly-intractable distributions, in
2006
Earlier work this paper cites.
Borgs, C., J.T. Chayes, L. Lovász, V.T. Sós and K. Vesztergombi (2008), ‘Convergent sequences of dense graphs i: Subgraph frequencies, metric properties and testing’, Advances in Mathematics
2008
Earlier work this paper cites.
Wainwright, M.J. and M.l. Jordan (2008), ‘Graphical models, exponential families, and variational inference’, Foundations and Trends@ in Machine Learning
2008
Earlier work this paper cites.
working paper
Butts, Carter (2009), Using potential games to parameterize ERG models · 2009
Earlier work this paper cites.
Goodreau, S. M., Kitts J. A. and Morris M. (2009), ‘Birds of a feather, or friend of a friend? using exponential random graph models to investigate adolescent social networks’, Demography
2009
Cited alongside, same era.
Train, Kenneth (2009), Discrete Choice Methods with Simulation
2009
Cited alongside, same era.
Durlauf, Steven N. and Yannis M. Ioannides (2010), ‘Social interactions’, Annual Review of Economics
2010
Cited alongside, same era.
Jackson, Matthew O. (2010), Social and Economics Networks
2010
Cited alongside, same era.
Wimmer, Andreas and Kevin Lewis (2010), ‘Beyond and below racial homophily: ERG models of a friendship network documented on Facebook’, American Journal of Sociology
2010
Cited alongside, same era.
Radin, Charles and Mei Yin (2013), ‘Phase transitions in exponential random graphs’, The Annals of Applied Probability
2013
Later among the works it cites.
Airoldi, Edoardo M., David Blei, Stephen E. Fienberg and Eric P. Xing (2008), ‘Mixed membership stochastic blockmodels’, Journal of Machine Learning Research
2014
Later among the works it cites.
working paper
Chandrasekhar, Arun and Matthew Jackson (2014), Tractable and consistent exponential random graph models · 2014
Later among the works it cites.
Working Paper
Iijima, Ryota and Yuichiro Kamada (2014), Social distance and network structures · 2014
Later among the works it cites.
Boucher, Vincent (2015), ‘Structural homophily’, International Economic Review
2015
Later among the works it cites.
Chandrasekhar, Arun (2016), in
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bhamidi, Shankar, Guy Bresler and Allan Sly (2011), ‘Mixing time of exponential random graphs’, The Annals of Applied Probability
2011
Cited alongside, same era.
Caimo, Alberto and Nial Friel (2011), ‘Bayesian inference for exponential random graph models’, Social Networks
2011
Cited alongside, same era.
Chatterjee, Sourav and S. R. S. Varadhan (2011), ‘The large deviation principle for the Erdos-Rényi random graph’, European Journal of Combinatorics
2011
Cited alongside, same era.
Working Paper
Mele, Angelo (2011), Segregation in social networks: Monte Carlo maximum likelihood estimation · 2011
Cited alongside, same era.
Amir, Eyal, Wen Pu and Dorothy Espelage (2012), Approximating partition functions for exponential-family random graph models, in
2012
Cited alongside, same era.
Lovasz, L. (2012), Large Networks and Graph Limits
2012
Cited alongside, same era.
working paper
Sheng, Shuyang (2012), Identification and estimation of network formation games · 2012
Cited alongside, same era.
Chatterjee, Sourav and Amir Dembo (2016), ‘Nonlinear large deviations’, Advances in Mathematics
2016
Later among the works it cites.
Boucher, Vincent and Ismael Mourifie (2017), ‘My friends far far away: A random field approach to exponential random graph models’, Econometrics Journal
2017
Closest in time.
DePaula, Aureo (2017), Econometrics of network models, in
2017
Closest in time.
Fox, Jeremy T. and Natalia Lazzati (2017), ‘A note on identification of discrete choice models for bundles and binary games’, Quantitative Economics
2017
Closest in time.
Graham, Bryan (2017), ‘An empirical model of network formation: with degree heterogeneity’, Econometrica
2017
Closest in time.
Mele, Angelo (2017), ‘A structural model of dense network formation’, Econometrica
2017
Closest in time.
Aristoff, David and Lingjiong Zhu (2018), ‘On the phase transition curve in a directed exponential random graph model’, Advances in Applied Probability
2018
Closest in time.
DePaula, Aureo, Seth Richards-Shubik and Elie Tamer (2018), ‘Identifying preferences in networks with bounded degree’, Econometrica
2018
Closest in time.
Kosyakova, Tetyana, Thomas Otter, Sanjog Misra and Christian Neuerburg (2018), Exact MCMC for choices from menus - measuring substitution and complementarity among menu items
2018
Closest in time.