Reconstructing complex networks with binary-state dynamics

For Supplementary Information, see http://sss.bnu.edu.cn/~wenxuw/publications/SI_reconstruct_binary.pdf

Assessment of the EEE-4 oral test: a discourse analysis based on complex networks.

With the development of information technology, the theory and methodology of complex network has been introduced to the language research, which transforms the system of language in a complex networks composed of nodes and edges for the quantitative analysis about the language structure. The development of dependency grammar provides theoretical support for the construction of a treebank corpus, making possible a statistic analysis of complex networks. This paper introduces the theory and methodology of the complex network and builds dependency syntactic networks based on the treebank of speeches from the EEE-4 oral test. According to the analysis of the overall characteristics of the networks, including the number of edges, the number of the nodes, the average degree, the average path length, the network centrality and the degree distribution, it aims to find in the networks potential difference and similarity between various grades of speaking performance. Through clustering analysis, this research intends to prove the network parameters’ discriminating feature and provide potential reference for scoring speaking performance.

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.

Breaking down complex saproxylic communities: understanding sub-networks structure and implications to network robustness

Saproxylic insect communities inhabiting tree hollow microhabitats correspond with large food webs which simultaneously are constituted by multiple types of plant-animal and animal-animal interactions, according to the use of trophic resources (wood- and insect-dependent sub-networks), or to trophic habits or interaction types (xylophagous, saprophagous, xylomycetophagous, predators and commensals). We quantitatively assessed which properties of specialised networks were present in a complex networks involving different interacting types such as saproxylic community, and how they can be organised in trophic food webs. The architecture, interacting patterns and food web composition were evaluated along sub-networks, analysing their implications to network robustness from random and directed extinction simulations. A structure of large and cohesive modules with weakly connected nodes was observed throughout saproxylic sub-networks, composing the main food webs constituting this community. Insect-dependent sub-networks were more modular than wood-dependent sub-networks. Wood-dependent sub-networks presented higher species degree, connectance, links, linkage density, interaction strength, and were less specialised and more aggregated than insect-dependent sub-networks. These attributes defined high network robustness in wood-dependent sub-networks. Finally, our results emphasise the relevance of modularity, differences among interacting types and interrelations among them in modelling the structure of saproxylic communities and in determining their stability.

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.

A new look at leadership in collaborative networks : process catalysts

Collaborative networks have come to form a large part of the public sector’s strategy to address ongoing and often complex social problems. The relational power of networks, with its emphasis on trust, reciprocity and mutuality provides the mechanism to integrate previously dispersed and even competitive entities into a collective venture(Agranoff 2003; Agranoff and McGuire 2003; Mandell 1994; Mandell and Harrington 1999). It is argued that the refocusing of a single body of effort to a collective contributes to reducing duplication and overlap of services, maximizes increasingly scarce resources and contributes to solving intractable or 'wicked’problems (Clarke and Stewart 1997). Given the current proliferation of collaborative networks and the fact that they are likely to continue for some time, concerns with the management and leadership of such arrangements for optimal outcomes are increasingly relevant. This is especially important for public sector managers who are used to working in a top-down, hierarchical manner. While the management of networks (Agranoff and McGuire 2001, 2003), including collaborative or complex networks (Kickert et al. 1997; Koppenjan and Klijn 2004), has been the subject of considerable attention, there has been much less explicit discussion on leadership approaches in this context. It is argued in this chapter that the traditional use of the terms ‘leader’ or ‘leadership’ does not apply to collaborative networks. There are no ‘followers’ in collaborative networks or supervisor-subordinate relations. Instead there are equal, horizontal relationships that are focused on delivering systems change. In this way the emergent organizational forms such as collaborative networks challenge older models of leadership. However despite the questionable relevance of old leadership styles to the contemporary work environment, no clear alternative has come along to take its place.

Using complex network metrics to predict the persistence of metapopulations with asymmetric connectivity patterns

Almost all metapopulation modelling assumes that connectivity between patches is only a function of distance, and is therefore symmetric. However, connectivity will not depend only on the distance between the patches, as some paths are easy to traverse, while others are difficult. When colonising organisms interact with the heterogeneous landscape between patches, connectivity patterns will invariably be asymmetric. There have been few attempts to theoretically assess the effects of asymmetric connectivity patterns on the dynamics of metapopulations. In this paper, we use the framework of complex networks to investigate whether metapopulation dynamics can be determined by directly analysing the asymmetric connectivity patterns that link the patches. Our analyses focus on “patch occupancy” metapopulation models, which only consider whether a patch is occupied or not. We propose three easily calculated network metrics: the “asymmetry” and “average path strength” of the connectivity pattern, and the “centrality” of each patch. Together, these metrics can be used to predict the length of time a metapopulation is expected to persist, and the relative contribution of each patch to a metapopulation’s viability. Our results clearly demonstrate the negative effect that asymmetry has on metapopulation persistence. Complex network analyses represent a useful new tool for understanding the dynamics of species existing in fragmented landscapes, particularly those existing in large metapopulations.

Community structure in real-world networks from a non-parametrical synchronization-based dynamical approach

