Topic Editors

Dr. Alexandre G. Evsukoff
Instituto Alberto Luiz Coimbra de Pós Graduação e Pesquisa, Universidade Federal do Rio de Janeiro, Rio de Janeiro 21941972, Brazil
Department of Computer and Information Sciences, Northumbria University, Newcastle-upon-Tyne, UK

Computational Complex Networks

Abstract submission deadline
closed (30 April 2024)
Manuscript submission deadline
30 June 2024
Viewed by
10181

Topic Information

Dear Colleagues,

Computational methods and models in complex networks have recently been proved useful in investigating a variety of networked systems, where various network properties can be analyzed. They are widely used, for example, in network communication, control, prediction, estimation, and security. Recently, fruitful achievements in the research of computation in complex networks have been reported in the literature. At the same time, with the deepening of research, many new problems and challenges have emerged. The aim of this Topic is to provide the latest theoretical methods or practical algorithms to complex networks and their applications. It is hoped that the contents of this Topic can provide useful information and technical references for readers interested in this area, so as to promote network computation progress. This Topic has a wide scope, from theoretical to practical applications.

Dr. Alexandre G. Evsukoff
Dr. Yilun Shang
Topic Editors

Keywords

  • complex system theory 
  • network algorithm 
  • network science 
  • complex network applications 
  • community detection 
  • artificial intelligence on graphs 
  • multilayer networks 
  • applications on real systems

Participating Journals

Journal Name Impact Factor CiteScore Launched Year First Decision (median) APC
Entropy
entropy
2.7 4.7 1999 20.8 Days CHF 2600 Submit
Algorithms
algorithms
2.3 3.7 2008 15 Days CHF 1600 Submit
Computation
computation
2.2 3.3 2013 18 Days CHF 1800 Submit
Fractal and Fractional
fractalfract
5.4 3.6 2017 18.9 Days CHF 2700 Submit

Preprints.org is a multidiscipline platform providing preprint service that is dedicated to sharing your research from the start and empowering your research journey.

MDPI Topics is cooperating with Preprints.org and has built a direct connection between MDPI journals and Preprints.org. Authors are encouraged to enjoy the benefits by posting a preprint at Preprints.org prior to publication:

  1. Immediately share your ideas ahead of publication and establish your research priority;
  2. Protect your idea from being stolen with this time-stamped preprint article;
  3. Enhance the exposure and impact of your research;
  4. Receive feedback from your peers in advance;
  5. Have it indexed in Web of Science (Preprint Citation Index), Google Scholar, Crossref, SHARE, PrePubMed, Scilit and Europe PMC.

Published Papers (6 papers)

Order results
Result details
Journals
Select all
Export citation of selected articles as:
16 pages, 15509 KiB  
Article
HAG-NET: Hiding Data and Adversarial Attacking with Generative Adversarial Network
by Haiju Fan and Jinsong Wang
Entropy 2024, 26(3), 269; https://doi.org/10.3390/e26030269 - 19 Mar 2024
Viewed by 782
Abstract
Recent studies on watermarking techniques based on image carriers have demonstrated new approaches that combine adversarial perturbations against steganalysis with embedding distortions. However, while these methods successfully counter convolutional neural network-based steganalysis, they do not adequately protect the data of the carrier itself. [...] Read more.
Recent studies on watermarking techniques based on image carriers have demonstrated new approaches that combine adversarial perturbations against steganalysis with embedding distortions. However, while these methods successfully counter convolutional neural network-based steganalysis, they do not adequately protect the data of the carrier itself. Recognizing the high sensitivity of Deep Neural Networks (DNNs) to small perturbations, we propose HAG-NET, a method based on image carriers, which is jointly trained by the encoder, decoder, and attacker. In this paper, the encoder generates Adversarial Steganographic Examples (ASEs) that are adversarial to the target classification network, thereby providing protection for the carrier data. Additionally, the decoder can recover secret data from ASEs. The experimental results demonstrate that ASEs produced by HAG-NET achieve an average success rate of over 99% on both the MNIST and CIFAR-10 datasets. ASEs generated with the attacker exhibit greater robustness in terms of attack ability, with an average increase of about 3.32%. Furthermore, our method, when compared with other generative stego examples under similar perturbation strength, contains significantly more information according to image information entropy measurements. Full article
(This article belongs to the Topic Computational Complex Networks)
Show Figures

Figure 1

