Hierarchical Network Models for Exchangeable Structured Interaction Processes

References

• Airoldi, E., Blei, D., Fienberg, S., and Xing, E. (2008), “Mixed Membership Stochastic Blockmodels,” Journal of Machine Learning Research, 9, 1981–2014.
   PubMed Web of Science ®Google Scholar
• Airoldi, E., Choi, D., and Wolfe, P. (2011), “Confidence Sets for Network Structure,” Statistical Analysis and Data Mining, 4, 461–469. DOI: 10.1002/sam.10136.
   Google Scholar
• Airoldi, E. M., Costa, T. B., and Chan, S. H. (2013), “Stochastic Blockmodel Approximation of a Graphon: Theory and Consistent Estimation,” in Advances in Neural Information Processing Systems, Vol. 26, eds. C. J. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Q. Weinberger, Curran Associates, Inc., pp. 692–700.
   Google Scholar
• Athreya, A., Fishkind, D. E., Tang, M., Priebe, C. E., Park, Y., Vogelstein, J. T., Levin, K., Lyzinski, V., and Qin, Y. (2017), “Statistical inference on random dot product graphs: a survey,” The Journal of Machine Learning Research, 18, 8393–8484.
   Web of Science ®Google Scholar
• Barabási, A.-L. (2016), Network Science. Cambridge University Press.
   Google Scholar
• Blei, D. M. (2014), “Build, Compute, Critique, Repeat: Data Analysis With Latent Variable Models,” Annual Review of Statistics and Its Application, 1, 203–232. DOI: 10.1146/annurev-statistics-022513-115657.
   Web of Science ®Google Scholar
• Blei, D. M., Ng, A. Y., and Jordan, M. I. (2003), “Latent Dirichlet allocation,” Journal of Machine Learning Research, 3, 993–1022.
   Web of Science ®Google Scholar
• Borgs, C., Chayes, J., Cohn, H., and Veitch, V. (2019), “Sampling Perspectives on Sparse Exchangeable Graphs,” Annals of Probability, 5, 2754–2800.
   Google Scholar
• Box, G. E. P. (1976), “Science and Statistics,” Journal of the American Statistical Association, 71, 791–799. DOI: 10.1080/01621459.1976.10480949.
   Web of Science ®Google Scholar
• Box, G. E. P., and Hunter, W. G. (1962), “A Useful Method for Model-Building,” Technometrics, 4, 301–318. DOI: 10.1080/00401706.1962.10490015.
   Web of Science ®Google Scholar
• Butts, C. (2008), “A Relational Event Framework For Social Action.” Sociological Methodology, 38, 155–200. DOI: 10.1111/j.1467-9531.2008.00203.x.
   Web of Science ®Google Scholar
• Cai, D., and Campbell, T. (2015), “Edge-exchangeable Graphs and Sparsity,” Workshop on Networks in the Social and Information Sciences, NIPS 2015.
   Google Scholar
• Cai, D., Campbell, T., and Broderick, T. (2016), “Edge-exchangeable Graphs and Sparsity,” Neural Information Processing Systems.
   Google Scholar
• Caron, F., and Fox, E. (2017), “Bayesian Nonparametric Models of Sparse and Exchangeable Random Graphs,” Journal of the Royal Statistical Society, Series B, 79, 1295–1366. DOI: 10.1111/rssb.12233.
   Google Scholar
• Cohen, W. W. (2009), “Enron Email Dataset,”.
   Google Scholar
• Cox, D. R. (1972), “Regression Models and Life-tables” (with discussion), Journal of the Royal Statistical Society, Series B, 34, 187–220. DOI: 10.1111/j.2517-6161.1972.tb00899.x.
   Web of Science ®Google Scholar
• Crane, H., and Dempsey, W. (2017), “Edge Exchangeable Models for Interaction Networks,” Journal of the American Statistical Association.
   Web of Science ®Google Scholar
• Crane, H., and Dempsey, W. (2018a), “Edge Exchangeable Models for Network Data,” Journal of the American Statistical Association, 113, 1311–1326.
   PubMed Web of Science ®Google Scholar
• Crane, H., and Dempsey, W. (2018b), “A Framework for Statistical Network Modeling,” Statistical Science.
   Google Scholar
• Crane, H., and Dempsey, W. (2019), “Relational Exchangeability,” Journal of Applied Probability, 56, 192–208.
   Web of Science ®Google Scholar
• Durante, D., Dunson, D. B., and Vogelstein, J. T. (2017), “Nonparametric Bayes Modeling of Populations of Networks,” Journal of the American Statistical Association, 112, 1516–1530. DOI: 10.1080/01621459.2016.1219260.
   Web of Science ®Google Scholar
