Robustness of community networks against cascading failures with heterogeneous redistribution strategies

Network robustness is one of the core contents of complex network security research.This paper focuses on the robustness of community networks with respect to cascading failures,considering the nodes influence and community heterogeneity.A novel node influence ranking method,community-based Clustering-LeaderRank(CCL)algorithm,is first proposed to identify influential nodes in community networks.Simulation results show that the CCL method can effectively identify the influence of nodes.Based on node influence,a new cascading failure model with heterogeneous redistribution strategy is proposed to describe and analyze node fault propagation in community networks.Analytical and numerical simulation results on cascading failure show that the community attribute has an important influence on the cascading failure process.The network robustness against cascading failures increases when the load is more distributed to neighbors of the same community instead of different communities.When the initial load distribution and the load redistribution strategy based on the node influence are the same,the network shows better robustness against node failure.

Cascades with coupled map lattices in preferential attachment community networks

In this paper, cascading failure is studied by coupled map lattice （CML） methods in preferential attachment community networks. It is found that external perturbation R is increasing with modularity Q growing by simulation. In particular, the large modularity Q can hold off the cascading failure dynamic process in community networks. Furthermore, different attack strategies also greatly affect the cascading failure dynamic process. It is particularly significant to control cascading failure process in real community networks.

The Supernetwork Model of Social Networking Services

The unique ways of information organization and dissemination was examined through the microblog and the real-name social network as the representatives of the new virtual social networks. In order to discuss the interrelation and interaction of the two dimensions-topic and user, a supernetwork model was established based on the supernetwork research method. Through the actual data, a supernetwork topology diagram and the changing rule of user participation were attained. And it was concluded that the key factor of dealing with emergent online public sentiment should start with affecting the opinions of key figures, whose opinions would further affect the public opinions.

Properties of asymmetrically evolved community networks

This paper studies a simple asymmetrically evolved community network with a combination of preferential attachment and random properties. An important issue about community networks is to discover the different utility increments of two nodes, where the utility is introduced to investigate the asymmetrical effect of connecting two nodes. On the other hand, the connection of two nodes in community networks can be classified as two nodes belonging to the same or to different communities. The simulation results show that the model can reproduce a power-law utility 1 distribution P（u） - u^-σ, σ = 2 ＋1/p, which can be obtained by using mean-field approximation methods. Furthermore, P the model exhibits exponential behaviour with respect to small values of a parameter denoting the random effect in our model at the low-utility region and a power-law feature with respect to big values of this parameter at the high-utility region, which is in good agreement with theoretical analysis. This kind of community network can reproduce a unique utility distribution by theoretical and numerical analysis.

Generating weighted community networks based on local events

Many realistic networks have community structures, namely, a network consists of groups of nodes within which links are dense but among which links are sparse. This paper proposes a growing network model based on local processes, the addition of new nodes intra-community and new links intra- or inter-community. Also, it utilizes the preferential attachment for building connections determined by nodes＇ strengths, which evolves dynamically during the growth of the system. The resulting network reflects the intrinsic community structure with generalized power-law distributions of nodes＇ degrees and strengths.

Sewage flow optimization algorithm for large-scale urban sewer networks based on network community division

By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations, a decomposition-coordination strategy for energy savings based on network community division is developed in this paper. A mathematical model characterizing the steady-state flow of urban sewer networks is first constructed, consisting of a set of algebraic equations with the structure transportation capacities captured as constraints. Since the sewer networks have no apparent natural hierarchical structure in general, it is very difficult to identify the clustered groups. A fast network division approach through calculating the betweenness of each edge is successfully applied to identify the groups and a sewer network with arbitrary configuration could be then decomposed into subnetworks. By integrating the coupling constraints of the subnetworks, the original problem is separated into N optimization subproblems in accordance with the network decomposition. Each subproblem is solved locally and the solutions to the subproblems are coordinated to form an appropriate global solution. Finally, an application to a specified large-scale sewer network is also investigated to demonstrate the validity of the proposed algorithm.

Roles of mutual help of local community networks in community health activities: Improvement for the quality of life of older people in Thailand

Objectives: This study aimed to describe work and activities of community networks focusing on the improvement of the quality of life (QOL) of older people in Thailand.The understanding of the work can help enhancing the community development and strengthening of local communities and their networks.Methods: Qualitative methods including in-depth interview,observation,and focus group discussion were employed to the study.64 participants participated to the study and were recruited from 4 key actors within the community.Content analysis was used to analyze the obtained data.This study was conducted in 6 local administrative organizations (LAOs) which selected from the outstanding areas of the project.Each LAO represents one sub-district of the regions of Thailand namely;(1) the upper north,(2) the lower north,(3)the upper eastern,(4) the lower eastern,(5) the central and (6) the south.Results: The findings of this study were categorized into three main themes: (1) Social capital including people in the community,social groups,and organizations,(2) Mutual help/collaboration activities composed of six sets of activities related to social capitals working on the improvement of QOL of older people,and (3) Impacts of the mutual help/collaboration activities on older people and local communities who help to improve of QOL of older people.Conclusion: The findings are important features for the community development.These themes should be recommended for community nurses,health related groups and organizations for the improvement of QOL of older people in the community.

