IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v123y2018icp86-100.html
   My bibliography  Save this article

Dealing with reciprocity in dynamic stochastic block models

Author

Listed:
  • Bartolucci, Francesco
  • Marino, Maria Francesca
  • Pandolfi, Silvia

Abstract

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.

Suggested Citation

  • Bartolucci, Francesco & Marino, Maria Francesca & Pandolfi, Silvia, 2018. "Dealing with reciprocity in dynamic stochastic block models," Computational Statistics & Data Analysis, Elsevier, vol. 123(C), pages 86-100.
    • Handle: RePEc:eee:csdana:v:123:y:2018:i:c:p:86-100
    DOI: 10.1016/j.csda.2018.01.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947318300112
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2018.01.010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. N. Lee & C. Priebe, 2011. "A latent process model for time series of attributed random graphs," Statistical Inference for Stochastic Processes, Springer, vol. 14(3), pages 231-253, October.
    2. Lawrence Hubert & Phipps Arabie, 1985. "Comparing partitions," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 193-218, December.
    3. Daniele Durante & David B. Dunson, 2014. "Nonparametric Bayes dynamic modelling of relational data," Biometrika, Biometrika Trust, vol. 101(4), pages 883-898.
    4. Hoff, Peter D., 2011. "Hierarchical multilinear models for multiway data," Computational Statistics & Data Analysis, Elsevier, vol. 55(1), pages 530-543, January.
    5. Christophe Ambroise & Catherine Matias, 2012. "New consistent and asymptotically normal parameter estimates for random‐graph mixture models," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 74(1), pages 3-35, January.
    6. Catherine Matias & Vincent Miele, 2017. "Statistical clustering of temporal networks through a dynamic stochastic block model," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(4), pages 1119-1141, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Marino, Maria Francesca & Pandolfi, Silvia, 2022. "Hybrid maximum likelihood inference for stochastic block models," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    2. Chabert-Liddell, Saint-Clair & Barbillon, Pierre & Donnet, Sophie & Lazega, Emmanuel, 2021. "A stochastic block model approach for the analysis of multilevel networks: An application to the sociology of organizations," Computational Statistics & Data Analysis, Elsevier, vol. 158(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Riccardo Rastelli & Michael Fop, 2020. "A stochastic block model for interaction lengths," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 14(2), pages 485-512, June.
    2. Marino, Maria Francesca & Pandolfi, Silvia, 2022. "Hybrid maximum likelihood inference for stochastic block models," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    3. Dragana M. Pavlović & Bryan R.L. Guillaume & Soroosh Afyouni & Thomas E. Nichols, 2020. "Multi‐subject stochastic blockmodels with mixed effects for adaptive analysis of individual differences in human brain network cluster structure," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 74(3), pages 363-396, August.
    4. Ludkin, Matthew, 2020. "Inference for a generalised stochastic block model with unknown number of blocks and non-conjugate edge models," Computational Statistics & Data Analysis, Elsevier, vol. 152(C).
    5. Linardi, Fernando & Diks, Cees & van der Leij, Marco & Lazier, Iuri, 2020. "Dynamic interbank network analysis using latent space models," Journal of Economic Dynamics and Control, Elsevier, vol. 112(C).
    6. Pierre Barbillon & Sophie Donnet & Emmanuel Lazega & Avner Bar-Hen, 2017. "Stochastic block models for multiplex networks: an application to a multilevel network of researchers," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 180(1), pages 295-314, January.
    7. Paul Riverain & Simon Fossier & Mohamed Nadif, 2023. "Poisson degree corrected dynamic stochastic block model," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 17(1), pages 135-162, March.
    8. Chabert-Liddell, Saint-Clair & Barbillon, Pierre & Donnet, Sophie & Lazega, Emmanuel, 2021. "A stochastic block model approach for the analysis of multilevel networks: An application to the sociology of organizations," Computational Statistics & Data Analysis, Elsevier, vol. 158(C).
    9. Bartolucci, Francesco & Marino, Maria Francesca & Pandolfi, Silvia, 2015. "Composite likelihood inference for hidden Markov models for dynamic networks," MPRA Paper 67242, University Library of Munich, Germany.
    10. Catherine Matias & Vincent Miele, 2017. "Statistical clustering of temporal networks through a dynamic stochastic block model," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(4), pages 1119-1141, September.
    11. C Matias & T Rebafka & F Villers, 2018. "A semiparametric extension of the stochastic block model for longitudinal networks," Biometrika, Biometrika Trust, vol. 105(3), pages 665-680.
    12. Miriam Aparicio, 2021. "Resiliency and Cooperation or Regarding Social and Collective Competencies for University Achievement. An Analysis from a Systemic Perspective," European Journal of Social Sciences Education and Research Articles, Revistia Research and Publishing, vol. 8, ejser_v8_.
    13. Yunpeng Zhao & Qing Pan & Chengan Du, 2019. "Logistic regression augmented community detection for network data with application in identifying autism‐related gene pathways," Biometrics, The International Biometric Society, vol. 75(1), pages 222-234, March.
    14. Wu, Han-Ming & Tien, Yin-Jing & Chen, Chun-houh, 2010. "GAP: A graphical environment for matrix visualization and cluster analysis," Computational Statistics & Data Analysis, Elsevier, vol. 54(3), pages 767-778, March.
    15. José E. Chacón, 2021. "Explicit Agreement Extremes for a 2 × 2 Table with Given Marginals," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 257-263, July.
    16. F. Marta L. Di Lascio & Andrea Menapace & Roberta Pappadà, 2024. "A spatially‐weighted AMH copula‐based dissimilarity measure for clustering variables: An application to urban thermal efficiency," Environmetrics, John Wiley & Sons, Ltd., vol. 35(1), February.
    17. Yifan Zhu & Chongzhi Di & Ying Qing Chen, 2019. "Clustering Functional Data with Application to Electronic Medication Adherence Monitoring in HIV Prevention Trials," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 11(2), pages 238-261, July.
    18. Irene Vrbik & Paul McNicholas, 2015. "Fractionally-Supervised Classification," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 359-381, October.
    19. Maurizio Vichi & Carlo Cavicchia & Patrick J. F. Groenen, 2022. "Hierarchical Means Clustering," Journal of Classification, Springer;The Classification Society, vol. 39(3), pages 553-577, November.
    20. Batool, Fatima & Hennig, Christian, 2021. "Clustering with the Average Silhouette Width," Computational Statistics & Data Analysis, Elsevier, vol. 158(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:123:y:2018:i:c:p:86-100. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.