• Eagle, N., and Pentland, A. (2006), “Reality Mining: Sensing Complex Social Systems.” Pers. Ubiquit. Comput., 10, 255–268. DOI: 10.1007/s00779-005-0046-3.
   Web of Science ®Google Scholar
• Escobar, M., and West, M. (1995), “Bayesian Density Estimation and Inference Using Mixtures,” Journal of the American Statistical Association, 90, 577–588. DOI: 10.1080/01621459.1995.10476550.
   Web of Science ®Google Scholar
• Estrada, E. (2012), The Structure of Complex Networks: Theory and Applications, Oxford University Press.
   Google Scholar
• Fowler, J. H. (2006), “Connecting the Congress: A Study of Cosponsorship Networks.” Polit. Anal., 14, 456–487. DOI: 10.1093/pan/mpl002.
   Web of Science ®Google Scholar
• Gelman, A., Meng, X.-L., and Stern, H. (1996), “Posterior Predictive Assessment of Model Fitness Via Realized Discrepancies,” Statistica Sinica, 6, 733–807.
   Web of Science ®Google Scholar
• Goldenberg, A., Zheng, A. X., Fienberg, S. E., and Airoldi, E. M. (2009), “A Survey of Statistical Network Models,” Foundations and Trends in Machine Learning, 2, 1–117.
   Google Scholar
• Goldenberg, A., Zheng, A. X., Fienberg, S. E., and Airoldi, E. M. (2010), “A Survey of Statistical Network Models,” Foundations and Trends[textregistered] in Machine Learning, 2, 129–233.
   Google Scholar
• Han, Q., Xu, K., and Airoldi, E. (2015), “Consistent Estimation of Dynamic and Multi-layer block Models,” in International Conference on Machine Learning, pp. 1511–1520.
   Google Scholar
• Hoff, P., Raftery, A., and Handcock, M. (2002), “Latent Space Approaches to Social Network Analysis,” Journal of the American Statistical Association, 97, 1090–1098. DOI: 10.1198/016214502388618906.
   Web of Science ®Google Scholar
• Holland, P., Laskey, K., and Leinhardt, S. (1983a), “Stochastic Blockmodels: First Steps,” Social Networks, 5, 109–137. DOI: 10.1016/0378-8733(83)90021-7.
   Web of Science ®Google Scholar
• Holland, P., Laskey, K., and Leinhardt, S. (1983b), “Stochastic Blockmodels: First Steps,” Social Networks, 5, 109–137.
   Web of Science ®Google Scholar
• Ishwaran, H., and James, L. (2001), “Gibbs Sampling Methods for Stick-Breaking Priors,” Journal of the American Statistical Association, 96, 161–173. DOI: 10.1198/016214501750332758.
   Web of Science ®Google Scholar
• Klimt, B., and Yang, Y. (2004), “The Enron Corpus: A New Dataset for Email Classification Research,” in European Conference on Machine Learning, Springer, pp. 217–226.
   Google Scholar
• Latora, V., Nicosia, V., and Russo, G. (2017), Complex Networks: Principles, Methods and Applications. Cambridge University Press.
   Google Scholar
• Latouche, P., Birmelé, E., Ambroise, C., et al. (2011), “Overlapping Stochastic Block Models With Application to the French Political Blogosphere,” The Annals of Applied Statistics, 5, 309–336. DOI: 10.1214/10-AOAS382.
   Web of Science ®Google Scholar
• Latouche, P., Birmelé, E., Ambroise, C. (2014), “Model Selection in Overlapping Stochastic Block Models,” Electronic Journal of Statistics, 8, 762–794.
   Web of Science ®Google Scholar
• Latouche, P., Robin, S., and Ouadah, S. (2015), “Goodness of Fit of Logistic Models for Random Graphs,” available at arXiv:1508.00286.
   Google Scholar
• Luckie, M., Hyun, Y., and Huffaker, B. (2008), “Traceroute Probe Method and Forward IP Path Inference,” in Proc. Internet Measurement Conference (IMC), pp. 311–324. DOI: 10.1145/1452520.1452557.
   Google Scholar
• Mariadassou, M., Robin, S., and Vacher, C. (2010), “Uncovering Latent Structure in Valued Graphs: A Variational Approach,” Annals of Applied Statistics, 4, 715–742.
   Web of Science ®Google Scholar
• McCallum, A., Wang, X., and Corrada-Emmanuel, A. (2007), “Topic and Role Discovery in Social Networks With Experiments on Enron and Academic Email,” Journal of Artificial Intelligence Research, 30, 249–272. DOI: 10.1613/jair.2229.
   Web of Science ®Google Scholar
• McCullagh, P. (2002), “What is a Statistical Model?” Annals of Statistics, 30, 1225–1310, with comments and a rejoinder by the author.
   Web of Science ®Google Scholar