Periodic synchronization of community networks with non-identical nodes uncertain parameters and adaptive coupling strength

In this paper, we propose a novel approach for simultaneously identifying unknown parameters and synchronizing time-delayed complex community networks with nonidentical nodes. Based on the LaSalle＇s invariance principle, a cri- teflon is established by constructing an effective control identification scheme and adjusting automatically the adaptive coupling strength. The proposed control law is applied to a complex community network which is periodically synchro- nized with different chaotic states. Numerical simulations are conducted to demonstrate the feasibility of the proposed method.

Synchronization of coupled logistic maps on random community networks

The collective synchronization of a system of coupled logistic maps on random community networks is investigated. It is found that the synchronizability of the community network is affected by two factors when the size of the network and the number of connections are fixed. One is the number of communities denoted by the parameter rn, and the other is the ratio σ of the connection probability p of each pair of nodes within each community to the connection probability q of each pair of nodes among different communities. Theoretical analysis and numerical results indicate that larger rn and smaller σ are the key to the enhancement of network synchronizability. We also testify synchronous properties of the system by analysing the largest Lyapunov exponents of the system.

Cluster synchronization in community network with nonidentical nodes via intermittent pinning control

In this paper, cluster synchronization in community network with nonidentical nodes is investigated. By combining intermittency with a pinning control scheme, some effective controllers are designed. In the control scheme, only one node in each community is controlled and coupling weights of a spanning tree in each community are enhanced. Based on the Lyapunov function method and mathematical analysis technique, two results for achieving cluster synchronization are obtained. Noticeably, by introducing an adaptive strategy, some universal adaptive intermittent pinning controllers are designed for different networks. Finally, two numerical simulations are performed to verify the correctness of the derived results.

Supply Community Network:A Taxonomy of Flow Dimensions

Supply chain management(SCM)and its associated activities continue to evolve as new communication technologies and cooperative efforts emerge to facilitate system-wide process integration;the context within which supply chains(SCs)operate,the technologies,and performance enhancement mechanisms have all changed.Thus,linear-based SCs are increasingly being challenged as firms look towards a more networked approach to maximize performance amid growing market dynamics.This paper,however,recognizing inherent similarities between social structure of Social Internet of Things(SIoT)principles and what we term supply community networks(SCN)from literature,seeks to cross-pollinate the two in a way capable of dealing with these market dynamics.Our contribution is,therefore,a new‘setting’of social relationships between supply community agents(SCA)within SCN mirroring interactions played out in the physical world;SCAs autonomously sense each other,exchange information and interact within SCN mimicking the behavior of humans.Also,it identifies the bounds of flow,i.e.all possible dimensions within a SCN which need to be understood to support relationship management.Therefore,communications are improved,sharpening SCAs synchronization in a way responsive to customer needs.

Phase synchronization on small-world networks with community structure

In this paper, we propose a simple model that can generate small-world network with community structure. The network is introduced as a tunable community organization with parameter r, which is directly measured by the ratio of inter- to intra-community connectivity, and a smaller r corresponds to a stronger community structure. The structure properties, including the degree distribution, clustering, the communication efficiency and modularity are also analysed for the network. In addition, by using the Kuramoto model, we investigated the phase synchronization on this network, and found that increasing the fuzziness of community structure will markedly enhance the network synchronizability; however, in an abnormal region （r ≤ 0.001）, the network has even worse synchronizability than the case of isolated communities （r = 0）. Furthermore, this network exhibits a remarkable synchronization behaviour in topological scales： the oscillators of high densely interconnected communities synchronize more easily, and more rapidly than the whole network.

Probability Distribution of Edge in Adjacent Matrix of Aviation Network of China and Algorithm of Searching Non-overlap Community Structure Based on Complex Network

