Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.9
2.1
Journals
Entropy
Special Issues
Complexity of Social Networks
entropy-logo
Submit to Special Issue Submit Abstract to Special Issue Review for Entropy Propose a Special Issue

Journal Menu

► Journal Menu

Journal Browser

► Journal Browser
share announcement

Complexity of Social Networks

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Complexity".

Deadline for manuscript submissions: 31 March 2026 | Viewed by 915

Special Issue Editors

Prof. Dr. Zi-Ke Zhang

E-Mail Website
Guest Editor
College of Media and International Culture, Zhejiang University, Hangzhou 310058, China
Interests: complex networks; computational social science; social networks; recommender systems; complex systems
Dr. Junming Huang

E-Mail Website
Guest Editor
Paul and Marcia Wythes Center on Contemporary China, Princeton University, Princeton, NJ, USA
Interests: computational social science; social networks; AI; complex systems
Dr. Xiaoke Xu

E-Mail Website
Guest Editor
Center for Computational Communication Research (Zhuhai), School of Journalism and Communication, Beijing Normal University, Beijing, China
Interests: social robots; computational communication; complex networks; social network analysis; big data analysis
Dr. Quanhui Liu

E-Mail Website
Guest Editor
College of Computer Science, Sichuan University, Chengdu 610065, China
Interests: data science; network science; computational epidemiology; graph neural networks; natural language processing

Special Issue Information

Dear Colleagues,

Social networks are characterized by heterogeneous structures, nonlinear dynamics, and evolving interactions among individuals, groups, and communities. Studying these networks is essential for understanding information diffusion, opinion evolution, and collective behavior in digital societies. Recent advances in computational methods have leveraged complex network theory to uncover the underlying mechanisms, including influence propagation, misinformation diffusion, and network evolution.

Digital platforms, such as social media and recommender systems, play vital roles in shaping communication and interactions. Through algorithmic mediation, these platforms impact information flows, influence user behavior, and contribute to the emergence of echo chambers and polarization, significantly promoting the complexity of analyzing the data and undemanding the underlying mechanism. Despite progress, significant challenges persist, particularly in understanding the dynamic patterns of information diffusion, the long-term effects of algorithmic recommendations on network structure, and the role of AI agents in simulating user interactions within these systems.

Therefore, this Special Issue seeks state-of-the-art research on social network complexity, emphasizing theoretical, computational, and applied approaches. Topics include information spreading mechanisms, community structure change, algorithmic system dynamics, AI in social network models, and novel methodologies for complex network analysis. Contributions are encouraged to address emerging challenges in algorithm-driven social systems or propose innovative frameworks.

Prof. Dr. Zi-Ke Zhang
Dr. Junming Huang
Dr. Xiaoke Xu
Dr. Quanhui Liu
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • social networks
  • social media
  • network structure dynamics
  • echo chambers
  • collective behavior
  • AI in social networks
  • information diffusion

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (2 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

22 pages, 1467 KiB  
Article
DDML: Multi-Student Knowledge Distillation for Hate Speech
by Ze Liu, Zerui Shao, Haizhou Wang and Beibei Li
Entropy 2025, 27(4), 417; https://doi.org/10.3390/e27040417 - 11 Apr 2025
Viewed by 207
Abstract
Recent studies have shown that hate speech on social media negatively impacts users’ mental health and is a contributing factor to suicide attempts. On a broader scale, online hate speech can undermine social stability. With the continuous growth of the internet, the prevalence [...] Read more.
Recent studies have shown that hate speech on social media negatively impacts users’ mental health and is a contributing factor to suicide attempts. On a broader scale, online hate speech can undermine social stability. With the continuous growth of the internet, the prevalence of online hate speech is rising, making its detection an urgent issue. Recent advances in natural language processing, particularly with transformer-based models, have shown significant promise in hate speech detection. However, these models come with a large number of parameters, leading to high computational requirements and making them difficult to deploy on personal computers. To address these challenges, knowledge distillation offers a solution by training smaller student networks using larger teacher networks. Recognizing that learning also occurs through peer interactions, we propose a knowledge distillation method called Deep Distill–Mutual Learning (DDML). DDML employs one teacher network and two or more student networks. While the student networks benefit from the teacher’s knowledge, they also engage in mutual learning with each other. We trained numerous deep neural networks for hate speech detection based on DDML and demonstrated that these networks perform well across various datasets. We tested our method across ten languages and nine datasets. The results demonstrate that DDML enhances the performance of deep neural networks, achieving an average F1 score increase of 4.87% over the baseline. Full article
(This article belongs to the Special Issue Complexity of Social Networks)
►▼ Show Figures

Figure 1

20 pages, 2113 KiB  
Article
Identifying Influential Nodes Based on Evidence Theory in Complex Network
by Fu Tan, Xiaolong Chen, Rui Chen, Ruijie Wang, Chi Huang and Shimin Cai
Entropy 2025, 27(4), 406; https://doi.org/10.3390/e27040406 - 10 Apr 2025
Viewed by 319
Abstract
Influential node identification is an important and hot topic in the field of complex network science. Classical algorithms for identifying influential nodes are typically based on a single attribute of nodes or the simple fusion of a few attributes. However, these methods perform [...] Read more.
Influential node identification is an important and hot topic in the field of complex network science. Classical algorithms for identifying influential nodes are typically based on a single attribute of nodes or the simple fusion of a few attributes. However, these methods perform poorly in real networks with high complexity and diversity. To address this issue, a new method based on the Dempster–Shafer (DS) evidence theory is proposed in this paper, which improves the efficiency of identifying influential nodes through the following three aspects. Firstly, Dempster–Shafer evidence theory quantifies uncertainty through its basic belief assignment function and combines evidence from different information sources, enabling it to effectively handle uncertainty. Secondly, Dempster–Shafer evidence theory processes conflicting evidence using Dempster’s rule of combination, enhancing the reliability of decision-making. Lastly, in complex networks, information may come from multiple dimensions, and the Dempster–Shafer theory can effectively integrate this multidimensional information. To verify the effectiveness of the proposed method, extensive experiments are conducted on real-world complex networks. The results show that, compared to the other algorithms, attacking the influential nodes identified by the DS method is more likely to lead to the disintegration of the network, which indicates that the DS method is more effective for identifying the key nodes in the network. To further validate the reliability of the proposed algorithm, we use the visibility graph algorithm to convert the GBP futures time series into a complex network and then rank the nodes in the network using the DS method. The results show that the top-ranked nodes correspond to the peaks and troughs of the time series, which represents the key turning points in price changes. By conducting an in-depth analysis, investors can uncover major events that influence price trends, once again confirming the effectiveness of the algorithm. Full article
(This article belongs to the Special Issue Complexity of Social Networks)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-2
Back to TopTop