• Newman, M. (2010), Networks: An Introduction. Oxford University Press.
   Google Scholar
• Ng, A. Y., Jordan, M. I., and Weiss, Y. (2002), “On Spectral Clustering: Analysis and an Algorithm,” in Advances in Neural Information Processing Systems, pp. 849–856.
   Google Scholar
• Orbanz, P. (2017), “Subsampling Large Graphs and Invariance in Networks,” arXiv:1710.04217.
   Google Scholar
• Orbanz, P., and Roy, D. (2014), “Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures,” IEEE Transactions on Pattern Analysis and Machine Intelligence, to appear. DOI: 10.1109/TPAMI.2014.2334607.
   Google Scholar
• Perry, P., and Wolfe, P. (2013), “Point Process Modelling for Directed Interaction Networks,” Journal of the Royal Statistical Society, Series B, 75, 821–849. DOI: 10.1111/rssb.12013.
   Google Scholar
• Pitman, J. (2006), Combinatorial Stochastic Processes, vol. 1875 of Lecture Notes in Mathematics, Berlin: Springer-Verlag.
   Google Scholar
• Priebe, C. E., Conroy, J. M., Marchette, D. J., and Park, Y. (2005), “Scan Statistics on Enron Graphs,” Computational & Mathematical Organization Theory, 11, 229–247.
   Google Scholar
• Robins, G., Pattison, P., Kalish, Y., and Lusher, D. (2007), “An Introduction to Exponential Random Graph (p*) Models for Social Networks,” Social Networks, 29, 173–191. DOI: 10.1016/j.socnet.2006.08.002.
   Web of Science ®Google Scholar
• Rossi, L. A., and Gnawali, O. (2014), “Language Independent Analysis and Classification of Discussion Threads in Coursera MOOC Forums,” in Proceedings of the IEEE International Conference on Information Reuse and Integration (IRI 2014).
   Google Scholar
• Signorelli, M., and Wit, E. (2018), “A Penalized Inference Approach to Stochastic Block Modelling of Community Structure in the Italian Parliament,” Journal of the Royal Statistical Society, Series C, 67, 355–369. DOI: 10.1111/rssc.12234.
   Web of Science ®Google Scholar
• Silva, J. and Willett, R. (2009), “Hypergraph-based Anomaly Detection of High-dimensional Co-occurrences,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 31, 563–569. DOI: 10.1109/TPAMI.2008.232.
   PubMed Web of Science ®Google Scholar
• Sweet, T. (2015), “Incorporating Covariates Into Stochastic Blockmodels,” Journal of Educational and Behavioral Statistics, 40, 634–664. DOI: 10.3102/1076998615606110.
   Web of Science ®Google Scholar
• Tallberg, C. (2004), “A Bayesian Approach to Modeling Stochastic Block—Structures with Covariates,” Journal of Mathematical Sociology, 29, 1–23. DOI: 10.1080/00222500590889703.
   Web of Science ®Google Scholar
• Teh, Y. W. (2006), “A Bayesian Interpretation of Interpolated Kneserney,” Tech. rep., National University of Singapore.
   Google Scholar
• Tyler, J. R., Wilkinson, D., and Huberman, B. (2005), “E-mail as Spectroscopy: Automated Discovery of Community Structure Within Organizations.” Inform. Soc., 21, 143–153. DOI: 10.1080/01972240590925348.
   Web of Science ®Google Scholar
• van der Pas, S. L. and van der Vaart, A. W. (2018), “Bayesian Community Detection,” Bayesian Analysis, 13, 767–796. DOI: 10.1214/17-BA1078.
   Web of Science ®Google Scholar
• Veitch, V., and Roy, D. (2015), “The Class of Random Graphs Arising from Exchangeable Random Measures,” arXiv:1512.03099.
   Google Scholar
• Veitch, V., and Roy, D. M. (2019), “Sampling and Estimation for (sparse) Exchangeable Graphs,” Annals of Statistics, 47, 3274–3299.
   Web of Science ®Google Scholar
• Wasserman, S., and Pattison, P. (1996), “Logit Models and Logistic Regressions for Social Networks: I. An Introduction to Markov graphs and p,” Psychometrika, 61, 401–425. DOI: 10.1007/BF02294547.
   Web of Science ®Google Scholar
• Williamson, S. A. (2016), “Nonparametric Network Models for Link Prediction,” Journal of Machine Learning Research, 17, 1–21.
   Web of Science ®Google Scholar
• Zhang, Y., Levina, E., and Zhu, J. (2016), “Community Detection in Networks With Node Features,” Electronic Journal of Statistics, 10, 3153–3178. DOI: 10.1214/16-EJS1206.
   Web of Science ®Google Scholar