References
- Bhattacharyya, S., Bickel, P.J. (2016). Spectral clustering and block models: A review and a new algorithm. Stat. Anal. High-Dimensional Data 11:67–90.
- Chatterjee, S., Diaconis, P. (2013). Estimating and understanding exponential random graph models. Ann. Stat. 41(5):2428–2461.
- Chatterjee, S., Diaconis, P., Sly, A. (2011). Random graphs with a given degree sequence. Ann. Appl. Probab. 21(4):1400–1435.
- Conyon, M.J., Muldoon, M.R. (2004). The small world network structure of boards of directors. Available at: SSRN 546963, http://ssrn.com/abstract=546963
- Haberman, S.J. (1977). Maximum likelihood estimates in exponential response models. Ann. Stat. 5:815–841.
- Hillar, C., Wibisono, A. (2013). Maximum entropy distributions on graphs. Available at: http://arxiv.org/abs/1301.3321
- Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301):13–30.
- Holl, P.W., Leinhardt, S. (1981). An exponential family of probability distributions for directed graphs (with discussion). J. Am. Stat. Assoc. 76(373):33–65.
- Iacobucci, D., Wasserman, S. (1990). Social networks with two sets of actors. Psychometrika 55(4):707–720.
- Lang, S. (1993). Real and Functional Analysis. New York: Springer-Verlag.
- Latapy, M., Magnien, C., Del Vecchio, N. (2008). Basic notions for the analysis of large two-mode networks. Soc. Networks 30(1):31–48.
- Loeve, M. (1977). Probability Theory. 4th ed. Springer-Verlag: New York.
- Rasch, G. (1960). Probabilistic Models for Some Intelligence and Attainment Tests. Copenhagen: Paedagogiske Institut.
- Robins, G., Alexander, M. (2004). Small worlds among interlocking directors: Network structure and distance in bipartite graphs. Comput. Math. Organiz. Theory 10(1):69–94.
- Shalizi, C.R., Rinaldo, A. (2013). Consistency under sampling of exponential random graph models. Ann. Stat. 41(2):508–535.
- Snijders, T.A., Lomi, A., Torló, V.J. (2013). A model for the multiplex dynamics of two-mode and one-mode networks, with an application to employment preference, friendship, and advice. Soc. Netw. 35(2):265–276.
- Wang, P., Sharpe, K., Robins, G.L., Pattison, P.E. (2009). Exponential random graph (p*) models for affiliation networks. Soc. Netw. 31(1):12–25.
- Yan, T., Leng, C., Zhu, J., et al. (2016a). Asymptotics in directed exponential random graph models with an increasing bi-degree sequence. Ann. Stat. 44(1):31–57.
- Yan, T., Qin, H., Wang, H. (2016b). Asymptotics in undirected random graph models parameterized by the strengths of vertices. Stat. Sin. 26:273–293.
- Yan, T., Xu, J. (2013). A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices. Biometrika 100(2):519–524.