In order to discover the probability distribution feature of edge in aviation network adjacent matrix of China and on the basis of this feature to establish an algorithm of searching non-overlap community structure in network to reveal the inner principle of complex network with the feature of small world in aspect of adjacent matrix and community structure,aviation network adjacent matrix of China was transformed according to the node rank and the matrix was arranged on the basis of ascending node rank with the center point as original point.Adjacent probability from the original point to extension around in approximate area was calculated.Through fitting probability distribution curve,power function of probability distribution of edge in adjacent matrix arranged by ascending node rank was found.According to the feature of adjacent probability distribution,deleting step by step with node rank ascending algorithm was set up to search non-overlap community structure in network and the flow chart of algorithm was given.A non-overlap community structure with 10 different scale communities in aviation network of China was found by the computer program written on the basis of this algorithm.

Design and implementation of tourism system based on interactive narrative technique

In order to meet requirements of the tourists in the process of visit and realize the purpose of the social propaganda for scenic spot, interactive narrative technique and SNS platform are combined to form a kind of new interactive narrative technique in this paper. In this paper, with Unity3d engine as the core, tourism system is expanded the development, combined with the tourism information overlay function of Ctrip Travel, the attractions sharing function of Baidu Map, and the community function of Footprint. The purpose involves design, development and optimizing debug of techniques, such as network communication, UI interaction, cross-platform calls, database access and etc. The main goal of this paper is to provide internal visit narrative community service in limited and fixed scenic area and turning the corresponding service object by mass of visitors to the visitors of scenic spot, and to make the function of App specific, simple and explicit.

Community Detection in Disease-Gene Network Based on Principal Component Analysis

The identification of communities is imperative in the understanding of network structures and functions.Using community detection algorithms in biological networks, the community structure of biological networks can be determined, which is helpful in analyzing the topological structures and predicting the behaviors of biological networks. In this paper, we analyze the diseasome network using a new method called disease-gene network detecting algorithm based on principal component analysis, which can be used to investigate the connection between nodes within the same group. Experimental results on real-world networks have demonstrated that our algorithm is more efficient in detecting community structures when compared with other well-known results.

Fast Community Detection Based on Distance Dynamics

The distance dynamics model is excellent tool for uncovering the community structure of a complex network. However, one issue that must be addressed by this model is its very long computation time in large-scale networks. To identify the community structure of a large-scale network with high speed and high quality, in this paper, we propose a fast community detection algorithm, the F-Attractor, which is based on the distance dynamics model. The main contributions of the F-Attractor are as follows. First, we propose the use of two prejudgment rules from two different perspectives： node and edge. Based on these two rules, we develop a strategy of internal edge prejudgment for predicting the internal edges of the network. Internal edge prejudgment can reduce the number of edges and their neighbors that participate in the distance dynamics model. Second, we introduce a triangle distance to further enhance the speed of the interaction process in the distance dynamics model. This triangle distance uses two known distances to measure a third distance without any extra computation. We combine the above techniques to improve the distance dynamics model and then describe the community detection process of the F-Attractor. The results of an extensive series of experiments demonstrate that the F-Attractor offers high-speed community detection and high partition quality.

Comparative Effects of Avoidance and Immunization on Epidemic Spreading in a Dynamic Small-World Network with Community Structure

Considering the actual behavior of people’s short-term travel,we propose a dynamic small-world community network model with tunable community strength which has constant local links and time varying long-range jumps.Then an epidemic model of susceptible-infected-recovered is established based on the mean-field method to evaluate the inhibitory effects of avoidance and immunization on epidemic spreading.And an approximate formula for the epidemic threshold is obtained by mathematical analysis.The simulation results show that the epidemic threshold decreases with the increase of inner-community motivation rate and inter-community long-range motivation rate,while it increases with the increase of immunization rate or avoidance rate.It indicates that the inhibitory effect on epidemic spreading of immunization works better than that of avoidance.

Congestion warning method based on the Internet of vehicles and community discovery of complex networks

The traffic congestion occurs frequently in urban areas, while most existing solutions only take effects after congesting. In this paper, a congestion warning method is proposed based on the Internet of vehicles（IOV） and community discovery of complex networks. The communities in complex network model of traffic flow reflect the local aggregation of vehicles in the traffic system, and it is used to predict the upcoming congestion. The real-time information of vehicles on the roads is obtained from the IOV, which includes the locations, speeds and orientations of vehicles. Then the vehicles are mapped into nodes of network, the links between nodes are determined by the correlations between vehicles in terms of location and speed. The complex network model of traffic flow is hereby established. The communities in this complex network are discovered by fast Newman（FN） algorithm, and the congestion warnings are generated according to the communities selected by scale and density. This method can detect the tendency of traffic aggregation and provide warnings before congestion occurs. The simulations show that the method proposed in this paper is effective and practicable, and makes it possible to take action before traffic congestion.

A National Network of Community Service Has Taken Shape

Aiming at enhancing the reform of ur-ban social welfare services and meeting thedemands for pluralistic life services in citiesand towns,community service projects havesprung up in many of China’s large and me-