A perfect sampling method for exponential family random graph models

References

• Barabási, A.-L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 206, 509–512.
   Web of Science ®Google Scholar
• Besag, J. (1974). Spatial interaction and the statistical analysis of lattice systems. Journal of the Royal Statistical Society, Series B, 36(2), 192–236.
   Google Scholar
• Besag, J. (1975). Statistical analysis of non-lattice data. The Statistician, 24(3), 179–195. doi:10.2307/2987782
   Google Scholar
• Bhamidi, S., Bresler, G., & Sly, A. (2011). Mixing time of exponential random graphs. The Annals of Applied Probability, 21(6), 2146–2170. doi:10.1214/10-AAP740
   Web of Science ®Google Scholar
• Burda, Z., Jurkiewicz, J., & Kryzwicki, A. (2004). Network transitivity and matrix models. Physical Review E, 69, 026106. doi:10.1103/PhysRevE.69.026106
   Web of Science ®Google Scholar
• Butts, C. T. (2000). The sna package for the R statistical computing system. Retrieved from http://statnet.org.
   Google Scholar
• Butts, C. T. (2011). Bernoulli graph bounds for general random graphs. Sociological Methodology, 41, 299–345. doi:10.1111/j.1467-9531.2011.01246.x
   Web of Science ®Google Scholar
• Butts, C. T. (2015). A novel simulation method for binary discrete exponential families, with application to social networks. Journal of Mathematical Sociology, 39(3), 174–202. doi:10.1080/0022250X.2015.1022279
   PubMed Web of Science ®Google Scholar
• Chen, S.-H., & Ip, E. H. (2015). Behaviour of the Gibbs sampler when conditional distributions are potentially incompatible. Journal of Statistical Computation and Simulation, 85(16), 3266–3275. doi:10.1080/00949655.2014.968159.
   PubMed Web of Science ®Google Scholar
• Davis, J. A. (1970). Clustering and hierarchy in interpersonal relations: Testing two theoretical models on 742 sociograms. American Sociological Review, 35, 843–852. doi:10.2307/2093295
   Web of Science ®Google Scholar
• Frank, O., & Strauss, D. (1986). Markov graphs. Journal of the American Statistical Association, 81, 832–842. doi:10.1080/01621459.1986.10478342
   Web of Science ®Google Scholar
• Gamerman, D. (1997). Markov Chain Monte Carlo: Stochastic simulation for Bayesian inference. London: Chapman and Hall.
   Google Scholar
• Gelman, A. (1996). Inference and monitoring convergence. In W. R. Gilks, S. Richardson, & D. J. Spiegelhalter (editors), Markov Chain Monte Carlo in Practice. Boca Raton, FL: Chapman and Hall/CRC.
   Google Scholar
• Geyer, C. J., & Thompson, E. A. (1992). Constrained Monte Carlo maximum likelihood calculations (with discussion). Journal of the Royal Statistical Society, Series C, 54, 657–699.
   Google Scholar
• Häggström, O., & Jonasson, J. (1999). Phase transition in the random triangle model. Journal of Applied Probability, 36, 1101–1115. doi:10.1017/S0021900200017897
   Web of Science ®Google Scholar
• Handcock, M. S. (2003). Statistical models for social networks: Inference and degeneracy. In R. Breiger, K. M. Carley, & P. Pattison (editors), Dynamic social network modeling and analysis (pp. 229–240). Washington, DC: National Academies Press.
   Google Scholar
• Hoff, P. D., Raftery, A. E., & Handcock, M. S. (2002). Latent space approaches to social network analysis. Journal of the American Statistical Association, 97(460), 1090–1098. doi:10.1198/016214502388618906
   Web of Science ®Google Scholar
• Holland, P. W., Laskey, K. B., & Leinhardt, S. (1983). Stochastic blockmodels: First steps. Social Networks, 5(2), 109–137. doi:10.1016/0378-8733(83)90021-7
   Web of Science ®Google Scholar
• Holland, P. W., & Leinhardt, S. (1972). Some evidence on the transitivity of positive interpersonal sentiment. American Journal of Sociology, 72, 492–513.
   Google Scholar
• Holland, P. W., & Leinhardt, S. (1981). An exponential family of probability distributions for directed graphs (with discussion). Journal of the American Statistical Association, 76(373), 33–50. doi:10.1080/01621459.1981.10477598
   Web of Science ®Google Scholar
• Hunter, D. R., & Handcock, M. S. (2006). Inference in curved exponential family models for networks. Journal of Computational and Graphical Statistics, 15, 565–583. doi:10.1198/106186006X133069
   Web of Science ®Google Scholar
• Hunter, D. R., Handcock, M. S., Butts, C. T., Goodreau, S. M., & Morris, M. (2008). Ergm: A package to fit, simulate and diagnose exponential-family models for networks. Journal of Statistical Software, 24(3). doi:10.18637/jss.v024.i03
   Google Scholar
• Jonasson, J. (1999). The random triangle model. Journal of Applied Probability, 36, 852–867. doi:10.1017/S0021900200017629
   Web of Science ®Google Scholar
• Kendall, W. S. (1997). Perfect simulation for spatial point processes. In Simulation of stochastic processes in engineering meeting. 51st meeting of the International Statistics Institute. Istanbul, Turkey.
   Google Scholar