24 pages, 8072 KiB  
Article
Research on Risk Contagion in ESG Industries: An Information Entropy-Based Network Approach
by Chenglong Hu and Ranran Guo
Entropy 2024, 26(3), 206; https://doi.org/10.3390/e26030206 - 27 Feb 2024
Viewed by 963
Abstract
Sustainable development is a practical path to optimize industrial structures and enhance investment efficiency. Investigating risk contagion within ESG industries is a crucial step towards reducing systemic risks and fostering the green evolution of the economy. This research constructs ESG industry indices, taking [...] Read more.
Sustainable development is a practical path to optimize industrial structures and enhance investment efficiency. Investigating risk contagion within ESG industries is a crucial step towards reducing systemic risks and fostering the green evolution of the economy. This research constructs ESG industry indices, taking into account the possibility of extreme tail risks, and employs VaR and CoVaR as measures of tail risk. The TENET network approach is integrated to to capture the structural evolution and direction of information flow among ESG industries, employing information entropy to quantify the topological characteristics of the network model, exploring the risk transmission paths and evolution patterns of ESG industries in an extreme tail risk event. Finally, Mantel tests are conducted to examine the existence of significant risk spillover effects between ESG and traditional industries. The research finds strong correlations among ESG industry indices during stock market crash, Sino–US trade frictions, and the COVID-19 pandemic, with industries such as the COAL, CMP, COM, RT, and RE playing key roles in risk transmission within the network, transmitting risks to other industries. Affected by systemic risk, the information entropy of the TENET network significantly decreases, reducing market information uncertainty and leading market participants to adopt more uniform investment strategies, thus diminishing the diversity of market behaviors. ESG industries show resilience in the face of extreme risks, demonstrating a lack of significant risk contagion with traditional industries. Full article
(This article belongs to the Topic Computational Complex Networks)
Show Figures

Figure 1

17 pages, 3278 KiB  
Article
Identifying Influential Nodes in Complex Networks Based on Information Entropy and Relationship Strength
by Ying Xi and Xiaohui Cui
Entropy 2023, 25(5), 754; https://doi.org/10.3390/e25050754 - 5 May 2023
Cited by 6 | Viewed by 1851
Abstract
Identifying influential nodes is a key research topic in complex networks, and there have been many studies based on complex networks to explore the influence of nodes. Graph neural networks (GNNs) have emerged as a prominent deep learning architecture, capable of efficiently aggregating [...] Read more.
Identifying influential nodes is a key research topic in complex networks, and there have been many studies based on complex networks to explore the influence of nodes. Graph neural networks (GNNs) have emerged as a prominent deep learning architecture, capable of efficiently aggregating node information and discerning node influence. However, existing graph neural networks often ignore the strength of the relationships between nodes when aggregating information about neighboring nodes. In complex networks, neighboring nodes often do not have the same influence on the target node, so the existing graph neural network methods are not effective. In addition, the diversity of complex networks also makes it difficult to adapt node features with a single attribute to different types of networks. To address the above problems, the paper constructs node input features using information entropy combined with the node degree value and the average degree of the neighbor, and proposes a simple and effective graph neural network model. The model obtains the strength of the relationships between nodes by considering the degree of neighborhood overlap, and uses this as the basis for message passing, thereby effectively aggregating information about nodes and their neighborhoods. Experiments are conducted on 12 real networks, using the SIR model to verify the effectiveness of the model with the benchmark method. The experimental results show that the model can identify the influence of nodes in complex networks more effectively. Full article
(This article belongs to the Topic Computational Complex Networks)
Show Figures

Figure 1

19 pages, 1822 KiB  
Article
Exploiting Dual-Attention Networks for Explainable Recommendation in Heterogeneous Information Networks
by Xianglin Zuo, Tianhao Jia, Xin He, Bo Yang and Ying Wang
Entropy 2022, 24(12), 1718; https://doi.org/10.3390/e24121718 - 24 Nov 2022
Cited by 1 | Viewed by 1608
Abstract
The aim of explainable recommendation is not only to provide recommended items to users, but also to make users aware of why these items are recommended. Traditional recommendation methods infer user preferences for items using user–item rating information. However, the expressive power of [...] Read more.
The aim of explainable recommendation is not only to provide recommended items to users, but also to make users aware of why these items are recommended. Traditional recommendation methods infer user preferences for items using user–item rating information. However, the expressive power of latent representations of users and items is relatively limited due to the sparseness of the user–item rating matrix. Heterogeneous information networks (HIN) provide contextual information for improving recommendation performance and interpreting the interactions between users and items. However, due to the heterogeneity and complexity of context information in HIN, it is still a challenge to integrate this contextual information into explainable recommendation systems effectively. In this paper, we propose a novel framework—the dual-attention networks for explainable recommendation (DANER) in HINs. We first used multiple meta-paths to capture high-order semantic relations between users and items in HIN for generating similarity matrices, and then utilized matrix decomposition on similarity matrices to obtain low-dimensional sparse representations of users and items. Secondly, we introduced two-level attention networks, namely a local attention network and a global attention network, to integrate the representations of users and items from different meta-paths for obtaining high-quality representations. Finally, we use a standard multi-layer perceptron to model the interactions between users and items, which predict users’ ratings of items. Furthermore, the dual-attention mechanism also contributes to identifying critical meta-paths to generate relevant explanations for users. Comprehensive experiments on two real-world datasets demonstrate the effectiveness of DANER on recommendation performance as compared with the state-of-the-art methods. A case study illustrates the interpretability of DANER. Full article
(This article belongs to the Topic Computational Complex Networks)
Show Figures

