Search

The idea of predicting links in multiplex networks has gained increasing interest in recent years. In this paper, we propose a comprehensive framework which benefits from the structural information of auxiliary layers to predict links on a target layer of multiplex networks. Specifically, we assume that the likelihood of the existence of a link between two nodes is determined by the contributions from both the nodes' neighbors on the target layer and their counterparts' neighbors on a manually network generated by auxiliary layers. The final likelihood matrix is acquired by an iterative algorithm. In addition, we show advantages of our methods for predicting links on sparse and dense networks as well as on networks with assortative and disassortative structural layers. The effectiveness of the proposed methods are evaluated through extensive experiments on real-world multiplex networks. [ABSTRACT FROM AUTHOR]

Consider an information diffusion process on a graph G that starts with k > 0 burnt vertices, and at each subsequent step, burns the neighbors of the currently burnt vertices, as well as k other unburnt vertices. The k-burning number of G is the minimum number of steps b k (G) such that all the vertices can be burned within b k (G) steps. Note that the last step may have smaller than k unburnt vertices available, where all of them are burned. The 1-burning number coincides with the well-known burning number problem, which was proposed to model the spread of social contagion. The generalization to k -burning number allows us to examine different worst-case contagion scenarios by varying the spread factor k. In this paper we prove that computing k -burning number is APX-hard, for any fixed constant k. We then give an O ((n + m) log ⁡ n) -time 3-approximation algorithm for computing k -burning number, for any k ≥ 1 , where n and m are the number of vertices and edges, respectively. Finally, we show that even if the burning sources are given as an input, computing a burning sequence itself is an NP-hard problem. [ABSTRACT FROM AUTHOR]

Background: As a common social phenomenon, nurses' occupational burnout has a high incidence rate, which seriously affects their mental health and nursing level. The current assessment mostly uses the total score model and explores the influence of external factors on burnout, while the correlation between burnout items or dimensions is less explored. Ignoring the correlation between the items or dimensions may result in a limited understanding of nurse occupational burnout. This paper explores the item and dimension network structure of the Maslach Burnout Inventory-General Survey (MBI-GS) in Chinese nurses, so as to gain a deeper understanding of this psychological construct and identify potential targets for clinical intervention. Methods: A total of 493 Chinese nurses were recruited by cluster sampling. All participants were invited to complete the survey on symptoms of burnout. Network analysis was used to investigate the item network of MBI-GS. In addition, community detection was used to explore the communities of MBI-GS, and then network analysis was used to investigate the dimension network of MBI-GS based on the results of community detection. Regularized partial correlation and non-regularized partial correlation were used to describe the association between different nodes of the item network and dimension network, respectively. Expected influence and predictability were used to describe the relative importance and the controllability of nodes in both the item and dimension networks. Results: In the item network, most of the strongly correlated edges were in the same dimension of emotional exhaustion (E), cynicism (C) and reduced professional efficacy (R), respectively. E5 (Item 5 of emotional exhaustion, the same below) "I feel burned out from my work", C1 "I have become more callous toward work since I took this job", and R3 "In my opinion, I am good at my job" had the highest expected influence (z-scores = 0.99, 0.81 and 0.94, respectively), indicating theirs highest importance in the network. E1 "I feel emotionally drained from my work" and E5 had the highest predictability (E1 = 0.74, E5 = 0.74). It shows that these two nodes can be interpreted by their internal neighbors to the greatest extent and have the highest controllability in the network. The spinglass algorithm and walktrap algorithm obtained exactly the same three communities, which are consistent with the original dimensions of MBI-GS. In the dimension network, the emotional exhaustion dimension was closely related to the cynicism dimension (weight = 0.65). Conclusions: The network model is a useful tool to study burnout in Chinese nurses. This study explores the item and domain network structure of nurse burnout from the network perspective. By calculating the relevant indicators, we found that E5, C1, and R3 were the most central nodes in the item network and cynicism was the central node in the domain network, suggesting that interventions aimed at E5, C1, R3 and cynicism might decrease the overall burnout level of Chinese nurses to the greatest extent. This study provides potential targets and a new way of thinking for the intervention of nurse burnout, which can be explored and verified in clinical practice. [ABSTRACT FROM AUTHOR]

With the development of economy and society, network analysis is widely used in more and more fields. Signed network has a good effect in the process of representation and display. As an important part of network analysis, fuzzy community detection plays an increasingly important role in analyzing and visualizing the real world. Fuzzy community detection helps to detect nodes that belong to some communities but are still closely related to other communities. These nodes are helpful for mining information from the network more realistically. However, there is little research in this field. This paper proposes a fuzzy community detection algorithm based on pointer and adjacency list. The model adopts a new ICALF network data structure, which can achieve the effect of storing community partition structure and membership value between community and node at the same time, with low time complexity and storage space. Experiments on real networks verify the correctness of the method, and prove that the method is suitable for large-scale network applications. [ABSTRACT FROM AUTHOR]

The stability and robustness of a complex network can be significantly improved by determining important nodes and by analyzing their tendency to group into clusters. Several centrality measures for evaluating the importance of a node in a complex network exist in the literature, each one focusing on a different perspective. Community detection algorithms can be used to determine clusters of nodes based on the network structure. This paper shows by empirical means that node importance can be evaluated by a dual perspective—by combining the traditional centrality measures regarding the whole network as one unit, and by analyzing the node clusters yielded by community detection. Not only do these approaches offer overlapping results but also complementary information regarding the top important nodes. To confirm this mechanism, we performed experiments for synthetic and real-world networks and the results indicate the interesting relation between important nodes on community and network level. [ABSTRACT FROM AUTHOR]