entropy-logo

Journal Browser

Journal Browser

Entropy in Community Detection and Modeling Dynamics in Complex Network

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

Deadline for manuscript submissions: closed (30 November 2022) | Viewed by 4457

Special Issue Editors


E-Mail Website
Guest Editor
Director of the Network Science and Technology Center, Rensselaer Polytechnic Institute, Troy, NY 12180, USA
Interests: entropy measures for social networks, multilayer networks, and evolving networks; network science, diffusion processes on networks
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Biological Physics, Eötvös University, Pázmány P. stny. 1/A 1117 Budapest, Hungary
Interests: network ensembles and topological phase transitions; network clustering; network geometry and hyperbolic models; hierarchical networks

E-Mail Website
Guest Editor
Director of the Office of Information and Technology, Southwest University, Chongqing 400715, China
Interests: network embedding; diffusion processes on networks; scholar/citation network
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
ENGINE – The European Centre for Data Science, Wroclaw University of Science and Technology, 50-370 Wrocław, Poland
Interests: temporal social networks; entropy measures for complex networks; diffusion processes on networks; machine learning for complex networks

E-Mail Website
Guest Editor
Postdoctoral Researcher, Biology Department, Reed College, Portland, OR 97202, USA
Interests: gene co-expression networks; protein-protein interaction networks; modularity; signaling pathways; diffusion processes on networks

Special Issue Information

Dear Colleagues,

This Special Issue aims to gather research that studies the use of entropy concept and measures in  complex networks. We aim to provide the audience with the state of the art in this rapidly growing research direction. The submissions are welcome on entropy concept and measures in network science, including, but not limited to:

  • Social network dynamics, evolution, and clustering, scholar & citation networks;
  • Analytics for covert network such as crime, and terrorist network, including edge augmentation and community detection;
  • Multilayer complex networks analysis and clustering;
  • Network ensembles and topological phase transitions, and network geometry and hyperbolic models;
  • Entropy in analysis and prediction of spreading and diffusion processes in networks (e.g., social influence);
  • Analysis of dynamics and clustering of bionetworks, including gene co-expression networks, protein-protein interaction networks, signaling pathways;
  • Any applications of entropy concept and measures to complex networks.

This Special Issue is intended to be a cross-domain knowledge exchange, which is why we welcome contributions on the state of the art and current research in the aforementioned areas from different perspectives, such as computer science, physics, and mathematics, but also including sociology, psychology,  and marketing that focus on complex social networks.

The last two decades have seen unprecedented growth of hardware and software for monitoring and controlling industrial, and personal networks fueling data revolution that makes data about the network dynamics ubiquitous and giving rise to data science. At the same time abundance of processing power of computers fueled leaps of achievements in Machine Learning and AI. The editors of this  Special Issue are therefore interested in new methods that combine data availability and novel ML and AI tools to enable researchers to investigate interwoven phenomena arising at different levels of complex networks through the prism of entropy that is fundamental to understanding dynamics and evolution of complex systems.

This call for papers is also fully open to all who want to contribute by submitting a relevant research manuscript to this Special Issue of Entropy, published by MDPI in open access format.

Prof. Dr. Boleslaw K. Szymanski
Prof. Dr. Gergely Palla
Prof. Dr. Hocine Cherifi
Prof. Dr. Tao Jia
Prof. Dr. Przemysław Kazienko
Dr. Pramesh Singh
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

  • entropy
  • entropy measures
  • complex networks
  • network dynamics
  • multilayer networks
  • diffusion processes
  • community detection

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

23 pages, 2566 KiB  
Article
GTIP: A Gaming-Based Topic Influence Percolation Model for Semantic Overlapping Community Detection
by Hailu Yang, Jin Zhang, Xiaoyu Ding, Chen Chen and Lili Wang
Entropy 2022, 24(9), 1274; https://0-doi-org.brum.beds.ac.uk/10.3390/e24091274 - 09 Sep 2022
Cited by 2 | Viewed by 1137
Abstract
Community detection in semantic social networks is a crucial issue in online social network analysis, and has received extensive attention from researchers in various fields. Different conventional methods discover semantic communities based merely on users’ preferences towards global topics, ignoring the influence of [...] Read more.
Community detection in semantic social networks is a crucial issue in online social network analysis, and has received extensive attention from researchers in various fields. Different conventional methods discover semantic communities based merely on users’ preferences towards global topics, ignoring the influence of topics themselves and the impact of topic propagation in community detection. To better cope with such situations, we propose a Gaming-based Topic Influence Percolation model (GTIP) for semantic overlapping community detection. In our approach, community formation is modeled as a seed expansion process. The seeds are individuals holding high influence topics and the expansion is modeled as a modified percolation process. We use the concept of payoff in game theory to decide whether to allow neighbors to accept the passed topics, which is more in line with the real social environment. We compare GTIP with four traditional (GN, FN, LFM, COPRA) and seven representative (CUT, TURCM, LCTA, ACQ, DEEP, BTLSC, SCE) semantic community detection methods. The results show that our method is closer to ground truth in synthetic networks and has a higher semantic modularity in real networks. Full article
Show Figures

Figure 1

18 pages, 518 KiB  
Article
CoarSAS2hvec: Heterogeneous Information Network Embedding with Balanced Network Sampling
by Ling Zhan and Tao Jia
Entropy 2022, 24(2), 276; https://0-doi-org.brum.beds.ac.uk/10.3390/e24020276 - 14 Feb 2022
Cited by 6 | Viewed by 2195
Abstract
Heterogeneous information network (HIN) embedding is an important tool for tasks such as node classification, community detection, and recommendation. It aims to find the representations of nodes that preserve the proximity between entities of different nature. A family of approaches that are widely [...] Read more.
Heterogeneous information network (HIN) embedding is an important tool for tasks such as node classification, community detection, and recommendation. It aims to find the representations of nodes that preserve the proximity between entities of different nature. A family of approaches that are widely adopted applies random walk to generate a sequence of heterogeneous contexts, from which, the embedding is learned. However, due to the multipartite graph structure of HIN, hub nodes tend to be over-represented to their context in the sampled sequence, giving rise to imbalanced samples of the network. Here, we propose a new embedding method: CoarSAS2hvec. The self-avoiding short sequence sampling with the HIN coarsening procedure (CoarSAS) is utilized to better collect the rich information in HIN. An optimized loss function is used to improve the performance of the HIN structure embedding. CoarSAS2hvec outperforms nine other methods in node classification and community detection on four real-world data sets. Using entropy as a measure of the amount of information, we confirm that CoarSAS catches richer information of the network compared with that through other methods. Hence, the traditional loss function applied to samples by CoarSAS can also yield improved results. Our work addresses a limitation of the random-walk-based HIN embedding that has not been emphasized before, which can shed light on a range of problems in HIN analyses. Full article
Show Figures

Figure 1

Back to TopTop