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

Network inference from temporally dependent grouped observations

Author

Listed:
  • Zhao, Yunpeng

Abstract

In social network analysis, the observed data usually reflect certain social behaviors, such as the formation of groups, rather than an explicit network structure. Zhao and Weko proposed a model-based approach called the hub model to infer implicit networks from grouped observations (Zhao and Weko, 2019). The hub model assumes independence between groups, which sometimes is not valid in practice. The hub model is generalized into the case of grouped observations with temporal dependence. As in the hub model, the group at each time point is gathered under one leader in the new model. Unlike in the hub model, the group leaders are not sampled independently but follow a Markov chain, and other members in adjacent groups can also be correlated.

Suggested Citation

  • Zhao, Yunpeng, 2022. "Network inference from temporally dependent grouped observations," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    • Handle: RePEc:eee:csdana:v:171:y:2022:i:c:s0167947322000500
    DOI: 10.1016/j.csda.2022.107470
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947322000500
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2022.107470?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. David Liben‐Nowell & Jon Kleinberg, 2007. "The link‐prediction problem for social networks," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 58(7), pages 1019-1031, May.
    2. Yan, Ting & Zhao, Yunpeng & Qin, Hong, 2015. "Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters," Journal of Multivariate Analysis, Elsevier, vol. 133(C), pages 61-76.
    3. Ting Yan & Jinfeng Xu, 2013. "A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices," Biometrika, Biometrika Trust, vol. 100(2), pages 519-524.
    4. Yong Zhang & Xiaodi Qian & Hong Qin & Ting Yan, 2017. "Affiliation networks with an increasing degree sequence," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 46(22), pages 11163-11180, November.
    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. Jing Luo & Tour Liu & Qiuping Wang, 2022. "Affiliation weighted networks with a differentially private degree sequence," Statistical Papers, Springer, vol. 63(2), pages 367-395, April.
    2. Qiuping Wang & Yuan Zhang & Ting Yan, 2023. "Asymptotic theory in network models with covariates and a growing number of node parameters," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 75(2), pages 369-392, April.
    3. Han, Ruijian & Chen, Kani & Tan, Chunxi, 2020. "Bivariate gamma model," Journal of Multivariate Analysis, Elsevier, vol. 180(C).
    4. Yong, Zhang & Chen, Siyu & Qin, Hong & Yan, Ting, 2016. "Directed weighted random graphs with an increasing bi-degree sequence," Statistics & Probability Letters, Elsevier, vol. 119(C), pages 235-240.
    5. Yan, Ting & Zhao, Yunpeng, 2016. "Asymptotics of score test in the generalized β-model for networks," Statistics & Probability Letters, Elsevier, vol. 119(C), pages 163-169.
    6. Jing Luo & Haoyu Wei & Xiaoyu Lei & Jiaxin Guo, 2021. "Asymptotic in a class of network models with an increasing sub-Gamma degree sequence," Papers 2111.01301, arXiv.org, revised Nov 2023.
    7. Yan, Ting, 2015. "A note on asymptotic distributions in maximum entropy models for networks," Statistics & Probability Letters, Elsevier, vol. 98(C), pages 1-5.
    8. Yifei Zhou & Shaoyong Li & Yaping Liu, 2020. "Graph-based Method for App Usage Prediction with Attributed Heterogeneous Network Embedding," Future Internet, MDPI, vol. 12(3), pages 1-16, March.
    9. Bryan S. Graham, 2017. "An econometric model of network formation with degree heterogeneity," CeMMAP working papers 08/17, Institute for Fiscal Studies.
    10. Nora Connor & Albert Barberán & Aaron Clauset, 2017. "Using null models to infer microbial co-occurrence networks," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-23, May.
    11. Leto Peel & Tiago P. Peixoto & Manlio De Domenico, 2022. "Statistical inference links data and theory in network science," Nature Communications, Nature, vol. 13(1), pages 1-15, December.
    12. Rafiee, Samira & Salavati, Chiman & Abdollahpouri, Alireza, 2020. "CNDP: Link prediction based on common neighbors degree penalization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    13. Bikramjit Das & Tiandong Wang & Gengling Dai, 2022. "Asymptotic Behavior of Common Connections in Sparse Random Networks," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 2071-2092, September.
    14. Áureo de Paula, 2015. "Econometrics of network models," CeMMAP working papers CWP52/15, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    15. Cristiano Varin & Manuela Cattelan & David Firth, 2016. "Statistical modelling of citation exchange between statistics journals," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 179(1), pages 1-63, January.
    16. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    17. Greg Morrison & L Mahadevan, 2012. "Discovering Communities through Friendship," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-9, July.
    18. Liu, Zhenfeng & Feng, Jian & Uden, Lorna, 2023. "Technology opportunity analysis using hierarchical semantic networks and dual link prediction," Technovation, Elsevier, vol. 128(C).
    19. Shugang Li & Ziming Wang & Beiyan Zhang & Boyi Zhu & Zhifang Wen & Zhaoxu Yu, 2022. "The Research of “Products Rapidly Attracting Users” Based on the Fully Integrated Link Prediction Algorithm," Mathematics, MDPI, vol. 10(14), pages 1-19, July.
    20. Chunjiang Liu & Yikun Han & Haiyun Xu & Shihan Yang & Kaidi Wang & Yongye Su, 2024. "A Community Detection and Graph-Neural-Network-Based Link Prediction Approach for Scientific Literature," Mathematics, MDPI, vol. 12(3), pages 1-20, January.

    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:171:y:2022:i:c:s0167947322000500. 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.