Figure 1

15 pages, 6744 KiB  
Article
Research on Fractal Evolution Characteristics and Safe Mining Technology of Overburden Fissures under Gully Water Body
by Kaijun Miao, Shihao Tu, Hongsheng Tu, Xun Liu, Wenlong Li, Hongbin Zhao, Long Tang, Jieyang Ma and Yan Li
Fractal Fract. 2022, 6(9), 486; https://doi.org/10.3390/fractalfract6090486 - 30 Aug 2022
Cited by 10 | Viewed by 1265
Abstract
A fractal realizes the quantitative characterization of complex and disordered mining fracture networks, and it is of great significance to grasp the fractal characteristics of rock movement law to guide mine production. To prevent the water-conducting fracture (WF) under the gullies from conducting [...] Read more.
A fractal realizes the quantitative characterization of complex and disordered mining fracture networks, and it is of great significance to grasp the fractal characteristics of rock movement law to guide mine production. To prevent the water-conducting fracture (WF) under the gullies from conducting the surface water body, and to realize the purpose of safe production and surface water body protection. The evolution of overburden fissures in the working face with shallow buried gulley landform and thick bedrock conditions is studied. The development height of water-conducting fracture (DHWF) is theoretically analyzed. The evolution characteristics of overlying fissures with different mining heights were observed by similarity simulation, and the observation results were analyzed by fractal theory. The results show that the main factor that determines the height of WF is mining height. The working face is mined at different mining heights, and the corresponding indexes such as the height of the WF, the area of the caving zone and the fractal dimension are related to engineering phenomena. In particular, the appearance and disappearance of the separation space correspond to the fractal dimension fluctuation phase. The safe mining technology under a gully water body, which mainly reduces mining height, is adopted, and the fissures of the working face are not connected to the surface water body after mining. Full article
(This article belongs to the Topic Computational Complex Networks)
Show Figures

Figure 1

19 pages, 4979 KiB  
Article
Successive Trajectory Privacy Protection with Semantics Prediction Differential Privacy
by Jing Zhang, Yanzi Li, Qian Ding, Liwei Lin and Xiucai Ye
Entropy 2022, 24(9), 1172; https://doi.org/10.3390/e24091172 - 23 Aug 2022
Cited by 5 | Viewed by 1827
Abstract
The publication of trajectory data provides critical information for various location-based services, and it is critical to publish trajectory data safely while ensuring its availability. Differential privacy is a promising privacy protection technology for publishing trajectory data securely. Most of the existing trajectory [...] Read more.
The publication of trajectory data provides critical information for various location-based services, and it is critical to publish trajectory data safely while ensuring its availability. Differential privacy is a promising privacy protection technology for publishing trajectory data securely. Most of the existing trajectory privacy protection schemes do not take into account the user’s preference for location and the influence of semantic location. Besides, differential privacy for trajectory protection still has the problem of balance between the privacy budget and service quality. In this paper, a semantics- and prediction-based differential privacy protection scheme for trajectory data is proposed. Firstly, trajectory data are transformed into a prefix tree structure to ensure that they satisfy differential privacy. Secondly, considering the influence of semantic location on trajectory, semantic sensitivity combined with location check-in frequency is used to calculate the sensitivity of each position in the trajectory. The privacy level of the position is classified by setting thresholds. Moreover, the corresponding privacy budget is allocated according to the location privacy level. Finally, a Markov chain is used to predict the attack probability of each position in the trajectory. On this basis, the allocation of the privacy budget is further adjusted and its utilization rate is improved. Thus, the problem of the balance between the privacy budget and service quality is solved. Experimental results show that the proposed scheme is able to ensure data availability while protecting data privacy. Full article
(This article belongs to the Topic Computational Complex Networks)
Show Figures

Figure 1

Back to TopTop