• Kendall, W. S., & Møller, J. (2000). Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes. Advances in Applied Probability, 32(3), 844–865. doi:10.1017/S0001867800010284
   Web of Science ®Google Scholar
• Krivitsky, P. N., Handcock, M. S., & Morris, M. (2011). Adjusting for network size and composition effects in exponential-family random graph models. Statistical Methodology, 8(4), 319–339. doi:10.1016/j.stamet.2011.01.005
   PubMedGoogle Scholar
• Lusher, D., Koskinen, J., & Robins, G. (2012). Exponential random graph models for social networks: Theory, methods, and applications. Cambridge, UK: Cambridge University Press.
   Google Scholar
• Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45(2), 167–256. doi:10.1137/S003614450342480
   Web of Science ®Google Scholar
• Park, J., & Newman, M. (2004). Solution of the 2-star model of a network. Physical Review E, 70, 066146. doi:10.1103/PhysRevE.70.066146
   Web of Science ®Google Scholar
• Pattison, P. E., & Robins, G. L. (2002). Neighborhood-based models for social networks. Sociological Methodology, 32, 301–337. doi:10.1111/1467-9531.00119
   Web of Science ®Google Scholar
• Pattison, P. E., & Wasserman, S. (1999). Logit models and logistic regressions for social networks: Ii. multivariate relations. British Journal of Mathematical and Statistical Psychology, 52, 169–193. doi:10.1348/000711099159053
   PubMed Web of Science ®Google Scholar
• Propp, J. G., & Wilson, D. B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms, 9(1–2), 223–252. doi:10.1002/(ISSN)1098-2418
   Web of Science ®Google Scholar
• Pu, W., Choi, J., Amir, E., & Espelage, D. (2012). Learning exponential random graph models. In 2012 Neural Information Processing Systems (NIPS) workshop on algorithmic and statistical approaches for large social network data sets.
   Google Scholar
• Rapoport, A. (1949a). Outline of a probabilistic approach to animal sociology I. Bulletin of Mathematical Biophysics, 11, 183–196. doi:10.1007/BF02478364
   PubMedGoogle Scholar
• Rapoport, A. (1949b). Outline of a probabilistic approach to animal sociology II. Bulletin of Mathematical Biophysics, 11, 273–281. doi:10.1007/BF02477980
   PubMedGoogle Scholar
• Rapoport, A. (1950). Outline of a probabilistic approach to animal sociology III. Bulletin of Mathematical Biophysics, 12, 7–17. doi:10.1007/BF02477340
   Google Scholar
• Ripley, B. D. (1977). Modeling spatial patterns (with discussion). Journal of the Royal Statistical Society, Series B, 39, 172–212.
   Google Scholar
• Robins, G. L., Pattison, P. E., & Woolcock, J. (2005). Small and other worlds: Network structures from local processes. American Journal of Sociology, 110(4), 894–936. doi:10.1086/427322
   Web of Science ®Google Scholar
• Schweinberger, M. (2011). Instability, sensitivity, and degeneracy of discrete exponential families. Journal of the American Statistical Association, 106, 1361–1370. doi:10.1198/jasa.2011.tm10747
   PubMed Web of Science ®Google Scholar
• Schweinberger, M., & Handcock, M. S. (2015). Local dependence in random graph models: Characterization, properties and statistical inference. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 77(3), 647–676. doi:10.1111/rssb.2015.77.issue-3
   Web of Science ®Google Scholar
• Skvoretz, J. (1985). Random and biased networks: Simulations and approximations. Social Networks, 7, 256–261. doi:10.1016/0378-8733(85)90016-4
   Web of Science ®Google Scholar
• Skvoretz, J. (1990). Biased net theory: Approximations, simulations, and observations. Social Networks, 12, 217–238. doi:10.1016/0378-8733(90)90006-U
   Web of Science ®Google Scholar
• Skvoretz, J., Fararo, T. J., & Agneessens, F. (2004). Advances in biased net theory: Definitions, derivations, and estimations. Social Networks, 26, 113–139. doi:10.1016/j.socnet.2004.01.005
   Web of Science ®Google Scholar
• Snijders, T. A. B. (1981). The degree variance: An index of graph heterogeneity. Social Networks, 3(3), 163–223. doi:10.1016/0378-8733(81)90014-9
   Web of Science ®Google Scholar
• Snijders, T. A. B. (2002). Markov chain Monte Carlo estimation of exponential random graph models. Journal of Social Structure, 3(2).
   Google Scholar
• Strauss, D. (1986). On a general class of models for interaction. SIAM Review, 28(4), 513–527. doi:10.1137/1028156
   Web of Science ®Google Scholar
• Wasserman, S., & Pattison, P. E. (1996). Logit models and logistic regressions for social networks: I. an introduction to Markov graphs and p*. Psychometrika, 60, 401–426. doi:10.1007/BF02294547
   Web of Science ®Google Scholar
• Wasserman, S., & Robins, G. L. (2005). An introduction to random graphs, dependence graphs, and p*. In P. J. Carrington, J. Scott, & S. Wasserman (editors), Models and methods in social network analysis chapter 10 (pp. 192–214). Cambridge, UK: Cambridge University Press.
   Google Scholar
• Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of ‘small-world’ networks. Nature, 393, 440–442. doi:10.1038/30918
   PubMed Web of Science ®Google Scholar