[EN]This work analyzes the problem of community structure in real-world networks based on the synchronization of nonidentical coupled chaotic Rössler oscillators each one characterized by a defined natural frequency, and coupled according to a predefined network topology. The interaction scheme contemplates an uniformly increasing coupling force to simulate a society in which the association between the agents grows in time. To enhance the stability of the correlated states that could emerge from the synchronization process, we propose a parameterless mechanism that adapts the characteristic frequencies of coupled oscillators according to a dynamic connectivity matrix deduced from correlated data. We show that the characteristic frequency vector that results from the adaptation mechanism reveals the underlying community structure present in the network.

Analysis of Spanish text-thesaurus as a complex network

[EN]Based on the theoretical tools of Complex Networks, this work provides a basic descriptive study of a synonyms dictionary, the Spanish Open Thesaurus represented as a graph. We study the main structural measures of the network compared with those of a random graph. Numerical results show that Open-Thesaurus is a graph whose topological properties approximate a scale-free network, but seems not to present the small-world property because of its sparse structure. We also found that the words of highest betweenness centrality are terms that suggest the vocabulary of psychoanalysis: placer (pleasure), ayudante (in the sense of assistant or worker), and regular (to regulate).

Random propagation in complex systems : nonlinear matrix recursions and epidemic spread

This dissertation studies long-term behavior of random Riccati recursions and mathematical epidemic model. Riccati recursions are derived from Kalman filtering. The error covariance matrix of Kalman filtering satisfies Riccati recursions. Convergence condition of time-invariant Riccati recursions are well-studied by researchers. We focus on time-varying case, and assume that regressor matrix is random and identical and independently distributed according to given distribution whose probability distribution function is continuous, supported on whole space, and decaying faster than any polynomial. We study the geometric convergence of the probability distribution. We also study the global dynamics of the epidemic spread over complex networks for various models. For instance, in the discrete-time Markov chain model, each node is either healthy or infected at any given time. In this setting, the number of the state increases exponentially as the size of the network increases. The Markov chain has a unique stationary distribution where all the nodes are healthy with probability 1. Since the probability distribution of Markov chain defined on finite state converges to the stationary distribution, this Markov chain model concludes that epidemic disease dies out after long enough time. To analyze the Markov chain model, we study nonlinear epidemic model whose state at any given time is the vector obtained from the marginal probability of infection of each node in the network at that time. Convergence to the origin in the epidemic map implies the extinction of epidemics. The nonlinear model is upper-bounded by linearizing the model at the origin. As a result, the origin is the globally stable unique fixed point of the nonlinear model if the linear upper bound is stable. The nonlinear model has a second fixed point when the linear upper bound is unstable. We work on stability analysis of the second fixed point for both discrete-time and continuous-time models. Returning back to the Markov chain model, we claim that the stability of linear upper bound for nonlinear model is strongly related with the extinction time of the Markov chain. We show that stable linear upper bound is sufficient condition of fast extinction and the probability of survival is bounded by nonlinear epidemic map.

Prediction of Multi-Target Networks of Neuroprotective Compounds with Entropy Indices and Synthesis, Assay, and Theoretical Study of New Asymmetric 1,2-Rasagiline Carbamates

In a multi-target complex network, the links (L-ij) represent the interactions between the drug (d(i)) and the target (t(j)), characterized by different experimental measures (K-i, K-m, IC50, etc.) obtained in pharmacological assays under diverse boundary conditions (c(j)). In this work, we handle Shannon entropy measures for developing a model encompassing a multi-target network of neuroprotective/neurotoxic compounds reported in the CHEMBL database. The model predicts correctly >8300 experimental outcomes with Accuracy, Specificity, and Sensitivity above 80%-90% on training and external validation series. Indeed, the model can calculate different outcomes for >30 experimental measures in >400 different experimental protocolsin relation with >150 molecular and cellular targets on 11 different organisms (including human). Hereafter, we reported by the first time the synthesis, characterization, and experimental assays of a new series of chiral 1,2-rasagiline carbamate derivatives not reported in previous works. The experimental tests included: (1) assay in absence of neurotoxic agents; (2) in the presence of glutamate; and (3) in the presence of H2O2. Lastly, we used the new Assessing Links with Moving Averages (ALMA)-entropy model to predict possible outcomes for the new compounds in a high number of pharmacological tests not carried out experimentally.

Enhancing robustness and immunization in geographical networks

We find that different geographical structures of networks lead to varied percolation thresholds, although these networks may have similar abstract topological structures. Thus, strategies for enhancing robustness and immunization of a geographical network are proposed. Using the generating function formalism, we obtain an explicit form of the percolation threshold q(c) for networks containing arbitrary order cycles. For three-cycles, the dependence of q(c) on the clustering coefficients is ascertained. The analysis substantiates the validity of the strategies with analytical evidence.

Efficiency Dynamics on Two Coupled Small-World Networks

We investigate the effect of clusters in complex networks on efficiency dynamics by studying a simple efficiency model in two coupled small-world networks. It is shown that the critical network randomness corresponding to transition from a stagnant phase to a growing one decreases to zero as the connection strength of clusters increases. It is also shown for fixed randomness that the state of clusters transits from a stagnant phase to a growing one as the connection strength of clusters increases. This work can be useful for understanding the critical transition appearing in many dynamic processes on the cluster networks.

EFFICIENCY DYNAMICS ON SCALE-FREE NETWORKS WITH COMMUNITIES

The simple efficiency model is developed on scale-free networks with communities to study the effect of the communities in complex networks on efficiency dynamics. For some parameters, we found that the state of system will transit from a stagnant phase to a growing phase as the strength of community decreases.