Dealing with reciprocity in dynamic stochastic block models

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.

[1]  A. Agresti,et al.  Categorical Data Analysis , 1991, International Encyclopedia of Statistical Science.

[2]  B. Efron.  Bootstrap Methods: Another Look at the Jackknife , 1979 .

[3]  T. Newcomb.  The acquaintance process , 1961 .

[4]  P. Pattison,et al.  Random graph models for temporal processes in social networks , 2001 .

[5]  Alessandro Lomi,et al.  Social Network Modeling , 2018 .

[6]  T. Snijders,et al.  Estimation and Prediction for Stochastic Blockstructures , 2001 .

[7]  Peter D. Hoff,et al.  Hierarchical multilinear models for multiway data , 2010, Comput. Stat. Data Anal..

[8]  C. Matias,et al.  New consistent and asymptotically normal parameter estimates for random‐graph mixture models , 2012 .

[9]  Franck Picard,et al.  A mixture model for random graphs , 2008, Stat. Comput..

[10]  T. Snijders.  Stochastic actor-oriented models for network change , 1996 .

[11]  Yihong Gong,et al.  Detecting communities and their evolutions in dynamic social networks—a Bayesian approach , 2011, Machine Learning.

[12]  Alessandro Lomi,et al.  Modeling Relational Events , 2014 .

[13]  Alfred O. Hero,et al.  Dynamic Stochastic Blockmodels for Time-Evolving Social Networks , 2014, IEEE Journal of Selected Topics in Signal Processing.

[14]  T. Snijders,et al.  Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure , 1997 .

[15]  N. H. Lee,et al.  A latent process model for time series of attributed random graphs , 2011 .

[16]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[17]  T. Snijders.  Models for longitudinal network datain , 2005 .

[18]  P. Holland,et al.  Local Structure in Social Networks , 1976 .

[19]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[20]  P. Diggle,et al.  Analysis of Longitudinal Data. , 1997 .

[21]  Gérard Govaert,et al.  Assessing a Mixture Model for Clustering with the Integrated Completed Likelihood , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Tom A. B. Snijders,et al.  Introduction to stochastic actor-based models for network dynamics , 2010, Soc. Networks.

[23]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[24]  T. Snijders.  The statistical evaluation of social network dynamics , 2001 .

[25]  E. Xing,et al.  Discrete Temporal Models of Social Networks , 2006, SNA@ICML.

[26]  Carter T. Butts,et al.  4. A Relational Event Framework for Social Action , 2008 .

[27]  Peng Wang,et al.  Exponential random graph models for affiliation networks , 2009, Soc. Networks.

[28]  W. Zucchini,et al.  Hidden Markov Models for Time Series: An Introduction Using R , 2009 .

[29]  Garry Robins,et al.  Exponential random graph models for social networks: theories, methods and applications , 2012 .

[30]  D. Dunson,et al.  Nonparametric Bayes dynamic modelling of relational data , 2013, 1311.4669.

[31]  E. Xing,et al.  A state-space mixed membership blockmodel for dynamic network tomography , 2008, 0901.0135.

[32]  A. Moore,et al.  Dynamic social network analysis using latent space models , 2005, SKDD.

[33]  David J. Marchette,et al.  Scan Statistics on Enron Graphs , 2005, Comput. Math. Organ. Theory.

[34]  David R. Hunter,et al.  Model-Based Clustering of Large Networks , 2012, The annals of applied statistics.

[35]  Edoardo M. Airoldi,et al.  A Survey of Statistical Network Models , 2009, Found. Trends Mach. Learn..

[36]  Vincent Miele,et al.  Statistical clustering of temporal networks through a dynamic stochastic block model , 2015, 1506.07464.