Identifying influential nodes in complex networks: A multiple attributes fusion method

How to identify influential nodes is still an open hot issue in complex networks. Lots of methods (e.g., degree centrality, betweenness centrality or K-shell) are based on the topology of a network. These methods work well in scale-free networks. In order to design a universal method suitable for networks with different topologies, this paper proposes a Multiple Attribute Fusion (MAF) method through combining topological attributes and diffused attributes of a node together. Two fusion strategies have been proposed in this paper. One is based on the attribute union (FU), and the other is based on the attribute ranking (FR). Simulation results in the Susceptible-Infected (SI) model show that our proposed method gains more information propagation efficiency in different types of networks. © 2014 Springer International Publishing.

Identifying influential nodes in complex networks for network immunization

Identifying influential nodes is of theoretical significance in network immunization which is one of important methods to prevent virus propagation through protecting the influential nodes in a network. Lots of methods have been proposed to find these influential nodes based on the topological characteristics of a network (e.g., degree, betweenness or K-shell). Whereas due to the diversity of network topologies, these methods are not always effective in identifying influential nodes in any benchmark networks. We combine the advantages of existing methods based on attribute ranking and propose a universal ranking method, namely MAF (Multiple Attribute Fusion), to identify influential nodes from a complex network. We compare the efficiency of our proposed method with existing immunization strategies in different types of networks. Simulation results in the interactive email model show that the immunized nodes selected by MAF can restrain virus propagation effectively.

Synchronization of singular Markovian jumping complex networks with additive time-varying delays via pinning control

Abstract
This study examines the problem of synchronization for singular complex dynamical networks with Markovian jumping parameters and two additive time-varying delay components. The complex networks consist of m modes which switch from one mode to another according to a Markovian chain with known transition probability. Pinning control strategies are designed to make the singular complex networks synchronized. Based on the appropriate Lyapunov-Krasovskii functional, introducing some free weighting matrices and using convexity of matrix functions, a novel synchronization criterion is derived. The proposed sufficient conditions are established in the form of linear matrix inequalities. Finally, a numerical example is presented to illustrate the effectiveness of the obtained results.

PhysarumSpreader: a new bio-Inspired methodology for identifying influential spreaders in complex networks

Identifying influential spreaders in networks, which contributes to optimizing the use of available resources and efficient spreading of information, is of great theoretical significance and practical value. A random-walk-based algorithm LeaderRank has been shown as an effective and efficient method in recognizing leaders in social network, which even outperforms the well-known PageRank method. As LeaderRank is initially developed for binary directed networks, further extensions should be studied in weighted networks. In this paper, a generalized algorithm PhysarumSpreader is proposed by combining LeaderRank with a positive feedback mechanism inspired from an amoeboid organism called Physarum Polycephalum. By taking edge weights into consideration and adding the positive feedback mechanism, PhysarumSpreader is applicable in both directed and undirected networks with weights. By taking two real networks for examples, the effectiveness of the proposed method is demonstrated by comparing with other standard centrality measures.

Identifying social influence in complex networks: a novel conductance eigenvector centrality model

Identifying influential peers is an important issue for business to promote commercial strategies in social networks. This paper proposes a conductance eigenvector centrality (CEC) model to measure peer influence in the complex social network. The CEC model considers the social network as a conductance network and constructs methods to calculate the conductance matrix of the network. By a novel random walk mechanism, the CEC model obtains stable CEC values which measure the peer influence in the network. The experiments show that the CEC model can achieve robust performance in identifying peer influence. It outperforms the benchmark algorithms and obtains excellent outcomes when the network has high clustering coefficient.

Complex network theoretical analysis on information dissemination over vehicular networks

How to enhance the communication efficiency and quality on vehicular networks is one critical important issue. While with the larger and larger scale of vehicular networks in dense cities, the real-world datasets show that the vehicular networks essentially belong to the complex network model. Meanwhile, the extensive research on complex networks has shown that the complex network theory can both provide an accurate network illustration model and further make great contributions to the network design, optimization and management. In this paper, we start with analyzing characteristics of a taxi GPS dataset and then establishing the vehicular-to-infrastructure, vehicle-to-vehicle and the hybrid communication model, respectively. Moreover, we propose a clustering algorithm for station selection, a traffic allocation optimization model and an information source selection model based on the communication performances and complex network theory.

To shut them up or to clarify: restraining the spread of rumors in online social networks

Restraining the spread of rumors in online social networks (OSNs) has long been an important but difficult problem to be addressed. Currently, there are mainly two types of methods 1) blocking rumors at the most influential users or community bridges, or 2) spreading truths to clarify the rumors. Each method claims the better performance among all the others according to their own considerations and environments. However, there must be one standing out of the rest. In this paper, we focus on this part of work. The difficulty is that there does not exist a universal standard to evaluate them. In order to address this problem, we carry out a series of empirical and theoretical analysis on the basis of the introduced mathematical model. Based on this mathematical platform, each method will be evaluated by using real OSN data.We have done three types of analysis in this work. First, we compare all the measures of locating important users. The results suggest that the degree and betweenness measures outperform all the others in the Facebook network. Second, we analyze the method of the truth clarification method, and find that this method has a long-term performance while the degree measure performs well only in the early stage. Third, in order to leverage these two methods, we further explore the strategy of different methods working together and their equivalence. Given a fixed budget in the real world, our analysis provides a potential solution to find out a better strategy by integrating both types of methods together. From both the academic and technical perspective, the work in this paper is an important step towards the most practical and optimal strategies of restraining rumors in OSNs.

