×

Dealing with reciprocity in dynamic stochastic block models. (English) Zbl 1469.62018

Summary: A stochastic block model for dynamic network data is introduced, where directed relations among a set of nodes are observed at different time occasions and the blocks are represented by a sequence of latent variables following a Markov chain. Dyads are explicitly modeled conditional on the states occupied by both nodes involved in the relation. With respect to the approaches already available in the literature, the main focus is on reciprocity. In this regard, three different parameterizations are proposed in which: (i) reciprocity is allowed to depend on the blocks of the nodes in the dyad; (ii) reciprocity is assumed to be constant across blocks; and (iii) reciprocity is ruled out. The assumption of conditional independence between dyads (referred to different pairs of nodes and time occasions) given the latent blocks is always retained. Given the complexity of the model, inference on its parameters is based on a variational approach, where a lower bound of the log-likelihood function is maximized instead of the intractable full model log-likelihood. An approximate likelihood ratio test statistic is proposed which compares the value at convergence of this lower bound under different model specifications. This allows us to formally test for both the hypothesis of no reciprocity and that of constant reciprocity with respect to the latent blocks. The proposed approach is illustrated via a simulation study based on different scenarios. The application to two benchmark datasets in the social network literature is also proposed to illustrate the effectiveness of the proposal in studying reciprocity and identifying groups of nodes having a similar social behavior.

MSC:

62-08 Computational methods for problems pertaining to statistics
62H22 Probabilistic graphical models
62M05 Markov processes: estimation; hidden Markov models
91D30 Social networks; opinion dynamics

Software:

