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

Dynamic community detection based on the Matthew effect

Author

Listed:
  • Sun, Zejun
  • Sun, Yanan
  • Chang, Xinfeng
  • Wang, Feifei
  • Pan, Zhongqiang
  • Wang, Guan
  • Liu, Jianfen

Abstract

The identification of community structures plays a crucial role in analyzing network topology, exploring network functions, and mining potential patterns in complex networks. Many algorithms have been proposed for identifying community structures in static networks from different perspectives. However, most networks in the real world are not static and their structures constantly evolve over time. Identifying community structures in dynamic networks remains a challenging task because of the variability, complexity, and large scale of dynamic networks. In this study, we propose a framework and Matthew effect model for community detection in dynamic networks. Based on this architecture and model, we design a dynamic community detection algorithm called, Dynamic Community Detection based on the Matthew effect (DCDME), which employs a batch processing method to reveal communities incrementally in each network snapshot. DCDME has several desirable benefits: high-quality community detection, parameter-free operation, and good scalability. Extensive experiments on synthetic and real-world dynamic networks have demonstrated that DCDME has many advantages and outperforms several state-of-the-art algorithms.

Suggested Citation

  • Sun, Zejun & Sun, Yanan & Chang, Xinfeng & Wang, Feifei & Pan, Zhongqiang & Wang, Guan & Liu, Jianfen, 2022. "Dynamic community detection based on the Matthew effect," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 597(C).
    • Handle: RePEc:eee:phsmap:v:597:y:2022:i:c:s0378437122002564
    DOI: 10.1016/j.physa.2022.127315
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437122002564
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2022.127315?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. Nam P Nguyen & Thang N Dinh & Yilin Shen & My T Thai, 2014. "Dynamic Social Community Detection and Its Applications," PLOS ONE, Public Library of Science, vol. 9(4), pages 1-18, April.
    2. Shang, Jiaxing & Liu, Lianchen & Li, Xin & Xie, Feng & Wu, Cheng, 2016. "Targeted revision: A learning-based approach for incremental community detection in dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 70-85.
    3. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    4. Xing Su & Jianjun Cheng & Haijuan Yang & Mingwei Leng & Wenbo Zhang & Xiaoyun Chen, 2020. "IncNSA: Detecting communities incrementally from time-evolving networks based on node similarity," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 31(07), pages 1-19, July.
    5. Lawrence Hubert & Phipps Arabie, 1985. "Comparing partitions," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 193-218, December.
    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. Yu, Wei & Jiao, Pengfei & Wang, Wenjun & Yu, Yang & Chen, Xue & Pan, Lin, 2019. "A novel evolutionary clustering via the first-order varying information for dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 507-520.
    2. 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_.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Irene Vrbik & Paul McNicholas, 2015. "Fractionally-Supervised Classification," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 359-381, October.
    9. 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.
    10. Liang, Wei & Shi, Yuming & Huang, Qiuling, 2014. "Modeling the Chinese language as an evolving network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 268-276.
    11. Batool, Fatima & Hennig, Christian, 2021. "Clustering with the Average Silhouette Width," Computational Statistics & Data Analysis, Elsevier, vol. 158(C).
    12. Patrick D. Shay & Stephen S. Farnsworth Mick, 2017. "Clustered and distinct: a taxonomy of local multihospital systems," Health Care Management Science, Springer, vol. 20(3), pages 303-315, September.
    13. Roberto Rocci & Stefano Antonio Gattone & Roberto Di Mari, 2018. "A data driven equivariant approach to constrained Gaussian mixture modeling," 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. 12(2), pages 235-260, June.
    14. Wan-Lun Wang, 2019. "Mixture of multivariate t nonlinear mixed models for multiple longitudinal data with heterogeneity and missing values," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 196-222, March.
    15. Matthijs Warrens, 2010. "Inequalities Between Kappa and Kappa-Like Statistics for k×k Tables," Psychometrika, Springer;The Psychometric Society, vol. 75(1), pages 176-185, March.
    16. Redivo, Edoardo & Nguyen, Hien D. & Gupta, Mayetri, 2020. "Bayesian clustering of skewed and multimodal data using geometric skewed normal distributions," Computational Statistics & Data Analysis, Elsevier, vol. 152(C).
    17. Jerzy Korzeniewski, 2016. "New Method Of Variable Selection For Binary Data Cluster Analysis," Statistics in Transition New Series, Polish Statistical Association, vol. 17(2), pages 295-304, June.
    18. Zhu, Xuwen & Melnykov, Volodymyr, 2018. "Manly transformation in finite mixture modeling," Computational Statistics & Data Analysis, Elsevier, vol. 121(C), pages 190-208.
    19. Amiri, Babak & Karimianghadim, Ramin, 2024. "A novel text clustering model based on topic modelling and social network analysis," Chaos, Solitons & Fractals, Elsevier, vol. 181(C).
    20. Li, Pai-Ling & Chiou, Jeng-Min, 2011. "Identifying cluster number for subspace projected functional data clustering," Computational Statistics & Data Analysis, Elsevier, vol. 55(6), pages 2090-2103, June.

    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:phsmap:v:597:y:2022:i:c:s0378437122002564. 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.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.