IDEAS home Printed from https://ideas.repec.org/a/bla/jorssb/v79y2017i4p1119-1141.html

Statistical clustering of temporal networks through a dynamic stochastic block model

Author

Listed:
  • Catherine Matias
  • Vincent Miele

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:bla:jorssb:v:79:y:2017:i:4:p:1119-1141
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/rssb.12200
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Leroux, Brian G., 1992. "Maximum-likelihood estimation for hidden Markov models," Stochastic Processes and their Applications, Elsevier, vol. 40(1), pages 127-143, February.
    2. Hoff P.D. & Raftery A.E. & Handcock M.S., 2002. "Latent Space Approaches to Social Network Analysis," Journal of the American Statistical Association, American Statistical Association, vol. 97, pages 1090-1098, December.
    3. Lawrence Hubert & Phipps Arabie, 1985. "Comparing partitions," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 193-218, December.
    4. Petter Holme, 2015. "Modern temporal network theory: a colloquium," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 88(9), pages 1-30, September.
    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.
    Full references (including those not matched with items on IDEAS)

    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. Guang Ouyang & Dipak K. Dey & Panpan Zhang, 2020. "Clique-Based Method for Social Network Clustering," Journal of Classification, Springer;The Classification Society, vol. 37(1), pages 254-274, April.
    3. Marino, Maria Francesca & Pandolfi, Silvia, 2022. "Hybrid maximum likelihood inference for stochastic block models," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    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. 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.
    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. 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.
    8. Teague R. Henry & Kathleen M. Gates & Mitchell J. Prinstein & Douglas Steinley, 2020. "Modeling Heterogeneous Peer Assortment Effects Using Finite Mixture Exponential Random Graph Models," Psychometrika, Springer;The Psychometric Society, vol. 85(1), pages 8-34, March.
    9. Teague R. Henry & David Banks & Derek Owens-Oas & Christine Chai, 2019. "Modeling Community Structure and Topics in Dynamic Text Networks," Journal of Classification, Springer;The Classification Society, vol. 36(2), pages 322-349, July.
    10. Xia, Ye-Mao & Tang, Nian-Sheng, 2019. "Bayesian analysis for mixture of latent variable hidden Markov models with multivariate longitudinal data," Computational Statistics & Data Analysis, Elsevier, vol. 132(C), pages 190-211.
    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. Mihaela Voinea, 2021. "Support Teacher as Key Factor of Integration Children with Special Education Needs in Mainstream School," European Journal of Social Sciences Education and Research Articles, Revistia Research and Publishing, vol. 8, September.
    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. Michael P. B. Gallaugher & Salvatore D. Tomarchio & Paul D. McNicholas & Antonio Punzo, 2022. "Multivariate cluster weighted models using skewed distributions," 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. 16(1), pages 93-124, March.
    15. Scrucca, Luca, 2016. "Identifying connected components in Gaussian finite mixture models for clustering," Computational Statistics & Data Analysis, Elsevier, vol. 93(C), pages 5-17.
    16. Lacasa, Lucas & Marín-Rodríguez, F. Javier & Masuda, Naoki & Arola-Fernández, Lluís, 2025. "Scalar embedding of temporal network trajectories," Chaos, Solitons & Fractals, Elsevier, vol. 199(P1).
    17. Laura Bocci & Donatella Vicari, 2019. "ROOTCLUS: Searching for “ROOT CLUSters” in Three-Way Proximity Data," Psychometrika, Springer;The Psychometric Society, vol. 84(4), pages 941-985, December.
    18. Michael Braun & André Bonfrer, 2011. "Scalable Inference of Customer Similarities from Interactions Data Using Dirichlet Processes," Marketing Science, INFORMS, vol. 30(3), pages 513-531, 05-06.
    19. 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.
    20. Zhongnan Jin & Jie Min & Yili Hong & Pang Du & Qingyu Yang, 2024. "Multivariate Functional Clustering with Variable Selection and Application to Sensor Data from Engineering Systems," INFORMS Joural on Data Science, INFORMS, vol. 3(2), pages 203-218, October.

    More about this item

    Statistics

    Access and download statistics

    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:bla:jorssb:v:79:y:2017:i:4:p:1119-1141. 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/rssssea.html .

    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.