networkDynamic; R
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Agresti, A., Categorical data analysis, (2013), Wiley-Interscience Hoboken, New Jersey · Zbl 1281.62022
[2] Amati, V.; Lomi, A.; Mira, A., Social network modeling, Annu. Rev. Stat. Appl., 5, (2018), in press
[3] Ambroise, C.; Matias, C., New consistent and asymptotically normal parameter estimates for random-graph mixture models, J. R. Stat. Soc. Ser. B Stat. Methodol., 74, 3-35, (2012)
[4] Bartolucci, F.; Farcomeni, A.; Pennoni, F., (Latent Markov Models for Longitudinal Data. Chapman & Hall/CRC Statistics in the Social and Behavioral Sciences, (2013), Taylor & Francis) · Zbl 1341.62002
[5] Biernacki, C.; Celeux, G.; Govaert, G., Assessing a mixture model for clustering with the integrated completed likelihood, IEEE Trans. Pattern Anal. Mach. Intell., 22, 719-725, (2000)
[6] Butts, C. T., A relational event framework for social action, Sociol. Methodol., 38, 155-200, (2008)
[7] Butts, C.T., Leslie-Cook, A., Krivitsky, P.N., Bender-deMoll, S., 2016. networkDynamic: Dynamic Extensions for Network Objects. R package version 0.9.0. URL https://CRAN.R-project.org/package=networkDynamic; Butts, C.T., Leslie-Cook, A., Krivitsky, P.N., Bender-deMoll, S., 2016. networkDynamic: Dynamic Extensions for Network Objects. R package version 0.9.0. URL https://CRAN.R-project.org/package=networkDynamic
[8] Cox, D. R.; Hinkley, D. V., Theoretical statistics, (1979), CRC Press · Zbl 0334.62003
[9] Daudin, J.-J.; Picard, F.; Robin, S., A mixture model for random graphs, Stat. Comput., 18, 173-183, (2008)
[10] Dempster, A. P.; Laird, N. M.; Rubin, D. B., Maximum likelihood from incomplete data via the EM algorithm, J. R. Stat. Soc. Ser. B Stat. Methodol., 39, 1-38, (1977) · Zbl 0364.62022
[11] Diggle, P.; Heagerty, P.; Liang, K.-Y.; Zeger, S., Analysis of longitudinal data, (2002), Oxford University Press
[12] Durante, D.; Dunson, D. B., Nonparametric Bayes dynamic modelling of relational data, Biometrika, 101, 883-898, (2014) · Zbl 1306.62075
[13] Efron, B., Bootstrap methods: another look at the jackknife, Ann. Statist., 7, 1-26, (1979) · Zbl 0406.62024
[14] Goldenberg, A.; Zheng, A. X.; Fienberg, S. E.; Airoldi, E. M., A survey of statistical network models, Found. Trends Mach. Learn., 2, 129-233, (2010) · Zbl 1184.68030
[15] Hanneke, S.; Fu, W.; Xing, E. P., Discrete temporal models of social networks, Electron. J. Stat., 4, 585-605, (2010) · Zbl 1329.91113
[16] Ho, Q., Song, L., Xing, E.P., 2011. Evolving cluster mixed-membership blockmodel for time-evolving networks. In: International Conference on Artificial Intelligence and Statistics, pp. 342-350.; Ho, Q., Song, L., Xing, E.P., 2011. Evolving cluster mixed-membership blockmodel for time-evolving networks. In: International Conference on Artificial Intelligence and Statistics, pp. 342-350.
[17] Hoff, P. D., Hierarchical multilinear models for multiway data, Comput. Statist. Data Anal., 55, 530-543, (2011) · Zbl 1247.62158
[18] Holland, P. W.; Laskey, K. B.; Leinhardt, S., Stochastic blockmodels: first steps, Soc. Netw., 5, 109-137, (1983)
[19] Holland, P. W.; Leinhardt, S., Local structure in social networks, Sociol. Methodol., 7, 1-45, (1976)
[20] Hubert, L.; Arabie, P., Comparing partitions, J. Classification, 2, 193-218, (1985)
[21] Lee, N.; Priebe, C., A latent process model for time series of attributed random graphs, Stat. Inference Stoch. Process., 14, 231-253, (2011) · Zbl 1225.62125
[22] Lusher, D.; Koskinen, J.; Robins, G., Exponential random graph models for social networks: theory, methods, and applications, (2013), Cambridge University Press
[23] Matias, C.; Miele, V., Statistical clustering of temporal networks through a dynamic stochastic block model, J. R. Stat. Soc. Ser. B Stat. Methodol., 79, 1119-1141, (2017) · Zbl 1373.62312
[24] Newcomb, T. M., The acquaintance process, (1961), Holt, Rinehart & Winston
[25] Nowicki, K.; Snijders, T. A.B., Estimation and prediction for stochastic blockstructures, J. Amer. Statist. Assoc., 96, 1077-1087, (2001) · Zbl 1072.62542
[26] Priebe, C. E.; Conroy, J. M.; Marchette, D. J.; Park, Y., Scan statistics on enron graphs, Comput. Math. Organ. Theory, 11, 229-247, (2005) · Zbl 1086.68562
[27] Quintane, E.; Conaldi, G.; Tonellato, M.; Lomi, A., Modeling relational events: a case study on an open source software project, Organ. Res. Methods, 17, 23-50, (2014)
[28] Rand, W. M., Objective criteria for the evaluation of clustering methods, J. Amer. Statist. Assoc., 66, 846-850, (1971)
[29] Robins, G.; Pattison, P., Random graph models for temporal processes in social networks, J. Math. Sociol., 25, 5-41, (2001) · Zbl 0986.91048
[30] Sarkar, P.; Moore, A. W., Dynamic social network analysis using latent space models, (Advances in Neural Information Processing Systems, (2006)), 1145-1152
[31] Sarkar, P., Siddiqi, S.M., Gordon, G.J., 2007. A latent space approach to dynamic embedding of co-occurrence data. In: International Conference on Artificial Intelligence and Statistics, pp. 420-427.; Sarkar, P., Siddiqi, S.M., Gordon, G.J., 2007. A latent space approach to dynamic embedding of co-occurrence data. In: International Conference on Artificial Intelligence and Statistics, pp. 420-427.
[32] Snijders, T. A., Stochastic actor-oriented models for network change, J. Math. Sociol., 21, 149-172, (1996) · Zbl 0883.92038
[33] Snijders, T. A., The statistical evaluation of social network dynamics, Sociol. Methodol., 31, 361-395, (2001)
[34] Snijders, T. A., Models for longitudinal network data, (Models and Methods in Social Network Analysis, Vol. 1, (2005)), 215-247
[35] Snijders, T. A.; Nowicki, K., Estimation and prediction for stochastic blockmodels for graphs with latent block structure, J. Classification, 14, 75-100, (1997) · Zbl 0896.62063
[36] Snijders, T. A.; Van de Bunt, G. G.; Steglich, C. E., Introduction to stochastic actor-based models for network dynamics, Social Networks, 32, 44-60, (2010)
[37] Vu, D. Q.; Hunter, D. R.; Schweinberger, M., Model-based clustering of large networks, Ann. Appl. Stat., 7, 1010-1039, (2013) · Zbl 1288.62106
[38] Wang, P.; Sharpe, K.; Robins, G. L.; Pattison, P. E., Exponential random graph (p\({}^\ast\)) models for affiliation networks, Social Networks, 31, 12-25, (2009)
[39] Xing, E. P.; Fu, W.; Song, L., A state-space mixed membership blockmodel for dynamic network tomography, Ann. Appl. Stat., 4, 535-566, (2010) · Zbl 1194.62133
[40] Xu, K., 2015. Stochastic block transition models for dynamic networks. In: 18th International Conference on Artificial Intelligence and Statistics, pp. 1079-1087.; Xu, K., 2015. Stochastic block transition models for dynamic networks. In: 18th International Conference on Artificial Intelligence and Statistics, pp. 1079-1087.
[41] Xu, K. S.; Hero, A. O., Dynamic stochastic blockmodels for time-evolving social networks, IEEE J. Sel. Top. Sign. Proces., 8, 552-562, (2014)
[42] Yang, T.; Chi, Y.; Zhu, S.; Gong, Y.; Jin, R., Detecting communities and their evolutions in dynamic social networks - a Bayesian approach, Mach. Learn., 82, 157-189, (2011) · Zbl 1237.91189
[43] Zucchini, W.; MacDonald, I. L.; Langrock, R., Hidden Markov models for time series: an introduction using R, vol. 150, (2016), CRC press · Zbl 1362.62005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.