Are the popular users always important for information dissemination in online social networks?

This article verifies the importance of popular users in OSNs. The results are counter-intuitive. First, for dissemination speed, a large amount of users can swiftly distribute information to the masses, but they are not highly-connected users. Second, for dissemination scale, many powerful forwarders in OSNs cannot be identified by the degree measure. Furthermore, to control dissemination, popular users cannot capture most bridges of social communities.

A sword with two edges: propagation studies on both positive and negative information in online social networks

Online social networks (OSN) have become one of the major platforms for people to exchange information. Both positive information (e.g., ideas, news and opinions) and negative information (e.g., rumors and gossips) spreading in social media can greatly influence our lives. Previously, researchers have proposed models to understand their propagation dynamics. However, those were merely simulations in nature and only focused on the spread of one type of information. Due to the human-related factors involved, simultaneous spread of negative and positive information cannot be thought of the superposition of two independent propagations. In order to fix these deficiencies, we propose an analytical model which is built stochastically from a node level up. It can present the temporal dynamics of spread such as the time people check newly arrived messages or forward them. Moreover, it is capable of capturing people's behavioral differences in preferring what to believe or disbelieve. We studied the social parameters impact on propagation using this model. We found that some factors such as people's preference and the injection time of the opposing information are critical to the propagation but some others such as the hearsay forwarding intention have little impact on it. The extensive simulations conducted on the real topologies confirm the high accuracy of our model.

Zipf`s law strikes again : the case of tourism

This paper examines the applicability of Zipf's law to tourism. It is established that a variation of this law holds in this case - a rank-size rule with concavity. Due to this non-linearity, it is shown that a spline regression provides an extremely convenient tool for predicting tourist arrivals in a country. The concavity is explained by appealing to random growth theory (lognormal distribution; Gibrat's law) and locational fundamentals.

Charismatic cops, patriarchs and a few good women : leadership, club culture and young peoples' drinking

The paper reports on key findings of a research project that examined the roles that communitybased
sporting clubs in the Australian state of Victoria play in shaping young people’s understandings and uses of alcohol. Our research imagined clubs as community hubs that are located in complex networks that impact on the ways that clubs understand their locations in communities, and which have unpredictable influences and consequences on club histories, culture and orientations to issues such as young people and alcohol use. The paper focuses on understanding the key roles played by club leaders in facilitating change and transformation in these contexts, particularly in terms of alcohol-related practices and the potential impact of these on young people’s uses and understanding of alcohol. We situate these findings in a framework that draws on the literature of complexity science and complex adaptive systems (CAS) to suggest that these practices and changes need to be understood in ways that allow for complexity, uncertainty, emergent behaviours and adaptive change.

JLMC: A clustering method based on Jordan-Form of Laplacian-Matrix

Among the current clustering algorithms of complex networks, Laplacian-based spectral clustering algorithms have the advantage of rigorous mathematical basis and high accuracy. However, their applications are limited due to their dependence on prior knowledge, such as the number of clusters. For most of application scenarios, it is hard to obtain the number of clusters beforehand. To address this problem, we propose a novel clustering algorithm - Jordan-Form of Laplacian-Matrix based Clustering algorithm (JLMC). In JLMC, we propose a model to calculate the number (n) of clusters in a complex network based on the Jordan-Form of its corresponding Laplacian matrix. JLMC clusters the network into n clusters by using our proposed modularity density function (P function). We conduct extensive experiments over real and synthetic data, and the experimental results reveal that JLMC can accurately obtain the number of clusters in a complex network, and outperforms Fast-Newman algorithm and Girvan-Newman algorithm in terms of clustering accuracy and time complexity.

Input and output analysis of complex conveyor networks

Material transfer networks are at the heart of critical infrastructure in many modern service and manufacturing industries. This research identified key performance measures, while deriving generalised analysis methodologies, for simulation models. The technology was validated for international airports, and used to determine operational capacity constraints under varied demand conditions.

Simulation-based learning for control of complex conveyor networks

This research investigated the problem of path planning in complex conveyor networks. A reinforcement learning approach was applied to derive a control strategy for routing traffic. The derived strategy was verified in real world systems and was found to improve network performance by prioritising traffic flows and balancing network load.

Recover fault services via complex service-to-node mappings in wireless sensor networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node's perspective i.e., migrating the service of faulty node to it's nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don't fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level. © 2014 Springer Science+Business Media New York.