WorldWideScience

Sample records for weighted scale-free networks

  1. Weighted Scale-Free Network Properties of Ecological Network

    International Nuclear Information System (INIS)

    Lee, Jae Woo; Maeng, Seong Eun

    2013-01-01

    We investigate the scale-free network properties of the bipartite ecological network, in particular, the plant-pollinator network. In plant-pollinator network, the pollinators visit the plant to get the nectars. In contrast to the other complex network, the plant-pollinator network has not only the trophic relationships among the interacting partners but also the complexities of the coevolutionary effects. The interactions between the plant and pollinators are beneficial relations. The plant-pollinator network is a bipartite and weighted network. The networks have two types of the nodes: plant and pollinator. We consider the visiting frequency of a pollinator to a plant as the weighting value of the link. We defined the strength of a node as the sum of the weighting value of the links. We reported the cumulative distribution function (CDF) of the degree and the strength of the plant-pollinator network. The CDF of the plants followed stretched exponential functions for both degree and strength, but the CDF of the pollinators showed the power law for both degree and strength. The average strength of the links showed the nonlinear dependence on the degree of the networks.

  2. Epidemic spreading on adaptively weighted scale-free networks.

    Science.gov (United States)

    Sun, Mengfeng; Zhang, Haifeng; Kang, Huiyan; Zhu, Guanghu; Fu, Xinchu

    2017-04-01

    We introduce three modified SIS models on scale-free networks that take into account variable population size, nonlinear infectivity, adaptive weights, behavior inertia and time delay, so as to better characterize the actual spread of epidemics. We develop new mathematical methods and techniques to study the dynamics of the models, including the basic reproduction number, and the global asymptotic stability of the disease-free and endemic equilibria. We show the disease-free equilibrium cannot undergo a Hopf bifurcation. We further analyze the effects of local information of diseases and various immunization schemes on epidemic dynamics. We also perform some stochastic network simulations which yield quantitative agreement with the deterministic mean-field approach.

  3. Epidemic spreading in weighted scale-free networks with community structure

    International Nuclear Information System (INIS)

    Chu, Xiangwei; Guan, Jihong; Zhang, Zhongzhi; Zhou, Shuigeng

    2009-01-01

    Many empirical studies reveal that the weights and community structure are ubiquitous in various natural and artificial networks. In this paper, based on the SI disease model, we investigate the epidemic spreading in weighted scale-free networks with community structure. Two exponents, α and β, are introduced to weight the internal edges and external edges, respectively; and a tunable probability parameter q is also introduced to adjust the strength of community structure. We find the external weighting exponent β plays a much more important role in slackening the epidemic spreading and reducing the danger brought by the epidemic than the internal weighting exponent α. Moreover, a novel result we find is that the strong community structure is no longer helpful for slackening the danger brought by the epidemic in the weighted cases. In addition, we show the hierarchical dynamics of the epidemic spreading in the weighted scale-free networks with communities which is also displayed in the famous BA scale-free networks

  4. Bursting synchronization in scale-free networks

    International Nuclear Information System (INIS)

    Batista, C.A.S.; Batista, A.M.; Pontes, J.C.A. de; Lopes, S.R.; Viana, R.L.

    2009-01-01

    Neuronal networks in some areas of the brain cortex present the scale-free property, i.e., the neuron connectivity is distributed according to a power-law, such that neurons are more likely to couple with other already well-connected ones. Neuron activity presents two timescales, a fast one related to action-potential spiking, and a slow timescale in which bursting takes place. Some pathological conditions are related with the synchronization of the bursting activity in a weak sense, meaning the adjustment of the bursting phase due to coupling. Hence it has been proposed that an externally applied time-periodic signal be applied in order to control undesirable synchronized bursting rhythms. We investigated this kind of intervention using a two-dimensional map to describe neurons with spiking-bursting activity in a scale-free network.

  5. The prisoner's dilemma in structured scale-free networks

    International Nuclear Information System (INIS)

    Li Xing; Wu Yonghui; Zhang Zhongzhi; Zhou Shuigeng; Rong Zhihai

    2009-01-01

    The conventional wisdom is that scale-free networks are prone to cooperation spreading. In this paper we investigate the cooperative behavior on the structured scale-free network. In contrast to the conventional wisdom that scale-free networks are prone to cooperation spreading, the evolution of cooperation is inhibited on the structured scale-free network when the prisoner's dilemma (PD) game is modeled. First, we demonstrate that neither the scale-free property nor the high clustering coefficient is responsible for the inhibition of cooperation spreading on the structured scale-free network. Then we provide one heuristic method to argue that the lack of age correlations and its associated 'large-world' behavior in the structured scale-free network inhibit the spread of cooperation. These findings may help enlighten further studies on the evolutionary dynamics of the PD game in scale-free networks

  6. Gradient networks on uncorrelated random scale-free networks

    International Nuclear Information System (INIS)

    Pan Guijun; Yan Xiaoqing; Huang Zhongbing; Ma Weichuan

    2011-01-01

    Uncorrelated random scale-free (URSF) networks are useful null models for checking the effects of scale-free topology on network-based dynamical processes. Here, we present a comparative study of the jamming level of gradient networks based on URSF networks and Erdos-Renyi (ER) random networks. We find that the URSF networks are less congested than ER random networks for the average degree (k)>k c (k c ∼ 2 denotes a critical connectivity). In addition, by investigating the topological properties of the two kinds of gradient networks, we discuss the relations between the topological structure and the transport efficiency of the gradient networks. These findings show that the uncorrelated scale-free structure might allow more efficient transport than the random structure.

  7. Emergence of Scale-Free Syntax Networks

    Science.gov (United States)

    Corominas-Murtra, Bernat; Valverde, Sergi; Solé, Ricard V.

    The evolution of human language allowed the efficient propagation of nongenetic information, thus creating a new form of evolutionary change. Language development in children offers the opportunity of exploring the emergence of such complex communication system and provides a window to understanding the transition from protolanguage to language. Here we present the first analysis of the emergence of syntax in terms of complex networks. A previously unreported, sharp transition is shown to occur around two years of age from a (pre-syntactic) tree-like structure to a scale-free, small world syntax network. The observed combinatorial patterns provide valuable data to understand the nature of the cognitive processes involved in the acquisition of syntax, introducing a new ingredient to understand the possible biological endowment of human beings which results in the emergence of complex language. We explore this problem by using a minimal, data-driven model that is able to capture several statistical traits, but some key features related to the emergence of syntactic complexity display important divergences.

  8. Effects of degree correlation on scale-free gradient networks

    International Nuclear Information System (INIS)

    Pan Guijun; Yan Xiaoqing; Ma Weichuan; Luo Yihui; Huang Zhongbing

    2010-01-01

    We have studied the effects of degree correlation on congestion pressure in scale-free gradient networks. It is observed that the jamming coefficient J is insensitive to the degree correlation coefficient r for assortative and strongly disassortative scale-free networks, and J markedly decreases with an increase in r for weakly disassortative scale-free networks. We have also investigated the effects of degree correlation on the topology structure of scale-free gradient networks, and discussed the relation between the topology structure properties and transport efficiency of gradient networks.

  9. Adaptive local routing strategy on a scale-free network

    International Nuclear Information System (INIS)

    Feng, Liu; Han, Zhao; Ming, Li; Yan-Bo, Zhu; Feng-Yuan, Ren

    2010-01-01

    Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies. (general)

  10. Chaotic Modes in Scale Free Opinion Networks

    Science.gov (United States)

    Kusmartsev, Feo V.; Kürten, Karl E.

    2010-12-01

    In this paper, we investigate processes associated with formation of public opinion in varies directed random, scale free and small-world social networks. The important factor of the opinion formation is the existence of contrarians which were discovered by Granovetter in various social psychology experiments1,2,3 long ago and later introduced in sociophysics by Galam.4 When the density of contrarians increases the system behavior drastically changes at some critical value. At high density of contrarians the system can never arrive to a consensus state and periodically oscillates with different periods depending on specific structure of the network. At small density of the contrarians the behavior is manifold. It depends primary on the initial state of the system. If initially the majority of the population agrees with each other a state of stable majority may be easily reached. However when originally the population is divided in nearly equal parts consensus can never be reached. We model the emergence of collective decision making by considering N interacting agents, whose opinions are described by two state Ising spin variable associated with YES and NO. We show that the dynamical behaviors are very sensitive not only to the density of the contrarians but also to the network topology. We find that a phase of social chaos may arise in various dynamical processes of opinion formation in many realistic models. We compare the prediction of the theory with data describing the dynamics of the average opinion of the USA population collected on a day-by-day basis by varies media sources during the last six month before the final Obama-McCain election. The qualitative ouctome is in reasonable agreement with the prediction of our theory. In fact, the analyses of these data made within the paradigm of our theory indicates that even in this campaign there were chaotic elements where the public opinion migrated in an unpredictable chaotic way. The existence of such a phase

  11. Search in spatial scale-free networks

    International Nuclear Information System (INIS)

    Thadakamalla, H P; Albert, R; Kumara, S R T

    2007-01-01

    We study the decentralized search problem in a family of parameterized spatial network models that are heterogeneous in node degree. We investigate several algorithms and illustrate that some of these algorithms exploit the heterogeneity in the network to find short paths by using only local information. In addition, we demonstrate that the spatial network model belongs to a classof searchable networks for a wide range of parameter space. Further, we test these algorithms on the US airline network which belongs to this class of networks and demonstrate that searchability is a generic property of the US airline network. These results provide insights on designing the structure of distributed networks that need effective decentralized search algorithms

  12. Fractal scale-free networks resistant to disease spread

    International Nuclear Information System (INIS)

    Zhang, Zhongzhi; Zhou, Shuigeng; Zou, Tao; Chen, Guisheng

    2008-01-01

    The conventional wisdom is that scale-free networks are prone to epidemic propagation; in the paper we demonstrate that, on the contrary, disease spreading is inhibited in fractal scale-free networks. We first propose a novel network model and show that it simultaneously has the following rich topological properties: scale-free degree distribution, tunable clustering coefficient, 'large-world' behavior, and fractal scaling. Existing network models do not display these characteristics. Then, we investigate the susceptible–infected–removed (SIR) model of the propagation of diseases in our fractal scale-free networks by mapping it to the bond percolation process. We establish the existence of non-zero tunable epidemic thresholds by making use of the renormalization group technique, which implies that power law degree distribution does not suffice to characterize the epidemic dynamics on top of scale-free networks. We argue that the epidemic dynamics are determined by the topological properties, especially the fractality and its accompanying 'large-world' behavior

  13. Emergence of cooperation in non-scale-free networks

    International Nuclear Information System (INIS)

    Zhang, Yichao; Aziz-Alaoui, M A; Bertelle, Cyrille; Zhou, Shi; Wang, Wenting

    2014-01-01

    Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. Previous studies proposed a strategy updating mechanism, which successfully demonstrated that the scale-free network can provide a framework for the emergence of cooperation. Instead, individuals in random graphs and small-world networks do not favor cooperation under this updating rule. However, a recent empirical result shows the heterogeneous networks do not promote cooperation when humans play a prisoner’s dilemma. In this paper, we propose a strategy updating rule with payoff memory. We observe that the random graphs and small-world networks can provide even better frameworks for cooperation than the scale-free networks in this scenario. Our observations suggest that the degree heterogeneity may be neither a sufficient condition nor a necessary condition for the widespread cooperation in complex networks. Also, the topological structures are not sufficed to determine the level of cooperation in complex networks. (paper)

  14. Quantifying the connectivity of scale-free and biological networks

    Energy Technology Data Exchange (ETDEWEB)

    Shiner, J.S. E-mail: shiner@alumni.duke.edu; Davison, Matt E-mail: mdavison@uwo.ca

    2004-07-01

    Scale-free and biological networks follow a power law distribution p{sub k}{proportional_to}k{sup -{alpha}} for the probability that a node is connected to k other nodes; the corresponding ranges for {alpha} (biological: 1<{alpha}<2; scale-free: 2<{alpha}{<=}3) yield a diverging variance for the connectivity k and lack of predictability for the average connectivity. Predictability can be achieved with the Renyi, Tsallis and Landsberg-Vedral extended entropies and corresponding 'disorders' for correctly chosen values of the entropy index q. Escort distributions p{sub k}{proportional_to}k{sup -{alpha}}{sup q} with q>3/{alpha} also yield a nondiverging variance and predictability. It is argued that the Tsallis entropies may be the appropriate quantities for the study of scale-free and biological networks.

  15. Optimal defense resource allocation in scale-free networks

    Science.gov (United States)

    Zhang, Xuejun; Xu, Guoqiang; Xia, Yongxiang

    2018-02-01

    The robustness research of networked systems has drawn widespread attention in the past decade, and one of the central topics is to protect the network from external attacks through allocating appropriate defense resource to different nodes. In this paper, we apply a specific particle swarm optimization (PSO) algorithm to optimize the defense resource allocation in scale-free networks. Results reveal that PSO based resource allocation shows a higher robustness than other resource allocation strategies such as uniform, degree-proportional, and betweenness-proportional allocation strategies. Furthermore, we find that assigning less resource to middle-degree nodes under small-scale attack while more resource to low-degree nodes under large-scale attack is conductive to improving the network robustness. Our work provides an insight into the optimal defense resource allocation pattern in scale-free networks and is helpful for designing a more robust network.

  16. Power Laws, Scale-Free Networks and Genome Biology

    CERN Document Server

    Koonin, Eugene V; Karev, Georgy P

    2006-01-01

    Power Laws, Scale-free Networks and Genome Biology deals with crucial aspects of the theoretical foundations of systems biology, namely power law distributions and scale-free networks which have emerged as the hallmarks of biological organization in the post-genomic era. The chapters in the book not only describe the interesting mathematical properties of biological networks but moves beyond phenomenology, toward models of evolution capable of explaining the emergence of these features. The collection of chapters, contributed by both physicists and biologists, strives to address the problems in this field in a rigorous but not excessively mathematical manner and to represent different viewpoints, which is crucial in this emerging discipline. Each chapter includes, in addition to technical descriptions of properties of biological networks and evolutionary models, a more general and accessible introduction to the respective problems. Most chapters emphasize the potential of theoretical systems biology for disco...

  17. Innovation diffusion equations on correlated scale-free networks

    Energy Technology Data Exchange (ETDEWEB)

    Bertotti, M.L., E-mail: marialetizia.bertotti@unibz.it [Free University of Bozen–Bolzano, Faculty of Science and Technology, Bolzano (Italy); Brunner, J., E-mail: johannes.brunner@tis.bz.it [TIS Innovation Park, Bolzano (Italy); Modanese, G., E-mail: giovanni.modanese@unibz.it [Free University of Bozen–Bolzano, Faculty of Science and Technology, Bolzano (Italy)

    2016-07-29

    Highlights: • The Bass diffusion model can be formulated on scale-free networks. • In the trickle-down version, the hubs adopt earlier and act as monitors. • We improve the equations in order to describe trickle-up diffusion. • Innovation is generated at the network periphery, and hubs can act as stiflers. • We compare diffusion times, in dependence on the scale-free exponent. - Abstract: We introduce a heterogeneous network structure into the Bass diffusion model, in order to study the diffusion times of innovation or information in networks with a scale-free structure, typical of regions where diffusion is sensitive to geographic and logistic influences (like for instance Alpine regions). We consider both the diffusion peak times of the total population and of the link classes. In the familiar trickle-down processes the adoption curve of the hubs is found to anticipate the total adoption in a predictable way. In a major departure from the standard model, we model a trickle-up process by introducing heterogeneous publicity coefficients (which can also be negative for the hubs, thus turning them into stiflers) and a stochastic term which represents the erratic generation of innovation at the periphery of the network. The results confirm the robustness of the Bass model and expand considerably its range of applicability.

  18. Innovation diffusion equations on correlated scale-free networks

    International Nuclear Information System (INIS)

    Bertotti, M.L.; Brunner, J.; Modanese, G.

    2016-01-01

    Highlights: • The Bass diffusion model can be formulated on scale-free networks. • In the trickle-down version, the hubs adopt earlier and act as monitors. • We improve the equations in order to describe trickle-up diffusion. • Innovation is generated at the network periphery, and hubs can act as stiflers. • We compare diffusion times, in dependence on the scale-free exponent. - Abstract: We introduce a heterogeneous network structure into the Bass diffusion model, in order to study the diffusion times of innovation or information in networks with a scale-free structure, typical of regions where diffusion is sensitive to geographic and logistic influences (like for instance Alpine regions). We consider both the diffusion peak times of the total population and of the link classes. In the familiar trickle-down processes the adoption curve of the hubs is found to anticipate the total adoption in a predictable way. In a major departure from the standard model, we model a trickle-up process by introducing heterogeneous publicity coefficients (which can also be negative for the hubs, thus turning them into stiflers) and a stochastic term which represents the erratic generation of innovation at the periphery of the network. The results confirm the robustness of the Bass model and expand considerably its range of applicability.

  19. Cascading failure in the wireless sensor scale-free networks

    Science.gov (United States)

    Liu, Hao-Ran; Dong, Ming-Ru; Yin, Rong-Rong; Han, Li

    2015-05-01

    In the practical wireless sensor networks (WSNs), the cascading failure caused by a failure node has serious impact on the network performance. In this paper, we deeply research the cascading failure of scale-free topology in WSNs. Firstly, a cascading failure model for scale-free topology in WSNs is studied. Through analyzing the influence of the node load on cascading failure, the critical load triggering large-scale cascading failure is obtained. Then based on the critical load, a control method for cascading failure is presented. In addition, the simulation experiments are performed to validate the effectiveness of the control method. The results show that the control method can effectively prevent cascading failure. Project supported by the Natural Science Foundation of Hebei Province, China (Grant No. F2014203239), the Autonomous Research Fund of Young Teacher in Yanshan University (Grant No. 14LGB017) and Yanshan University Doctoral Foundation, China (Grant No. B867).

  20. Sandpile on scale-free networks with assortative mixing

    International Nuclear Information System (INIS)

    Yin Yanping; Zhang Duanming; Pan Guijun; He Minhua; Tan Jin

    2007-01-01

    We numerically investigate the Bak-Tang-Wiesenfeld sandpile model on scale-free networks with assortative mixing, where the threshold height of each node is equal to its degree. It is observed that a large fraction of multiple topplings are included in avalanches on assortative networks, which is absent on uncorrelated networks. We introduce a parameter F-bar(a) to characterize the fraction of multiple topplings in avalanches of area a. The fraction of multiple topplings increases dramatically with the degree of assortativity and has a peak for small a whose height also increase with the assortativity of the networks. Unlike the case on uncorrelated networks, the distributions of avalanche size, area and duration do not follow pure power law, but deviate more obviously from pure power law with the growing degree of assortativity. The results show that the assortative mixing has a strong influence on the behavior of avalanche dynamics on complex networks

  1. Network synchronization: optimal and pessimal scale-free topologies

    Energy Technology Data Exchange (ETDEWEB)

    Donetti, Luca [Departamento de Electronica y Tecnologia de Computadores and Instituto de Fisica Teorica y Computacional Carlos I, Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain); Hurtado, Pablo I; Munoz, Miguel A [Departamento de Electromagnetismo y Fisica de la Materia and Instituto Carlos I de Fisica Teorica y Computacional Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain)], E-mail: mamunoz@onsager.ugr.es

    2008-06-06

    By employing a recently introduced optimization algorithm we construct optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency toward disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting 'pessimal networks' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability.

  2. Network synchronization: optimal and pessimal scale-free topologies

    International Nuclear Information System (INIS)

    Donetti, Luca; Hurtado, Pablo I; Munoz, Miguel A

    2008-01-01

    By employing a recently introduced optimization algorithm we construct optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency toward disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting 'pessimal networks' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability

  3. Improved Efficient Routing Strategy on Scale-Free Networks

    Science.gov (United States)

    Jiang, Zhong-Yuan; Liang, Man-Gui

    Since the betweenness of nodes in complex networks can theoretically represent the traffic load of nodes under the currently used routing strategy, we propose an improved efficient (IE) routing strategy to enhance to the network traffic capacity based on the betweenness centrality. Any node with the highest betweenness is susceptible to traffic congestion. An efficient way to improve the network traffic capacity is to redistribute the heavy traffic load from these central nodes to non-central nodes, so in this paper, we firstly give a path cost function by considering the sum of node betweenness with a tunable parameter β along the actual path. Then, by minimizing the path cost, our IE routing strategy achieved obvious improvement on the network transport efficiency. Simulations on scale-free Barabási-Albert (BA) networks confirmed the effectiveness of our strategy, when compared with the efficient routing (ER) and the shortest path (SP) routing.

  4. Cooperative Dynamics in Lattice-Embedded Scale-Free Networks

    International Nuclear Information System (INIS)

    Shang Lihui; Zhang Mingji; Yang Yanqing

    2009-01-01

    We investigate cooperative behaviors of lattice-embedded scale-free networking agents in the prisoner's dilemma game model by employing two initial strategy distribution mechanisms, which are specific distribution to the most connected sites (hubs) and random distribution. Our study indicates that the game dynamics crucially depends on the underlying spatial network structure with different strategy distribution mechanism. The cooperators' specific distribution contributes to an enhanced level of cooperation in the system compared with random one, and cooperation is robust to cooperators' specific distribution but fragile to defectors' specific distribution. Especially, unlike the specific case, increasing heterogeneity of network does not always favor the emergence of cooperation under random mechanism. Furthermore, we study the geographical effects and find that the graphically constrained network structure tends to improve the evolution of cooperation in random case and in specific one for a large temptation to defect.

  5. Self-Organization in Coupled Map Scale-Free Networks

    International Nuclear Information System (INIS)

    Xiao-Ming, Liang; Zong-Hua, Liu; Hua-Ping, Lü

    2008-01-01

    We study the self-organization of phase synchronization in coupled map scale-free networks with chaotic logistic map at each node and find that a variety of ordered spatiotemporal patterns emerge spontaneously in a regime of coupling strength. These ordered behaviours will change with the increase of the average links and are robust to both the system size and parameter mismatch. A heuristic theory is given to explain the mechanism of self-organization and to figure out the regime of coupling for the ordered spatiotemporal patterns

  6. Opinion Spreading with Mobility on Scale-Free Networks

    International Nuclear Information System (INIS)

    Qiang, Guo; Xing-Wen, Chen; Jian-Guo, Liu; Bing-Hong, Wang; Tao, Zhou; Yu-Hua, Yao

    2008-01-01

    A continuum opinion dynamic model is presented based on two rules. The first one considers the mobilities of the individuals, the second one supposes that the individuals update their opinions independently. The results of the model indicate that the bounded confidence in c , separating consensus and incoherent states, of a scale-free network is much smaller than the one of a lattice. If the system can reach the consensus state, the sum of all individuals' opinion change O c (t) quickly decreases in an exponential form, while if it reaches the incoherent state finally O c (t) decreases slowly and has the punctuated equilibrium characteristic

  7. Intermittent exploration on a scale-free network

    International Nuclear Information System (INIS)

    Ramezanpour, A

    2007-02-01

    We study an intermittent random walk on a random network of scale-free degree distribution. The walk is a combination of simple random walks of duration t w and random long-range jumps. While the time the walker needs to cover all the nodes increases with t w , the corresponding time for the edges displays a non monotonic behavior with a minimum for some nontrivial value of t w . This is a heterogeneity-induced effect that is not observed in homogeneous small-world networks. The optimal t w increases with the degree of assortativity in the network. Depending on the nature of degree correlations and the elapsed time the walker finds an over/underestimate of the degree distribution exponent. (author)

  8. Complex networks with scale-free nature and hierarchical modularity

    Science.gov (United States)

    Shekatkar, Snehal M.; Ambika, G.

    2015-09-01

    Generative mechanisms which lead to empirically observed structure of networked systems from diverse fields like biology, technology and social sciences form a very important part of study of complex networks. The structure of many networked systems like biological cell, human society and World Wide Web markedly deviate from that of completely random networks indicating the presence of underlying processes. Often the main process involved in their evolution is the addition of links between existing nodes having a common neighbor. In this context we introduce an important property of the nodes, which we call mediating capacity, that is generic to many networks. This capacity decreases rapidly with increase in degree, making hubs weak mediators of the process. We show that this property of nodes provides an explanation for the simultaneous occurrence of the observed scale-free structure and hierarchical modularity in many networked systems. This also explains the high clustering and small-path length seen in real networks as well as non-zero degree-correlations. Our study also provides insight into the local process which ultimately leads to emergence of preferential attachment and hence is also important in understanding robustness and control of real networks as well as processes happening on real networks.

  9. Scale-free networks of earthquakes and aftershocks

    International Nuclear Information System (INIS)

    Baiesi, Marco; Paczuski, Maya

    2004-01-01

    We propose a metric to quantify correlations between earthquakes. The metric consists of a product involving the time interval and spatial distance between two events, as well as the magnitude of the first one. According to this metric, events typically are strongly correlated to only one or a few preceding ones. Thus a classification of events as foreshocks, main shocks, or aftershocks emerges automatically without imposing predetermined space-time windows. In the simplest network construction, each earthquake receives an incoming link from its most correlated predecessor. The number of aftershocks for any event, identified by its outgoing links, is found to be scale free with exponent γ=2.0(1). The original Omori law with p=1 emerges as a robust feature of seismicity, holding up to years even for aftershock sequences initiated by intermediate magnitude events. The broad distribution of distances between earthquakes and their linked aftershocks suggests that aftershock collection with fixed space windows is not appropriate

  10. Opinion formation on multiplex scale-free networks

    Science.gov (United States)

    Nguyen, Vu Xuan; Xiao, Gaoxi; Xu, Xin-Jian; Li, Guoqi; Wang, Zhen

    2018-01-01

    Most individuals, if not all, live in various social networks. The formation of opinion systems is an outcome of social interactions and information propagation occurring in such networks. We study the opinion formation with a new rule of pairwise interactions in the novel version of the well-known Deffuant model on multiplex networks composed of two layers, each of which is a scale-free network. It is found that in a duplex network composed of two identical layers, the presence of the multiplexity helps either diminish or enhance opinion diversity depending on the relative magnitudes of tolerance ranges characterizing the degree of openness/tolerance on both layers: there is a steady separation between different regions of tolerance range values on two network layers where multiplexity plays two different roles, respectively. Additionally, the two critical tolerance ranges follow a one-sum rule; that is, each of the layers reaches a complete consensus only if the sum of the tolerance ranges on the two layers is greater than a constant approximately equaling 1, the double of the critical bound on a corresponding isolated network. A further investigation of the coupling between constituent layers quantified by a link overlap parameter reveals that as the layers are loosely coupled, the two opinion systems co-evolve independently, but when the inter-layer coupling is sufficiently strong, a monotonic behavior is observed: an increase in the tolerance range of a layer causes a decline in the opinion diversity on the other layer regardless of the magnitudes of tolerance ranges associated with the layers in question.

  11. Scale free effects in world currency exchange network

    Science.gov (United States)

    Górski, A. Z.; Drożdż, S.; Kwapień, J.

    2008-11-01

    A large collection of daily time series for 60 world currencies' exchange rates is considered. The correlation matrices are calculated and the corresponding Minimal Spanning Tree (MST) graphs are constructed for each of those currencies used as reference for the remaining ones. It is shown that multiplicity of the MST graphs' nodes to a good approximation develops a power like, scale free distribution with the scaling exponent similar as for several other complex systems studied so far. Furthermore, quantitative arguments in favor of the hierarchical organization of the world currency exchange network are provided by relating the structure of the above MST graphs and their scaling exponents to those that are derived from an exactly solvable hierarchical network model. A special status of the USD during the period considered can be attributed to some departures of the MST features, when this currency (or some other tied to it) is used as reference, from characteristics typical to such a hierarchical clustering of nodes towards those that correspond to the random graphs. Even though in general the basic structure of the MST is robust with respect to changing the reference currency some trace of a systematic transition from somewhat dispersed - like the USD case - towards more compact MST topology can be observed when correlations increase.

  12. Weighted Distances in Scale-Free Configuration Models

    Science.gov (United States)

    Adriaans, Erwin; Komjáthy, Júlia

    2018-01-01

    In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent τ \\in (2,3) . We assign independent and identically distributed (i.i.d.) weights to the edges of the graph. We investigate the weighted distance (the length of the shortest weighted path) between two uniformly chosen vertices, called typical distances. When the underlying age-dependent branching process approximating the local neighborhoods of vertices is found to produce infinitely many individuals in finite time—called explosive branching process—Baroni, Hofstad and the second author showed in Baroni et al. (J Appl Probab 54(1):146-164, 2017) that typical distances converge in distribution to a bounded random variable. The order of magnitude of typical distances remained open for the τ \\in (2,3) case when the underlying branching process is not explosive. We close this gap by determining the first order of magnitude of typical distances in this regime for arbitrary, not necessary continuous edge-weight distributions that produce a non-explosive age-dependent branching process with infinite mean power-law offspring distributions. This sequence tends to infinity with the amount of vertices, and, by choosing an appropriate weight distribution, can be tuned to be any growing function that is O(log log n) , where n is the number of vertices in the graph. We show that the result remains valid for the the erased configuration model as well, where we delete loops and any second and further edges between two vertices.

  13. Self-organized Criticality in a Modified Evolution Model on Generalized Barabasi-Albert Scale-Free Networks

    International Nuclear Information System (INIS)

    Lin Min; Wang Gang; Chen Tianlun

    2007-01-01

    A modified evolution model of self-organized criticality on generalized Barabasi-Albert (GBA) scale-free networks is investigated. In our model, we find that spatial and temporal correlations exhibit critical behaviors. More importantly, these critical behaviors change with the parameter b, which weights the distance in comparison with the degree in the GBA network evolution.

  14. Cascading Dynamics of Heterogenous Scale-Free Networks with Recovery Mechanism

    Directory of Open Access Journals (Sweden)

    Shudong Li

    2013-01-01

    Full Text Available In network security, how to use efficient response methods against cascading failures of complex networks is very important. In this paper, concerned with the highest-load attack (HL and random attack (RA on one edge, we define five kinds of weighting strategies to assign the external resources for recovering the edges from cascading failures in heterogeneous scale-free (SF networks. The influence of external resources, the tolerance parameter, and the different weighting strategies on SF networks against cascading failures is investigated carefully. We find that, under HL attack, the fourth kind of weighting method can more effectively improve the integral robustness of SF networks, simultaneously control the spreading velocity, and control the outburst of cascading failures in SF networks than other methods. Moreover, the third method is optimal if we only knew the local structure of SF networks and the uniform assignment is the worst. The simulations of the real-world autonomous system in, Internet have also supported our findings. The results are useful for using efficient response strategy against the emergent accidents and controlling the cascading failures in the real-world networks.

  15. Self-Organized Criticality in a Simple Neuron Model Based on Scale-Free Networks

    International Nuclear Information System (INIS)

    Lin Min; Wang Gang; Chen Tianlun

    2006-01-01

    A simple model for a set of interacting idealized neurons in scale-free networks is introduced. The basic elements of the model are endowed with the main features of a neuron function. We find that our model displays power-law behavior of avalanche sizes and generates long-range temporal correlation. More importantly, we find different dynamical behavior for nodes with different connectivity in the scale-free networks.

  16. Convergence speed of consensus problems over undirected scale-free networks

    International Nuclear Information System (INIS)

    Sun Wei; Dou Li-Hua

    2010-01-01

    Scale-free networks and consensus behaviour among multiple agents have both attracted much attention. To investigate the consensus speed over scale-free networks is the major topic of the present work. A novel method is developed to construct scale-free networks due to their remarkable power-law degree distributions, while preserving the diversity of network topologies. The time cost or iterations for networks to reach a certain level of consensus is discussed, considering the influence from power-law parameters. They are both demonstrated to be reversed power-law functions of the algebraic connectivity, which is viewed as a measurement on convergence speed of the consensus behaviour. The attempts of tuning power-law parameters may speed up the consensus procedure, but it could also make the network less robust over time delay at the same time. Large scale of simulations are supportive to the conclusions. (general)

  17. Effect of trap position on the efficiency of trapping in treelike scale-free networks

    International Nuclear Information System (INIS)

    Zhang Zhongzhi; Lin Yuan; Ma Youjun

    2011-01-01

    The conventional wisdom is that the role and impact of nodes on dynamical processes in scale-free networks are not homogenous, because of the presence of highly connected nodes at the tail of their power-law degree distribution. In this paper, we explore the influence of different nodes as traps on the trapping efficiency of the trapping problem taking place on scale-free networks. To this end, we study in detail the trapping problem in two families of deterministically growing scale-free networks with treelike structure: one family is non-fractal, the other is fractal. In the first part of this work, we attack a special case of random walks on the two network families with a perfect trap located at a hub, i.e. node with the highest degree. The second study addresses the case with trap distributed uniformly over all nodes in the networks. For these two cases, we compute analytically the mean trapping time (MTT), a quantitative indicator characterizing the trapping efficiency of the trapping process. We show that in the non-fractal scale-free networks the MTT for both cases follows different scalings with the network order (number of network nodes), implying that trap's position has a significant effect on the trapping efficiency. In contrast, it is presented that for both cases in the fractal scale-free networks, the two leading scalings exhibit the same dependence on the network order, suggesting that the location of trap has no essential impact on the trapping efficiency. We also show that for both cases of the trapping problem, the trapping efficiency is more efficient in the non-fractal scale-free networks than in their fractal counterparts.

  18. Different behaviors of epidemic spreading in scale-free networks with identical degree sequence

    Energy Technology Data Exchange (ETDEWEB)

    Chu Xiangwei; Guan Jihong [School of Electronics and Information, Tongji University, 4800 Cao' an Road, Shanghai 201804 (China); Zhang Zhongzhi; Zhou Shuigeng [School of Computer Science, Fudan University, Shanghai 200433 (China); Li Mo, E-mail: zhangzz@fudan.edu.c, E-mail: jhguan@tongj.edu.c, E-mail: sgzhou@fudan.edu.c [Software School, Fudan University, Shanghai 200433 (China)

    2010-02-12

    Recently, the study of dynamical behaviors of the susceptible-infected (SI) disease model in complex networks, especially in Barabasi-Albert (BA) scale-free networks, has attracted much attention. Although some interesting phenomena have been observed, the formative reasons for those particular dynamical behaviors are still not well understood, despite the speculation that topological properties (for example the degree distribution) have a strong impact on epidemic spreading. In this paper, we study the evolution behaviors of epidemic spreading on a class of scale-free networks sharing identical degree sequence, and observe significantly different evolution behaviors in the whole family of networks. We show that the power-law degree distribution does not suffice to characterize the dynamical behaviors of disease diffusion on scale-free networks.

  19. Different behaviors of epidemic spreading in scale-free networks with identical degree sequence

    International Nuclear Information System (INIS)

    Chu Xiangwei; Guan Jihong; Zhang Zhongzhi; Zhou Shuigeng; Li Mo

    2010-01-01

    Recently, the study of dynamical behaviors of the susceptible-infected (SI) disease model in complex networks, especially in Barabasi-Albert (BA) scale-free networks, has attracted much attention. Although some interesting phenomena have been observed, the formative reasons for those particular dynamical behaviors are still not well understood, despite the speculation that topological properties (for example the degree distribution) have a strong impact on epidemic spreading. In this paper, we study the evolution behaviors of epidemic spreading on a class of scale-free networks sharing identical degree sequence, and observe significantly different evolution behaviors in the whole family of networks. We show that the power-law degree distribution does not suffice to characterize the dynamical behaviors of disease diffusion on scale-free networks.

  20. Parameters affecting the resilience of scale-free networks to random failures.

    Energy Technology Data Exchange (ETDEWEB)

    Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran (University of New Mexico, Albuquerque, NM); Saia, Jared (University of New Mexico, Albuquerque, NM)

    2005-09-01

    It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degree of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.

  1. Some scale-free networks could be robust under selective node attacks

    Science.gov (United States)

    Zheng, Bojin; Huang, Dan; Li, Deyi; Chen, Guisheng; Lan, Wenfei

    2011-04-01

    It is a mainstream idea that scale-free network would be fragile under the selective attacks. Internet is a typical scale-free network in the real world, but it never collapses under the selective attacks of computer viruses and hackers. This phenomenon is different from the deduction of the idea above because this idea assumes the same cost to delete an arbitrary node. Hence this paper discusses the behaviors of the scale-free network under the selective node attack with different cost. Through the experiments on five complex networks, we show that the scale-free network is possibly robust under the selective node attacks; furthermore, the more compact the network is, and the larger the average degree is, then the more robust the network is; with the same average degrees, the more compact the network is, the more robust the network is. This result would enrich the theory of the invulnerability of the network, and can be used to build robust social, technological and biological networks, and also has the potential to find the target of drugs.

  2. Scale-Free Networks and Commercial Air Carrier Transportation in the United States

    Science.gov (United States)

    Conway, Sheila R.

    2004-01-01

    Network science, or the art of describing system structure, may be useful for the analysis and control of large, complex systems. For example, networks exhibiting scale-free structure have been found to be particularly well suited to deal with environmental uncertainty and large demand growth. The National Airspace System may be, at least in part, a scalable network. In fact, the hub-and-spoke structure of the commercial segment of the NAS is an often-cited example of an existing scale-free network After reviewing the nature and attributes of scale-free networks, this assertion is put to the test: is commercial air carrier transportation in the United States well explained by this model? If so, are the positive attributes of these networks, e.g. those of efficiency, flexibility and robustness, fully realized, or could we effect substantial improvement? This paper first outlines attributes of various network types, then looks more closely at the common carrier air transportation network from perspectives of the traveler, the airlines, and Air Traffic Control (ATC). Network models are applied within each paradigm, including discussion of implied strengths and weaknesses of each model. Finally, known limitations of scalable networks are discussed. With an eye towards NAS operations, utilizing the strengths and avoiding the weaknesses of scale-free networks are addressed.

  3. THE BUILDUP OF A SCALE-FREE PHOTOSPHERIC MAGNETIC NETWORK

    Energy Technology Data Exchange (ETDEWEB)

    Thibault, K.; Charbonneau, P. [Departement de Physique, Universite de Montreal, 2900 Edouard-Montpetit, Montreal, Quebec H3C 3J7 (Canada); Crouch, A. D., E-mail: kim@astro.umontreal.ca-a, E-mail: paulchar@astro.umontreal.ca-b, E-mail: ash@cora.nwra.com-c [CORA/NWRA, 3380 Mitchell Lane, Boulder, CO 80301 (United States)

    2012-10-01

    We use a global Monte Carlo simulation of the formation of the solar photospheric magnetic network to investigate the origin of the scale invariance characterizing magnetic flux concentrations visible on high-resolution magnetograms. The simulations include spatially and temporally homogeneous injection of small-scale magnetic elements over the whole photosphere, as well as localized episodic injection associated with the emergence and decay of active regions. Network elements form in response to cumulative pairwise aggregation or cancellation of magnetic elements, undergoing a random walk on the sphere and advected on large spatial scales by differential rotation and a poleward meridional flow. The resulting size distribution of simulated network elements is in very good agreement with observational inferences. We find that the fractal index and size distribution of network elements are determined primarily by these post-emergence surface mechanisms, and carry little or no memory of the scales at which magnetic flux is injected in the simulation. Implications for models of dynamo action in the Sun are briefly discussed.

  4. THE BUILDUP OF A SCALE-FREE PHOTOSPHERIC MAGNETIC NETWORK

    International Nuclear Information System (INIS)

    Thibault, K.; Charbonneau, P.; Crouch, A. D.

    2012-01-01

    We use a global Monte Carlo simulation of the formation of the solar photospheric magnetic network to investigate the origin of the scale invariance characterizing magnetic flux concentrations visible on high-resolution magnetograms. The simulations include spatially and temporally homogeneous injection of small-scale magnetic elements over the whole photosphere, as well as localized episodic injection associated with the emergence and decay of active regions. Network elements form in response to cumulative pairwise aggregation or cancellation of magnetic elements, undergoing a random walk on the sphere and advected on large spatial scales by differential rotation and a poleward meridional flow. The resulting size distribution of simulated network elements is in very good agreement with observational inferences. We find that the fractal index and size distribution of network elements are determined primarily by these post-emergence surface mechanisms, and carry little or no memory of the scales at which magnetic flux is injected in the simulation. Implications for models of dynamo action in the Sun are briefly discussed.

  5. The Buildup of a Scale-free Photospheric Magnetic Network

    Science.gov (United States)

    Thibault, K.; Charbonneau, P.; Crouch, A. D.

    2012-10-01

    We use a global Monte Carlo simulation of the formation of the solar photospheric magnetic network to investigate the origin of the scale invariance characterizing magnetic flux concentrations visible on high-resolution magnetograms. The simulations include spatially and temporally homogeneous injection of small-scale magnetic elements over the whole photosphere, as well as localized episodic injection associated with the emergence and decay of active regions. Network elements form in response to cumulative pairwise aggregation or cancellation of magnetic elements, undergoing a random walk on the sphere and advected on large spatial scales by differential rotation and a poleward meridional flow. The resulting size distribution of simulated network elements is in very good agreement with observational inferences. We find that the fractal index and size distribution of network elements are determined primarily by these post-emergence surface mechanisms, and carry little or no memory of the scales at which magnetic flux is injected in the simulation. Implications for models of dynamo action in the Sun are briefly discussed.

  6. Discretized kinetic theory on scale-free networks

    Science.gov (United States)

    Bertotti, Maria Letizia; Modanese, Giovanni

    2016-10-01

    The network of interpersonal connections is one of the possible heterogeneous factors which affect the income distribution emerging from micro-to-macro economic models. In this paper we equip our model discussed in [1, 2] with a network structure. The model is based on a system of n differential equations of the kinetic discretized-Boltzmann kind. The network structure is incorporated in a probabilistic way, through the introduction of a link density P(α) and of correlation coefficients P(β|α), which give the conditioned probability that an individual with α links is connected to one with β links. We study the properties of the equations and give analytical results concerning the existence, normalization and positivity of the solutions. For a fixed network with P(α) = c/α q , we investigate numerically the dependence of the detailed and marginal equilibrium distributions on the initial conditions and on the exponent q. Our results are compatible with those obtained from the Bouchaud-Mezard model and from agent-based simulations, and provide additional information about the dependence of the individual income on the level of connectivity.

  7. Networks, complexity and internet regulation scale-free law

    OpenAIRE

    Guadamuz, Andres

    2013-01-01

    This book, then, starts with a general statement: that regulators should try, wherever possible, to use the physical methodological tools presently available in order to draft better legislation. While such an assertion may be applied to the law in general, this work will concentrate on the much narrower area of Internet regulation and the science of complex networks The Internet is the subject of this book not only because it is my main area of research, but also because –without...

  8. Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree

    Energy Technology Data Exchange (ETDEWEB)

    Chełminiak, Przemysław, E-mail: geronimo@amu.edu.pl

    2013-11-29

    An unexpected recognition of fractal topology in some real-world scale-free networks has evoked again an interest in the mechanisms stimulating their evolution. To explain this phenomenon a few models of a deterministic construction as well as a probabilistic growth controlled by a tunable parameter have been proposed so far. A quite different approach based on the fully stochastic evolution of the fractal scale-free networks presented in this Letter counterpoises these former ideas. It is argued that the diffusive evolution of the network on the Cayley tree shapes its fractality, self-similarity and the branching number criticality without any control parameter. The last attribute of the scale-free network is an intrinsic property of the skeleton, a special type of spanning tree which determines its fractality.

  9. Generating clustered scale-free networks using Poisson based localization of edges

    Science.gov (United States)

    Türker, İlker

    2018-05-01

    We introduce a variety of network models using a Poisson-based edge localization strategy, which result in clustered scale-free topologies. We first verify the success of our localization strategy by realizing a variant of the well-known Watts-Strogatz model with an inverse approach, implying a small-world regime of rewiring from a random network through a regular one. We then apply the rewiring strategy to a pure Barabasi-Albert model and successfully achieve a small-world regime, with a limited capacity of scale-free property. To imitate the high clustering property of scale-free networks with higher accuracy, we adapted the Poisson-based wiring strategy to a growing network with the ingredients of both preferential attachment and local connectivity. To achieve the collocation of these properties, we used a routine of flattening the edges array, sorting it, and applying a mixing procedure to assemble both global connections with preferential attachment and local clusters. As a result, we achieved clustered scale-free networks with a computational fashion, diverging from the recent studies by following a simple but efficient approach.

  10. Emergence of super cooperation of prisoner's dilemma games on scale-free networks.

    Directory of Open Access Journals (Sweden)

    Angsheng Li

    Full Text Available Recently, the authors proposed a quantum prisoner's dilemma game based on the spatial game of Nowak and May, and showed that the game can be played classically. By using this idea, we proposed three generalized prisoner's dilemma (GPD, for short games based on the weak Prisoner's dilemma game, the full prisoner's dilemma game and the normalized Prisoner's dilemma game, written by GPDW, GPDF and GPDN respectively. Our games consist of two players, each of which has three strategies: cooperator (C, defector (D and super cooperator (denoted by Q, and have a parameter γ to measure the entangled relationship between the two players. We found that our generalised prisoner's dilemma games have new Nash equilibrium principles, that entanglement is the principle of emergence and convergence (i.e., guaranteed emergence of super cooperation in evolutions of our generalised prisoner's dilemma games on scale-free networks, that entanglement provides a threshold for a phase transition of super cooperation in evolutions of our generalised prisoner's dilemma games on scale-free networks, that the role of heterogeneity of the scale-free networks in cooperations and super cooperations is very limited, and that well-defined structures of scale-free networks allow coexistence of cooperators and super cooperators in the evolutions of the weak version of our generalised prisoner's dilemma games.

  11. The Mathematics of Networks Science: Scale-Free, Power-Law Graphs and Continuum Theoretical Analysis

    Science.gov (United States)

    Padula, Janice

    2012-01-01

    When hoping to initiate or sustain students' interest in mathematics teachers should always consider relevance, relevance to students' lives and in the middle and later years of instruction in high school and university, accessibility. A topic such as the mathematics behind networks science, more specifically scale-free graphs, is up-to-date,…

  12. Small-World and Scale-Free Network Models for IoT Systems

    Directory of Open Access Journals (Sweden)

    Insoo Sohn

    2017-01-01

    Full Text Available It is expected that Internet of Things (IoT revolution will enable new solutions and business for consumers and entrepreneurs by connecting billions of physical world devices with varying capabilities. However, for successful realization of IoT, challenges such as heterogeneous connectivity, ubiquitous coverage, reduced network and device complexity, enhanced power savings, and enhanced resource management have to be solved. All these challenges are heavily impacted by the IoT network topology supported by massive number of connected devices. Small-world networks and scale-free networks are important complex network models with massive number of nodes and have been actively used to study the network topology of brain networks, social networks, and wireless networks. These models, also, have been applied to IoT networks to enhance synchronization, error tolerance, and more. However, due to interdisciplinary nature of the network science, with heavy emphasis on graph theory, it is not easy to study the various tools provided by complex network models. Therefore, in this paper, we attempt to introduce basic concepts of graph theory, including small-world networks and scale-free networks, and provide system models that can be easily implemented to be used as a powerful tool in solving various research problems related to IoT.

  13. Node-node correlations and transport properties in scale-free networks

    Science.gov (United States)

    Obregon, Bibiana; Guzman, Lev

    2011-03-01

    We study some transport properties of complex networks. We focus our attention on transport properties of scale-free and small-world networks and compare two types of transport: Electric and max-flow cases. In particular, we construct scale-free networks, with a given degree sequence, to estimate the distribution of conductances for different values of assortative/dissortative mixing. For the electric case we find that the distributions of conductances are affect ed by the assortative mixing of the network whereas for the max-flow case, the distributions almost do not show changes when node-node correlations are altered. Finally, we compare local and global transport in terms of the average conductance for the small-world (Watts-Strogatz) model

  14. Multiple synchronization transitions in scale-free neuronal networks with electrical and chemical hybrid synapses

    International Nuclear Information System (INIS)

    Liu, Chen; Wang, Jiang; Wang, Lin; Yu, Haitao; Deng, Bin; Wei, Xile; Tsang, Kaiming; Chan, Wailok

    2014-01-01

    Highlights: • Synchronization transitions in hybrid scale-free neuronal networks are investigated. • Multiple synchronization transitions can be induced by the time delay. • Effect of synchronization transitions depends on the ratio of the electrical and chemical synapses. • Coupling strength and the density of inter-neuronal links can enhance the synchronization. -- Abstract: The impacts of information transmission delay on the synchronization transitions in scale-free neuronal networks with electrical and chemical hybrid synapses are investigated. Numerical results show that multiple appearances of synchronization regions transitions can be induced by different information transmission delays. With the time delay increasing, the synchronization of neuronal activities can be enhanced or destroyed, irrespective of the probability of chemical synapses in the whole hybrid neuronal network. In particular, for larger probability of electrical synapses, the regions of synchronous activities appear broader with stronger synchronization ability of electrical synapses compared with chemical ones. Moreover, it can be found that increasing the coupling strength can promote synchronization monotonously, playing the similar role of the increasing the probability of the electrical synapses. Interestingly, the structures and parameters of the scale-free neuronal networks, especially the structural evolvement plays a more subtle role in the synchronization transitions. In the network formation process, it is found that every new vertex is attached to the more old vertices already present in the network, the more synchronous activities will be emerge

  15. Biased trapping issue on weighted hierarchical networks

    Indian Academy of Sciences (India)

    archical networks which are based on the classic scale-free hierarchical networks. ... Weighted hierarchical networks; weight-dependent walks; mean first passage ..... The weighted networks can mimic some real-world natural and social systems to ... the Priority Academic Program Development of Jiangsu Higher Education ...

  16. Mobile user forecast and power-law acceleration invariance of scale-free networks

    International Nuclear Information System (INIS)

    Guo Jin-Li; Guo Zhao-Hua; Liu Xue-Jiao

    2011-01-01

    This paper studies and predicts the number growth of China's mobile users by using the power-law regression. We find that the number growth of the mobile users follows a power law. Motivated by the data on the evolution of the mobile users, we consider scenarios of self-organization of accelerating growth networks into scale-free structures and propose a directed network model, in which the nodes grow following a power-law acceleration. The expressions for the transient and the stationary average degree distributions are obtained by using the Poisson process. This result shows that the model generates appropriate power-law connectivity distributions. Therefore, we find a power-law acceleration invariance of the scale-free networks. The numerical simulations of the models agree with the analytical results well. (interdisciplinary physics and related areas of science and technology)

  17. Evaluating the transport in small-world and scale-free networks

    International Nuclear Information System (INIS)

    Juárez-López, R.; Obregón-Quintana, B.; Hernández-Pérez, R.; Reyes-Ramírez, I.; Guzmán-Vargas, L.

    2014-01-01

    We present a study of some properties of transport in small-world and scale-free networks. Particularly, we compare two types of transport: subject to friction (electrical case) and in the absence of friction (maximum flow). We found that in clustered networks based on the Watts–Strogatz (WS) model, for both transport types the small-world configurations exhibit the best trade-off between local and global levels. For non-clustered WS networks the local transport is independent of the rewiring parameter, while the transport improves globally. Moreover, we analyzed both transport types in scale-free networks considering tendencies in the assortative or disassortative mixing of nodes. We construct the distribution of the conductance G and flow F to evaluate the effects of the assortative (disassortative) mixing, finding that for scale-free networks, as we introduce different levels of the degree–degree correlations, the power-law decay in the conductances is altered, while for the flow, the power-law tail remains unchanged. In addition, we analyze the effect on the conductance and the flow of the minimum degree and the shortest path between the source and destination nodes, finding notable differences between these two types of transport

  18. Sparse cliques trump scale-free networks in coordination and competition

    Science.gov (United States)

    Gianetto, David A.; Heydari, Babak

    2016-02-01

    Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game.

  19. Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks

    International Nuclear Information System (INIS)

    Yang Hongyong; Lu Lan; Cao Kecai; Zhang Siying

    2010-01-01

    In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration. (interdisciplinary physics and related areas of science and technology)

  20. Simulating the wealth distribution with a Richest-Following strategy on scale-free network

    Science.gov (United States)

    Hu, Mao-Bin; Jiang, Rui; Wu, Qing-Song; Wu, Yong-Hong

    2007-07-01

    In this paper, we investigate the wealth distribution with agents playing evolutionary games on a scale-free social network adopting the Richest-Following strategy. Pareto's power-law distribution (1897) of wealth is demonstrated with power factor in agreement with that of US or Japan. Moreover, the agent's personal wealth is proportional to its number of contacts (connectivity), and this leads to the phenomenon that the rich gets richer and the poor gets relatively poorer, which agrees with the Matthew Effect.

  1. Truncation of power law behavior in 'scale-free' network models due to information filtering

    International Nuclear Information System (INIS)

    Mossa, Stefano; Barthelemy, Marc; Eugene Stanley, H.; Nunes Amaral, Luis A.

    2002-01-01

    We formulate a general model for the growth of scale-free networks under filtering information conditions--that is, when the nodes can process information about only a subset of the existing nodes in the network. We find that the distribution of the number of incoming links to a node follows a universal scaling form, i.e., that it decays as a power law with an exponential truncation controlled not only by the system size but also by a feature not previously considered, the subset of the network 'accessible' to the node. We test our model with empirical data for the World Wide Web and find agreement

  2. Trajectory Control of Scale-Free Dynamical Networks with Exogenous Disturbances

    International Nuclear Information System (INIS)

    Yang Hongyong; Zhang Shun; Zong Guangdeng

    2011-01-01

    In this paper, the trajectory control of multi-agent dynamical systems with exogenous disturbances is studied. Suppose multiple agents composing of a scale-free network topology, the performance of rejecting disturbances for the low degree node and high degree node is analyzed. Firstly, the consensus of multi-agent systems without disturbances is studied by designing a pinning control strategy on a part of agents, where this pinning control can bring multiple agents' states to an expected consensus track. Then, the influence of the disturbances is considered by developing disturbance observers, and disturbance observers based control (DOBC) are developed for disturbances generated by an exogenous system to estimate the disturbances. Asymptotical consensus of the multi-agent systems with disturbances under the composite controller can be achieved for scale-free network topology. Finally, by analyzing examples of multi-agent systems with scale-free network topology and exogenous disturbances, the verities of the results are proved. Under the DOBC with the designed parameters, the trajectory convergence of multi-agent systems is researched by pinning two class of the nodes. We have found that it has more stronger robustness to exogenous disturbances for the high degree node pinned than that of the low degree node pinned. (interdisciplinary physics and related areas of science and technology)

  3. Utilizing Maximal Independent Sets as Dominating Sets in Scale-Free Networks

    Science.gov (United States)

    Derzsy, N.; Molnar, F., Jr.; Szymanski, B. K.; Korniss, G.

    Dominating sets provide key solution to various critical problems in networked systems, such as detecting, monitoring, or controlling the behavior of nodes. Motivated by graph theory literature [Erdos, Israel J. Math. 4, 233 (1966)], we studied maximal independent sets (MIS) as dominating sets in scale-free networks. We investigated the scaling behavior of the size of MIS in artificial scale-free networks with respect to multiple topological properties (size, average degree, power-law exponent, assortativity), evaluated its resilience to network damage resulting from random failure or targeted attack [Molnar et al., Sci. Rep. 5, 8321 (2015)], and compared its efficiency to previously proposed dominating set selection strategies. We showed that, despite its small set size, MIS provides very high resilience against network damage. Using extensive numerical analysis on both synthetic and real-world (social, biological, technological) network samples, we demonstrate that our method effectively satisfies four essential requirements of dominating sets for their practical applicability on large-scale real-world systems: 1.) small set size, 2.) minimal network information required for their construction scheme, 3.) fast and easy computational implementation, and 4.) resiliency to network damage. Supported by DARPA, DTRA, and NSF.

  4. Scale-free models for the structure of business firm networks.

    Science.gov (United States)

    Kitsak, Maksim; Riccaboni, Massimo; Havlin, Shlomo; Pammolli, Fabio; Stanley, H Eugene

    2010-03-01

    We study firm collaborations in the life sciences and the information and communication technology sectors. We propose an approach to characterize industrial leadership using k -shell decomposition, with top-ranking firms in terms of market value in higher k -shell layers. We find that the life sciences industry network consists of three distinct components: a "nucleus," which is a small well-connected subgraph, "tendrils," which are small subgraphs consisting of small degree nodes connected exclusively to the nucleus, and a "bulk body," which consists of the majority of nodes. Industrial leaders, i.e., the largest companies in terms of market value, are in the highest k -shells of both networks. The nucleus of the life sciences sector is very stable: once a firm enters the nucleus, it is likely to stay there for a long time. At the same time we do not observe the above three components in the information and communication technology sector. We also conduct a systematic study of these three components in random scale-free networks. Our results suggest that the sizes of the nucleus and the tendrils in scale-free networks decrease as the exponent of the power-law degree distribution lambda increases, and disappear for lambda>or=3 . We compare the k -shell structure of random scale-free model networks with two real-world business firm networks in the life sciences and in the information and communication technology sectors. We argue that the observed behavior of the k -shell structure in the two industries is consistent with the coexistence of both preferential and random agreements in the evolution of industrial networks.

  5. Heuristic algorithm for determination of local properties of scale-free networks

    CERN Document Server

    Mitrovic, M

    2006-01-01

    Complex networks are everywhere. Many phenomena in nature can be modeled as networks: - brain structures - protein-protein interaction networks - social interactions - the Internet and WWW. They can be represented in terms of nodes and edges connecting them. Important characteristics: - these networks are not random; they have a structured architecture. Structure of different networks are similar: - all have power law degree distribution (scale-free property) - despite large size there is usually relatively short path between any two nodes (small world property). Global characteristics: - degree distribution, clustering coefficient and the diameter. Local structure: - frequency of subgraphs of given type (subgraph of order k is a part of the network consisting of k nodes and edges between them). There are different types of subgraphs of the same order.

  6. Complex Quantum Network Manifolds in Dimension d > 2 are Scale-Free

    Science.gov (United States)

    Bianconi, Ginestra; Rahmede, Christoph

    2015-09-01

    In quantum gravity, several approaches have been proposed until now for the quantum description of discrete geometries. These theoretical frameworks include loop quantum gravity, causal dynamical triangulations, causal sets, quantum graphity, and energetic spin networks. Most of these approaches describe discrete spaces as homogeneous network manifolds. Here we define Complex Quantum Network Manifolds (CQNM) describing the evolution of quantum network states, and constructed from growing simplicial complexes of dimension . We show that in d = 2 CQNM are homogeneous networks while for d > 2 they are scale-free i.e. they are characterized by large inhomogeneities of degrees like most complex networks. From the self-organized evolution of CQNM quantum statistics emerge spontaneously. Here we define the generalized degrees associated with the -faces of the -dimensional CQNMs, and we show that the statistics of these generalized degrees can either follow Fermi-Dirac, Boltzmann or Bose-Einstein distributions depending on the dimension of the -faces.

  7. Effect of clustering on attack vulnerability of interdependent scale-free networks

    International Nuclear Information System (INIS)

    Li, Rui-qi; Sun, Shi-wen; Ma, Yi-lin; Wang, Li; Xia, Cheng-yi

    2015-01-01

    In order to deeply understand the complex interdependent systems, it is of great concern to take clustering coefficient, which is an important feature of many real-world systems, into account. Previous study mainly focused on the impact of clustering on interdependent networks under random attacks, while we extend the study to the case of the more realistic attacking strategy, targeted attack. A system composed of two interdependent scale-free networks with tunable clustering is provided. The effects of coupling strength and coupling preference on attack vulnerability are explored. Numerical simulation results demonstrate that interdependent links between two networks make the entire system much more fragile to attacks. Also, it is found that clustering significantly increases the vulnerability of interdependent scale-free networks. Moreover, for fully coupled network, disassortative coupling is found to be most vulnerable to random attacks, while the random and assortative coupling have little difference. Additionally, enhancing coupling strength can greatly enhance the fragility of interdependent networks against targeted attacks. These results can not only improve the deep understanding of structural complexity of complex systems, but also provide insights into the guidance of designing resilient infrastructures.

  8. Non-equilibrium mean-field theories on scale-free networks

    International Nuclear Information System (INIS)

    Caccioli, Fabio; Dall'Asta, Luca

    2009-01-01

    Many non-equilibrium processes on scale-free networks present anomalous critical behavior that is not explained by standard mean-field theories. We propose a systematic method to derive stochastic equations for mean-field order parameters that implicitly account for the degree heterogeneity. The method is used to correctly predict the dynamical critical behavior of some binary spin models and reaction–diffusion processes. The validity of our non-equilibrium theory is further supported by showing its relation with the generalized Landau theory of equilibrium critical phenomena on networks

  9. Increased signaling entropy in cancer requires the scale-free property of protein interaction networks

    Science.gov (United States)

    Teschendorff, Andrew E.; Banerji, Christopher R. S.; Severini, Simone; Kuehn, Reimer; Sollich, Peter

    2015-01-01

    One of the key characteristics of cancer cells is an increased phenotypic plasticity, driven by underlying genetic and epigenetic perturbations. However, at a systems-level it is unclear how these perturbations give rise to the observed increased plasticity. Elucidating such systems-level principles is key for an improved understanding of cancer. Recently, it has been shown that signaling entropy, an overall measure of signaling pathway promiscuity, and computable from integrating a sample's gene expression profile with a protein interaction network, correlates with phenotypic plasticity and is increased in cancer compared to normal tissue. Here we develop a computational framework for studying the effects of network perturbations on signaling entropy. We demonstrate that the increased signaling entropy of cancer is driven by two factors: (i) the scale-free (or near scale-free) topology of the interaction network, and (ii) a subtle positive correlation between differential gene expression and node connectivity. Indeed, we show that if protein interaction networks were random graphs, described by Poisson degree distributions, that cancer would generally not exhibit an increased signaling entropy. In summary, this work exposes a deep connection between cancer, signaling entropy and interaction network topology. PMID:25919796

  10. Single or multiple synchronization transitions in scale-free neuronal networks with electrical or chemical coupling

    International Nuclear Information System (INIS)

    Hao Yinghang; Gong, Yubing; Wang Li; Ma Xiaoguang; Yang Chuanlu

    2011-01-01

    Research highlights: → Single synchronization transition for gap-junctional coupling. → Multiple synchronization transitions for chemical synaptic coupling. → Gap junctions and chemical synapses have different impacts on synchronization transition. → Chemical synapses may play a dominant role in neurons' information processing. - Abstract: In this paper, we have studied time delay- and coupling strength-induced synchronization transitions in scale-free modified Hodgkin-Huxley (MHH) neuron networks with gap-junctions and chemical synaptic coupling. It is shown that the synchronization transitions are much different for these two coupling types. For gap-junctions, the neurons exhibit a single synchronization transition with time delay and coupling strength, while for chemical synapses, there are multiple synchronization transitions with time delay, and the synchronization transition with coupling strength is dependent on the time delay lengths. For short delays we observe a single synchronization transition, whereas for long delays the neurons exhibit multiple synchronization transitions as the coupling strength is varied. These results show that gap junctions and chemical synapses have different impacts on the pattern formation and synchronization transitions of the scale-free MHH neuronal networks, and chemical synapses, compared to gap junctions, may play a dominant and more active function in the firing activity of the networks. These findings would be helpful for further understanding the roles of gap junctions and chemical synapses in the firing dynamics of neuronal networks.

  11. Single or multiple synchronization transitions in scale-free neuronal networks with electrical or chemical coupling

    Energy Technology Data Exchange (ETDEWEB)

    Hao Yinghang [School of Physics, Ludong University, Yantai 264025 (China); Gong, Yubing, E-mail: gongyubing09@hotmail.co [School of Physics, Ludong University, Yantai 264025 (China); Wang Li; Ma Xiaoguang; Yang Chuanlu [School of Physics, Ludong University, Yantai 264025 (China)

    2011-04-15

    Research highlights: Single synchronization transition for gap-junctional coupling. Multiple synchronization transitions for chemical synaptic coupling. Gap junctions and chemical synapses have different impacts on synchronization transition. Chemical synapses may play a dominant role in neurons' information processing. - Abstract: In this paper, we have studied time delay- and coupling strength-induced synchronization transitions in scale-free modified Hodgkin-Huxley (MHH) neuron networks with gap-junctions and chemical synaptic coupling. It is shown that the synchronization transitions are much different for these two coupling types. For gap-junctions, the neurons exhibit a single synchronization transition with time delay and coupling strength, while for chemical synapses, there are multiple synchronization transitions with time delay, and the synchronization transition with coupling strength is dependent on the time delay lengths. For short delays we observe a single synchronization transition, whereas for long delays the neurons exhibit multiple synchronization transitions as the coupling strength is varied. These results show that gap junctions and chemical synapses have different impacts on the pattern formation and synchronization transitions of the scale-free MHH neuronal networks, and chemical synapses, compared to gap junctions, may play a dominant and more active function in the firing activity of the networks. These findings would be helpful for further understanding the roles of gap junctions and chemical synapses in the firing dynamics of neuronal networks.

  12. Synchronization in scale-free networks: The role of finite-size effects

    Science.gov (United States)

    Torres, D.; Di Muro, M. A.; La Rocca, C. E.; Braunstein, L. A.

    2015-06-01

    Synchronization problems in complex networks are very often studied by researchers due to their many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, scale-free networks with degree distribution P(k)∼ k-λ , are widely used in research since they are ubiquitous in Nature and other real systems. In this paper we focus on the surface relaxation growth model in scale-free networks with 2.5< λ <3 , and study the scaling behavior of the fluctuations, in the steady state, with the system size N. We find a novel behavior of the fluctuations characterized by a crossover between two regimes at a value of N=N* that depends on λ: a logarithmic regime, found in previous research, and a constant regime. We propose a function that describes this crossover, which is in very good agreement with the simulations. We also find that, for a system size above N* , the fluctuations decrease with λ, which means that the synchronization of the system improves as λ increases. We explain this crossover analyzing the role of the network's heterogeneity produced by the system size N and the exponent of the degree distribution.

  13. Improved routing strategies for data traffic in scale-free networks

    International Nuclear Information System (INIS)

    Wu, Zhi-Xi; Peng, Gang; Wong, Wing-Ming; Yeung, Kai-Hau

    2008-01-01

    We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets and the critical packet generation rate (above which packet aggregation occurs in the network). We found that the routing strategies which integrate ingredients of both global and local topological information of the underlying networks perform much better than the traditional shortest path routing protocol taking into account the global topological information only. Moreover, by doing comparative studies with some related works, we found that the performance of our proposed method shows universal efficiency characteristic against the amount of traffic

  14. An efficient strategy for enhancing traffic capacity by removing links in scale-free networks

    International Nuclear Information System (INIS)

    Huang, Wei; Chow, Tommy W S

    2010-01-01

    An efficient link-removal strategy, called the variance-of-neighbor-degree-reduction (VNDR) strategy, for enhancing the traffic capacity of scale-free networks is proposed in this paper. The VNDR strategy, which considers the important role of hub nodes, balances the amounts of packets routed from each node to the node's neighbors. Compared against the outcomes of strategies that remove links among hub nodes, our results show that the traffic capacity can be greatly enhanced, especially under the shortest path routing strategy. It is also found that the average transport time is effectively reduced by using the VNDR strategy only under the shortest path routing strategy

  15. Impacts of hybrid synapses on the noise-delayed decay in scale-free neural networks

    International Nuclear Information System (INIS)

    Yilmaz, Ergin

    2014-01-01

    Highlights: • We investigate the NDD phenomenon in a hybrid scale-free network. • Electrical synapses are more impressive on the emergence of NDD. • Electrical synapses are more efficient in suppressing of the NDD. • Average degree has two opposite effects on the appearance time of the first spike. - Abstract: We study the phenomenon of noise-delayed decay in a scale-free neural network consisting of excitable FitzHugh–Nagumo neurons. In contrast to earlier works, where only electrical synapses are considered among neurons, we primarily examine the effects of hybrid synapses on the noise-delayed decay in this study. We show that the electrical synaptic coupling is more impressive than the chemical coupling in determining the appearance time of the first-spike and more efficient on the mitigation of the delay time in the detection of a suprathreshold input signal. We obtain that hybrid networks including inhibitory chemical synapses have higher signal detection capabilities than those of including excitatory ones. We also find that average degree exhibits two different effects, which are strengthening and weakening the noise-delayed decay effect depending on the noise intensity

  16. Spreading dynamics of an e-commerce preferential information model on scale-free networks

    Science.gov (United States)

    Wan, Chen; Li, Tao; Guan, Zhi-Hong; Wang, Yuanmei; Liu, Xiongding

    2017-02-01

    In order to study the influence of the preferential degree and the heterogeneity of underlying networks on the spread of preferential e-commerce information, we propose a novel susceptible-infected-beneficial model based on scale-free networks. The spreading dynamics of the preferential information are analyzed in detail using the mean-field theory. We determine the basic reproductive number and equilibria. The theoretical analysis indicates that the basic reproductive number depends mainly on the preferential degree and the topology of the underlying networks. We prove the global stability of the information-elimination equilibrium. The permanence of preferential information and the global attractivity of the information-prevailing equilibrium are also studied in detail. Some numerical simulations are presented to verify the theoretical results.

  17. Ordering chaos and synchronization transitions by chemical delay and coupling on scale-free neuronal networks

    International Nuclear Information System (INIS)

    Gong Yubing; Xie Yanhang; Lin Xiu; Hao Yinghang; Ma Xiaoguang

    2010-01-01

    Research highlights: → Chemical delay and chemical coupling can tame chaotic bursting. → Chemical delay-induced transitions from bursting synchronization to intermittent multiple spiking synchronizations. → Chemical coupling-induced different types of delay-dependent firing transitions. - Abstract: Chemical synaptic connections are more common than electric ones in neurons, and information transmission delay is especially significant for the synapses of chemical type. In this paper, we report a phenomenon of ordering spatiotemporal chaos and synchronization transitions by the delays and coupling through chemical synapses of modified Hodgkin-Huxley (MHH) neurons on scale-free networks. As the delay τ is increased, the neurons exhibit transitions from bursting synchronization (BS) to intermittent multiple spiking synchronizations (SS). As the coupling g syn is increased, the neurons exhibit different types of firing transitions, depending on the values of τ. For a smaller τ, there are transitions from spatiotemporal chaotic bursting (SCB) to BS or SS; while for a larger τ, there are transitions from SCB to intermittent multiple SS. These findings show that the delays and coupling through chemical synapses can tame the chaotic firings and repeatedly enhance the firing synchronization of neurons, and hence could play important roles in the firing activity of the neurons on scale-free networks.

  18. Synchronous bursts on scale-free neuronal networks with attractive and repulsive coupling.

    Directory of Open Access Journals (Sweden)

    Qingyun Wang

    Full Text Available This paper investigates the dependence of synchronization transitions of bursting oscillations on the information transmission delay over scale-free neuronal networks with attractive and repulsive coupling. It is shown that for both types of coupling, the delay always plays a subtle role in either promoting or impairing synchronization. In particular, depending on the inherent oscillation period of individual neurons, regions of irregular and regular propagating excitatory fronts appear intermittently as the delay increases. These delay-induced synchronization transitions are manifested as well-expressed minima in the measure for spatiotemporal synchrony. For attractive coupling, the minima appear at every integer multiple of the average oscillation period, while for the repulsive coupling, they appear at every odd multiple of the half of the average oscillation period. The obtained results are robust to the variations of the dynamics of individual neurons, the system size, and the neuronal firing type. Hence, they can be used to characterize attractively or repulsively coupled scale-free neuronal networks with delays.

  19. Influence of different initial distributions on robust cooperation in scale-free networks: A comparative study

    International Nuclear Information System (INIS)

    Chen Xiaojie; Fu Feng; Wang Long

    2008-01-01

    We study the evolutionary Prisoner's dilemma game on scale-free networks, focusing on the influence of different initial distributions for cooperators and defectors on the evolution of cooperation. To address this issue, we consider three types of initial distributions for defectors: uniform distribution at random, occupying the most connected nodes, and occupying the lowest-degree nodes, respectively. It is shown that initial configurations for defectors can crucially influence the cooperation level and the evolution speed of cooperation. Interestingly, the situation where defectors initially occupy the lowest-degree vertices can exhibit the most robust cooperation, compared with two other distributions. That is, the cooperation level is least affected by the initial percentage of defectors. Moreover, in this situation, the whole system evolves fastest to the prevalent cooperation. Besides, we obtain the critical values of initial frequency of defectors above which the extinction of cooperators occurs for the respective initial distributions. Our results might be helpful in explaining the maintenance of high cooperation in scale-free networks

  20. Coupling effects on turning points of infectious diseases epidemics in scale-free networks.

    Science.gov (United States)

    Kim, Kiseong; Lee, Sangyeon; Lee, Doheon; Lee, Kwang Hyung

    2017-05-31

    Pandemic is a typical spreading phenomenon that can be observed in the human society and is dependent on the structure of the social network. The Susceptible-Infective-Recovered (SIR) model describes spreading phenomena using two spreading factors; contagiousness (β) and recovery rate (γ). Some network models are trying to reflect the social network, but the real structure is difficult to uncover. We have developed a spreading phenomenon simulator that can input the epidemic parameters and network parameters and performed the experiment of disease propagation. The simulation result was analyzed to construct a new marker VRTP distribution. We also induced the VRTP formula for three of the network mathematical models. We suggest new marker VRTP (value of recovered on turning point) to describe the coupling between the SIR spreading and the Scale-free (SF) network and observe the aspects of the coupling effects with the various of spreading and network parameters. We also derive the analytic formulation of VRTP in the fully mixed model, the configuration model, and the degree-based model respectively in the mathematical function form for the insights on the relationship between experimental simulation and theoretical consideration. We discover the coupling effect between SIR spreading and SF network through devising novel marker VRTP which reflects the shifting effect and relates to entropy.

  1. Dynamics of epidemic spreading model with drug-resistant variation on scale-free networks

    Science.gov (United States)

    Wan, Chen; Li, Tao; Zhang, Wu; Dong, Jing

    2018-03-01

    Considering the influence of the virus' drug-resistant variation, a novel SIVRS (susceptible-infected-variant-recovered-susceptible) epidemic spreading model with variation characteristic on scale-free networks is proposed in this paper. By using the mean-field theory, the spreading dynamics of the model is analyzed in detail. Then, the basic reproductive number R0 and equilibriums are derived. Studies show that the existence of disease-free equilibrium is determined by the basic reproductive number R0. The relationships between the basic reproductive number R0, the variation characteristic and the topology of the underlying networks are studied in detail. Furthermore, our studies prove the global stability of the disease-free equilibrium, the permanence of epidemic and the global attractivity of endemic equilibrium. Numerical simulations are performed to confirm the analytical results.

  2. Effects of adaptive degrees of trust on coevolution of quantum strategies on scale-free networks

    Science.gov (United States)

    Li, Qiang; Chen, Minyou; Perc, Matjaž; Iqbal, Azhar; Abbott, Derek

    2013-10-01

    We study the impact of adaptive degrees of trust on the evolution of cooperation in the quantum prisoner's dilemma game. In addition to the strategies, links between players are also subject to evolution. Starting with a scale-free interaction network, players adjust trust towards their neighbors based on received payoffs. The latter governs the strategy adoption process, while trust governs the rewiring of links. As soon as the degree of trust towards a neighbor drops to zero, the link is rewired to another randomly chosen player within the network. We find that for small temptations to defect cooperators always dominate, while for intermediate and strong temptations a single quantum strategy is able to outperform all other strategies. In general, reciprocal trust remains within close relationships and favors the dominance of a single strategy. Due to coevolution, the power-law degree distributions transform to Poisson distributions.

  3. The Medieval inquisition: scale-free networks and the suppression of heresy

    Science.gov (United States)

    Ormerod, Paul; Roach, Andrew P.

    2004-08-01

    Qualitative evidence suggests that heresy within the medieval Church had many of the characteristics of a scale-free network. From the perspective of the Church, heresy can be seen as an infectious disease. The disease persisted for long periods of time, breaking out again even when the Church believed it to have been eradicated. A principal mechanism of heresy was through a small number of individuals with very large numbers of social contacts. Initial attempts by the inquisition to suppress heresy by general persecution, or even mass slaughter, of populations thought to harbour the ‘disease’ failed. Gradually, however, inquisitors learned about the nature of the social networks by which heresy both spread and persisted. Eventually, a policy of targeting key individuals was implemented, which proved to be much more successful.

  4. A local adaptive algorithm for emerging scale-free hierarchical networks

    International Nuclear Information System (INIS)

    Gomez Portillo, I J; Gleiser, P M

    2010-01-01

    In this work we study a growing network model with chaotic dynamical units that evolves using a local adaptive rewiring algorithm. Using numerical simulations we show that the model allows for the emergence of hierarchical networks. First, we show that the networks that emerge with the algorithm present a wide degree distribution that can be fitted by a power law function, and thus are scale-free networks. Using the LaNet-vi visualization tool we present a graphical representation that reveals a central core formed only by hubs, and also show the presence of a preferential attachment mechanism. In order to present a quantitative analysis of the hierarchical structure we analyze the clustering coefficient. In particular, we show that as the network grows the clustering becomes independent of system size, and also presents a power law decay as a function of the degree. Finally, we compare our results with a similar version of the model that has continuous non-linear phase oscillators as dynamical units. The results show that local interactions play a fundamental role in the emergence of hierarchical networks.

  5. Epidemic spreading on dynamical networks with temporary hubs and stable scale-free degree distribution

    International Nuclear Information System (INIS)

    Wu, An-Cai

    2014-01-01

    Recent empirical analyses of some realistic dynamical networks have demonstrated that their degree distributions are stable scale-free (SF), but the instantaneous well-connected hubs at one point of time can quickly become weakly connected. Motivated by these empirical results, we propose a simple toy dynamical agent-to-agent contact network model, in which each agent stays at one node of a static underlay network and the nearest neighbors swap their positions with each other. Although the degree distribution of the dynamical network model at any one time is equal to that in the static underlay network, the numbers and identities of each agent’s contacts will change over time. It is found that the dynamic interaction tends to suppress epidemic spreading in terms of larger epidemic threshold, smaller prevalence (the fraction of infected individuals) and smaller velocity of epidemic outbreak. Furthermore, the dynamic interaction results in the prevalence to undergo a phase transition at a finite threshold of the epidemic spread rate in the thermodynamic limit, which is in contradiction to the absence of an epidemic threshold in static SF networks. Some of these findings obtained from heterogeneous mean-field theory are in good agreement with numerical simulations. (paper)

  6. Quantum phase transition of the transverse-field quantum Ising model on scale-free networks.

    Science.gov (United States)

    Yi, Hangmo

    2015-01-01

    I investigate the quantum phase transition of the transverse-field quantum Ising model in which nearest neighbors are defined according to the connectivity of scale-free networks. Using a continuous-time quantum Monte Carlo simulation method and the finite-size scaling analysis, I identify the quantum critical point and study its scaling characteristics. For the degree exponent λ=6, I obtain results that are consistent with the mean-field theory. For λ=4.5 and 4, however, the results suggest that the quantum critical point belongs to a non-mean-field universality class. Further simulations indicate that the quantum critical point remains mean-field-like if λ>5, but it continuously deviates from the mean-field theory as λ becomes smaller.

  7. Epidemic spreading in scale-free networks including the effect of individual vigilance

    International Nuclear Information System (INIS)

    Gong Yong-Wang; Song Yu-Rong; Jiang Guo-Ping

    2012-01-01

    In this paper, we study the epidemic spreading in scale-free networks and propose a new susceptible-infected-recovered (SIR) model that includes the effect of individual vigilance. In our model, the effective spreading rate is dynamically adjusted with the time evolution at the vigilance period. Using the mean-field theory, an analytical result is derived. It shows that individual vigilance has no effect on the epidemic threshold. The numerical simulations agree well with the analytical result. Furthermore, we investigate the effect of individual vigilance on the epidemic spreading speed. It is shown that individual vigilance can slow the epidemic spreading speed effectively and delay the arrival of peak epidemic infection. (general)

  8. A dynamic routing strategy with limited buffer on scale-free network

    Science.gov (United States)

    Wang, Yufei; Liu, Feng

    2016-04-01

    In this paper, we propose an integrated routing strategy based on global static topology information and local dynamic data packet queue lengths to improve the transmission efficiency of scale-free networks. The proposed routing strategy is a combination of a global static routing strategy (based on the shortest path algorithm) and local dynamic queue length management, in which, instead of using an infinite buffer, the queue length of each node i in the proposed routing strategy is limited by a critical queue length Qic. When the network traffic is lower and the queue length of each node i is shorter than its critical queue length Qic, it forwards packets according to the global routing table. With increasing network traffic, when the buffers of the nodes with higher degree are full, they do not receive packets due to their limited buffers and the packets have to be delivered to the nodes with lower degree. The global static routing strategy can shorten the transmission time that it takes a packet to reach its destination, and the local limited queue length can balance the network traffic. The optimal critical queue lengths of nodes have been analysed. Simulation results show that the proposed routing strategy can get better performance than that of the global static strategy based on topology, and almost the same performance as that of the global dynamic routing strategy with less complexity.

  9. Dynamics of an epidemic model with quarantine on scale-free networks

    Science.gov (United States)

    Kang, Huiyan; Liu, Kaihui; Fu, Xinchu

    2017-12-01

    Quarantine strategies are frequently used to control or reduce the transmission risks of epidemic diseases such as SARS, tuberculosis and cholera. In this paper, we formulate a susceptible-exposed-infected-quarantined-recovered model on a scale-free network incorporating the births and deaths of individuals. Considering that the infectivity is related to the degrees of infectious nodes, we introduce quarantined rate as a function of degree into the model, and quantify the basic reproduction number, which is shown to be dependent on some parameters, such as quarantined rate, infectivity and network structures. A theoretical result further indicates the heterogeneity of networks and higher infectivity will raise the disease transmission risk while quarantine measure will contribute to the prevention of epidemic spreading. Meanwhile, the contact assumption between susceptibles and infectives may impact the disease transmission. Furthermore, we prove that the basic reproduction number serves as a threshold value for the global stability of the disease-free and endemic equilibria and the uniform persistence of the disease on the network by constructing appropriate Lyapunov functions. Finally, some numerical simulations are illustrated to perform and complement our analytical results.

  10. Efficient routing on scale-free networks based on local information

    International Nuclear Information System (INIS)

    Yin Chuanyang; Wang Binghong; Wang Wenxu; Zhou Tao; Yang Huijie

    2006-01-01

    In this Letter, we propose a new routing strategy with a single tunable parameter α only based on local information of network topology. The probability that a given node i with degree k i receives packets from its neighbors is proportional to k i α . In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of α is sought out. Through investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal α. Furthermore, dynamic properties right after the critical point are also studied. Interestingly, it is found that although the system enters the congestion state, it still possesses partial delivering capability which does not depend on α. This phenomenon suggests that the capacity of the scale-free network can be enhanced by increasing the forwarding ability of small important nodes which bear severe congestion

  11. Fractional parentage analysis and a scale-free reproductive network of brown trout.

    Science.gov (United States)

    Koyano, Hitoshi; Serbezov, Dimitar; Kishino, Hirohisa; Schweder, Tore

    2013-11-07

    In this study, we developed a method of fractional parentage analysis using microsatellite markers. We propose a method for calculating parentage probability, which considers missing data and genotyping errors due to null alleles and other causes, by regarding observed alleles as realizations of random variables which take values in the set of alleles at the locus and developing a method for simultaneously estimating the true and null allele frequencies of all alleles at each locus. We then applied our proposed method to a large sample collected from a wild population of brown trout (Salmo trutta). On analyzing the data using our method, we found that the reproductive success of brown trout obeyed a power law, indicating that when the parent-offspring relationship is regarded as a link, the reproductive system of brown trout is a scale-free network. Characteristics of the reproductive network of brown trout include individuals with large bodies as hubs in the network and different power exponents of degree distributions between males and females. © 2013 Elsevier Ltd. All rights reserved.

  12. Walking Across Wikipedia: A Scale-Free Network Model of Semantic Memory Retrieval

    Directory of Open Access Journals (Sweden)

    Graham William Thompson

    2014-02-01

    Full Text Available Semantic knowledge has been investigated using both online and offline methods. One common online method is category recall, in which members of a semantic category like animals are retrieved in a given period of time. The order, timing, and number of retrievals are used as assays of semantic memory processes. One common offline method is corpus analysis, in which the structure of semantic knowledge is extracted from texts using co-occurrence or encyclopedic methods. Online measures of semantic processing, as well as offline measures of semantic structure, have yielded data resembling inverse power law distributions. The aim of the present study is to investigate whether these patterns in data might be related. A semantic network model of animal knowledge is formulated on the basis of Wikipedia pages and their overlap in word probability distributions. The network is scale-free, in that node degree is related to node frequency as an inverse power law. A random walk over this network is shown to simulate a number of results from a category recall experiment, including power law-like distributions of inter-response intervals. Results are discussed in terms of theories of semantic structure and processing.

  13. Effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks

    Science.gov (United States)

    Jiang, Zhong-Yuan; Ma, Jian-Feng

    Existing routing strategies such as the global dynamic routing [X. Ling, M. B. Hu, R. Jiang and Q. S. Wu, Phys. Rev. E 81, 016113 (2010)] can achieve very high traffic capacity at the cost of extremely long packet traveling delay. In many real complex networks, especially for real-time applications such as the instant communication software, extremely long packet traveling time is unacceptable. In this work, we propose to assign a finite Time-to-Live (TTL) parameter for each packet. To guarantee every packet to arrive at its destination within its TTL, we assume that a packet is retransmitted by its source once its TTL expires. We employ source routing mechanisms in the traffic model to avoid the routing-flaps induced by the global dynamic routing. We compose extensive simulations to verify our proposed mechanisms. With small TTL, the effects of packet retransmission on network traffic capacity are obvious, and the phase transition from flow free state to congested state occurs. For the purpose of reducing the computation frequency of the routing table, we employ a computing cycle Tc within which the routing table is recomputed once. The simulation results show that the traffic capacity decreases with increasing Tc. Our work provides a good insight into the understanding of effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks.

  14. Spin glass behavior of the antiferromagnetic Heisenberg model on scale free network

    International Nuclear Information System (INIS)

    Surungan, Tasrief; Zen, Freddy P; Williams, Anthony G

    2015-01-01

    Randomness and frustration are considered to be the key ingredients for the existence of spin glass (SG) phase. In a canonical system, these ingredients are realized by the random mixture of ferromagnetic (FM) and antiferromagnetic (AF) couplings. The study by Bartolozzi et al. [Phys. Rev. B73, 224419 (2006)] who observed the presence of SG phase on the AF Ising model on scale free network (SFN) is stimulating. It is a new type of SG system where randomness and frustration are not caused by the presence of FM and AF couplings. To further elaborate this type of system, here we study Heisenberg model on AF SFN and search for the SG phase. The canonical SG Heisenberg model is not observed in d-dimensional regular lattices for (d ≤ 3). We can make an analogy for the connectivity density (m) of SFN with the dimensionality of the regular lattice. It should be plausible to find the critical value of m for the existence of SG behaviour, analogous to the lower critical dimension (d l ) for the canonical SG systems. Here we study system with m = 2, 3, 4 and 5. We used Replica Exchange algorithm of Monte Carlo Method and calculated the SG order parameter. We observed SG phase for each value of m and estimated its corersponding critical temperature. (paper)

  15. Fast sparsely synchronized brain rhythms in a scale-free neural network.

    Science.gov (United States)

    Kim, Sang-Yoon; Lim, Woochang

    2015-08-01

    We consider a directed version of the Barabási-Albert scale-free network model with symmetric preferential attachment with the same in- and out-degrees and study the emergence of sparsely synchronized rhythms for a fixed attachment degree in an inhibitory population of fast-spiking Izhikevich interneurons. Fast sparsely synchronized rhythms with stochastic and intermittent neuronal discharges are found to appear for large values of J (synaptic inhibition strength) and D (noise intensity). For an intensive study we fix J at a sufficiently large value and investigate the population states by increasing D. For small D, full synchronization with the same population-rhythm frequency fp and mean firing rate (MFR) fi of individual neurons occurs, while for large D partial synchronization with fp>〈fi〉 (〈fi〉: ensemble-averaged MFR) appears due to intermittent discharge of individual neurons; in particular, the case of fp>4〈fi〉 is referred to as sparse synchronization. For the case of partial and sparse synchronization, MFRs of individual neurons vary depending on their degrees. As D passes a critical value D* (which is determined by employing an order parameter), a transition to unsynchronization occurs due to the destructive role of noise to spoil the pacing between sparse spikes. For Dnetwork structure for the case of partial and sparse synchronization, which is in contrast to the case of

  16. Fast sparsely synchronized brain rhythms in a scale-free neural network

    Science.gov (United States)

    Kim, Sang-Yoon; Lim, Woochang

    2015-08-01

    We consider a directed version of the Barabási-Albert scale-free network model with symmetric preferential attachment with the same in- and out-degrees and study the emergence of sparsely synchronized rhythms for a fixed attachment degree in an inhibitory population of fast-spiking Izhikevich interneurons. Fast sparsely synchronized rhythms with stochastic and intermittent neuronal discharges are found to appear for large values of J (synaptic inhibition strength) and D (noise intensity). For an intensive study we fix J at a sufficiently large value and investigate the population states by increasing D . For small D , full synchronization with the same population-rhythm frequency fp and mean firing rate (MFR) fi of individual neurons occurs, while for large D partial synchronization with fp> ( : ensemble-averaged MFR) appears due to intermittent discharge of individual neurons; in particular, the case of fp>4 is referred to as sparse synchronization. For the case of partial and sparse synchronization, MFRs of individual neurons vary depending on their degrees. As D passes a critical value D* (which is determined by employing an order parameter), a transition to unsynchronization occurs due to the destructive role of noise to spoil the pacing between sparse spikes. For D network structure for the case of partial and sparse synchronization, which is in contrast to the case of statistically homogeneous

  17. Phase transitions in scale-free neural networks: Departure from the standard mean-field universality class

    International Nuclear Information System (INIS)

    Aldana, Maximino; Larralde, Hernan

    2004-01-01

    We investigate the nature of the phase transition from an ordered to a disordered state that occurs in a family of neural network models with noise. These models are closely related to the majority voter model, where a ferromagneticlike interaction between the elements prevails. Each member of the family is distinguished by the network topology, which is determined by the probability distribution of the number of incoming links. We show that for homogeneous random topologies, the phase transition belongs to the standard mean-field universality class, characterized by the order parameter exponent β=1/2. However, for scale-free networks we obtain phase transition exponents ranging from 1/2 to infinity. Furthermore, we show the existence of a phase transition even for values of the scale-free exponent in the interval (1.5,2], where the average network connectivity diverges

  18. Scale-free behavior of networks with the copresence of preferential and uniform attachment rules

    Science.gov (United States)

    Pachon, Angelica; Sacerdote, Laura; Yang, Shuyi

    2018-05-01

    Complex networks in different areas exhibit degree distributions with a heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential attachment model, whose modifications are interesting for two main reasons: to analyze more realistic models and to study the robustness of the scale-free behavior of the degree distribution. We introduce and study a model which takes into account two different attachment rules: a preferential attachment mechanism (with probability 1 - p) that stresses the rich get richer system, and a uniform choice (with probability p) for the most recent nodes, i.e. the nodes belonging to a window of size w to the left of the last born node. The latter highlights a trend to select one of the last added nodes when no information is available. The recent nodes can be either a given fixed number or a proportion (αn) of the total number of existing nodes. In the first case, we prove that this model exhibits an asymptotically power-law degree distribution. The same result is then illustrated through simulations in the second case. When the window of recent nodes has a constant size, we herein prove that the presence of the uniform rule delays the starting time from which the asymptotic regime starts to hold. The mean number of nodes of degree k and the asymptotic degree distribution are also determined analytically. Finally, a sensitivity analysis on the parameters of the model is performed.

  19. Critical behavior and correlations on scale-free small-world networks: Application to network design

    Science.gov (United States)

    Ostilli, M.; Ferreira, A. L.; Mendes, J. F. F.

    2011-06-01

    We analyze critical phenomena on networks generated as the union of hidden variable models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small worlds similar to those à la Watts and Strogatz, but with a heterogeneous degree distribution. We prove that the critical behavior (thermal or percolative) remains completely unchanged by the presence of finite loops (or finite clustering). Then, we show that, in large but finite networks, correlations of two given spins may be strong, i.e., approximately power-law-like, at any temperature. Quite interestingly, if γ is the exponent for the power-law distribution of the vertex degree, for γ⩽3 and with or without short-range couplings, such strong correlations persist even in the thermodynamic limit, contradicting the common opinion that, in mean-field models, correlations always disappear in this limit. Finally, we provide the optimal choice of rewiring under which percolation phenomena in the rewired network are best performed, a natural criterion to reach best communication features, at least in noncongested regimes.

  20. Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

    International Nuclear Information System (INIS)

    Xie Wei-Hao; Zhou Bin; Liu En-Xiao; Lu Wei-Dang; Zhou Ting

    2015-01-01

    Many real communication networks, such as oceanic monitoring network and land environment observation network, can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue (HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue (HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity. (paper)

  1. Boolean decision problems with competing interactions on scale-free networks: Equilibrium and nonequilibrium behavior in an external bias

    Science.gov (United States)

    Zhu, Zheng; Andresen, Juan Carlos; Moore, M. A.; Katzgraber, Helmut G.

    2014-02-01

    We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First, we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show that the system has a spin-glass phase in a field, i.e., exhibits a de Almeida-Thouless line. Furthermore, we study avalanche distributions when the system is driven by a field at zero temperature to test if the system displays self-organized criticality. Numerical results suggest that avalanches (damage) can spread across the whole system with nonzero probability when the decay exponent of the interaction degree is less than or equal to 2, i.e., that Boolean decision problems on scale-free networks with competing interactions can be fragile when not in thermal equilibrium.

  2. Topology of the Italian airport network: A scale-free small-world network with a fractal structure?

    International Nuclear Information System (INIS)

    Guida, Michele; Maria, Funaro

    2007-01-01

    In this paper, for the first time we analyze the structure of the Italian Airport Network (IAN) looking at it as a mathematical graph and investigate its topological properties. We find that it has very remarkable features, being like a scale-free network, since both the degree and the 'betweenness centrality' distributions follow a typical power-law known in literature as a Double Pareto Law. From a careful analysis of the data, the Italian Airport Network turns out to have a self-similar structure. In short, it is characterized by a fractal nature, whose typical dimensions can be easily determined from the values of the power-law scaling exponents. Moreover, we show that, according to the period examined, these distributions exhibit a number of interesting features, such as the existence of some 'hubs', i.e. in the graph theory's jargon, nodes with a very large number of links, and others most probably associated with geographical constraints. Also, we find that the IAN can be classified as a small-world network because the average distance between reachable pairs of airports grows at most as the logarithm of the number of airports. The IAN does not show evidence of 'communities' and this result could be the underlying reason behind the smallness of the value of the clustering coefficient, which is related to the probability that two nearest neighbors of a randomly chosen airport are connected

  3. Birth of scale-free molecular networks and the number of distinct DNA and protein domains per genome.

    Science.gov (United States)

    Rzhetsky, A; Gomez, S M

    2001-10-01

    Current growth in the field of genomics has provided a number of exciting approaches to the modeling of evolutionary mechanisms within the genome. Separately, dynamical and statistical analyses of networks such as the World Wide Web and the social interactions existing between humans have shown that these networks can exhibit common fractal properties-including the property of being scale-free. This work attempts to bridge these two fields and demonstrate that the fractal properties of molecular networks are linked to the fractal properties of their underlying genomes. We suggest a stochastic model capable of describing the evolutionary growth of metabolic or signal-transduction networks. This model generates networks that share important statistical properties (so-called scale-free behavior) with real molecular networks. In particular, the frequency of vertices connected to exactly k other vertices follows a power-law distribution. The shape of this distribution remains invariant to changes in network scale: a small subgraph has the same distribution as the complete graph from which it is derived. Furthermore, the model correctly predicts that the frequencies of distinct DNA and protein domains also follow a power-law distribution. Finally, the model leads to a simple equation linking the total number of different DNA and protein domains in a genome with both the total number of genes and the overall network topology. MatLab (MathWorks, Inc.) programs described in this manuscript are available on request from the authors. ar345@columbia.edu.

  4. Stability of an SAIRS alcoholism model on scale-free networks

    Science.gov (United States)

    Xiang, Hong; Liu, Ying-Ping; Huo, Hai-Feng

    2017-05-01

    A new SAIRS alcoholism model with birth and death on complex heterogeneous networks is proposed. The total population of our model is partitioned into four compartments: the susceptible individual, the light problem alcoholic, the heavy problem alcoholic and the recovered individual. The spread of alcoholism threshold R0 is calculated by the next generation matrix method. When R0 alcohol free equilibrium is globally asymptotically stable, then the alcoholics will disappear. When R0 > 1, the alcoholism equilibrium is global attractivity, then the number of alcoholics will remain stable and alcoholism will become endemic. Furthermore, the modified SAIRS alcoholism model on weighted contact network is introduced. Dynamical behavior of the modified model is also studied. Numerical simulations are also presented to verify and extend theoretical results. Our results show that it is very important to treat alcoholics to control the spread of the alcoholism.

  5. Impact of interaction style and degree on the evolution of cooperation on Barabási-Albert scale-free network.

    Directory of Open Access Journals (Sweden)

    Fengjie Xie

    Full Text Available In this work, we study an evolutionary prisoner's dilemma game (PDG on Barabási-Albert scale-free networks with limited player interactions, and explore the effect of interaction style and degree on cooperation. The results show that high-degree preference interaction, namely the most applicable interaction in the real world, is less beneficial for emergence of cooperation on scale-free networks than random interaction. Besides, cooperation on scale-free networks is enhanced with the increase of interaction degree regardless whether the interaction is high-degree preference or random. If the interaction degree is very low, the cooperation level on scale-free networks is much lower than that on regular ring networks, which is against the common belief that scale-free networks must be more beneficial for cooperation. Our analysis indicates that the interaction relations, the strategy and the game payoff of high-connectivity players play important roles in the evolution of cooperation on scale-free networks. A certain number of interactions are necessary for scale-free networks to exhibit strong capability of facilitating cooperation. Our work provides important insight for members on how to interact with others in a social organization.

  6. Optimization and Implementation of Scaling-Free CORDIC-Based Direct Digital Frequency Synthesizer for Body Care Area Network Systems

    Directory of Open Access Journals (Sweden)

    Ying-Shen Juang

    2012-01-01

    Full Text Available Coordinate rotation digital computer (CORDIC is an efficient algorithm for computations of trigonometric functions. Scaling-free-CORDIC is one of the famous CORDIC implementations with advantages of speed and area. In this paper, a novel direct digital frequency synthesizer (DDFS based on scaling-free CORDIC is presented. The proposed multiplier-less architecture with small ROM and pipeline data path has advantages of high data rate, high precision, high performance, and less hardware cost. The design procedure with performance and hardware analysis for optimization has also been given. It is verified by Matlab simulations and then implemented with field programmable gate array (FPGA by Verilog. The spurious-free dynamic range (SFDR is over 86.85 dBc, and the signal-to-noise ratio (SNR is more than 81.12 dB. The scaling-free CORDIC-based architecture is suitable for VLSI implementations for the DDFS applications in terms of hardware cost, power consumption, SNR, and SFDR. The proposed DDFS is very suitable for medical instruments and body care area network systems.

  7. Structure and growth of weighted networks

    Energy Technology Data Exchange (ETDEWEB)

    Riccaboni, Massimo [Department of Computer and Management Sciences, University of Trento, Trento (Italy); Schiavo, Stefano [Department of Economics, University of Trento, Trento (Italy)], E-mail: massimo.riccaboni@unitn.it, E-mail: stefano.schiavo@unitn.it

    2010-02-15

    We develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In our framework, the Barabasi-Albert model of network evolution is extended by assuming that link weights evolve according to a geometric Brownian motion. Our model is verified by means of simulations and real-world trade data. We show that the model correctly predicts the intensity and growth distribution of links, the size-variance relationship of the growth of link weights, the relationship between the degree and strength of nodes, and the scale-free structure of the network.

  8. Collective firing regularity of a scale-free Hodgkin–Huxley neuronal network in response to a subthreshold signal

    Energy Technology Data Exchange (ETDEWEB)

    Yilmaz, Ergin, E-mail: erginyilmaz@yahoo.com [Department of Biomedical Engineering, Engineering Faculty, Bülent Ecevit University, 67100 Zonguldak (Turkey); Ozer, Mahmut [Department of Electrical and Electronics Engineering, Engineering Faculty, Bülent Ecevit University, 67100 Zonguldak (Turkey)

    2013-08-01

    We consider a scale-free network of stochastic HH neurons driven by a subthreshold periodic stimulus and investigate how the collective spiking regularity or the collective temporal coherence changes with the stimulus frequency, the intrinsic noise (or the cell size), the network average degree and the coupling strength. We show that the best temporal coherence is obtained for a certain level of the intrinsic noise when the frequencies of the external stimulus and the subthreshold oscillations of the network elements match. We also find that the collective regularity exhibits a resonance-like behavior depending on both the coupling strength and the network average degree at the optimal values of the stimulus frequency and the cell size, indicating that the best temporal coherence also requires an optimal coupling strength and an optimal average degree of the connectivity.

  9. Mapping Koch curves into scale-free small-world networks

    International Nuclear Information System (INIS)

    Zhang Zhongzhi; Gao Shuyang; Zhou Shuigeng; Chen Lichao; Zhang Hongjuan; Guan Jihong

    2010-01-01

    The class of Koch fractals is one of the most interesting families of fractals, and the study of complex networks is a central issue in the scientific community. In this paper, inspired by the famous Koch fractals, we propose a mapping technique converting Koch fractals into a family of deterministic networks called Koch networks. This novel class of networks incorporates some key properties characterizing a majority of real-life networked systems-a power-law distribution with exponent in the range between 2 and 3, a high clustering coefficient, a small diameter and average path length and degree correlations. Besides, we enumerate the exact numbers of spanning trees, spanning forests and connected spanning subgraphs in the networks. All these features are obtained exactly according to the proposed generation algorithm of the networks considered. The network representation approach could be used to investigate the complexity of some real-world systems from the perspective of complex networks.

  10. Coupling effects on turning points of infectious diseases epidemics in scale-free networks

    OpenAIRE

    Kim, Kiseong; Lee, Sangyeon; Lee, Doheon; Lee, Kwang Hyung

    2017-01-01

    Background Pandemic is a typical spreading phenomenon that can be observed in the human society and is dependent on the structure of the social network. The Susceptible-Infective-Recovered (SIR) model describes spreading phenomena using two spreading factors; contagiousness (?) and recovery rate (?). Some network models are trying to reflect the social network, but the real structure is difficult to uncover. Methods We have developed a spreading phenomenon simulator that can input the epidemi...

  11. Epidemic outbreaks in growing scale-free networks with local structure

    Science.gov (United States)

    Ni, Shunjiang; Weng, Wenguo; Shen, Shifei; Fan, Weicheng

    2008-09-01

    The class of generative models has already attracted considerable interest from researchers in recent years and much expanded the original ideas described in BA model. Most of these models assume that only one node per time step joins the network. In this paper, we grow the network by adding n interconnected nodes as a local structure into the network at each time step with each new node emanating m new edges linking the node to the preexisting network by preferential attachment. This successfully generates key features observed in social networks. These include power-law degree distribution pk∼k, where μ=(n-1)/m is a tuning parameter defined as the modularity strength of the network, nontrivial clustering, assortative mixing, and modular structure. Moreover, all these features are dependent in a similar way on the parameter μ. We then study the susceptible-infected epidemics on this network with identical infectivity, and find that the initial epidemic behavior is governed by both of the infection scheme and the network structure, especially the modularity strength. The modularity of the network makes the spreading velocity much lower than that of the BA model. On the other hand, increasing the modularity strength will accelerate the propagation velocity.

  12. Emergence of scale-free close-knit friendship structure in online social networks.

    Directory of Open Access Journals (Sweden)

    Ai-Xiang Cui

    Full Text Available Although the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properties. It is found that not only the local structures given by the indegree, outdegree, and reciprocal degree distributions follow a similar scaling behavior, the mesoscale structures represented by the distributions of close-knit friendship structures also exhibit a similar scaling law. The degree correlation is very weak over a wide range of the degrees. We propose a simple directed network model that captures the observed properties. The model incorporates two mechanisms: reciprocation and preferential attachment. Through rate equation analysis of our model, the local-scale and mesoscale structural properties are derived. In the local-scale, the same scaling behavior of indegree and outdegree distributions stems from indegree and outdegree of nodes both growing as the same function of the introduction time, and the reciprocal degree distribution also shows the same power-law due to the linear relationship between the reciprocal degree and in/outdegree of nodes. In the mesoscale, the distributions of four closed triples representing close-knit friendship structures are found to exhibit identical power-laws, a behavior attributed to the negligible degree correlations. Intriguingly, all the power-law exponents of the distributions in the local-scale and mesoscale depend only on one global parameter, the mean in/outdegree, while both the mean in/outdegree and the reciprocity together determine the ratio of the reciprocal degree of a node to its in/outdegree. Structural properties of numerical simulated networks are analyzed and compared with each of the four

  13. Emergence of scale-free close-knit friendship structure in online social networks.

    Science.gov (United States)

    Cui, Ai-Xiang; Zhang, Zi-Ke; Tang, Ming; Hui, Pak Ming; Fu, Yan

    2012-01-01

    Although the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properties. It is found that not only the local structures given by the indegree, outdegree, and reciprocal degree distributions follow a similar scaling behavior, the mesoscale structures represented by the distributions of close-knit friendship structures also exhibit a similar scaling law. The degree correlation is very weak over a wide range of the degrees. We propose a simple directed network model that captures the observed properties. The model incorporates two mechanisms: reciprocation and preferential attachment. Through rate equation analysis of our model, the local-scale and mesoscale structural properties are derived. In the local-scale, the same scaling behavior of indegree and outdegree distributions stems from indegree and outdegree of nodes both growing as the same function of the introduction time, and the reciprocal degree distribution also shows the same power-law due to the linear relationship between the reciprocal degree and in/outdegree of nodes. In the mesoscale, the distributions of four closed triples representing close-knit friendship structures are found to exhibit identical power-laws, a behavior attributed to the negligible degree correlations. Intriguingly, all the power-law exponents of the distributions in the local-scale and mesoscale depend only on one global parameter, the mean in/outdegree, while both the mean in/outdegree and the reciprocity together determine the ratio of the reciprocal degree of a node to its in/outdegree. Structural properties of numerical simulated networks are analyzed and compared with each of the four real networks. This

  14. The role of detachment of in-links in scale-free networks

    International Nuclear Information System (INIS)

    Lansky, P; Polito, F; Sacerdote, L

    2014-01-01

    Real-world networks may exhibit a detachment phenomenon determined by the canceling of previously existing connections. We discuss a tractable extension of the Yule model to account for this feature. Analytical results are derived and discussed both asymptotically and for a finite number of links. Comparison with the original model is performed in the supercritical case. The first-order asymptotic tail behavior of the two models is similar but differences arise in the second-order term. We explicitly refer to world wide web modeling and we show the agreement of the proposed model on very recent data. However, other possible network applications are also mentioned. (paper)

  15. Robustness of weighted networks

    Science.gov (United States)

    Bellingeri, Michele; Cassi, Davide

    2018-01-01

    Complex network response to node loss is a central question in different fields of network science because node failure can cause the fragmentation of the network, thus compromising the system functioning. Previous studies considered binary networks where the intensity (weight) of the links is not accounted for, i.e. a link is either present or absent. However, in real-world networks the weights of connections, and thus their importance for network functioning, can be widely different. Here, we analyzed the response of real-world and model networks to node loss accounting for link intensity and the weighted structure of the network. We used both classic binary node properties and network functioning measure, introduced a weighted rank for node importance (node strength), and used a measure for network functioning that accounts for the weight of the links (weighted efficiency). We find that: (i) the efficiency of the attack strategies changed using binary or weighted network functioning measures, both for real-world or model networks; (ii) in some cases, removing nodes according to weighted rank produced the highest damage when functioning was measured by the weighted efficiency; (iii) adopting weighted measure for the network damage changed the efficacy of the attack strategy with respect the binary analyses. Our results show that if the weighted structure of complex networks is not taken into account, this may produce misleading models to forecast the system response to node failure, i.e. consider binary links may not unveil the real damage induced in the system. Last, once weighted measures are introduced, in order to discover the best attack strategy, it is important to analyze the network response to node loss using nodes rank accounting the intensity of the links to the node.

  16. Reciprocity of weighted networks.

    Science.gov (United States)

    Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

    2013-01-01

    In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.

  17. Weighted Scaling in Non-growth Random Networks

    International Nuclear Information System (INIS)

    Chen Guang; Yang Xuhua; Xu Xinli

    2012-01-01

    We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in non-growth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its total number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scale-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.

  18. Efficiency of quarantine and self-protection processes in epidemic spreading control on scale-free networks

    Science.gov (United States)

    Esquivel-Gómez, Jose de Jesus; Barajas-Ramírez, Juan Gonzalo

    2018-01-01

    One of the most effective mechanisms to contain the spread of an infectious disease through a population is the implementation of quarantine policies. However, its efficiency is affected by different aspects, for example, the structure of the underlining social network where highly connected individuals are more likely to become infected; therefore, the speed of the transmission of the decease is directly determined by the degree distribution of the network. Another aspect that influences the effectiveness of the quarantine is the self-protection processes of the individuals in the population, that is, they try to avoid contact with potentially infected individuals. In this paper, we investigate the efficiency of quarantine and self-protection processes in preventing the spreading of infectious diseases over complex networks with a power-law degree distribution [ P ( k ) ˜ k - ν ] for different ν values. We propose two alternative scale-free models that result in power-law degree distributions above and below the exponent ν = 3 associated with the conventional Barabási-Albert model. Our results show that the exponent ν determines the effectiveness of these policies in controlling the spreading process. More precisely, we show that for the ν exponent below three, the quarantine mechanism loses effectiveness. However, the efficiency is improved if the quarantine is jointly implemented with a self-protection process driving the number of infected individuals significantly lower.

  19. On routing strategy with finite-capacity effect on scale-free networks

    International Nuclear Information System (INIS)

    Tang, S.; Jiang, X.; Ma, L.; Zhang, Z.; Zheng, Z.

    2010-01-01

    We propose a class of systems with finite-capacity effect to investigate routing-strategy optimization. The local topology and the variable capacity, two crucial elements for routing, are naturally coupled by considering the interactions among packets. We show how the combination of these two elements controls the normal and efficient functioning of routing in the frame of condensation and coverage, respectively. Specifically, it is shown that the dynamic behaviors of diffusing packets exhibit condensation, for which exact results of the stationary state and phase transition are given. Further, we explore the diffusion coverage of routed packets through simulation. Various alternatives for the strategy parameters are illustrated to apply standard techniques to alleviate condensation and accelerate coverage. Our results provide a practical way for the design of optimal routing strategies in complex networks by the manipulation of a few parameters. (author)

  20. Epidemic metapopulation model with traffic routing in scale-free networks

    International Nuclear Information System (INIS)

    Huang, Wei; Chen, Shengyong

    2011-01-01

    In this paper, we propose a model incorporating both the traffic routing dynamics and the virus prevalence dynamics. In this model, each packet may be isolated from the network on its transporting path, which means that the packet cannot be successfully delivered to its destination. In contrast, a successful transport means that a packet can be delivered from source to destination without being isolated. The effects of model parameters on the delivery success rate and the delivery failure rate are intensively studied and analyzed. Several routing strategies are performed for our model. Results show that the shortest path routing strategy is the most effective for enhancing the delivery success rate, especially when each packet is only allowed to be delivered to the neighbor with the lowest degree along the shortest path. We also find that, by minimizing the sum of the nodes' degree along the transporting path, we can also obtain a satisfactory delivery success rate

  1. Generating Billion-Edge Scale-Free Networks in Seconds: Performance Study of a Novel GPU-based Preferential Attachment Model

    Energy Technology Data Exchange (ETDEWEB)

    Perumalla, Kalyan S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Alam, Maksudul [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2017-10-01

    A novel parallel algorithm is presented for generating random scale-free networks using the preferential-attachment model. The algorithm, named cuPPA, is custom-designed for single instruction multiple data (SIMD) style of parallel processing supported by modern processors such as graphical processing units (GPUs). To the best of our knowledge, our algorithm is the first to exploit GPUs, and also the fastest implementation available today, to generate scale free networks using the preferential attachment model. A detailed performance study is presented to understand the scalability and runtime characteristics of the cuPPA algorithm. In one of the best cases, when executed on an NVidia GeForce 1080 GPU, cuPPA generates a scale free network of a billion edges in less than 2 seconds.

  2. Weighted network modules

    International Nuclear Information System (INIS)

    Farkas, Illes; Abel, Daniel; Palla, Gergely; Vicsek, Tamas

    2007-01-01

    The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm clique percolation method with weights (CPMw) for weighted networks based on the concept of percolating k-cliques with high enough intensity. The algorithm allows overlaps between the modules. First, we give detailed analytical and numerical results about the critical point of weighted k-clique percolation on (weighted) Erdos-Renyi graphs. Then, for a scientist collaboration web and a stock correlation graph we compute three-link weight correlations and with the CPMw the weighted modules. After reshuffling link weights in both networks and computing the same quantities for the randomized control graphs as well, we show that groups of three or more strong links prefer to cluster together in both original graphs

  3. Physics of flow in weighted complex networks

    Science.gov (United States)

    Wu, Zhenhua

    This thesis uses concepts from statistical physics to understand the physics of flow in weighted complex networks. The traditional model for random networks is the Erdoḧs-Renyi (ER.) network, where a network of N nodes is created by connecting each of the N(N - 1)/2 pairs of nodes with a probability p. The degree distribution, which is the probability distribution of the number of links per node, is a Poisson distribution. Recent studies of the topology in many networks such as the Internet and the world-wide airport network (WAN) reveal a power law degree distribution, known as a scale-free (SF) distribution. To yield a better description of network dynamics, we study weighted networks, where each link or node is given a number. One asks how the weights affect the static and the dynamic properties of the network. In this thesis, two important dynamic problems are studied: the current flow problem, described by Kirchhoff's laws, and the maximum flow problem, which maximizes the flow between two nodes. Percolation theory is applied to these studies of the dynamics in complex networks. We find that the current flow in disordered media belongs to the same universality class as the optimal path. In a randomly weighted network, we identify the infinite incipient percolation cluster as the "superhighway", which contains most of the traffic in a network. We propose an efficient strategy to improve significantly the global transport by improving the superhighways, which comprise a small fraction of the network. We also propose a network model with correlated weights to describe weighted networks such as the WAN. Our model agrees with WAN data, and provides insight into the advantages of correlated weights in networks. Lastly, the upper critical dimension is evaluated using two different numerical methods, and the result is consistent with the theoretical prediction.

  4. Microarray analysis and scale-free gene networks identify candidate regulators in drought-stressed roots of loblolly pine (P. taeda L.

    Directory of Open Access Journals (Sweden)

    Bordeaux John M

    2011-05-01

    Full Text Available Abstract Background Global transcriptional analysis of loblolly pine (Pinus taeda L. is challenging due to limited molecular tools. PtGen2, a 26,496 feature cDNA microarray, was fabricated and used to assess drought-induced gene expression in loblolly pine propagule roots. Statistical analysis of differential expression and weighted gene correlation network analysis were used to identify drought-responsive genes and further characterize the molecular basis of drought tolerance in loblolly pine. Results Microarrays were used to interrogate root cDNA populations obtained from 12 genotype × treatment combinations (four genotypes, three watering regimes. Comparison of drought-stressed roots with roots from the control treatment identified 2445 genes displaying at least a 1.5-fold expression difference (false discovery rate = 0.01. Genes commonly associated with drought response in pine and other plant species, as well as a number of abiotic and biotic stress-related genes, were up-regulated in drought-stressed roots. Only 76 genes were identified as differentially expressed in drought-recovered roots, indicating that the transcript population can return to the pre-drought state within 48 hours. Gene correlation analysis predicts a scale-free network topology and identifies eleven co-expression modules that ranged in size from 34 to 938 members. Network topological parameters identified a number of central nodes (hubs including those with significant homology (E-values ≤ 2 × 10-30 to 9-cis-epoxycarotenoid dioxygenase, zeatin O-glucosyltransferase, and ABA-responsive protein. Identified hubs also include genes that have been associated previously with osmotic stress, phytohormones, enzymes that detoxify reactive oxygen species, and several genes of unknown function. Conclusion PtGen2 was used to evaluate transcriptome responses in loblolly pine and was leveraged to identify 2445 differentially expressed genes responding to severe drought stress in

  5. Microarray analysis and scale-free gene networks identify candidate regulators in drought-stressed roots of loblolly pine (P. taeda L.)

    Science.gov (United States)

    2011-01-01

    Background Global transcriptional analysis of loblolly pine (Pinus taeda L.) is challenging due to limited molecular tools. PtGen2, a 26,496 feature cDNA microarray, was fabricated and used to assess drought-induced gene expression in loblolly pine propagule roots. Statistical analysis of differential expression and weighted gene correlation network analysis were used to identify drought-responsive genes and further characterize the molecular basis of drought tolerance in loblolly pine. Results Microarrays were used to interrogate root cDNA populations obtained from 12 genotype × treatment combinations (four genotypes, three watering regimes). Comparison of drought-stressed roots with roots from the control treatment identified 2445 genes displaying at least a 1.5-fold expression difference (false discovery rate = 0.01). Genes commonly associated with drought response in pine and other plant species, as well as a number of abiotic and biotic stress-related genes, were up-regulated in drought-stressed roots. Only 76 genes were identified as differentially expressed in drought-recovered roots, indicating that the transcript population can return to the pre-drought state within 48 hours. Gene correlation analysis predicts a scale-free network topology and identifies eleven co-expression modules that ranged in size from 34 to 938 members. Network topological parameters identified a number of central nodes (hubs) including those with significant homology (E-values ≤ 2 × 10-30) to 9-cis-epoxycarotenoid dioxygenase, zeatin O-glucosyltransferase, and ABA-responsive protein. Identified hubs also include genes that have been associated previously with osmotic stress, phytohormones, enzymes that detoxify reactive oxygen species, and several genes of unknown function. Conclusion PtGen2 was used to evaluate transcriptome responses in loblolly pine and was leveraged to identify 2445 differentially expressed genes responding to severe drought stress in roots. Many of the

  6. Stabilizing weighted complex networks

    International Nuclear Information System (INIS)

    Xiang Linying; Chen Zengqiang; Liu Zhongxin; Chen Fei; Yuan Zhuzhi

    2007-01-01

    Real networks often consist of local units which interact with each other via asymmetric and heterogeneous connections. In this paper, the V-stability problem is investigated for a class of asymmetric weighted coupled networks with nonidentical node dynamics, which includes the unweighted network as a special case. Pinning control is suggested to stabilize such a coupled network. The complicated stabilization problem is reduced to measuring the semi-negative property of the characteristic matrix which embodies not only the network topology, but also the node self-dynamics and the control gains. It is found that network stabilizability depends critically on the second largest eigenvalue of the characteristic matrix. The smaller the second largest eigenvalue is, the more the network is pinning controllable. Numerical simulations of two representative networks composed of non-chaotic systems and chaotic systems, respectively, are shown for illustration and verification

  7. The relations between network-operation and topological-property in a scale-free and small-world network with community structure

    Science.gov (United States)

    Ma, Fei; Yao, Bing

    2017-10-01

    It is always an open, demanding and difficult task for generating available model to simulate dynamical functions and reveal inner principles from complex systems and networks. In this article, due to lots of real-life and artificial networks are built from series of simple and small groups (components), we discuss some interesting and helpful network-operation to generate more realistic network models. In view of community structure (modular topology), we present a class of sparse network models N(t , m) . At the moment, we capture the fact the N(t , 4) has not only scale-free feature, which means that the probability that a randomly selected vertex with degree k decays as a power-law, following P(k) ∼k-γ, where γ is the degree exponent, but also small-world property, which indicates that the typical distance between two uniform randomly chosen vertices grows proportionally to logarithm of the order of N(t , 4) , namely, relatively shorter diameter and lower average path length, simultaneously displays higher clustering coefficient. Next, as a new topological parameter correlating to reliability, synchronization capability and diffusion properties of networks, the number of spanning trees over a network is studied in more detail, an exact analytical solution for the number of spanning trees of the N(t , 4) is obtained. Based on the network-operation, part hub-vertex linking with each other will be helpful for structuring various network models and investigating the rules related with real-life networks.

  8. Link prediction in weighted networks

    DEFF Research Database (Denmark)

    Wind, David Kofoed; Mørup, Morten

    2012-01-01

    Many complex networks feature relations with weight information. Some models utilize this information while other ignore the weight information when inferring the structure. In this paper we investigate if edge-weights when modeling real networks, carry important information about the network...... is to infer presence of edges, but that simpler models are better at inferring the actual weights....

  9. A recursive method for calculating the total number of spanning trees and its applications in self-similar small-world scale-free network models

    Science.gov (United States)

    Ma, Fei; Su, Jing; Yao, Bing

    2018-05-01

    The problem of determining and calculating the number of spanning trees of any finite graph (model) is a great challenge, and has been studied in various fields, such as discrete applied mathematics, theoretical computer science, physics, chemistry and the like. In this paper, firstly, thank to lots of real-life systems and artificial networks built by all kinds of functions and combinations among some simpler and smaller elements (components), we discuss some helpful network-operation, including link-operation and merge-operation, to design more realistic and complicated network models. Secondly, we present a method for computing the total number of spanning trees. As an accessible example, we apply this method to space of trees and cycles respectively, and our results suggest that it is indeed a better one for such models. In order to reflect more widely practical applications and potentially theoretical significance, we study the enumerating method in some existing scale-free network models. On the other hand, we set up a class of new models displaying scale-free feature, that is to say, following P(k) k-γ, where γ is the degree exponent. Based on detailed calculation, the degree exponent γ of our deterministic scale-free models satisfies γ > 3. In the rest of our discussions, we not only calculate analytically the solutions of average path length, which indicates our models have small-world property being prevailing in amounts of complex systems, but also derive the number of spanning trees by means of the recursive method described in this paper, which clarifies our method is convenient to research these models.

  10. Multilevel Evolutionary Algorithm that Optimizes the Structure of Scale-Free Networks for the Promotion of Cooperation in the Prisoner's Dilemma game.

    Science.gov (United States)

    Liu, Penghui; Liu, Jing

    2017-06-28

    Understanding the emergence of cooperation has long been a challenge across disciplines. Even if network reciprocity reflected the importance of population structure in promoting cooperation, it remains an open question how population structures can be optimized, thereby enhancing cooperation. In this paper, we attempt to apply the evolutionary algorithm (EA) to solve this highly complex problem. However, as it is hard to evaluate the fitness (cooperation level) of population structures, simply employing the canonical evolutionary algorithm (EA) may fail in optimization. Thus, we propose a new EA variant named mlEA-C PD -SFN to promote the cooperation level of scale-free networks (SFNs) in the Prisoner's Dilemma Game (PDG). Meanwhile, to verify the preceding conclusions may not be applied to this problem, we also provide the optimization results of the comparative experiment (EA cluster ), which optimizes the clustering coefficient of structures. Even if preceding research concluded that highly clustered scale-free networks enhance cooperation, we find EA cluster does not perform desirably, while mlEA-C PD -SFN performs efficiently in different optimization environments. We hope that mlEA-C PD -SFN may help promote the structure of species in nature and that more general properties that enhance cooperation can be learned from the output structures.

  11. A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters

    Science.gov (United States)

    Ma, Fei; Su, Jing; Hao, Yongxing; Yao, Bing; Yan, Guanghui

    2018-02-01

    The problem of uncovering the internal operating function of network models is intriguing, demanded and attractive in researches of complex networks. Notice that, in the past two decades, a great number of artificial models are built to try to answer the above mentioned task. Based on the different growth ways, these previous models can be divided into two categories, one type, possessing the preferential attachment, follows a power-law P(k) ∼k-γ, 2 motivated from a new attachment way, vertex-edge-growth network-operation, more precisely, the couple of both them. We report that this model is sparse, small world and hierarchical. And then, not only is scale-free feature in our model, but also lies the degree parameter γ(≈ 3 . 242) out the typical range. Note that, we suggest that the coexistence of multiple vertex growth ways will have a prominent effect on the power-law parameter γ, and the preferential attachment plays a dominate role on the development of networks over time. At the end of this paper, we obtain an exact analytical expression for the total number of spanning trees of models and also capture spanning trees entropy which we have compared with those of their corresponding component elements.

  12. Multiple coherence resonances and synchronization transitions by time delay in adaptive scale-free neuronal networks with spike-timing-dependent plasticity

    International Nuclear Information System (INIS)

    Xie, Huijuan; Gong, Yubing

    2017-01-01

    In this paper, we numerically study the effect of spike-timing-dependent plasticity (STDP) on multiple coherence resonances (MCR) and synchronization transitions (ST) induced by time delay in adaptive scale-free Hodgkin–Huxley neuronal networks. It is found that STDP has a big influence on MCR and ST induced by time delay and on the effect of network average degree on the MCR and ST. MCR is enhanced or suppressed as the adjusting rate A p of STDP decreases or increases, and there is optimal A p by which ST becomes strongest. As network average degree 〈k〉 increases, ST is enhanced and there is optimal 〈k〉 at which MCR becomes strongest. Moreover, for a larger A p value, ST is enhanced more rapidly with increasing 〈k〉 and the optimal 〈k〉 for MCR increases. These results show that STDP can either enhance or suppress MCR, and there is optimal STDP that can most strongly enhance ST induced by time delay in the adaptive neuronal networks. These findings could find potential implication for the information processing and transmission in neural systems.

  13. Efficient weighting strategy for enhancing synchronizability of complex networks

    Science.gov (United States)

    Wang, Youquan; Yu, Feng; Huang, Shucheng; Tu, Juanjuan; Chen, Yan

    2018-04-01

    Networks with high propensity to synchronization are desired in many applications ranging from biology to engineering. In general, there are two ways to enhance the synchronizability of a network: link rewiring and/or link weighting. In this paper, we propose a new link weighting strategy based on the concept of the neighborhood subgroup. The neighborhood subgroup of a node i through node j in a network, i.e. Gi→j, means that node u belongs to Gi→j if node u belongs to the first-order neighbors of j (not include i). Our proposed weighting schema used the local and global structural properties of the networks such as the node degree, betweenness centrality and closeness centrality measures. We applied the method on scale-free and Watts-Strogatz networks of different structural properties and show the good performance of the proposed weighting scheme. Furthermore, as model networks cannot capture all essential features of real-world complex networks, we considered a number of undirected and unweighted real-world networks. To the best of our knowledge, the proposed weighting strategy outperformed the previously published weighting methods by enhancing the synchronizability of these real-world networks.

  14. Mixed random walks with a trap in scale-free networks including nearest-neighbor and next-nearest-neighbor jumps

    Science.gov (United States)

    Zhang, Zhongzhi; Dong, Yuze; Sheng, Yibin

    2015-10-01

    Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm; however, related theoretical results are much less for this dynamical process. In this paper, we present a study of mixed random walks in a family of fractal scale-free networks, where both nearest-neighbor and next-nearest-neighbor jumps are included. We focus on trapping problem in the network family, which is a particular case of random walks with a perfect trap fixed at the central high-degree node. We derive analytical expressions for the average trapping time (ATT), a quantitative indicator measuring the efficiency of the trapping process, by using two different methods, the results of which are consistent with each other. Furthermore, we analytically determine all the eigenvalues and their multiplicities for the fundamental matrix characterizing the dynamical process. Our results show that although next-nearest-neighbor jumps have no effect on the leading scaling of the trapping efficiency, they can strongly affect the prefactor of ATT, providing insight into better understanding of random-walk process in complex systems.

  15. Centrality measures for immunization of weighted networks

    Directory of Open Access Journals (Sweden)

    Mohammad Khansari

    2016-03-01

    Full Text Available Effective immunization of individual communities with minimal cost in vaccination has made great discussion surrounding the realm of complex networks. Meanwhile, proper realization of relationship among people in society and applying it to social networks brings about substantial improvements in immunization. Accordingly, weighted graph in which link weights represent the intensity and intimacy of relationships is an acceptable approach. In this work we employ weighted graphs and a wide variety of weighted centrality measures to distinguish important individuals in contagion of diseases. Furthermore, we propose new centrality measures for weighted networks. Our experimental results show that Radiality-Degree centrality is satisfying for weighted BA networks. Additionally, PageRank-Degree and Radiality-Degree centralities showmoreacceptable performance in targeted immunization of weighted networks.

  16. s-core network decomposition: A generalization of k-core analysis to weighted networks

    Science.gov (United States)

    Eidsaa, Marius; Almaas, Eivind

    2013-12-01

    A broad range of systems spanning biology, technology, and social phenomena may be represented and analyzed as complex networks. Recent studies of such networks using k-core decomposition have uncovered groups of nodes that play important roles. Here, we present s-core analysis, a generalization of k-core (or k-shell) analysis to complex networks where the links have different strengths or weights. We demonstrate the s-core decomposition approach on two random networks (ER and configuration model with scale-free degree distribution) where the link weights are (i) random, (ii) correlated, and (iii) anticorrelated with the node degrees. Finally, we apply the s-core decomposition approach to the protein-interaction network of the yeast Saccharomyces cerevisiae in the context of two gene-expression experiments: oxidative stress in response to cumene hydroperoxide (CHP), and fermentation stress response (FSR). We find that the innermost s-cores are (i) different from innermost k-cores, (ii) different for the two stress conditions CHP and FSR, and (iii) enriched with proteins whose biological functions give insight into how yeast manages these specific stresses.

  17. Evolution of weighted complex bus transit networks with flow

    Science.gov (United States)

    Huang, Ailing; Xiong, Jie; Shen, Jinsheng; Guan, Wei

    2016-02-01

    Study on the intrinsic properties and evolutional mechanism of urban public transit networks (PTNs) has great significance for transit planning and control, particularly considering passengers’ dynamic behaviors. This paper presents an empirical analysis for exploring the complex properties of Beijing’s weighted bus transit network (BTN) based on passenger flow in L-space, and proposes a bi-level evolution model to simulate the development of transit routes from the view of complex network. The model is an iterative process that is driven by passengers’ travel demands and dual-controlled interest mechanism, which is composed of passengers’ spatio-temporal requirements and cost constraint of transit agencies. Also, the flow’s dynamic behaviors, including the evolutions of travel demand, sectional flow attracted by a new link and flow perturbation triggered in nearby routes, are taken into consideration in the evolutional process. We present the numerical experiment to validate the model, where the main parameters are estimated by using distribution functions that are deduced from real-world data. The results obtained have proven that our model can generate a BTN with complex properties, such as the scale-free behavior or small-world phenomenon, which shows an agreement with our empirical results. Our study’s results can be exploited to optimize the real BTN’s structure and improve the network’s robustness.

  18. Generating hierarchical scale free-graphs from fractals

    NARCIS (Netherlands)

    Komjáthy, J.; Simon, K.

    2011-01-01

    Motivated by the hierarchial network model of E. Ravasz, A.-L. Barabási, and T. Vicsek, we introduce deterministic scale-free networks derived from a graph directed self-similar fractal ¿. With rigorous mathematical results we verify that our model captures some of the most important features of

  19. Weight-Control Information Network

    Science.gov (United States)

    ... Kidney Disease Weight Management Liver Disease Urologic Diseases Endocrine Diseases Diet & Nutrition Blood Diseases Diagnostic Tests La información ... Kidney Disease Weight Management Liver Disease Urologic Diseases Endocrine Diseases Diet & Nutrition Blood Diseases Diagnostic Tests La información ...

  20. Adaptive Learning in Weighted Network Games

    NARCIS (Netherlands)

    Bayer, Péter; Herings, P. Jean-Jacques; Peeters, Ronald; Thuijsman, Frank

    2017-01-01

    This paper studies adaptive learning in the class of weighted network games. This class of games includes applications like research and development within interlinked firms, crime within social networks, the economics of pollution, and defense expenditures within allied nations. We show that for

  1. Epidemic spreading on weighted complex networks

    International Nuclear Information System (INIS)

    Sun, Ye; Liu, Chuang; Zhang, Chu-Xu; Zhang, Zi-Ke

    2014-01-01

    Nowadays, the emergence of online services provides various multi-relation information to support the comprehensive understanding of the epidemic spreading process. In this Letter, we consider the edge weights to represent such multi-role relations. In addition, we perform detailed analysis of two representative metrics, outbreak threshold and epidemic prevalence, on SIS and SIR models. Both theoretical and simulation results find good agreements with each other. Furthermore, experiments show that, on fully mixed networks, the weight distribution on edges would not affect the epidemic results once the average weight of whole network is fixed. This work may shed some light on the in-depth understanding of epidemic spreading on multi-relation and weighted networks.

  2. Epidemic spreading on weighted complex networks

    Energy Technology Data Exchange (ETDEWEB)

    Sun, Ye [Institute of Information Economy, Hangzhou Normal University, Hangzhou 311121 (China); Alibaba Research Center of Complexity Science, Hangzhou Normal University, Hangzhou 311121 (China); Liu, Chuang, E-mail: liuchuang@hznu.edu.cn [Institute of Information Economy, Hangzhou Normal University, Hangzhou 311121 (China); Alibaba Research Center of Complexity Science, Hangzhou Normal University, Hangzhou 311121 (China); Zhang, Chu-Xu [Institute of Information Economy, Hangzhou Normal University, Hangzhou 311121 (China); Alibaba Research Center of Complexity Science, Hangzhou Normal University, Hangzhou 311121 (China); Zhang, Zi-Ke, E-mail: zhangzike@gmail.com [Institute of Information Economy, Hangzhou Normal University, Hangzhou 311121 (China); Alibaba Research Center of Complexity Science, Hangzhou Normal University, Hangzhou 311121 (China)

    2014-01-31

    Nowadays, the emergence of online services provides various multi-relation information to support the comprehensive understanding of the epidemic spreading process. In this Letter, we consider the edge weights to represent such multi-role relations. In addition, we perform detailed analysis of two representative metrics, outbreak threshold and epidemic prevalence, on SIS and SIR models. Both theoretical and simulation results find good agreements with each other. Furthermore, experiments show that, on fully mixed networks, the weight distribution on edges would not affect the epidemic results once the average weight of whole network is fixed. This work may shed some light on the in-depth understanding of epidemic spreading on multi-relation and weighted networks.

  3. Weighted tunable clustering in local-world networks with increment behavior

    International Nuclear Information System (INIS)

    Ma, Ying-Hong; Li, Huijia; Zhang, Xiao-Dong

    2010-01-01

    Since some realistic networks are influenced not only by increment behavior but also by the tunable clustering mechanism with new nodes to be added to networks, it is interesting to characterize the model for those actual networks. In this paper, a weighted local-world model, which incorporates increment behavior and the tunable clustering mechanism, is proposed and its properties are investigated, such as degree distribution and clustering coefficient. Numerical simulations are fitted to the model and also display good right-skewed scale-free properties. Furthermore, the correlation of vertices in our model is studied which shows the assortative property. The epidemic spreading process by weighted transmission rate on the model shows that the tunable clustering behavior has a great impact on the epidemic dynamic

  4. Asymmetric network connectivity using weighted harmonic averages

    Science.gov (United States)

    Morrison, Greg; Mahadevan, L.

    2011-02-01

    We propose a non-metric measure of the "closeness" felt between two nodes in an undirected, weighted graph using a simple weighted harmonic average of connectivity, that is a real-valued Generalized Erdös Number (GEN). While our measure is developed with a collaborative network in mind, the approach can be of use in a variety of artificial and real-world networks. We are able to distinguish between network topologies that standard distance metrics view as identical, and use our measure to study some simple analytically tractable networks. We show how this might be used to look at asymmetry in authorship networks such as those that inspired the integer Erdös numbers in mathematical coauthorships. We also show the utility of our approach to devise a ratings scheme that we apply to the data from the NetFlix prize, and find a significant improvement using our method over a baseline.

  5. Weighted Complex Network Analysis of Pakistan Highways

    Directory of Open Access Journals (Sweden)

    Yasir Tariq Mohmand

    2013-01-01

    Full Text Available The structure and properties of public transportation networks have great implications in urban planning, public policies, and infectious disease control. This study contributes a weighted complex network analysis of travel routes on the national highway network of Pakistan. The network is responsible for handling 75 percent of the road traffic yet is largely inadequate, poor, and unreliable. The highway network displays small world properties and is assortative in nature. Based on the betweenness centrality of the nodes, the most important cities are identified as this could help in identifying the potential congestion points in the network. Keeping in view the strategic location of Pakistan, such a study is of practical importance and could provide opportunities for policy makers to improve the performance of the highway network.

  6. Second Parrondo's Paradox in Scale Free Networks

    OpenAIRE

    Toyota, Norihito

    2012-01-01

    Parrondo's paradox occurs in sequences of games in which a winning expectation value of a payoff may be obtained by playing two games in a random order, even though each game in the sequence may be lost when played individually.Several variations of Parrondo's games apparently with the same paradoxical property have been introduced by G.P. Harmer and D. Abbott; history dependence, one dimensional line, two dimensional lattice and so on. I have shown that Parrondo's paradox does not occur in s...

  7. Generating hierarchial scale-free graphs from fractals

    Energy Technology Data Exchange (ETDEWEB)

    Komjathy, Julia, E-mail: komyju@math.bme.hu [Department of Stochastics, Institute of Mathematics, Technical University of Budapest, H-1529 P.O. Box 91 (Hungary); Simon, Karoly, E-mail: simonk@math.bme.hu [Department of Stochastics, Institute of Mathematics, Technical University of Budapest, H-1529 P.O. Box 91 (Hungary)

    2011-08-15

    Highlights: > We generate deterministic scale-free networks using graph-directed self similar IFS. > Our model exhibits similar clustering, power law decay properties to real networks. > The average length of shortest path and the diameter of the graph are determined. > Using this model, we generate random graphs with prescribed power law exponent. - Abstract: Motivated by the hierarchial network model of E. Ravasz, A.-L. Barabasi, and T. Vicsek, we introduce deterministic scale-free networks derived from a graph directed self-similar fractal {Lambda}. With rigorous mathematical results we verify that our model captures some of the most important features of many real networks: the scale-free and the high clustering properties. We also prove that the diameter is the logarithm of the size of the system. We point out a connection between the power law exponent of the degree distribution and some intrinsic geometric measure theoretical properties of the underlying fractal. Using our (deterministic) fractal {Lambda} we generate random graph sequence sharing similar properties.

  8. Discrete scale-free distributions and associated limit theorems

    International Nuclear Information System (INIS)

    Hopcraft, K I; Jakeman, E; Matthews, J O

    2004-01-01

    Consideration is given to the convergence properties of sums of identical, independently distributed random variables drawn from a class of discrete distributions with power-law tails, which are relevant to scale-free networks. Different limiting distributions, and rates of convergence to these limits, are identified and depend on the index of the tail. For indices ≥2, the topology evolves to a random Poisson network, but the rate of convergence can be extraordinarily slow and unlikely to be yet evident for the current size of the WWW for example. It is shown that treating discrete scale-free behaviour with continuum or mean-field approximations can lead to incorrect results. (letter to the editor)

  9. Topology dependent epidemic spreading velocity in weighted networks

    International Nuclear Information System (INIS)

    Duan, Wei; Qiu, Xiaogang; Quax, Rick; Lees, Michael; Sloot, Peter M A

    2014-01-01

    Many diffusive processes occur on structured networks with weighted links, such as disease spread by airplane transport or information diffusion in social networks or blogs. Understanding the impact of weight-connectivity correlations on epidemic spreading in weighted networks is crucial to support decision-making on disease control and other diffusive processes. However, a real understanding of epidemic spreading velocity in weighted networks is still lacking. Here we conduct a numerical study of the velocity of a Reed–Frost epidemic spreading process in various weighted network topologies as a function of the correlations between edge weights and node degrees. We find that a positive weight-connectivity correlation leads to a faster epidemic spreading compared to an unweighted network. In contrast, we find that both uncorrelated and negatively correlated weight distributions lead to slower spreading processes. In the case of positive weight-connectivity correlations, the acceleration of spreading velocity is weak when the heterogeneity of weight distribution increases. (paper)

  10. Topology dependent epidemic spreading velocity in weighted networks

    NARCIS (Netherlands)

    Duan, W.; Quax, R.; Lees, M.; Qiu, X.; Sloot, P.M.A.

    2014-01-01

    Many diffusive processes occur on structured networks with weighted links, such as disease spread by airplane transport or information diffusion in social networks or blogs. Understanding the impact of weight-connectivity correlations on epidemic spreading in weighted networks is crucial to support

  11. The International Trade Network: weighted network analysis and modelling

    International Nuclear Information System (INIS)

    Bhattacharya, K; Mukherjee, G; Manna, S S; Saramäki, J; Kaski, K

    2008-01-01

    Tools of the theory of critical phenomena, namely the scaling analysis and universality, are argued to be applicable to large complex web-like network structures. Using a detailed analysis of the real data of the International Trade Network we argue that the scaled link weight distribution has an approximate log-normal distribution which remains robust over a period of 53 years. Another universal feature is observed in the power-law growth of the trade strength with gross domestic product, the exponent being similar for all countries. Using the 'rich-club' coefficient measure of the weighted networks it has been shown that the size of the rich-club controlling half of the world's trade is actually shrinking. While the gravity law is known to describe well the social interactions in the static networks of population migration, international trade, etc, here for the first time we studied a non-conservative dynamical model based on the gravity law which excellently reproduced many empirical features of the ITN

  12. Overlapping community detection in weighted networks via a Bayesian approach

    Science.gov (United States)

    Chen, Yi; Wang, Xiaolong; Xiang, Xin; Tang, Buzhou; Chen, Qingcai; Fan, Shixi; Bu, Junzhao

    2017-02-01

    Complex networks as a powerful way to represent complex systems have been widely studied during the past several years. One of the most important tasks of complex network analysis is to detect communities embedded in networks. In the real world, weighted networks are very common and may contain overlapping communities where a node is allowed to belong to multiple communities. In this paper, we propose a novel Bayesian approach, called the Bayesian mixture network (BMN) model, to detect overlapping communities in weighted networks. The advantages of our method are (i) providing soft-partition solutions in weighted networks; (ii) providing soft memberships, which quantify 'how strongly' a node belongs to a community. Experiments on a large number of real and synthetic networks show that our model has the ability in detecting overlapping communities in weighted networks and is competitive with other state-of-the-art models at shedding light on community partition.

  13. Perturbation results for the Estrada index in weighted networks

    Energy Technology Data Exchange (ETDEWEB)

    Shang Yilun, E-mail: shylmath@hotmail.com [Institute for Cyber Security, University of Texas at San Antonio, San Antonio, TX 78249 (United States)

    2011-02-18

    The logarithm of the Estrada index has been proposed recently as a spectral measure to character efficiently the robustness of complex networks. In this paper, we explore the Estrada index in weighted networks and develop various perturbation results based on spectral graph theory. It is shown that the robustness of a network may be enhanced even when some edge weights are reduced. This is of particular theoretical and practical significance to network design and optimization.

  14. Perturbation results for the Estrada index in weighted networks

    International Nuclear Information System (INIS)

    Shang Yilun

    2011-01-01

    The logarithm of the Estrada index has been proposed recently as a spectral measure to character efficiently the robustness of complex networks. In this paper, we explore the Estrada index in weighted networks and develop various perturbation results based on spectral graph theory. It is shown that the robustness of a network may be enhanced even when some edge weights are reduced. This is of particular theoretical and practical significance to network design and optimization.

  15. Particle swarm optimization with scale-free interactions.

    Directory of Open Access Journals (Sweden)

    Chen Liu

    Full Text Available The particle swarm optimization (PSO algorithm, in which individuals collaborate with their interacted neighbors like bird flocking to search for the optima, has been successfully applied in a wide range of fields pertaining to searching and convergence. Here we employ the scale-free network to represent the inter-individual interactions in the population, named SF-PSO. In contrast to the traditional PSO with fully-connected topology or regular topology, the scale-free topology used in SF-PSO incorporates the diversity of individuals in searching and information dissemination ability, leading to a quite different optimization process. Systematic results with respect to several standard test functions demonstrate that SF-PSO gives rise to a better balance between the convergence speed and the optimum quality, accounting for its much better performance than that of the traditional PSO algorithms. We further explore the dynamical searching process microscopically, finding that the cooperation of hub nodes and non-hub nodes play a crucial role in optimizing the convergence process. Our work may have implications in computational intelligence and complex networks.

  16. Weighted Networks at the Polish Market

    Science.gov (United States)

    Chmiel, A. M.; Sienkiewicz, J.; Suchecki, K.; Hołyst, J. A.

    During the last few years various models of networks [1,2] have become a powerful tool for analysis of complex systems in such distant fields as Internet [3], biology [4], social groups [5], ecology [6] and public transport [7]. Modeling behavior of economical agents is a challenging issue that has also been studied from a network point of view. The examples of such studies are models of financial networks [8], supply chains [9, 10], production networks [11], investment networks [12] or collective bank bankrupcies [13, 14]. Relations between different companies have been already analyzed using several methods: as networks of shareholders [15], networks of correlations between stock prices [16] or networks of board directors [17]. In several cases scaling laws for network characteristics have been observed.

  17. Average weighted receiving time in recursive weighted Koch networks

    Indian Academy of Sciences (India)

    Zhenjiang, 212013, People's Republic of China. ∗ ... The properties of a graph can be expressed via its adjacency matrix aij , whose elements take the ... For example, take the worldwide airport networks, where the number of sched- ..... This research is supported by the Humanistic and Social Science Foundation from the.

  18. Comparative empirical analysis of flow-weighted transit route networks in R-space and evolution modeling

    Science.gov (United States)

    Huang, Ailing; Zang, Guangzhi; He, Zhengbing; Guan, Wei

    2017-05-01

    Urban public transit system is a typical mixed complex network with dynamic flow, and its evolution should be a process coupling topological structure with flow dynamics, which has received little attention. This paper presents the R-space to make a comparative empirical analysis on Beijing’s flow-weighted transit route network (TRN) and we found that both the Beijing’s TRNs in the year of 2011 and 2015 exhibit the scale-free properties. As such, we propose an evolution model driven by flow to simulate the development of TRNs with consideration of the passengers’ dynamical behaviors triggered by topological change. The model simulates that the evolution of TRN is an iterative process. At each time step, a certain number of new routes are generated driven by travel demands, which leads to dynamical evolution of new routes’ flow and triggers perturbation in nearby routes that will further impact the next round of opening new routes. We present the theoretical analysis based on the mean-field theory, as well as the numerical simulation for this model. The results obtained agree well with our empirical analysis results, which indicate that our model can simulate the TRN evolution with scale-free properties for distributions of node’s strength and degree. The purpose of this paper is to illustrate the global evolutional mechanism of transit network that will be used to exploit planning and design strategies for real TRNs.

  19. A scale-free structure prior for graphical models with applications in functional genomics.

    Directory of Open Access Journals (Sweden)

    Paul Sheridan

    Full Text Available The problem of reconstructing large-scale, gene regulatory networks from gene expression data has garnered considerable attention in bioinformatics over the past decade with the graphical modeling paradigm having emerged as a popular framework for inference. Analysis in a full Bayesian setting is contingent upon the assignment of a so-called structure prior-a probability distribution on networks, encoding a priori biological knowledge either in the form of supplemental data or high-level topological features. A key topological consideration is that a wide range of cellular networks are approximately scale-free, meaning that the fraction, , of nodes in a network with degree is roughly described by a power-law with exponent between and . The standard practice, however, is to utilize a random structure prior, which favors networks with binomially distributed degree distributions. In this paper, we introduce a scale-free structure prior for graphical models based on the formula for the probability of a network under a simple scale-free network model. Unlike the random structure prior, its scale-free counterpart requires a node labeling as a parameter. In order to use this prior for large-scale network inference, we design a novel Metropolis-Hastings sampler for graphical models that includes a node labeling as a state space variable. In a simulation study, we demonstrate that the scale-free structure prior outperforms the random structure prior at recovering scale-free networks while at the same time retains the ability to recover random networks. We then estimate a gene association network from gene expression data taken from a breast cancer tumor study, showing that scale-free structure prior recovers hubs, including the previously unknown hub SLC39A6, which is a zinc transporter that has been implicated with the spread of breast cancer to the lymph nodes. Our analysis of the breast cancer expression data underscores the value of the scale-free

  20. A Weighted Evolving Network with Community Size Preferential Attachment

    International Nuclear Information System (INIS)

    Zhuo Zhiwei; Shan Erfang

    2010-01-01

    Community structure is an important characteristic in real complex network. It is a network consists of groups of nodes within which links are dense but among which links are sparse. In this paper, the evolving network include node, link and community growth and we apply the community size preferential attachment and strength preferential attachment to a growing weighted network model and utilize weight assigning mechanism from BBV model. The resulting network reflects the intrinsic community structure with generalized power-law distributions of nodes' degrees and strengths.

  1. English and Chinese languages as weighted complex networks

    Science.gov (United States)

    Sheng, Long; Li, Chunguang

    2009-06-01

    In this paper, we analyze statistical properties of English and Chinese written human language within the framework of weighted complex networks. The two language networks are based on an English novel and a Chinese biography, respectively, and both of the networks are constructed in the same way. By comparing the intensity and density of connections between the two networks, we find that high weight connections in Chinese language networks prevail more than those in English language networks. Furthermore, some of the topological and weighted quantities are compared. The results display some differences in the structural organizations between the two language networks. These observations indicate that the two languages may have different linguistic mechanisms and different combinatorial natures.

  2. Weighted Complex Network Analysis of Shanghai Rail Transit System

    Directory of Open Access Journals (Sweden)

    Yingying Xing

    2016-01-01

    Full Text Available With increasing passenger flows and construction scale, Shanghai rail transit system (RTS has entered a new era of networking operation. In addition, the structure and properties of the RTS network have great implications for urban traffic planning, design, and management. Thus, it is necessary to acquire their network properties and impacts. In this paper, the Shanghai RTS, as well as passenger flows, will be investigated by using complex network theory. Both the topological and dynamic properties of the RTS network are analyzed and the largest connected cluster is introduced to assess the reliability and robustness of the RTS network. Simulation results show that the distribution of nodes strength exhibits a power-law behavior and Shanghai RTS network shows a strong weighted rich-club effect. This study also indicates that the intentional attacks are more detrimental to the RTS network than to the random weighted network, but the random attacks can cause slightly more damage to the random weighted network than to the RTS network. Our results provide a richer view of complex weighted networks in real world and possibilities of risk analysis and policy decisions for the RTS operation department.

  3. A high-level and scalable approach for generating scale-free graphs using active objects

    NARCIS (Netherlands)

    K. Azadbakht (Keyvan); N. Bezirgiannis (Nikolaos); F.S. de Boer (Frank); Aliakbary, S. (Sadegh)

    2016-01-01

    textabstractThe Barabasi-Albert model (BA) is designed to generate scale-free networks using the preferential attachment mechanism. In the preferential attachment (PA) model, new nodes are sequentially introduced to the network and they attach preferentially to existing nodes. PA is a classical

  4. Scale-free music of the brain.

    Directory of Open Access Journals (Sweden)

    Dan Wu

    Full Text Available BACKGROUND: There is growing interest in the relation between the brain and music. The appealing similarity between brainwaves and the rhythms of music has motivated many scientists to seek a connection between them. A variety of transferring rules has been utilized to convert the brainwaves into music; and most of them are mainly based on spectra feature of EEG. METHODOLOGY/PRINCIPAL FINDINGS: In this study, audibly recognizable scale-free music was deduced from individual Electroencephalogram (EEG waveforms. The translation rules include the direct mapping from the period of an EEG waveform to the duration of a note, the logarithmic mapping of the change of average power of EEG to music intensity according to the Fechner's law, and a scale-free based mapping from the amplitude of EEG to music pitch according to the power law. To show the actual effect, we applied the deduced sonification rules to EEG segments recorded during rapid-eye movement sleep (REM and slow-wave sleep (SWS. The resulting music is vivid and different between the two mental states; the melody during REM sleep sounds fast and lively, whereas that in SWS sleep is slow and tranquil. 60 volunteers evaluated 25 music pieces, 10 from REM, 10 from SWS and 5 from white noise (WN, 74.3% experienced a happy emotion from REM and felt boring and drowsy when listening to SWS, and the average accuracy for all the music pieces identification is 86.8%(kappa = 0.800, P<0.001. We also applied the method to the EEG data from eyes closed, eyes open and epileptic EEG, and the results showed these mental states can be identified by listeners. CONCLUSIONS/SIGNIFICANCE: The sonification rules may identify the mental states of the brain, which provide a real-time strategy for monitoring brain activities and are potentially useful to neurofeedback therapy.

  5. Neutral Theory and Scale-Free Neural Dynamics

    Science.gov (United States)

    Martinello, Matteo; Hidalgo, Jorge; Maritan, Amos; di Santo, Serena; Plenz, Dietmar; Muñoz, Miguel A.

    2017-10-01

    Neural tissues have been consistently observed to be spontaneously active and to generate highly variable (scale-free distributed) outbursts of activity in vivo and in vitro. Understanding whether these heterogeneous patterns of activity stem from the underlying neural dynamics operating at the edge of a phase transition is a fascinating possibility, as criticality has been argued to entail many possible important functional advantages in biological computing systems. Here, we employ a well-accepted model for neural dynamics to elucidate an alternative scenario in which diverse neuronal avalanches, obeying scaling, can coexist simultaneously, even if the network operates in a regime far from the edge of any phase transition. We show that perturbations to the system state unfold dynamically according to a "neutral drift" (i.e., guided only by stochasticity) with respect to the background of endogenous spontaneous activity, and that such a neutral dynamics—akin to neutral theories of population genetics and of biogeography—implies marginal propagation of perturbations and scale-free distributed causal avalanches. We argue that causal information, not easily accessible to experiments, is essential to elucidate the nature and statistics of neural avalanches, and that neutral dynamics is likely to play an important role in the cortex functioning. We discuss the implications of these findings to design new empirical approaches to shed further light on how the brain processes and stores information.

  6. Weighted Evolving Networks with Self-organized Communities

    International Nuclear Information System (INIS)

    Xie Zhou; Wang Xiaofan; Li Xiang

    2008-01-01

    In order to describe the self-organization of communities in the evolution of weighted networks, we propose a new evolving model for weighted community-structured networks with the preferential mechanisms functioned in different levels according to community sizes and node strengths, respectively. Theoretical analyses and numerical simulations show that our model captures power-law distributions of community sizes, node strengths, and link weights, with tunable exponents of ν ≥ 1, γ > 2, and α > 2, respectively, sharing large clustering coefficients and scaling clustering spectra, and covering the range from disassortative networks to assortative networks. Finally, we apply our new model to the scientific co-authorship networks with both their weighted and unweighted datasets to verify its effectiveness

  7. Using Incomplete Information for Complete Weight Annotation of Road Networks

    DEFF Research Database (Denmark)

    Yang, Bin; Kaul, Manohar; Jensen, Christian Søndergaard

    2014-01-01

    to solve the problem. Specifically, the problem is modeled as a regression problem and solved by minimizing a judiciously designed objective function that takes into account the topology of the road network. In particular, the use of weighted PageRank values of edges is explored for assigning appropriate...... weights to all edges, and the property of directional adjacency of edges is also taken into account to assign weights. Empirical studies with weights capturing travel time and GHG emissions on two road networks (Skagen, Denmark, and North Jutland, Denmark) offer insight into the design properties...

  8. Using Incomplete Information for Complete Weight Annotation of Road Networks

    DEFF Research Database (Denmark)

    Yang, Bin; Kaul, Manohar; Jensen, Christian S.

    2014-01-01

    ground-truth travel cost. A general framework is proposed to solve the problem. Specifically, the problem is modeled as a regression problem and solved by minimizing a judiciously designed objective function that takes into account the topology of the road network. In particular, the use of weighted Page......Rank values of edges is explored for assigning appropriate weights to all edges, and the property of directional adjacency of edges is also taken into account to assign weights. Empirical studies with weights capturing travel time and GHG emissions on two road networks offer insight into the design properties...

  9. Betweenness-based algorithm for a partition scale-free graph

    International Nuclear Information System (INIS)

    Zhang Bai-Da; Wu Jun-Jie; Zhou Jing; Tang Yu-Hua

    2011-01-01

    Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom—up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top—down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches. (interdisciplinary physics and related areas of science and technology)

  10. WGCNA: an R package for weighted correlation network analysis.

    Science.gov (United States)

    Langfelder, Peter; Horvath, Steve

    2008-12-29

    Correlation networks are increasingly being used in bioinformatics applications. For example, weighted gene co-expression network analysis is a systems biology method for describing the correlation patterns among genes across microarray samples. Weighted correlation network analysis (WGCNA) can be used for finding clusters (modules) of highly correlated genes, for summarizing such clusters using the module eigengene or an intramodular hub gene, for relating modules to one another and to external sample traits (using eigengene network methodology), and for calculating module membership measures. Correlation networks facilitate network based gene screening methods that can be used to identify candidate biomarkers or therapeutic targets. These methods have been successfully applied in various biological contexts, e.g. cancer, mouse genetics, yeast genetics, and analysis of brain imaging data. While parts of the correlation network methodology have been described in separate publications, there is a need to provide a user-friendly, comprehensive, and consistent software implementation and an accompanying tutorial. The WGCNA R software package is a comprehensive collection of R functions for performing various aspects of weighted correlation network analysis. The package includes functions for network construction, module detection, gene selection, calculations of topological properties, data simulation, visualization, and interfacing with external software. Along with the R package we also present R software tutorials. While the methods development was motivated by gene expression data, the underlying data mining approach can be applied to a variety of different settings. The WGCNA package provides R functions for weighted correlation network analysis, e.g. co-expression network analysis of gene expression data. The R package along with its source code and additional material are freely available at http://www.genetics.ucla.edu/labs/horvath/CoexpressionNetwork/Rpackages/WGCNA.

  11. Label-based routing for a family of scale-free, modular, planar and unclustered graphs

    International Nuclear Information System (INIS)

    Comellas, Francesc; Miralles, Alicia

    2011-01-01

    We give an optimal labeling and routing algorithm for a family of scale-free, modular and planar graphs with zero clustering. The relevant properties of this family match those of some networks associated with technological and biological systems with a low clustering, including some electronic circuits and protein networks. The existence of an efficient routing protocol for this graph model should help when designing communication algorithms in real networks and also in the understanding of their dynamic processes.

  12. Classification of Company Performance using Weighted Probabilistic Neural Network

    Science.gov (United States)

    Yasin, Hasbi; Waridi Basyiruddin Arifin, Adi; Warsito, Budi

    2018-05-01

    Classification of company performance can be judged by looking at its financial status, whether good or bad state. Classification of company performance can be achieved by some approach, either parametric or non-parametric. Neural Network is one of non-parametric methods. One of Artificial Neural Network (ANN) models is Probabilistic Neural Network (PNN). PNN consists of four layers, i.e. input layer, pattern layer, addition layer, and output layer. The distance function used is the euclidean distance and each class share the same values as their weights. In this study used PNN that has been modified on the weighting process between the pattern layer and the addition layer by involving the calculation of the mahalanobis distance. This model is called the Weighted Probabilistic Neural Network (WPNN). The results show that the company's performance modeling with the WPNN model has a very high accuracy that reaches 100%.

  13. Degree and connectivity of the Internet's scale-free topology

    International Nuclear Information System (INIS)

    Zhang Lian-Ming; Wu Xiang-Sheng; Deng Xiao-Heng; Yu Jian-Ping

    2011-01-01

    This paper theoretically and empirically studies the degree and connectivity of the Internet's scale-free topology at an autonomous system (AS) level. The basic features of scale-free networks influence the normalization constant of degree distribution p(k). It develops a new mathematic model for describing the power-law relationships of Internet topology. From this model we theoretically obtain formulas to calculate the average degree, the ratios of the k min -degree (minimum degree) nodes and the k max -degree (maximum degree) nodes, and the fraction of the degrees (or links) in the hands of the richer (top best-connected) nodes. It finds that the average degree is larger for a smaller power-law exponent λ and a larger minimum or maximum degree. The ratio of the k min -degree nodes is larger for larger λ and smaller k min or k max . The ratio of the k max -degree ones is larger for smaller λ and k max or larger k min . The richer nodes hold most of the total degrees of Internet AS-level topology. In addition, it is revealed that the increased rate of the average degree or the ratio of the k min -degree nodes has power-law decay with the increase of k min . The ratio of the k max -degree nodes has a power-law decay with the increase of k max , and the fraction of the degrees in the hands of the richer 27% nodes is about 73% (the ‘73/27 rule’). Finally, empirically calculations are made, based on the empirical data extracted from the Border Gateway Protocol, of the average degree, ratio and fraction using this method and other methods, and find that this method is rigorous and effective for Internet AS-level topology. (interdisciplinary physics and related areas of science and technology)

  14. Epidemic spreading on contact networks with adaptive weights.

    Science.gov (United States)

    Zhu, Guanghu; Chen, Guanrong; Xu, Xin-Jian; Fu, Xinchu

    2013-01-21

    The heterogeneous patterns of interactions within a population are often described by contact networks, but the variety and adaptivity of contact strengths are usually ignored. This paper proposes a modified epidemic SIS model with a birth-death process and nonlinear infectivity on an adaptive and weighted contact network. The links' weights, named as 'adaptive weights', which indicate the intimacy or familiarity between two connected individuals, will reduce as the disease develops. Through mathematical and numerical analyses, conditions are established for population extermination, disease extinction and infection persistence. Particularly, it is found that the fixed weights setting can trigger the epidemic incidence, and that the adaptivity of weights cannot change the epidemic threshold but it can accelerate the disease decay and lower the endemic level. Finally, some corresponding control measures are suggested. Copyright © 2012 Elsevier Ltd. All rights reserved.

  15. Randomizing world trade. II. A weighted network analysis

    Science.gov (United States)

    Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego

    2011-10-01

    Based on the misleading expectation that weighted network properties always offer a more complete description than purely topological ones, current economic models of the International Trade Network (ITN) generally aim at explaining local weighted properties, not local binary ones. Here we complement our analysis of the binary projections of the ITN by considering its weighted representations. We show that, unlike the binary case, all possible weighted representations of the ITN (directed and undirected, aggregated and disaggregated) cannot be traced back to local country-specific properties, which are therefore of limited informativeness. Our two papers show that traditional macroeconomic approaches systematically fail to capture the key properties of the ITN. In the binary case, they do not focus on the degree sequence and hence cannot characterize or replicate higher-order properties. In the weighted case, they generally focus on the strength sequence, but the knowledge of the latter is not enough in order to understand or reproduce indirect effects.

  16. Mining Important Nodes in Directed Weighted Complex Networks

    Directory of Open Access Journals (Sweden)

    Yunyun Yang

    2017-01-01

    Full Text Available In complex networks, mining important nodes has been a matter of concern by scholars. In recent years, scholars have focused on mining important nodes in undirected unweighted complex networks. But most of the methods are not applicable to directed weighted complex networks. Therefore, this paper proposes a Two-Way-PageRank method based on PageRank for further discussion of mining important nodes in directed weighted complex networks. We have mainly considered the frequency of contact between nodes and the length of time of contact between nodes. We have considered the source of the nodes (in-degree and the whereabouts of the nodes (out-degree simultaneously. We have given node important performance indicators. Through numerical examples, we analyze the impact of variation of some parameters on node important performance indicators. Finally, the paper has verified the accuracy and validity of the method through empirical network data.

  17. Variable weight spectral amplitude coding for multiservice OCDMA networks

    Science.gov (United States)

    Seyedzadeh, Saleh; Rahimian, Farzad Pour; Glesk, Ivan; Kakaee, Majid H.

    2017-09-01

    The emergence of heterogeneous data traffic such as voice over IP, video streaming and online gaming have demanded networks with capability of supporting quality of service (QoS) at the physical layer with traffic prioritisation. This paper proposes a new variable-weight code based on spectral amplitude coding for optical code-division multiple-access (OCDMA) networks to support QoS differentiation. The proposed variable-weight multi-service (VW-MS) code relies on basic matrix construction. A mathematical model is developed for performance evaluation of VW-MS OCDMA networks. It is shown that the proposed code provides an optimal code length with minimum cross-correlation value when compared to other codes. Numerical results for a VW-MS OCDMA network designed for triple-play services operating at 0.622 Gb/s, 1.25 Gb/s and 2.5 Gb/s are considered.

  18. Investigating the Influence Relationship Models for Stocks in Indian Equity Market: A Weighted Network Modelling Study.

    Science.gov (United States)

    Bhattacharjee, Biplab; Shafi, Muhammad; Acharjee, Animesh

    2016-01-01

    The socio-economic systems today possess high levels of both interconnectedness and interdependencies, and such system-level relationships behave very dynamically. In such situations, it is all around perceived that influence is a perplexing power that has an overseeing part in affecting the dynamics and behaviours of involved ones. As a result of the force & direction of influence, the transformative change of one entity has a cogent aftereffect on the other entities in the system. The current study employs directed weighted networks for investigating the influential relationship patterns existent in a typical equity market as an outcome of inter-stock interactions happening at the market level, the sectorial level and the industrial level. The study dataset is derived from 335 constituent stocks of 'Standard & Poor Bombay Stock Exchange 500 index' and study period is 1st June 2005 to 30th June 2015. The study identifies the set of most dynamically influential stocks & their respective temporal pattern at three hierarchical levels: the complete equity market, different sectors, and constituting industry segments of those sectors. A detailed influence relationship analysis is performed for the sectorial level network of the construction sector, and it was found that stocks belonging to the cement industry possessed high influence within this sector. Also, the detailed network analysis of construction sector revealed that it follows scale-free characteristics and power law distribution. In the industry specific influence relationship analysis for cement industry, methods based on threshold filtering and minimum spanning tree were employed to derive a set of sub-graphs having temporally stable high-correlation structure over this ten years period.

  19. Unwinding the hairball graph: Pruning algorithms for weighted complex networks

    Science.gov (United States)

    Dianati, Navid

    2016-01-01

    Empirical networks of weighted dyadic relations often contain "noisy" edges that alter the global characteristics of the network and obfuscate the most important structures therein. Graph pruning is the process of identifying the most significant edges according to a generative null model and extracting the subgraph consisting of those edges. Here, we focus on integer-weighted graphs commonly arising when weights count the occurrences of an "event" relating the nodes. We introduce a simple and intuitive null model related to the configuration model of network generation and derive two significance filters from it: the marginal likelihood filter (MLF) and the global likelihood filter (GLF). The former is a fast algorithm assigning a significance score to each edge based on the marginal distribution of edge weights, whereas the latter is an ensemble approach which takes into account the correlations among edges. We apply these filters to the network of air traffic volume between US airports and recover a geographically faithful representation of the graph. Furthermore, compared with thresholding based on edge weight, we show that our filters extract a larger and significantly sparser giant component.

  20. Enhanced reconstruction of weighted networks from strengths and degrees

    International Nuclear Information System (INIS)

    Mastrandrea, Rossana; Fagiolo, Giorgio; Squartini, Tiziano; Garlaschelli, Diego

    2014-01-01

    Network topology plays a key role in many phenomena, from the spreading of diseases to that of financial crises. Whenever the whole structure of a network is unknown, one must resort to reconstruction methods that identify the least biased ensemble of networks consistent with the partial information available. A challenging case, frequently encountered due to privacy issues in the analysis of interbank flows and Big Data, is when there is only local (node-specific) aggregate information available. For binary networks, the relevant ensemble is one where the degree (number of links) of each node is constrained to its observed value. However, for weighted networks the problem is much more complicated. While the naïve approach prescribes to constrain the strengths (total link weights) of all nodes, recent counter-intuitive results suggest that in weighted networks the degrees are often more informative than the strengths. This implies that the reconstruction of weighted networks would be significantly enhanced by the specification of both strengths and degrees, a computationally hard and bias-prone procedure. Here we solve this problem by introducing an analytical and unbiased maximum-entropy method that works in the shortest possible time and does not require the explicit generation of reconstructed samples. We consider several real-world examples and show that, while the strengths alone give poor results, the additional knowledge of the degrees yields accurately reconstructed networks. Information-theoretic criteria rigorously confirm that the degree sequence, as soon as it is non-trivial, is irreducible to the strength sequence. Our results have strong implications for the analysis of motifs and communities and whenever the reconstructed ensemble is required as a null model to detect higher-order patterns

  1. Exponential stability of neural networks with asymmetric connection weights

    International Nuclear Information System (INIS)

    Yang Jinxiang; Zhong Shouming

    2007-01-01

    This paper investigates the exponential stability of a class of neural networks with asymmetric connection weights. By dividing the network state variables into various parts according to the characters of the neural networks, some new sufficient conditions of exponential stability are derived via constructing a Lyapunov function and using the method of the variation of constant. The new conditions are associated with the initial values and are described by some blocks of the interconnection matrix, and do not depend on other blocks. Examples are given to further illustrate the theory

  2. Controllability of Weighted and Directed Networks with Nonidentical Node Dynamics

    Directory of Open Access Journals (Sweden)

    Linying Xiang

    2013-01-01

    Full Text Available The concept of controllability from control theory is applied to weighted and directed networks with heterogenous linear or linearized node dynamics subject to exogenous inputs, where the nodes are grouped into leaders and followers. Under this framework, the controllability of the controlled network can be decomposed into two independent problems: the controllability of the isolated leader subsystem and the controllability of the extended follower subsystem. Some necessary and/or sufficient conditions for the controllability of the leader-follower network are derived based on matrix theory and graph theory. In particular, it is shown that a single-leader network is controllable if it is a directed path or cycle, but it is uncontrollable for a complete digraph or a star digraph in general. Furthermore, some approaches to improving the controllability of a heterogenous network are presented. Some simulation examples are given for illustration and verification.

  3. Model of community emergence in weighted social networks

    Science.gov (United States)

    Kumpula, J. M.; Onnela, J.-P.; Saramäki, J.; Kertész, J.; Kaski, K.

    2009-04-01

    Over the years network theory has proven to be rapidly expanding methodology to investigate various complex systems and it has turned out to give quite unparalleled insight to their structure, function, and response through data analysis, modeling, and simulation. For social systems in particular the network approach has empirically revealed a modular structure due to interplay between the network topology and link weights between network nodes or individuals. This inspired us to develop a simple network model that could catch some salient features of mesoscopic community and macroscopic topology formation during network evolution. Our model is based on two fundamental mechanisms of network sociology for individuals to find new friends, namely cyclic closure and focal closure, which are mimicked by local search-link-reinforcement and random global attachment mechanisms, respectively. In addition we included to the model a node deletion mechanism by removing all its links simultaneously, which corresponds for an individual to depart from the network. Here we describe in detail the implementation of our model algorithm, which was found to be computationally efficient and produce many empirically observed features of large-scale social networks. Thus this model opens a new perspective for studying such collective social phenomena as spreading, structure formation, and evolutionary processes.

  4. STOCK Market Differences in Correlation-Based Weighted Network

    Science.gov (United States)

    Youn, Janghyuk; Lee, Junghoon; Chang, Woojin

    We examined the sector dynamics of Korean stock market in relation to the market volatility. The daily price data of 360 stocks for 5019 trading days (from January, 1990 to August, 2008) in Korean stock market are used. We performed the weighted network analysis and employed four measures: the average, the variance, the intensity, and the coherence of network weights (absolute values of stock return correlations) to investigate the network structure of Korean stock market. We performed regression analysis using the four measures in the seven major industry sectors and the market (seven sectors combined). We found that the average, the intensity, and the coherence of sector (subnetwork) weights increase as market becomes volatile. Except for the "Financials" sector, the variance of sector weights also grows as market volatility increases. Based on the four measures, we can categorize "Financials," "Information Technology" and "Industrials" sectors into one group, and "Materials" and "Consumer Discretionary" sectors into another group. We investigated the distributions of intrasector and intersector weights for each sector and found the differences in "Financials" sector are most distinct.

  5. Surrogate-assisted identification of influences of network construction on evolving weighted functional networks

    Science.gov (United States)

    Stahn, Kirsten; Lehnertz, Klaus

    2017-12-01

    We aim at identifying factors that may affect the characteristics of evolving weighted networks derived from empirical observations. To this end, we employ various chains of analysis that are often used in field studies for a data-driven derivation and characterization of such networks. As an example, we consider fully connected, weighted functional brain networks before, during, and after epileptic seizures that we derive from multichannel electroencephalographic data recorded from epilepsy patients. For these evolving networks, we estimate clustering coefficient and average shortest path length in a time-resolved manner. Lastly, we make use of surrogate concepts that we apply at various levels of the chain of analysis to assess to what extent network characteristics are dominated by properties of the electroencephalographic recordings and/or the evolving weighted networks, which may be accessible more easily. We observe that characteristics are differently affected by the unavoidable referencing of the electroencephalographic recording, by the time-series-analysis technique used to derive the properties of network links, and whether or not networks were normalized. Importantly, for the majority of analysis settings, we observe temporal evolutions of network characteristics to merely reflect the temporal evolutions of mean interaction strengths. Such a property of the data may be accessible more easily, which would render the weighted network approach—as used here—as an overly complicated description of simple aspects of the data.

  6. Improving Estimation of Betweenness Centrality for Scale-Free Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Bromberger, Seth A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Klymko, Christine F. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Henderson, Keith A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Pearce, Roger [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoff [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2017-11-07

    Betweenness centrality is a graph statistic used to nd vertices that are participants in a large number of shortest paths in a graph. This centrality measure is commonly used in path and network interdiction problems and its complete form requires the calculation of all-pairs shortest paths for each vertex. This leads to a time complexity of O(jV jjEj), which is impractical for large graphs. Estimation of betweenness centrality has focused on performing shortest-path calculations on a subset of randomly- selected vertices. This reduces the complexity of the centrality estimation to O(jSjjEj); jSj < jV j, which can be scaled appropriately based on the computing resources available. An estimation strategy that uses random selection of vertices for seed selection is fast and simple to implement, but may not provide optimal estimation of betweenness centrality when the number of samples is constrained. Our experimentation has identi ed a number of alternate seed-selection strategies that provide lower error than random selection in common scale-free graphs. These strategies are discussed and experimental results are presented.

  7. [Weighted gene co-expression network analysis in biomedicine research].

    Science.gov (United States)

    Liu, Wei; Li, Li; Ye, Hua; Tu, Wei

    2017-11-25

    High-throughput biological technologies are now widely applied in biology and medicine, allowing scientists to monitor thousands of parameters simultaneously in a specific sample. However, it is still an enormous challenge to mine useful information from high-throughput data. The emergence of network biology provides deeper insights into complex bio-system and reveals the modularity in tissue/cellular networks. Correlation networks are increasingly used in bioinformatics applications. Weighted gene co-expression network analysis (WGCNA) tool can detect clusters of highly correlated genes. Therefore, we systematically reviewed the application of WGCNA in the study of disease diagnosis, pathogenesis and other related fields. First, we introduced principle, workflow, advantages and disadvantages of WGCNA. Second, we presented the application of WGCNA in disease, physiology, drug, evolution and genome annotation. Then, we indicated the application of WGCNA in newly developed high-throughput methods. We hope this review will help to promote the application of WGCNA in biomedicine research.

  8. Data Driven Broiler Weight Forecasting using Dynamic Neural Network Models

    DEFF Research Database (Denmark)

    Johansen, Simon Vestergaard; Bendtsen, Jan Dimon; Riisgaard-Jensen, Martin

    2017-01-01

    In this article, the dynamic influence of environmental broiler house conditions and broiler growth is investigated. Dynamic neural network forecasting models have been trained on farm-scale broiler batch production data from 12 batches from the same house. The model forecasts future broiler weight...... and uses environmental conditions such as heating, ventilation, and temperature along with broiler behavior such as feed and water consumption. Training data and forecasting data is analyzed to explain when the model might fail at generalizing. We present ensemble broiler weight forecasts to day 7, 14, 21...

  9. Do-it-yourself networks: a novel method of generating weighted networks.

    Science.gov (United States)

    Shanafelt, D W; Salau, K R; Baggio, J A

    2017-11-01

    Network theory is finding applications in the life and social sciences for ecology, epidemiology, finance and social-ecological systems. While there are methods to generate specific types of networks, the broad literature is focused on generating unweighted networks. In this paper, we present a framework for generating weighted networks that satisfy user-defined criteria. Each criterion hierarchically defines a feature of the network and, in doing so, complements existing algorithms in the literature. We use a general example of ecological species dispersal to illustrate the method and provide open-source code for academic purposes.

  10. Poor—rich demarcation of Matthew effect on scale-free systems and its application

    International Nuclear Information System (INIS)

    Dong, Yan; Sui-Ran, Yu; Ming, Dong; Bouras, Abdelaziz

    2011-01-01

    In a scale-free network, only a minority of nodes are connected very often, while the majority of nodes are connected rarely. However, what is the ratio of minority nodes to majority nodes resulting from the Matthew effect? In this paper, based on a simple preferential random model, the poor-rich demarcation points are found to vary in a limited range, and form a poor-rich demarcation interval that approximates to k/m in [3,4]. As a result, the (cumulative) degree distribution of a scale-free network can be divided into three intervals: the poor interval, the demarcation interval and the rich interval. The inequality of the degree distribution in each interval is measured. Finally, the Matthew effect is applied to the ABC analysis of project management. (general)

  11. Improving the Reliability of Network Metrics in Structural Brain Networks by Integrating Different Network Weighting Strategies into a Single Graph

    Directory of Open Access Journals (Sweden)

    Stavros I. Dimitriadis

    2017-12-01

    Full Text Available Structural brain networks estimated from diffusion MRI (dMRI via tractography have been widely studied in healthy controls and patients with neurological and psychiatric diseases. However, few studies have addressed the reliability of derived network metrics both node-specific and network-wide. Different network weighting strategies (NWS can be adopted to weight the strength of connection between two nodes yielding structural brain networks that are almost fully-weighted. Here, we scanned five healthy participants five times each, using a diffusion-weighted MRI protocol and computed edges between 90 regions of interest (ROI from the Automated Anatomical Labeling (AAL template. The edges were weighted according to nine different methods. We propose a linear combination of these nine NWS into a single graph using an appropriate diffusion distance metric. We refer to the resulting weighted graph as an Integrated Weighted Structural Brain Network (ISWBN. Additionally, we consider a topological filtering scheme that maximizes the information flow in the brain network under the constraint of the overall cost of the surviving connections. We compared each of the nine NWS and the ISWBN based on the improvement of: (a intra-class correlation coefficient (ICC of well-known network metrics, both node-wise and per network level; and (b the recognition accuracy of each subject compared to the remainder of the cohort, as an attempt to access the uniqueness of the structural brain network for each subject, after first applying our proposed topological filtering scheme. Based on a threshold where the network level ICC should be >0.90, our findings revealed that six out of nine NWS lead to unreliable results at the network level, while all nine NWS were unreliable at the node level. In comparison, our proposed ISWBN performed as well as the best performing individual NWS at the network level, and the ICC was higher compared to all individual NWS at the node

  12. Neuromorphic photonic networks using silicon photonic weight banks.

    Science.gov (United States)

    Tait, Alexander N; de Lima, Thomas Ferreira; Zhou, Ellen; Wu, Allie X; Nahmias, Mitchell A; Shastri, Bhavin J; Prucnal, Paul R

    2017-08-07

    Photonic systems for high-performance information processing have attracted renewed interest. Neuromorphic silicon photonics has the potential to integrate processing functions that vastly exceed the capabilities of electronics. We report first observations of a recurrent silicon photonic neural network, in which connections are configured by microring weight banks. A mathematical isomorphism between the silicon photonic circuit and a continuous neural network model is demonstrated through dynamical bifurcation analysis. Exploiting this isomorphism, a simulated 24-node silicon photonic neural network is programmed using "neural compiler" to solve a differential system emulation task. A 294-fold acceleration against a conventional benchmark is predicted. We also propose and derive power consumption analysis for modulator-class neurons that, as opposed to laser-class neurons, are compatible with silicon photonic platforms. At increased scale, Neuromorphic silicon photonics could access new regimes of ultrafast information processing for radio, control, and scientific computing.

  13. Information mining in weighted complex networks with nonlinear rating projection

    Science.gov (United States)

    Liao, Hao; Zeng, An; Zhou, Mingyang; Mao, Rui; Wang, Bing-Hong

    2017-10-01

    Weighted rating networks are commonly used by e-commerce providers nowadays. In order to generate an objective ranking of online items' quality according to users' ratings, many sophisticated algorithms have been proposed in the complex networks domain. In this paper, instead of proposing new algorithms we focus on a more fundamental problem: the nonlinear rating projection. The basic idea is that even though the rating values given by users are linearly separated, the real preference of users to items between the different given values is nonlinear. We thus design an approach to project the original ratings of users to more representative values. This approach can be regarded as a data pretreatment method. Simulation in both artificial and real networks shows that the performance of the ranking algorithms can be improved when the projected ratings are used.

  14. Analysis of the airport network of India as a complex weighted network

    Science.gov (United States)

    Bagler, Ganesh

    2008-05-01

    Transportation infrastructure of a country is one of the most important indicators of its economic growth. Here we study the Airport Network of India (ANI) which represents India’s domestic civil aviation infrastructure as a complex network. We find that ANI, a network of domestic airports connected by air links, is a small-world network characterized by a truncated power-law degree distribution and has a signature of hierarchy. We investigate ANI as a weighted network to explore its various properties and compare them with their topological counterparts. The traffic in ANI, as in the World-wide Airport Network (WAN), is found to be accumulated on interconnected groups of airports and is concentrated between large airports. In contrast to WAN, ANI is found to be having disassortative mixing which is offset by the traffic dynamics. The analysis indicates possible mechanism of formation of a national transportation network, which is different from that on a global scale.

  15. Analysis on Influential Functions in the Weighted Software Network

    Directory of Open Access Journals (Sweden)

    Haitao He

    2018-01-01

    Full Text Available Identifying influential nodes is important for software in terms of understanding the design patterns and controlling the development and the maintenance process. However, there are no efficient methods to discover them so far. Based on the invoking dependency relationships between the nodes, this paper proposes a novel approach to define the node importance for mining the influential software nodes. First, according to the multiple execution information, we construct a weighted software network (WSN to denote the software execution dependency structure. Second, considering the invoking times and outdegree about software nodes, we improve the method PageRank and put forward the targeted algorithm FunctionRank to evaluate the node importance (NI in weighted software network. It has higher influence when the node has lager value of NI. Finally, comparing the NI of nodes, we can obtain the most influential nodes in the software network. In addition, the experimental results show that the proposed approach has good performance in identifying the influential nodes.

  16. Hash function construction using weighted complex dynamical networks

    International Nuclear Information System (INIS)

    Song Yu-Rong; Jiang Guo-Ping

    2013-01-01

    A novel scheme to construct a hash function based on a weighted complex dynamical network (WCDN) generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency. (general)

  17. Trading leads to scale-free self-organization

    Science.gov (United States)

    Ebert, M.; Paul, W.

    2012-12-01

    Financial markets display scale-free behavior in many different aspects. The power-law behavior of part of the distribution of individual wealth has been recognized by Pareto as early as the nineteenth century. Heavy-tailed and scale-free behavior of the distribution of returns of different financial assets have been confirmed in a series of works. The existence of a Pareto-like distribution of the wealth of market participants has been connected with the scale-free distribution of trading volumes and price-returns. The origin of the Pareto-like wealth distribution, however, remained obscure. Here we show that in a market where the imbalance of supply and demand determines the direction of prize changes, it is the process of trading itself that spontaneously leads to a self-organization of the market with a Pareto-like wealth distribution for the market participants and at the same time to a scale-free behavior of return fluctuations and trading volume distributions.

  18. Strategic Factor Markets Scale Free Resources and Economic Performance

    DEFF Research Database (Denmark)

    Geisler Asmussen, Christian

    2015-01-01

    This paper analyzes how scale free resources, which can be acquired by multiple firms simultaneously and deployed against one another in product market competition, will be priced in strategic factor markets, and what the consequences are for the acquiring firms' performance. Based on a game-theo...

  19. Programming scale-free optics in disordered ferroelectrics.

    Science.gov (United States)

    Parravicini, Jacopo; Conti, Claudio; Agranat, Aharon J; DelRe, Eugenio

    2012-06-15

    Using the history dependence of a dipolar glass hosted in a compositionally disordered lithium-enriched potassium tantalate niobate (KTN:Li) crystal, we demonstrate scale-free optical propagation at tunable temperatures. The operating equilibration temperature is determined by previous crystal spiralling in the temperature/cooling-rate phase space.

  20. Programming scale-free optics in disordered ferroelectrics

    OpenAIRE

    Parravicini, Jacopo; Conti, Claudio; Agranat, Aharon J.; DelRe, Eugenio

    2012-01-01

    Using the history-dependence of a dipolar glass hosted in a compositionally-disordered lithium-enriched potassium-tantalate-niobate (KTN:Li) crystal, we demonstrate scale-free optical propagation at tunable temperatures. The operating equilibration temperature is determined by previous crystal spiralling in the temperature/cooling-rate phase-space.

  1. The scale-free dynamics of eukaryotic cells.

    Directory of Open Access Journals (Sweden)

    Miguel A Aon

    Full Text Available Temporal organization of biological processes requires massively parallel processing on a synchronized time-base. We analyzed time-series data obtained from the bioenergetic oscillatory outputs of Saccharomyces cerevisiae and isolated cardiomyocytes utilizing Relative Dispersional (RDA and Power Spectral (PSA analyses. These analyses revealed broad frequency distributions and evidence for long-term memory in the observed dynamics. Moreover RDA and PSA showed that the bioenergetic dynamics in both systems show fractal scaling over at least 3 orders of magnitude, and that this scaling obeys an inverse power law. Therefore we conclude that in S. cerevisiae and cardiomyocytes the dynamics are scale-free in vivo. Applying RDA and PSA to data generated from an in silico model of mitochondrial function indicated that in yeast and cardiomyocytes the underlying mechanisms regulating the scale-free behavior are similar. We validated this finding in vivo using single cells, and attenuating the activity of the mitochondrial inner membrane anion channel with 4-chlorodiazepam to show that the oscillation of NAD(PH and reactive oxygen species (ROS can be abated in these two evolutionarily distant species. Taken together these data strongly support our hypothesis that the generation of ROS, coupled to redox cycling, driven by cytoplasmic and mitochondrial processes, are at the core of the observed rhythmicity and scale-free dynamics. We argue that the operation of scale-free bioenergetic dynamics plays a fundamental role to integrate cellular function, while providing a framework for robust, yet flexible, responses to the environment.

  2. Small-world effect induced by weight randomization on regular networks

    International Nuclear Information System (INIS)

    Li, Menghui; Fan, Ying; Wang, Dahui; Li, Daqing; Wu, Jinshan; Di, Zengru

    2007-01-01

    The concept of edge weight provides additional depth for describing and adjusting the properties of networks. Redistribution of edge weight can effectively change the properties of networks even though the corresponding binary topology remains unchanged. Based on regular networks with initially homogeneous dissimilarity weights, random redistribution of edge weight can be enough to induce small world phenomena. The effects of random weight redistribution on both static properties and dynamical models of networks are investigated. The results reveal that randomization of weight can enhance the ability of synchronization of chaotic systems dramatically

  3. Emergence of scale-free characteristics in socio-ecological systems with bounded rationality.

    Science.gov (United States)

    Kasthurirathna, Dharshana; Piraveenan, Mahendra

    2015-06-11

    Socio-ecological systems are increasingly modelled by games played on complex networks. While the concept of Nash equilibrium assumes perfect rationality, in reality players display heterogeneous bounded rationality. Here we present a topological model of bounded rationality in socio-ecological systems, using the rationality parameter of the Quantal Response Equilibrium. We argue that system rationality could be measured by the average Kullback--Leibler divergence between Nash and Quantal Response Equilibria, and that the convergence towards Nash equilibria on average corresponds to increased system rationality. Using this model, we show that when a randomly connected socio-ecological system is topologically optimised to converge towards Nash equilibria, scale-free and small world features emerge. Therefore, optimising system rationality is an evolutionary reason for the emergence of scale-free and small-world features in socio-ecological systems. Further, we show that in games where multiple equilibria are possible, the correlation between the scale-freeness of the system and the fraction of links with multiple equilibria goes through a rapid transition when the average system rationality increases. Our results explain the influence of the topological structure of socio-ecological systems in shaping their collective cognitive behaviour, and provide an explanation for the prevalence of scale-free and small-world characteristics in such systems.

  4. Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates

    KAUST Repository

    Pearce, Roger

    2014-11-01

    © 2014 IEEE. At extreme scale, irregularities in the structure of scale-free graphs such as social network graphs limit our ability to analyze these important and growing datasets. A key challenge is the presence of high-degree vertices (hubs), that leads to parallel workload and storage imbalances. The imbalances occur because existing partitioning techniques are not able to effectively partition high-degree vertices. We present techniques to distribute storage, computation, and communication of hubs for extreme scale graphs in distributed memory supercomputers. To balance the hub processing workload, we distribute hub data structures and related computation among a set of delegates. The delegates coordinate using highly optimized, yet portable, asynchronous broadcast and reduction operations. We demonstrate scalability of our new algorithmic technique using Breadth-First Search (BFS), Single Source Shortest Path (SSSP), K-Core Decomposition, and Page-Rank on synthetically generated scale-free graphs. Our results show excellent scalability on large scale-free graphs up to 131K cores of the IBM BG/P, and outperform the best known Graph500 performance on BG/P Intrepid by 15%

  5. Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates

    KAUST Repository

    Pearce, Roger; Gokhale, Maya; Amato, Nancy M.

    2014-01-01

    © 2014 IEEE. At extreme scale, irregularities in the structure of scale-free graphs such as social network graphs limit our ability to analyze these important and growing datasets. A key challenge is the presence of high-degree vertices (hubs), that leads to parallel workload and storage imbalances. The imbalances occur because existing partitioning techniques are not able to effectively partition high-degree vertices. We present techniques to distribute storage, computation, and communication of hubs for extreme scale graphs in distributed memory supercomputers. To balance the hub processing workload, we distribute hub data structures and related computation among a set of delegates. The delegates coordinate using highly optimized, yet portable, asynchronous broadcast and reduction operations. We demonstrate scalability of our new algorithmic technique using Breadth-First Search (BFS), Single Source Shortest Path (SSSP), K-Core Decomposition, and Page-Rank on synthetically generated scale-free graphs. Our results show excellent scalability on large scale-free graphs up to 131K cores of the IBM BG/P, and outperform the best known Graph500 performance on BG/P Intrepid by 15%

  6. Evolutionary Artificial Neural Network Weight Tuning to Optimize Decision Making for an Abstract Game

    Science.gov (United States)

    2010-03-01

    EVOLUTIONARY ARTIFICIAL NEURAL NETWORK WEIGHT TUNING TO OPTIMIZE DECISION MAKING FOR AN ABSTRACT...AFIT/GCS/ENG/10-06 EVOLUTIONARY ARTIFICIAL NEURAL NETWORK WEIGHT TUNING TO OPTIMIZE DECISION MAKING FOR AN ABSTRACT GAME THESIS Presented...35 14: Diagram of pLoGANN’s Artificial Neural Network and

  7. Entanglement percolation on a quantum internet with scale-free and clustering characters

    International Nuclear Information System (INIS)

    Wu Liang; Zhu Shiqun

    2011-01-01

    The applicability of entanglement percolation protocol to real Internet structure is investigated. If the current Internet can be used directly in the quantum regime, the protocol can provide a way to establish long-distance entanglement when the links are pure nonmaximally entangled states. This applicability is primarily due to the combination of scale-free degree distribution and a high level of clustering, both of which are widely observed in many natural and artificial networks including the current Internet. It suggests that the topology of real Internet may play an important role in entanglement establishment.

  8. Entanglement percolation on a quantum internet with scale-free and clustering characters

    Energy Technology Data Exchange (ETDEWEB)

    Wu Liang; Zhu Shiqun [School of Physical Science and Technology, Soochow University, Suzhou, Jiangsu 215006 (China)

    2011-11-15

    The applicability of entanglement percolation protocol to real Internet structure is investigated. If the current Internet can be used directly in the quantum regime, the protocol can provide a way to establish long-distance entanglement when the links are pure nonmaximally entangled states. This applicability is primarily due to the combination of scale-free degree distribution and a high level of clustering, both of which are widely observed in many natural and artificial networks including the current Internet. It suggests that the topology of real Internet may play an important role in entanglement establishment.

  9. Multi-Type Directed Scale-Free Percolation

    International Nuclear Information System (INIS)

    Shang Yilun

    2012-01-01

    In this paper, we study a long-range percolation model on the lattice ℤ d with multi-type vertices and directed edges. Each vertex x in ℤ d is independently assigned a non-negative weight W x and a type ψ x , where (W x ) xinℤ d are i.i.d. random variables, and (ψ x ) xinℤ d are also i.i.d. Conditionally on weights and types, and given λ, α > 0, the edges are independent and the probability that there is a directed edge from x to y is given by p xy = 1 - exp(-λφ ψ x ψ y W x W y /|x-y| α ), where φ ij 's are entries from a type matrix Φ. We show that, when the tail of the distribution of W x is regularly varying with exponent τ - 1, the tails of the out/in-degree distributions are both regularly varying with exponent γ = α(τ - 1)/d. We formulate conditions under which there exist critical values λ c WCC in (0, ∞) and λ c SCC in (0, ∞) such that an infinite weak component and an infinite strong component emerge, respectively, when λ exceeds them. A phase transition is established for the shortest path lengths of directed and undirected edges in the infinite component at the point γ = 2, where the out/in-degrees switch from having finite to infinite variances. The random graph model studied here features some structures of multi-type vertices and directed edges which appear naturally in many real-world networks, such as the SNS networks and computer communication networks. (condensed matter: structural, mechanical, and thermal properties)

  10. Emergence of scale-free leadership structure in social recommender systems.

    Science.gov (United States)

    Zhou, Tao; Medo, Matúš; Cimini, Giulio; Zhang, Zi-Ke; Zhang, Yi-Cheng

    2011-01-01

    The study of the organization of social networks is important for the understanding of opinion formation, rumor spreading, and the emergence of trends and fashion. This paper reports empirical analysis of networks extracted from four leading sites with social functionality (Delicious, Flickr, Twitter and YouTube) and shows that they all display a scale-free leadership structure. To reproduce this feature, we propose an adaptive network model driven by social recommending. Artificial agent-based simulations of this model highlight a "good get richer" mechanism where users with broad interests and good judgments are likely to become popular leaders for the others. Simulations also indicate that the studied social recommendation mechanism can gradually improve the user experience by adapting to tastes of its users. Finally we outline implications for real online resource-sharing systems.

  11. Weighted Protein Interaction Network Analysis of Frontotemporal Dementia.

    Science.gov (United States)

    Ferrari, Raffaele; Lovering, Ruth C; Hardy, John; Lewis, Patrick A; Manzoni, Claudia

    2017-02-03

    The genetic analysis of complex disorders has undoubtedly led to the identification of a wealth of associations between genes and specific traits. However, moving from genetics to biochemistry one gene at a time has, to date, rather proved inefficient and under-powered to comprehensively explain the molecular basis of phenotypes. Here we present a novel approach, weighted protein-protein interaction network analysis (W-PPI-NA), to highlight key functional players within relevant biological processes associated with a given trait. This is exemplified in the current study by applying W-PPI-NA to frontotemporal dementia (FTD): We first built the state of the art FTD protein network (FTD-PN) and then analyzed both its topological and functional features. The FTD-PN resulted from the sum of the individual interactomes built around FTD-spectrum genes, leading to a total of 4198 nodes. Twenty nine of 4198 nodes, called inter-interactome hubs (IIHs), represented those interactors able to bridge over 60% of the individual interactomes. Functional annotation analysis not only reiterated and reinforced previous findings from single genes and gene-coexpression analyses but also indicated a number of novel potential disease related mechanisms, including DNA damage response, gene expression regulation, and cell waste disposal and potential biomarkers or therapeutic targets including EP300. These processes and targets likely represent the functional core impacted in FTD, reflecting the underlying genetic architecture contributing to disease. The approach presented in this study can be applied to other complex traits for which risk-causative genes are known as it provides a promising tool for setting the foundations for collating genomics and wet laboratory data in a bidirectional manner. This is and will be critical to accelerate molecular target prioritization and drug discovery.

  12. Epidemic spreading in weighted networks: an edge-based mean-field solution.

    Science.gov (United States)

    Yang, Zimo; Zhou, Tao

    2012-05-01

    Weight distribution greatly impacts the epidemic spreading taking place on top of networks. This paper presents a study of a susceptible-infected-susceptible model on regular random networks with different kinds of weight distributions. Simulation results show that the more homogeneous weight distribution leads to higher epidemic prevalence, which, unfortunately, could not be captured by the traditional mean-field approximation. This paper gives an edge-based mean-field solution for general weight distribution, which can quantitatively reproduce the simulation results. This method could be applied to characterize the nonequilibrium steady states of dynamical processes on weighted networks.

  13. Generate the scale-free brain music from BOLD signals.

    Science.gov (United States)

    Lu, Jing; Guo, Sijia; Chen, Mingming; Wang, Weixia; Yang, Hua; Guo, Daqing; Yao, Dezhong

    2018-01-01

    Many methods have been developed to translate a human electroencephalogram (EEG) into music. In addition to EEG, functional magnetic resonance imaging (fMRI) is another method used to study the brain and can reflect physiological processes. In 2012, we established a method to use simultaneously recorded fMRI and EEG signals to produce EEG-fMRI music, which represents a step toward scale-free brain music. In this study, we used a neural mass model, the Jansen-Rit model, to simulate activity in several cortical brain regions. The interactions between different brain regions were represented by the average normalized diffusion tensor imaging (DTI) structural connectivity with a coupling coefficient that modulated the coupling strength. Seventy-eight brain regions were adopted from the Automated Anatomical Labeling (AAL) template. Furthermore, we used the Balloon-Windkessel hemodynamic model to transform neural activity into a blood-oxygen-level dependent (BOLD) signal. Because the fMRI BOLD signal changes slowly, we used a sampling rate of 250 Hz to produce the temporal series for music generation. Then, the BOLD music was generated for each region using these simulated BOLD signals. Because the BOLD signal is scale free, these music pieces were also scale free, which is similar to classic music. Here, to simulate the case of an epileptic patient, we changed the parameter that determined the amplitude of the excitatory postsynaptic potential (EPSP) in the neural mass model. Finally, we obtained BOLD music for healthy and epileptic patients. The differences in levels of arousal between the 2 pieces of music may provide a potential tool for discriminating the different populations if the differences can be confirmed by more real data. Copyright © 2017 The Authors. Published by Wolters Kluwer Health, Inc. All rights reserved.

  14. Scale-free, axisymmetry galaxy models with little angular momentum

    International Nuclear Information System (INIS)

    Richstone, D.O.

    1980-01-01

    Two scale-free models of elliptical galaxies are constructed using a self-consistent field approach developed by Schwarschild. Both models have concentric, oblate spheroidal, equipotential surfaces, with a logarithmic potential dependence on central distance. The axial ratio of the equipotential surfaces is 4:3, and the extent ratio of density level surfaces id 2.5:1 (corresponding to an E6 galaxy). Each model satisfies the Poisson and steady state Boltzmann equaion for time scales of order 100 galactic years

  15. The integration of weighted human gene association networks based on link prediction.

    Science.gov (United States)

    Yang, Jian; Yang, Tinghong; Wu, Duzhi; Lin, Limei; Yang, Fan; Zhao, Jing

    2017-01-31

    Physical and functional interplays between genes or proteins have important biological meaning for cellular functions. Some efforts have been made to construct weighted gene association meta-networks by integrating multiple biological resources, where the weight indicates the confidence of the interaction. However, it is found that these existing human gene association networks share only quite limited overlapped interactions, suggesting their incompleteness and noise. Here we proposed a workflow to construct a weighted human gene association network using information of six existing networks, including two weighted specific PPI networks and four gene association meta-networks. We applied link prediction algorithm to predict possible missing links of the networks, cross-validation approach to refine each network and finally integrated the refined networks to get the final integrated network. The common information among the refined networks increases notably, suggesting their higher reliability. Our final integrated network owns much more links than most of the original networks, meanwhile its links still keep high functional relevance. Being used as background network in a case study of disease gene prediction, the final integrated network presents good performance, implying its reliability and application significance. Our workflow could be insightful for integrating and refining existing gene association data.

  16. Discovering disease-associated genes in weighted protein-protein interaction networks

    Science.gov (United States)

    Cui, Ying; Cai, Meng; Stanley, H. Eugene

    2018-04-01

    Although there have been many network-based attempts to discover disease-associated genes, most of them have not taken edge weight - which quantifies their relative strength - into consideration. We use connection weights in a protein-protein interaction (PPI) network to locate disease-related genes. We analyze the topological properties of both weighted and unweighted PPI networks and design an improved random forest classifier to distinguish disease genes from non-disease genes. We use a cross-validation test to confirm that weighted networks are better able to discover disease-associated genes than unweighted networks, which indicates that including link weight in the analysis of network properties provides a better model of complex genotype-phenotype associations.

  17. Analysis of a large-scale weighted network of one-to-one human communication

    International Nuclear Information System (INIS)

    Onnela, Jukka-Pekka; Saramaeki, Jari; Hyvoenen, Joerkki; Szabo, Gabor; Menezes, M Argollo de; Kaski, Kimmo; Barabasi, Albert-Laszlo; Kertesz, Janos

    2007-01-01

    We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks

  18. Analysis of a large-scale weighted network of one-to-one human communication

    Science.gov (United States)

    Onnela, Jukka-Pekka; Saramäki, Jari; Hyvönen, Jörkki; Szabó, Gábor; Argollo de Menezes, M.; Kaski, Kimmo; Barabási, Albert-László; Kertész, János

    2007-06-01

    We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

  19. Analysis of a large-scale weighted network of one-to-one human communication

    Energy Technology Data Exchange (ETDEWEB)

    Onnela, Jukka-Pekka [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Saramaeki, Jari [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Hyvoenen, Joerkki [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Szabo, Gabor [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Menezes, M Argollo de [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Kaski, Kimmo [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Barabasi, Albert-Laszlo [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Kertesz, Janos [Laboratory of Computational Engineering, Helsinki University of Technology (Finland)

    2007-06-15

    We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

  20. Ecological, historical and evolutionary determinants of modularity in weighted seed-dispersal networks

    DEFF Research Database (Denmark)

    Schleuning, Matthias; Ingmann, Lili; Strauß, Rouven

    2014-01-01

    Modularity is a recurrent and important property of bipartite ecological networks. Although well-resolved ecological networks describe interaction frequencies between species pairs, modularity of bipartite networks has been analysed only on the basis of binary presence-absence data. We employ a new...... algorithm to detect modularity in weighted bipartite networks in a global analysis of avian seed-dispersal networks. We define roles of species, such as connector values, for weighted and binary networks and associate them with avian species traits and phylogeny. The weighted, but not binary, analysis...... identified a positive relationship between climatic seasonality and modularity, whereas past climate stability and phylogenetic signal were only weakly related to modularity. Connector values were associated with foraging behaviour and were phylogenetically conserved. The weighted modularity analysis...

  1. Green IGP Link Weights for Energy-efficiency and Load-balancing in IP Backbone Networks

    OpenAIRE

    Francois, Frederic; Wang, Ning; Moessner, Klaus; Georgoulas, Stylianos; Xu, Ke

    2013-01-01

    The energy consumption of backbone networks has become a primary concern for network operators and regulators due to the pervasive deployment of wired backbone networks to meet the requirements of bandwidth-hungry applications. While traditional optimization of IGP link weights has been used in IP based load-balancing operations, in this paper we introduce a novel link weight setting algorithm, the Green Load-balancing Algorithm (GLA), which is able to jointly optimize both energy efficiency ...

  2. A method for identifying hierarchical sub-networks / modules and weighting network links based on their similarity in sub-network / module affiliation

    Directory of Open Access Journals (Sweden)

    WenJun Zhang

    2016-06-01

    Full Text Available Some networks, including biological networks, consist of hierarchical sub-networks / modules. Based on my previous study, in present study a method for both identifying hierarchical sub-networks / modules and weighting network links is proposed. It is based on the cluster analysis in which between-node similarity in sets of adjacency nodes is used. Two matrices, linkWeightMat and linkClusterIDs, are achieved by using the algorithm. Two links with both the same weight in linkWeightMat and the same cluster ID in linkClusterIDs belong to the same sub-network / module. Two links with the same weight in linkWeightMat but different cluster IDs in linkClusterIDs belong to two sub-networks / modules at the same hirarchical level. However, a link with an unique cluster ID in linkClusterIDs does not belong to any sub-networks / modules. A sub-network / module of the greater weight is the more connected sub-network / modules. Matlab codes of the algorithm are presented.

  3. Equilibrium and nonequilibrium properties of Boolean decision problems on scale-free graphs with competing interactions with external biases

    Science.gov (United States)

    Zhu, Zheng; Andresen, Juan Carlos; Janzen, Katharina; Katzgraber, Helmut G.

    2013-03-01

    We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free graphs in a magnetic field. Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show, in agreement with analytical calculations, that the system exhibits a de Almeida-Thouless line. Furthermore, we study avalanches in the system at zero temperature to see if the system displays self-organized criticality. This would suggest that damage (avalanches) can spread across the whole system with nonzero probability, i.e., that Boolean decision problems on scale-free networks with competing interactions are fragile when not in thermal equilibrium.

  4. Punching above their weight: the role of networking in SMEs

    OpenAIRE

    Harris, Lisa; Rae, Alan; Misner, Ivan

    2011-01-01

    Purpose:We draw upon the findings of a research project which investigated networking styles by owner/managers of small businesses. Our specific objective was to analyse the impact of such networking activities on business growth to develop a taxonomy of networking based on size, business model and attitudes of the owner to their use of online and offline networking.Design/methodology/approach: Our data comes from analysis of an online survey completed by 645 firms based in both the USA and E...

  5. A Regularizer Approach for RBF Networks Under the Concurrent Weight Failure Situation.

    Science.gov (United States)

    Leung, Chi-Sing; Wan, Wai Yan; Feng, Ruibin

    2017-06-01

    Many existing results on fault-tolerant algorithms focus on the single fault source situation, where a trained network is affected by one kind of weight failure. In fact, a trained network may be affected by multiple kinds of weight failure. This paper first studies how the open weight fault and the multiplicative weight noise degrade the performance of radial basis function (RBF) networks. Afterward, we define the objective function for training fault-tolerant RBF networks. Based on the objective function, we then develop two learning algorithms, one batch mode and one online mode. Besides, the convergent conditions of our online algorithm are investigated. Finally, we develop a formula to estimate the test set error of faulty networks trained from our approach. This formula helps us to optimize some tuning parameters, such as RBF width.

  6. The QAP weighted network analysis method and its application in international services trade

    Science.gov (United States)

    Xu, Helian; Cheng, Long

    2016-04-01

    Based on QAP (Quadratic Assignment Procedure) correlation and complex network theory, this paper puts forward a new method named QAP Weighted Network Analysis Method. The core idea of the method is to analyze influences among relations in a social or economic group by building a QAP weighted network of networks of relations. In the QAP weighted network, a node depicts a relation and an undirect edge exists between any pair of nodes if there is significant correlation between relations. As an application of the QAP weighted network, we study international services trade by using the QAP weighted network, in which nodes depict 10 kinds of services trade relations. After the analysis of international services trade by QAP weighted network, and by using distance indicators, hierarchy tree and minimum spanning tree, the conclusion shows that: Firstly, significant correlation exists in all services trade, and the development of any one service trade will stimulate the other nine. Secondly, as the economic globalization goes deeper, correlations in all services trade have been strengthened continually, and clustering effects exist in those services trade. Thirdly, transportation services trade, computer and information services trade and communication services trade have the most influence and are at the core in all services trade.

  7. Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rank

    OpenAIRE

    Zhao, Liang; Liao, Siyu; Wang, Yanzhi; Li, Zhe; Tang, Jian; Pan, Victor; Yuan, Bo

    2017-01-01

    Recently low displacement rank (LDR) matrices, or so-called structured matrices, have been proposed to compress large-scale neural networks. Empirical results have shown that neural networks with weight matrices of LDR matrices, referred as LDR neural networks, can achieve significant reduction in space and computational complexity while retaining high accuracy. We formally study LDR matrices in deep learning. First, we prove the universal approximation property of LDR neural networks with a ...

  8. Empirical investigation of topological and weighted properties of a bus transport network from China

    Science.gov (United States)

    Shu-Min, Feng; Bao-Yu, Hu; Cen, Nie; Xiang-Hao, Shen; Yu-Sheng, Ci

    2016-03-01

    Many bus transport networks (BTNs) have evolved into directed networks. A new representation model for BTNs is proposed, called directed-space P. The bus transport network of Harbin (BTN-H) is described as a directed and weighted complex network by the proposed representation model and by giving each node weights. The topological and weighted properties are revealed in detail. In-degree and out-degree distributions, in-weight and out-weight distributions are presented as an exponential law, respectively. There is a strong relation between in-weight and in-degree (also between out-weight and out-degree), which can be fitted by a power function. Degree-degree and weight-weight correlations are investigated to reveal that BTN-H has a disassortative behavior as the nodes have relatively high degree (or weight). The disparity distributions of out-degree and in-degree follow an approximate power-law. Besides, the node degree shows a near linear increase with the number of routes that connect to the corresponding station. These properties revealed in this paper can help public transport planners to analyze the status quo of the BTN in nature. Project supported by the National High Technology Research and Development Program of China (Grant No. 2014AA110304).

  9. Reducing weight precision of convolutional neural networks towards large-scale on-chip image recognition

    Science.gov (United States)

    Ji, Zhengping; Ovsiannikov, Ilia; Wang, Yibing; Shi, Lilong; Zhang, Qiang

    2015-05-01

    In this paper, we develop a server-client quantization scheme to reduce bit resolution of deep learning architecture, i.e., Convolutional Neural Networks, for image recognition tasks. Low bit resolution is an important factor in bringing the deep learning neural network into hardware implementation, which directly determines the cost and power consumption. We aim to reduce the bit resolution of the network without sacrificing its performance. To this end, we design a new quantization algorithm called supervised iterative quantization to reduce the bit resolution of learned network weights. In the training stage, the supervised iterative quantization is conducted via two steps on server - apply k-means based adaptive quantization on learned network weights and retrain the network based on quantized weights. These two steps are alternated until the convergence criterion is met. In this testing stage, the network configuration and low-bit weights are loaded to the client hardware device to recognize coming input in real time, where optimized but expensive quantization becomes infeasible. Considering this, we adopt a uniform quantization for the inputs and internal network responses (called feature maps) to maintain low on-chip expenses. The Convolutional Neural Network with reduced weight and input/response precision is demonstrated in recognizing two types of images: one is hand-written digit images and the other is real-life images in office scenarios. Both results show that the new network is able to achieve the performance of the neural network with full bit resolution, even though in the new network the bit resolution of both weight and input are significantly reduced, e.g., from 64 bits to 4-5 bits.

  10. Integrative analysis of many weighted co-expression networks using tensor computation.

    Directory of Open Access Journals (Sweden)

    Wenyuan Li

    2011-06-01

    Full Text Available The rapid accumulation of biological networks poses new challenges and calls for powerful integrative analysis tools. Most existing methods capable of simultaneously analyzing a large number of networks were primarily designed for unweighted networks, and cannot easily be extended to weighted networks. However, it is known that transforming weighted into unweighted networks by dichotomizing the edges of weighted networks with a threshold generally leads to information loss. We have developed a novel, tensor-based computational framework for mining recurrent heavy subgraphs in a large set of massive weighted networks. Specifically, we formulate the recurrent heavy subgraph identification problem as a heavy 3D subtensor discovery problem with sparse constraints. We describe an effective approach to solving this problem by designing a multi-stage, convex relaxation protocol, and a non-uniform edge sampling technique. We applied our method to 130 co-expression networks, and identified 11,394 recurrent heavy subgraphs, grouped into 2,810 families. We demonstrated that the identified subgraphs represent meaningful biological modules by validating against a large set of compiled biological knowledge bases. We also showed that the likelihood for a heavy subgraph to be meaningful increases significantly with its recurrence in multiple networks, highlighting the importance of the integrative approach to biological network analysis. Moreover, our approach based on weighted graphs detects many patterns that would be overlooked using unweighted graphs. In addition, we identified a large number of modules that occur predominately under specific phenotypes. This analysis resulted in a genome-wide mapping of gene network modules onto the phenome. Finally, by comparing module activities across many datasets, we discovered high-order dynamic cooperativeness in protein complex networks and transcriptional regulatory networks.

  11. light-weight digital signature algorithm for wireless sensor networks

    Indian Academy of Sciences (India)

    M LAVANYA

    2017-09-14

    Sep 14, 2017 ... WSN applications do not even consider the security aspects because of the heavy ...... security scheme in wireless sensor networks with mobile sinks. IEEE Trans. ... security protocols. PhD Thesis, Eindhoven University of.

  12. Importance of small-degree nodes in assortative networks with degree-weight correlations

    Science.gov (United States)

    Ma, Sijuan; Feng, Ling; Monterola, Christopher Pineda; Lai, Choy Heng

    2017-10-01

    It has been known that assortative network structure plays an important role in spreading dynamics for unweighted networks. Yet its influence on weighted networks is not clear, in particular when weight is strongly correlated with the degrees of the nodes as we empirically observed in Twitter. Here we use the self-consistent probability method and revised nonperturbative heterogenous mean-field theory method to investigate this influence on both susceptible-infective-recovered (SIR) and susceptible-infective-susceptible (SIS) spreading dynamics. Both our simulation and theoretical results show that while the critical threshold is not significantly influenced by the assortativity, the prevalence in the supercritical regime shows a crossover under different degree-weight correlations. In particular, unlike the case of random mixing networks, in assortative networks, the negative degree-weight correlation leads to higher prevalence in their spreading beyond the critical transmissivity than that of the positively correlated. In addition, the previously observed inhibition effect on spreading velocity by assortative structure is not apparent in negatively degree-weight correlated networks, while it is enhanced for that of the positively correlated. Detailed investigation into the degree distribution of the infected nodes reveals that small-degree nodes play essential roles in the supercritical phase of both SIR and SIS spreadings. Our results have direct implications in understanding viral information spreading over online social networks and epidemic spreading over contact networks.

  13. Power-law citation distributions are not scale-free.

    Science.gov (United States)

    Golosovsky, Michael

    2017-09-01

    We analyze time evolution of statistical distributions of citations to scientific papers published in the same year. While these distributions seem to follow the power-law dependence we find that they are nonstationary and the exponent of the power-law fit decreases with time and does not come to saturation. We attribute the nonstationarity of citation distributions to different longevity of the low-cited and highly cited papers. By measuring citation trajectories of papers we found that citation careers of the low-cited papers come to saturation after 10-15 years while those of the highly cited papers continue to increase indefinitely: The papers that exceed some citation threshold become runaways. Thus, we show that although citation distribution can look as a power-law dependence, it is not scale free and there is a hidden dynamic scale associated with the onset of runaways. We compare our measurements to our recently developed model of citation dynamics based on copying-redirection-triadic closure and find explanations to our empirical observations.

  14. Universal Scaling Relations in Scale-Free Structure Formation

    Science.gov (United States)

    Guszejnov, Dávid; Hopkins, Philip F.; Grudić, Michael Y.

    2018-04-01

    A large number of astronomical phenomena exhibit remarkably similar scaling relations. The most well-known of these is the mass distribution dN/dM∝M-2 which (to first order) describes stars, protostellar cores, clumps, giant molecular clouds, star clusters and even dark matter halos. In this paper we propose that this ubiquity is not a coincidence and that it is the generic result of scale-free structure formation where the different scales are uncorrelated. We show that all such systems produce a mass function proportional to M-2 and a column density distribution with a power law tail of dA/d lnΣ∝Σ-1. In the case where structure formation is controlled by gravity the two-point correlation becomes ξ2D∝R-1. Furthermore, structures formed by such processes (e.g. young star clusters, DM halos) tend to a ρ∝R-3 density profile. We compare these predictions with observations, analytical fragmentation cascade models, semi-analytical models of gravito-turbulent fragmentation and detailed "full physics" hydrodynamical simulations. We find that these power-laws are good first order descriptions in all cases.

  15. The integration of weighted gene association networks based on information entropy.

    Science.gov (United States)

    Yang, Fan; Wu, Duzhi; Lin, Limei; Yang, Jian; Yang, Tinghong; Zhao, Jing

    2017-01-01

    Constructing genome scale weighted gene association networks (WGAN) from multiple data sources is one of research hot spots in systems biology. In this paper, we employ information entropy to describe the uncertain degree of gene-gene links and propose a strategy for data integration of weighted networks. We use this method to integrate four existing human weighted gene association networks and construct a much larger WGAN, which includes richer biology information while still keeps high functional relevance between linked gene pairs. The new WGAN shows satisfactory performance in disease gene prediction, which suggests the reliability of our integration strategy. Compared with existing integration methods, our method takes the advantage of the inherent characteristics of the component networks and pays less attention to the biology background of the data. It can make full use of existing biological networks with low computational effort.

  16. Competitive Learning Neural Network Ensemble Weighted by Predicted Performance

    Science.gov (United States)

    Ye, Qiang

    2010-01-01

    Ensemble approaches have been shown to enhance classification by combining the outputs from a set of voting classifiers. Diversity in error patterns among base classifiers promotes ensemble performance. Multi-task learning is an important characteristic for Neural Network classifiers. Introducing a secondary output unit that receives different…

  17. Effects of Vertex Activity and Self-organized Criticality Behavior on a Weighted Evolving Network

    International Nuclear Information System (INIS)

    Zhang Guiqing; Yang Qiuying; Chen Tianlun

    2008-01-01

    Effects of vertex activity have been analyzed on a weighted evolving network. The network is characterized by the probability distribution of vertex strength, each edge weight and evolution of the strength of vertices with different vertex activities. The model exhibits self-organized criticality behavior. The probability distribution of avalanche size for different network sizes is also shown. In addition, there is a power law relation between the size and the duration of an avalanche and the average of avalanche size has been studied for different vertex activities

  18. Entropy of network ensembles

    Science.gov (United States)

    Bianconi, Ginestra

    2009-03-01

    In this paper we generalize the concept of random networks to describe network ensembles with nontrivial features by a statistical mechanics approach. This framework is able to describe undirected and directed network ensembles as well as weighted network ensembles. These networks might have nontrivial community structure or, in the case of networks embedded in a given space, they might have a link probability with a nontrivial dependence on the distance between the nodes. These ensembles are characterized by their entropy, which evaluates the cardinality of networks in the ensemble. In particular, in this paper we define and evaluate the structural entropy, i.e., the entropy of the ensembles of undirected uncorrelated simple networks with given degree sequence. We stress the apparent paradox that scale-free degree distributions are characterized by having small structural entropy while they are so widely encountered in natural, social, and technological complex systems. We propose a solution to the paradox by proving that scale-free degree distributions are the most likely degree distribution with the corresponding value of the structural entropy. Finally, the general framework we present in this paper is able to describe microcanonical ensembles of networks as well as canonical or hidden-variable network ensembles with significant implications for the formulation of network-constructing algorithms.

  19. New backpropagation algorithm with type-2 fuzzy weights for neural networks

    CERN Document Server

    Gaxiola, Fernando; Valdez, Fevrier

    2016-01-01

    In this book a neural network learning method with type-2 fuzzy weight adjustment is proposed. The mathematical analysis of the proposed learning method architecture and the adaptation of type-2 fuzzy weights are presented. The proposed method is based on research of recent methods that handle weight adaptation and especially fuzzy weights. The internal operation of the neuron is changed to work with two internal calculations for the activation function to obtain two results as outputs of the proposed method. Simulation results and a comparative study among monolithic neural networks, neural network with type-1 fuzzy weights and neural network with type-2 fuzzy weights are presented to illustrate the advantages of the proposed method. The proposed approach is based on recent methods that handle adaptation of weights using fuzzy logic of type-1 and type-2. The proposed approach is applied to a cases of prediction for the Mackey-Glass (for ô=17) and Dow-Jones time series, and recognition of person with iris bi...

  20. Analyses of the response of a complex weighted network to nodes removal strategies considering links weight: The case of the Beijing urban road system

    Science.gov (United States)

    Bellingeri, Michele; Lu, Zhe-Ming; Cassi, Davide; Scotognella, Francesco

    2018-02-01

    Complex network response to node loss is a central question in different fields of science ranging from physics, sociology, biology to ecology. Previous studies considered binary networks where the weight of the links is not accounted for. However, in real-world networks the weights of connections can be widely different. Here, we analyzed the response of real-world road traffic complex network of Beijing, the most prosperous city in China. We produced nodes removal attack simulations using classic binary node features and we introduced weighted ranks for node importance. We measured the network functioning during nodes removal with three different parameters: the size of the largest connected cluster (LCC), the binary network efficiency (Bin EFF) and the weighted network efficiency (Weg EFF). We find that removing nodes according to weighted rank, i.e. considering the weight of the links as a number of taxi flows along the roads, produced in general the highest damage in the system. Our results show that: (i) in order to model Beijing road complex networks response to nodes (intersections) failure, it is necessary to consider the weight of the links; (ii) to discover the best attack strategy, it is important to use nodes rank accounting links weight.

  1. Enabling time-dependent uncertain eco-weights for road networks

    DEFF Research Database (Denmark)

    Hu, Jilin; Yang, Bin; Jensen, Christian S.

    2017-01-01

    travel costs. Based on the techniques above, different histogram aggregation methods are proposed to accurately estimate time-dependent GHG emissions for routes. Based on a 200-million GPS record data set collected from 150 vehicles in Denmark over two years, a comprehensive empirical study is conducted...... transportation. The foundation of eco-routing is a weighted-graph representation of a road network in which road segments, or edges, are associated with eco-weights that capture the GHG emissions caused by traversing the edges. Due to the dynamics of traffic, the eco-weights are best modeled as being time...... dependent and uncertain. We formalize the problem of assigning a time-dependent, uncertain eco-weight to each edge in a road network based on historical GPS records. In particular, a sequence of histograms is employed to describe the uncertain eco-weight of an edge at different time intervals. Compression...

  2. Extracting weights from edge directions to find communities in directed networks

    International Nuclear Information System (INIS)

    Lai, Darong; Lu, Hongtao; Nardini, Christine

    2010-01-01

    Community structures are found to exist ubiquitously in real-world complex networks. We address here the problem of community detection in directed networks. Most of the previous literature ignores edge directions and applies methods designed for community detection in undirected networks, which discards valuable information and often fails when different communities are defined on the basis of incoming and outgoing edges. We suggest extracting information about edge directions using a PageRank random walk and translating such information into edge weights. After extraction we obtain a new weighted directed network in which edge directions can then be safely ignored. We thus transform community detection in directed networks into community detection in reweighted undirected networks. Such an approach can benefit directly from the large volume of algorithms for the detection of communities in undirected networks already developed, since it is not obvious how to extend these algorithms to account for directed networks and the procedure is often difficult. Validations on synthetic and real-world networks demonstrate that the proposed framework can effectively detect communities in directed networks

  3. Connectivity strategies to enhance the capacity of weight-bearing networks

    International Nuclear Information System (INIS)

    Janaki, T.M.; Gupte, Neelima

    2003-01-01

    The connectivity properties of a weight-bearing network are exploited to enhance its capacity. We study a 2D network of sites where the weight-bearing capacity of a given site depends on the capacities of the sites connected to it in the layers above. The network consists of clusters, viz., a set of sites connected with each other with the largest such collection of sites being denoted as the maximal cluster. New connections are made between sites in successive layers using two distinct strategies. The key element of our strategies consists of adding as many disjoint clusters as possible to the sites on the trunk T of the maximal cluster. In the first strategy the reconnections start from the last layer upwards and stop when no new sites are added. In the second case, the reconnections start from the top layer and go all the way down to the last layer. The new networks can bear much higher weights than the original networks and have much lower failure rates. The first strategy leads to a greater enhancement of stability, whereas the second leads to a greater enhancement of capacity compared to the original networks. The original network used here is a typical example of the branching hierarchical class. However, the application of strategies similar to ours can yield useful results in other types of networks as well

  4. On the performance of social network and likelihood-based expert weighting schemes

    International Nuclear Information System (INIS)

    Cooke, Roger M.; ElSaadany, Susie; Huang Xinzheng

    2008-01-01

    Using expert judgment data from the TU Delft's expert judgment database, we compare the performance of different weighting schemes, namely equal weighting, performance-based weighting from the classical model [Cooke RM. Experts in uncertainty. Oxford: Oxford University Press; 1991.], social network (SN) weighting and likelihood weighting. The picture that emerges with regard to SN weights is rather mixed. SN theory does not provide an alternative to performance-based combination of expert judgments, since the statistical accuracy of the SN decision maker is sometimes unacceptably low. On the other hand, it does outperform equal weighting in the majority of cases. The results here, though not overwhelmingly positive, do nonetheless motivate further research into social interaction methods for nominating and weighting experts. Indeed, a full expert judgment study with performance measurement requires an investment in time and effort, with a view to securing external validation. If high confidence in a comparable level of validation can be obtained by less intensive methods, this would be very welcome, and would facilitate the application of structured expert judgment in situations where the resources for a full study are not available. Likelihood weights are just as resource intensive as performance-based weights, and the evidence presented here suggests that they are inferior to performance-based weights with regard to those scoring variables which are optimized in performance weights (calibration and information). Perhaps surprisingly, they are also inferior with regard to likelihood. Their use is further discouraged by the fact that they constitute a strongly improper scoring rule

  5. Learning Gene Regulatory Networks Computationally from Gene Expression Data Using Weighted Consensus

    KAUST Repository

    Fujii, Chisato

    2015-04-16

    Gene regulatory networks analyze the relationships between genes allowing us to un- derstand the gene regulatory interactions in systems biology. Gene expression data from the microarray experiments is used to obtain the gene regulatory networks. How- ever, the microarray data is discrete, noisy and non-linear which makes learning the networks a challenging problem and existing gene network inference methods do not give consistent results. Current state-of-the-art study uses the average-ranking-based consensus method to combine and average the ranked predictions from individual methods. However each individual method has an equal contribution to the consen- sus prediction. We have developed a linear programming-based consensus approach which uses learned weights from linear programming among individual methods such that the methods have di↵erent weights depending on their performance. Our result reveals that assigning di↵erent weights to individual methods rather than giving them equal weights improves the performance of the consensus. The linear programming- based consensus method is evaluated and it had the best performance on in silico and Saccharomyces cerevisiae networks, and the second best on the Escherichia coli network outperformed by Inferelator Pipeline method which gives inconsistent results across a wide range of microarray data sets.

  6. Detecting community structure using label propagation with consensus weight in complex network

    International Nuclear Information System (INIS)

    Liang Zong-Wen; Li Jian-Ping; Yang Fan; Petropulu Athina

    2014-01-01

    Community detection is a fundamental work to analyse the structural and functional properties of complex networks. The label propagation algorithm (LPA) is a near linear time algorithm to find a good community structure. Despite various subsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the basic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these consensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the edge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number of partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps, by computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter to adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an approach named the label propagation algorithm with consensus weight (LPAcw), and the experimental results showed that the LPAcw could enhance considerably both the stability and the accuracy of community partitions. (interdisciplinary physics and related areas of science and technology)

  7. Artificial neural networks using complex numbers and phase encoded weights.

    Science.gov (United States)

    Michel, Howard E; Awwal, Abdul Ahad S

    2010-04-01

    The model of a simple perceptron using phase-encoded inputs and complex-valued weights is proposed. The aggregation function, activation function, and learning rule for the proposed neuron are derived and applied to Boolean logic functions and simple computer vision tasks. The complex-valued neuron (CVN) is shown to be superior to traditional perceptrons. An improvement of 135% over the theoretical maximum of 104 linearly separable problems (of three variables) solvable by conventional perceptrons is achieved without additional logic, neuron stages, or higher order terms such as those required in polynomial logic gates. The application of CVN in distortion invariant character recognition and image segmentation is demonstrated. Implementation details are discussed, and the CVN is shown to be very attractive for optical implementation since optical computations are naturally complex. The cost of the CVN is less in all cases than the traditional neuron when implemented optically. Therefore, all the benefits of the CVN can be obtained without additional cost. However, on those implementations dependent on standard serial computers, CVN will be more cost effective only in those applications where its increased power can offset the requirement for additional neurons.

  8. Gain and exposure scheduling to compensate for photorefractive neural-network weight decay

    Science.gov (United States)

    Goldstein, Adam A.; Petrisor, Gregory C.; Jenkins, B. Keith

    1995-03-01

    A gain and exposure schedule that theoretically eliminates the effect of photorefractive weight decay for the general class of outer-product neural-network learning algorithms (e.g., backpropagation, Widrow-Hoff, perceptron) is presented. This schedule compensates for photorefractive diffraction-efficiency decay by iteratively increasing the spatial-light-modulator transfer function gain and decreasing the weight-update exposure time. Simulation results for the scheduling procedure, as applied to backpropagation learning for the exclusive-OR problem, show improved learning performance compared with results for networks trained without scheduling.

  9. Independent functional connectivity networks underpin food and monetary reward sensitivity in excess weight.

    Science.gov (United States)

    Verdejo-Román, Juan; Fornito, Alex; Soriano-Mas, Carles; Vilar-López, Raquel; Verdejo-García, Antonio

    2017-02-01

    Overvaluation of palatable food is a primary driver of obesity, and is associated with brain regions of the reward system. However, it remains unclear if this network is specialized in food reward, or generally involved in reward processing. We used functional magnetic resonance imaging (fMRI) to characterize functional connectivity during processing of food and monetary rewards. Thirty-nine adults with excess weight and 37 adults with normal weight performed the Willingness to Pay for Food task and the Monetary Incentive Delay task in the fMRI scanner. A data-driven graph approach was applied to compare whole-brain, task-related functional connectivity between groups. Excess weight was associated with decreased functional connectivity during the processing of food rewards in a network involving primarily frontal and striatal areas, and increased functional connectivity during the processing of monetary rewards in a network involving principally frontal and parietal areas. These two networks were topologically and anatomically distinct, and were independently associated with BMI. The processing of food and monetary rewards involve segregated neural networks, and both are altered in individuals with excess weight. Copyright © 2016 Elsevier Inc. All rights reserved.

  10. Tracking the Reorganization of Module Structure in Time-Varying Weighted Brain Functional Connectivity Networks.

    Science.gov (United States)

    Schmidt, Christoph; Piper, Diana; Pester, Britta; Mierau, Andreas; Witte, Herbert

    2018-05-01

    Identification of module structure in brain functional networks is a promising way to obtain novel insights into neural information processing, as modules correspond to delineated brain regions in which interactions are strongly increased. Tracking of network modules in time-varying brain functional networks is not yet commonly considered in neuroscience despite its potential for gaining an understanding of the time evolution of functional interaction patterns and associated changing degrees of functional segregation and integration. We introduce a general computational framework for extracting consensus partitions from defined time windows in sequences of weighted directed edge-complete networks and show how the temporal reorganization of the module structure can be tracked and visualized. Part of the framework is a new approach for computing edge weight thresholds for individual networks based on multiobjective optimization of module structure quality criteria as well as an approach for matching modules across time steps. By testing our framework using synthetic network sequences and applying it to brain functional networks computed from electroencephalographic recordings of healthy subjects that were exposed to a major balance perturbation, we demonstrate the framework's potential for gaining meaningful insights into dynamic brain function in the form of evolving network modules. The precise chronology of the neural processing inferred with our framework and its interpretation helps to improve the currently incomplete understanding of the cortical contribution for the compensation of such balance perturbations.

  11. On the approximation by single hidden layer feedforward neural networks with fixed weights

    OpenAIRE

    Guliyev, Namig J.; Ismailov, Vugar E.

    2017-01-01

    International audience; Feedforward neural networks have wide applicability in various disciplines of science due to their universal approximation property. Some authors have shown that single hidden layer feedforward neural networks (SLFNs) with fixed weights still possess the universal approximation property provided that approximated functions are univariate. But this phenomenon does not lay any restrictions on the number of neurons in the hidden layer. The more this number, the more the p...

  12. Empirical study on a directed and weighted bus transport network in China

    Science.gov (United States)

    Feng, Shumin; Hu, Baoyu; Nie, Cen; Shen, Xianghao

    2016-01-01

    Bus transport networks are directed complex networks that consist of routes, stations, and passenger flow. In this study, the concept of duplication factor is introduced to analyze the differences between uplinks and downlinks for the bus transport network of Harbin (BTN-H). Further, a new representation model for BTNs is proposed, named as directed-space P. Two empirical characteristics of BTN-H are reported in this paper. First, the cumulative distributions of weighted degree, degree, number of routes that connect to each station, and node weight (peak-hour trips at a station) uniformly follow the exponential law. Meanwhile, the node weight shows positive correlations with the corresponding weighted degree, degree, and number of routes that connect to a station. Second, a new richness parameter of a node is explored by its node weight and the connectivity, weighted connectivity, average shortest path length and efficiency between rich nodes can be fitted by composite exponential functions to demonstrate the rich-club phenomenon.

  13. Visualizing weighted networks: a performance comparison of adjacency matrices versus node-link diagrams

    Science.gov (United States)

    McIntire, John P.; Osesina, O. Isaac; Bartley, Cecilia; Tudoreanu, M. Eduard; Havig, Paul R.; Geiselman, Eric E.

    2012-06-01

    Ensuring the proper and effective ways to visualize network data is important for many areas of academia, applied sciences, the military, and the public. Fields such as social network analysis, genetics, biochemistry, intelligence, cybersecurity, neural network modeling, transit systems, communications, etc. often deal with large, complex network datasets that can be difficult to interact with, study, and use. There have been surprisingly few human factors performance studies on the relative effectiveness of different graph drawings or network diagram techniques to convey information to a viewer. This is particularly true for weighted networks which include the strength of connections between nodes, not just information about which nodes are linked to other nodes. We describe a human factors study in which participants performed four separate network analysis tasks (finding a direct link between given nodes, finding an interconnected node between given nodes, estimating link strengths, and estimating the most densely interconnected nodes) on two different network visualizations: an adjacency matrix with a heat-map versus a node-link diagram. The results should help shed light on effective methods of visualizing network data for some representative analysis tasks, with the ultimate goal of improving usability and performance for viewers of network data displays.

  14. Topology Detection for Output-Coupling Weighted Complex Dynamical Networks with Coupling and Transmission Delays

    Directory of Open Access Journals (Sweden)

    Xinwei Wang

    2017-01-01

    Full Text Available Topology detection for output-coupling weighted complex dynamical networks with two types of time delays is investigated in this paper. Different from existing literatures, coupling delay and transmission delay are simultaneously taken into account in the output-coupling network. Based on the idea of the state observer, we build the drive-response system and apply LaSalle’s invariance principle to the error dynamical system of the drive-response system. Several convergent criteria are deduced in the form of algebraic inequalities. Some numerical simulations for the complex dynamical network, with node dynamics being chaotic, are given to verify the effectiveness of the proposed scheme.

  15. Online Self-Organizing Network Control with Time Averaged Weighted Throughput Objective

    Directory of Open Access Journals (Sweden)

    Zhicong Zhang

    2018-01-01

    Full Text Available We study an online multisource multisink queueing network control problem characterized with self-organizing network structure and self-organizing job routing. We decompose the self-organizing queueing network control problem into a series of interrelated Markov Decision Processes and construct a control decision model for them based on the coupled reinforcement learning (RL architecture. To maximize the mean time averaged weighted throughput of the jobs through the network, we propose a reinforcement learning algorithm with time averaged reward to deal with the control decision model and obtain a control policy integrating the jobs routing selection strategy and the jobs sequencing strategy. Computational experiments verify the learning ability and the effectiveness of the proposed reinforcement learning algorithm applied in the investigated self-organizing network control problem.

  16. Topology of the Erasmus student mobility network

    Science.gov (United States)

    Derzsi, A.; Derzsy, N.; Káptalan, E.; Néda, Z.

    2011-07-01

    The collaboration network generated by the Erasmus student mobilities in the year 2003 is analyzed and modeled. Nodes of this bipartite network are European universities and links are the Erasmus mobilities between these universities. This network is a complex directed and weighted graph. The non-directed and non-weighted projection of this network does not exhibit a scale-free nature, but proves to be a small-word type random network with a giant component. The connectivity data indicates an exponential degree distribution, a relatively high clustering coefficient and a small radius. It can be easily modeled by using a simple configuration model and arguing the exponential degree distribution. The weighted and directed version of the network can also be described by means of simple random network models.

  17. Learning gene regulatory networks from gene expression data using weighted consensus

    KAUST Repository

    Fujii, Chisato; Kuwahara, Hiroyuki; Yu, Ge; Guo, Lili; Gao, Xin

    2016-01-01

    An accurate determination of the network structure of gene regulatory systems from high-throughput gene expression data is an essential yet challenging step in studying how the expression of endogenous genes is controlled through a complex interaction of gene products and DNA. While numerous methods have been proposed to infer the structure of gene regulatory networks, none of them seem to work consistently over different data sets with high accuracy. A recent study to compare gene network inference methods showed that an average-ranking-based consensus method consistently performs well under various settings. Here, we propose a linear programming-based consensus method for the inference of gene regulatory networks. Unlike the average-ranking-based one, which treats the contribution of each individual method equally, our new consensus method assigns a weight to each method based on its credibility. As a case study, we applied the proposed consensus method on synthetic and real microarray data sets, and compared its performance to that of the average-ranking-based consensus and individual inference methods. Our results show that our weighted consensus method achieves superior performance over the unweighted one, suggesting that assigning weights to different individual methods rather than giving them equal weights improves the accuracy. © 2016 Elsevier B.V.

  18. Sea Surface Temperature Modeling using Radial Basis Function Networks With a Dynamically Weighted Particle Filter

    KAUST Repository

    Ryu, Duchwan; Liang, Faming; Mallick, Bani K.

    2013-01-01

    be modeled by a dynamic system which changes with time and location. In this article, we propose a radial basis function network-based dynamic model which is able to catch the nonlinearity of the data and propose to use the dynamically weighted particle

  19. Learning gene regulatory networks from gene expression data using weighted consensus

    KAUST Repository

    Fujii, Chisato

    2016-08-25

    An accurate determination of the network structure of gene regulatory systems from high-throughput gene expression data is an essential yet challenging step in studying how the expression of endogenous genes is controlled through a complex interaction of gene products and DNA. While numerous methods have been proposed to infer the structure of gene regulatory networks, none of them seem to work consistently over different data sets with high accuracy. A recent study to compare gene network inference methods showed that an average-ranking-based consensus method consistently performs well under various settings. Here, we propose a linear programming-based consensus method for the inference of gene regulatory networks. Unlike the average-ranking-based one, which treats the contribution of each individual method equally, our new consensus method assigns a weight to each method based on its credibility. As a case study, we applied the proposed consensus method on synthetic and real microarray data sets, and compared its performance to that of the average-ranking-based consensus and individual inference methods. Our results show that our weighted consensus method achieves superior performance over the unweighted one, suggesting that assigning weights to different individual methods rather than giving them equal weights improves the accuracy. © 2016 Elsevier B.V.

  20. Dynamics of an SAITS alcoholism model on unweighted and weighted networks

    Science.gov (United States)

    Huo, Hai-Feng; Cui, Fang-Fang; Xiang, Hong

    2018-04-01

    A novel SAITS alcoholism model on networks is introduced, in which alcoholics are divided into light problem alcoholics and heavy problem alcoholics. Susceptible individuals can enter into the compartment of heavy problem alcoholics directly by contacting with light problem alcoholics or heavy problem alcoholics and the heavy problem alcoholics who receive treatment can relapse into the compartment of heavy problem alcoholics are also considered. First, the dynamics of our model on unweighted networks, including the basic reproduction number, existence and stability of equilibria are studied. Second, the models with fixed weighted and adaptive weighted networks are introduced and investigated. At last, some simulations are presented to illustrate and extend our results. Our results show that it is very important to treat alcoholics to quit the drinking.

  1. Weighted radial dimension: an improved fractal measurement for highway transportation networks distribution

    Science.gov (United States)

    Feng, Yongjiu; Liu, Miaolong; Tong, Xiaohua

    2007-06-01

    An improved fractal measurement, the weighted radial dimension, is put forward for highway transportation networks distribution. The radial dimension (DL), originated from subway investigation in Stuttgart, is a fractal measurement for transportation systems under ideal assumption considering all the network lines to be homogeneous curves, ignoring the difference on spatial structure, quality and level, especially the highway networks. Considering these defects of radial dimension, an improved fractal measurement called weighted radial dimension (D WL) is introduced and the transportation system in Guangdong province is studied in detail using this novel method. Weighted radial dimensions are measured and calculated, and the spatial structure, intensity and connectivity of transportation networks are discussed in Guangdong province and the four sub-areas: the Pearl River Delta area, the East Costal area, the West Costal area and the Northern Guangdong area. In Guangdong province, the fractal spatial pattern characteristics of transportation system vary remarkably: it is the highest in the Pearl River Delta area, moderate in Costal area and lowest in the Northern Guangdong area. With the Pearl River Delta area as the centre, the weighted radial dimensions decrease with the distance increasing, while the decline level is smaller in the costal area and greater in the Northern Guangdong province. By analysis of the conic of highway density, it is recognized that the density decrease with the distance increasing from the calculation centre (Guangzhou), demonstrating the same trend as weighted radial dimensions shown. Evidently, the improved fractal measurement, weighted radial dimension, is an indictor describing the characteristics of highway transportation system more effectively and accurately.

  2. Dynamic fMRI networks predict success in a behavioral weight loss program among older adults.

    Science.gov (United States)

    Mokhtari, Fatemeh; Rejeski, W Jack; Zhu, Yingying; Wu, Guorong; Simpson, Sean L; Burdette, Jonathan H; Laurienti, Paul J

    2018-06-01

    More than one-third of adults in the United States are obese, with a higher prevalence among older adults. Obesity among older adults is a major cause of physical dysfunction, hypertension, diabetes, and coronary heart diseases. Many people who engage in lifestyle weight loss interventions fail to reach targeted goals for weight loss, and most will regain what was lost within 1-2 years following cessation of treatment. This variability in treatment efficacy suggests that there are important phenotypes predictive of success with intentional weight loss that could lead to tailored treatment regimen, an idea that is consistent with the concept of precision-based medicine. Although the identification of biochemical and metabolic phenotypes are one potential direction of research, neurobiological measures may prove useful as substantial behavioral change is necessary to achieve success in a lifestyle intervention. In the present study, we use dynamic brain networks from functional magnetic resonance imaging (fMRI) data to prospectively identify individuals most likely to succeed in a behavioral weight loss intervention. Brain imaging was performed in overweight or obese older adults (age: 65-79 years) who participated in an 18-month lifestyle weight loss intervention. Machine learning and functional brain networks were combined to produce multivariate prediction models. The prediction accuracy exceeded 95%, suggesting that there exists a consistent pattern of connectivity which correctly predicts success with weight loss at the individual level. Connectivity patterns that contributed to the prediction consisted of complex multivariate network components that substantially overlapped with known brain networks that are associated with behavior emergence, self-regulation, body awareness, and the sensory features of food. Future work on independent datasets and diverse populations is needed to corroborate our findings. Additionally, we believe that efforts can begin to

  3. Tree-average distances on certain phylogenetic networks have their weights uniquely determined.

    Science.gov (United States)

    Willson, Stephen J

    2012-01-01

    A phylogenetic network N has vertices corresponding to species and arcs corresponding to direct genetic inheritance from the species at the tail to the species at the head. Measurements of DNA are often made on species in the leaf set, and one seeks to infer properties of the network, possibly including the graph itself. In the case of phylogenetic trees, distances between extant species are frequently used to infer the phylogenetic trees by methods such as neighbor-joining. This paper proposes a tree-average distance for networks more general than trees. The notion requires a weight on each arc measuring the genetic change along the arc. For each displayed tree the distance between two leaves is the sum of the weights along the path joining them. At a hybrid vertex, each character is inherited from one of its parents. We will assume that for each hybrid there is a probability that the inheritance of a character is from a specified parent. Assume that the inheritance events at different hybrids are independent. Then for each displayed tree there will be a probability that the inheritance of a given character follows the tree; this probability may be interpreted as the probability of the tree. The tree-average distance between the leaves is defined to be the expected value of their distance in the displayed trees. For a class of rooted networks that includes rooted trees, it is shown that the weights and the probabilities at each hybrid vertex can be calculated given the network and the tree-average distances between the leaves. Hence these weights and probabilities are uniquely determined. The hypotheses on the networks include that hybrid vertices have indegree exactly 2 and that vertices that are not leaves have a tree-child.

  4. Modeling Multilevel Supplier Selection Problem Based on Weighted-Directed Network and Its Solution

    Directory of Open Access Journals (Sweden)

    Chia-Te Wei

    2017-01-01

    Full Text Available With the rapid development of economy, the supplier network is becoming more and more complicated. It is important to choose the right suppliers for improving the efficiency of the supply chain, so how to choose the right ones is one of the important research directions of supply chain management. This paper studies the partner selection problem from the perspective of supplier network global optimization. Firstly, this paper discusses and forms the evaluation system to estimate the supplier from the two indicators of risk and greenness and then applies the value as the weight of the network between two nodes to build a weighted-directed supplier network; secondly, the study establishes the optimal combination model of supplier selection based on the global network perspective and solves the model by the dynamic programming-tabu search algorithm and the improved ant colony algorithm, respectively; finally, different scale simulation examples are given to testify the efficiency of the two algorithms. The results show that the ant colony algorithm is superior to the tabu search one as a whole, but the latter is slightly better than the former when network scale is small.

  5. A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks

    Directory of Open Access Journals (Sweden)

    Rui Fan

    2017-12-01

    Full Text Available Betweenness, a widely employed centrality measure in network science, is a decent proxy for investigating network loads and rankings. However, its extremely high computational cost greatly hinders its applicability in large networks. Although several parallel algorithms have been presented to reduce its calculation cost for unweighted networks, a fast solution for weighted networks, which are commonly encountered in many realistic applications, is still lacking. In this study, we develop an efficient parallel GPU-based approach to boost the calculation of the betweenness centrality (BC for large weighted networks. We parallelize the traditional Dijkstra algorithm by selecting more than one frontier vertex each time and then inspecting the frontier vertices simultaneously. By combining the parallel SSSP algorithm with the parallel BC framework, our GPU-based betweenness algorithm achieves much better performance than its CPU counterparts. Moreover, to further improve performance, we integrate the work-efficient strategy, and to address the load-imbalance problem, we introduce a warp-centric technique, which assigns many threads rather than one to a single frontier vertex. Experiments on both realistic and synthetic networks demonstrate the efficiency of our solution, which achieves 2.9× to 8.44× speedups over the parallel CPU implementation. Our algorithm is open-source and free to the community; it is publicly available through https://dx.doi.org/10.6084/m9.figshare.4542405. Considering the pervasive deployment and declining price of GPUs in personal computers and servers, our solution will offer unprecedented opportunities for exploring betweenness-related problems and will motivate follow-up efforts in network science.

  6. Your Health Buddies Matter: Preferential Selection and Social Influence on Weight Management in an Online Health Social Network.

    Science.gov (United States)

    Meng, Jingbo

    2016-12-01

    A growing number of online social networks are designed with the intention to promote health by providing virtual space wherein individuals can seek and share information and support with similar others. Research has shown that real-world social networks have a significant influence on one's health behavior and outcomes. However, there is a dearth of studies on how individuals form social networks in virtual space and whether such online social networks exert any impact on individuals' health outcomes. Built on the Multi-Theoretical Multilevel (MTML) framework and drawing from literature on social influence, this study examined the mechanisms underlying the formation of an online health social network and empirically tested social influence on individual health outcomes through the network. Situated in a weight management social networking site, the study tracked a health buddy network of 709 users and their weight management activities and outcomes for 4 months. Actor-based modeling was used to test the joint dynamics of preferential selection and social influence among health buddies. The results showed that baseline, inbreeding, and health status homophily significantly predicted preferential selection of health buddies in the weight management social networking site, whereas self-interest in seeking experiential health information did not. The study also found peer influence of online health buddy networks on individual weight outcomes, such that an individual's odds of losing weight increased if, on average, the individual's health buddies were losing weight.

  7. Broiler weight estimation based on machine vision and artificial neural network.

    Science.gov (United States)

    Amraei, S; Abdanan Mehdizadeh, S; Salari, S

    2017-04-01

    1. Machine vision and artificial neural network (ANN) procedures were used to estimate live body weight of broiler chickens in 30 1-d-old broiler chickens reared for 42 d. 2. Imaging was performed two times daily. To localise chickens within the pen, an ellipse fitting algorithm was used and the chickens' head and tail removed using the Chan-Vese method. 3. The correlations between the body weight and 6 physical extracted features indicated that there were strong correlations between body weight and the 5 features including area, perimeter, convex area, major and minor axis length. 5. According to statistical analysis there was no significant difference between morning and afternoon data over 42 d. 6. In an attempt to improve the accuracy of live weight approximation different ANN techniques, including Bayesian regulation, Levenberg-Marquardt, Scaled conjugate gradient and gradient descent were used. Bayesian regulation with R 2 value of 0.98 was the best network for prediction of broiler weight. 7. The accuracy of the machine vision technique was examined and most errors were less than 50 g.

  8. WMAXC: a weighted maximum clique method for identifying condition-specific sub-network.

    Directory of Open Access Journals (Sweden)

    Bayarbaatar Amgalan

    Full Text Available Sub-networks can expose complex patterns in an entire bio-molecular network by extracting interactions that depend on temporal or condition-specific contexts. When genes interact with each other during cellular processes, they may form differential co-expression patterns with other genes across different cell states. The identification of condition-specific sub-networks is of great importance in investigating how a living cell adapts to environmental changes. In this work, we propose the weighted MAXimum clique (WMAXC method to identify a condition-specific sub-network. WMAXC first proposes scoring functions that jointly measure condition-specific changes to both individual genes and gene-gene co-expressions. It then employs a weaker formula of a general maximum clique problem and relates the maximum scored clique of a weighted graph to the optimization of a quadratic objective function under sparsity constraints. We combine a continuous genetic algorithm and a projection procedure to obtain a single optimal sub-network that maximizes the objective function (scoring function over the standard simplex (sparsity constraints. We applied the WMAXC method to both simulated data and real data sets of ovarian and prostate cancer. Compared with previous methods, WMAXC selected a large fraction of cancer-related genes, which were enriched in cancer-related pathways. The results demonstrated that our method efficiently captured a subset of genes relevant under the investigated condition.

  9. A Novel Entropy-Based Centrality Approach for Identifying Vital Nodes in Weighted Networks

    Directory of Open Access Journals (Sweden)

    Tong Qiao

    2018-04-01

    Full Text Available Measuring centrality has recently attracted increasing attention, with algorithms ranging from those that simply calculate the number of immediate neighbors and the shortest paths to those that are complicated iterative refinement processes and objective dynamical approaches. Indeed, vital nodes identification allows us to understand the roles that different nodes play in the structure of a network. However, quantifying centrality in complex networks with various topological structures is not an easy task. In this paper, we introduce a novel definition of entropy-based centrality, which can be applicable to weighted directed networks. By design, the total power of a node is divided into two parts, including its local power and its indirect power. The local power can be obtained by integrating the structural entropy, which reveals the communication activity and popularity of each node, and the interaction frequency entropy, which indicates its accessibility. In addition, the process of influence propagation can be captured by the two-hop subnetworks, resulting in the indirect power. In order to evaluate the performance of the entropy-based centrality, we use four weighted real-world networks with various instance sizes, degree distributions, and densities. Correspondingly, these networks are adolescent health, Bible, United States (US airports, and Hep-th, respectively. Extensive analytical results demonstrate that the entropy-based centrality outperforms degree centrality, betweenness centrality, closeness centrality, and the Eigenvector centrality.

  10. Energy Efficient and Safe Weighted Clustering Algorithm for Mobile Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Amine Dahane

    2015-01-01

    Full Text Available The main concern of clustering approaches for mobile wireless sensor networks (WSNs is to prolong the battery life of the individual sensors and the network lifetime. For a successful clustering approach the need of a powerful mechanism to safely elect a cluster head remains a challenging task in many research works that take into account the mobility of the network. The approach based on the computing of the weight of each node in the network is one of the proposed techniques to deal with this problem. In this paper, we propose an energy efficient and safe weighted clustering algorithm (ES-WCA for mobile WSNs using a combination of five metrics. Among these metrics lies the behavioral level metric which promotes a safe choice of a cluster head in the sense where this last one will never be a malicious node. Moreover, the highlight of our work is summarized in a comprehensive strategy for monitoring the network, in order to detect and remove the malicious nodes. We use simulation study to demonstrate the performance of the proposed algorithm.

  11. Characterizing system dynamics with a weighted and directed network constructed from time series data

    International Nuclear Information System (INIS)

    Sun, Xiaoran; Small, Michael; Zhao, Yi; Xue, Xiaoping

    2014-01-01

    In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the time series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics

  12. Characterizing system dynamics with a weighted and directed network constructed from time series data

    Energy Technology Data Exchange (ETDEWEB)

    Sun, Xiaoran, E-mail: sxr0806@gmail.com [Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen 518055 (China); School of Mathematics and Statistics, The University of Western Australia, Crawley WA 6009 (Australia); Small, Michael, E-mail: michael.small@uwa.edu.au [School of Mathematics and Statistics, The University of Western Australia, Crawley WA 6009 (Australia); Zhao, Yi [Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen 518055 (China); Xue, Xiaoping [Department of Mathematics, Harbin Institute of Technology, Harbin 150025 (China)

    2014-06-15

    In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the time series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics.

  13. Access Selection Algorithm of Heterogeneous Wireless Networks for Smart Distribution Grid Based on Entropy-Weight and Rough Set

    Science.gov (United States)

    Xiang, Min; Qu, Qinqin; Chen, Cheng; Tian, Li; Zeng, Lingkang

    2017-11-01

    To improve the reliability of communication service in smart distribution grid (SDG), an access selection algorithm based on dynamic network status and different service types for heterogeneous wireless networks was proposed. The network performance index values were obtained in real time by multimode terminal and the variation trend of index values was analyzed by the growth matrix. The index weights were calculated by entropy-weight and then modified by rough set to get the final weights. Combining the grey relational analysis to sort the candidate networks, and the optimum communication network is selected. Simulation results show that the proposed algorithm can implement dynamically access selection in heterogeneous wireless networks of SDG effectively and reduce the network blocking probability.

  14. Supervised maximum-likelihood weighting of composite protein networks for complex prediction

    Directory of Open Access Journals (Sweden)

    Yong Chern Han

    2012-12-01

    Full Text Available Abstract Background Protein complexes participate in many important cellular functions, so finding the set of existent complexes is essential for understanding the organization and regulation of processes in the cell. With the availability of large amounts of high-throughput protein-protein interaction (PPI data, many algorithms have been proposed to discover protein complexes from PPI networks. However, such approaches are hindered by the high rate of noise in high-throughput PPI data, including spurious and missing interactions. Furthermore, many transient interactions are detected between proteins that are not from the same complex, while not all proteins from the same complex may actually interact. As a result, predicted complexes often do not match true complexes well, and many true complexes go undetected. Results We address these challenges by integrating PPI data with other heterogeneous data sources to construct a composite protein network, and using a supervised maximum-likelihood approach to weight each edge based on its posterior probability of belonging to a complex. We then use six different clustering algorithms, and an aggregative clustering strategy, to discover complexes in the weighted network. We test our method on Saccharomyces cerevisiae and Homo sapiens, and show that complex discovery is improved: compared to previously proposed supervised and unsupervised weighting approaches, our method recalls more known complexes, achieves higher precision at all recall levels, and generates novel complexes of greater functional similarity. Furthermore, our maximum-likelihood approach allows learned parameters to be used to visualize and evaluate the evidence of novel predictions, aiding human judgment of their credibility. Conclusions Our approach integrates multiple data sources with supervised learning to create a weighted composite protein network, and uses six clustering algorithms with an aggregative clustering strategy to

  15. Quantization and training of object detection networks with low-precision weights and activations

    Science.gov (United States)

    Yang, Bo; Liu, Jian; Zhou, Li; Wang, Yun; Chen, Jie

    2018-01-01

    As convolutional neural networks have demonstrated state-of-the-art performance in object recognition and detection, there is a growing need for deploying these systems on resource-constrained mobile platforms. However, the computational burden and energy consumption of inference for these networks are significantly higher than what most low-power devices can afford. To address these limitations, this paper proposes a method to train object detection networks with low-precision weights and activations. The probability density functions of weights and activations of each layer are first directly estimated using piecewise Gaussian models. Then, the optimal quantization intervals and step sizes for each convolution layer are adaptively determined according to the distribution of weights and activations. As the most computationally expensive convolutions can be replaced by effective fixed point operations, the proposed method can drastically reduce computation complexity and memory footprint. Performing on the tiny you only look once (YOLO) and YOLO architectures, the proposed method achieves comparable accuracy to their 32-bit counterparts. As an illustration, the proposed 4-bit and 8-bit quantized versions of the YOLO model achieve a mean average precision of 62.6% and 63.9%, respectively, on the Pascal visual object classes 2012 test dataset. The mAP of the 32-bit full-precision baseline model is 64.0%.

  16. Cosmological Simulations with Scale-Free Initial Conditions. I. Adiabatic Hydrodynamics

    International Nuclear Information System (INIS)

    Owen, J.M.; Weinberg, D.H.; Evrard, A.E.; Hernquist, L.; Katz, N.

    1998-01-01

    We analyze hierarchical structure formation based on scale-free initial conditions in an Einstein endash de Sitter universe, including a baryonic component with Ω bary = 0.05. We present three independent, smoothed particle hydrodynamics (SPH) simulations, performed at two resolutions (32 3 and 64 3 dark matter and baryonic particles) and with two different SPH codes (TreeSPH and P3MSPH). Each simulation is based on identical initial conditions, which consist of Gaussian-distributed initial density fluctuations that have a power spectrum P(k) ∝ k -1 . The baryonic material is modeled as an ideal gas subject only to shock heating and adiabatic heating and cooling; radiative cooling and photoionization heating are not included. The evolution is expected to be self-similar in time, and under certain restrictions we identify the expected scalings for many properties of the distribution of collapsed objects in all three realizations. The distributions of dark matter masses, baryon masses, and mass- and emission-weighted temperatures scale quite reliably. However, the density estimates in the central regions of these structures are determined by the degree of numerical resolution. As a result, mean gas densities and Bremsstrahlung luminosities obey the expected scalings only when calculated within a limited dynamic range in density contrast. The temperatures and luminosities of the groups show tight correlations with the baryon masses, which we find can be well represented by power laws. The Press-Schechter (PS) approximation predicts the distribution of group dark matter and baryon masses fairly well, though it tends to overestimate the baryon masses. Combining the PS mass distribution with the measured relations for T(M) and L(M) predicts the temperature and luminosity distributions fairly accurately, though there are some discrepancies at high temperatures/luminosities. In general the three simulations agree well for the properties of resolved groups, where a group

  17. Statistical evaluation of waveform collapse reveals scale-free properties of neuronal avalanches

    Directory of Open Access Journals (Sweden)

    Aleena eShaukat

    2016-04-01

    Full Text Available Neural avalanches are a prominent form of brain activity characterized by network-wide bursts whose statistics follow a power-law distribution with a slope near 3/2. Recent work suggests that avalanches of different durations can be rescaled and thus collapsed together. This collapse mirrors work in statistical physics where it is proposed to form a signature of systems evolving in a critical state. However, no rigorous statistical test has been proposed to examine the degree to which neuronal avalanches collapse together. Here, we describe a statistical test based on functional data analysis, where raw avalanches are first smoothed with a Fourier basis, then rescaled using a time-warping function. Finally, an F ratio test combined with a bootstrap permutation is employed to determine if avalanches collapse together in a statistically reliable fashion. To illustrate this approach, we recorded avalanches from cortical cultures on multielectrode arrays as in previous work. Analyses show that avalanches of various durations can be collapsed together in a statistically robust fashion. However, a principal components analysis revealed that the offset of avalanches resulted in marked variance in the time-warping function, thus arguing for limitations to the strict fractal nature of avalanche dynamics. We compared these results with those obtained from cultures treated with an AMPA/NMDA receptor antagonist (APV/DNQX, which yield a power-law of avalanche durations with a slope greater than 3/2. When collapsed together, these avalanches showed marked misalignments both at onset and offset time-points. In sum, the proposed statistical evaluation suggests the presence of scale-free avalanche waveforms and constitutes an avenue for examining critical dynamics in neuronal systems.

  18. A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Matheswaran Saravanan

    2014-01-01

    Full Text Available Wireless sensor network (WSN consists of sensor nodes that need energy efficient routing techniques as they have limited battery power, computing, and storage resources. WSN routing protocols should enable reliable multihop communication with energy constraints. Clustering is an effective way to reduce overheads and when this is aided by effective resource allocation, it results in reduced energy consumption. In this work, a novel hybrid evolutionary algorithm called Bee Algorithm-Simulated Annealing Weighted Minimal Spanning Tree (BASA-WMST routing is proposed in which randomly deployed sensor nodes are split into the best possible number of independent clusters with cluster head and optimal route. The former gathers data from sensors belonging to the cluster, forwarding them to the sink. The shortest intrapath selection for the cluster is selected using Weighted Minimum Spanning Tree (WMST. The proposed algorithm computes the distance-based Minimum Spanning Tree (MST of the weighted graph for the multihop network. The weights are dynamically changed based on the energy level of each sensor during route selection and optimized using the proposed bee algorithm simulated annealing algorithm.

  19. Using the Weighted Rich-Club Coefficient to Explore Traffic Organization in Mobility Networks

    Science.gov (United States)

    Ramasco, José J.; Colizza, Vittoria; Panzarasa, Pietro

    The aim of a transportation system is to enable the movement of goods or persons between any two locations with the highest possible efficiency. This simple principle inspires highly complex structures in a number of real-world mobility networks of different kind that often exhibit a hierarchical organization. In this paper, we rely on a framework that has been recently introduced for the study of the management and distribution of resources in different real-world systems. This framework offers a new method for exploring the tendency of the top elements to form clubs with exclusive control over the system’s resources. Such tendency is known as the weighted rich-club effect. We apply the method to three cases of mobility networks at different scales of resolution: the US air transportation network, the US counties daily commuting, and the Italian municipalities commuting datasets. In all cases, a strong weighted rich-club effect is found. We also show that a very simple model can account for part of the intrinsic features of mobility networks, while deviations found between the theoretical predictions and the empirical observations point to the presence of higher levels of organization.

  20. A weighted higher-order network analysis of fine particulate matter (PM2.5) transport in Yangtze River Delta

    Science.gov (United States)

    Wang, Yufang; Wang, Haiyan; Zhang, Shuhua

    2018-04-01

    Specification of PM2.5 transmission characteristics is important for pollution control, policymaking and prediction. In this paper, we propose weights for motif instances, thereby to implement a weighted higher-order clustering algorithm for a weighted, directed PM2.5 network in the Yangtze River Delta (YRD) of China. The weighted, directed network we create in this paper includes information on meteorological conditions of wind speed and wind direction, plus data on geographic distance and PM2.5 concentrations. We aim to reveal PM2.5 mobility between cities in the YRD. Major potential PM2.5 contributors and closely interacted clusters are identified in the network of 178 air quality stations in the YRD. To our knowledge, it is the first work to incorporate weight information into the higher-order network analysis to study PM2.5 transport.

  1. Storage capacity of multi-layered neural networks with binary weights

    International Nuclear Information System (INIS)

    Tarkowski, W.; Hemmen, J.L. van

    1997-01-01

    Using statistical physics methods we investigate two-layered perceptrons which consist of N binary input neurons, K hidden units and a single output node. Four basic types of such networks are considered: the so-called Committee, Parity, and AND Machines which makes a decision based on a majority, parity, and the logical AND rules, respectively (for these cases the weights that connect hidden units and output node are taken to be equal to one), and the General Machine where one allows all the synaptic couplings to vary. For these kinds of network we examine two types of architecture: fully connected and three-connected ones (with overlapping and non-overlapping receptive fields, respectively). All the above mentioned machines heave binary weights. Our basic interest is focused on the storage capabilities of such networks which realize p= αN random, unbiased dichotomies (α denotes the so-called storage ratio). The analysis is done using the annealed approximation and is valid for all values of K. The critical (maximal) storage capacity of the fully connected Committee Machine reads α c =K, while in the case of the three-structure one gets α c =1, independent of K. The results obtained for the Parity Machine are exactly the same as those for the Committee network. The optimal storage of the AND Machine depends on distribution of the outputs for the patterns. These associations are studied in detail. We have found also that the capacity of the General Machines remains the same as compared to systems with fixed weights between intermediate layer and the output node. Some of the findings (especially those concerning the storage capacity of the Parity Machine) are in a good agreement with known numerical results. (author)

  2. Use of a mobile social networking intervention for weight management: a mixed-methods study protocol.

    Science.gov (United States)

    Laranjo, Liliana; Lau, Annie Y S; Martin, Paige; Tong, Huong Ly; Coiera, Enrico

    2017-07-12

    Obesity and physical inactivity are major societal challenges and significant contributors to the global burden of disease and healthcare costs. Information and communication technologies are increasingly being used in interventions to promote behaviour change in diet and physical activity. In particular, social networking platforms seem promising for the delivery of weight control interventions.We intend to pilot test an intervention involving the use of a social networking mobile application and tracking devices ( Fitbit Flex 2 and Fitbit Aria scale) to promote the social comparison of weight and physical activity, in order to evaluate whether mechanisms of social influence lead to changes in those outcomes over the course of the study. Mixed-methods study involving semi-structured interviews and a pre-post quasi-experimental pilot with one arm, where healthy participants in different body mass index (BMI) categories, aged between 19 and 35 years old, will be subjected to a social networking intervention over a 6-month period. The primary outcome is the average difference in weight before and after the intervention. Secondary outcomes include BMI, number of steps per day, engagement with the intervention, social support and system usability. Semi-structured interviews will assess participants' expectations and perceptions regarding the intervention. Ethics approval was granted by Macquarie University's Human Research Ethics Committee for Medical Sciences on 3 November 2016 (ethics reference number 5201600716).The social network will be moderated by a researcher with clinical expertise, who will monitor and respond to concerns raised by participants. Monitoring will involve daily observation of measures collected by the fitness tracker and the wireless scale, as well as continuous supervision of forum interactions and posts. Additionally, a protocol is in place to monitor for participant misbehaviour and direct participants-in-need to appropriate sources of help

  3. Interdependency enriches the spatial reciprocity in prisoner's dilemma game on weighted networks

    Science.gov (United States)

    Meng, Xiaokun; Sun, Shiwen; Li, Xiaoxuan; Wang, Li; Xia, Chengyi; Sun, Junqing

    2016-01-01

    To model the evolution of cooperation under the realistic scenarios, we propose an interdependent network-based game model which simultaneously considers the difference of individual roles in the spatial prisoner's dilemma game. In our model, the system is composed of two lattices on which an agent designated as a cooperator or defector will be allocated, meanwhile each agent will be endowed as a specific weight taking from three typical distributions on one lattice (i.e., weighted lattice), and set to be 1.0 on the other one (i.e., un-weighted or standard lattice). In addition, the interdependency will be built through the utility coupling between point-to-point partners. Extensive simulations indicate that the cooperation will be continuously elevated for the weighted lattice as the utility coupling strength (α) increases; while the cooperation will take on a nontrivial evolution on the standard lattice as α varies, and will be still greatly promoted when compared to the case of α = 0. At the same time, the full T - K phase diagrams are also explored to illustrate the evolutionary behaviors, and it is powerfully shown that the interdependency drives the defectors to survive within the narrower range, but individual weighting of utility will further broaden the coexistence space of cooperators and defectors, which renders the nontrivial evolution of cooperation in our model. Altogether, the current consequences about the evolution of cooperation will be helpful for us to provide the insights into the prevalent cooperation phenomenon within many real-world systems.

  4. An intelligent sales forecasting system through integration of artificial neural networks and fuzzy neural networks with fuzzy weight elimination.

    Science.gov (United States)

    Kuo, R J; Wu, P; Wang, C P

    2002-09-01

    Sales forecasting plays a very prominent role in business strategy. Numerous investigations addressing this problem have generally employed statistical methods, such as regression or autoregressive and moving average (ARMA). However, sales forecasting is very complicated owing to influence by internal and external environments. Recently, artificial neural networks (ANNs) have also been applied in sales forecasting since their promising performances in the areas of control and pattern recognition. However, further improvement is still necessary since unique circumstances, e.g. promotion, cause a sudden change in the sales pattern. Thus, this study utilizes a proposed fuzzy neural network (FNN), which is able to eliminate the unimportant weights, for the sake of learning fuzzy IF-THEN rules obtained from the marketing experts with respect to promotion. The result from FNN is further integrated with the time series data through an ANN. Both the simulated and real-world problem results show that FNN with weight elimination can have lower training error compared with the regular FNN. Besides, real-world problem results also indicate that the proposed estimation system outperforms the conventional statistical method and single ANN in accuracy.

  5. Ventral and Dorsal Striatum Networks in Obesity: Link to Food Craving and Weight Gain.

    Science.gov (United States)

    Contreras-Rodríguez, Oren; Martín-Pérez, Cristina; Vilar-López, Raquel; Verdejo-Garcia, Antonio

    2017-05-01

    The food addiction model proposes that obesity overlaps with addiction in terms of neurobiological alterations in the striatum and related clinical manifestations (i.e., craving and persistence of unhealthy habits). Therefore, we aimed to examine the functional connectivity of the striatum in excess-weight versus normal-weight subjects and to determine the extent of the association between striatum connectivity and individual differences in food craving and changes in body mass index (BMI). Forty-two excess-weight participants (BMI > 25) and 39 normal-weight participants enrolled in the study. Functional connectivity in the ventral and dorsal striatum was indicated by seed-based analyses on resting-state data. Food craving was indicated with subjective ratings of visual cues of high-calorie food. Changes in BMI between baseline and 12 weeks follow-up were assessed in 28 excess-weight participants. Measures of connectivity in the ventral striatum and dorsal striatum were compared between groups and correlated with craving and BMI change. Participants with excess weight displayed increased functional connectivity between the ventral striatum and the medial prefrontal and parietal cortices and between the dorsal striatum and the somatosensory cortex. Dorsal striatum connectivity correlated with food craving and predicted BMI gains. Obesity is linked to alterations in the functional connectivity of dorsal striatal networks relevant to food craving and weight gain. These neural alterations are associated with habit learning and thus compatible with the food addiction model of obesity. Copyright © 2016 Society of Biological Psychiatry. Published by Elsevier Inc. All rights reserved.

  6. Dynamic quality of service differentiation using fixed code weight in optical CDMA networks

    Science.gov (United States)

    Kakaee, Majid H.; Essa, Shawnim I.; Abd, Thanaa H.; Seyedzadeh, Saleh

    2015-11-01

    The emergence of network-driven applications, such as internet, video conferencing, and online gaming, brings in the need for a network the environments with capability of providing diverse Quality of Services (QoS). In this paper, a new code family of novel spreading sequences, called a Multi-Service (MS) code, has been constructed to support multiple services in Optical- Code Division Multiple Access (CDMA) system. The proposed method uses fixed weight for all services, however reducing the interfering codewords for the users requiring higher QoS. The performance of the proposed code is demonstrated using mathematical analysis. It shown that the total number of served users with satisfactory BER of 10-9 using NB=2 is 82, while they are only 36 and 10 when NB=3 and 4 respectively. The developed MS code is compared with variable-weight codes such as Variable Weight-Khazani Syed (VW-KS) and Multi-Weight-Random Diagonal (MW-RD). Different numbers of basic users (NB) are used to support triple-play services (audio, data and video) with different QoS requirements. Furthermore, reference to the BER of 10-12, 10-9, and 10-3 for video, data and audio, respectively, the system can support up to 45 total users. Hence, results show that the technique can clearly provide a relative QoS differentiation with lower value of basic users can support larger number of subscribers as well as better performance in terms of acceptable BER of 10-9 at fixed code weight.

  7. Obtaining Arbitrary Prescribed Mean Field Dynamics for Recurrently Coupled Networks of Type-I Spiking Neurons with Analytically Determined Weights.

    Science.gov (United States)

    Nicola, Wilten; Tripp, Bryan; Scott, Matthew

    2016-01-01

    A fundamental question in computational neuroscience is how to connect a network of spiking neurons to produce desired macroscopic or mean field dynamics. One possible approach is through the Neural Engineering Framework (NEF). The NEF approach requires quantities called decoders which are solved through an optimization problem requiring large matrix inversion. Here, we show how a decoder can be obtained analytically for type I and certain type II firing rates as a function of the heterogeneity of its associated neuron. These decoders generate approximants for functions that converge to the desired function in mean-squared error like 1/N, where N is the number of neurons in the network. We refer to these decoders as scale-invariant decoders due to their structure. These decoders generate weights for a network of neurons through the NEF formula for weights. These weights force the spiking network to have arbitrary and prescribed mean field dynamics. The weights generated with scale-invariant decoders all lie on low dimensional hypersurfaces asymptotically. We demonstrate the applicability of these scale-invariant decoders and weight surfaces by constructing networks of spiking theta neurons that replicate the dynamics of various well known dynamical systems such as the neural integrator, Van der Pol system and the Lorenz system. As these decoders are analytically determined and non-unique, the weights are also analytically determined and non-unique. We discuss the implications for measured weights of neuronal networks.

  8. Obtaining Arbitrary Prescribed Mean Field Dynamics for Recurrently Coupled Networks of Type-I Spiking Neurons with Analytically Determined Weights

    Directory of Open Access Journals (Sweden)

    Wilten eNicola

    2016-02-01

    Full Text Available A fundamental question in computational neuroscience is how to connect a network of spiking neurons to produce desired macroscopic or mean field dynamics. One possible approach is through the Neural Engineering Framework (NEF. The NEF approach requires quantities called decoders which are solved through an optimization problem requiring large matrix inversion. Here, we show how a decoder can be obtained analytically for type I and certain type II firing rates as a function of the heterogeneity of its associated neuron. These decoders generate approximants for functions that converge to the desired function in mean-squared error like 1/N, where N is the number of neurons in the network. We refer to these decoders as scale-invariant decoders due to their structure. These decoders generate weights for a network of neurons through the NEF formula for weights. These weights force the spiking network to have arbitrary and prescribed mean field dynamics. The weights generated with scale-invariant decoders all lie on low dimensional hypersurfaces asymptotically. We demonstrate the applicability of these scale-invariant decoders and weight surfaces by constructing networks of spiking theta neurons that replicate the dynamics of various well known dynamical systems such as the neural integrator, Van der Pol system and the Lorenz system. As these decoders are analytically determined and non-unique, the weights are also analytically determined and non-unique. We discuss the implications for measured weights of neuronal networks

  9. Identification of influential spreaders in online social networks using interaction weighted K-core decomposition method

    Science.gov (United States)

    Al-garadi, Mohammed Ali; Varathan, Kasturi Dewi; Ravana, Sri Devi

    2017-02-01

    Online social networks (OSNs) have become a vital part of everyday living. OSNs provide researchers and scientists with unique prospects to comprehend individuals on a scale and to analyze human behavioral patterns. Influential spreaders identification is an important subject in understanding the dynamics of information diffusion in OSNs. Targeting these influential spreaders is significant in planning the techniques for accelerating the propagation of information that is useful for various applications, such as viral marketing applications or blocking the diffusion of annoying information (spreading of viruses, rumors, online negative behaviors, and cyberbullying). Existing K-core decomposition methods consider links equally when calculating the influential spreaders for unweighted networks. Alternatively, the proposed link weights are based only on the degree of nodes. Thus, if a node is linked to high-degree nodes, then this node will receive high weight and is treated as an important node. Conversely, the degree of nodes in OSN context does not always provide accurate influence of users. In the present study, we improve the K-core method for OSNs by proposing a novel link-weighting method based on the interaction among users. The proposed method is based on the observation that the interaction of users is a significant factor in quantifying the spreading capability of user in OSNs. The tracking of diffusion links in the real spreading dynamics of information verifies the effectiveness of our proposed method for identifying influential spreaders in OSNs as compared with degree centrality, PageRank, and original K-core.

  10. Resolving anatomical and functional structure in human brain organization: identifying mesoscale organization in weighted network representations.

    Science.gov (United States)

    Lohse, Christian; Bassett, Danielle S; Lim, Kelvin O; Carlson, Jean M

    2014-10-01

    Human brain anatomy and function display a combination of modular and hierarchical organization, suggesting the importance of both cohesive structures and variable resolutions in the facilitation of healthy cognitive processes. However, tools to simultaneously probe these features of brain architecture require further development. We propose and apply a set of methods to extract cohesive structures in network representations of brain connectivity using multi-resolution techniques. We employ a combination of soft thresholding, windowed thresholding, and resolution in community detection, that enable us to identify and isolate structures associated with different weights. One such mesoscale structure is bipartivity, which quantifies the extent to which the brain is divided into two partitions with high connectivity between partitions and low connectivity within partitions. A second, complementary mesoscale structure is modularity, which quantifies the extent to which the brain is divided into multiple communities with strong connectivity within each community and weak connectivity between communities. Our methods lead to multi-resolution curves of these network diagnostics over a range of spatial, geometric, and structural scales. For statistical comparison, we contrast our results with those obtained for several benchmark null models. Our work demonstrates that multi-resolution diagnostic curves capture complex organizational profiles in weighted graphs. We apply these methods to the identification of resolution-specific characteristics of healthy weighted graph architecture and altered connectivity profiles in psychiatric disease.

  11. Fuzzy Weight Cluster-Based Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Teng Gao

    2015-01-01

    Full Text Available Cluster-based protocol is a kind of important routing in wireless sensor networks. However, due to the uneven distribution of cluster heads in classical clustering algorithm, some nodes may run out of energy too early, which is not suitable for large-scale wireless sensor networks. In this paper, a distributed clustering algorithm based on fuzzy weighted attributes is put forward to ensure both energy efficiency and extensibility. On the premise of a comprehensive consideration of all attributes, the corresponding weight of each parameter is assigned by using the direct method of fuzzy engineering theory. Then, each node works out property value. These property values will be mapped to the time axis and be triggered by a timer to broadcast cluster headers. At the same time, the radio coverage method is adopted, in order to avoid collisions and to ensure the symmetrical distribution of cluster heads. The aggregated data are forwarded to the sink node in the form of multihop. The simulation results demonstrate that clustering algorithm based on fuzzy weighted attributes has a longer life expectancy and better extensibility than LEACH-like algorithms.

  12. Weight-Aware Sensor Deployment in Wireless Sensor Networks for Smart Cities

    Directory of Open Access Journals (Sweden)

    Mingshan Xie

    2018-01-01

    Full Text Available During the construction of wireless sensor networks (WSNs for smart cities, a preliminary survey of the relative criticalness within the monitored area can be performed. It is a challenge for deterministic sensor deployment to balance the tradeoff of sensing reliability and cost. In this paper, based on the sensing accuracy of the sensor, we establish a reliability model of the sensing area which is divided into sensing grids, and different weights are allocated to those grids. We employ a practical evaluation criterion using seesaw mapping for determining the weights of sensing grids. We further formulate and solve an optimization problem for maximizing the trust degree of the WSNs. With our proposed method, the efficient deployment of sensors can be realized. Simulation results show that our proposed deployment strategy can achieve higher trust degree with reduced sensor deployment cost and lower number of sensors at a certain miss probability threshold.

  13. Forecasting business cycle with chaotic time series based on neural network with weighted fuzzy membership functions

    International Nuclear Information System (INIS)

    Chai, Soo H.; Lim, Joon S.

    2016-01-01

    This study presents a forecasting model of cyclical fluctuations of the economy based on the time delay coordinate embedding method. The model uses a neuro-fuzzy network called neural network with weighted fuzzy membership functions (NEWFM). The preprocessed time series of the leading composite index using the time delay coordinate embedding method are used as input data to the NEWFM to forecast the business cycle. A comparative study is conducted using other methods based on wavelet transform and Principal Component Analysis for the performance comparison. The forecasting results are tested using a linear regression analysis to compare the approximation of the input data against the target class, gross domestic product (GDP). The chaos based model captures nonlinear dynamics and interactions within the system, which other two models ignore. The test results demonstrated that chaos based method significantly improved the prediction capability, thereby demonstrating superior performance to the other methods.

  14. Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory

    KAUST Repository

    Pearce, Roger; Gokhale, Maya; Amato, Nancy M.

    2013-01-01

    We present techniques to process large scale-free graphs in distributed memory. Our aim is to scale to trillions of edges, and our research is targeted at leadership class supercomputers and clusters with local non-volatile memory, e.g., NAND Flash

  15. Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach

    Directory of Open Access Journals (Sweden)

    Khalid Haddouch

    2016-09-01

    Full Text Available A wide variety of real world optimization problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs. In this paper, we model this problem in terms of in original 0-1 quadratic programming subject to leaner constraints. View it performance, we use the continuous Hopfield network to solve the obtained model basing on original energy function. To validate our model, we solve several instance of benchmarking WCSP. In this regard, our approach recognizes the optimal solution of the said instances.

  16. Weighted Optimization-Based Distributed Kalman Filter for Nonlinear Target Tracking in Collaborative Sensor Networks.

    Science.gov (United States)

    Chen, Jie; Li, Jiahong; Yang, Shuanghua; Deng, Fang

    2017-11-01

    The identification of the nonlinearity and coupling is crucial in nonlinear target tracking problem in collaborative sensor networks. According to the adaptive Kalman filtering (KF) method, the nonlinearity and coupling can be regarded as the model noise covariance, and estimated by minimizing the innovation or residual errors of the states. However, the method requires large time window of data to achieve reliable covariance measurement, making it impractical for nonlinear systems which are rapidly changing. To deal with the problem, a weighted optimization-based distributed KF algorithm (WODKF) is proposed in this paper. The algorithm enlarges the data size of each sensor by the received measurements and state estimates from its connected sensors instead of the time window. A new cost function is set as the weighted sum of the bias and oscillation of the state to estimate the "best" estimate of the model noise covariance. The bias and oscillation of the state of each sensor are estimated by polynomial fitting a time window of state estimates and measurements of the sensor and its neighbors weighted by the measurement noise covariance. The best estimate of the model noise covariance is computed by minimizing the weighted cost function using the exhaustive method. The sensor selection method is in addition to the algorithm to decrease the computation load of the filter and increase the scalability of the sensor network. The existence, suboptimality and stability analysis of the algorithm are given. The local probability data association method is used in the proposed algorithm for the multitarget tracking case. The algorithm is demonstrated in simulations on tracking examples for a random signal, one nonlinear target, and four nonlinear targets. Results show the feasibility and superiority of WODKF against other filtering algorithms for a large class of systems.

  17. Characterization of scale-free properties of human electrocorticography in awake and slow wave sleep states

    Directory of Open Access Journals (Sweden)

    John M Zempel

    2012-06-01

    Full Text Available Like many complex dynamic systems, the brain exhibits scale-free dynamics that follow power law scaling. Broadband power spectral density (PSD of brain electrical activity exhibits state-dependent power law scaling with a log frequency exponent that varies across frequency ranges. Widely divergent naturally occurring neural states, awake and slow wave sleep (SWS periods, were used evaluate the nature of changes in scale-free indices. We demonstrate two analytic approaches to characterizing electrocorticographic (ECoG data obtained during Awake and SWS states. A data driven approach was used, characterizing all available frequency ranges. Using an Equal Error State Discriminator (EESD, a single frequency range did not best characterize state across data from all six subjects, though the ability to distinguish awake and SWS states in individual subjects was excellent. Multisegment piecewise linear fits were used to characterize scale-free slopes across the entire frequency range (0.2-200 Hz. These scale-free slopes differed between Awake and SWS states across subjects, particularly at frequencies below 10 Hz and showed little difference at frequencies above 70 Hz. A Multivariate Maximum Likelihood Analysis (MMLA method using the multisegment slope indices successfully categorized ECoG data in most subjects, though individual variation was seen. The ECoG spectrum is not well characterized by a single linear fit across a defined set of frequencies, but is best described by a set of discrete linear fits across the full range of available frequencies. With increasing computational tractability, the use of scale-free slope values to characterize EEG data will have practical value in clinical and research EEG studies.

  18. Designing a Pattern Recognition Neural Network with a Reject Output and Many Sets of Weights and Biases

    OpenAIRE

    Dung, Le; Mizukawa, Makoto

    2008-01-01

    Adding the reject output to the pattern recognition neural network is an approach to help the neural network can classify almost all patterns of a training data set by using many sets of weights and biases, even if the neural network is small. With a smaller number of neurons, we can implement the neural network on a hardware-based platform more easily and also reduce the response time of it. With the reject output the neural network can produce not only right or wrong results but also reject...

  19. Use of social networking sites and perception and intentions regarding body weight among adolescents

    Science.gov (United States)

    Sampasa‐Kanyinga, H.; Hamilton, H. A.

    2016-01-01

    Summary Objective Social networking sites (SNSs) not only offer users an opportunity to link with others but also allow individuals to compare themselves with other users. However, the link between the use of SNSs and the dissatisfaction with body weight is largely unknown. We investigated the associations between the use of SNSs and the perception of body weight and related behaviours among adolescent men and women. Methods The study sample consisted of 4,468 (48.5% women) 11–19‐year‐old Canadian students in grades 7 to 12 who participated in the 2013 Ontario Student Drug Use and Health Survey. Results Overall, 54.6% of students reported using SNSs for 2 h or less per day, 28.0% reported using them for more than 2 h d−1 and 17.4% reported infrequent or no use of SNSs (reference category). After adjustment for covariates, results showed that adolescent women who use SNSs for more than 2 h d−1 had greater odds of dissatisfaction with body weight (odds ratio = 2.02; 95% confidence interval [CI]: 1.30–3.16). More specifically, they were more likely to perceive themselves as overweight (relative risk ratio [RRR] = 2.20; 95% CI: 1.34−3.60) compared with those who reported infrequent or no use of SNSs. Conversely, men who use SNSs for 2 h or less per day presented a lower risk for perceiving themselves as overweight (RRR = 0.68; 95% CI: 0.47−0.98) but not those who use SNSs for more than 2 h d−1. Women who use SNSs for more than 2 h d−1 reported a greater likelihood of trying to lose weight (RRR = 2.52; 95% CI: 1.62−3.90). Conclusions Our results showed that heavy use of SNSs is associated with dissatisfaction with body weight in adolescent women. PMID:27812377

  20. Use of social networking sites and perception and intentions regarding body weight among adolescents.

    Science.gov (United States)

    Sampasa-Kanyinga, H; Chaput, J-P; Hamilton, H A

    2016-03-01

    Social networking sites (SNSs) not only offer users an opportunity to link with others but also allow individuals to compare themselves with other users. However, the link between the use of SNSs and the dissatisfaction with body weight is largely unknown. We investigated the associations between the use of SNSs and the perception of body weight and related behaviours among adolescent men and women. The study sample consisted of 4,468 (48.5% women) 11-19-year-old Canadian students in grades 7 to 12 who participated in the 2013 Ontario Student Drug Use and Health Survey. Overall, 54.6% of students reported using SNSs for 2 h or less per day, 28.0% reported using them for more than 2 h d -1 and 17.4% reported infrequent or no use of SNSs (reference category). After adjustment for covariates, results showed that adolescent women who use SNSs for more than 2 h d -1 had greater odds of dissatisfaction with body weight (odds ratio = 2.02; 95% confidence interval [CI]: 1.30-3.16). More specifically, they were more likely to perceive themselves as overweight (relative risk ratio [RRR] = 2.20; 95% CI: 1.34-3.60) compared with those who reported infrequent or no use of SNSs. Conversely, men who use SNSs for 2 h or less per day presented a lower risk for perceiving themselves as overweight (RRR = 0.68; 95% CI: 0.47-0.98) but not those who use SNSs for more than 2 h d -1 . Women who use SNSs for more than 2 h d -1 reported a greater likelihood of trying to lose weight (RRR = 2.52; 95% CI: 1.62-3.90). Our results showed that heavy use of SNSs is associated with dissatisfaction with body weight in adolescent women.

  1. Centroid Localization of Uncooperative Nodes in Wireless Networks Using a Relative Span Weighting Method

    Directory of Open Access Journals (Sweden)

    Christine Laurendeau

    2010-01-01

    Full Text Available Increasingly ubiquitous wireless technologies require novel localization techniques to pinpoint the position of an uncooperative node, whether the target is a malicious device engaging in a security exploit or a low-battery handset in the middle of a critical emergency. Such scenarios necessitate that a radio signal source be localized by other network nodes efficiently, using minimal information. We propose two new algorithms for estimating the position of an uncooperative transmitter, based on the received signal strength (RSS of a single target message at a set of receivers whose coordinates are known. As an extension to the concept of centroid localization, our mechanisms weigh each receiver's coordinates based on the message's relative RSS at that receiver, with respect to the span of RSS values over all receivers. The weights may decrease from the highest RSS receiver either linearly or exponentially. Our simulation results demonstrate that for all but the most sparsely populated wireless networks, our exponentially weighted mechanism localizes a target node within the regulations stipulated for emergency services location accuracy.

  2. Modeling Air Traffic Situation Complexity with a Dynamic Weighted Network Approach

    Directory of Open Access Journals (Sweden)

    Hongyong Wang

    2018-01-01

    Full Text Available In order to address the flight delays and risks associated with the forecasted increase in air traffic, there is a need to increase the capacity of air traffic management systems. This should be based on objective measurements of traffic situation complexity. In current air traffic complexity research, no simple means is available to integrate airspace and traffic flow characteristics. In this paper, we propose a new approach for the measurement of air traffic situation complexity. This approach considers the effects of both airspace and traffic flow and objectively quantifies air traffic situation complexity. Considering the aircraft, waypoints, and airways as nodes, and the complexity relationships among these nodes as edges, a dynamic weighted network is constructed. Air traffic situation complexity is defined as the sum of the weights of all edges in the network, and the relationships of complexity with some commonly used indices are statistically analyzed. The results indicate that the new complexity index is more accurate than traffic count and reflects the number of trajectory changes as well as the high-risk situations. Additionally, analysis of potential applications reveals that this new index contributes to achieving complexity-based management, which represents an efficient method for increasing airspace system capacity.

  3. Do weight management interventions delivered by online social networks effectively improve body weight, body composition, and chronic disease risk factors? A systematic review.

    Science.gov (United States)

    Willis, Erik A; Szabo-Reed, Amanda N; Ptomey, Lauren T; Steger, Felicia L; Honas, Jeffery J; Washburn, Richard A; Donnelly, Joseph E

    2017-02-01

    Introduction Currently, no systematic review/meta-analysis has examined studies that used online social networks (OSN) as a primary intervention platform. Therefore, the purpose of this review was to evaluate the effectiveness of weight management interventions delivered through OSN. Methods PubMed, EMBASE, PsycINFO, Web of Science, and Scopus were searched (January 1990-November 2015) for studies with data on the effect of OSNs on weight loss. Only primary source articles that utilized OSN as the main platform for delivery of weight management/healthy lifestyle interventions, were published in English language peer-reviewed journals, and reported outcome data on weight were eligible for inclusion in this systematic review. Five articles were included in this review. Results One-hundred percent of the studies ( n = 5) reported a reduction in baseline weight. Three of the five studies (60%) reported significant decreases in body weight when OSN was paired with health educator support. Only one study reported a clinical significant weight loss of ≥5%. Conclusion Using OSN for weight management is in its early stages of development and, while these few studies show promise, more research is needed to acquire information about optimizing these interventions to increase their efficacy.

  4. A comparison of the weights-of-evidence method and probabilistic neural networks

    Science.gov (United States)

    Singer, Donald A.; Kouda, Ryoichi

    1999-01-01

    The need to integrate large quantities of digital geoscience information to classify locations as mineral deposits or nondeposits has been met by the weights-of-evidence method in many situations. Widespread selection of this method may be more the result of its ease of use and interpretation rather than comparisons with alternative methods. A comparison of the weights-of-evidence method to probabilistic neural networks is performed here with data from Chisel Lake-Andeson Lake, Manitoba, Canada. Each method is designed to estimate the probability of belonging to learned classes where the estimated probabilities are used to classify the unknowns. Using these data, significantly lower classification error rates were observed for the neural network, not only when test and training data were the same (0.02 versus 23%), but also when validation data, not used in any training, were used to test the efficiency of classification (0.7 versus 17%). Despite these data containing too few deposits, these tests of this set of data demonstrate the neural network's ability at making unbiased probability estimates and lower error rates when measured by number of polygons or by the area of land misclassified. For both methods, independent validation tests are required to ensure that estimates are representative of real-world results. Results from the weights-of-evidence method demonstrate a strong bias where most errors are barren areas misclassified as deposits. The weights-of-evidence method is based on Bayes rule, which requires independent variables in order to make unbiased estimates. The chi-square test for independence indicates no significant correlations among the variables in the Chisel Lake–Andeson Lake data. However, the expected number of deposits test clearly demonstrates that these data violate the independence assumption. Other, independent simulations with three variables show that using variables with correlations of 1.0 can double the expected number of deposits

  5. Scale-free functional connectivity of the brain is maintained in anesthetized healthy participants but not in patients with unresponsive wakefulness syndrome.

    Directory of Open Access Journals (Sweden)

    Xiaolin Liu

    Full Text Available Loss of consciousness in anesthetized healthy participants and in patients with unresponsive wakefulness syndrome (UWS is associated with substantial alterations of functional connectivity across large-scale brain networks. Yet, a prominent distinction between the two cases is that after anesthesia, brain connectivity and consciousness are spontaneously restored, whereas in patients with UWS this restoration fails to occur, but why? A possible explanation is that the self-organizing capability of the brain is compromised in patients with UWS but not in healthy participants undergoing anesthesia. According to the theory of self-organized criticality, many natural complex systems, including the brain, evolve spontaneously to a critical state wherein system behaviors display spatial and/or temporal scale-invariant characteristics. Here we tested the hypothesis that the scale-free property of brain network organization is in fact fundamentally different between anesthetized healthy participants and UWS patients. We introduced a novel, computationally efficient approach to determine anatomical-functional parcellation of the whole-brain network at increasingly finer spatial scales. We found that in healthy participants, scale-free distributions of node size and node degree were present across wakefulness, propofol sedation, and recovery, despite significant propofol-induced functional connectivity changes. In patients with UWS, the scale-free distribution of node degree was absent, reflecting a fundamental difference between the two groups in adaptive reconfiguration of functional interaction between network components. The maintenance of scale-invariance across propofol sedation in healthy participants suggests the presence of persistent, on-going self-organizing processes to a critical state--a capacity that is compromised in patients with UWS.

  6. Utilizing scale-free networks to support the search for scientific publications

    NARCIS (Netherlands)

    Hauff, C.; Nürnberger, Andreas; de Jong, Franciska M.G.; Kraaij, W.

    2006-01-01

    When searching for scienti﬿c publications, users today often rely on search engines such as Yahoo.com. Whereas searching for publications whose titles are known is considered to be an easy task, users who are looking for important publications in research ﬿elds they are unfamiliar with face greater

  7. Multi-granularity immunization strategy based on SIRS model in scale-free network

    Science.gov (United States)

    Nian, Fuzhong; Wang, Ke

    2015-04-01

    In this paper, a new immunization strategy was established to prevent the epidemic spreading based on the principle of "Multi-granularity" and "Pre-warning Mechanism", which send different pre-warning signal with the risk rank of the susceptible node to be infected. The pre-warning means there is a higher risk that the susceptible node is more likely to be infected. The multi-granularity means the susceptible node is linked with multi-infected nodes. In our model, the effect of the different situation of the multi-granularity immunizations is compared and different spreading rates are adopted to describe the epidemic behavior of nodes. In addition the threshold value of epidemic outbreak is investigated, which makes the result more convincing. The theoretical analysis and the simulations indicate that the proposed immunization strategy is effective and it is also economic and feasible.

  8. Factors That Affect the Centrality Controllability of Scale-Free Networks

    Science.gov (United States)

    Hu, Dong; Sun, Xian; Li, Ping; Chen, Yan; Zhang, Jie

    2015-12-01

    Not Available Supported by Foundations of SiChuan Educational Committee under Grant No 13ZB0198, the National Natural Science Foundation of China under Grant Nos 61104224, 81373531, 61104143 and 61573107, and The Science and Technology Fund Project of SWPU (2013XJR011).

  9. Modified weighted fair queuing for packet scheduling in mobile WiMAX networks

    Science.gov (United States)

    Satrya, Gandeva B.; Brotoharsono, Tri

    2013-03-01

    The increase of user mobility and the need for data access anytime also increases the interest in broadband wireless access (BWA). The best available quality of experience for mobile data service users are assured for IEEE 802.16e based users. The main problem of assuring a high QOS value is how to allocate available resources among users in order to meet the QOS requirement for criteria such as delay, throughput, packet loss and fairness. There is no specific standard scheduling mechanism stated by IEEE standards, which leaves it for implementer differentiation. There are five QOS service classes defined by IEEE 802.16: Unsolicited Grant Scheme (UGS), Extended Real Time Polling Service (ertPS), Real Time Polling Service (rtPS), Non Real Time Polling Service (nrtPS) and Best Effort Service (BE). Each class has different QOS parameter requirements for throughput and delay/jitter constraints. This paper proposes Modified Weighted Fair Queuing (MWFQ) scheduling scenario which was based on Weighted Round Robin (WRR) and Weighted Fair Queuing (WFQ). The performance of MWFQ was assessed by using above five QoS criteria. The simulation shows that using the concept of total packet size calculation improves the network's performance.

  10. Deep embedding convolutional neural network for synthesizing CT image from T1-Weighted MR image.

    Science.gov (United States)

    Xiang, Lei; Wang, Qian; Nie, Dong; Zhang, Lichi; Jin, Xiyao; Qiao, Yu; Shen, Dinggang

    2018-07-01

    Recently, more and more attention is drawn to the field of medical image synthesis across modalities. Among them, the synthesis of computed tomography (CT) image from T1-weighted magnetic resonance (MR) image is of great importance, although the mapping between them is highly complex due to large gaps of appearances of the two modalities. In this work, we aim to tackle this MR-to-CT synthesis task by a novel deep embedding convolutional neural network (DECNN). Specifically, we generate the feature maps from MR images, and then transform these feature maps forward through convolutional layers in the network. We can further compute a tentative CT synthesis from the midway of the flow of feature maps, and then embed this tentative CT synthesis result back to the feature maps. This embedding operation results in better feature maps, which are further transformed forward in DECNN. After repeating this embedding procedure for several times in the network, we can eventually synthesize a final CT image in the end of the DECNN. We have validated our proposed method on both brain and prostate imaging datasets, by also comparing with the state-of-the-art methods. Experimental results suggest that our DECNN (with repeated embedding operations) demonstrates its superior performances, in terms of both the perceptive quality of the synthesized CT image and the run-time cost for synthesizing a CT image. Copyright © 2018. Published by Elsevier B.V.

  11. Fluctuation-driven flocking movement in three dimensions and scale-free correlation.

    Science.gov (United States)

    Niizato, Takayuki; Gunji, Yukio-Pegio

    2012-01-01

    Recent advances in the study of flocking behavior have permitted more sophisticated analyses than previously possible. The concepts of "topological distances" and "scale-free correlations" are important developments that have contributed to this improvement. These concepts require us to reconsider the notion of a neighborhood when applied to theoretical models. Previous work has assumed that individuals interact with neighbors within a certain radius (called the "metric distance"). However, other work has shown that, assuming topological interactions, starlings interact on average with the six or seven nearest neighbors within a flock. Accounting for this observation, we previously proposed a metric-topological interaction model in two dimensions. The goal of our model was to unite these two interaction components, the metric distance and the topological distance, into one rule. In our previous study, we demonstrated that the metric-topological interaction model could explain a real bird flocking phenomenon called scale-free correlation, which was first reported by Cavagna et al. In this study, we extended our model to three dimensions while also accounting for variations in speed. This three-dimensional metric-topological interaction model displayed scale-free correlation for velocity and orientation. Finally, we introduced an additional new feature of the model, namely, that a flock can store and release its fluctuations.

  12. Fluctuation-driven flocking movement in three dimensions and scale-free correlation.

    Directory of Open Access Journals (Sweden)

    Takayuki Niizato

    Full Text Available Recent advances in the study of flocking behavior have permitted more sophisticated analyses than previously possible. The concepts of "topological distances" and "scale-free correlations" are important developments that have contributed to this improvement. These concepts require us to reconsider the notion of a neighborhood when applied to theoretical models. Previous work has assumed that individuals interact with neighbors within a certain radius (called the "metric distance". However, other work has shown that, assuming topological interactions, starlings interact on average with the six or seven nearest neighbors within a flock. Accounting for this observation, we previously proposed a metric-topological interaction model in two dimensions. The goal of our model was to unite these two interaction components, the metric distance and the topological distance, into one rule. In our previous study, we demonstrated that the metric-topological interaction model could explain a real bird flocking phenomenon called scale-free correlation, which was first reported by Cavagna et al. In this study, we extended our model to three dimensions while also accounting for variations in speed. This three-dimensional metric-topological interaction model displayed scale-free correlation for velocity and orientation. Finally, we introduced an additional new feature of the model, namely, that a flock can store and release its fluctuations.

  13. Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory

    KAUST Repository

    Pearce, Roger

    2013-05-01

    We present techniques to process large scale-free graphs in distributed memory. Our aim is to scale to trillions of edges, and our research is targeted at leadership class supercomputers and clusters with local non-volatile memory, e.g., NAND Flash. We apply an edge list partitioning technique, designed to accommodate high-degree vertices (hubs) that create scaling challenges when processing scale-free graphs. In addition to partitioning hubs, we use ghost vertices to represent the hubs to reduce communication hotspots. We present a scaling study with three important graph algorithms: Breadth-First Search (BFS), K-Core decomposition, and Triangle Counting. We also demonstrate scalability on BG/P Intrepid by comparing to best known Graph500 results. We show results on two clusters with local NVRAM storage that are capable of traversing trillion-edge scale-free graphs. By leveraging node-local NAND Flash, our approach can process thirty-two times larger datasets with only a 39% performance degradation in Traversed Edges Per Second (TEPS). © 2013 IEEE.

  14. Diffusion on Networks and Diffusion Weighted NMR of the Human Lung

    DEFF Research Database (Denmark)

    Buhl, Niels

    2011-01-01

    of the diffusion propagator to general properties of the underlying graph. Diffusion weighted NMR of the human lung with hyperpolarized noble gases, which over the last decade has been demonstrated to be a very promising way of detecting and quantifying lung diseases like emphysema, represent an obvious...... application of the above mentioned theory, given that the human lung consists of a large network of bifurcating tube like airways. 90-95% of the gas in a human lung resides in the ~30000 pulmonary acini, each of these consists of ~500 airways, which are connected as the edges in a binary tree. We model...... diffusion in the pulmonary acini as diffusion on metric graphs with this structure. The metric graph for each individual pulmonary acinus is embedded in three dimensional space via line segments. By considering an isotropic distribution of acini and a symmetric branching geometry for the line segments...

  15. Analysis of infant cry through weighted linear prediction cepstral coefficients and Probabilistic Neural Network.

    Science.gov (United States)

    Hariharan, M; Chee, Lim Sin; Yaacob, Sazali

    2012-06-01

    Acoustic analysis of infant cry signals has been proven to be an excellent tool in the area of automatic detection of pathological status of an infant. This paper investigates the application of parameter weighting for linear prediction cepstral coefficients (LPCCs) to provide the robust representation of infant cry signals. Three classes of infant cry signals were considered such as normal cry signals, cry signals from deaf babies and babies with asphyxia. A Probabilistic Neural Network (PNN) is suggested to classify the infant cry signals into normal and pathological cries. PNN is trained with different spread factor or smoothing parameter to obtain better classification accuracy. The experimental results demonstrate that the suggested features and classification algorithms give very promising classification accuracy of above 98% and it expounds that the suggested method can be used to help medical professionals for diagnosing pathological status of an infant from cry signals.

  16. Sea Surface Temperature Modeling using Radial Basis Function Networks With a Dynamically Weighted Particle Filter

    KAUST Repository

    Ryu, Duchwan

    2013-03-01

    The sea surface temperature (SST) is an important factor of the earth climate system. A deep understanding of SST is essential for climate monitoring and prediction. In general, SST follows a nonlinear pattern in both time and location and can be modeled by a dynamic system which changes with time and location. In this article, we propose a radial basis function network-based dynamic model which is able to catch the nonlinearity of the data and propose to use the dynamically weighted particle filter to estimate the parameters of the dynamic model. We analyze the SST observed in the Caribbean Islands area after a hurricane using the proposed dynamic model. Comparing to the traditional grid-based approach that requires a supercomputer due to its high computational demand, our approach requires much less CPU time and makes real-time forecasting of SST doable on a personal computer. Supplementary materials for this article are available online. © 2013 American Statistical Association.

  17. Developing weighted criteria to evaluate lean reverse logistics through analytical network process

    Science.gov (United States)

    Zagloel, Teuku Yuri M.; Hakim, Inaki Maulida; Krisnawardhani, Rike Adyartie

    2017-11-01

    Reverse logistics is a part of supply chain that bring materials from consumers back to manufacturer in order to gain added value or do a proper disposal. Nowadays, most companies are still facing several problems on reverse logistics implementation which leads to high waste along reverse logistics processes. In order to overcome this problem, Madsen [Framework for Reverse Lean Logistics to Enable Green Manufacturing, Eco Design 2009: 6th International Symposium on Environmentally Conscious Design and Inverse Manufacturing, Sapporo, 2009] has developed a lean reverse logistics framework as a step to eliminate waste by implementing lean on reverse logistics. However, the resulted framework sets aside criteria used to evaluate its performance. This research aims to determine weighted criteria that can be used as a base on reverse logistics evaluation by considering lean principles. The resulted criteria will ensure reverse logistics are kept off from waste, thus implemented efficiently. Analytical Network Process (ANP) is used in this research to determine the weighted criteria. The result shows that criteria used for evaluation lean reverse logistics are Innovation and Learning (35%), Economic (30%), Process Flow Management (14%), Customer Relationship Management (13%), Environment (6%), and Social (2%).

  18. Application of Weighted Gene Co-expression Network Analysis for Data from Paired Design.

    Science.gov (United States)

    Li, Jianqiang; Zhou, Doudou; Qiu, Weiliang; Shi, Yuliang; Yang, Ji-Jiang; Chen, Shi; Wang, Qing; Pan, Hui

    2018-01-12

    Investigating how genes jointly affect complex human diseases is important, yet challenging. The network approach (e.g., weighted gene co-expression network analysis (WGCNA)) is a powerful tool. However, genomic data usually contain substantial batch effects, which could mask true genomic signals. Paired design is a powerful tool that can reduce batch effects. However, it is currently unclear how to appropriately apply WGCNA to genomic data from paired design. In this paper, we modified the current WGCNA pipeline to analyse high-throughput genomic data from paired design. We illustrated the modified WGCNA pipeline by analysing the miRNA dataset provided by Shiah et al. (2014), which contains forty oral squamous cell carcinoma (OSCC) specimens and their matched non-tumourous epithelial counterparts. OSCC is the sixth most common cancer worldwide. The modified WGCNA pipeline identified two sets of novel miRNAs associated with OSCC, in addition to the existing miRNAs reported by Shiah et al. (2014). Thus, this work will be of great interest to readers of various scientific disciplines, in particular, genetic and genomic scientists as well as medical scientists working on cancer.

  19. Identifying key genes in rheumatoid arthritis by weighted gene co-expression network analysis.

    Science.gov (United States)

    Ma, Chunhui; Lv, Qi; Teng, Songsong; Yu, Yinxian; Niu, Kerun; Yi, Chengqin

    2017-08-01

    This study aimed to identify rheumatoid arthritis (RA) related genes based on microarray data using the WGCNA (weighted gene co-expression network analysis) method. Two gene expression profile datasets GSE55235 (10 RA samples and 10 healthy controls) and GSE77298 (16 RA samples and seven healthy controls) were downloaded from Gene Expression Omnibus database. Characteristic genes were identified using metaDE package. WGCNA was used to find disease-related networks based on gene expression correlation coefficients, and module significance was defined as the average gene significance of all genes used to assess the correlation between the module and RA status. Genes in the disease-related gene co-expression network were subject to functional annotation and pathway enrichment analysis using Database for Annotation Visualization and Integrated Discovery. Characteristic genes were also mapped to the Connectivity Map to screen small molecules. A total of 599 characteristic genes were identified. For each dataset, characteristic genes in the green, red and turquoise modules were most closely associated with RA, with gene numbers of 54, 43 and 79, respectively. These genes were enriched in totally enriched in 17 Gene Ontology terms, mainly related to immune response (CD97, FYB, CXCL1, IKBKE, CCR1, etc.), inflammatory response (CD97, CXCL1, C3AR1, CCR1, LYZ, etc.) and homeostasis (C3AR1, CCR1, PLN, CCL19, PPT1, etc.). Two small-molecule drugs sanguinarine and papaverine were predicted to have a therapeutic effect against RA. Genes related to immune response, inflammatory response and homeostasis presumably have critical roles in RA pathogenesis. Sanguinarine and papaverine have a potential therapeutic effect against RA. © 2017 Asia Pacific League of Associations for Rheumatology and John Wiley & Sons Australia, Ltd.

  20. Longitudinal social networks impacts on weight and weight-related behaviors assessed using mobile-based ecological momentary assessments: Study Protocols for the SPARC study

    Directory of Open Access Journals (Sweden)

    Meg Bruening

    2016-08-01

    Full Text Available Abstract Background The transition from the home to college is a phase in which emerging adults shift toward more unhealthy eating and physical activity patterns, higher body mass indices, thus increasing risk of overweight/obesity. Currently, little is understood about how changing friendship networks shape weight gain behaviors. This paper describes the recruitment, data collection, and data analytic protocols for the SPARC (Social impact of Physical Activity and nutRition in College study, a longitudinal examination of the mechanisms by which friends and friendship networks influence nutrition and physical activity behaviors and weight gain in the transition to college life. Methods The SPARC study aims to follow 1450 university freshmen from a large university over an academic year, collecting data on multiple aspects of friends and friendship networks. Integrating multiple types of data related to student lives, ecological momentary assessments (EMAs are administered via a cell phone application, devilSPARC. EMAs collected in four 1-week periods (a total of 4 EMA waves are integrated with linked data from web-based surveys and anthropometric measurements conducted at four times points (for a total of eight data collection periods including EMAs, separated by ~1 month. University databases will provide student card data, allowing integration of both time-dated data on food purchasing, use of physical activity venues, and geographical information system (GIS locations of these activities relative to other students in their social networks. Discussion Findings are intended to guide the development of more effective interventions to enhance behaviors among college students that protect against weight gain during college.

  1. Longitudinal social networks impacts on weight and weight-related behaviors assessed using mobile-based ecological momentary assessments: Study Protocols for the SPARC study.

    Science.gov (United States)

    Bruening, Meg; Ohri-Vachaspati, Punam; Brewis, Alexandra; Laska, Melissa; Todd, Michael; Hruschka, Daniel; Schaefer, David R; Whisner, Corrie M; Dunton, Genevieve

    2016-08-30

    The transition from the home to college is a phase in which emerging adults shift toward more unhealthy eating and physical activity patterns, higher body mass indices, thus increasing risk of overweight/obesity. Currently, little is understood about how changing friendship networks shape weight gain behaviors. This paper describes the recruitment, data collection, and data analytic protocols for the SPARC (Social impact of Physical Activity and nutRition in College) study, a longitudinal examination of the mechanisms by which friends and friendship networks influence nutrition and physical activity behaviors and weight gain in the transition to college life. The SPARC study aims to follow 1450 university freshmen from a large university over an academic year, collecting data on multiple aspects of friends and friendship networks. Integrating multiple types of data related to student lives, ecological momentary assessments (EMAs) are administered via a cell phone application, devilSPARC. EMAs collected in four 1-week periods (a total of 4 EMA waves) are integrated with linked data from web-based surveys and anthropometric measurements conducted at four times points (for a total of eight data collection periods including EMAs, separated by ~1 month). University databases will provide student card data, allowing integration of both time-dated data on food purchasing, use of physical activity venues, and geographical information system (GIS) locations of these activities relative to other students in their social networks. Findings are intended to guide the development of more effective interventions to enhance behaviors among college students that protect against weight gain during college.

  2. CHIMERA: Top-down model for hierarchical, overlapping and directed cluster structures in directed and weighted complex networks

    Science.gov (United States)

    Franke, R.

    2016-11-01

    In many networks discovered in biology, medicine, neuroscience and other disciplines special properties like a certain degree distribution and hierarchical cluster structure (also called communities) can be observed as general organizing principles. Detecting the cluster structure of an unknown network promises to identify functional subdivisions, hierarchy and interactions on a mesoscale. It is not trivial choosing an appropriate detection algorithm because there are multiple network, cluster and algorithmic properties to be considered. Edges can be weighted and/or directed, clusters overlap or build a hierarchy in several ways. Algorithms differ not only in runtime, memory requirements but also in allowed network and cluster properties. They are based on a specific definition of what a cluster is, too. On the one hand, a comprehensive network creation model is needed to build a large variety of benchmark networks with different reasonable structures to compare algorithms. On the other hand, if a cluster structure is already known, it is desirable to separate effects of this structure from other network properties. This can be done with null model networks that mimic an observed cluster structure to improve statistics on other network features. A third important application is the general study of properties in networks with different cluster structures, possibly evolving over time. Currently there are good benchmark and creation models available. But what is left is a precise sandbox model to build hierarchical, overlapping and directed clusters for undirected or directed, binary or weighted complex random networks on basis of a sophisticated blueprint. This gap shall be closed by the model CHIMERA (Cluster Hierarchy Interconnection Model for Evaluation, Research and Analysis) which will be introduced and described here for the first time.

  3. Scale-Free Relationships between Social and Landscape Factors in Urban Systems

    Directory of Open Access Journals (Sweden)

    Chunzhu Wei

    2017-01-01

    Full Text Available Urban planners and ecologists have long debated the relationship between the structure of urban landscapes and social activities. There have, however, been very few discussions as to whether any such relationships might depend on the scales of observation. This work applies a hierarchical zoning technique to data from the city of Quito, Ecuador, to examine how relationships between typical spatial landscape metrics and social indicators depend on zoning scales. Our results showed that the estimates of both landscape heterogeneity features and social indicators significantly depend on the zoning scale. The mean values of the typical landscape metrics and the social indicators all exhibited predictable responses to a changing zoning scale, suggesting a consistent and significant scaling relationship within the multiple zoning scales. Yet relationships between these pairs of variables remain notably invariant to scale. This quantitative demonstration of the scale-free nature of the relationship between landscape characteristics and social indicators furthers our understanding of the relationships between landscape structures and social aspects of urban spaces, including deprivation and public service accessibility. The relationships between social indicators and one typical landscape aggregation metric (represented as the percentage of like adjacencies were nevertheless significantly dependent on scale, suggesting the importance of zoning scale decisions for analyzing the relationships between the social indicators and the landscape characteristics related with landscape adjacency. Aside from this typical landscape aggregation metric, the general invariance to the zoning scale of relationships between landscape structures and socioeconomic indicators in Quito suggests the importance of applying these scale-free relationships in understanding complex socio-ecological systems in other cities, which are shaped by the conflated influences of both

  4. Redesigned-Scale-Free CORDIC Algorithm Based FPGA Implementation of Window Functions to Minimize Area and Latency

    Directory of Open Access Journals (Sweden)

    Supriya Aggarwal

    2012-01-01

    Full Text Available One of the most important steps in spectral analysis is filtering, where window functions are generally used to design filters. In this paper, we modify the existing architecture for realizing the window functions using CORDIC processor. Firstly, we modify the conventional CORDIC algorithm to reduce its latency and area. The proposed CORDIC algorithm is completely scale-free for the range of convergence that spans the entire coordinate space. Secondly, we realize the window functions using a single CORDIC processor as against two serially connected CORDIC processors in existing technique, thus optimizing it for area and latency. The linear CORDIC processor is replaced by a shift-add network which drastically reduces the number of pipelining stages required in the existing design. The proposed design on an average requires approximately 64% less pipeline stages and saves up to 44.2% area. Currently, the processor is designed to implement Blackman windowing architecture, which with slight modifications can be extended to other widow functions as well. The details of the proposed architecture are discussed in the paper.

  5. Weighted gene co-expression network analysis of the peripheral blood from Amyotrophic Lateral Sclerosis patients

    Directory of Open Access Journals (Sweden)

    DeYoung Joseph

    2009-08-01

    Full Text Available Abstract Background Amyotrophic Lateral Sclerosis (ALS is a lethal disorder characterized by progressive degeneration of motor neurons in the brain and spinal cord. Diagnosis is mainly based on clinical symptoms, and there is currently no therapy to stop the disease or slow its progression. Since access to spinal cord tissue is not possible at disease onset, we investigated changes in gene expression profiles in whole blood of ALS patients. Results Our transcriptional study showed dramatic changes in blood of ALS patients; 2,300 probes (9.4% showed significant differential expression in a discovery dataset consisting of 30 ALS patients and 30 healthy controls. Weighted gene co-expression network analysis (WGCNA was used to find disease-related networks (modules and disease related hub genes. Two large co-expression modules were found to be associated with ALS. Our findings were replicated in a second (30 patients and 30 controls and third dataset (63 patients and 63 controls, thereby demonstrating a highly significant and consistent association of two large co-expression modules with ALS disease status. Ingenuity Pathway Analysis of the ALS related module genes implicates enrichment of functional categories related to genetic disorders, neurodegeneration of the nervous system and inflammatory disease. The ALS related modules contain a number of candidate genes possibly involved in pathogenesis of ALS. Conclusion This first large-scale blood gene expression study in ALS observed distinct patterns between cases and controls which may provide opportunities for biomarker development as well as new insights into the molecular mechanisms of the disease.

  6. Application of Artificial Neural Networks (ANNs for Weight Predictions of Blue Crabs (Callinectes sapidus RATHBUN, 1896 Using Predictor Variables

    Directory of Open Access Journals (Sweden)

    C. TURELI BILEN

    2011-10-01

    Full Text Available An evaluation of the performance of artificial networks (ANNs to estimate the weights of blue crab (Callinectes sapidus catches in Yumurtalık Cove (Iskenderun Bay that uses measured predictor variables is presented, including carapace width (CW, sex (male, female and female with eggs, and sampling month. Blue crabs (n=410 were collected each month between 15 September 1996 and 15 May 1998. Sex, CW, and sampling month were used and specified in the input layer of the network. The weights of the blue crabs were utilized in the output layer of the network. A multi-layer perception architecture model was used and was calibrated with the Levenberg Marguardt (LM algorithm. Finally, the values were determined by the ANN model using the actual data. The mean square error (MSE was measured as 3.3, and the best results had a correlation coefficient (R of 0.93. We compared the predictive capacity of the general linear model (GLM versus the Artificial Neural Network model (ANN for the estimation of the weights of blue crabs from independent field data. The results indicated the higher performance capacity of the ANN to predict weights compared to the GLM (R=0.97 vs. R=0.95, raw variable when evaluated against independent field data.

  7. Directed weighted network structure analysis of complex impedance measurements for characterizing oil-in-water bubbly flow.

    Science.gov (United States)

    Gao, Zhong-Ke; Dang, Wei-Dong; Xue, Le; Zhang, Shan-Shan

    2017-03-01

    Characterizing the flow structure underlying the evolution of oil-in-water bubbly flow remains a contemporary challenge of great interests and complexity. In particular, the oil droplets dispersing in a water continuum with diverse size make the study of oil-in-water bubbly flow really difficult. To study this issue, we first design a novel complex impedance sensor and systematically conduct vertical oil-water flow experiments. Based on the multivariate complex impedance measurements, we define modalities associated with the spatial transient flow structures and construct modality transition-based network for each flow condition to study the evolution of flow structures. In order to reveal the unique flow structures underlying the oil-in-water bubbly flow, we filter the inferred modality transition-based network by removing the edges with small weight and resulting isolated nodes. Then, the weighted clustering coefficient entropy and weighted average path length are employed for quantitatively assessing the original network and filtered network. The differences in network measures enable to efficiently characterize the evolution of the oil-in-water bubbly flow structures.

  8. Scale-Free Brain-Wave Music from Simultaneously EEG and fMRI Recordings

    Science.gov (United States)

    Lu, Jing; Wu, Dan; Yang, Hua; Luo, Cheng; Li, Chaoyi; Yao, Dezhong

    2012-01-01

    In the past years, a few methods have been developed to translate human EEG to music. In 2009, PloS One 4 e5915, we developed a method to generate scale-free brainwave music where the amplitude of EEG was translated to music pitch according to the power law followed by both of them, the period of an EEG waveform is translated directly to the duration of a note, and the logarithm of the average power change of EEG is translated to music intensity according to the Fechner's law. In this work, we proposed to adopt simultaneously-recorded fMRI signal to control the intensity of the EEG music, thus an EEG-fMRI music is generated by combining two different and simultaneous brain signals. And most importantly, this approach further realized power law for music intensity as fMRI signal follows it. Thus the EEG-fMRI music makes a step ahead in reflecting the physiological process of the scale-free brain. PMID:23166768

  9. Scale-free brain-wave music from simultaneously EEG and fMRI recordings.

    Science.gov (United States)

    Lu, Jing; Wu, Dan; Yang, Hua; Luo, Cheng; Li, Chaoyi; Yao, Dezhong

    2012-01-01

    In the past years, a few methods have been developed to translate human EEG to music. In 2009, PloS One 4 e5915, we developed a method to generate scale-free brainwave music where the amplitude of EEG was translated to music pitch according to the power law followed by both of them, the period of an EEG waveform is translated directly to the duration of a note, and the logarithm of the average power change of EEG is translated to music intensity according to the Fechner's law. In this work, we proposed to adopt simultaneously-recorded fMRI signal to control the intensity of the EEG music, thus an EEG-fMRI music is generated by combining two different and simultaneous brain signals. And most importantly, this approach further realized power law for music intensity as fMRI signal follows it. Thus the EEG-fMRI music makes a step ahead in reflecting the physiological process of the scale-free brain.

  10. Multivariate weighted recurrence network inference for uncovering oil-water transitional flow behavior in a vertical pipe.

    Science.gov (United States)

    Gao, Zhong-Ke; Yang, Yu-Xuan; Cai, Qing; Zhang, Shan-Shan; Jin, Ning-De

    2016-06-01

    Exploring the dynamical behaviors of high water cut and low velocity oil-water flows remains a contemporary and challenging problem of significant importance. This challenge stimulates us to design a high-speed cycle motivation conductance sensor to capture spatial local flow information. We systematically carry out experiments and acquire the multi-channel measurements from different oil-water flow patterns. Then we develop a novel multivariate weighted recurrence network for uncovering the flow behaviors from multi-channel measurements. In particular, we exploit graph energy and weighted clustering coefficient in combination with multivariate time-frequency analysis to characterize the derived complex networks. The results indicate that the network measures are very sensitive to the flow transitions and allow uncovering local dynamical behaviors associated with water cut and flow velocity. These properties render our method particularly useful for quantitatively characterizing dynamical behaviors governing the transition and evolution of different oil-water flow patterns.

  11. Survival and morbidity of very low birth weight infant in a South American neonatal network.

    Science.gov (United States)

    Fernández, Rocío; D'Apremont, Ivonne; Domínguez, Angélica; Tapia, José L

    2014-10-01

    To analyze survival and relevant morbidity by gestational age (GA) in very low birth weight (VLBW) infants (Neonatal Network (Red Neonatal Neocosur) between January 2001 and December 2011. Data on 8234 VLBW with a GA between 24+0 and 31+6 weeks were analyzed. Overall mortality was 26% (95% CI: 25.0-26.9), including 2.6% of deaths in the delivery room. Fact sheets for survival and morbidity for each week of gestation were developed based on collected data. Survival at discharge increased from 29% at 24 weeks of GA to 91% at 31 weeks of GA (p neonatal morbidity was inversely related to GA (p hemorrhage, and 4.6% periventricular leukomalacia. Among survivors, 47.3% had none of these five conditions. A tool for use in a clinical setting was developed based on updated regional data for establishing week-to-week survival and morbidity of newborn infants born between 24+0 and 31+6 weeks of GA. This information could be used to make decisions related to perinatal care and for counseling parents.

  12. Scale-free crystallization of two-dimensional complex plasmas: Domain analysis using Minkowski tensors

    Science.gov (United States)

    Böbel, A.; Knapek, C. A.; Räth, C.

    2018-05-01

    Experiments of the recrystallization processes in two-dimensional complex plasmas are analyzed to rigorously test a recently developed scale-free phase transition theory. The "fractal-domain-structure" (FDS) theory is based on the kinetic theory of Frenkel. It assumes the formation of homogeneous domains, separated by defect lines, during crystallization and a fractal relationship between domain area and boundary length. For the defect number fraction and system energy a scale-free power-law relation is predicted. The long-range scaling behavior of the bond-order correlation function shows clearly that the complex plasma phase transitions are not of the Kosterlitz, Thouless, Halperin, Nelson, and Young type. Previous preliminary results obtained by counting the number of dislocations and applying a bond-order metric for structural analysis are reproduced. These findings are supplemented by extending the use of the bond-order metric to measure the defect number fraction and furthermore applying state-of-the-art analysis methods, allowing a systematic testing of the FDS theory with unprecedented scrutiny: A morphological analysis of lattice structure is performed via Minkowski tensor methods. Minkowski tensors form a complete family of additive, motion covariant and continuous morphological measures that are sensitive to nonlinear properties. The FDS theory is rigorously confirmed and predictions of the theory are reproduced extremely well. The predicted scale-free power-law relation between defect fraction number and system energy is verified for one more order of magnitude at high energies compared to the inherently discontinuous bond-order metric. It is found that the fractal relation between crystalline domain area and circumference is independent of the experiment, the particular Minkowski tensor method, and the particular choice of parameters. Thus, the fractal relationship seems to be inherent to two-dimensional phase transitions in complex plasmas. Minkowski

  13. Learning Gene Regulatory Networks Computationally from Gene Expression Data Using Weighted Consensus

    KAUST Repository

    Fujii, Chisato

    2015-01-01

    the performance of the consensus. The linear programming- based consensus method is evaluated and it had the best performance on in silico and Saccharomyces cerevisiae networks, and the second best on the Escherichia coli network outperformed by Inferelator

  14. Automatic Decision Support for Clinical Diagnostic Literature Using Link Analysis in a Weighted Keyword Network.

    Science.gov (United States)

    Li, Shuqing; Sun, Ying; Soergel, Dagobert

    2017-12-23

    We present a novel approach to recommending articles from the medical literature that support clinical diagnostic decision-making, giving detailed descriptions of the associated ideas and principles. The specific goal is to retrieve biomedical articles that help answer questions of a specified type about a particular case. Based on the filtered keywords, MeSH(Medical Subject Headings) lexicon and the automatically extracted acronyms, the relationship between keywords and articles was built. The paper gives a detailed description of the process of by which keywords were measured and relevant articles identified based on link analysis in a weighted keywords network. Some important challenges identified in this study include the extraction of diagnosis-related keywords and a collection of valid sentences based on the keyword co-occurrence analysis and existing descriptions of symptoms. All data were taken from medical articles provided in the TREC (Text Retrieval Conference) clinical decision support track 2015. Ten standard topics and one demonstration topic were tested. In each case, a maximum of five articles with the highest relevance were returned. The total user satisfaction of 3.98 was 33% higher than average. The results also suggested that the smaller the number of results, the higher the average satisfaction. However, a few shortcomings were also revealed since medical literature recommendation for clinical diagnostic decision support is so complex a topic that it cannot be fully addressed through the semantic information carried solely by keywords in existing descriptions of symptoms. Nevertheless, the fact that these articles are actually relevant will no doubt inspire future research.

  15. The specification of weight structures in network autocorrelation models of social influence

    NARCIS (Netherlands)

    Leenders, Roger Th.A.J.

    2002-01-01

    Many physical and social phenomena are embedded within networks of interdependencies, the so-called 'context' of these phenomena. In network analysis, this type of process is typically modeled as a network autocorrelation model. Parameter estimates and inferences based on autocorrelation models,

  16. Optimization the Initial Weights of Artificial Neural Networks via Genetic Algorithm Applied to Hip Bone Fracture Prediction

    Directory of Open Access Journals (Sweden)

    Yu-Tzu Chang

    2012-01-01

    Full Text Available This paper aims to find the optimal set of initial weights to enhance the accuracy of artificial neural networks (ANNs by using genetic algorithms (GA. The sample in this study included 228 patients with first low-trauma hip fracture and 215 patients without hip fracture, both of them were interviewed with 78 questions. We used logistic regression to select 5 important factors (i.e., bone mineral density, experience of fracture, average hand grip strength, intake of coffee, and peak expiratory flow rate for building artificial neural networks to predict the probabilities of hip fractures. Three-layer (one hidden layer ANNs models with back-propagation training algorithms were adopted. The purpose in this paper is to find the optimal initial weights of neural networks via genetic algorithm to improve the predictability. Area under the ROC curve (AUC was used to assess the performance of neural networks. The study results showed the genetic algorithm obtained an AUC of 0.858±0.00493 on modeling data and 0.802 ± 0.03318 on testing data. They were slightly better than the results of our previous study (0.868±0.00387 and 0.796±0.02559, resp.. Thus, the preliminary study for only using simple GA has been proved to be effective for improving the accuracy of artificial neural networks.

  17. Hysteresis-controlled instability waves in a scale-free driven current sheet model

    Directory of Open Access Journals (Sweden)

    V. M. Uritsky

    2005-01-01

    Full Text Available Magnetospheric dynamics is a complex multiscale process whose statistical features can be successfully reproduced using high-dimensional numerical transport models exhibiting the phenomenon of self-organized criticality (SOC. Along this line of research, a 2-dimensional driven current sheet (DCS model has recently been developed that incorporates an idealized current-driven instability with a resistive MHD plasma system (Klimas et al., 2004a, b. The dynamics of the DCS model is dominated by the scale-free diffusive energy transport characterized by a set of broadband power-law distribution functions similar to those governing the evolution of multiscale precipitation regions of energetic particles in the nighttime sector of aurora (Uritsky et al., 2002b. The scale-free DCS behavior is supported by localized current-driven instabilities that can communicate in an avalanche fashion over arbitrarily long distances thus producing current sheet waves (CSW. In this paper, we derive the analytical expression for CSW speed as a function of plasma parameters controlling local anomalous resistivity dynamics. The obtained relation indicates that the CSW propagation requires sufficiently high initial current densities, and predicts a deceleration of CSWs moving from inner plasma sheet regions toward its northern and southern boundaries. We also show that the shape of time-averaged current density profile in the DCS model is in agreement with steady-state spatial configuration of critical avalanching models as described by the singular diffusion theory of the SOC. Over shorter time scales, SOC dynamics is associated with rather complex spatial patterns and, in particular, can produce bifurcated current sheets often seen in multi-satellite observations.

  18. Scale-free brain quartet: artistic filtering of multi-channel brainwave music.

    Science.gov (United States)

    Wu, Dan; Li, Chaoyi; Yao, Dezhong

    2013-01-01

    To listen to the brain activities as a piece of music, we proposed the scale-free brainwave music (SFBM) technology, which translated scalp EEGs into music notes according to the power law of both EEG and music. In the present study, the methodology was extended for deriving a quartet from multi-channel EEGs with artistic beat and tonality filtering. EEG data from multiple electrodes were first translated into MIDI sequences by SFBM, respectively. Then, these sequences were processed by a beat filter which adjusted the duration of notes in terms of the characteristic frequency. And the sequences were further filtered from atonal to tonal according to a key defined by the analysis of the original music pieces. Resting EEGs with eyes closed and open of 40 subjects were utilized for music generation. The results revealed that the scale-free exponents of the music before and after filtering were different: the filtered music showed larger variety between the eyes-closed (EC) and eyes-open (EO) conditions, and the pitch scale exponents of the filtered music were closer to 1 and thus it was more approximate to the classical music. Furthermore, the tempo of the filtered music with eyes closed was significantly slower than that with eyes open. With the original materials obtained from multi-channel EEGs, and a little creative filtering following the composition process of a potential artist, the resulted brainwave quartet opened a new window to look into the brain in an audible musical way. In fact, as the artistic beat and tonal filters were derived from the brainwaves, the filtered music maintained the essential properties of the brain activities in a more musical style. It might harmonically distinguish the different states of the brain activities, and therefore it provided a method to analyze EEGs from a relaxed audio perspective.

  19. Study Under AC Stimulation on Excitement Properties of Weighted Small-World Biological Neural Networks with Side-Restrain Mechanism

    International Nuclear Information System (INIS)

    Yuan Wujie; Luo Xiaoshu; Jiang Pinqun

    2007-01-01

    In this paper, we propose a new model of weighted small-world biological neural networks based on biophysical Hodgkin-Huxley neurons with side-restrain mechanism. Then we study excitement properties of the model under alternating current (AC) stimulation. The study shows that the excitement properties in the networks are preferably consistent with the behavior properties of a brain nervous system under different AC stimuli, such as refractory period and the brain neural excitement response induced by different intensities of noise and coupling. The results of the study have reference worthiness for the brain nerve electrophysiology and epistemological science.

  20. Weighted complex network analysis of the Beijing subway system: Train and passenger flows

    Science.gov (United States)

    Feng, Jia; Li, Xiamiao; Mao, Baohua; Xu, Qi; Bai, Yun

    2017-05-01

    In recent years, complex network theory has become an important approach to the study of the structure and dynamics of traffic networks. However, because traffic data is difficult to collect, previous studies have usually focused on the physical topology of subway systems, whereas few studies have considered the characteristics of traffic flows through the network. Therefore, in this paper, we present a multi-layer model to analyze traffic flow patterns in subway networks, based on trip data and an operation timetable obtained from the Beijing Subway System. We characterize the patterns in terms of the spatiotemporal flow size distributions of both the train flow network and the passenger flow network. In addition, we describe the essential interactions between these two networks based on statistical analyses. The results of this study suggest that layered models of transportation systems can elucidate fundamental differences between the coexisting traffic flows and can also clarify the mechanism that causes these differences.

  1. Structure and weights optimisation of a modified Elman network emotion classifier using hybrid computational intelligence algorithms: a comparative study

    Science.gov (United States)

    Sheikhan, Mansour; Abbasnezhad Arabi, Mahdi; Gharavian, Davood

    2015-10-01

    Artificial neural networks are efficient models in pattern recognition applications, but their performance is dependent on employing suitable structure and connection weights. This study used a hybrid method for obtaining the optimal weight set and architecture of a recurrent neural emotion classifier based on gravitational search algorithm (GSA) and its binary version (BGSA), respectively. By considering the features of speech signal that were related to prosody, voice quality, and spectrum, a rich feature set was constructed. To select more efficient features, a fast feature selection method was employed. The performance of the proposed hybrid GSA-BGSA method was compared with similar hybrid methods based on particle swarm optimisation (PSO) algorithm and its binary version, PSO and discrete firefly algorithm, and hybrid of error back-propagation and genetic algorithm that were used for optimisation. Experimental tests on Berlin emotional database demonstrated the superior performance of the proposed method using a lighter network structure.

  2. Optimization the initial weights of artificial neural networks via genetic algorithm applied to hip bone fracture prediction

    OpenAIRE

    Chang, Y-T; Lin, J; Shieh, J-S; Abbod, MF

    2012-01-01

    This paper aims to find the optimal set of initial weights to enhance the accuracy of artificial neural networks (ANNs) by using genetic algorithms (GA). The sample in this study included 228 patients with first low-trauma hip fracture and 215 patients without hip fracture, both of them were interviewed with 78 questions. We used logistic regression to select 5 important factors (i.e., bone mineral density, experience of fracture, average hand grip strength, intake of coffee, and peak expirat...

  3. Topology and weights in a protein domain interaction network--a novel way to predict protein interactions.

    Science.gov (United States)

    Wuchty, Stefan

    2006-05-23

    While the analysis of unweighted biological webs as diverse as genetic, protein and metabolic networks allowed spectacular insights in the inner workings of a cell, biological networks are not only determined by their static grid of links. In fact, we expect that the heterogeneity in the utilization of connections has a major impact on the organization of cellular activities as well. We consider a web of interactions between protein domains of the Protein Family database (PFAM), which are weighted by a probability score. We apply metrics that combine the static layout and the weights of the underlying interactions. We observe that unweighted measures as well as their weighted counterparts largely share the same trends in the underlying domain interaction network. However, we only find weak signals that weights and the static grid of interactions are connected entities. Therefore assuming that a protein interaction is governed by a single domain interaction, we observe strong and significant correlations of the highest scoring domain interaction and the confidence of protein interactions in the underlying interactions of yeast and fly. Modeling an interaction between proteins if we find a high scoring protein domain interaction we obtain 1, 428 protein interactions among 361 proteins in the human malaria parasite Plasmodium falciparum. Assessing their quality by a logistic regression method we observe that increasing confidence of predicted interactions is accompanied by high scoring domain interactions and elevated levels of functional similarity and evolutionary conservation. Our results indicate that probability scores are randomly distributed, allowing to treat static grid and weights of domain interactions as separate entities. In particular, these finding confirms earlier observations that a protein interaction is a matter of a single interaction event on domain level. As an immediate application, we show a simple way to predict potential protein interactions

  4. Topology and weights in a protein domain interaction network – a novel way to predict protein interactions

    Directory of Open Access Journals (Sweden)

    Wuchty Stefan

    2006-05-01

    Full Text Available Abstract Background While the analysis of unweighted biological webs as diverse as genetic, protein and metabolic networks allowed spectacular insights in the inner workings of a cell, biological networks are not only determined by their static grid of links. In fact, we expect that the heterogeneity in the utilization of connections has a major impact on the organization of cellular activities as well. Results We consider a web of interactions between protein domains of the Protein Family database (PFAM, which are weighted by a probability score. We apply metrics that combine the static layout and the weights of the underlying interactions. We observe that unweighted measures as well as their weighted counterparts largely share the same trends in the underlying domain interaction network. However, we only find weak signals that weights and the static grid of interactions are connected entities. Therefore assuming that a protein interaction is governed by a single domain interaction, we observe strong and significant correlations of the highest scoring domain interaction and the confidence of protein interactions in the underlying interactions of yeast and fly. Modeling an interaction between proteins if we find a high scoring protein domain interaction we obtain 1, 428 protein interactions among 361 proteins in the human malaria parasite Plasmodium falciparum. Assessing their quality by a logistic regression method we observe that increasing confidence of predicted interactions is accompanied by high scoring domain interactions and elevated levels of functional similarity and evolutionary conservation. Conclusion Our results indicate that probability scores are randomly distributed, allowing to treat static grid and weights of domain interactions as separate entities. In particular, these finding confirms earlier observations that a protein interaction is a matter of a single interaction event on domain level. As an immediate application, we

  5. Scale-free animal movement patterns: Levy walks outperform fractional Brownian motions and fractional Levy motions in random search scenarios

    International Nuclear Information System (INIS)

    Reynolds, A M

    2009-01-01

    The movement patterns of a diverse range of animals have scale-free characteristics. These characteristics provide necessary but not sufficient conditions for the presence of movement patterns that can be approximated by Levy walks. Nevertheless, it has been widely assumed that the occurrence of scale-free animal movements can indeed be attributed to the presence of Levy walks. This is, in part, because it is known that the super-diffusive properties of Levy walks can be advantageous in random search scenarios when searchers have little or no prior knowledge of target locations. However, fractional Brownian motions (fBms) and fractional Levy motions (fLms) are both scale-free and super-diffusive, and so it is possible that these motions rather than Levy walks underlie some or all occurrences of scale-free animal movement patterns. Here this possibility is examined in numerical simulations through a determination of the searching efficiencies of fBm and fLm searches. It is shown that these searches are less efficient than Levy walk searches. This finding does not rule out the possibility that some animals with scale-free movement patterns are executing fBm and fLm searches, but it does make Levy walk searches the more likely possibility.

  6. Weighted-DESYNC and Its Application to End-to-End Throughput Fairness in Wireless Multihop Network

    Directory of Open Access Journals (Sweden)

    Ui-Seong Yu

    2017-01-01

    Full Text Available The end-to-end throughput of a routing path in wireless multihop network is restricted by a bottleneck node that has the smallest bandwidth among the nodes on the routing path. In this study, we propose a method for resolving the bottleneck-node problem in multihop networks, which is based on multihop DESYNC (MH-DESYNC algorithm that is a bioinspired resource allocation method developed for use in multihop environments and enables fair resource allocation among nearby (up to two hops neighbors. Based on MH-DESYNC, we newly propose weighted-DESYNC (W-DESYNC as a tool artificially to control the amount of resource allocated to the specific user and thus to achieve throughput fairness over a routing path. Proposed W-DESYNC employs the weight factor of a link to determine the amount of bandwidth allocated to a node. By letting the weight factor be the link quality of a routing path and making it the same across a routing path via Cucker-Smale flocking model, we can obtain throughput fairness over a routing path. The simulation results show that the proposed algorithm achieves throughput fairness over a routing path and can increase total end-to-end throughput in wireless multihop networks.

  7. Combining PubMed knowledge and EHR data to develop a weighted bayesian network for pancreatic cancer prediction.

    Science.gov (United States)

    Zhao, Di; Weng, Chunhua

    2011-10-01

    In this paper, we propose a novel method that combines PubMed knowledge and Electronic Health Records to develop a weighted Bayesian Network Inference (BNI) model for pancreatic cancer prediction. We selected 20 common risk factors associated with pancreatic cancer and used PubMed knowledge to weigh the risk factors. A keyword-based algorithm was developed to extract and classify PubMed abstracts into three categories that represented positive, negative, or neutral associations between each risk factor and pancreatic cancer. Then we designed a weighted BNI model by adding the normalized weights into a conventional BNI model. We used this model to extract the EHR values for patients with or without pancreatic cancer, which then enabled us to calculate the prior probabilities for the 20 risk factors in the BNI. The software iDiagnosis was designed to use this weighted BNI model for predicting pancreatic cancer. In an evaluation using a case-control dataset, the weighted BNI model significantly outperformed the conventional BNI and two other classifiers (k-Nearest Neighbor and Support Vector Machine). We conclude that the weighted BNI using PubMed knowledge and EHR data shows remarkable accuracy improvement over existing representative methods for pancreatic cancer prediction. Copyright © 2011 Elsevier Inc. All rights reserved.

  8. Tweet for health: using an online social network to examine temporal trends in weight loss-related posts.

    Science.gov (United States)

    Turner-McGrievy, Gabrielle M; Beets, Michael W

    2015-06-01

    Few studies have used social networking sites to track temporal trends in health-related posts, particularly around weight loss. To examine the temporal relationship of Twitter messages about weight loss over 1 year (2012). Temporal trends in #weightloss mentions and #fitness, #diet, and #health tweets which also had the word "weight" in them were examined using three a priori time periods: (1) holidays: pre-winter holidays, holidays, and post-holidays; (2) Season: winter and summer; and (3) New Year's: pre-New Year's and post-New Year's. Regarding #weightloss, there were 145 (95 % CI 79, 211) more posts/day during holidays and 143 (95 % CI 76, 209) more posts/day after holidays as compared to 480 pre-holiday posts/day; 232 (95 % CI 178, 286) more posts/day during the winter versus summer (441 posts/day); there was no difference in posts around New Year's. Examining social networks for trends in health-related posts may aid in timing interventions when individuals are more likely to be discussing weight loss.

  9. An equal force theory for network models of soft materials with arbitrary molecular weight distribution

    Science.gov (United States)

    Verron, E.; Gros, A.

    2017-09-01

    Most network models for soft materials, e.g. elastomers and gels, are dedicated to idealized materials: all chains admit the same number of Kuhn segments. Nevertheless, such standard models are not appropriate for materials involving multiple networks, and some specific constitutive equations devoted to these materials have been derived in the last few years. In nearly all cases, idealized networks of different chain lengths are assembled following an equal strain assumption; only few papers adopt an equal stress assumption, although some authors argue that such hypothesis would reflect the equilibrium of the different networks in contact. In this work, a full-network model with an arbitrary chain length distribution is derived by considering that chains of different lengths satisfy the equal force assumption in each direction of the unit sphere. The derivation is restricted to non-Gaussian freely jointed chains and to affine deformation of the sphere. Firstly, after a proper definition of the undeformed configuration of the network, we demonstrate that the equal force assumption leads to the equality of a normalized stretch in chains of different lengths. Secondly, we establish that the network with chain length distribution behaves as an idealized full-network of which both chain length and density of are provided by the chain length distribution. This approach is finally illustrated with two examples: the derivation of a new expression for the Young modulus of bimodal interpenetrated polymer networks, and the prediction of the change in fluorescence during deformation of mechanochemically responsive elastomers.

  10. A Complex Network Approach to Distributional Semantic Models.

    Directory of Open Access Journals (Sweden)

    Akira Utsumi

    Full Text Available A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models.

  11. Measuring distance through dense weighted networks: The case of hospital-associated pathogens.

    Directory of Open Access Journals (Sweden)

    Tjibbe Donker

    2017-08-01

    Full Text Available Hospital networks, formed by patients visiting multiple hospitals, affect the spread of hospital-associated infections, resulting in differences in risks for hospitals depending on their network position. These networks are increasingly used to inform strategies to prevent and control the spread of hospital-associated pathogens. However, many studies only consider patients that are received directly from the initial hospital, without considering the effect of indirect trajectories through the network. We determine the optimal way to measure the distance between hospitals within the network, by reconstructing the English hospital network based on shared patients in 2014-2015, and simulating the spread of a hospital-associated pathogen between hospitals, taking into consideration that each intermediate hospital conveys a delay in the further spread of the pathogen. While the risk of transferring a hospital-associated pathogen between directly neighbouring hospitals is a direct reflection of the number of shared patients, the distance between two hospitals far-away in the network is determined largely by the number of intermediate hospitals in the network. Because the network is dense, most long distance transmission chains in fact involve only few intermediate steps, spreading along the many weak links. The dense connectivity of hospital networks, together with a strong regional structure, causes hospital-associated pathogens to spread from the initial outbreak in a two-step process: first, the directly surrounding hospitals are affected through the strong connections, second all other hospitals receive introductions through the multitude of weaker links. Although the strong connections matter for local spread, weak links in the network can offer ideal routes for hospital-associated pathogens to travel further faster. This hold important implications for infection prevention and control efforts: if a local outbreak is not controlled in time

  12. An AHP-Based Weighted Analysis of Network Knowledge Management Platforms for Elementary School Students

    Science.gov (United States)

    Lee, Chung-Ping; Lou, Shi-Jer; Shih, Ru-Chu; Tseng, Kuo-Hung

    2011-01-01

    This study uses the analytical hierarchy process (AHP) to quantify important knowledge management behaviors and to analyze the weight scores of elementary school students' behaviors in knowledge transfer, sharing, and creation. Based on the analysis of Expert Choice and tests for validity and reliability, this study identified the weight scores of…

  13. Development of Next Generation Heating System for Scale Free Steel Reheating

    Energy Technology Data Exchange (ETDEWEB)

    Dr. Arvind C. Thekdi

    2011-01-27

    The work carried out under this project includes development and design of components, controls, and economic modeling tools that would enable the steel industry to reduce energy intensity through reduction of scale formation during the steel reheating process. Application of scale free reheating offers savings in energy used for production of steel that is lost as scale, and increase in product yield for the global steel industry. The technology can be applied to a new furnace application as well as retrofit design for conversion of existing steel reheating furnaces. The development work has resulted in the knowledge base that will enable the steel industry and steel forging industry us to reheat steel with 75% to 95% reduction in scale formation and associated energy savings during the reheating process. Scale reduction also results in additional energy savings associated with higher yield from reheat furnaces. Energy used for steel production ranges from 9 MM Btu/ton to 16.6 MM Btu/ton or the industry average of approximately 13 MM Btu/ton. Hence, reduction in scale at reheating stage would represent a substantial energy reduction for the steel industry. Potential energy savings for the US steel industry could be in excess of 25 Trillion Btu/year when the technology is applied to all reheating processes. The development work has resulted in new design of reheating process and the required burners and control systems that would allow use of this technology for steel reheating in steel as well as steel forging industries.

  14. Intrusion Detection and light weight Firewall for the 6LoWPAN networks

    OpenAIRE

    Shreenivas, Dharmini

    2014-01-01

    IPv6 over Low power WPAN (6loWPAN) is an adaption layer introduced between the link layer and the network layer in the TCP/IP protocol stack to t the IPv6 datagrams over the IEEE 802.15.4 link layer. 6loWPAN networks comprise of internet enabled resource-constrained smart objects which are interconnected with each other through the Internet Protocol (IPv6). In Internet of Things (IoT), smart devices of the 6loWPAN networks are connected to the unsecured public Internet. RPL (Routing Protocol ...

  15. The impact of an online social network with wireless monitoring devices on physical activity and weight loss.

    Science.gov (United States)

    Greene, Jessica; Sacks, Rebecca; Piniewski, Brigitte; Kil, David; Hahn, Jin S

    2013-07-01

    Online social networks (OSNs) are a new, promising approach for catalyzing health-related behavior change. To date, the empirical evidence on their impact has been limited. Using a randomized trial, we assessed the impact of a health-oriented OSN with accelerometer and scales on participant's physical activity, weight, and clinical indicators. A sample of 349 PeaceHealth Oregon employees and family members were randomized to the iWell OSN or a control group and followed for 6 months in 2010-2011. The iWell OSN enabled participants to connect with "friends," make public postings, view contacts' postings, set goals, download the number of their steps from an accelerometer and their weight from a scale, view trends in physical activity and weight, and compete against others in physical activity. Both control and intervention participants received traditional education material on diet and physical activity. Laboratory data on weight and clinical indicators (triglycerides, high-density lipoprotein, or low-density lipoprotein), and self-reported data on physical activity, were collected at baseline, 3 months, and 6 months. At 6 months, the intervention group increased leisure walking minutes by 164% compared with 47% in the control group. The intervention group also lost more weight than the controls (5.2 pounds compared with 1.5 pounds). There were no observed significant differences in vigorous exercise or clinical indicators between the 2 groups. Among intervention participants, greater OSN use, as measured by number of private messages sent, was associated with a greater increase in leisure walking and greater weight reduction over the study period. The study provides evidence that interventions using OSNs can successfully promote increases in physical activity and weight loss.

  16. Inferring Weighted Directed Association Networks from Multivariate Time Series with the Small-Shuffle Symbolic Transfer Entropy Spectrum Method

    Directory of Open Access Journals (Sweden)

    Yanzhu Hu

    2016-09-01

    Full Text Available Complex network methodology is very useful for complex system exploration. However, the relationships among variables in complex systems are usually not clear. Therefore, inferring association networks among variables from their observed data has been a popular research topic. We propose a method, named small-shuffle symbolic transfer entropy spectrum (SSSTES, for inferring association networks from multivariate time series. The method can solve four problems for inferring association networks, i.e., strong correlation identification, correlation quantification, direction identification and temporal relation identification. The method can be divided into four layers. The first layer is the so-called data layer. Data input and processing are the things to do in this layer. In the second layer, we symbolize the model data, original data and shuffled data, from the previous layer and calculate circularly transfer entropy with different time lags for each pair of time series variables. Thirdly, we compose transfer entropy spectrums for pairwise time series with the previous layer’s output, a list of transfer entropy matrix. We also identify the correlation level between variables in this layer. In the last layer, we build a weighted adjacency matrix, the value of each entry representing the correlation level between pairwise variables, and then get the weighted directed association network. Three sets of numerical simulated data from a linear system, a nonlinear system and a coupled Rossler system are used to show how the proposed approach works. Finally, we apply SSSTES to a real industrial system and get a better result than with two other methods.

  17. Associations between the use of social networking sites and unhealthy eating behaviours and excess body weight in adolescents.

    Science.gov (United States)

    Sampasa-Kanyinga, Hugues; Chaput, Jean-Philippe; Hamilton, Hayley A

    2015-12-14

    Unhealthy eating behaviour and excess body weight have been related to sedentary behaviour, particularly screen time, in adolescents; however, little is known about their associations with the use of social networking sites (SNS). We investigated the associations between time spent using SNS and unhealthy eating behaviours (including breakfast skipping, consumption of sugar-sweetened beverages (SSB) and energy drinks) and body weight in adolescents. Data on 9858 students (mean age: 15·2 (SD 1·9) years) in grades 7 through 12 were derived from the 2013 cycle of the Ontario Student Drug Use and Health Survey--a cross-sectional school-based survey of middle and high school students. The majority (81·5%) of students reported daily use of SNS and an additional 10·7% reported using them on an irregular basis. Multivariate logistic regression analyses revealed that the use of SNS was associated with increased odds of skipping breakfast (P trendsocial networks on eating behaviours and risk of excess weight.

  18. Improving the Network Scale-Up Estimator: Incorporating Means of Sums, Recursive Back Estimation, and Sampling Weights.

    Directory of Open Access Journals (Sweden)

    Patrick Habecker

    Full Text Available Researchers interested in studying populations that are difficult to reach through traditional survey methods can now draw on a range of methods to access these populations. Yet many of these methods are more expensive and difficult to implement than studies using conventional sampling frames and trusted sampling methods. The network scale-up method (NSUM provides a middle ground for researchers who wish to estimate the size of a hidden population, but lack the resources to conduct a more specialized hidden population study. Through this method it is possible to generate population estimates for a wide variety of groups that are perhaps unwilling to self-identify as such (for example, users of illegal drugs or other stigmatized populations via traditional survey tools such as telephone or mail surveys--by asking a representative sample to estimate the number of people they know who are members of such a "hidden" subpopulation. The original estimator is formulated to minimize the weight a single scaling variable can exert upon the estimates. We argue that this introduces hidden and difficult to predict biases, and instead propose a series of methodological advances on the traditional scale-up estimation procedure, including a new estimator. Additionally, we formalize the incorporation of sample weights into the network scale-up estimation process, and propose a recursive process of back estimation "trimming" to identify and remove poorly performing predictors from the estimation process. To demonstrate these suggestions we use data from a network scale-up mail survey conducted in Nebraska during 2014. We find that using the new estimator and recursive trimming process provides more accurate estimates, especially when used in conjunction with sampling weights.

  19. A Scalable Weight-Free Learning Algorithm for Regulatory Control of Cell Activity in Spiking Neuronal Networks.

    Science.gov (United States)

    Zhang, Xu; Foderaro, Greg; Henriquez, Craig; Ferrari, Silvia

    2018-03-01

    Recent developments in neural stimulation and recording technologies are providing scientists with the ability of recording and controlling the activity of individual neurons in vitro or in vivo, with very high spatial and temporal resolution. Tools such as optogenetics, for example, are having a significant impact in the neuroscience field by delivering optical firing control with the precision and spatiotemporal resolution required for investigating information processing and plasticity in biological brains. While a number of training algorithms have been developed to date for spiking neural network (SNN) models of biological neuronal circuits, exiting methods rely on learning rules that adjust the synaptic strengths (or weights) directly, in order to obtain the desired network-level (or functional-level) performance. As such, they are not applicable to modifying plasticity in biological neuronal circuits, in which synaptic strengths only change as a result of pre- and post-synaptic neuron firings or biological mechanisms beyond our control. This paper presents a weight-free training algorithm that relies solely on adjusting the spatiotemporal delivery of neuron firings in order to optimize the network performance. The proposed weight-free algorithm does not require any knowledge of the SNN model or its plasticity mechanisms. As a result, this training approach is potentially realizable in vitro or in vivo via neural stimulation and recording technologies, such as optogenetics and multielectrode arrays, and could be utilized to control plasticity at multiple scales of biological neuronal circuits. The approach is demonstrated by training SNNs with hundreds of units to control a virtual insect navigating in an unknown environment.

  20. Delivery mode and intraventricular hemorrhage risk in very-low-birth-weight infants: Observational data of the German Neonatal Network.

    Science.gov (United States)

    Humberg, Alexander; Härtel, Christoph; Paul, Pia; Hanke, Kathrin; Bossung, Verena; Hartz, Annika; Fasel, Laura; Rausch, Tanja K; Rody, Achim; Herting, Egbert; Göpel, Wolfgang

    2017-05-01

    Very-low-birth-weight infants (VLBWI) are frequently delivered by cesarean section (CS). However, it is unclear at what gestational age the benefits of spontaneous delivery outweigh the perinatal risks, i.e. intraventricular hemorrhage (IVH) or death. To assess the short-term outcome of VLBWI on IVH according to mode of delivery in a population-based cohort of the German Neonatal Network (GNN). A total cohort of 2203 singleton VLBWI with a birth weight 30 weeks of gestation prevalence for IVH was not significantly different in VD and planned CS (5.3% vs. 4.4%). Our observational data demonstrate that elective cesarean section is associated with a reduced risk of IVH in preterm infants <30 weeks gestational age when presenting with preterm labor. Copyright © 2017 Elsevier B.V. All rights reserved.

  1. Nonlinear Dynamic Surface Control of Chaos in Permanent Magnet Synchronous Motor Based on the Minimum Weights of RBF Neural Network

    Directory of Open Access Journals (Sweden)

    Shaohua Luo

    2014-01-01

    Full Text Available This paper is concerned with the problem of the nonlinear dynamic surface control (DSC of chaos based on the minimum weights of RBF neural network for the permanent magnet synchronous motor system (PMSM wherein the unknown parameters, disturbances, and chaos are presented. RBF neural network is used to approximate the nonlinearities and an adaptive law is employed to estimate unknown parameters. Then, a simple and effective controller is designed by introducing dynamic surface control technique on the basis of first-order filters. Asymptotically tracking stability in the sense of uniformly ultimate boundedness is achieved in a short time. Finally, the performance of the proposed controller is testified through simulation results.

  2. Social/Electronic Media Use of Children and Adolescents Who Attend the Pediatric Weight Management Programs of the COMPASS Network.

    Science.gov (United States)

    Siegel, Robert; Fals, Angela; Mirza, Nazrat; Datto, George; Stratbucker, William; Ievers-Landis, Carolyn E; Christison, Amy; Wang, Yu; Woolford, Susan J

    2015-10-01

    Obesity is a major healthcare problem in youth and their social/electronic media (SEM) use has been described as a risk factor. Though much is known about the newer technologies youth use to communicate, little is known about what is used by those in weight management programs. The aim of this study was to determine what types of SEM, including sedentary and active video games, youth in weight management programs use and which they prefer for communicating with healthcare providers. This was a multisite study using a 24-question online SurveyMonkey® questionnaire. Youth, 12-17 years old, attending pediatric weight management programs at seven participating centers in the Childhood Obesity Multi Program Analysis and Study System network were eligible. There were 292 responders with a mean age of 14.2 years. Fifty-four percent were female, 36% Caucasian, 35% African American, and 33% were Hispanic. Ninety-four percent had access to a computer, 71% had Internet access, and 63% had smartphones. Whereas 87% had at least one gaming system at home, 50% reported they never played sedentary video games (71% of females vs. 25% males; p social media (6%). Face-to-face communication with healthcare providers is the preferred method for youth in pediatric weight management programs. They self-reported video game use less than previously described.

  3. Prediction of disease-related genes based on weighted tissue-specific networks by using DNA methylation.

    Science.gov (United States)

    Li, Min; Zhang, Jiayi; Liu, Qing; Wang, Jianxin; Wu, Fang-Xiang

    2014-01-01

    Predicting disease-related genes is one of the most important tasks in bioinformatics and systems biology. With the advances in high-throughput techniques, a large number of protein-protein interactions are available, which make it possible to identify disease-related genes at the network level. However, network-based identification of disease-related genes is still a challenge as the considerable false-positives are still existed in the current available protein interaction networks (PIN). Considering the fact that the majority of genetic disorders tend to manifest only in a single or a few tissues, we constructed tissue-specific networks (TSN) by integrating PIN and tissue-specific data. We further weighed the constructed tissue-specific network (WTSN) by using DNA methylation as it plays an irreplaceable role in the development of complex diseases. A PageRank-based method was developed to identify disease-related genes from the constructed networks. To validate the effectiveness of the proposed method, we constructed PIN, weighted PIN (WPIN), TSN, WTSN for colon cancer and leukemia, respectively. The experimental results on colon cancer and leukemia show that the combination of tissue-specific data and DNA methylation can help to identify disease-related genes more accurately. Moreover, the PageRank-based method was effective to predict disease-related genes on the case studies of colon cancer and leukemia. Tissue-specific data and DNA methylation are two important factors to the study of human diseases. The same method implemented on the WTSN can achieve better results compared to those being implemented on original PIN, WPIN, or TSN. The PageRank-based method outperforms degree centrality-based method for identifying disease-related genes from WTSN.

  4. Global robust stability of delayed neural networks: Estimating upper limit of norm of delayed connection weight matrix

    International Nuclear Information System (INIS)

    Singh, Vimal

    2007-01-01

    The question of estimating the upper limit of -parallel B -parallel 2 , which is a key step in some recently reported global robust stability criteria for delayed neural networks, is revisited ( B denotes the delayed connection weight matrix). Recently, Cao, Huang, and Qu have given an estimate of the upper limit of -parallel B -parallel 2 . In the present paper, an alternative estimate of the upper limit of -parallel B -parallel 2 is highlighted. It is shown that the alternative estimate may yield some new global robust stability results

  5. An Effective Collaborative Mobile Weighted Clustering Schemes for Energy Balancing in Wireless Sensor Networks.

    Science.gov (United States)

    Tang, Chengpei; Shokla, Sanesy Kumcr; Modhawar, George; Wang, Qiang

    2016-02-19

    Collaborative strategies for mobile sensor nodes ensure the efficiency and the robustness of data processing, while limiting the required communication bandwidth. In order to solve the problem of pipeline inspection and oil leakage monitoring, a collaborative weighted mobile sensing scheme is proposed. By adopting a weighted mobile sensing scheme, the adaptive collaborative clustering protocol can realize an even distribution of energy load among the mobile sensor nodes in each round, and make the best use of battery energy. A detailed theoretical analysis and experimental results revealed that the proposed protocol is an energy efficient collaborative strategy such that the sensor nodes can communicate with a fusion center and produce high power gain.

  6. Resilient Amorphous Networks Prepared by Photo-Crosslinking High-Molecular-Weight D,L-Lactide and Trimethylene Carbonate Macromers: Mechanical Properties and Shape-Memory Behavior

    NARCIS (Netherlands)

    Sharifi, Shahriar; Grijpma, Dirk W.

    2012-01-01

    Tough networks are prepared by photo-crosslinking high-molecular-weight DLLA and TMC macromers. These amorphous networks exhibit tunable thermal and mechanical properties and have excellent shape-memory features. Variation of the monomer ratio allows adjustment of Tg between approximately −13 and

  7. How to construct the statistic network? An association network of herbaceous

    Directory of Open Access Journals (Sweden)

    WenJun Zhang

    2012-06-01

    constructed network increases. Network compactness also follows the trend. In addition, as the increase of network compactness and connectance, the portion and number of negative association declines dramatically.(2 In an association (interaction network, only a few connections follow the linear relationship. Most connections follow the quasi-linear or non-linear relationships. (3 The association networks constructed from partial linear correlation and linear correlation measures are generally scale-free complex networks. The degree of these networks is power low distributed. (4 Isolated species (families, etc. are likely important in the statistic network. They are the sink species for shaping new network after a community is seriously disturbed. (5 Beween-taxa connections at higher taxonomic level are generally weaker than that at lower taxonomic level.

  8. Critical dynamics in associative memory networks

    Directory of Open Access Journals (Sweden)

    Maximilian eUhlig

    2013-07-01

    Full Text Available Critical behavior in neural networks is characterized by scale-free avalanche size distributions and can be explained by self-regulatory mechanisms. Theoretical and experimental evidence indicates that information storage capacity reaches its maximum in the critical regime. We study the effect of structural connectivity formed by Hebbian learning on the criticality of network dynamics. The network endowed with Hebbian learning only does not allow for simultaneous information storage and criticality. However, the critical regime is can be stabilized by short-term synaptic dynamics in the form of synaptic depression and facilitation or, alternatively, by homeostatic adaptation of the synaptic weights. We show that a heterogeneous distribution of maximal synaptic strengths does not preclude criticality if the Hebbian learning is alternated with periods of critical dynamics recovery. We discuss the relevance of these findings for the flexibility of memory in aging and with respect to the recent theory of synaptic plasticity.

  9. Spatial analysis of bus transport networks using network theory

    Science.gov (United States)

    Shanmukhappa, Tanuja; Ho, Ivan Wang-Hei; Tse, Chi Kong

    2018-07-01

    In this paper, we analyze the bus transport network (BTN) structure considering the spatial embedding of the network for three cities, namely, Hong Kong (HK), London (LD), and Bengaluru (BL). We propose a novel approach called supernode graph structuring for modeling the bus transport network. A static demand estimation procedure is proposed to assign the node weights by considering the points of interests (POIs) and the population distribution in the city over various localized zones. In addition, the end-to-end delay is proposed as a parameter to measure the topological efficiency of the bus networks instead of the shortest distance measure used in previous works. With the aid of supernode graph representation, important network parameters are analyzed for the directed, weighted and geo-referenced bus transport networks. It is observed that the supernode concept has significant advantage in analyzing the inherent topological behavior. For instance, the scale-free and small-world behavior becomes evident with supernode representation as compared to conventional or regular graph representation for the Hong Kong network. Significant improvement in clustering, reduction in path length, and increase in centrality values are observed in all the three networks with supernode representation. The correlation between topologically central nodes and the geographically central nodes reveals the interesting fact that the proposed static demand estimation method for assigning node weights aids in better identifying the geographically significant nodes in the network. The impact of these geographically significant nodes on the local traffic behavior is demonstrated by simulation using the SUMO (Simulation of Urban Mobility) tool which is also supported by real-world empirical data, and our results indicate that the traffic speed around a particular bus stop can reach a jammed state from a free flow state due to the presence of these geographically important nodes. A comparison

  10. A Real-Time Smooth Weighted Data Fusion Algorithm for Greenhouse Sensing Based on Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Tengyue Zou

    2017-11-01

    Full Text Available Wireless sensor networks are widely used to acquire environmental parameters to support agricultural production. However, data variation and noise caused by actuators often produce complex measurement conditions. These factors can lead to nonconformity in reporting samples from different nodes and cause errors when making a final decision. Data fusion is well suited to reduce the influence of actuator-based noise and improve automation accuracy. A key step is to identify the sensor nodes disturbed by actuator noise and reduce their degree of participation in the data fusion results. A smoothing value is introduced and a searching method based on Prim’s algorithm is designed to help obtain stable sensing data. A voting mechanism with dynamic weights is then proposed to obtain the data fusion result. The dynamic weighting process can sharply reduce the influence of actuator noise in data fusion and gradually condition the data to normal levels over time. To shorten the data fusion time in large networks, an acceleration method with prediction is also presented to reduce the data collection time. A real-time system is implemented on STMicroelectronics STM32F103 and NORDIC nRF24L01 platforms and the experimental results verify the improvement provided by these new algorithms.

  11. Identifying Vulnerable Nodes of Complex Networks in Cascading Failures Induced by Node-Based Attacks

    Directory of Open Access Journals (Sweden)

    Shudong Li

    2013-01-01

    Full Text Available In the research on network security, distinguishing the vulnerable components of networks is very important for protecting infrastructures systems. Here, we probe how to identify the vulnerable nodes of complex networks in cascading failures, which was ignored before. Concerned with random attack (RA and highest load attack (HL on nodes, we model cascading dynamics of complex networks. Then, we introduce four kinds of weighting methods to characterize the nodes of networks including Barabási-Albert scale-free networks (SF, Watts-Strogatz small-world networks (WS, Erdos-Renyi random networks (ER, and two real-world networks. The simulations show that, for SF networks under HL attack, the nodes with small value of the fourth kind of weight are the most vulnerable and the ones with small value of the third weight are also vulnerable. Also, the real-world autonomous system with power-law distribution verifies these findings. Moreover, for WS and ER networks under both RA and HL attack, when the nodes have low tolerant ability, the ones with small value of the fourth kind of weight are more vulnerable and also the ones with high degree are easier to break down. The results give us important theoretical basis for digging the potential safety loophole and making protection strategy.

  12. Brain networks for confidence weighting and hierarchical inference during probabilistic learning.

    Science.gov (United States)

    Meyniel, Florent; Dehaene, Stanislas

    2017-05-09

    Learning is difficult when the world fluctuates randomly and ceaselessly. Classical learning algorithms, such as the delta rule with constant learning rate, are not optimal. Mathematically, the optimal learning rule requires weighting prior knowledge and incoming evidence according to their respective reliabilities. This "confidence weighting" implies the maintenance of an accurate estimate of the reliability of what has been learned. Here, using fMRI and an ideal-observer analysis, we demonstrate that the brain's learning algorithm relies on confidence weighting. While in the fMRI scanner, human adults attempted to learn the transition probabilities underlying an auditory or visual sequence, and reported their confidence in those estimates. They knew that these transition probabilities could change simultaneously at unpredicted moments, and therefore that the learning problem was inherently hierarchical. Subjective confidence reports tightly followed the predictions derived from the ideal observer. In particular, subjects managed to attach distinct levels of confidence to each learned transition probability, as required by Bayes-optimal inference. Distinct brain areas tracked the likelihood of new observations given current predictions, and the confidence in those predictions. Both signals were combined in the right inferior frontal gyrus, where they operated in agreement with the confidence-weighting model. This brain region also presented signatures of a hierarchical process that disentangles distinct sources of uncertainty. Together, our results provide evidence that the sense of confidence is an essential ingredient of probabilistic learning in the human brain, and that the right inferior frontal gyrus hosts a confidence-based statistical learning algorithm for auditory and visual sequences.

  13. A Type-2 fuzzy data fusion approach for building reliable weighted protein interaction networks with application in protein complex detection.

    Science.gov (United States)

    Mehranfar, Adele; Ghadiri, Nasser; Kouhsar, Morteza; Golshani, Ashkan

    2017-09-01

    Detecting the protein complexes is an important task in analyzing the protein interaction networks. Although many algorithms predict protein complexes in different ways, surveys on the interaction networks indicate that about 50% of detected interactions are false positives. Consequently, the accuracy of existing methods needs to be improved. In this paper we propose a novel algorithm to detect the protein complexes in 'noisy' protein interaction data. First, we integrate several biological data sources to determine the reliability of each interaction and determine more accurate weights for the interactions. A data fusion component is used for this step, based on the interval type-2 fuzzy voter that provides an efficient combination of the information sources. This fusion component detects the errors and diminishes their effect on the detection protein complexes. So in the first step, the reliability scores have been assigned for every interaction in the network. In the second step, we have proposed a general protein complex detection algorithm by exploiting and adopting the strong points of other algorithms and existing hypotheses regarding real complexes. Finally, the proposed method has been applied for the yeast interaction datasets for predicting the interactions. The results show that our framework has a better performance regarding precision and F-measure than the existing approaches. Copyright © 2017 Elsevier Ltd. All rights reserved.

  14. Brain networks for confidence weighting and hierarchical inference during probabilistic learning

    Science.gov (United States)

    Meyniel, Florent; Dehaene, Stanislas

    2017-01-01

    Learning is difficult when the world fluctuates randomly and ceaselessly. Classical learning algorithms, such as the delta rule with constant learning rate, are not optimal. Mathematically, the optimal learning rule requires weighting prior knowledge and incoming evidence according to their respective reliabilities. This “confidence weighting” implies the maintenance of an accurate estimate of the reliability of what has been learned. Here, using fMRI and an ideal-observer analysis, we demonstrate that the brain’s learning algorithm relies on confidence weighting. While in the fMRI scanner, human adults attempted to learn the transition probabilities underlying an auditory or visual sequence, and reported their confidence in those estimates. They knew that these transition probabilities could change simultaneously at unpredicted moments, and therefore that the learning problem was inherently hierarchical. Subjective confidence reports tightly followed the predictions derived from the ideal observer. In particular, subjects managed to attach distinct levels of confidence to each learned transition probability, as required by Bayes-optimal inference. Distinct brain areas tracked the likelihood of new observations given current predictions, and the confidence in those predictions. Both signals were combined in the right inferior frontal gyrus, where they operated in agreement with the confidence-weighting model. This brain region also presented signatures of a hierarchical process that disentangles distinct sources of uncertainty. Together, our results provide evidence that the sense of confidence is an essential ingredient of probabilistic learning in the human brain, and that the right inferior frontal gyrus hosts a confidence-based statistical learning algorithm for auditory and visual sequences. PMID:28439014

  15. Vaccination intervention on epidemic dynamics in networks

    Science.gov (United States)

    Peng, Xiao-Long; Xu, Xin-Jian; Fu, Xinchu; Zhou, Tao

    2013-02-01

    Vaccination is an important measure available for preventing or reducing the spread of infectious diseases. In this paper, an epidemic model including susceptible, infected, and imperfectly vaccinated compartments is studied on Watts-Strogatz small-world, Barabási-Albert scale-free, and random scale-free networks. The epidemic threshold and prevalence are analyzed. For small-world networks, the effective vaccination intervention is suggested and its influence on the threshold and prevalence is analyzed. For scale-free networks, the threshold is found to be strongly dependent both on the effective vaccination rate and on the connectivity distribution. Moreover, so long as vaccination is effective, it can linearly decrease the epidemic prevalence in small-world networks, whereas for scale-free networks it acts exponentially. These results can help in adopting pragmatic treatment upon diseases in structured populations.

  16. Robust Weighted Sum Harvested Energy Maximization for SWIPT Cognitive Radio Networks Based on Particle Swarm Optimization.

    Science.gov (United States)

    Tuan, Pham Viet; Koo, Insoo

    2017-10-06

    In this paper, we consider multiuser simultaneous wireless information and power transfer (SWIPT) for cognitive radio systems where a secondary transmitter (ST) with an antenna array provides information and energy to multiple single-antenna secondary receivers (SRs) equipped with a power splitting (PS) receiving scheme when multiple primary users (PUs) exist. The main objective of the paper is to maximize weighted sum harvested energy for SRs while satisfying their minimum required signal-to-interference-plus-noise ratio (SINR), the limited transmission power at the ST, and the interference threshold of each PU. For the perfect channel state information (CSI), the optimal beamforming vectors and PS ratios are achieved by the proposed PSO-SDR in which semidefinite relaxation (SDR) and particle swarm optimization (PSO) methods are jointly combined. We prove that SDR always has a rank-1 solution, and is indeed tight. For the imperfect CSI with bounded channel vector errors, the upper bound of weighted sum harvested energy (WSHE) is also obtained through the S-Procedure. Finally, simulation results demonstrate that the proposed PSO-SDR has fast convergence and better performance as compared to the other baseline schemes.

  17. The golden mean, scale free extension of real number system, fuzzy sets and 1/f spectrum in physics and biology

    CERN Document Server

    Datta, D P

    2003-01-01

    We show that the generic 1/f spectrum problem acquires a natural explanation in a class of scale free solutions to the ordinary differential equations. We prove the existence and uniqueness of this class of solutions and show how this leads to a nonstandard, fuzzy extension of the ordinary framework of calculus, and hence, that of the classical dynamics and quantum mechanics. The exceptional role of the golden mean irrational number is also explained.

  18. The golden mean, scale free extension of real number system, fuzzy sets and 1/f spectrum in physics and biology

    International Nuclear Information System (INIS)

    Datta, Dhurjati Prasad

    2003-01-01

    We show that the generic 1/f spectrum problem acquires a natural explanation in a class of scale free solutions to the ordinary differential equations. We prove the existence and uniqueness of this class of solutions and show how this leads to a nonstandard, fuzzy extension of the ordinary framework of calculus, and hence, that of the classical dynamics and quantum mechanics. The exceptional role of the golden mean irrational number is also explained

  19. Network rewiring dynamics with convergence towards a star network.

    Science.gov (United States)

    Whigham, P A; Dick, G; Parry, M

    2016-10-01

    Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz ( Nature 393 , 440-442. (doi:10.1038/30918)). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach.

  20. Vulnerability of complex networks

    Science.gov (United States)

    Mishkovski, Igor; Biey, Mario; Kocarev, Ljupco

    2011-01-01

    We consider normalized average edge betweenness of a network as a metric of network vulnerability. We suggest that normalized average edge betweenness together with is relative difference when certain number of nodes and/or edges are removed from the network is a measure of network vulnerability, called vulnerability index. Vulnerability index is calculated for four synthetic networks: Erdős-Rényi (ER) random networks, Barabási-Albert (BA) model of scale-free networks, Watts-Strogatz (WS) model of small-world networks, and geometric random networks. Real-world networks for which vulnerability index is calculated include: two human brain networks, three urban networks, one collaboration network, and two power grid networks. We find that WS model of small-world networks and biological networks (human brain networks) are the most robust networks among all networks studied in the paper.

  1. Robustness of pinning a general complex dynamical network

    International Nuclear Information System (INIS)

    Wang Lei; Sun Youxian

    2010-01-01

    This Letter studies the robustness problem of pinning a general complex dynamical network toward an assigned synchronous evolution. Several synchronization criteria are presented to guarantee the convergence of the pinning process locally and globally by construction of Lyapunov functions. In particular, if a pinning strategy has been designed for synchronization of a given complex dynamical network, then no matter what uncertainties occur among the pinned nodes, synchronization can still be guaranteed through the pinning. The analytical results show that pinning control has a certain robustness against perturbations on network architecture: adding, deleting and changing the weights of edges. Numerical simulations illustrated by scale-free complex networks verify the theoretical results above-acquired.

  2. Vertex centrality as a measure of information flow in Italian Corporate Board Networks

    Science.gov (United States)

    Grassi, Rosanna

    2010-06-01

    The aim of this article is to investigate the governance models of companies listed on the Italian Stock Exchange by using a network approach, which describes the interlinks between boards of directors. Following mainstream literature, I construct a weighted graph representing the listed companies (vertices) and their relationships (weighted edges), the Corporate Board Network; I then apply three different vertex centrality measures: degree, betweenness and flow betweenness. What emerges from the network construction and by applying the degree centrality is a structure with a large number of connections but not particularly dense, where the presence of a small number of highly connected nodes (hubs) is evident. Then I focus on betweenness and flow betweenness; indeed I expect that these centrality measures may give a representation of the intensity of the relationship between companies, capturing the volume of information flowing from one vertex to another. Finally, I investigate the possible scale-free structure of the network.

  3. Frozen Fractals all Around: Solar flares, Ampere’s Law, and the Search for Units in Scale-Free Processes.

    Science.gov (United States)

    McAteer, R. T. James

    2015-08-01

    My soul is spiraling in frozen fractals all around, And one thought crystallizes like an icy blast, I'm never going back, the past is in the past.Elsa, from Disney’s Frozen, characterizes two fundamental aspects of scale-free processes in Nature: fractals are everywhere in space; fractals can be used to probe changes in time. Self-Organized Criticality provides a powerful set of tools to study scale-free processes. It connects spatial fractals (more generically, multifractals) to temporal evolution. The drawback is that this usually results in scale-free, unit-less, indices, which can be difficult to connect to everyday physics. Here, I show a novel method that connects one of the most powerful SOC tools - the wavelet transform modulus maxima approach to calculating multifractality - to one of the most powerful equations in all of physics - Ampere’s law. In doing so I show how the multifractal spectra can be expressed in terms of current density, and how current density can then be used for the prediction of future energy release from such a system.Our physical understanding of the solar magnetic field structure, and hence our ability to predict solar activity, is limited by the type of data currently available. I show that the multifractal spectrum provides a powerful physical connection between the details of photospheric magnetic gradients of current data and the coronal magnetic structure. By decomposing Ampere’s law and comparing it to the wavelet transform modulus maximum method, I show how the scale-free Holder exponent provides a direct measure of current density across all relevant sizes. The prevalence of this current density across various scales is connected to its stability in time, and hence to the ability of the magnetic structure to store and then release energy. Hence (spatial) multifractals inform us of (future) solar activity.Finally I discuss how such an approach can be used in any study of scale-free processes, and highlight the necessary

  4. Weighted gene co-expression network analysis reveals potential genes involved in early metamorphosis process in sea cucumber Apostichopus japonicus.

    Science.gov (United States)

    Li, Yongxin; Kikuchi, Mani; Li, Xueyan; Gao, Qionghua; Xiong, Zijun; Ren, Yandong; Zhao, Ruoping; Mao, Bingyu; Kondo, Mariko; Irie, Naoki; Wang, Wen

    2018-01-01

    Sea cucumbers, one main class of Echinoderms, have a very fast and drastic metamorphosis process during their development. However, the molecular basis under this process remains largely unknown. Here we systematically examined the gene expression profiles of Japanese common sea cucumber (Apostichopus japonicus) for the first time by RNA sequencing across 16 developmental time points from fertilized egg to juvenile stage. Based on the weighted gene co-expression network analysis (WGCNA), we identified 21 modules. Among them, MEdarkmagenta was highly expressed and correlated with the early metamorphosis process from late auricularia to doliolaria larva. Furthermore, gene enrichment and differentially expressed gene analysis identified several genes in the module that may play key roles in the metamorphosis process. Our results not only provide a molecular basis for experimentally studying the development and morphological complexity of sea cucumber, but also lay a foundation for improving its emergence rate. Copyright © 2017 Elsevier Inc. All rights reserved.

  5. Grooming network cohesion and the role of individuals in a captive chimpanzee group.

    Science.gov (United States)

    Kanngiesser, Patricia; Sueur, Cédric; Riedl, Katrin; Grossmann, Johannes; Call, Josep

    2011-08-01

    Social network analysis offers new tools to study the social structure of primate groups. We used social network analysis to investigate the cohesiveness of a grooming network in a captive chimpanzee group (N = 17) and the role that individuals may play in it. Using data from a year-long observation, we constructed an unweighted social network of preferred grooming interactions by retaining only those dyads that groomed above the group mean. This choice of criterion was validated by the finding that the properties of the unweighted network correlated with the properties of a weighted network (i.e. a network representing the frequency of grooming interactions) constructed from the same data. To investigate group cohesion, we tested the resilience of the unweighted grooming network to the removal of central individuals (i.e. individuals with high betweenness centrality). The network fragmented more after the removal of individuals with high betweenness centrality than after the removal of random individuals. Central individuals played a pivotal role in maintaining the network's cohesiveness, and we suggest that this may be a typical property of affiliative networks like grooming networks. We found that the grooming network correlated with kinship and age, and that individuals with higher social status occupied more central positions in the network. Overall, the grooming network showed a heterogeneous structure, yet did not exhibit scale-free properties similar to many other primate networks. We discuss our results in light of recent findings on animal social networks and chimpanzee grooming. © 2010 Wiley-Liss, Inc.

  6. Epidemic dynamics and endemic states in complex networks

    OpenAIRE

    Pastor-Satorras, Romualdo; Vespignani, Alessandro

    2001-01-01

    We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below which the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are pron...

  7. Excessive Time on Social Networking Sites and Disordered Eating Behaviors Among Undergraduate Students: Appearance and Weight Esteem as Mediating Pathways.

    Science.gov (United States)

    Murray, Marisa; Maras, Danijela; Goldfield, Gary S

    2016-12-01

    Social networking sites (SNS) are a popular form of communication among undergraduate students. Body image concerns and disordered eating behaviors are also quite prevalent among this population. Maladaptive use of SNS has been associated with disordered eating behaviors; however, the mechanisms remain unclear. The present study examined if body image concerns (e.g., appearance and weight esteem) mediate the relationship between excessive time spent on SNS and disordered eating behaviors (restrained and emotional eating). The sample included 383 (70.2 percent female) undergraduate students (mean age = 23.08 years, standard deviation = 3.09) who completed self-report questionnaires related to SNS engagement, body image, disordered eating behaviors, and demographics. Parallel multiple mediation and moderated mediation analyses revealed that lower weight and appearance esteem mediated the relationship between excessive time on SNS and restrained eating for males and females, whereas appearance esteem mediated the relationship between excessive time on SNS and emotional eating for females only. The study adds to the literature by highlighting mediational pathways and gender differences. Intervention research is needed to determine if teaching undergraduate students more adaptive ways of using SNS or reducing exposure to SNS reduces body dissatisfaction and disordered eating in this high-risk population.

  8. An improved correlation to predict molecular weight between crosslinks based on equilibrium degree of swelling of hydrogel networks.

    Science.gov (United States)

    Jimenez-Vergara, Andrea C; Lewis, John; Hahn, Mariah S; Munoz-Pinto, Dany J

    2018-04-01

    Accurate characterization of hydrogel diffusional properties is of substantial importance for a range of biotechnological applications. The diffusional capacity of hydrogels has commonly been estimated using the average molecular weight between crosslinks (M c ), which is calculated based on the equilibrium degree of swelling. However, the existing correlation linking M c and equilibrium swelling fails to accurately reflect the diffusional properties of highly crosslinked hydrogel networks. Also, as demonstrated herein, the current model fails to accurately predict the diffusional properties of hydrogels when polymer concentration and molecular weight are varied simultaneously. To address these limitations, we evaluated the diffusional properties of 48 distinct hydrogel formulations using two different photoinitiator systems, employing molecular size exclusion as an alternative methodology to calculate average hydrogel mesh size. The resulting data were then utilized to develop a revised correlation between M c and hydrogel equilibrium swelling that substantially reduces the limitations associated with the current correlation. © 2017 Wiley Periodicals, Inc. J Biomed Mater Res Part B: Appl Biomater, 106B: 1339-1348, 2018. © 2017 Wiley Periodicals, Inc.

  9. Robust Template Decomposition without Weight Restriction for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers

    Directory of Open Access Journals (Sweden)

    Yih-Lon Lin

    2013-01-01

    Full Text Available If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.

  10. Forecasting of a ground-coupled heat pump performance using neural networks with statistical data weighting pre-processing

    Energy Technology Data Exchange (ETDEWEB)

    Esen, Hikmet; Esen, Mehmet [Department of Mechanical Education, Faculty of Technical Education, Firat University, 23119 Elazig (Turkey); Inalli, Mustafa [Department of Mechanical Engineering, Faculty of Engineering, Firat University, 23279 Elazig (Turkey); Sengur, Abdulkadir [Department of Electronic and Computer Science, Faculty of Technical Education, Firat University, 23119 Elazig (Turkey)

    2008-04-15

    The objective of this work is to improve the performance of an artificial neural network (ANN) with a statistical weighted pre-processing (SWP) method to learn to predict ground source heat pump (GCHP) systems with the minimum data set. Experimental studies were completed to obtain training and test data. Air temperatures entering/leaving condenser unit, water-antifreeze solution entering/leaving the horizontal ground heat exchangers and ground temperatures (1 and 2 m) were used as input layer, while the output is coefficient of performance (COP) of system. Some statistical methods, such as the root-mean squared (RMS), the coefficient of multiple determinations (R{sup 2}) and the coefficient of variation (cov) is used to compare predicted and actual values for model validation. It is found that RMS value is 0.074, R{sup 2} value is 0.9999 and cov value is 2.22 for SCG6 algorithm of only ANN structure. It is also found that RMS value is 0.002, R{sup 2} value is 0.9999 and cov value is 0.076 for SCG6 algorithm of SWP-ANN structure. The simulation results show that the SWP based networks can be used an alternative way in these systems. Therefore, instead of limited experimental data found in literature, faster and simpler solutions are obtained using hybridized structures such as SWP-ANN. (author)

  11. LEGO: a novel method for gene set over-representation analysis by incorporating network-based gene weights.

    Science.gov (United States)

    Dong, Xinran; Hao, Yun; Wang, Xiao; Tian, Weidong

    2016-01-11

    Pathway or gene set over-representation analysis (ORA) has become a routine task in functional genomics studies. However, currently widely used ORA tools employ statistical methods such as Fisher's exact test that reduce a pathway into a list of genes, ignoring the constitutive functional non-equivalent roles of genes and the complex gene-gene interactions. Here, we develop a novel method named LEGO (functional Link Enrichment of Gene Ontology or gene sets) that takes into consideration these two types of information by incorporating network-based gene weights in ORA analysis. In three benchmarks, LEGO achieves better performance than Fisher and three other network-based methods. To further evaluate LEGO's usefulness, we compare LEGO with five gene expression-based and three pathway topology-based methods using a benchmark of 34 disease gene expression datasets compiled by a recent publication, and show that LEGO is among the top-ranked methods in terms of both sensitivity and prioritization for detecting target KEGG pathways. In addition, we develop a cluster-and-filter approach to reduce the redundancy among the enriched gene sets, making the results more interpretable to biologists. Finally, we apply LEGO to two lists of autism genes, and identify relevant gene sets to autism that could not be found by Fisher.

  12. Weighted Gene Co-expression Network Analysis of the Dioscin Rich Medicinal Plant Dioscorea nipponica

    Directory of Open Access Journals (Sweden)

    Wei Sun

    2017-06-01

    Full Text Available Dioscorea contains critically important species which can be used as staple foods or sources of bioactive substances, including Dioscorea nipponica, which has been used to develop highly successful drugs to treat cardiovascular disease. Its major active ingredients are thought to be sterol compounds such as diosgenin, which has been called “medicinal gold” because of its valuable properties. However, reliance on naturally growing plants as a production system limits the potential use of D. nipponica, raising interest in engineering metabolic pathways to enhance the production of secondary metabolites. However, the biosynthetic pathway of diosgenin is still poorly understood, and D. nipponica is poorly characterized at a molecular level, hindering in-depth investigation. In the present work, the RNAs from five organs and seven methyl jasmonate treated D. nipponica rhizomes were sequenced using the Illumina high-throughput sequencing platform, yielding 52 gigabases of data, which were pooled and assembled into a reference transcriptome. Four hundred and eighty two genes were found to be highly expressed in the rhizomes, and these genes are mainly involved in stress response and transcriptional regulation. Based on their expression patterns, 36 genes were selected for further investigation as candidate genes involved in dioscin biosynthesis. Constructing co-expression networks based on significant changes in gene expression revealed 15 gene modules. Of these, four modules with properties correlating to dioscin regulation and biosynthesis, consisting of 4,665 genes in total, were selected for further functional investigation. These results improve our understanding of dioscin biosynthesis in this important medicinal plant and will help guide more intensive investigations.

  13. Emergence of scale-free characteristics in socio-ecological systems with bounded rationality

    OpenAIRE

    Kasthurirathna, Dharshana; Piraveenan, Mahendra

    2015-01-01

    Socio?ecological systems are increasingly modelled by games played on complex networks. While the concept of Nash equilibrium assumes perfect rationality, in reality players display heterogeneous bounded rationality. Here we present a topological model of bounded rationality in socio-ecological systems, using the rationality parameter of the Quantal Response Equilibrium. We argue that system rationality could be measured by the average Kullback?-Leibler divergence between Nash and Quantal Res...

  14. Global Integration of the Hot-State Brain Network of Appetite Predicts Short Term Weight Loss in Older Adult

    Directory of Open Access Journals (Sweden)

    Brielle M Paolini

    2015-05-01

    Full Text Available Obesity is a public health crisis in North America. While lifestyle interventions for weight loss (WL remain popular, the rate of success is highly variable. Clearly, self-regulation of eating behavior is a challenge and patterns of activity across the brain may be an important determinant of success. The current study prospectively examined whether integration across the Hot-State Brain Network of Appetite (HBN-A predicts WL after 6-months of treatment in older adults. Our metric for network integration was global efficiency (GE. The present work is a sub-study (n = 56 of an ongoing randomized clinical trial involving WL. Imaging involved a baseline food-cue visualization functional MRI (fMRI scan following an overnight fast. Using graph theory to build functional brain networks, we demonstrated that regions of the HBN-A (insula, anterior cingulate cortex (ACC, superior temporal pole, amygdala and the parahippocampal gyrus were highly integrated as evidenced by the results of a principal component analysis. After accounting for known correlates of WL (baseline weight, age, sex, and self-regulatory efficacy and treatment condition, which together contributed 36.9% of the variance in WL, greater GE in the HBN-A was associated with an additional 19% of the variance. The ACC of the HBN-A was the primary driver of this effect, accounting for 14.5% of the variance in WL when entered in a stepwise regression following the covariates, p = 0.0001. The HBN-A is comprised of limbic regions important in the processing of emotions and visceral sensations and the ACC is key for translating such processing into behavioral consequences. The improved integration of these regions may enhance awareness of body and emotional states leading to more successful self-regulation and to greater WL. This is the first study among older adults to prospectively demonstrate that, following an overnight fast, GE of the HBN-A during a food visualization task is predictive of

  15. Free-flight odor tracking in Drosophila is consistent with an optimal intermittent scale-free search.

    Directory of Open Access Journals (Sweden)

    Andy M Reynolds

    2007-04-01

    Full Text Available During their trajectories in still air, fruit flies (Drosophila melanogaster explore their landscape using a series of straight flight paths punctuated by rapid 90 degrees body-saccades [1]. Some saccades are triggered by visual expansion associated with collision avoidance. Yet many saccades are not triggered by visual cues, but rather appear spontaneously. Our analysis reveals that the control of these visually independent saccades and the flight intervals between them constitute an optimal scale-free active searching strategy. Two characteristics of mathematical optimality that are apparent during free-flight in Drosophila are inter-saccade interval lengths distributed according to an inverse square law, which does not vary across landscape scale, and 90 degrees saccade angles, which increase the likelihood that territory will be revisited and thereby reduce the likelihood that near-by targets will be missed. We also show that searching is intermittent, such that active searching phases randomly alternate with relocation phases. Behaviorally, this intermittency is reflected in frequently occurring short, slow speed inter-saccade intervals randomly alternating with rarer, longer, faster inter-saccade intervals. Searching patterns that scale similarly across orders of magnitude of length (i.e., scale-free have been revealed in animals as diverse as microzooplankton, bumblebees, albatrosses, and spider monkeys, but these do not appear to be optimised with respect to turning angle, whereas Drosophila free-flight search does. Also, intermittent searching patterns, such as those reported here for Drosophila, have been observed in foragers such as planktivorous fish and ground foraging birds. Our results with freely flying Drosophila may constitute the first reported example of searching behaviour that is both scale-free and intermittent.

  16. Information communication on complex networks

    International Nuclear Information System (INIS)

    Igarashi, Akito; Kawamoto, Hiroki; Maruyama, Takahiro; Morioka, Atsushi; Naganuma, Yuki

    2013-01-01

    Since communication networks such as the Internet, which is regarded as a complex network, have recently become a huge scale and a lot of data pass through them, the improvement of packet routing strategies for transport is one of the most significant themes in the study of computer networks. It is especially important to find routing strategies which can bear as many traffic as possible without congestion in complex networks. First, using neural networks, we introduce a strategy for packet routing on complex networks, where path lengths and queue lengths in nodes are taken into account within a framework of statistical physics. Secondly, instead of using shortest paths, we propose efficient paths which avoid hubs, nodes with a great many degrees, on scale-free networks with a weight of each node. We improve the heuristic algorithm proposed by Danila et. al. which optimizes step by step routing properties on congestion by using the information of betweenness, the probability of paths passing through a node in all optimal paths which are defined according to a rule, and mitigates the congestion. We confirm the new heuristic algorithm which balances traffic on networks by achieving minimization of the maximum betweenness in much smaller number of iteration steps. Finally, We model virus spreading and data transfer on peer-to-peer (P2P) networks. Using mean-field approximation, we obtain an analytical formulation and emulate virus spreading on the network and compare the results with those of simulation. Moreover, we investigate the mitigation of information traffic congestion in the P2P networks.

  17. Maximum entropy networks are more controllable than preferential attachment networks

    International Nuclear Information System (INIS)

    Hou, Lvlin; Small, Michael; Lao, Songyang

    2014-01-01

    A maximum entropy (ME) method to generate typical scale-free networks has been recently introduced. We investigate the controllability of ME networks and Barabási–Albert preferential attachment networks. Our experimental results show that ME networks are significantly more easily controlled than BA networks of the same size and the same degree distribution. Moreover, the control profiles are used to provide insight into control properties of both classes of network. We identify and classify the driver nodes and analyze the connectivity of their neighbors. We find that driver nodes in ME networks have fewer mutual neighbors and that their neighbors have lower average degree. We conclude that the properties of the neighbors of driver node sensitively affect the network controllability. Hence, subtle and important structural differences exist between BA networks and typical scale-free networks of the same degree distribution. - Highlights: • The controllability of maximum entropy (ME) and Barabási–Albert (BA) networks is investigated. • ME networks are significantly more easily controlled than BA networks of the same degree distribution. • The properties of the neighbors of driver node sensitively affect the network controllability. • Subtle and important structural differences exist between BA networks and typical scale-free networks

  18. Improving the Communication Pattern in Matrix-Vector Operations for Large Scale-Free Graphs by Disaggregation

    Energy Technology Data Exchange (ETDEWEB)

    Kuhlemann, Verena [Emory Univ., Atlanta, GA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2013-10-28

    Matrix-vector multiplication is the key operation in any Krylov-subspace iteration method. We are interested in Krylov methods applied to problems associated with the graph Laplacian arising from large scale-free graphs. Furthermore, computations with graphs of this type on parallel distributed-memory computers are challenging. This is due to the fact that scale-free graphs have a degree distribution that follows a power law, and currently available graph partitioners are not efficient for such an irregular degree distribution. The lack of a good partitioning leads to excessive interprocessor communication requirements during every matrix-vector product. Here, we present an approach to alleviate this problem based on embedding the original irregular graph into a more regular one by disaggregating (splitting up) vertices in the original graph. The matrix-vector operations for the original graph are performed via a factored triple matrix-vector product involving the embedding graph. And even though the latter graph is larger, we are able to decrease the communication requirements considerably and improve the performance of the matrix-vector product.

  19. Prediction of Excess Weight Loss after Laparoscopic Roux-en-Y Gastric Bypass: Data from an Artificial Neural Network

    Science.gov (United States)

    Wise, Eric S.; Hocking, Kyle M.; Kavic, Stephen M.

    2015-01-01

    Introduction Laparoscopic Roux-en-Y Gastric Bypass (LRYGB) has become the gold standard for surgical weight loss. The success of LRYGB may be measured by excess body-mass index loss (%EBMIL) over 25 kg/m2, which is partially determined by multiple patient factors. In this study, artificial neural network (ANN) modeling was used to derive a reasonable estimate of expected postoperative weight loss using only known preoperative patient variables. Additionally, ANN modeling allowed for the discriminant prediction of achievement of benchmark 50% EBMIL at one year postoperatively. Methods Six-hundred and forty-seven LRYGB included patients were retrospectively reviewed for preoperative factors independently associated with EBMIL at 180 and 365 days postoperatively (EBMIL180 and EBMIL365, respectively). Previously validated factors were selectively analyzed, including age; race; gender; preoperative BMI (BMI0); hemoglobin; and diagnoses of hypertension (HTN), diabetes mellitus (DM), and depression or anxiety disorder. Variables significant upon multivariate analysis (P<.05) were modeled by “traditional” multiple linear regression and an ANN, to predict %EBMIL180 and %EBMIL365. Results The mean EBMIL180 and EBMIL365 were 56.4%±16.5% and 73.5%±21.5%, corresponding to total body weight losses of 25.7%±5.9% and 33.6%±8.0%, respectively. Upon multivariate analysis, independent factors associated with EBMIL180 included black race (B=−6.3%, P<.001), BMI0 (B=−1.1%/unit BMI, P<.001) and DM (B=−3.2%, P<.004). For EBMIL365, independently associated factors were female gender (B=6.4%, P<.001), black race (B=−6.7%, P<.001), BMI0 (B=−1.2%/unit BMI, P<.001), HTN (B=−3.7%, P=.03) and DM (B=−6.0%, P<.001). Pearson r2 values for the multiple linear regression and ANN models were .38 (EBMIL180) and .35 (EBMIL365), and .42 (EBMIL180) and .38 (EBMIL365), respectively. ANN-prediction of benchmark 50% EBMIL at 365 days generated an area under the curve of 0.78±0.03 in

  20. Fully convolutional networks (FCNs)-based segmentation method for colorectal tumors on T2-weighted magnetic resonance images.

    Science.gov (United States)

    Jian, Junming; Xiong, Fei; Xia, Wei; Zhang, Rui; Gu, Jinhui; Wu, Xiaodong; Meng, Xiaochun; Gao, Xin

    2018-06-01

    Segmentation of colorectal tumors is the basis of preoperative prediction, staging, and therapeutic response evaluation. Due to the blurred boundary between lesions and normal colorectal tissue, it is hard to realize accurate segmentation. Routinely manual or semi-manual segmentation methods are extremely tedious, time-consuming, and highly operator-dependent. In the framework of FCNs, a segmentation method for colorectal tumor was presented. Normalization was applied to reduce the differences among images. Borrowing from transfer learning, VGG-16 was employed to extract features from normalized images. We conducted five side-output blocks from the last convolutional layer of each block of VGG-16 along the network, these side-output blocks can deep dive multiscale features, and produced corresponding predictions. Finally, all of the predictions from side-output blocks were fused to determine the final boundaries of the tumors. A quantitative comparison of 2772 colorectal tumor manual segmentation results from T2-weighted magnetic resonance images shows that the average Dice similarity coefficient, positive predictive value, specificity, sensitivity, Hammoude distance, and Hausdorff distance were 83.56, 82.67, 96.75, 87.85%, 0.2694, and 8.20, respectively. The proposed method is superior to U-net in colorectal tumor segmentation (P colorectal tumor segmentation (P > 0.05). The results indicate that the introduction of FCNs contributed to accurate segmentation of colorectal tumors. This method has the potential to replace the present time-consuming and nonreproducible manual segmentation method.

  1. Detection of Dendritic Spines Using Wavelet-Based Conditional Symmetric Analysis and Regularized Morphological Shared-Weight Neural Networks

    Directory of Open Access Journals (Sweden)

    Shuihua Wang

    2015-01-01

    Full Text Available Identification and detection of dendritic spines in neuron images are of high interest in diagnosis and treatment of neurological and psychiatric disorders (e.g., Alzheimer’s disease, Parkinson’s diseases, and autism. In this paper, we have proposed a novel automatic approach using wavelet-based conditional symmetric analysis and regularized morphological shared-weight neural networks (RMSNN for dendritic spine identification involving the following steps: backbone extraction, localization of dendritic spines, and classification. First, a new algorithm based on wavelet transform and conditional symmetric analysis has been developed to extract backbone and locate the dendrite boundary. Then, the RMSNN has been proposed to classify the spines into three predefined categories (mushroom, thin, and stubby. We have compared our proposed approach against the existing methods. The experimental result demonstrates that the proposed approach can accurately locate the dendrite and accurately classify the spines into three categories with the accuracy of 99.1% for “mushroom” spines, 97.6% for “stubby” spines, and 98.6% for “thin” spines.

  2. Squids old and young: Scale-free design for a simple billboard

    Science.gov (United States)

    Packard, Andrew

    2011-03-01

    Squids employ a large range of brightness-contrast spatial frequencies in their camouflage and signalling displays. The 'billboard' of coloured elements ('spots'=chromatophore organs) in the skin is built autopoietically-probably by lateral inhibitory processes-and enlarges as much as 10,000-fold during development. The resulting two-dimensional array is a fractal-like colour/size hierarchy lying in several layers of a multilayered network. Dynamic control of the array by muscles and nerves produces patterns that recall 'half-tone' processing (cf. ink-jet printer). In the more sophisticated (loliginid) squids, patterns also combine 'continuous tones' (cf. dye-sublimation printer). Physiologists and engineers can exploit the natural colour-coding of the integument to understand nerve and muscle system dynamics, examined here at the level of the ensemble. Integrative functions of the whole (H) are analysed in terms of the power spectrum within and between ensembles and of spontaneous waves travelling through the billboard. Video material may be obtained from the author at the above address.

  3. Exploring network operations for data and information networks

    Science.gov (United States)

    Yao, Bing; Su, Jing; Ma, Fei; Wang, Xiaomin; Zhao, Xiyang; Yao, Ming

    2017-01-01

    Barabási and Albert, in 1999, formulated scale-free models based on some real networks: World-Wide Web, Internet, metabolic and protein networks, language or sexual networks. Scale-free networks not only appear around us, but also have high qualities in the world. As known, high quality information networks can transfer feasibly and efficiently data, clearly, their topological structures are very important for data safety. We build up network operations for constructing large scale of dynamic networks from smaller scale of network models having good property and high quality. We focus on the simplest operators to formulate complex operations, and are interesting on the closeness of operations to desired network properties.

  4. Reduced integration and differentiation of the imitation network in autism: A combined functional connectivity magnetic resonance imaging and diffusion-weighted imaging study.

    Science.gov (United States)

    Fishman, Inna; Datko, Michael; Cabrera, Yuliana; Carper, Ruth A; Müller, Ralph-Axel

    2015-12-01

    Converging evidence indicates that brain abnormalities in autism spectrum disorder (ASD) involve atypical network connectivity, but few studies have integrated functional with structural connectivity measures. This multimodal investigation examined functional and structural connectivity of the imitation network in children and adolescents with ASD, and its links with clinical symptoms. Resting state functional magnetic resonance imaging and diffusion-weighted imaging were performed in 35 participants with ASD and 35 typically developing controls, aged 8 to 17 years, matched for age, gender, intelligence quotient, and head motion. Within-network analyses revealed overall reduced functional connectivity (FC) between distributed imitation regions in the ASD group. Whole brain analyses showed that underconnectivity in ASD occurred exclusively in regions belonging to the imitation network, whereas overconnectivity was observed between imitation nodes and extraneous regions. Structurally, reduced fractional anisotropy and increased mean diffusivity were found in white matter tracts directly connecting key imitation regions with atypical FC in ASD. These differences in microstructural organization of white matter correlated with weaker FC and greater ASD symptomatology. Findings demonstrate atypical connectivity of the brain network supporting imitation in ASD, characterized by a highly specific pattern. This pattern of underconnectivity within, but overconnectivity outside the functional network is in contrast with typical development and suggests reduced network integration and differentiation in ASD. Our findings also indicate that atypical connectivity of the imitation network may contribute to ASD clinical symptoms, highlighting the role of this fundamental social cognition ability in the pathophysiology of ASD. © 2015 American Neurological Association.

  5. Unified Model for Generation Complex Networks with Utility Preferential Attachment

    International Nuclear Information System (INIS)

    Wu Jianjun; Gao Ziyou; Sun Huijun

    2006-01-01

    In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics of this new network are given.

  6. Scale-free memory model for multiagent reinforcement learning. Mean field approximation and rock-paper-scissors dynamics

    Science.gov (United States)

    Lubashevsky, I.; Kanemoto, S.

    2010-07-01

    A continuous time model for multiagent systems governed by reinforcement learning with scale-free memory is developed. The agents are assumed to act independently of one another in optimizing their choice of possible actions via trial-and-error search. To gain awareness about the action value the agents accumulate in their memory the rewards obtained from taking a specific action at each moment of time. The contribution of the rewards in the past to the agent current perception of action value is described by an integral operator with a power-law kernel. Finally a fractional differential equation governing the system dynamics is obtained. The agents are considered to interact with one another implicitly via the reward of one agent depending on the choice of the other agents. The pairwise interaction model is adopted to describe this effect. As a specific example of systems with non-transitive interactions, a two agent and three agent systems of the rock-paper-scissors type are analyzed in detail, including the stability analysis and numerical simulation. Scale-free memory is demonstrated to cause complex dynamics of the systems at hand. In particular, it is shown that there can be simultaneously two modes of the system instability undergoing subcritical and supercritical bifurcation, with the latter one exhibiting anomalous oscillations with the amplitude and period growing with time. Besides, the instability onset via this supercritical mode may be regarded as “altruism self-organization”. For the three agent system the instability dynamics is found to be rather irregular and can be composed of alternate fragments of oscillations different in their properties.

  7. GXNOR-Net: Training deep neural networks with ternary weights and activations without full-precision memory under a unified discretization framework.

    Science.gov (United States)

    Deng, Lei; Jiao, Peng; Pei, Jing; Wu, Zhenzhi; Li, Guoqi

    2018-04-01

    Although deep neural networks (DNNs) are being a revolutionary power to open up the AI era, the notoriously huge hardware overhead has challenged their applications. Recently, several binary and ternary networks, in which the costly multiply-accumulate operations can be replaced by accumulations or even binary logic operations, make the on-chip training of DNNs quite promising. Therefore there is a pressing need to build an architecture that could subsume these networks under a unified framework that achieves both higher performance and less overhead. To this end, two fundamental issues are yet to be addressed. The first one is how to implement the back propagation when neuronal activations are discrete. The second one is how to remove the full-precision hidden weights in the training phase to break the bottlenecks of memory/computation consumption. To address the first issue, we present a multi-step neuronal activation discretization method and a derivative approximation technique that enable the implementing the back propagation algorithm on discrete DNNs. While for the second issue, we propose a discrete state transition (DST) methodology to constrain the weights in a discrete space without saving the hidden weights. Through this way, we build a unified framework that subsumes the binary or ternary networks as its special cases, and under which a heuristic algorithm is provided at the website https://github.com/AcrossV/Gated-XNOR. More particularly, we find that when both the weights and activations become ternary values, the DNNs can be reduced to sparse binary networks, termed as gated XNOR networks (GXNOR-Nets) since only the event of non-zero weight and non-zero activation enables the control gate to start the XNOR logic operations in the original binary networks. This promises the event-driven hardware design for efficient mobile intelligence. We achieve advanced performance compared with state-of-the-art algorithms. Furthermore, the computational sparsity

  8. A novel grooming algorithm with the adaptive weight and load balancing for dynamic holding-time-aware traffic in optical networks

    Science.gov (United States)

    Xu, Zhanqi; Huang, Jiangjiang; Zhou, Zhiqiang; Ding, Zhe; Ma, Tao; Wang, Junping

    2013-10-01

    To maximize the resource utilization of optical networks, the dynamic traffic grooming, which could efficiently multiplex many low-speed services arriving dynamically onto high-capacity optical channels, has been studied extensively and used widely. However, the link weights in the existing research works can be improved since they do not adapt to the network status and load well. By exploiting the information on the holding times of the preexisting and new lightpaths, and the requested bandwidth of a user service, this paper proposes a grooming algorithm using Adaptively Weighted Links for Holding-Time-Aware (HTA) (abbreviated as AWL-HTA) traffic, especially in the setup process of new lightpath(s). Therefore, the proposed algorithm can not only establish a lightpath that uses network resource efficiently, but also achieve load balancing. In this paper, the key issues on the link weight assignment and procedure within the AWL-HTA are addressed in detail. Comprehensive simulation and experimental results show that the proposed algorithm has a much lower blocking ratio and latency than other existing algorithms.

  9. Chaos control of the brushless direct current motor using adaptive dynamic surface control based on neural network with the minimum weights

    International Nuclear Information System (INIS)

    Luo, Shaohua; Wu, Songli; Gao, Ruizhen

    2015-01-01

    This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in the closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation

  10. Chaos control of the brushless direct current motor using adaptive dynamic surface control based on neural network with the minimum weights.

    Science.gov (United States)

    Luo, Shaohua; Wu, Songli; Gao, Ruizhen

    2015-07-01

    This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in the closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation.

  11. Co-evolution of the brand effect and competitiveness in evolving networks

    International Nuclear Information System (INIS)

    Guo Jin-Li

    2014-01-01

    The principle that ‘the brand effect is attractive’ underlies the preferential attachment. Here we show that the brand effect is just one dimension of attractiveness. Another dimension is competitiveness. We firstly introduce a general framework that allows us to investigate the competitive aspect of real networks, instead of simply preferring popular nodes. Our model accurately describes the evolution of social and technological networks. The phenomenon that more competitive nodes become richer can help us to understand the evolution of many competitive systems in nature and society. In general, the paper provides an explicit analytical expression of degree distributions of the network. In particular, the model yields a nontrivial time evolution of nodes' properties and the scale-free behavior with exponents depending on the microscopic parameters characterizing the competition rules. Secondly, through theoretical analyses and numerical simulations, we reveal that our model has not only the universality for the homogeneous weighted network, but also the character for the heterogeneous weighted network. Thirdly, we also develop a model based on the profit-driven mechanism. It can better describe the observed phenomenon in enterprise cooperation networks. We show that the standard preferential attachment, the growing random graph, the initial attractiveness model, the fitness model, and weighted networks can all be seen as degenerate cases of our model. (general)

  12. Co-evolution of the brand effect and competitiveness in evolving networks

    Science.gov (United States)

    Guo, Jin-Li

    2014-07-01

    The principle that ‘the brand effect is attractive’ underlies the preferential attachment. Here we show that the brand effect is just one dimension of attractiveness. Another dimension is competitiveness. We firstly introduce a general framework that allows us to investigate the competitive aspect of real networks, instead of simply preferring popular nodes. Our model accurately describes the evolution of social and technological networks. The phenomenon that more competitive nodes become richer can help us to understand the evolution of many competitive systems in nature and society. In general, the paper provides an explicit analytical expression of degree distributions of the network. In particular, the model yields a nontrivial time evolution of nodes' properties and the scale-free behavior with exponents depending on the microscopic parameters characterizing the competition rules. Secondly, through theoretical analyses and numerical simulations, we reveal that our model has not only the universality for the homogeneous weighted network, but also the character for the heterogeneous weighted network. Thirdly, we also develop a model based on the profit-driven mechanism. It can better describe the observed phenomenon in enterprise cooperation networks. We show that the standard preferential attachment, the growing random graph, the initial attractiveness model, the fitness model, and weighted networks can all be seen as degenerate cases of our model.

  13. Higher order moments of the matter distribution in scale-free cosmological simulations with large dynamic range

    Science.gov (United States)

    Lucchin, Francesco; Matarrese, Sabino; Melott, Adrian L.; Moscardini, Lauro

    1994-01-01

    We calculate reduced moments (xi bar)(sub q) of the matter density fluctuations, up to order q = 5, from counts in cells produced by particle-mesh numerical simulations with scale-free Gaussian initial conditions. We use power-law spectra P(k) proportional to k(exp n) with indices n = -3, -2, -1, 0, 1. Due to the supposed absence of characteristic times or scales in our models, all quantities are expected to depend on a single scaling variable. For each model, the moments at all times can be expressed in terms of the variance (xi bar)(sub 2), alone. We look for agreement with the hierarchical scaling ansatz, according to which ((xi bar)(sub q)) proportional to ((xi bar)(sub 2))(exp (q - 1)). For n less than or equal to -2 models, we find strong deviations from the hierarchy, which are mostly due to the presence of boundary problems in the simulations. A small, residual signal of deviation from the hierarchical scaling is however also found in n greater than or equal to -1 models. The wide range of spectra considered and the large dynamic range, with careful checks of scaling and shot-noise effects, allows us to reliably detect evolution away from the perturbation theory result.

  14. The analysis of HIV/AIDS drug-resistant on networks

    Science.gov (United States)

    Liu, Maoxing

    2014-01-01

    In this paper, we present an Human Immunodeficiency Virus (HIV)/Acquired Immune Deficiency Syndrome (AIDS) drug-resistant model using an ordinary differential equation (ODE) model on scale-free networks. We derive the threshold for the epidemic to be zero in infinite scale-free network. We also prove the stability of disease-free equilibrium (DFE) and persistence of HIV/AIDS infection. The effects of two immunization schemes, including proportional scheme and targeted vaccination, are studied and compared. We find that targeted strategy compare favorably to a proportional condom using has prominent effect to control HIV/AIDS spread on scale-free networks.

  15. A neighbourhood evolving network model

    International Nuclear Information System (INIS)

    Cao, Y.J.; Wang, G.Z.; Jiang, Q.Y.; Han, Z.X.

    2006-01-01

    Many social, technological, biological and economical systems are best described by evolved network models. In this short Letter, we propose and study a new evolving network model. The model is based on the new concept of neighbourhood connectivity, which exists in many physical complex networks. The statistical properties and dynamics of the proposed model is analytically studied and compared with those of Barabasi-Albert scale-free model. Numerical simulations indicate that this network model yields a transition between power-law and exponential scaling, while the Barabasi-Albert scale-free model is only one of its special (limiting) cases. Particularly, this model can be used to enhance the evolving mechanism of complex networks in the real world, such as some social networks development

  16. Persistent homology of complex networks

    International Nuclear Information System (INIS)

    Horak, Danijela; Maletić, Slobodan; Rajković, Milan

    2009-01-01

    Long-lived topological features are distinguished from short-lived ones (considered as topological noise) in simplicial complexes constructed from complex networks. A new topological invariant, persistent homology, is determined and presented as a parameterized version of a Betti number. Complex networks with distinct degree distributions exhibit distinct persistent topological features. Persistent topological attributes, shown to be related to the robust quality of networks, also reflect the deficiency in certain connectivity properties of networks. Random networks, networks with exponential connectivity distribution and scale-free networks were considered for homological persistency analysis

  17. Percolation of interdependent network of networks

    International Nuclear Information System (INIS)

    Havlin, Shlomo; Stanley, H. Eugene; Bashan, Amir; Gao, Jianxi; Kenett, Dror Y.

    2015-01-01

    Complex networks appear in almost every aspect of science and technology. Previous work in network theory has focused primarily on analyzing single networks that do not interact with other networks, despite the fact that many real-world networks interact with and depend on each other. Very recently an analytical framework for studying the percolation properties of interacting networks has been introduced. Here we review the analytical framework and the results for percolation laws for a Network Of Networks (NONs) formed by n interdependent random networks. The percolation properties of a network of networks differ greatly from those of single isolated networks. In particular, because the constituent networks of a NON are connected by node dependencies, a NON is subject to cascading failure. When there is strong interdependent coupling between networks, the percolation transition is discontinuous (first-order) phase transition, unlike the well-known continuous second-order transition in single isolated networks. Moreover, although networks with broader degree distributions, e.g., scale-free networks, are more robust when analyzed as single networks, they become more vulnerable in a NON. We also review the effect of space embedding on network vulnerability. It is shown that for spatially embedded networks any finite fraction of dependency nodes will lead to abrupt transition

  18. Epidemic dynamics and endemic states in complex networks

    Science.gov (United States)

    Pastor-Satorras, Romualdo; Vespignani, Alessandro

    2001-06-01

    We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below that the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks.

  19. Epidemic dynamics and endemic states in complex networks

    International Nuclear Information System (INIS)

    Pastor-Satorras, Romualdo; Vespignani, Alessandro

    2001-01-01

    We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below that the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks

  20. Improve 3D laser scanner measurements accuracy using a FFBP neural network with Widrow-Hoff weight/bias learning function

    Science.gov (United States)

    Rodríguez-Quiñonez, J. C.; Sergiyenko, O.; Hernandez-Balbuena, D.; Rivas-Lopez, M.; Flores-Fuentes, W.; Basaca-Preciado, L. C.

    2014-12-01

    Many laser scanners depend on their mechanical construction to guarantee their measurements accuracy, however, the current computational technologies allow us to improve these measurements by mathematical methods implemented in neural networks. In this article we are going to introduce the current laser scanner technologies, give a description of our 3D laser scanner and adjust their measurement error by a previously trained feed forward back propagation (FFBP) neural network with a Widrow-Hoff weight/bias learning function. A comparative analysis with other learning functions such as the Kohonen algorithm and gradient descendent with momentum algorithm is presented. Finally, computational simulations are conducted to verify the performance and method uncertainty in the proposed system.

  1. Routing strategies in traffic network and phase transition in network ...

    Indian Academy of Sciences (India)

    The dynamics of information traffic over scale-free networks has been investigated systematically. A series of routing strategies of data packets have been proposed, including the local routing strategy, the next-nearest-neighbour routing strategy, and the mixed routing strategy based on local static and dynamic information.

  2. Effects of Glucagon-Like Peptide-1 Receptor Agonists on Weight Loss in Patients with Type 2 Diabetes: A Systematic Review and Network Meta-Analysis

    Directory of Open Access Journals (Sweden)

    Feng Sun

    2015-01-01

    Full Text Available To evaluate the effectiveness of glucagon-like peptide-1 receptor agonists (GLP-1 RAs on weight reduction in patients with Type 2 diabetes mellitus (Type 2 DM, a network meta-analysis was conducted. MEDLINE, EMBASE, Cochrane Library, and ClinicalTrials.gov were searched from 1950 to October 2013. Randomized controlled trials (RCTs involving GLP-1 RAs were included if they provided information on body weight. A total of 51 RCTs were included and 17521 participants were enrolled. The mean duration of 51 RCTs was 31 weeks. Exenatide 10 μg twice daily (EX10BID reduced weight compared with exenatide 5 μg twice daily (EX5BID, liraglutide 0.6 mg once daily (LIR0.6QD, liraglutide—1.2 mg once daily (LIR1.2QD, and placebo treatment, with mean differences of −1.07 kg (95% CI: −2.41, −0.02, −2.38 kg (95% CI: −3.71, −1.06, −1.62 kg (95% CI: −2.79, −0.43, and −1.92 kg (95% CI: −2.61, −1.24, respectively. Reductions of weight treated with liraglutide—1.8 mg once daily (LIR1.8QD reach statistical significance (−1.43 kg (95% CI: −2.73, −0.15 versus LIR1.2QD and (−0.98 kg (95% CI: −1.94, −0.02 versus placebo. Network meta-analysis found that EX10BID, LIR1.8QD, and EX2QW obtained a higher proportion of patients with weight loss than other traditional hypoglycemic agents. Our results suggest GLP-1 RAs are promising candidates for weight control in comparison with traditional hypoglycemic drugs, and EX10BID, LIR1.8QD, and EX2QW rank the top three drugs.

  3. Removal of selected emerging PPCP compounds using greater duckweed (Spirodela polyrhiza) based lab-scale free water constructed wetland.

    Science.gov (United States)

    Li, Jianan; Zhou, Qizhi; Campos, Luiza C

    2017-12-01

    Greater duckweed (Spirodela polyrhiza) based lab-scale free water constructed wetland (CW) was employed for removing four emerging pharmaceuticals and personal care products (PPCPs) (i.e. DEET, paracetamol, caffeine and triclosan). Orthogonal design was used to test the effect of light intensity, aeration, E.coli abundance and plant biomass on the target compounds. Synthetic wastewater contaminated with the target compounds at concentration of 25 μg/L was prepared, and both batch and continuous flow experiments were conducted. Up to 100% removals were achieved for paracetamol (PAR), caffeine (CAF) and tricolsan (TCS) while the highest removal for DEET was 32.2% in batch tests. Based on orthogonal Duncan analysis, high light intensity (240 μmolmm -2 s -1 ), full aeration, high plant biomass (1.00 kg/m 2 ) and high E.coli abundance (1.0 × 10 6  CFU/100 mL) favoured elimination of the PPCPs. Batch verification test achieved removals of 17.1%, 98.8%, 96.4% and 95.4% for DEET, PAR, CAF and TCS respectively. Continuous flow tests with CW only and CW followed by stabilization tank (CW-ST) were carried out. Final removals of the PPCP contaminants were 32.6%, 97.7%, 98.0% and 100% for DEET, PAR, CAF and TCS, respectively, by CW system alone, while 43.3%, 97.5%, 98.2% and 100%, respectively, were achieved by CW-ST system. By adding the ST tank, PPCP concentrations decreased significantly faster (p < 0.05) compared with continuous flow CW alone. In addition, after removing aerators during continuous flow CW experiments, the treatment systems presented good stability for the PPCP removals. CW-ST showed better chemical oxygen demand (COD) and total organic carbon (TOC) removals (89.3%, 91.2%, respectively) than CW only (79.4%, 85.2%, respectively). However, poor DEET removal (<50%) and high E.coli abundance (up to 1.7 log increase) in the final treated water indicated further treatment processes may be required. Statistical analysis showed significant correlations

  4. Seed maturation associated transcriptional programs and regulatory networks underlying genotypic difference in seed dormancy and size/weight in wheat (Triticum aestivum L.).

    Science.gov (United States)

    Yamasaki, Yuji; Gao, Feng; Jordan, Mark C; Ayele, Belay T

    2017-09-16

    Maturation forms one of the critical seed developmental phases and it is characterized mainly by programmed cell death, dormancy and desiccation, however, the transcriptional programs and regulatory networks underlying acquisition of dormancy and deposition of storage reserves during the maturation phase of seed development are poorly understood in wheat. The present study performed comparative spatiotemporal transcriptomic analysis of seed maturation in two wheat genotypes with contrasting seed weight/size and dormancy phenotype. The embryo and endosperm tissues of maturing seeds appeared to exhibit genotype-specific temporal shifts in gene expression profile that might contribute to the seed phenotypic variations. Functional annotations of gene clusters suggest that the two tissues exhibit distinct but genotypically overlapping molecular functions. Motif enrichment predicts genotypically distinct abscisic acid (ABA) and gibberellin (GA) regulated transcriptional networks contribute to the contrasting seed weight/size and dormancy phenotypes between the two genotypes. While other ABA responsive element (ABRE) motifs are enriched in both genotypes, the prevalence of G-box-like motif specifically in tissues of the dormant genotype suggests distinct ABA mediated transcriptional mechanisms control the establishment of dormancy during seed maturation. In agreement with this, the bZIP transcription factors that co-express with ABRE enriched embryonic genes differ with genotype. The enrichment of SITEIIATCYTC motif specifically in embryo clusters of maturing seeds irrespective of genotype predicts a tissue specific role for the respective TCP transcription factors with no or minimal contribution to the variations in seed dormancy. The results of this study advance our understanding of the seed maturation associated molecular mechanisms underlying variation in dormancy and weight/size in wheat seeds, which is a critical step towards the designing of molecular strategies

  5. The impact of telenursing consultation by using the social networks to promote the self- efficacy and weight control in patients treating with hemodialysis

    Directory of Open Access Journals (Sweden)

    Marzieh Sadat Hosseini

    2016-12-01

    Full Text Available Hemodialysis as the most common renal replacement therapy alone cannot ensure the health and survival of the patient's life and along with it, training and consulting about self-care and adherence is one of the fundamental pillars of treatment. This study was conducted to determine the impact of telenursing consultation by using networks to promote the self-efficacy and weight control in patients treating with hemodialysis. This study was a clinical trial for two groups and had a pre-test and two post-test. 52 patients under treatment by hemodialysis were divided randomly into two groups of experimental and control groups. The experimental group received consultations by using the telegram software and the control group received usual nursing care for a month. The data were collected by the weight control of the patients before and after the sessions of hemodialysis and general self-efficacy questionnaire and were analyzed by SPSS software version 20, and using descriptive statistics and analytical tests. The two groups did not have a significant statistically differences in demographic variables. The average rates of the self-efficacy after intervention in the experimental group was significantly more than the control group and also the average overweight after the intervention was significantly lower. telenursing consultation by using the social networks is effective on the improvement of self-efficacy and weight control in patients treating with hemodialysis and due to the shortage of nurses and their high volume of work it can be used as a new way for training.

  6. Dense power-law networks and simplicial complexes

    Science.gov (United States)

    Courtney, Owen T.; Bianconi, Ginestra

    2018-05-01

    There is increasing evidence that dense networks occur in on-line social networks, recommendation networks and in the brain. In addition to being dense, these networks are often also scale-free, i.e., their degree distributions follow P (k ) ∝k-γ with γ ∈(1 ,2 ] . Models of growing networks have been successfully employed to produce scale-free networks using preferential attachment, however these models can only produce sparse networks as the numbers of links and nodes being added at each time step is constant. Here we present a modeling framework which produces networks that are both dense and scale-free. The mechanism by which the networks grow in this model is based on the Pitman-Yor process. Variations on the model are able to produce undirected scale-free networks with exponent γ =2 or directed networks with power-law out-degree distribution with tunable exponent γ ∈(1 ,2 ) . We also extend the model to that of directed two-dimensional simplicial complexes. Simplicial complexes are generalization of networks that can encode the many body interactions between the parts of a complex system and as such are becoming increasingly popular to characterize different data sets ranging from social interacting systems to the brain. Our model produces dense directed simplicial complexes with power-law distribution of the generalized out-degrees of the nodes.

  7. Multifractal analysis of complex networks

    International Nuclear Information System (INIS)

    Wang Dan-Ling; Yu Zu-Guo; Anh V

    2012-01-01

    Complex networks have recently attracted much attention in diverse areas of science and technology. Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal dimensions. Multifractal analysis is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. In this paper, we introduce a new box-covering algorithm for multifractal analysis of complex networks. This algorithm is used to calculate the generalized fractal dimensions D q of some theoretical networks, namely scale-free networks, small world networks, and random networks, and one kind of real network, namely protein—protein interaction networks of different species. Our numerical results indicate the existence of multifractality in scale-free networks and protein—protein interaction networks, while the multifractal behavior is not clear-cut for small world networks and random networks. The possible variation of D q due to changes in the parameters of the theoretical network models is also discussed. (general)

  8. Fitness for synchronization of network motifs

    DEFF Research Database (Denmark)

    Vega, Y.M.; Vázquez-Prada, M.; Pacheco, A.F.

    2004-01-01

    We study the synchronization of Kuramoto's oscillators in small parts of networks known as motifs. We first report on the system dynamics for the case of a scale-free network and show the existence of a non-trivial critical point. We compute the probability that network motifs synchronize, and fi...... that the fitness for synchronization correlates well with motifs interconnectedness and structural complexity. Possible implications for present debates about network evolution in biological and other systems are discussed....

  9. What can we learn from the network approach in finance?

    Science.gov (United States)

    Janos, Kertesz

    2005-03-01

    Correlations between variations of stock prices reveal information about relationships between companies. Different methods of analysis have been applied to such data in order to uncover the taxonomy of the market. We use Mantegna's miminum spanning tree (MST) method for daily data in a dynamic way: By introducing a moving window we study the temporal changes in the structure of the network defined by this ``asset tree.'' The MST is scale free with a significantly changing exponent of the degree distribution for crash periods, which demonstrates the restructuring of the network due to the enhancement of correlations. This approach is compared to that based on what we call ``asset graphs:'' We start from an empty graph with no edges where the vertices correspond to stocks and then, one by one, we insert edges between the vertices according to the rank of their correlation strength. We study the properties of the creatred (weighted) networks, such as topologically different growth types, number and size of clusters and clustering coefficient. Furthermore, we define new tools like subgraph intensity and coherence to describe the role of the weights. We also investigate the time shifted cross correlation functions for high frequency data and find a characteristic time delay in many cases representing that some stocks lead the price changes while others follow them. These data can be used to construct a directed network of influence.

  10. Robustness of networks against propagating attacks under vaccination strategies

    International Nuclear Information System (INIS)

    Hasegawa, Takehisa; Masuda, Naoki

    2011-01-01

    We study the effect of vaccination on the robustness of networks against propagating attacks that obey the susceptible–infected–removed model. By extending the generating function formalism developed by Newman (2005 Phys. Rev. Lett. 95 108701), we analytically determine the robustness of networks that depends on the vaccination parameters. We consider the random defense where nodes are vaccinated randomly and the degree-based defense where hubs are preferentially vaccinated. We show that, when vaccines are inefficient, the random graph is more robust against propagating attacks than the scale-free network. When vaccines are relatively efficient, the scale-free network with the degree-based defense is more robust than the random graph with the random defense and the scale-free network with the random defense

  11. Use of social networking sites by parents of very low birth weight infants: experiences and the potential of a dedicated site.

    Science.gov (United States)

    Gabbert, Tatjana I; Metze, Boris; Bührer, Christoph; Garten, Lars

    2013-12-01

    The objective of this study was to study the experiences of parents of preterm infants who use social networking sites and the potential of such sites for gathering information and facilitating personal exchange. An anonymous self-reporting questionnaire was administered to parents of infants below 1,500 g birth weight born between January 1, 2009 and December 31, 2010 in two tertiary neonatal intensive care units. Of the 278 families who were sent a questionnaire, 141 responded; 53.6 % of respondents claimed to be presently members of online social networking sites. However, only 10.7 and 18.6 % used the Internet to exchange information about their infants during the NICU stay and after discharge, respectively. Most (64.0 %) responding parents considered that currently available commercial Internet sites inadequately met their need to exchange information as parents of preterm infants. Overall, 79.1 % of respondents reported that they would be interested in joining a native-language online networking site providing (1) general information on prematurity, (2) explanations of abbreviations commonly used in a hospital setting, and (3) details of common medical problems and the treatment thereof, including the availability of local therapists and follow-up services. Also, parents wanted to engage in personal exchange online not only with other parents but also with medical staff. The support of parents of hospitalized preterm infants by neonatal nurses and doctors could be extended by developing an expert-controlled, online networking site providing reliable and updated information and facilitating personal exchange among parents.

  12. Emergence of complex networks from diffusion on fractal lattices. A special case of the Sierpinski gasket and tetrahedron

    International Nuclear Information System (INIS)

    Chełminiak, Przemysław

    2012-01-01

    A new approach to the assemblage of complex networks displaying the scale-free architecture is proposed. While the growth and the preferential attachment of incoming nodes assure an emergence of such networks according to the Barabási–Albert model, it is argued here that the preferential linking condition needs not to be a principal rule. To assert this statement a simple computer model based on random walks on fractal lattices is introduced. It is shown that the model successfully reproduces the degree distributions, the ultra-small-worldness and the high clustering arising from the topology of scale-free networks. -- Highlights: ► A new mechanism of evolution for scale-free complex networks is proposed. ► The preferential attachment rule is not necessary to construct such networks. ► It is shown that they reveal some basic properties of classical scale-free nets.

  13. Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabasi-Albert trees

    Energy Technology Data Exchange (ETDEWEB)

    Hernandez-Bermejo, B. [Departamento de Fisica, Universidad Rey Juan Carlos, Escuela Superior de Ciencias Experimentales y Tecnologia, Edificio Departamental II, Calle Tulipan S/N, 28933-Mostoles-Madrid (Spain)], E-mail: benito.hernandez@urjc.es; Marco-Blanco, J. [Departamento de Fisica, Universidad Rey Juan Carlos, Escuela Superior de Ciencias Experimentales y Tecnologia, Edificio Departamental II, Calle Tulipan S/N, 28933-Mostoles-Madrid (Spain); Romance, M. [Departamento de Matematica Aplicada, Universidad Rey Juan Carlos, Escuela Superior de Ciencias Experimentales y Tecnologia, Edificio Departamental II, Calle Tulipan S/N, 28933-Mostoles-Madrid (Spain)

    2009-02-23

    Estimates for the efficiency of a tree are derived, leading to new analytical expressions for Barabasi-Albert trees efficiency. These expressions are used to investigate the dynamic behaviour of such networks. It is proved that the preferential attachment leads to an asymptotic conservation of efficiency as the Barabasi-Albert trees grow.

  14. Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabasi-Albert trees

    International Nuclear Information System (INIS)

    Hernandez-Bermejo, B.; Marco-Blanco, J.; Romance, M.

    2009-01-01

    Estimates for the efficiency of a tree are derived, leading to new analytical expressions for Barabasi-Albert trees efficiency. These expressions are used to investigate the dynamic behaviour of such networks. It is proved that the preferential attachment leads to an asymptotic conservation of efficiency as the Barabasi-Albert trees grow

  15. Physical properties of a high molecular weight hydroxyl-terminated polydimethylsiloxane modified castor oil based polyurethane/epoxy interpenetrating polymer network composites

    Science.gov (United States)

    Chen, Shoubing; Wang, Qihua; Wang, Tingmei

    2011-06-01

    A series of polyurethane (PU)/epoxy resin (EP) graft interpenetrating polymer network (IPN) composites modified by a high molecular weight hydroxyl-terminated polydimethylsiloxane (HTPDMS) were prepared. The effects of HTPDMS content on the phase structure, damping properties and the glass transition temperature ( Tg) of the HTPDMS-modified PU/EP IPN composites were studied by scanning electron microscopy (SEM) and dynamic mechanical analysis (DMA). Thermogravimetric analysis (TGA) showed that the thermal decomposition temperature of the composites increased with the increase of HTPDMS content. The tensile strength and impact strength of the IPN composites were also significantly improved, especially when the HTPDMS content was 10%. The modified IPN composites were expected to be used as structural damping materials in the future.

  16. Prediction of heterodimeric protein complexes from weighted protein-protein interaction networks using novel features and kernel functions.

    Directory of Open Access Journals (Sweden)

    Peiying Ruan

    Full Text Available Since many proteins express their functional activity by interacting with other proteins and forming protein complexes, it is very useful to identify sets of proteins that form complexes. For that purpose, many prediction methods for protein complexes from protein-protein interactions have been developed such as MCL, MCODE, RNSC, PCP, RRW, and NWE. These methods have dealt with only complexes with size of more than three because the methods often are based on some density of subgraphs. However, heterodimeric protein complexes that consist of two distinct proteins occupy a large part according to several comprehensive databases of known complexes. In this paper, we propose several feature space mappings from protein-protein interaction data, in which each interaction is weighted based on reliability. Furthermore, we make use of prior knowledge on protein domains to develop feature space mappings, domain composition kernel and its combination kernel with our proposed features. We perform ten-fold cross-validation computational experiments. These results suggest that our proposed kernel considerably outperforms the naive Bayes-based method, which is the best existing method for predicting heterodimeric protein complexes.

  17. Determination of Optimal Initial Weights of an Artificial Neural Network by Using the Harmony Search Algorithm: Application to Breakwater Armor Stones

    Directory of Open Access Journals (Sweden)

    Anzy Lee

    2016-05-01

    Full Text Available In this study, an artificial neural network (ANN model is developed to predict the stability number of breakwater armor stones based on the experimental data reported by Van der Meer in 1988. The harmony search (HS algorithm is used to determine the near-global optimal initial weights in the training of the model. The stratified sampling is used to sample the training data. A total of 25 HS-ANN hybrid models are tested with different combinations of HS algorithm parameters. The HS-ANN models are compared with the conventional ANN model, which uses a Monte Carlo simulation to determine the initial weights. Each model is run 50 times and the statistical analyses are conducted for the model results. The present models using stratified sampling are shown to be more accurate than those of previous studies. The statistical analyses for the model results show that the HS-ANN model with proper values of HS algorithm parameters can give much better and more stable prediction than the conventional ANN model.

  18. Networking

    OpenAIRE

    Rauno Lindholm, Daniel; Boisen Devantier, Lykke; Nyborg, Karoline Lykke; Høgsbro, Andreas; Fries, de; Skovlund, Louise

    2016-01-01

    The purpose of this project was to examine what influencing factor that has had an impact on the presumed increasement of the use of networking among academics on the labour market and how it is expressed. On the basis of the influence from globalization on the labour market it can be concluded that the globalization has transformed the labour market into a market based on the organization of networks. In this new organization there is a greater emphasis on employees having social qualificati...

  19. Deficit Round Robin with Fragmentation Scheduling to Achieve Generalized Weighted Fairness for Resource Allocation in IEEE 802.16e Mobile WiMAX Networks

    Directory of Open Access Journals (Sweden)

    Chakchai So-In

    2010-10-01

    Full Text Available Deficit Round Robin (DRR is a fair packet-based scheduling discipline commonly used in wired networks where link capacities do not change with time. However, in wireless networks, especially wireless broadband networks, i.e., IEEE 802.16e Mobile WiMAX, there are two main considerations violate the packet-based service concept for DRR. First, the resources are allocated per Mobile WiMAX frame. To achieve full frame utilization, Mobile WiMAX allows packets to be fragmented. Second, due to a high variation in wireless channel conditions, the link/channel capacity can change over time and location. Therefore, we introduce a Deficit Round Robin with Fragmentation (DRRF to allocate resources per Mobile WiMAX frame in a fair manner by allowing for varying link capacity and for transmitting fragmented packets. Similar to DRR and Generalized Processor Sharing (GPS, DRRF achieves perfect fairness. DRRF results in a higher throughput than DRR (80% improvement while causing less overhead than GPS (8 times less than GPS. In addition, in Mobile WiMAX, the quality of service (QoS offered by service providers is associated with the price paid. This is similar to a cellular phone system; the users may be required to pay air-time charges. Hence, we have also formalized a Generalized Weighted Fairness (GWF criterion which equalizes a weighted sum of service time units or slots, called temporal fairness, and transmitted bytes, called throughput fairness, for customers who are located in a poor channel condition or at a further distance versus for those who are near the base stations, or have a good channel condition. We use DRRF to demonstrate the application of GWF. These fairness criteria are used to satisfy basic requirements for resource allocation, especially for non real-time traffic. Therefore, we also extend DRRF to support other QoS requirements, such as minimum reserved traffic rate, maximum sustained traffic rate, and traffic priority. For real

  20. Systemic risk on different interbank network topologies

    Science.gov (United States)

    Lenzu, Simone; Tedeschi, Gabriele

    2012-09-01

    In this paper we develop an interbank market with heterogeneous financial institutions that enter into lending agreements on different network structures. Credit relationships (links) evolve endogenously via a fitness mechanism based on agents' performance. By changing the agent's trust on its neighbor's performance, interbank linkages self-organize themselves into very different network architectures, ranging from random to scale-free topologies. We study which network architecture can make the financial system more resilient to random attacks and how systemic risk spreads over the network. To perturb the system, we generate a random attack via a liquidity shock. The hit bank is not automatically eliminated, but its failure is endogenously driven by its incapacity to raise liquidity in the interbank network. Our analysis shows that a random financial network can be more resilient than a scale free one in case of agents' heterogeneity.

  1. Power-Hop: A Pervasive Observation for Real Complex Networks

    Science.gov (United States)

    2016-03-14

    e.g., power grid, the Internet and the web-graph), social (e.g., friendship networks — Facebook , Gowalla—and co- authorship networks ), urban (e.g...Mislove A., Cha M. and Gummadi K.P. On the evolution of user interaction in Facebook . In Proc. Workshop on Online Social Networks 2009. doi...scale-free distribution is pervasive and describes a large variety of networks , ranging from social and urban to technological and biological networks

  2. The complex network reliability and influential nodes

    Science.gov (United States)

    Li, Kai; He, Yongfeng

    2017-08-01

    In order to study the complex network node important degree and reliability, considering semi-local centrality, betweenness centrality and PageRank algorithm, through the simulation method to gradually remove nodes and recalculate the importance in the random network, small world network and scale-free network. Study the relationship between the largest connected component and node removed proportion, the research results show that betweenness centrality and PageRank algorithm based on the global information network are more effective for evaluating the importance of nodes, and the reliability of the network is related to the network topology.

  3. Scaling Laws in Chennai Bus Network

    OpenAIRE

    Chatterjee, Atanu; Ramadurai, Gitakrishnan

    2015-01-01

    In this paper, we study the structural properties of the complex bus network of Chennai. We formulate this extensive network structure by identifying each bus stop as a node, and a bus which stops at any two adjacent bus stops as an edge connecting the nodes. Rigorous statistical analysis of this data shows that the Chennai bus network displays small-world properties and a scale-free degree distribution with the power-law exponent, $\\gamma > 3$.

  4. Understanding structure of urban traffic network based on spatial-temporal correlation analysis

    Science.gov (United States)

    Yang, Yanfang; Jia, Limin; Qin, Yong; Han, Shixiu; Dong, Honghui

    2017-08-01

    Understanding the structural characteristics of urban traffic network comprehensively can provide references for improving road utilization rate and alleviating traffic congestion. This paper focuses on the spatial-temporal correlations between different pairs of traffic series and proposes a complex network-based method of constructing the urban traffic network. In the network, the nodes represent road segments, and an edge between a pair of nodes is added depending on the result of significance test for the corresponding spatial-temporal correlation. Further, a modified PageRank algorithm, named the geographical weight-based PageRank algorithm (GWPA), is proposed to analyze the spatial distribution of important segments in the road network. Finally, experiments are conducted by using three kinds of traffic series collected from the urban road network in Beijing. Experimental results show that the urban traffic networks constructed by three traffic variables all indicate both small-world and scale-free characteristics. Compared with the results of PageRank algorithm, GWPA is proved to be valid in evaluating the importance of segments and identifying the important segments with small degree.

  5. Controllability of Train Service Network

    Directory of Open Access Journals (Sweden)

    Xuelei Meng

    2015-01-01

    Full Text Available Train service network is a network form of train service plan. The controllability of the train service plan determines the recovery possibility of the train service plan in emergencies. We first build the small-world model for train service network and analyze the scale-free character of it. Then based on the linear network controllability theory, we discuss the LB model adaptability in train service network controllability analysis. The LB model is improved and we construct the train service network and define the connotation of the driver nodes based on the immune propagation and cascading failure in the train service network. An algorithm to search for the driver nodes, turning the train service network into a bipartite graph, is proposed and applied in the train service network. We analyze the controllability of the train service network of China with the method and the results of the computing case prove the feasibility of it.

  6. Identifying miRNA and gene modules of colon cancer associated with pathological stage by weighted gene co-expression network analysis

    Directory of Open Access Journals (Sweden)

    Zhou X

    2018-05-01

    Full Text Available Xian-guo Zhou,1,2,* Xiao-liang Huang,1,2,* Si-yuan Liang,1–3 Shao-mei Tang,1,2 Si-kao Wu,1,2 Tong-tong Huang,1,2 Zeng-nan Mo,1,2,4 Qiu-yan Wang1,2,5 1Center for Genomic and Personalized Medicine, Guangxi Medical University, Nanning, Guangxi Zhuang Autonomous Region, People’s Republic of China; 2Guangxi Key Laboratory for Genomic and Personalized Medicine, Guangxi Collaborative Innovation Center for Genomic and Personalized Medicine, Nanning, Guangxi Zhuang Autonomous Region, People’s Republic of China; 3Department of Colorectal Surgery, First Affiliated Hospital of Guangxi Medical University, Nanning, Guangxi Zhuang Autonomous Region, People’s Republic of China; 4Department of Urology and Nephrology, The First Affiliated Hospital of Guangxi, Medical University, Nanning, Guangxi Zhuang Autonomous Region, People’s Republic of China; 5Guangxi Colleges and Universities Key Laboratory of Biological Molecular Medicine Research, Guangxi Medical University, Nanning, Guangxi Zhuang Autonomous Region, People’s Republic of China *These authors contributed equally to this work Introduction: Colorectal cancer (CRC is the fourth most common cause of cancer-related mortality worldwide. The tumor, node, metastasis (TNM stage remains the standard for CRC prognostication. Identification of meaningful microRNA (miRNA and gene modules or representative biomarkers related to the pathological stage of colon cancer helps to predict prognosis and reveal the mechanisms behind cancer progression.Materials and methods: We applied a systems biology approach by combining differential expression analysis and weighted gene co-expression network analysis (WGCNA to detect the pathological stage-related miRNA and gene modules and construct a miRNA–gene network. The Cancer Genome Atlas (TCGA colon adenocarcinoma (CAC RNA-sequencing data and miRNA-sequencing data were subjected to WGCNA analysis, and the GSE29623, GSE35602 and GSE39396 were utilized to validate and

  7. A Network Design Approach to Countering Terrorism

    Science.gov (United States)

    2015-09-01

    2003). More and more scale-free networks have been discovered. How can such diverse systems have the same architecture and properties? Part of the...Rabei Ousmane Sayed Ahmed (a.k.a. the Egyptian ) convinced the group to pursuit jihad at home, where they had the material resources to act (Atran, 2010

  8. GENERAL: Epidemic spreading on networks with vaccination

    Science.gov (United States)

    Shi, Hong-Jing; Duan, Zhi-Sheng; Chen, Guan-Rong; Li, Rong

    2009-08-01

    In this paper, a new susceptible-infected-susceptible (SIS) model on complex networks with imperfect vaccination is proposed. Two types of epidemic spreading patterns (the recovered individuals have or have not immunity) on scale-free networks are discussed. Both theoretical and numerical analyses are presented. The epidemic thresholds related to the vaccination rate, the vaccination-invalid rate and the vaccination success rate on scale-free networks are demonstrated, showing different results from the reported observations. This reveals that whether or not the epidemic can spread over a network under vaccination control is determined not only by the network structure but also by the medicine's effective duration. Moreover, for a given infective rate, the proportion of individuals to vaccinate can be calculated theoretically for the case that the recovered nodes have immunity. Finally, simulated results are presented to show how to control the disease prevalence.

  9. Promotion of cooperation in the form C0C1D classified by 'degree grads' in a scale-free network

    International Nuclear Information System (INIS)

    Zhao, Li; Ye, Xiang-Jun; Huang, Zi-Gang; Sun, Jin-Tu; Yang, Lei; Wang, Ying-Hai; Do, Younghae

    2010-01-01

    In this paper, we revisit the issue of the public goods game (PGG) on a heterogeneous graph. By introducing a new effective topology parameter, 'degree grads' ψ, we clearly classify the agents into three kinds, namely, C 0 , C 1 , and D. The mechanism for the heterogeneous topology promoting cooperation is discussed in detail from the perspective of C 0 C 1 D, which reflects the fact that the unreasoning imitation behaviour of C 1 agents, who are 'cheated' by the well-paid C 0 agents inhabiting special positions, stabilizes the formation of the cooperation community. The analytical and simulation results for certain parameters are found to coincide well with each other. The C 0 C 1 D case provides a picture of the actual behaviours in real society and thus is potentially of interest

  10. Scale-free fluctuations in behavioral performance: delineating changes in spontaneous behavior of humans with induced sleep deficiency.

    Directory of Open Access Journals (Sweden)

    Jeremi K Ochab

    Full Text Available The timing and dynamics of many diverse behaviors of mammals, e.g., patterns of animal foraging or human communication in social networks exhibit complex self-similar properties reproducible over multiple time scales. In this paper, we analyze spontaneous locomotor activity of healthy individuals recorded in two different conditions: during a week of regular sleep and a week of chronic partial sleep deprivation. After separating activity from rest with a pre-defined activity threshold, we have detected distinct statistical features of duration times of these two states. The cumulative distributions of activity periods follow a stretched exponential shape, and remain similar for both control and sleep deprived individuals. In contrast, rest periods, which follow power-law statistics over two orders of magnitude, have significantly distinct distributions for these two groups and the difference emerges already after the first night of shortened sleep. We have found steeper distributions for sleep deprived individuals, which indicates fewer long rest periods and more turbulent behavior. This separation of power-law exponents is the main result of our investigations, and might constitute an objective measure demonstrating the severity of sleep deprivation and the effects of sleep disorders.

  11. Near scale-free dynamics in neural population activity of waking/sleeping rats revealed by multiscale analysis.

    Directory of Open Access Journals (Sweden)

    Leonid A Safonov

    Full Text Available A neuron embedded in an intact brain, unlike an isolated neuron, participates in network activity at various spatial resolutions. Such multiple scale spatial dynamics is potentially reflected in multiple time scales of temporal dynamics. We identify such multiple dynamical time scales of the inter-spike interval (ISI fluctuations of neurons of waking/sleeping rats by means of multiscale analysis. The time scale of large non-Gaussianity in the ISI fluctuations, measured with the Castaing method, ranges up to several minutes, markedly escaping the low-pass filtering characteristics of neurons. A comparison between neural activity during waking and sleeping reveals that non-Gaussianity is stronger during waking than sleeping throughout the entire range of scales observed. We find a remarkable property of near scale independence of the magnitude correlations as the primary cause of persistent non-Gaussianity. Such scale-invariance of correlations is characteristic of multiplicative cascade processes and raises the possibility of the existence of a scale independent memory preserving mechanism.

  12. Coevolutionary modeling in network formation

    KAUST Repository

    Al-Shyoukh, Ibrahim

    2014-12-03

    Network coevolution, the process of network topology evolution in feedback with dynamical processes over the network nodes, is a common feature of many engineered and natural networks. In such settings, the change in network topology occurs at a comparable time scale to nodal dynamics. Coevolutionary modeling offers the possibility to better understand how and why network structures emerge. For example, social networks can exhibit a variety of structures, ranging from almost uniform to scale-free degree distributions. While current models of network formation can reproduce these structures, coevolutionary modeling can offer a better understanding of the underlying dynamics. This paper presents an overview of recent work on coevolutionary models of network formation, with an emphasis on the following three settings: (i) dynamic flow of benefits and costs, (ii) transient link establishment costs, and (iii) latent preferential attachment.

  13. Coevolutionary modeling in network formation

    KAUST Repository

    Al-Shyoukh, Ibrahim; Chasparis, Georgios; Shamma, Jeff S.

    2014-01-01

    Network coevolution, the process of network topology evolution in feedback with dynamical processes over the network nodes, is a common feature of many engineered and natural networks. In such settings, the change in network topology occurs at a comparable time scale to nodal dynamics. Coevolutionary modeling offers the possibility to better understand how and why network structures emerge. For example, social networks can exhibit a variety of structures, ranging from almost uniform to scale-free degree distributions. While current models of network formation can reproduce these structures, coevolutionary modeling can offer a better understanding of the underlying dynamics. This paper presents an overview of recent work on coevolutionary models of network formation, with an emphasis on the following three settings: (i) dynamic flow of benefits and costs, (ii) transient link establishment costs, and (iii) latent preferential attachment.

  14. Topology and computational performance of attractor neural networks

    International Nuclear Information System (INIS)

    McGraw, Patrick N.; Menzinger, Michael

    2003-01-01

    To explore the relation between network structure and function, we studied the computational performance of Hopfield-type attractor neural nets with regular lattice, random, small-world, and scale-free topologies. The random configuration is the most efficient for storage and retrieval of patterns by the network as a whole. However, in the scale-free case retrieval errors are not distributed uniformly among the nodes. The portion of a pattern encoded by the subset of highly connected nodes is more robust and efficiently recognized than the rest of the pattern. The scale-free network thus achieves a very strong partial recognition. The implications of these findings for brain function and social dynamics are suggestive

  15. An evolving network model with community structure

    International Nuclear Information System (INIS)

    Li Chunguang; Maini, Philip K

    2005-01-01

    Many social and biological networks consist of communities-groups of nodes within which connections are dense, but between which connections are sparser. Recently, there has been considerable interest in designing algorithms for detecting community structures in real-world complex networks. In this paper, we propose an evolving network model which exhibits community structure. The network model is based on the inner-community preferential attachment and inter-community preferential attachment mechanisms. The degree distributions of this network model are analysed based on a mean-field method. Theoretical results and numerical simulations indicate that this network model has community structure and scale-free properties

  16. Research of Innovation Diffusion on Industrial Networks

    Directory of Open Access Journals (Sweden)

    Yongtai Chen

    2014-01-01

    Full Text Available The real value of innovation consists in its diffusion on industrial network. The factors which affect the diffusion of innovation on industrial network are the topology of industrial network and rules of diffusion. Industrial network is a complex network which has scale-free and small-world characters; its structure has some affection on threshold, length of path, enterprise’s status, and information share of innovation diffusion. Based on the cost and attitude to risk of technical innovation, we present the “avalanche” diffusing model of technical innovation on industrial network.

  17. Disease spreading in real-life networks

    Science.gov (United States)

    Gallos, Lazaros; Argyrakis, Panos

    2002-08-01

    In recent years the scientific community has shown a vivid interest in the network structure and dynamics of real-life organized systems. Many such systems, covering an extremely wide range of applications, have been recently shown to exhibit scale-free character in their connectivity distribution, meaning that they obey a power law. Modeling of epidemics on lattices and small-world networks suffers from the presence of a critical infection threshold, above which the entire population is infected. For scale-free networks, the original assumption was that the formation of a giant cluster would lead to an epidemic spreading in the same way as in simpler networks. Here we show that modeling epidemics on a scale-free network can greatly improve the predictions on the rate and efficiency of spreading, as compared to lattice models and small-world networks. We also show that the dynamics of a disease are greatly influenced by the underlying population structure. The exact same model can describe a plethora of networks, such as social networks, virus spreading in the Web, rumor spreading, signal transmission etc.

  18. Weight Management

    Science.gov (United States)

    ... Health Information Weight Management English English Español Weight Management Obesity is a chronic condition that affects more ... Liver (NASH) Heart Disease & Stroke Sleep Apnea Weight Management Topics About Food Portions Bariatric Surgery for Severe ...

  19. Detection of Locally Over-Represented GO Terms in Protein-Protein Interaction Networks

    Science.gov (United States)

    LAVALLÉE-ADAM, MATHIEU; COULOMBE, BENOIT; BLANCHETTE, MATHIEU

    2015-01-01

    High-throughput methods for identifying protein-protein interactions produce increasingly complex and intricate interaction networks. These networks are extremely rich in information, but extracting biologically meaningful hypotheses from them and representing them in a human-readable manner is challenging. We propose a method to identify Gene Ontology terms that are locally over-represented in a subnetwork of a given biological network. Specifically, we propose several methods to evaluate the degree of clustering of proteins associated to a particular GO term in both weighted and unweighted PPI networks, and describe efficient methods to estimate the statistical significance of the observed clustering. We show, using Monte Carlo simulations, that our best approximation methods accurately estimate the true p-value, for random scale-free graphs as well as for actual yeast and human networks. When applied to these two biological networks, our approach recovers many known complexes and pathways, but also suggests potential functions for many subnetworks. Online Supplementary Material is available at www.liebertonline.com. PMID:20377456

  20. Relationship Between the Functional Status Scale and the Pediatric Overall Performance Category and Pediatric Cerebral Performance Category Scales FREE

    Science.gov (United States)

    Pollack, Murray M.; Holubkov, Richard; Funai, Tomohiko; Clark, Amy; Moler, Frank; Shanley, Thomas; Meert, Kathy; Newth, Christopher J. L.; Carcillo, Joseph; Berger, John T.; Doctor, Allan; Berg, Robert A.; Dalton, Heidi; Wessel, David L.; Harrison, Rick E.; Dean, J. Michael; Jenkins, Tammara L.

    2015-01-01

    Importance Functional status assessment methods are important as outcome measures for pediatric critical care studies. Objective To investigate the relationships between the 2 functional status assessment methods appropriate for large-sample studies, the Functional Status Scale (FSS) and the Pediatric Overall Performance Category and Pediatric Cerebral Performance Category (POPC/PCPC) scales. Design, Setting, and Participants Prospective cohort study with random patient selection at 7 sites and 8 children’s hospitals with general/medical and cardiac/cardiovascular pediatric intensive care units (PICUs) in the Collaborative Pediatric Critical Care Research Network. Participants included all PICU patients younger than 18 years. Main Outcomes and Measures Functional Status Scale and POPC/PCPC scores determined at PICU admission (baseline) and PICU discharge. We investigated the association between the baseline and PICU discharge POPC/PCPC scores and the baseline and PICU discharge FSS scores, the dispersion of FSS scores within each of the POPC/PCPC ratings, and the relationship between the FSS neurologic components (FSS-CNS) and the PCPC. Results We included 5017 patients. We found a significant (P < .001) difference between FSS scores in each POPC or PCPC interval, with an FSS score increase with each worsening POPC/PCPC rating. The FSS scores for the good and mild disability POPC/PCPC ratings were similar and increased by 2 to 3 points for the POPC/PCPC change from mild to moderate disability, 5 to 6 points for moderate to severe disability, and 8 to 9 points for severe disability to vegetative state or coma. The dispersion of FSS scores within each POPC and PCPC rating was substantial and increased with worsening POPC and PCPC scores. We also found a significant (P < .001) difference between the FSS-CNS scores between each of the PCPC ratings with increases in the FSS-CNS score for each higher PCPC rating. Conclusions and Relevance The FSS and POPC/PCPC system

  1. Sync in Complex Dynamical Networks: Stability, Evolution, Control, and Application

    OpenAIRE

    Li, Xiang

    2005-01-01

    In the past few years, the discoveries of small-world and scale-free properties of many natural and artificial complex networks have stimulated significant advances in better understanding the relationship between the topology and the collective dynamics of complex networks. This paper reports recent progresses in the literature of synchronization of complex dynamical networks including stability criteria, network synchronizability and uniform synchronous criticality in different topologies, ...

  2. Research on the Topological Properties of Air Quality Index Based on a Complex Network

    Directory of Open Access Journals (Sweden)

    Yongli Zhang

    2018-04-01

    Full Text Available To analyze the dynamic characteristics of air quality for enforcing effective measures to prevent and evade air pollution harm, air quality index (AQI time series data was selected and transformed into a symbol sequence consisting of characters (H, M, L through the coarse graining process; then each 6-symbols series was treated as one vertex by time sequence to construct the AQI directed-weighted network; finally the centrality, clusterability, and ranking of the AQI network were analyzed. The results indicated that vertex strength and cumulative strength distribution, vertex strength and strength rank presented power law distributions, and the AQI network is a scale-free network. Only 17 vertices possessed a higher weighted clustering coefficient; meanwhile weighted clustering coefficient and vertex strength didn’t show a strong correlation. The AQI network did not have an obvious central tendency towards intermediaries in general, but 20.55% of vertices accounted for nearly 1/2 of the intermediaries, and the varieties still existed. The mean distance of 68.4932% of vertices was 6.120–9.973, the AQI network did not have obvious small-world phenomena, the conversion of AQI patterns presented the characteristics of periodicity and regularity, and 20.2055% of vertices had high proximity prestige. The vertices fell into six islands, the AQI pattern indicating heavy or serious air pollution lasting six days always lingered for a long time. The number of triads 2-012 was the largest, and the AQI network followed the transitivity model. The study has instructional significance in understanding time change regulation of air quality in Beijing, opening a new way for time series prediction research. Additionally, the factors causing the change of topological properties should be analyzed in the future research.

  3. Effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons

    Energy Technology Data Exchange (ETDEWEB)

    Li, Chun-Hsien, E-mail: chli@nknucc.nknu.edu.tw [Department of Mathematics, National Kaohsiung Normal University, Yanchao District, Kaohsiung City 82444, Taiwan (China); Yang, Suh-Yuh, E-mail: syyang@math.ncu.edu.tw [Department of Mathematics, National Central University, Jhongli District, Taoyuan City 32001, Taiwan (China)

    2015-10-23

    This work is devoted to investigate the effects of network structure on the synchronizability of nonlinearly coupled dynamical network of Hindmarsh–Rose neurons with a sigmoidal coupling function. We mainly focus on the networks that exhibit the small-world character or scale-free property. By checking the first nonzero eigenvalue of the outer-coupling matrix, which is closely related to the synchronization threshold, the synchronizabilities of three specific network ensembles with prescribed network structures are compared. Interestingly, we find that networks with more connections will not necessarily result in better synchronizability. - Highlights: • We investigate the effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons. • We mainly consider the networks that exhibit the small-world character or scale-free property. • The synchronizability of three specific network ensembles with prescribed network structures are compared. • Networks with more connections will not necessarily result in better synchronizability.

  4. Effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons

    International Nuclear Information System (INIS)

    Li, Chun-Hsien; Yang, Suh-Yuh

    2015-01-01

    This work is devoted to investigate the effects of network structure on the synchronizability of nonlinearly coupled dynamical network of Hindmarsh–Rose neurons with a sigmoidal coupling function. We mainly focus on the networks that exhibit the small-world character or scale-free property. By checking the first nonzero eigenvalue of the outer-coupling matrix, which is closely related to the synchronization threshold, the synchronizabilities of three specific network ensembles with prescribed network structures are compared. Interestingly, we find that networks with more connections will not necessarily result in better synchronizability. - Highlights: • We investigate the effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons. • We mainly consider the networks that exhibit the small-world character or scale-free property. • The synchronizability of three specific network ensembles with prescribed network structures are compared. • Networks with more connections will not necessarily result in better synchronizability

  5. Epidemic microclusters of blood-culture proven sepsis in very-low-birth weight infants: experience of the German Neonatal Network.

    Science.gov (United States)

    Härtel, Christoph; Faust, Kirstin; Avenarius, Stefan; Bohnhorst, Bettina; Emeis, Michael; Gebauer, Corinna; Groneck, Peter; Heitmann, Friedhelm; Hoehn, Thomas; Hubert, Mechthild; Kribs, Angela; Küster, Helmut; Laux, Reinhard; Mögel, Michael; Müller, Dirk; Olbertz, Dirk; Roll, Claudia; Siegel, Jens; Stein, Anja; Vochem, Matthias; Weller, Ursula; von der Wense, Axel; Wieg, Christian; Wintgens, Jürgen; Hemmelmann, Claudia; Simon, Arne; Herting, Egbert; Göpel, Wolfgang

    2012-01-01

    We evaluated blood culture-proven sepsis episodes occurring in microclusters in very-low-birth-weight infants born in the German Neonatal Network (GNN) during 2009-2010. Thirty-seven centers participated in GNN; 23 centers enrolled ≥50 VLBW infants in the study period. Data quality was approved by on-site monitoring. Microclusters of sepsis were defined as occurrence of at least two blood-culture proven sepsis events in different patients of one center within 3 months with the same bacterial species. For microcluster analysis, we selected sepsis episodes with typically cross-transmitted bacteria of high clinical significance including gram-negative rods and Enterococcus spp. In our cohort, 12/2110 (0.6%) infants were documented with an early-onset sepsis and 235 late-onset sepsis episodes (≥72 h of age) occurred in 203/2110 (9.6%) VLBW infants. In 182/235 (77.4%) late-onset sepsis episodes gram-positive bacteria were documented, while coagulase negative staphylococci were found to be the most predominant pathogens (48.5%, 95%CI: 42.01-55.01). Candida spp. and gram-negative bacilli caused 10/235 (4.3%, 95%CI: 1.68% -6.83%) and 43/235 (18.5%) late-onset sepsis episodes, respectively. Eleven microclusters of blood-culture proven sepsis were detected in 7 hospitals involving a total 26 infants. 16/26 cluster patients suffered from Klebsiella spp. sepsis. The median time interval between the first patient's Klebsiella spp. sepsis and cluster cases was 14.1 days (interquartile range: 1-27 days). First patients in the cluster, their linked cases and sporadic sepsis events did not show significant differences in short term outcome parameters. Microclusters of infection are an important phenomenon for late-onset sepsis. Most gram-negative cluster infections occur within 30 days after the first patient was diagnosed and Klebsiella spp. play a major role. It is essential to monitor epidemic microclusters of sepsis in surveillance networks to adapt clinical practice

  6. Social power and opinion formation in complex networks

    Science.gov (United States)

    Jalili, Mahdi

    2013-02-01

    In this paper we investigate the effects of social power on the evolution of opinions in model networks as well as in a number of real social networks. A continuous opinion formation model is considered and the analysis is performed through numerical simulation. Social power is given to a proportion of agents selected either randomly or based on their degrees. As artificial network structures, we consider scale-free networks constructed through preferential attachment and Watts-Strogatz networks. Numerical simulations show that scale-free networks with degree-based social power on the hub nodes have an optimal case where the largest number of the nodes reaches a consensus. However, given power to a random selection of nodes could not improve consensus properties. Introducing social power in Watts-Strogatz networks could not significantly change the consensus profile.

  7. Inferring the physical connectivity of complex networks from their functional dynamics

    Directory of Open Access Journals (Sweden)

    Holm Liisa

    2010-05-01

    Full Text Available Abstract Background Biological networks, such as protein-protein interactions, metabolic, signalling, transcription-regulatory networks and neural synapses, are representations of large-scale dynamic systems. The relationship between the network structure and functions remains one of the central problems in current multidisciplinary research. Significant progress has been made toward understanding the implication of topological features for the network dynamics and functions, especially in biological networks. Given observations of a network system's behaviours or measurements of its functional dynamics, what can we conclude of the details of physical connectivity of the underlying structure? Results We modelled the network system by employing a scale-free network of coupled phase oscillators. Pairwise phase coherence (PPC was calculated for all the pairs of oscillators to present functional dynamics induced by the system. At the regime of global incoherence, we observed a Significant pairwise synchronization only between two nodes that are physically connected. Right after the onset of global synchronization, disconnected nodes begin to oscillate in a correlated fashion and the PPC of two nodes, either connected or disconnected, depends on their degrees. Based on the observation of PPCs, we built a weighted network of synchronization (WNS, an all-to-all functionally connected network where each link is weighted by the PPC of two oscillators at the ends of the link. In the regime of strong coupling, we observed a Significant similarity in the organization of WNSs induced by systems sharing the same substrate network but different configurations of initial phases and intrinsic frequencies of oscillators. We reconstruct physical network from the WNS by choosing the links whose weights are higher than a given threshold. We observed an optimal reconstruction just before the onset of global synchronization. Finally, we correlated the topology of the

  8. Research on Evolutionary Mechanism of Agile Supply Chain Network via Complex Network Theory

    Directory of Open Access Journals (Sweden)

    Nai-Ru Xu

    2016-01-01

    Full Text Available The paper establishes the evolutionary mechanism model of agile supply chain network by means of complex network theory which can be used to describe the growth process of the agile supply chain network and analyze the complexity of the agile supply chain network. After introducing the process and the suitability of taking complex network theory into supply chain network research, the paper applies complex network theory into the agile supply chain network research, analyzes the complexity of agile supply chain network, presents the evolutionary mechanism of agile supply chain network based on complex network theory, and uses Matlab to simulate degree distribution, average path length, clustering coefficient, and node betweenness. Simulation results show that the evolution result displays the scale-free property. It lays the foundations of further research on agile supply chain network based on complex network theory.

  9. Endogenous network of firms and systemic risk

    Science.gov (United States)

    Ma, Qianting; He, Jianmin; Li, Shouwei

    2018-02-01

    We construct an endogenous network characterized by commercial credit relationships connecting the upstream and downstream firms. Simulation results indicate that the endogenous network model displays a scale-free property which exists in real-world firm systems. In terms of the network structure, with the expansion of the scale of network nodes, the systemic risk increases significantly, while the heterogeneities of network nodes have no effect on systemic risk. As for firm micro-behaviors, including the selection range of trading partners, actual output, labor requirement, price of intermediate products and employee salaries, increase of all these parameters will lead to higher systemic risk.

  10. Efficient transmission of subthreshold signals in complex networks of spiking neurons.

    Science.gov (United States)

    Torres, Joaquin J; Elices, Irene; Marro, J

    2015-01-01

    We investigate the efficient transmission and processing of weak, subthreshold signals in a realistic neural medium in the presence of different levels of the underlying noise. Assuming Hebbian weights for maximal synaptic conductances--that naturally balances the network with excitatory and inhibitory synapses--and considering short-term synaptic plasticity affecting such conductances, we found different dynamic phases in the system. This includes a memory phase where population of neurons remain synchronized, an oscillatory phase where transitions between different synchronized populations of neurons appears and an asynchronous or noisy phase. When a weak stimulus input is applied to each neuron, increasing the level of noise in the medium we found an efficient transmission of such stimuli around the transition and critical points separating different phases for well-defined different levels of stochasticity in the system. We proved that this intriguing phenomenon is quite robust, as it occurs in different situations including several types of synaptic plasticity, different type and number of stored patterns and diverse network topologies, namely, diluted networks and complex topologies such as scale-free and small-world networks. We conclude that the robustness of the phenomenon in different realistic scenarios, including spiking neurons, short-term synaptic plasticity and complex networks topologies, make very likely that it could also occur in actual neural systems as recent psycho-physical experiments suggest.

  11. Efficient transmission of subthreshold signals in complex networks of spiking neurons.

    Directory of Open Access Journals (Sweden)

    Joaquin J Torres

    Full Text Available We investigate the efficient transmission and processing of weak, subthreshold signals in a realistic neural medium in the presence of different levels of the underlying noise. Assuming Hebbian weights for maximal synaptic conductances--that naturally balances the network with excitatory and inhibitory synapses--and considering short-term synaptic plasticity affecting such conductances, we found different dynamic phases in the system. This includes a memory phase where population of neurons remain synchronized, an oscillatory phase where transitions between different synchronized populations of neurons appears and an asynchronous or noisy phase. When a weak stimulus input is applied to each neuron, increasing the level of noise in the medium we found an efficient transmission of such stimuli around the transition and critical points separating different phases for well-defined different levels of stochasticity in the system. We proved that this intriguing phenomenon is quite robust, as it occurs in different situations including several types of synaptic plasticity, different type and number of stored patterns and diverse network topologies, namely, diluted networks and complex topologies such as scale-free and small-world networks. We conclude that the robustness of the phenomenon in different realistic scenarios, including spiking neurons, short-term synaptic plasticity and complex networks topologies, make very likely that it could also occur in actual neural systems as recent psycho-physical experiments suggest.

  12. Modeling Network Interdiction Tasks

    Science.gov (United States)

    2015-09-17

    118 xiii Table Page 36 Computation times for weighted, 100-node random networks for GAND Approach testing in Python ...in Python . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 38 Accuracy measures for weighted, 100-node random networks for GAND...networks [15:p. 1]. A common approach to modeling network interdiction is to formulate the problem in terms of a two-stage strategic game between two

  13. Multiplex congruence network of natural numbers.

    Science.gov (United States)

    Yan, Xiao-Yong; Wang, Wen-Xu; Chen, Guan-Rong; Shi, Ding-Hua

    2016-03-31

    Congruence theory has many applications in physical, social, biological and technological systems. Congruence arithmetic has been a fundamental tool for data security and computer algebra. However, much less attention was devoted to the topological features of congruence relations among natural numbers. Here, we explore the congruence relations in the setting of a multiplex network and unveil some unique and outstanding properties of the multiplex congruence network. Analytical results show that every layer therein is a sparse and heterogeneous subnetwork with a scale-free topology. Counterintuitively, every layer has an extremely strong controllability in spite of its scale-free structure that is usually difficult to control. Another amazing feature is that the controllability is robust against targeted attacks to critical nodes but vulnerable to random failures, which also differs from ordinary scale-free networks. The multi-chain structure with a small number of chain roots arising from each layer accounts for the strong controllability and the abnormal feature. The multiplex congruence network offers a graphical solution to the simultaneous congruences problem, which may have implication in cryptography based on simultaneous congruences. Our work also gains insight into the design of networks integrating advantages of both heterogeneous and homogeneous networks without inheriting their limitations.

  14. Vulnerability of complex networks under intentional attack with incomplete information

    International Nuclear Information System (INIS)

    Wu, J; Deng, H Z; Tan, Y J; Zhu, D Z

    2007-01-01

    We study the vulnerability of complex networks under intentional attack with incomplete information, which means that one can only preferentially attack the most important nodes among a local region of a network. The known random failure and the intentional attack are two extreme cases of our study. Using the generating function method, we derive the exact value of the critical removal fraction f c of nodes for the disintegration of networks and the size of the giant component. To validate our model and method, we perform simulations of intentional attack with incomplete information in scale-free networks. We show that the attack information has an important effect on the vulnerability of scale-free networks. We also demonstrate that hiding a fraction of the nodes information is a cost-efficient strategy for enhancing the robustness of complex networks

  15. Weighted Clustering

    DEFF Research Database (Denmark)

    Ackerman, Margareta; Ben-David, Shai; Branzei, Simina

    2012-01-01

    We investigate a natural generalization of the classical clustering problem, considering clustering tasks in which different instances may have different weights.We conduct the first extensive theoretical analysis on the influence of weighted data on standard clustering algorithms in both...... the partitional and hierarchical settings, characterizing the conditions under which algorithms react to weights. Extending a recent framework for clustering algorithm selection, we propose intuitive properties that would allow users to choose between clustering algorithms in the weighted setting and classify...

  16. Self-similarity and scaling theory of complex networks

    Science.gov (United States)

    Song, Chaoming

    Scale-free networks have been studied extensively due to their relevance to many real systems as diverse as the World Wide Web (WWW), the Internet, biological and social networks. We present a novel approach to the analysis of scale-free networks, revealing that their structure is self-similar. This result is achieved by the application of a renormalization procedure which coarse-grains the system into boxes containing nodes within a given "size". Concurrently, we identify a power-law relation between the number of boxes needed to cover the network and the size of the box defining a self-similar exponent, which classifies fractal and non-fractal networks. By using the concept of renormalization as a mechanism for the growth of fractal and non-fractal modular networks, we show that the key principle that gives rise to the fractal architecture of networks is a strong effective "repulsion" between the most connected nodes (hubs) on all length scales, rendering them very dispersed. We show that a robust network comprised of functional modules, such as a cellular network, necessitates a fractal topology, suggestive of a evolutionary drive for their existence. These fundamental properties help to understand the emergence of the scale-free property in complex networks.

  17. Optimal topologies for maximizing network transmission capacity

    Science.gov (United States)

    Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

    2018-04-01

    It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.

  18. Weighted gene co-expression network analysis of expression data of monozygotic twins identifies specific modules and hub genes related to BMI.

    Science.gov (United States)

    Wang, Weijing; Jiang, Wenjie; Hou, Lin; Duan, Haiping; Wu, Yili; Xu, Chunsheng; Tan, Qihua; Li, Shuxia; Zhang, Dongfeng

    2017-11-13

    The therapeutic management of obesity is challenging, hence further elucidating the underlying mechanisms of obesity development and identifying new diagnostic biomarkers and therapeutic targets are urgent and necessary. Here, we performed differential gene expression analysis and weighted gene co-expression network analysis (WGCNA) to identify significant genes and specific modules related to BMI based on gene expression profile data of 7 discordant monozygotic twins. In the differential gene expression analysis, it appeared that 32 differentially expressed genes (DEGs) were with a trend of up-regulation in twins with higher BMI when compared to their siblings. Categories of positive regulation of nitric-oxide synthase biosynthetic process, positive regulation of NF-kappa B import into nucleus, and peroxidase activity were significantly enriched within GO database and NF-kappa B signaling pathway within KEGG database. DEGs of NAMPT, TLR9, PTGS2, HBD, and PCSK1N might be associated with obesity. In the WGCNA, among the total 20 distinct co-expression modules identified, coral1 module (68 genes) had the strongest positive correlation with BMI (r = 0.56, P = 0.04) and disease status (r = 0.56, P = 0.04). Categories of positive regulation of phospholipase activity, high-density lipoprotein particle clearance, chylomicron remnant clearance, reverse cholesterol transport, intermediate-density lipoprotein particle, chylomicron, low-density lipoprotein particle, very-low-density lipoprotein particle, voltage-gated potassium channel complex, cholesterol transporter activity, and neuropeptide hormone activity were significantly enriched within GO database for this module. And alcoholism and cell adhesion molecules pathways were significantly enriched within KEGG database. Several hub genes, such as GAL, ASB9, NPPB, TBX2, IL17C, APOE, ABCG4, and APOC2 were also identified. The module eigengene of saddlebrown module (212 genes) was also significantly

  19. The complexity of classical music networks

    Science.gov (United States)

    Rolla, Vitor; Kestenberg, Juliano; Velho, Luiz

    2018-02-01

    Previous works suggest that musical networks often present the scale-free and the small-world properties. From a musician's perspective, the most important aspect missing in those studies was harmony. In addition to that, the previous works made use of outdated statistical methods. Traditionally, least-squares linear regression is utilised to fit a power law to a given data set. However, according to Clauset et al. such a traditional method can produce inaccurate estimates for the power law exponent. In this paper, we present an analysis of musical networks which considers the existence of chords (an essential element of harmony). Here we show that only 52.5% of music in our database presents the scale-free property, while 62.5% of those pieces present the small-world property. Previous works argue that music is highly scale-free; consequently, it sounds appealing and coherent. In contrast, our results show that not all pieces of music present the scale-free and the small-world properties. In summary, this research is focused on the relationship between musical notes (Do, Re, Mi, Fa, Sol, La, Si, and their sharps) and accompaniment in classical music compositions. More information about this research project is available at https://eden.dei.uc.pt/~vitorgr/MS.html.

  20. Self-Healing Networks: Redundancy and Structure

    Science.gov (United States)

    Quattrociocchi, Walter; Caldarelli, Guido; Scala, Antonio

    2014-01-01

    We introduce the concept of self-healing in the field of complex networks modelling; in particular, self-healing capabilities are implemented through distributed communication protocols that exploit redundant links to recover the connectivity of the system. We then analyze the effect of the level of redundancy on the resilience to multiple failures; in particular, we measure the fraction of nodes still served for increasing levels of network damages. Finally, we study the effects of redundancy under different connectivity patterns—from planar grids, to small-world, up to scale-free networks—on healing performances. Small-world topologies show that introducing some long-range connections in planar grids greatly enhances the resilience to multiple failures with performances comparable to the case of the most resilient (and least realistic) scale-free structures. Obvious applications of self-healing are in the important field of infrastructural networks like gas, power, water, oil distribution systems. PMID:24533065

  1. Complex networks-based energy-efficient evolution model for wireless sensor networks

    Energy Technology Data Exchange (ETDEWEB)

    Zhu Hailin [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China)], E-mail: zhuhailin19@gmail.com; Luo Hong [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China); Peng Haipeng; Li Lixiang; Luo Qun [Information Secure Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China)

    2009-08-30

    Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.

  2. Complex networks-based energy-efficient evolution model for wireless sensor networks

    International Nuclear Information System (INIS)

    Zhu Hailin; Luo Hong; Peng Haipeng; Li Lixiang; Luo Qun

    2009-01-01

    Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.

  3. A new class of scale free solutions to linear ordinary differential equations and the universality of the golden mean (Radical radicand 5 -1)/2=0.618033...

    CERN Document Server

    Datta, D P

    2003-01-01

    A new class of finitely differentiable scale free solutions to the simplest class of ordinary differential equations is presented. Consequently, the real number set gets replaced by an extended physical set, each element of which is endowed with an equivalence class of infinitesimally separated neighbours in the form of random fluctuations. We show how a sense of time and evolution is intrinsically defined by the infinite continued fraction of the golden mean irrational number (Radical radicand 5 -1)/2, which plays a key role in this extended SL(2,R) formalism of calculus analogous to El Naschie's theory of E sup ( supinfinity sup ) spacetime manifold. Time may thereby undergo random inversions generating well defined random scales, thus allowing a dynamical system to evolve self similarly over the set of multiple scales. The late time stochastic fluctuations of a dynamical system enjoys the generic 1/f spectrum. A universal form of the related probability density is also derived. We prove that the golden mea...

  4. A new class of scale free solutions to linear ordinary differential equations and the universality of the golden mean (Radical radicand 5 -1)/2=0.618033.

    International Nuclear Information System (INIS)

    Datta, Dhurjati Prasad

    2003-01-01

    A new class of finitely differentiable scale free solutions to the simplest class of ordinary differential equations is presented. Consequently, the real number set gets replaced by an extended physical set, each element of which is endowed with an equivalence class of infinitesimally separated neighbours in the form of random fluctuations. We show how a sense of time and evolution is intrinsically defined by the infinite continued fraction of the golden mean irrational number (Radical radicand 5 -1)/2, which plays a key role in this extended SL(2,R) formalism of calculus analogous to El Naschie's theory of E (∞) spacetime manifold. Time may thereby undergo random inversions generating well defined random scales, thus allowing a dynamical system to evolve self similarly over the set of multiple scales. The late time stochastic fluctuations of a dynamical system enjoys the generic 1/f spectrum. A universal form of the related probability density is also derived. We prove that the golden mean number is intrinsically random, letting all measurements in the physical universe fundamentally uncertain. The present analysis offers an explanation of the universal occurrence of the golden mean in diverse natural and biological processes as well as the mass spectrum of high energy particle physics

  5. A measurement strategy and an error-compensation model for the on-machine laser measurement of large-scale free-form surfaces

    International Nuclear Information System (INIS)

    Li, Bin; Li, Feng; Liu, Hongqi; Cai, Hui; Mao, Xinyong; Peng, Fangyu

    2014-01-01

    This study presents a novel measurement strategy and an error-compensation model for the measurement of large-scale free-form surfaces in on-machine laser measurement systems. To improve the measurement accuracy, the effects of the scan depth, surface roughness, incident angle and azimuth angle on the measurement results were investigated experimentally, and a practical measurement strategy considering the position and orientation of the sensor is presented. Also, a semi-quantitative model based on geometrical optics is proposed to compensate for the measurement error associated with the incident angle. The normal vector of the measurement point is determined using a cross-curve method from the acquired surface data. Then, the azimuth angle and incident angle are calculated to inform the measurement strategy and error-compensation model, respectively. The measurement strategy and error-compensation model are verified through the measurement of a large propeller blade on a heavy machine tool in a factory environment. The results demonstrate that the strategy and the model are effective in increasing the measurement accuracy. (paper)

  6. Symmetry in Complex Networks

    Directory of Open Access Journals (Sweden)

    Angel Garrido

    2011-01-01

    Full Text Available In this paper, we analyze a few interrelated concepts about graphs, such as their degree, entropy, or their symmetry/asymmetry levels. These concepts prove useful in the study of different types of Systems, and particularly, in the analysis of Complex Networks. A System can be defined as any set of components functioning together as a whole. A systemic point of view allows us to isolate a part of the world, and so, we can focus on those aspects that interact more closely than others. Network Science analyzes the interconnections among diverse networks from different domains: physics, engineering, biology, semantics, and so on. Current developments in the quantitative analysis of Complex Networks, based on graph theory, have been rapidly translated to studies of brain network organization. The brain's systems have complex network features—such as the small-world topology, highly connected hubs and modularity. These networks are not random. The topology of many different networks shows striking similarities, such as the scale-free structure, with the degree distribution following a Power Law. How can very different systems have the same underlying topological features? Modeling and characterizing these networks, looking for their governing laws, are the current lines of research. So, we will dedicate this Special Issue paper to show measures of symmetry in Complex Networks, and highlight their close relation with measures of information and entropy.

  7. The architecture of dynamic reservoir in the echo state network

    Science.gov (United States)

    Cui, Hongyan; Liu, Xiang; Li, Lixiang

    2012-09-01

    Echo state network (ESN) has recently attracted increasing interests because of its superior capability in modeling nonlinear dynamic systems. In the conventional echo state network model, its dynamic reservoir (DR) has a random and sparse topology, which is far from the real biological neural networks from both structural and functional perspectives. We hereby propose three novel types of echo state networks with new dynamic reservoir topologies based on complex network theory, i.e., with a small-world topology, a scale-free topology, and a mixture of small-world and scale-free topologies, respectively. We then analyze the relationship between the dynamic reservoir structure and its prediction capability. We utilize two commonly used time series to evaluate the prediction performance of the three proposed echo state networks and compare them to the conventional model. We also use independent and identically distributed time series to analyze the short-term memory and prediction precision of these echo state networks. Furthermore, we study the ratio of scale-free topology and the small-world topology in the mixed-topology network, and examine its influence on the performance of the echo state networks. Our simulation results show that the proposed echo state network models have better prediction capabilities, a wider spectral radius, but retain almost the same short-term memory capacity as compared to the conventional echo state network model. We also find that the smaller the ratio of the scale-free topology over the small-world topology, the better the memory capacities.

  8. Fast Weight Long Short-Term Memory

    OpenAIRE

    Keller, T. Anderson; Sridhar, Sharath Nittur; Wang, Xin

    2018-01-01

    Associative memory using fast weights is a short-term memory mechanism that substantially improves the memory capacity and time scale of recurrent neural networks (RNNs). As recent studies introduced fast weights only to regular RNNs, it is unknown whether fast weight memory is beneficial to gated RNNs. In this work, we report a significant synergy between long short-term memory (LSTM) networks and fast weight associative memories. We show that this combination, in learning associative retrie...

  9. PageRank model of opinion formation on Ulam networks

    Science.gov (United States)

    Chakhmakhchyan, L.; Shepelyansky, D.

    2013-12-01

    We consider a PageRank model of opinion formation on Ulam networks, generated by the intermittency map and the typical Chirikov map. The Ulam networks generated by these maps have certain similarities with such scale-free networks as the World Wide Web (WWW), showing an algebraic decay of the PageRank probability. We find that the opinion formation process on Ulam networks has certain similarities but also distinct features comparing to the WWW. We attribute these distinctions to internal differences in network structure of the Ulam and WWW networks. We also analyze the process of opinion formation in the frame of generalized Sznajd model which protects opinion of small communities.

  10. A Directed Network of Greek and Roman Mythology

    OpenAIRE

    Choi, Yeon-Mu; Kim, Hyun-Joo

    2005-01-01

    We study the Greek and Roman mythology using the network theory. We construct a directed network by using a dictionary of Greek and Roman mythology in which the nodes represent the entries listed in the dictionary and we make directional links from an entry to other entries that appear in its explanatory part. We find that this network is clearly not a random network but a directed scale-free network. Also measuring the various quantities which characterize the mythology network, we analyze t...

  11. Weight Loss

    Science.gov (United States)

    ... Rights Employment Discrimination Health Care Professionals Law Enforcement Driver's License For Lawyers Food & Fitness Home Food MyFoodAdvisor ... Fit Types of Activity Weight Loss Assess Your Lifestyle Getting Started Food Choices In My Community Home ...

  12. COMPLEX NETWORK SIMULATION OF FOREST NETWORK SPATIAL PATTERN IN PEARL RIVER DELTA

    Directory of Open Access Journals (Sweden)

    Y. Zeng

    2017-09-01

    Full Text Available Forest network-construction uses for the method and model with the scale-free features of complex network theory based on random graph theory and dynamic network nodes which show a power-law distribution phenomenon. The model is suitable for ecological disturbance by larger ecological landscape Pearl River Delta consistent recovery. Remote sensing and GIS spatial data are available through the latest forest patches. A standard scale-free network node distribution model calculates the area of forest network’s power-law distribution parameter value size; The recent existing forest polygons which are defined as nodes can compute the network nodes decaying index value of the network’s degree distribution. The parameters of forest network are picked up then make a spatial transition to GIS real world models. Hence the connection is automatically generated by minimizing the ecological corridor by the least cost rule between the near nodes. Based on scale-free network node distribution requirements, select the number compared with less, a huge point of aggregation as a future forest planning network’s main node, and put them with the existing node sequence comparison. By this theory, the forest ecological projects in the past avoid being fragmented, scattered disorderly phenomena. The previous regular forest networks can be reduced the required forest planting costs by this method. For ecological restoration of tropical and subtropical in south China areas, it will provide an effective method for the forest entering city project guidance and demonstration with other ecological networks (water, climate network, etc. for networking a standard and base datum.

  13. Jamming in complex networks with degree correlation

    International Nuclear Information System (INIS)

    Pastore y Piontti, Ana L.; Braunstein, Lidia A.; Macri, Pablo A.

    2010-01-01

    We study the effects of the degree-degree correlations on the pressure congestion J when we apply a dynamical process on scale free complex networks using the gradient network approach. We find that the pressure congestion for disassortative (assortative) networks is lower (bigger) than the one for uncorrelated networks which allow us to affirm that disassortative networks enhance transport through them. This result agree with the fact that many real world transportation networks naturally evolve to this kind of correlation. We explain our results showing that for the disassortative case the clusters in the gradient network turn out to be as much elongated as possible, reducing the pressure congestion J and observing the opposite behavior for the assortative case. Finally we apply our model to real world networks, and the results agree with our theoretical model.

  14. Constraints and entropy in a model of network evolution

    Science.gov (United States)

    Tee, Philip; Wakeman, Ian; Parisis, George; Dawes, Jonathan; Kiss, István Z.

    2017-11-01

    Barabási-Albert's "Scale Free" model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however, indicates that the model is in some cases, only a rough approximation to the dynamical evolution of real networks. In particular, the exponent γ of the power law distribution of degree is predicted by the model to be exactly 3, whereas in a number of real world networks it has values between 1.2 and 2.9. In addition, the degree distributions of real networks exhibit cut offs at high node degree, which indicates the existence of maximal node degrees for these networks. In this paper we propose a simple extension to the "Scale Free" model, which offers better agreement with the experimental data. This improvement is satisfying, but the model still does not explain why the attachment probabilities should favor high degree nodes, or indeed how constraints arrive in non-physical networks. Using recent advances in the analysis of the entropy of graphs at the node level we propose a first principles derivation for the "Scale Free" and "constraints" model from thermodynamic principles, and demonstrate that both preferential attachment and constraints could arise as a natural consequence of the second law of thermodynamics.

  15. Broad-scale small-world network topology induces optimal synchronization of flexible oscillators

    International Nuclear Information System (INIS)

    Markovič, Rene; Gosak, Marko; Marhl, Marko

    2014-01-01

    The discovery of small-world and scale-free properties of many man-made and natural complex networks has attracted increasing attention. Of particular interest is how the structural properties of a network facilitate and constrain its dynamical behavior. In this paper we study the synchronization of weakly coupled limit-cycle oscillators in dependence on the network topology as well as the dynamical features of individual oscillators. We show that flexible oscillators, characterized by near zero values of divergence, express maximal correlation in broad-scale small-world networks, whereas the non-flexible (rigid) oscillators are best correlated in more heterogeneous scale-free networks. We found that the synchronization behavior is governed by the interplay between the networks global efficiency and the mutual frequency adaptation. The latter differs for flexible and rigid oscillators. The results are discussed in terms of evolutionary advantages of broad-scale small-world networks in biological systems

  16. Cyber War Game in Temporal Networks

    Science.gov (United States)

    2016-02-09

    Pastor-Satorras R, Vespignani A. Epidemic spreading in scale-free networks . Physical review letters. 2001; 86(14):3200. doi: 10.1103/PhysRevLett...topology) and remaining resource level of nodes. We use epidemic spreading based on susceptible-infected-removed (SIR) model [6, 21] to describe attackers...86.3200 PMID: 11290142 31. Valdez LD, Macri PA, Braunstein LA. Intermittent social distancing strategy for epidemic control. Physi- cal Review E. 2012 22

  17. Structural Behavioral Study on the General Aviation Network Based on Complex Network

    Science.gov (United States)

    Zhang, Liang; Lu, Na

    2017-12-01

    The general aviation system is an open and dissipative system with complex structures and behavioral features. This paper has established the system model and network model for general aviation. We have analyzed integral attributes and individual attributes by applying the complex network theory and concluded that the general aviation network has influential enterprise factors and node relations. We have checked whether the network has small world effect, scale-free property and network centrality property which a complex network should have by applying degree distribution of functions and proved that the general aviation network system is a complex network. Therefore, we propose to achieve the evolution process of the general aviation industrial chain to collaborative innovation cluster of advanced-form industries by strengthening network multiplication effect, stimulating innovation performance and spanning the structural hole path.

  18. Modern network science of neurological disorders.

    Science.gov (United States)

    Stam, Cornelis J

    2014-10-01

    Modern network science has revealed fundamental aspects of normal brain-network organization, such as small-world and scale-free patterns, hierarchical modularity, hubs and rich clubs. The next challenge is to use this knowledge to gain a better understanding of brain disease. Recent developments in the application of network science to conditions such as Alzheimer's disease, multiple sclerosis, traumatic brain injury and epilepsy have challenged the classical concept of neurological disorders being either 'local' or 'global', and have pointed to the overload and failure of hubs as a possible final common pathway in neurological disorders.

  19. Modeling of contact tracing in social networks

    Science.gov (United States)

    Tsimring, Lev S.; Huerta, Ramón

    2003-07-01

    Spreading of certain infections in complex networks is effectively suppressed by using intelligent strategies for epidemic control. One such standard epidemiological strategy consists in tracing contacts of infected individuals. In this paper, we use a recently introduced generalization of the standard susceptible-infectious-removed stochastic model for epidemics in sparse random networks which incorporates an additional (traced) state. We describe a deterministic mean-field description which yields quantitative agreement with stochastic simulations on random graphs. We also discuss the role of contact tracing in epidemics control in small-world and scale-free networks. Effectiveness of contact tracing grows as the rewiring probability is reduced.

  20. Social networks for improving healthy weight loss behaviors for overweight and obese adults: A randomized clinical trial of the social pounds off digitally (Social POD) mobile app.

    Science.gov (United States)

    Hales, Sarah; Turner-McGrievy, Gabrielle M; Wilcox, Sara; Fahim, Arjang; Davis, Rachel E; Huhns, Michael; Valafar, Homayoun

    2016-10-01

    To test the efficacy of a weight loss mobile app based on recommender systems and developed by experts in health promotion and computer science to target social support and self-monitoring of diet, physical activity (PA), and weight (Social POD app), compared to a commercially available diet and PA tracking app (standard). Overweight adults [N=51] were recruited and randomly assigned to either the experimental group [n=26; theory-based podcasts (TBP)+Social POD app] or the comparison group (n=25; TBP+standard app). The Social POD app issued notifications to encourage users to self-monitor and send theory-based messages to support users who had not self-monitored in the previous 48h. Independent samples t-test were used to examine group differences in kilograms lost and change in BMI. Analysis of covariance was used to analyze secondary outcomes while controlling for baseline values. Participant attrition was 12% (n=3 experimental and n=3 comparison). Experimental group participants lost significantly more weight (-5.3kg, CI: -7.5, -3.0) than comparison group (-2.23kg, CI: -3.6, -1.0; d=0.8, r=0.4, p=0.02) and had a greater reduction in BMI (p=0.02). While there were significant differences in positive outcome expectations between groups (p=0.04) other secondary outcomes (e.g., caloric intake and social support) were not significant. Use of the Social POD app resulted in significantly greater weight loss than use of a commercially available tracking app. This mobile health intervention has the potential to be widely disseminated to reduce the risk of chronic disease associated with overweight and obesity. Published by Elsevier Ireland Ltd.