Stability of a neural network model with small-world connections

International Nuclear Information System (INIS)

Li Chunguang; Chen Guanrong

2003-01-01

Small-world networks are highly clustered networks with small distances among the nodes. There are many biological neural networks that present this kind of connection. There are no special weightings in the connections of most existing small-world network models. However, this kind of simply connected model cannot characterize biological neural networks, in which there are different weights in synaptic connections. In this paper, we present a neural network model with weighted small-world connections and further investigate the stability of this model

The Efficiency of a Small-World Functional Brain Network

Institute of Scientific and Technical Information of China (English)

ZHAO Qing-Bai; ZHANG Xiao-Fei; SUI Dan-Ni; ZHOU Zhi-Jin; CHEN Qi-Cai; TANG Yi-Yuan

2012-01-01

We investigate whether the small-world topology of a functional brain network means high information processing efficiency by calculating the correlation between the small-world measures of a functional brain network and behavioral reaction during an imagery task.Functional brain networks are constructed by multichannel eventrelated potential data,in which the electrodes are the nodes and the functional connectivities between them are the edges.The results show that the correlation between small-world measures and reaction time is task-specific,such that in global imagery,there is a positive correlation between the clustering coefficient and reaction time,while in local imagery the average path length is positively correlated with the reaction time.This suggests that the efficiency of a functional brain network is task-dependent.%We investigate whether the small-world topology of a functional brain network means high information processing efficiency by calculating the correlation between the small-world measures of a functional brain network and behavioral reaction during an imagery task. Functional brain networks are constructed by multichannel event-related potential data, in which the electrodes are the nodes and the functional connectivities between them are the edges. The results show that the correlation between small-world measures and reaction time is task-specific, such that in global imagery, there is a positive correlation between the clustering coefficient and reaction time, while in local imagery the average path length is positively correlated with the reaction time. This suggests that the efficiency of a functional brain network is task-dependent.

Pollination networks of oil-flowers: a tiny world within the smallest of all worlds.

Science.gov (United States)

Bezerra, Elisângela L S; Machado, Isabel C; Mello, Marco A R

2009-09-01

1. In the Neotropics, most plants depend on animals for pollination. Solitary bees are the most important vectors, and among them members of the tribe Centridini depend on oil from flowers (mainly Malpighiaceae) to feed their larvae. This specialized relationship within 'the smallest of all worlds' (a whole pollination network) could result in a 'tiny world' different from the whole system. This 'tiny world' would have higher nestedness, shorter path lengths, lower modularity and higher resilience if compared with the whole pollination network. 2. In the present study, we contrasted a network of oil-flowers and their visitors from a Brazilian steppe ('caatinga') to whole pollination networks from all over the world. 3. A network approach was used to measure network structure and, finally, to test fragility. The oil-flower network studied was more nested (NODF = 0.84, N = 0.96) than all of the whole pollination networks studied. Average path lengths in the two-mode network were shorter (one node, both for bee and plant one-mode network projections) and modularity was lower (M = 0.22 and four modules) than in all of the whole pollination networks. Extinctions had no or small effects on the network structure, with an average change in nestedness smaller than 2% in most of the cases studied; and only two species caused coextinctions. The higher the degree of the removed species, the stronger the effect and the higher the probability of a decrease in nestedness. 4. We conclude that the oil-flower subweb is more cohesive and resilient than whole pollination networks. Therefore, the Malpighiaceae have a robust pollination service in the Neotropics. Our findings reinforce the hypothesis that each ecological service is in fact a mosaic of different subservices with a hierarchical structure ('webs within webs').

A local-world node deleting evolving network model

International Nuclear Information System (INIS)

Gu Yuying; Sun Jitao

2008-01-01

A new type network growth rule which comprises node addition with the concept of local-world connectivity and node deleting is studied. A series of theoretical analysis and numerical simulation to the LWD network are conducted in this Letter. Firstly, the degree distribution p(k) of this network changes no longer pure scale free but truncates by an exponential tail and the truncation in p(k) increases as p a decreases. Secondly, the connectivity is tighter, as the local-world size M increases. Thirdly, the average path length L increases and the clustering coefficient decreases as generally node deleting increases. Finally, trends up when the local-world size M increases, so as to k max . Hence, the expanding local-world can compensate the infection of the node deleting

A local-world node deleting evolving network model

Energy Technology Data Exchange (ETDEWEB)

Gu Yuying [Department of Mathematics, Tongji University, Shanghai 200092 (China); Sun Jitao [Department of Mathematics, Tongji University, Shanghai 200092 (China)], E-mail: sunjt@sh163.net

2008-06-16

A new type network growth rule which comprises node addition with the concept of local-world connectivity and node deleting is studied. A series of theoretical analysis and numerical simulation to the LWD network are conducted in this Letter. Firstly, the degree distribution p(k) of this network changes no longer pure scale free but truncates by an exponential tail and the truncation in p(k) increases as p{sub a} decreases. Secondly, the connectivity is tighter, as the local-world size M increases. Thirdly, the average path length L increases and the clustering coefficient decreases as generally node deleting increases. Finally, trends up when the local-world size M increases, so as to k{sub max}. Hence, the expanding local-world can compensate the infection of the node deleting.

Hodge Decomposition of Information Flow on Small-World Networks.

Science.gov (United States)

Haruna, Taichi; Fujiki, Yuuya

2016-01-01

We investigate the influence of the small-world topology on the composition of information flow on networks. By appealing to the combinatorial Hodge theory, we decompose information flow generated by random threshold networks on the Watts-Strogatz model into three components: gradient, harmonic and curl flows. The harmonic and curl flows represent globally circular and locally circular components, respectively. The Watts-Strogatz model bridges the two extreme network topologies, a lattice network and a random network, by a single parameter that is the probability of random rewiring. The small-world topology is realized within a certain range between them. By numerical simulation we found that as networks become more random the ratio of harmonic flow to the total magnitude of information flow increases whereas the ratio of curl flow decreases. Furthermore, both quantities are significantly enhanced from the level when only network structure is considered for the network close to a random network and a lattice network, respectively. Finally, the sum of these two ratios takes its maximum value within the small-world region. These findings suggest that the dynamical information counterpart of global integration and that of local segregation are the harmonic flow and the curl flow, respectively, and that a part of the small-world region is dominated by internal circulation of information flow.

Hodge decomposition of information flow on small-world networks

Directory of Open Access Journals (Sweden)

Taichi Haruna

2016-09-01

Full Text Available We investigate the influence of the small-world topology on the composition of information flow on networks. By appealing to the combinatorial Hodge theory, we decompose information flow generated by random threshold networks on the Watts-Strogatz model into three components: gradient, harmonic and curl flows. The harmonic and curl flows represent globally circular and locally circular components, respectively. The Watts-Strogatz model bridges the two extreme network topologies, a lattice network and a random network, by a single parameter that is the probability of random rewiring. The small-world topology is realized within a certain range between them. By numerical simulation we found that as networks become more random the ratio of harmonic flow to the total magnitude of information flow increases whereas the ratio of curl flow decreases. Furthermore, both quantities are significantly enhanced from the level when only network structure is considered for the network close to a random network and a lattice network, respectively. Finally, the sum of these two ratios takes its maximum value within the small-world region. These findings suggest that the dynamical information counterpart of global integration and that of local segregation are the harmonic flow and the curl flow, respectively, and that a part of the small-world region is dominated by internal circulation of information flow.

A comprehensive multi-local-world model for complex networks

International Nuclear Information System (INIS)

Fan Zhengping; Chen Guanrong; Zhang Yunong

2009-01-01

The nodes in a community within a network are much more connected to each other than to the others outside the community in the same network. This phenomenon has been commonly observed from many real-world networks, ranging from social to biological even to technical networks. Meanwhile, the number of communities in some real-world networks, such as the Internet and most social networks, are evolving with time. To model this kind of networks, the present Letter proposes a multi-local-world (MLW) model to capture and describe their essential topological properties. Based on the mean-field theory, the degree distribution of this model is obtained analytically, showing that the generated network has a novel topological feature as being not completely random nor completely scale-free but behaving somewhere between them. As a typical application, the MLW model is applied to characterize the Internet against some other models such as the BA, GBA, Fitness and HOT models, demonstrating the superiority of the new model.

Multiobjective Bak-Sneppen model on a small-world network

International Nuclear Information System (INIS)

Elettreby, M.F.

2005-01-01

Small-world networks (SWN) are relevant to biological systems. We study the dynamics of the Bak-Sneppen (BS) model on small-world network, including the concepts of extremal dynamics, multiobjective optimization and coherent noise. We find that the small-world structure stabilizes the system. Also, it is more realistic to augment the Bak-Sneppen model by these concepts

Multiobjective Bak-Sneppen model on a small-world network

International Nuclear Information System (INIS)

Elettreby, M.

2004-09-01

Small-world networks (SWN) are relevant to biological systems. We study the dynamics of the Bak-Sneppen (BS) model on small-world network, including the concepts of extremal dynamics, multiobjective optimization and coherent noise. We find that the small-world structure stabilizes the system. Also, it is more realistic to augment the Bak-Sneppen model by these concepts. (author)

Local stability and Hopf bifurcation in small-world delayed networks

International Nuclear Information System (INIS)

Li Chunguang; Chen Guanrong

2004-01-01

The notion of small-world networks, recently introduced by Watts and Strogatz, has attracted increasing interest in studying the interesting properties of complex networks. Notice that, a signal or influence travelling on a small-world network often is associated with time-delay features, which are very common in biological and physical networks. Also, the interactions within nodes in a small-world network are often nonlinear. In this paper, we consider a small-world networks model with nonlinear interactions and time delays, which was recently considered by Yang. By choosing the nonlinear interaction strength as a bifurcation parameter, we prove that Hopf bifurcation occurs. We determine the stability of the bifurcating periodic solutions and the direction of the Hopf bifurcation by applying the normal form theory and the center manifold theorem. Finally, we show a numerical example to verify the theoretical analysis

Local stability and Hopf bifurcation in small-world delayed networks

Energy Technology Data Exchange (ETDEWEB)

Li Chunguang E-mail: cgli@uestc.edu.cn; Chen Guanrong E-mail: gchen@ee.cityu.edu.hk

2004-04-01

The notion of small-world networks, recently introduced by Watts and Strogatz, has attracted increasing interest in studying the interesting properties of complex networks. Notice that, a signal or influence travelling on a small-world network often is associated with time-delay features, which are very common in biological and physical networks. Also, the interactions within nodes in a small-world network are often nonlinear. In this paper, we consider a small-world networks model with nonlinear interactions and time delays, which was recently considered by Yang. By choosing the nonlinear interaction strength as a bifurcation parameter, we prove that Hopf bifurcation occurs. We determine the stability of the bifurcating periodic solutions and the direction of the Hopf bifurcation by applying the normal form theory and the center manifold theorem. Finally, we show a numerical example to verify the theoretical analysis.

Fastest learning in small-world neural networks

International Nuclear Information System (INIS)

Simard, D.; Nadeau, L.; Kroeger, H.

2005-01-01

We investigate supervised learning in neural networks. We consider a multi-layered feed-forward network with back propagation. We find that the network of small-world connectivity reduces the learning error and learning time when compared to the networks of regular or random connectivity. Our study has potential applications in the domain of data-mining, image processing, speech recognition, and pattern recognition

Searching in small-world networks

International Nuclear Information System (INIS)

Moura, Alessandro P.S. de; Motter, Adilson E.; Grebogi, Celso

2003-01-01

We study the average time it takes to find a desired node in the Watts-Strogatz family of networks. We consider the case when the look-up time can be neglected and when it is important, where the look-up time is the time needed to choose one among all the neighboring nodes of a node at each step in the search. We show that in both cases, the search time is minimum in the small-world regime, when an appropriate distance between the nodes is defined. Through an analytical model, we show that the search time scales as N 1/D(D+1) for small-world networks, where N is the number of nodes and D is the dimension of the underlying lattice. This model is shown to be in agreement with numerical simulations

Optimal network structure to induce the maximal small-world effect

International Nuclear Information System (INIS)

Zhang Zheng-Zhen; Xu Wen-Jun; Lin Jia-Ru; Zeng Shang-You

2014-01-01

In this paper, the general efficiency, which is the average of the global efficiency and the local efficiency, is defined to measure the communication efficiency of a network. The increasing ratio of the general efficiency of a small-world network relative to that of the corresponding regular network is used to measure the small-world effect quantitatively. The more considerable the small-world effect, the higher the general efficiency of a network with a certain cost is. It is shown that the small-world effect increases monotonically with the increase of the vertex number. The optimal rewiring probability to induce the best small-world effect is approximately 0.02 and the optimal average connection probability decreases monotonically with the increase of the vertex number. Therefore, the optimal network structure to induce the maximal small-world effect is the structure with the large vertex number (> 500), the small rewiring probability (≍ 0.02) and the small average connection probability (< 0.1). Many previous research results support our results. (interdisciplinary physics and related areas of science and technology)

Constructing a Watts-Strogatz network from a small-world network with symmetric degree distribution.

Directory of Open Access Journals (Sweden)

Mozart B C Menezes

Full Text Available Though the small-world phenomenon is widespread in many real networks, it is still challenging to replicate a large network at the full scale for further study on its structure and dynamics when sufficient data are not readily available. We propose a method to construct a Watts-Strogatz network using a sample from a small-world network with symmetric degree distribution. Our method yields an estimated degree distribution which fits closely with that of a Watts-Strogatz network and leads into accurate estimates of network metrics such as clustering coefficient and degree of separation. We observe that the accuracy of our method increases as network size increases.

Constructing a Watts-Strogatz network from a small-world network with symmetric degree distribution.

Science.gov (United States)

Menezes, Mozart B C; Kim, Seokjin; Huang, Rongbing

2017-01-01

Though the small-world phenomenon is widespread in many real networks, it is still challenging to replicate a large network at the full scale for further study on its structure and dynamics when sufficient data are not readily available. We propose a method to construct a Watts-Strogatz network using a sample from a small-world network with symmetric degree distribution. Our method yields an estimated degree distribution which fits closely with that of a Watts-Strogatz network and leads into accurate estimates of network metrics such as clustering coefficient and degree of separation. We observe that the accuracy of our method increases as network size increases.

Spatial prisoner's dilemma optimally played in small-world networks

International Nuclear Information System (INIS)

Masuda, Naoki; Aihara, Kazuyuki

2003-01-01

Cooperation is commonly found in ecological and social systems even when it apparently seems that individuals can benefit from selfish behavior. We investigate how cooperation emerges with the spatial prisoner's dilemma played in a class of networks ranging from regular lattices to random networks. We find that, among these networks, small-world topology is the optimal structure when we take into account the speed at which cooperative behavior propagates. Our results may explain why the small-world properties are self-organized in real networks

5th International Workshop on Real-World Wireless Sensor Networks

CERN Document Server

Hu, Wen; Ferrari, Federico; Zimmerling, Marco; Mottola, Luca

2014-01-01

This edited book presents the results of the 5th Workshop on Real-world Wireless Sensor Networks (REALWSN). The purpose of this workshop  was to bring together researchers and practitioners working in the area of sensor networks, with focus on real-world experiments or deployments of wireless sensor networks. Included were, nonetheless, emerging forms of sensing such as those that leverage smart phones, Internet of Things, RFIDs, and robots. Indeed, when working with real-world experiments or deployments, many new or unforeseen issues may arise: the network environment may be composed of a variety of different technologies, leading to very heterogeneous network structures; software development for large scale networks poses new types of problems; the performance of prototype networks may differ significantly from the deployed system; whereas actual sensor network deployments may need a complex combination of autonomous and manual configuration. Furthermore, results obtained through simulation are typically n...

Damage Spreading in Spatial and Small-world Random Boolean Networks

Energy Technology Data Exchange (ETDEWEB)

Lu, Qiming [Fermilab; Teuscher, Christof [Portland State U.

2014-02-18

The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\\bar{K} \\ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

Applications of Temporal Graph Metrics to Real-World Networks

Science.gov (United States)

Tang, John; Leontiadis, Ilias; Scellato, Salvatore; Nicosia, Vincenzo; Mascolo, Cecilia; Musolesi, Mirco; Latora, Vito

Real world networks exhibit rich temporal information: friends are added and removed over time in online social networks; the seasons dictate the predator-prey relationship in food webs; and the propagation of a virus depends on the network of human contacts throughout the day. Recent studies have demonstrated that static network analysis is perhaps unsuitable in the study of real world network since static paths ignore time order, which, in turn, results in static shortest paths overestimating available links and underestimating their true corresponding lengths. Temporal extensions to centrality and efficiency metrics based on temporal shortest paths have also been proposed. Firstly, we analyse the roles of key individuals of a corporate network ranked according to temporal centrality within the context of a bankruptcy scandal; secondly, we present how such temporal metrics can be used to study the robustness of temporal networks in presence of random errors and intelligent attacks; thirdly, we study containment schemes for mobile phone malware which can spread via short range radio, similar to biological viruses; finally, we study how the temporal network structure of human interactions can be exploited to effectively immunise human populations. Through these applications we demonstrate that temporal metrics provide a more accurate and effective analysis of real-world networks compared to their static counterparts.

A game-theoretic approach to optimize ad hoc networks inspired by small-world network topology

Science.gov (United States)

Tan, Mian; Yang, Tinghong; Chen, Xing; Yang, Gang; Zhu, Guoqing; Holme, Petter; Zhao, Jing

2018-03-01

Nodes in ad hoc networks are connected in a self-organized manner. Limited communication radius makes information transmit in multi-hop mode, and each forwarding needs to consume the energy of nodes. Insufficient communication radius or exhaustion of energy may cause the absence of some relay nodes and links, further breaking network connectivity. On the other hand, nodes in the network may refuse to cooperate due to objective faulty or personal selfish, hindering regular communication in the network. This paper proposes a model called Repeated Game in Small World Networks (RGSWN). In this model, we first construct ad hoc networks with small-world feature by forming "communication shortcuts" between multiple-radio nodes. Small characteristic path length reduces average forwarding times in networks; meanwhile high clustering coefficient enhances network robustness. Such networks still maintain relative low global power consumption, which is beneficial to extend the network survival time. Then we use MTTFT strategy (Mend-Tolerance Tit-for-Tat) for repeated game as a rule for the interactions between neighbors in the small-world networks. Compared with other five strategies of repeated game, this strategy not only punishes the nodes' selfishness more reasonably, but also has the best tolerance to the network failure. This work is insightful for designing an efficient and robust ad hoc network.

Blackmail propagation on small-world networks

Science.gov (United States)

Shao, Zhi-Gang; Jian-Ping Sang; Zou, Xian-Wu; Tan, Zhi-Jie; Jin, Zhun-Zhi

2005-06-01

The dynamics of the blackmail propagation model based on small-world networks is investigated. It is found that for a given transmitting probability λ the dynamical behavior of blackmail propagation transits from linear growth type to logistical growth one with the network randomness p increases. The transition takes place at the critical network randomness pc=1/N, where N is the total number of nodes in the network. For a given network randomness p the dynamical behavior of blackmail propagation transits from exponential decrease type to logistical growth one with the transmitting probability λ increases. The transition occurs at the critical transmitting probability λc=1/, where is the average number of the nearest neighbors. The present work will be useful for understanding computer virus epidemics and other spreading phenomena on communication and social networks.

Storage capacity and retrieval time of small-world neural networks

International Nuclear Information System (INIS)

Oshima, Hiraku; Odagaki, Takashi

2007-01-01

To understand the influence of structure on the function of neural networks, we study the storage capacity and the retrieval time of Hopfield-type neural networks for four network structures: regular, small world, random networks generated by the Watts-Strogatz (WS) model, and the same network as the neural network of the nematode Caenorhabditis elegans. Using computer simulations, we find that (1) as the randomness of network is increased, its storage capacity is enhanced; (2) the retrieval time of WS networks does not depend on the network structure, but the retrieval time of C. elegans's neural network is longer than that of WS networks; (3) the storage capacity of the C. elegans network is smaller than that of networks generated by the WS model, though the neural network of C. elegans is considered to be a small-world network

Dynamics in small worlds of tree topologies of wireless sensor networks

DEFF Research Database (Denmark)

Li, Qiao; Zhang, Baihai; Fan, Zhun

2012-01-01

Tree topologies, which construct spatial graphs with large characteristic path lengths and small clustering coefficients, are ubiquitous in deployments of wireless sensor networks. Small worlds are investigated in tree-based networks. Due to link additions, characteristic path lengths reduce...... rapidly and clustering coefficients increase greatly. A tree abstract, Cayley tree, is considered for the study of the navigation algorithm, which runs automatically in the small worlds of tree-based networks. In the further study, epidemics in the small worlds of tree-based wireless sensor networks...

Small-world human brain networks: Perspectives and challenges.

Science.gov (United States)

Liao, Xuhong; Vasilakos, Athanasios V; He, Yong

2017-06-01

Modelling the human brain as a complex network has provided a powerful mathematical framework to characterize the structural and functional architectures of the brain. In the past decade, the combination of non-invasive neuroimaging techniques and graph theoretical approaches enable us to map human structural and functional connectivity patterns (i.e., connectome) at the macroscopic level. One of the most influential findings is that human brain networks exhibit prominent small-world organization. Such a network architecture in the human brain facilitates efficient information segregation and integration at low wiring and energy costs, which presumably results from natural selection under the pressure of a cost-efficiency balance. Moreover, the small-world organization undergoes continuous changes during normal development and ageing and exhibits dramatic alterations in neurological and psychiatric disorders. In this review, we survey recent advances regarding the small-world architecture in human brain networks and highlight the potential implications and applications in multidisciplinary fields, including cognitive neuroscience, medicine and engineering. Finally, we highlight several challenging issues and areas for future research in this rapidly growing field. Copyright © 2017 Elsevier Ltd. All rights reserved.

A small-world network model of facial emotion recognition.

Science.gov (United States)

Takehara, Takuma; Ochiai, Fumio; Suzuki, Naoto

2016-01-01

Various models have been proposed to increase understanding of the cognitive basis of facial emotions. Despite those efforts, interactions between facial emotions have received minimal attention. If collective behaviours relating to each facial emotion in the comprehensive cognitive system could be assumed, specific facial emotion relationship patterns might emerge. In this study, we demonstrate that the frameworks of complex networks can effectively capture those patterns. We generate 81 facial emotion images (6 prototypes and 75 morphs) and then ask participants to rate degrees of similarity in 3240 facial emotion pairs in a paired comparison task. A facial emotion network constructed on the basis of similarity clearly forms a small-world network, which features an extremely short average network distance and close connectivity. Further, even if two facial emotions have opposing valences, they are connected within only two steps. In addition, we show that intermediary morphs are crucial for maintaining full network integration, whereas prototypes are not at all important. These results suggest the existence of collective behaviours in the cognitive systems of facial emotions and also describe why people can efficiently recognize facial emotions in terms of information transmission and propagation. For comparison, we construct three simulated networks--one based on the categorical model, one based on the dimensional model, and one random network. The results reveal that small-world connectivity in facial emotion networks is apparently different from those networks, suggesting that a small-world network is the most suitable model for capturing the cognitive basis of facial emotions.

Hyperbolicity measures democracy in real-world networks

Science.gov (United States)

Borassi, Michele; Chessa, Alessandro; Caldarelli, Guido

2015-09-01

In this work, we analyze the hyperbolicity of real-world networks, a geometric quantity that measures if a space is negatively curved. We provide two improvements in our understanding of this quantity: first of all, in our interpretation, a hyperbolic network is "aristocratic", since few elements "connect" the system, while a non-hyperbolic network has a more "democratic" structure with a larger number of crucial elements. The second contribution is the introduction of the average hyperbolicity of the neighbors of a given node. Through this definition, we outline an "influence area" for the vertices in the graph. We show that in real networks the influence area of the highest degree vertex is small in what we define "local" networks (i.e., social or peer-to-peer networks), and large in "global" networks (i.e., power grid, metabolic networks, or autonomous system networks).

Small-world network effects on innovation: evidences from nanotechnology patenting

Energy Technology Data Exchange (ETDEWEB)

Shi, Yuan [University of Maryland, Robert H. Smith School of Business (United States); Guan, JianCheng, E-mail: guanjianch@ucas.ac.cn [University of Chinese Academy of Sciences, School of Economics and Management (China)

2016-11-15

This paper explores the effects of collaboration network on innovation in nanotechnology. We extend the idea of small-world to the heterogeneous network positions of actors by capturing the variation of how closely a given actor is connected to others in the same network and how clustered its neighbors are. We test the effects of small-world network in the context of nanotechnology patenting in China. Empirical results reveal that small-worldness, or the co-existence of high clustering and low path length in the network, displays inverse U-shape relationships with future patent output of the individual inventors and the system. Interestingly, the inflection point of the nonlinear relationship is significantly higher at the individual level. Based on these findings, we suggest that researchers of nanotechnology maintain a balance between friends in close-knit inner circles and colleagues in distant areas in their collaboration decisions and that policymakers interested in furthering the field offer collaboration opportunities for researchers in distant locations and areas.

Small-world network effects on innovation: evidences from nanotechnology patenting

International Nuclear Information System (INIS)

Shi, Yuan; Guan, JianCheng

2016-01-01

This paper explores the effects of collaboration network on innovation in nanotechnology. We extend the idea of small-world to the heterogeneous network positions of actors by capturing the variation of how closely a given actor is connected to others in the same network and how clustered its neighbors are. We test the effects of small-world network in the context of nanotechnology patenting in China. Empirical results reveal that small-worldness, or the co-existence of high clustering and low path length in the network, displays inverse U-shape relationships with future patent output of the individual inventors and the system. Interestingly, the inflection point of the nonlinear relationship is significantly higher at the individual level. Based on these findings, we suggest that researchers of nanotechnology maintain a balance between friends in close-knit inner circles and colleagues in distant areas in their collaboration decisions and that policymakers interested in furthering the field offer collaboration opportunities for researchers in distant locations and areas.

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.

An effective method to improve the robustness of small-world networks under attack

International Nuclear Information System (INIS)

Zhang Zheng-Zhen; Xu Wen-Jun; Lin Jia-Ru; Zeng Shang-You

2014-01-01

In this study, the robustness of small-world networks to three types of attack is investigated. Global efficiency is introduced as the network coefficient to measure the robustness of a small-world network. The simulation results prove that an increase in rewiring probability or average degree can enhance the robustness of the small-world network under all three types of attack. The effectiveness of simultaneously increasing both rewiring probability and average degree is also studied, and the combined increase is found to significantly improve the robustness of the small-world network. Furthermore, the combined effect of rewiring probability and average degree on network robustness is shown to be several times greater than that of rewiring probability or average degree individually. This means that small-world networks with a relatively high rewiring probability and average degree have advantages both in network communications and in good robustness to attacks. Therefore, simultaneously increasing rewiring probability and average degree is an effective method of constructing realistic networks. Consequently, the proposed method is useful to construct efficient and robust networks in a realistic scenario. (interdisciplinary physics and related areas of science and technology)

Third-World Astronomy Network

Science.gov (United States)

Narlikar, Jayant V.

Several developing countries of the Third World have been actively interested in astronomy, as is evidenced by the membership of the IAU. The enthusiasm of individual astronomers from these countries is, however, not matched by the resources available to them to pursue their interest in astronomy, in teaching as well as research, at an above-threshold level. Major problems requiring solutions are (I) isolation from the mainstream work, which leads to research work which is not quite relevant or realistic, and to teaching based on outdated knowledge; (II) lack of financial resources, leading to shortage of books and journals in the library, insufficient computing power, out-of-date instruments, as well as inability to participate in essential activities like schools, workshops, and major international conferences and symposia; and (III) lack of handson experience with state-of-the-art instrumentation that often leads to good scientists being turned away from astronomical observations towards abstract theories. Experience of the International Centre for Theoretical Physics at Trieste, Italy and of the inter-university centres in India, like the IUCAA at Pune, has shown that limited resources can be made to go a long way by sharing, networking and intelligent use of communications technology. Based on the above experience, this proposal envisages setting up a Third World Astronomy Network (TWAN) under the auspices of the IAU, within the wider ICSU-umbrella with support from the UNESCO as well as participating nations. The TWAN will operate with a few key institutions as local nodal points of a wide network. The objectives of the proposed TWAN and the role of the Nodal Institutions (NIs) are spelled out in this proposal, along with the budgetary support required.

Scaling and percolation in the small-world network model

Energy Technology Data Exchange (ETDEWEB)

Newman, M. E. J. [Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, New Mexico 87501 (United States); Watts, D. J. [Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, New Mexico 87501 (United States)

1999-12-01

In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one nontrivial length-scale in the model, analogous to the correlation length in other systems, which is well-defined in the limit of infinite system size and which diverges continuously as the randomness in the network tends to zero, giving a normal critical point in this limit. This length-scale governs the crossover from large- to small-world behavior in the model, as well as the number of vertices in a neighborhood of given radius on the network. We derive the value of the single critical exponent controlling behavior in the critical region and the finite size scaling form for the average vertex-vertex distance on the network, and, using series expansion and Pade approximants, find an approximate analytic form for the scaling function. We calculate the effective dimension of small-world graphs and show that this dimension varies as a function of the length-scale on which it is measured, in a manner reminiscent of multifractals. We also study the problem of site percolation on small-world networks as a simple model of disease propagation, and derive an approximate expression for the percolation probability at which a giant component of connected vertices first forms (in epidemiological terms, the point at which an epidemic occurs). The typical cluster radius satisfies the expected finite size scaling form with a cluster size exponent close to that for a random graph. All our analytic results are confirmed by extensive numerical simulations of the model. (c) 1999 The American Physical Society.

Scaling and percolation in the small-world network model

International Nuclear Information System (INIS)

Newman, M. E. J.; Watts, D. J.

1999-01-01

In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one nontrivial length-scale in the model, analogous to the correlation length in other systems, which is well-defined in the limit of infinite system size and which diverges continuously as the randomness in the network tends to zero, giving a normal critical point in this limit. This length-scale governs the crossover from large- to small-world behavior in the model, as well as the number of vertices in a neighborhood of given radius on the network. We derive the value of the single critical exponent controlling behavior in the critical region and the finite size scaling form for the average vertex-vertex distance on the network, and, using series expansion and Pade approximants, find an approximate analytic form for the scaling function. We calculate the effective dimension of small-world graphs and show that this dimension varies as a function of the length-scale on which it is measured, in a manner reminiscent of multifractals. We also study the problem of site percolation on small-world networks as a simple model of disease propagation, and derive an approximate expression for the percolation probability at which a giant component of connected vertices first forms (in epidemiological terms, the point at which an epidemic occurs). The typical cluster radius satisfies the expected finite size scaling form with a cluster size exponent close to that for a random graph. All our analytic results are confirmed by extensive numerical simulations of the model. (c) 1999 The American Physical Society

Translocality, Network Structure, and Music Worlds: Underground Metal in the United Kingdom.

Science.gov (United States)

Emms, Rachel; Crossley, Nick

2018-02-01

Translocal music worlds are often defined as networks of local music worlds. However, their networked character and more especially their network structure is generally assumed rather than concretely mapped and explored. Formal social network analysis (SNA) is beginning to attract interest in music sociology but it has not previously been used to explore a translocal music world. In this paper, drawing upon a survey of the participation of 474 enthusiasts in 148 live music events, spread across 6 localities, we use SNA to explore a significant "slice" of the network structure of the U.K.'s translocal underground heavy metal world. Translocality is generated in a number of ways, we suggest, but one way, the way we focus upon, involves audiences traveling between localities to attend gigs and festivals. Our analysis of this network uncovers a core-periphery structure which, we further find, maps onto locality. Not all live events enjoy equal standing in our music world and some localities are better placed to capture more prestigious events, encouraging inward travel. The identification of such structures, and the inequality they point to, is, we believe, one of several benefits of using SNA to analyze translocal music worlds. © 2018 Canadian Sociological Association/La Société canadienne de sociologie.

The Evolution of World Trade from 1995 to 2014 : A Network Approach

NARCIS (Netherlands)

Cepeda, Fredy; Gamboa, Freddy; Leon Rincon, Carlos; Rincon, Hernan

2017-01-01

This paper employs network analysis to study world trade from 1995 to 2014. We focus on the main connective features of the world trade network (WTN) and their dynamics. Results suggest that countries’ efforts to attain the benefits of trade have resulted in an intertwined network that is

Robust emergence of small-world structure in networks of spiking neurons.

Science.gov (United States)

Kwok, Hoi Fei; Jurica, Peter; Raffone, Antonino; van Leeuwen, Cees

2007-03-01

Spontaneous activity in biological neural networks shows patterns of dynamic synchronization. We propose that these patterns support the formation of a small-world structure-network connectivity optimal for distributed information processing. We present numerical simulations with connected Hindmarsh-Rose neurons in which, starting from random connection distributions, small-world networks evolve as a result of applying an adaptive rewiring rule. The rule connects pairs of neurons that tend fire in synchrony, and disconnects ones that fail to synchronize. Repeated application of the rule leads to small-world structures. This mechanism is robustly observed for bursting and irregular firing regimes.

Immunizations on small worlds of tree-based wireless sensor networks

DEFF Research Database (Denmark)

Li, Qiao; Zhang, Bai-Hai; Cui, Ling-Guo

2012-01-01

, are conducted on small worlds of tree-based wireless sensor networks to combat the sensor viruses. With the former strategy, the infection extends exponentially, although the immunization effectively reduces the contagion speed. With the latter strategy, recurrent contagion oscillations occur in the small world......The sensor virus is a serious threat, as an attacker can simply send a single packet to compromise the entire sensor network. Epidemics become drastic with link additions among sensors when the small world phenomena occur. Two immunization strategies, uniform immunization and temporary immunization...

Complete and phase synchronization in a heterogeneous small-world neuronal network

International Nuclear Information System (INIS)

Fang, Han; Qi-Shao, Lu; Quan-Bao, Ji; Marian, Wiercigroch

2009-01-01

Synchronous firing of neurons is thought to be important for information communication in neuronal networks. This paper investigates the complete and phase synchronization in a heterogeneous small-world chaotic Hindmarsh–Rose neuronal network. The effects of various network parameters on synchronization behaviour are discussed with some biological explanations. Complete synchronization of small-world neuronal networks is studied theoretically by the master stability function method. It is shown that the coupling strength necessary for complete or phase synchronization decreases with the neuron number, the node degree and the connection density are increased. The effect of heterogeneity of neuronal networks is also considered and it is found that the network heterogeneity has an adverse effect on synchrony. (general)

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

Immunizations on small worlds of tree-based wireless sensor networks

International Nuclear Information System (INIS)

Li Qiao; Zhang Bai-Hai; Cui Ling-Guo; Fan Zhun; Vasilakos Athanasios, V.

2012-01-01

The sensor virus is a serious threat, as an attacker can simply send a single packet to compromise the entire sensor network. Epidemics become drastic with link additions among sensors when the small world phenomena occur. Two immunization strategies, uniform immunization and temporary immunization, are conducted on small worlds of tree-based wireless sensor networks to combat the sensor viruses. With the former strategy, the infection extends exponentially, although the immunization effectively reduces the contagion speed. With the latter strategy, recurrent contagion oscillations occur in the small world when the spatial-temporal dynamics of the epidemic are considered. The oscillations come from the small-world structure and the temporary immunization. Mathematical analyses on the small world of the Cayley tree are presented to reveal the epidemic dynamics with the two immunization strategies. (general)

Structure of Small World Innovation Network and Learning Performance

Directory of Open Access Journals (Sweden)

Shuang Song

2014-01-01

Full Text Available This paper examines the differences of learning performance of 5 MNCs (multinational corporations that filed the largest number of patents in China. We establish the innovation network with the patent coauthorship data by these 5 MNCs and classify the networks by the tail of distribution curve of connections. To make a comparison of the learning performance of these 5 MNCs with differing network structures, we develop an organization learning model by regarding the reality as having m dimensions, which denotes the heterogeneous knowledge about the reality. We further set n innovative individuals that are mutually interactive and own unique knowledge about the reality. A longer (shorter distance between the knowledge of the individual and the reality denotes a lower (higher knowledge level of that individual. Individuals interact with and learn from each other within the small-world network. By making 1,000 numerical simulations and averaging the simulated results, we find that the differing structure of the small-world network leads to the differences of learning performance between these 5 MNCs. The network monopolization negatively impacts and network connectivity positively impacts learning performance. Policy implications in the conclusion section suggest that to improve firm learning performance, it is necessary to establish a flat and connective network.

Critical behavior of the contact process on small-world networks

Science.gov (United States)

Ferreira, Ronan S.; Ferreira, Silvio C.

2013-11-01

We investigate the role of clustering on the critical behavior of the contact process (CP) on small-world networks using the Watts-Strogatz (WS) network model with an edge rewiring probability p. The critical point is well predicted by a homogeneous cluster-approximation for the limit of vanishing clustering ( p → 1). The critical exponents and dimensionless moment ratios of the CP are in agreement with those predicted by the mean-field theory for any p > 0. This independence on the network clustering shows that the small-world property is a sufficient condition for the mean-field theory to correctly predict the universality of the model. Moreover, we compare the CP dynamics on WS networks with rewiring probability p = 1 and random regular networks and show that the weak heterogeneity of the WS network slightly changes the critical point but does not alter other critical quantities of the model.

Graph analysis of structural brain networks in Alzheimer's disease: beyond small world properties.

Science.gov (United States)

John, Majnu; Ikuta, Toshikazu; Ferbinteanu, Janina

2017-03-01

Changes in brain connectivity in patients with early Alzheimer's disease (AD) have been investigated using graph analysis. However, these studies were based on small data sets, explored a limited range of network parameters, and did not focus on more restricted sub-networks, where neurodegenerative processes may introduce more prominent alterations. In this study, we constructed structural brain networks out of 87 regions using data from 135 healthy elders and 100 early AD patients selected from the Open Access Series of Imaging Studies (OASIS) database. We evaluated the graph properties of these networks by investigating metrics of network efficiency, small world properties, segregation, product measures of complexity, and entropy. Because degenerative processes take place at different rates in different brain areas, analysis restricted to sub-networks may reveal changes otherwise undetected. Therefore, we first analyzed the graph properties of a network encompassing all brain areas considered together, and then repeated the analysis after dividing the brain areas into two sub-networks constructed by applying a clustering algorithm. At the level of large scale network, the analysis did not reveal differences between AD patients and controls. In contrast, the same analysis performed on the two sub-networks revealed that small worldness diminished with AD only in the sub-network containing the areas of medial temporal lobe known to be heaviest and earliest affected. The second sub-network, which did not present significant AD-induced modifications of 'classical' small world parameters, nonetheless showed a trend towards an increase in small world propensity, a novel metric that unbiasedly quantifies small world structure. Beyond small world properties, complexity and entropy measures indicated that the intricacy of connection patterns and structural diversity decreased in both sub-networks. These results show that neurodegenerative processes impact volumetric

Small-world networks of fuzzy chaotic oscillators

CERN Document Server

Bucolo, M; Fortuna, L

2003-01-01

Small-world topology has been used to build lattices of nonlinear fuzzy systems. Chaotic units, ruled by linguistic description and with specified Lyapunov exponent, have been realized and connected using linear diffusion coefficient. The dynamic features of the networks versus the number of systems connected have been investigated to underline phenomena like spatiotemporal chaos and complete regularization. The synchronization characteristics in case of sparse long-term connections and the performances comparison with regular and random network configurations are shown.

A Markovian model of evolving world input-output network.

Directory of Open Access Journals (Sweden)

Vahid Moosavi

Full Text Available The initial theoretical connections between Leontief input-output models and Markov chains were established back in 1950s. However, considering the wide variety of mathematical properties of Markov chains, so far there has not been a full investigation of evolving world economic networks with Markov chain formalism. In this work, using the recently available world input-output database, we investigated the evolution of the world economic network from 1995 to 2011 through analysis of a time series of finite Markov chains. We assessed different aspects of this evolving system via different known properties of the Markov chains such as mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices. First, we showed how the time series of mixing times and Kemeny constants could be used as an aggregate index of globalization. Next, we focused on the steady state probabilities as a measure of structural power of the economies that are comparable to GDP shares of economies as the traditional index of economies welfare. Further, we introduced two measures of systemic risk, called systemic influence and systemic fragility, where the former is the ratio of number of influenced nodes to the total number of nodes, caused by a shock in the activity of a node, and the latter is based on the number of times a specific economic node is affected by a shock in the activity of any of the other nodes. Finally, focusing on Kemeny constant as a global indicator of monetary flow across the network, we showed that there is a paradoxical effect of a change in activity levels of economic nodes on the overall flow of the world economic network. While the economic slowdown of the majority of nodes with high structural power results to a slower average monetary flow over the network, there are some nodes, where their slowdowns improve the overall quality of the network in terms of connectivity and the average flow of the money.

A Markovian model of evolving world input-output network.

Science.gov (United States)

Moosavi, Vahid; Isacchini, Giulio

2017-01-01

The initial theoretical connections between Leontief input-output models and Markov chains were established back in 1950s. However, considering the wide variety of mathematical properties of Markov chains, so far there has not been a full investigation of evolving world economic networks with Markov chain formalism. In this work, using the recently available world input-output database, we investigated the evolution of the world economic network from 1995 to 2011 through analysis of a time series of finite Markov chains. We assessed different aspects of this evolving system via different known properties of the Markov chains such as mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices. First, we showed how the time series of mixing times and Kemeny constants could be used as an aggregate index of globalization. Next, we focused on the steady state probabilities as a measure of structural power of the economies that are comparable to GDP shares of economies as the traditional index of economies welfare. Further, we introduced two measures of systemic risk, called systemic influence and systemic fragility, where the former is the ratio of number of influenced nodes to the total number of nodes, caused by a shock in the activity of a node, and the latter is based on the number of times a specific economic node is affected by a shock in the activity of any of the other nodes. Finally, focusing on Kemeny constant as a global indicator of monetary flow across the network, we showed that there is a paradoxical effect of a change in activity levels of economic nodes on the overall flow of the world economic network. While the economic slowdown of the majority of nodes with high structural power results to a slower average monetary flow over the network, there are some nodes, where their slowdowns improve the overall quality of the network in terms of connectivity and the average flow of the money.

Model for the growth of the world airline network

Science.gov (United States)

Verma, T.; Araújo, N. A. M.; Nagler, J.; Andrade, J. S.; Herrmann, H. J.

2016-06-01

We propose a probabilistic growth model for transport networks which employs a balance between popularity of nodes and the physical distance between nodes. By comparing the degree of each node in the model network and the World Airline Network (WAN), we observe that the difference between the two is minimized for α≈2. Interestingly, this is the value obtained for the node-node correlation function in the WAN. This suggests that our model explains quite well the growth of airline networks.

Small Worlds in the Tree Topologies of Wireless Sensor Networks

DEFF Research Database (Denmark)

Qiao, Li; Lingguo, Cui; Baihai, Zhang

2010-01-01

In this study, the characteristics of small worlds are investigated in the context of the tree topologies of wireless sensor networks. Tree topologies, which construct spatial graphs with larger characteristic path lengths than random graphs and small clustering coefficients, are ubiquitous...... in wireless sensor networks. Suffering from the link rewiring or the link addition, the characteristic path length of the tree topology reduces rapidly and the clustering coefficient increases greatly. The variety of characteristic path length influences the time synchronization characteristics of wireless...... sensor networks greatly. With the increase of the link rewiring or the link addition probability, the time synchronization error decreases drastically. Two novel protocols named LEACH-SW and TREEPSI-SW are proposed to improve the performances of the sensor networks, in which the small world...

Two-dimensional small-world networks: Navigation with local information

International Nuclear Information System (INIS)

Chen Jianzhen; Liu Wei; Zhu Jianyang

2006-01-01

A navigation process is studied on a variant of the Watts-Strogatz small-world network model embedded on a square lattice. With probability p, each vertex sends out a long-range link, and the probability of the other end of this link falling on a vertex at lattice distance r away decays as r -α . Vertices on the network have knowledge of only their nearest neighbors. In a navigation process, messages are forwarded to a designated target. For α 1, a dynamic small world effect is observed, and the behavior of the scaling function at large enough pL is obtained. At α=2 and 3, this kind of scaling breaks down, and different functions of the average actual path length are obtained. For α>3, the average actual path length is nearly linear with network size

Potts Model in One-Dimension on Directed Small-World Networks

Science.gov (United States)

Aquino, Édio O.; Lima, F. W. S.; Araújo, Ascânio D.; Costa Filho, Raimundo N.

2018-06-01

The critical properties of the Potts model with q=3 and 8 states in one-dimension on directed small-world networks are investigated. This disordered system is simulated by updating it with the Monte Carlo heat bath algorithm. The Potts model on these directed small-world networks presents in fact a second-order phase transition with a new set of critical exponents for q=3 considering a rewiring probability p=0.1. For q=8 the system exhibits only a first-order phase transition independent of p.

Revealing the structure of the world airline network

Science.gov (United States)

Verma, T.; Araújo, N. A. M.; Herrmann, H. J.

2014-07-01

Resilience of most critical infrastructures against failure of elements that appear insignificant is usually taken for granted. The World Airline Network (WAN) is an infrastructure that reduces the geographical gap between societies, both small and large, and brings forth economic gains. With the extensive use of a publicly maintained data set that contains information about airports and alternative connections between these airports, we empirically reveal that the WAN is a redundant and resilient network for long distance air travel, but otherwise breaks down completely due to removal of short and apparently insignificant connections. These short range connections with moderate number of passengers and alternate flights are the connections that keep remote parts of the world accessible. It is surprising, insofar as there exists a highly resilient and strongly connected core consisting of a small fraction of airports (around 2.3%) together with an extremely fragile star-like periphery. Yet, in spite of their relevance, more than 90% of the world airports are still interconnected upon removal of this core. With standard and unconventional removal measures we compare both empirical and topological perceptions for the fragmentation of the world. We identify how the WAN is organized into different classes of clusters based on the physical proximity of airports and analyze the consequence of this fragmentation.

Synchronization of the small-world neuronal network with unreliable synapses

International Nuclear Information System (INIS)

Li, Chunguang; Zheng, Qunxian

2010-01-01

As is well known, synchronization phenomena are ubiquitous in neuronal systems. Recently a lot of work concerning the synchronization of the neuronal network has been accomplished. In these works, the synapses are usually considered reliable, but experimental results show that, in biological neuronal networks, synapses are usually unreliable. In our previous work, we have studied the synchronization of the neuronal network with unreliable synapses; however, we have not paid attention to the effect of topology on the synchronization of the neuronal network. Several recent studies have found that biological neuronal networks have typical properties of small-world networks, characterized by a short path length and high clustering coefficient. In this work, mainly based on the small-world neuronal network (SWNN) with inhibitory neurons, we study the effect of network topology on the synchronization of the neuronal network with unreliable synapses. Together with the network topology, the effects of the GABAergic reversal potential, time delay and noise are also considered. Interestingly, we found a counter-intuitive phenomenon for the SWNN with specific shortcut adding probability, that is, the less reliable the synapses, the better the synchronization performance of the SWNN. We also consider the effects of both local noise and global noise in this work. It is shown that these two different types of noise have distinct effects on the synchronization: one is negative and the other is positive

The Evolution of World Trade from 1995 to 2014: A Network Approach

OpenAIRE

Cepeda, Fredy; Gamboa, Freddy; Leon Rincon, Carlos; Rincon, Hernan

2017-01-01

This paper employs network analysis to study world trade from 1995 to 2014. We focus on the main connective features of the world trade network (WTN) and their dynamics. Results suggest that countries’ efforts to attain the benefits of trade have resulted in an intertwined network that is increasingly dense, reciprocal, and clustered. Trade linkages are distributed homogeneously among countries, but their intensity (i.e. their value) is highly concentrated in a small set of countries. The mai...

Real-world experimentation of distributed DSA network algorithms

DEFF Research Database (Denmark)

Tonelli, Oscar; Berardinelli, Gilberto; Tavares, Fernando Menezes Leitão

2013-01-01

such as a dynamic propagation environment, human presence impact and terminals mobility. This chapter focuses on the practical aspects related to the real world-experimentation with distributed DSA network algorithms over a testbed network. Challenges and solutions are extensively discussed, from the testbed design......The problem of spectrum scarcity in uncoordinated and/or heterogeneous wireless networks is the key aspect driving the research in the field of flexible management of frequency resources. In particular, distributed dynamic spectrum access (DSA) algorithms enable an efficient sharing...... to the setup of experiments. A practical example of experimentation process with a DSA algorithm is also provided....

Stochastic resonance in small-world neuronal networks with hybrid electrical–chemical synapses

International Nuclear Information System (INIS)

Wang, Jiang; Guo, Xinmeng; Yu, Haitao; Liu, Chen; Deng, Bin; Wei, Xile; Chen, Yingyuan

2014-01-01

Highlights: •We study stochastic resonance in small-world neural networks with hybrid synapses. •The resonance effect depends largely on the probability of chemical synapse. •An optimal chemical synapse probability exists to evoke network resonance. •Network topology affects the stochastic resonance in hybrid neuronal networks. - Abstract: The dependence of stochastic resonance in small-world neuronal networks with hybrid electrical–chemical synapses on the probability of chemical synapse and the rewiring probability is investigated. A subthreshold periodic signal is imposed on one single neuron within the neuronal network as a pacemaker. It is shown that, irrespective of the probability of chemical synapse, there exists a moderate intensity of external noise optimizing the response of neuronal networks to the pacemaker. Moreover, the effect of pacemaker driven stochastic resonance of the system depends largely on the probability of chemical synapse. A high probability of chemical synapse will need lower noise intensity to evoke the phenomenon of stochastic resonance in the networked neuronal systems. In addition, for fixed noise intensity, there is an optimal chemical synapse probability, which can promote the propagation of the localized subthreshold pacemaker across neural networks. And the optimal chemical synapses probability turns even larger as the coupling strength decreases. Furthermore, the small-world topology has a significant impact on the stochastic resonance in hybrid neuronal networks. It is found that increasing the rewiring probability can always enhance the stochastic resonance until it approaches the random network limit

Growing Homophilic Networks Are Natural Navigable Small Worlds.

Science.gov (United States)

Malkov, Yury A; Ponomarenko, Alexander

2016-01-01

Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of navigation properties remained unknown. We show that navigability can be achieved by using only two ingredients present in the majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks. A very simple algorithm produces hierarchical self-similar optimally wired navigable small world networks with exponential degree distribution by using only local information. Adding preferential attachment produces a scale-free network which has shorter greedy paths, but worse (power law) scaling of the information extraction locality (algorithmic complexity of a search). Introducing saturation of the preferential attachment leads to truncated scale-free degree distribution that offers a good tradeoff between these parameters and can be useful for practical applications. Several features of the model are observed in real-life networks, in particular in the brain neural networks, supporting the earlier suggestions that they are navigable.

Growing Homophilic Networks Are Natural Navigable Small Worlds.

Directory of Open Access Journals (Sweden)

Yury A Malkov

Full Text Available Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of navigation properties remained unknown. We show that navigability can be achieved by using only two ingredients present in the majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks. A very simple algorithm produces hierarchical self-similar optimally wired navigable small world networks with exponential degree distribution by using only local information. Adding preferential attachment produces a scale-free network which has shorter greedy paths, but worse (power law scaling of the information extraction locality (algorithmic complexity of a search. Introducing saturation of the preferential attachment leads to truncated scale-free degree distribution that offers a good tradeoff between these parameters and can be useful for practical applications. Several features of the model are observed in real-life networks, in particular in the brain neural networks, supporting the earlier suggestions that they are navigable.

Current redistribution in resistor networks: Fat-tail statistics in regular and small-world networks.

Science.gov (United States)

Lehmann, Jörg; Bernasconi, Jakob

2017-03-01

The redistribution of electrical currents in resistor networks after single-bond failures is analyzed in terms of current-redistribution factors that are shown to depend only on the topology of the network and on the values of the bond resistances. We investigate the properties of these current-redistribution factors for regular network topologies (e.g., d-dimensional hypercubic lattices) as well as for small-world networks. In particular, we find that the statistics of the current redistribution factors exhibits a fat-tail behavior, which reflects the long-range nature of the current redistribution as determined by Kirchhoff's circuit laws.

Complex Behavior in a Selective Aging Neuron Model Based on Small World Networks

International Nuclear Information System (INIS)

Zhang Guiqing; Chen Tianlun

2008-01-01

Complex behavior in a selective aging simple neuron model based on small world networks is investigated. The basic elements of the model are endowed with the main features of a neuron function. The structure of the selective aging neuron model is discussed. We also give some properties of the new network and find that the neuron model displays a power-law behavior. If the brain network is small world-like network, the mean avalanche size is almost the same unless the aging parameter is big enough.

Phase multistability in a dynamical small world network

Energy Technology Data Exchange (ETDEWEB)

Shabunin, A. V., E-mail: shabuninav@info.sgu.ru [Radiophysics and Nonlinear Dynamics Department, Saratov State University, Saratov (Russian Federation)

2015-01-15

The effect of phase multistability is explored in a small world network of periodic oscillators with diffusive couplings. The structure of the network represents a ring with additional non-local links, which spontaneously arise and vanish between arbitrary nodes. The dynamics of random couplings is modeled by “birth” and “death” stochastic processes by means of the cellular automate approach. The evolution of the network under gradual increasing of the number of random couplings goes through stages of phases fluctuations and spatial cluster formation. Finally, in the presence of non-local couplings the phase multistability “dies” and only the in-phase regime survives.

Force10 networks performance in world's first transcontinental 10 gigabit ethernet network verified by Ixia

CERN Multimedia

2003-01-01

Force10 Networks, Inc., today announced that the performance of the Force10 E-Series switch/routers deployed in a transcontinental network has been verified as line-rate 10 GE throughput by Ixia, a leading provider of high-speed, network performance and conformance analysis systems. The network, the world's first transcontinental 10 GE wide area network, consists of a SURFnet OC-192 lambda between Geneva and the StarLight facility in Chicago via Amsterdam and another OC-192 lambda between this same facility in Chicago and Carleton University in Ottawa, Canada provided by CANARIE and ORANO (1/2 page).

Multiplicative Attribute Graph Model of Real-World Networks

Energy Technology Data Exchange (ETDEWEB)

Kim, Myunghwan [Stanford Univ., CA (United States); Leskovec, Jure [Stanford Univ., CA (United States)

2010-10-20

Large scale real-world network data, such as social networks, Internet andWeb graphs, is ubiquitous in a variety of scientific domains. The study of such social and information networks commonly finds patterns and explain their emergence through tractable models. In most networks, especially in social networks, nodes also have a rich set of attributes (e.g., age, gender) associatedwith them. However, most of the existing network models focus only on modeling the network structure while ignoring the features of nodes in the network. Here we present a class of network models that we refer to as the Multiplicative Attribute Graphs (MAG), which naturally captures the interactions between the network structure and node attributes. We consider a model where each node has a vector of categorical features associated with it. The probability of an edge between a pair of nodes then depends on the product of individual attributeattribute similarities. The model yields itself to mathematical analysis as well as fit to real data. We derive thresholds for the connectivity, the emergence of the giant connected component, and show that the model gives rise to graphs with a constant diameter. Moreover, we analyze the degree distribution to show that the model can produce networks with either lognormal or power-law degree distribution depending on certain conditions.

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.

Small-worldness characteristics and its gender relation in specific hemispheric networks.

Science.gov (United States)

Miraglia, F; Vecchio, F; Bramanti, P; Rossini, P M

2015-12-03

Aim of this study was to verify whether the topological organization of human brain functional networks is different for males and females in resting state EEGs. Undirected and weighted brain networks were computed by eLORETA lagged linear connectivity in 130 subjects (59 males and 71 females) within each hemisphere and in four resting state networks (Attentional Network (AN), Frontal Network (FN), Sensorimotor Network (SN), Default Mode Network (DMN)). We found that small-world (SW) architecture in the left hemisphere Frontal network presented differences in both delta and alpha band, in particular lower values in delta and higher in alpha 2 in males respect to females while in the right hemisphere differences were found in lower values of SW in males respect to females in gamma Attentional, delta Sensorimotor and delta and gamma DMNs. Gender small-worldness differences in some of resting state networks indicated that there are specific brain differences in the EEG rhythms when the brain is in the resting-state condition. These specific regions could be considered related to the functions of behavior and cognition and should be taken into account both for research on healthy and brain diseased subjects. Copyright © 2015 IBRO. Published by Elsevier Ltd. All rights reserved.

Small-world organization of self-similar modules in functional brain networks

Science.gov (United States)

Sigman, Mariano; Gallos, Lazaros; Makse, Hernan

2012-02-01

The modular organization of the brain implies the parallel nature of brain computations. These modules have to remain functionally independent, but at the same time they need to be sufficiently connected to guarantee the unitary nature of brain perception. Small-world architectures have been suggested as probable structures explaining this behavior. However, there is intrinsic tension between shortcuts generating small-worlds and the persistence of modularity. In this talk, we study correlations between the activity in different brain areas. We suggest that the functional brain network formed by the percolation of strong links is highly modular. Contrary to the common view, modules are self-similar and therefore are very far from being small-world. Incorporating the weak ties to the network converts it into a small-world preserving an underlying backbone of well-defined modules. Weak ties are shown to follow a pattern that maximizes information transfer with minimal wiring costs. This architecture is reminiscent of the concept of weak-ties strength in social networks and provides a natural solution to the puzzle of efficient infomration flow in the highly modular structure of the brain.

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

Phase synchronization on small-world networks with community structure

International Nuclear Information System (INIS)

Xiao-Hua, Wang; Li-Cheng, Jiao; Jian-She, Wu

2010-01-01

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

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

ATLAS WORLD-cloud and networking in PanDA

Science.gov (United States)

Barreiro Megino, F.; De, K.; Di Girolamo, A.; Maeno, T.; Walker, R.; ATLAS Collaboration

2017-10-01

The ATLAS computing model was originally designed as static clouds (usually national or geographical groupings of sites) around the Tier 1 centres, which confined tasks and most of the data traffic. Since those early days, the sites’ network bandwidth has increased at 0(1000) and the difference in functionalities between Tier 1s and Tier 2s has reduced. After years of manual, intermediate solutions, we have now ramped up to full usage of World-cloud, the latest step in the PanDA Workload Management System to increase resource utilization on the ATLAS Grid, for all workflows (MC production, data (re)processing, etc.). We have based the development on two new site concepts. Nuclei sites are the Tier 1s and large Tier 2s, where tasks will be assigned and the output aggregated, and satellites are the sites that will execute the jobs and send the output to their nucleus. PanDA dynamically pairs nuclei and satellite sites for each task based on the input data availability, capability matching, site load and network connectivity. This contribution will introduce the conceptual changes for World-cloud, the development necessary in PanDA, an insight into the network model and the first half-year of operational experience.

An Investigation of the Differences and Similarities between Generated Small-World Networks for Right- and Left-Hand Motor Imageries.

Science.gov (United States)

Zhang, Jiang; Li, Yuyao; Chen, Huafu; Ding, Jurong; Yuan, Zhen

2016-11-04

In this study, small-world network analysis was performed to identify the similarities and differences between functional brain networks for right- and left-hand motor imageries (MIs). First, Pearson correlation coefficients among the nodes within the functional brain networks from healthy subjects were calculated. Then, small-world network indicators, including the clustering coefficient, the average path length, the global efficiency, the local efficiency, the average node degree, and the small-world index, were generated for the functional brain networks during both right- and left-hand MIs. We identified large differences in the small-world network indicators between the functional networks during MI and in the random networks. More importantly, the functional brain networks underlying the right- and left-hand MIs exhibited similar small-world properties in terms of the clustering coefficient, the average path length, the global efficiency, and the local efficiency. By contrast, the right- and left-hand MI brain networks showed differences in small-world characteristics, including indicators such as the average node degree and the small-world index. Interestingly, our findings also suggested that the differences in the activity intensity and range, the average node degree, and the small-world index of brain networks between the right- and left-hand MIs were associated with the asymmetry of brain functions.

The Topological Analysis of Urban Transit System as a Small-World Network

OpenAIRE

Zhaosheng Yang; Huxing Zhou; Peng Gao; Hong Chen; Nan Zhang

2011-01-01

This paper proposes a topological analysis of urban transit system based on a functional representation network constructed from the urban transit system in Beijing. The representation gives a functional view on nodes named a transit line. Statistical measures are computed and introduced in complex network analysis. It shows that the urban transit system forms small-world networks and exhibits properties different from random networks and regular networks. Furthermore, the topological propert...

Network resilience to real-world disasters: Eyjafjallajökull and 9/11

Science.gov (United States)

Woolley, Olivia; Thiemann, Christian; Grady, Daniel; Brockmann, Dirk

2011-03-01

We investigate the resilience of the the world-wide air transportation network (WAN) to the 9/11 terrorist attacks and the recent eruption of the volcano Eyjafjallajökull. Although both disasters caused wide-spread disruption, the number of airports that were closed and the volume of interrupted traffic were well below the percolation threshold predicted by the classical theory. In order to quantify and visualize network deformation before breakdown, we introduce a framework based on the increase in shortest-path distance and homogenization of shortest-path structure. These real-world disasters are a new type of disruption because the removal of all vertices (airports) is geographically compact. Our framework incorporates the dual perspective of individual airports and geopolitical regions to capture how the impact interacts with the sub-network structure.We find that real-world events have an impact signature which is qualitatively different from that of random or high-centrality attacks. Furthermore, we find that the network is more resilient to the 9/11 disaster, although it removed more airports and traffic than the volcanic ash-cloud. This is due to the network roles of Europe and North America. We discuss how regional roles influence resilience to a region's removal.

Extraction of network topology from multi-electrode recordings: Is there a small-world effect?

Directory of Open Access Journals (Sweden)

Felipe eGerhard

2011-02-01

Full Text Available The simultaneous recording of the activity of many neurons poses challenges for multivariate data analysis. Here, we propose a general scheme of reconstruction of the functional network from spike train recordings. Effective, causal interactions are estimated by fitting Generalized Linear Models (GLMs on the neural responses, incorporating effects of the neurons' self-history, of input from other neurons in the recorded network and of modulation by an external stimulus. The coupling terms arising from synaptic input can be transformed by thresholding into a binary connectivity matrix which is directed. Each link between two neurons represents a causal influence from one neuron to the other, given the observation of all other neurons from the population. The resulting graph is analyzed with respect to small-world and scale-free properties using quantitative measures for directed networks. Such graph-theoretic analyses have been performed on many complex dynamic networks, including the connectivity structure between different brain areas. Only few studies have attempted to look at the structure of cortical neural networks on the level of individual neurons. Here, using multi-electrode recordings from the visual system of the awake monkey, we find that cortical networks lack scale-free behavior, but show a small, but significant small-world structure. Assuming a simple distance-dependent probabilistic wiring between neurons, we find that this connectivity structure can account for all of the networks' observed small-world-ness. Moreover, for multi-electrode recordings the sampling of neurons is not uniform across the population. We show that the small-world-ness obtained by such a localized sub-sampling overestimates the strength of the true small-world-structure of the network. This bias is likely to be present in all previous experiments based on multi-electrode recordings.

Efficient network reconstruction from dynamical cascades identifies small-world topology of neuronal avalanches.

Directory of Open Access Journals (Sweden)

Sinisa Pajevic

2009-01-01

Full Text Available Cascading activity is commonly found in complex systems with directed interactions such as metabolic networks, neuronal networks, or disease spreading in social networks. Substantial insight into a system's organization can be obtained by reconstructing the underlying functional network architecture from the observed activity cascades. Here we focus on Bayesian approaches and reduce their computational demands by introducing the Iterative Bayesian (IB and Posterior Weighted Averaging (PWA methods. We introduce a special case of PWA, cast in nonparametric form, which we call the normalized count (NC algorithm. NC efficiently reconstructs random and small-world functional network topologies and architectures from subcritical, critical, and supercritical cascading dynamics and yields significant improvements over commonly used correlation methods. With experimental data, NC identified a functional and structural small-world topology and its corresponding traffic in cortical networks with neuronal avalanche dynamics.

Cognition Is Related to Resting-State Small-World Network Topology: An Magnetoencephalographic Study

NARCIS (Netherlands)

Douw, L.; Schoonheim, M.M.; Landi, D.; van der Meer, M.L.; Geurts, J.J.G.; Reijneveld, J.C.; Klein, M.; Stam, C.J.

2011-01-01

Brain networks and cognition have recently begun to attract attention: studies suggest that more efficiently wired resting-state brain networks are indeed correlated with better cognitive performance. "Small-world" brain networks combine local segregation with global integration, hereby subserving

Spiral Wave in Small-World Networks of Hodgkin-Huxley Neurons

International Nuclear Information System (INIS)

Ma Jun; Zhang Cairong; Yang Lijian; Wu Ying

2010-01-01

The effect of small-world connection and noise on the formation and transition of spiral wave in the networks of Hodgkin-Huxley neurons are investigated in detail. Some interesting results are found in our numerical studies. i) The quiescent neurons are activated to propagate electric signal to others by generating and developing spiral wave from spiral seed in small area. ii) A statistical factor is defined to describe the collective properties and phase transition induced by the topology of networks and noise. iii) Stable rotating spiral wave can be generated and keeps robust when the rewiring probability is below certain threshold, otherwise, spiral wave can not be developed from the spiral seed and spiral wave breakup occurs for a stable rotating spiral wave. iv) Gaussian white noise is introduced on the membrane of neurons to study the noise-induced phase transition on spiral wave in small-world networks of neurons. It is confirmed that Gaussian white noise plays active role in supporting and developing spiral wave in the networks of neurons, and appearance of smaller factor of synchronization indicates high possibility to induce spiral wave. (interdisciplinary physics and related areas of science and technology)

Impaired small-world network efficiency and dynamic functional distribution in patients with cirrhosis.

Directory of Open Access Journals (Sweden)

Tun-Wei Hsu

Full Text Available Hepatic encephalopathy (HE is a complex neuropsychiatric syndrome and a major complication of liver cirrhosis. Dysmetabolism of the brain, related to elevated ammonia levels, interferes with intercortical connectivity and cognitive function. For evaluation of network efficiency, a 'small-world' network model can quantify the effectiveness of information transfer within brain networks. This study aimed to use small-world topology to investigate abnormalities of neuronal connectivity among widely distributed brain regions in patients with liver cirrhosis using resting-state functional magnetic resonance imaging (rs-fMRI. Seventeen cirrhotic patients without HE, 9 with minimal HE, 9 with overt HE, and 35 healthy controls were compared. The interregional correlation matrix was obtained by averaging the rs-fMRI time series over all voxels in each of the 90 regions using the automated anatomical labeling model. Cost and correlation threshold values were then applied to construct the functional brain network. The absolute and relative network efficiencies were calculated; quantifying distinct aspects of the local and global topological network organization. Correlations between network topology parameters, ammonia levels, and the severity of HE were determined using linear regression and ANOVA. The local and global topological efficiencies of the functional connectivity network were significantly disrupted in HE patients; showing abnormal small-world properties. Alterations in regional characteristics, including nodal efficiency and nodal strength, occurred predominantly in the association, primary, and limbic/paralimbic regions. The degree of network organization disruption depended on the severity of HE. Ammonia levels were also significantly associated with the alterations in local network properties. Results indicated that alterations in the rs-fMRI network topology of the brain were associated with HE grade; and that focal or diffuse lesions

Driving and driven architectures of directed small-world human brain functional networks.

Directory of Open Access Journals (Sweden)

Chaogan Yan

Full Text Available Recently, increasing attention has been focused on the investigation of the human brain connectome that describes the patterns of structural and functional connectivity networks of the human brain. Many studies of the human connectome have demonstrated that the brain network follows a small-world topology with an intrinsically cohesive modular structure and includes several network hubs in the medial parietal regions. However, most of these studies have only focused on undirected connections between regions in which the directions of information flow are not taken into account. How the brain regions causally influence each other and how the directed network of human brain is topologically organized remain largely unknown. Here, we applied linear multivariate Granger causality analysis (GCA and graph theoretical approaches to a resting-state functional MRI dataset with a large cohort of young healthy participants (n = 86 to explore connectivity patterns of the population-based whole-brain functional directed network. This directed brain network exhibited prominent small-world properties, which obviously improved previous results of functional MRI studies showing weak small-world properties in the directed brain networks in terms of a kernel-based GCA and individual analysis. This brain network also showed significant modular structures associated with 5 well known subsystems: fronto-parietal, visual, paralimbic/limbic, subcortical and primary systems. Importantly, we identified several driving hubs predominantly located in the components of the attentional network (e.g., the inferior frontal gyrus, supplementary motor area, insula and fusiform gyrus and several driven hubs predominantly located in the components of the default mode network (e.g., the precuneus, posterior cingulate gyrus, medial prefrontal cortex and inferior parietal lobule. Further split-half analyses indicated that our results were highly reproducible between two

Constructing Social Networks from Unstructured Group Dialog in Virtual Worlds

Science.gov (United States)

Shah, Fahad; Sukthankar, Gita

Virtual worlds and massively multi-player online games are rich sources of information about large-scale teams and groups, offering the tantalizing possibility of harvesting data about group formation, social networks, and network evolution. However these environments lack many of the cues that facilitate natural language processing in other conversational settings and different types of social media. Public chat data often features players who speak simultaneously, use jargon and emoticons, and only erratically adhere to conversational norms. In this paper, we present techniques for inferring the existence of social links from unstructured conversational data collected from groups of participants in the Second Life virtual world. We present an algorithm for addressing this problem, Shallow Semantic Temporal Overlap (SSTO), that combines temporal and language information to create directional links between participants, and a second approach that relies on temporal overlap alone to create undirected links between participants. Relying on temporal overlap is noisy, resulting in a low precision and networks with many extraneous links. In this paper, we demonstrate that we can ameliorate this problem by using network modularity optimization to perform community detection in the noisy networks and severing cross-community links. Although using the content of the communications still results in the best performance, community detection is effective as a noise reduction technique for eliminating the extra links created by temporal overlap alone.

A fault-tolerant small world topology control model in ad hoc networks for search and rescue

Science.gov (United States)

Tan, Mian; Fang, Ling; Wu, Yue; Zhang, Bo; Chang, Bowen; Holme, Petter; Zhao, Jing

2018-02-01

Due to their self-organized, multi-hop and distributed characteristics, ad hoc networks are useful in search and rescue. Topology control models need to be designed for energy-efficient, robust and fast communication in ad hoc networks. This paper proposes a topology control model which specializes for search and rescue-Compensation Small World-Repeated Game (CSWRG)-which integrates mobility models, constructing small world networks and a game-theoretic approach to the allocation of resources. Simulation results show that our mobility models can enhance the communication performance of the constructed small-world networks. Our strategy, based on repeated game, can suppress selfish behavior and compensate agents that encounter selfish or faulty neighbors. This model could be useful for the design of ad hoc communication networks.

Navigating the massive world of reddit: using backbone networks to map user interests in social media

Directory of Open Access Journals (Sweden)

Randal S. Olson

2015-05-01

Full Text Available In the massive online worlds of social media, users frequently rely on organizing themselves around specific topics of interest to find and engage with like-minded people. However, navigating these massive worlds and finding topics of specific interest often proves difficult because the worlds are mostly organized haphazardly, leaving users to find relevant interests by word of mouth or using a basic search feature. Here, we report on a method using the backbone of a network to create a map of the primary topics of interest in any social network. To demonstrate the method, we build an interest map for the social news web site reddit and show how such a map could be used to navigate a social media world. Moreover, we analyze the network properties of the reddit social network and find that it has a scale-free, small-world, and modular community structure, much like other online social networks such as Facebook and Twitter. We suggest that the integration of interest maps into popular social media platforms will assist users in organizing themselves into more specific interest groups, which will help alleviate the overcrowding effect often observed in large online communities.

Network worlds : from link analysis to virtual places.

Energy Technology Data Exchange (ETDEWEB)

Joslyn, C. (Cliff)

2002-01-01

Significant progress is being made in knowledge systems through recent advances in the science of very large networks. Attention is now turning in many quarters to the potential impact on counter-terrorism methods. After reviewing some of these advances, we will discuss the difference between such 'network analytic' approaches, which focus on large, homogeneous graph strucures, and what we are calling 'link analytic' approaches, which focus on somewhat smaller graphs with heterogeneous link types. We use this venue to begin the process of rigorously defining link analysis methods, especially the concept of chaining of views of multidimensional databases. We conclude with some speculation on potential connections to virtual world architectures.

Network dynamics: The World Wide Web

Science.gov (United States)

Adamic, Lada Ariana

Despite its rapidly growing and dynamic nature, the Web displays a number of strong regularities which can be understood by drawing on methods of statistical physics. This thesis finds power-law distributions in website sizes, traffic, and links, and more importantly, develops a stochastic theory which explains them. Power-law link distributions are shown to lead to network characteristics which are especially suitable for scalable localized search. It is also demonstrated that the Web is a "small world": to reach one site from any other takes an average of only 4 hops, while most related sites cluster together. Additional dynamical properties of the Web graph are extracted from diffusion processes.

Phase Transitions of an Epidemic Spreading Model in Small-World Networks

Science.gov (United States)

Hua, Da-Yin; Gao, Ke

2011-06-01

We propose a modified susceptible-infected-refractory-susceptible (SIRS) model to investigate the global oscillations of the epidemic spreading in Watts—Strogatz (WS) small-world networks. It is found that when an individual immunity does not change or decays slowly in an immune period, the system can exhibit complex transition from an infecting stationary state to a large amplitude sustained oscillation or an absorbing state with no infection. When the immunity decays rapidly in the immune period, the transition to the global oscillation disappears and there is no oscillation. Furthermore, based on the spatio-temporal evolution patterns and the phase diagram, it is disclosed that a long immunity period takes an important role in the emergence of the global oscillation in small-world networks.

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.

Small-world networks exhibit pronounced intermittent synchronization

Science.gov (United States)

Choudhary, Anshul; Mitra, Chiranjit; Kohar, Vivek; Sinha, Sudeshna; Kurths, Jürgen

2017-11-01

We report the phenomenon of temporally intermittently synchronized and desynchronized dynamics in Watts-Strogatz networks of chaotic Rössler oscillators. We consider topologies for which the master stability function (MSF) predicts stable synchronized behaviour, as the rewiring probability (p) is tuned from 0 to 1. MSF essentially utilizes the largest non-zero Lyapunov exponent transversal to the synchronization manifold in making stability considerations, thereby ignoring the other Lyapunov exponents. However, for an N-node networked dynamical system, we observe that the difference in its Lyapunov spectra (corresponding to the N - 1 directions transversal to the synchronization manifold) is crucial and serves as an indicator of the presence of intermittently synchronized behaviour. In addition to the linear stability-based (MSF) analysis, we further provide global stability estimate in terms of the fraction of state-space volume shared by the intermittently synchronized state, as p is varied from 0 to 1. This fraction becomes appreciably large in the small-world regime, which is surprising, since this limit has been otherwise considered optimal for synchronized dynamics. Finally, we characterize the nature of the observed intermittency and its dominance in state-space as network rewiring probability (p) is varied.

Google matrix of the world network of economic activities

Science.gov (United States)

Kandiah, Vivek; Escaith, Hubert; Shepelyansky, Dima L.

2015-07-01

Using the new data from the OECD-WTO world network of economic activities we construct the Google matrix G of this directed network and perform its detailed analysis. The network contains 58 countries and 37 activity sectors for years 1995 and 2008. The construction of G, based on Markov chain transitions, treats all countries on equal democratic grounds while the contribution of activity sectors is proportional to their exchange monetary volume. The Google matrix analysis allows to obtain reliable ranking of countries and activity sectors and to determine the sensitivity of CheiRank-PageRank commercial balance of countries in respect to price variations and labor cost in various countries. We demonstrate that the developed approach takes into account multiplicity of network links with economy interactions between countries and activity sectors thus being more efficient compared to the usual export-import analysis. The spectrum and eigenstates of G are also analyzed being related to specific activity communities of countries.

On the structural properties of small-world networks with range-limited shortcut links

Science.gov (United States)

Jia, Tao; Kulkarni, Rahul V.

2013-12-01

We explore a new variant of Small-World Networks (SWNs), in which an additional parameter (r) sets the length scale over which shortcuts are uniformly distributed. When r=0 we have an ordered network, whereas r=1 corresponds to the original Watts-Strogatz SWN model. These limited range SWNs have a similar degree distribution and scaling properties as the original SWN model. We observe the small-world phenomenon for r≪1, indicating that global shortcuts are not necessary for the small-world effect. For limited range SWNs, the average path length changes nonmonotonically with system size, whereas for the original SWN model it increases monotonically. We propose an expression for the average path length for limited range SWNs based on numerical simulations and analytical approximations.

Effects of spike-time-dependent plasticity on the stochastic resonance of small-world neuronal networks

Energy Technology Data Exchange (ETDEWEB)

Yu, Haitao; Guo, Xinmeng; Wang, Jiang, E-mail: jiangwang@tju.edu.cn; Deng, Bin; Wei, Xile [School of Electrical Engineering and Automation, Tianjin University, Tianjin 300072 (China)

2014-09-01

The phenomenon of stochastic resonance in Newman-Watts small-world neuronal networks is investigated when the strength of synaptic connections between neurons is adaptively adjusted by spike-time-dependent plasticity (STDP). It is shown that irrespective of the synaptic connectivity is fixed or adaptive, the phenomenon of stochastic resonance occurs. The efficiency of network stochastic resonance can be largely enhanced by STDP in the coupling process. Particularly, the resonance for adaptive coupling can reach a much larger value than that for fixed one when the noise intensity is small or intermediate. STDP with dominant depression and small temporal window ratio is more efficient for the transmission of weak external signal in small-world neuronal networks. In addition, we demonstrate that the effect of stochastic resonance can be further improved via fine-tuning of the average coupling strength of the adaptive network. Furthermore, the small-world topology can significantly affect stochastic resonance of excitable neuronal networks. It is found that there exists an optimal probability of adding links by which the noise-induced transmission of weak periodic signal peaks.

Effects of spike-time-dependent plasticity on the stochastic resonance of small-world neuronal networks

International Nuclear Information System (INIS)

Yu, Haitao; Guo, Xinmeng; Wang, Jiang; Deng, Bin; Wei, Xile

2014-01-01

The phenomenon of stochastic resonance in Newman-Watts small-world neuronal networks is investigated when the strength of synaptic connections between neurons is adaptively adjusted by spike-time-dependent plasticity (STDP). It is shown that irrespective of the synaptic connectivity is fixed or adaptive, the phenomenon of stochastic resonance occurs. The efficiency of network stochastic resonance can be largely enhanced by STDP in the coupling process. Particularly, the resonance for adaptive coupling can reach a much larger value than that for fixed one when the noise intensity is small or intermediate. STDP with dominant depression and small temporal window ratio is more efficient for the transmission of weak external signal in small-world neuronal networks. In addition, we demonstrate that the effect of stochastic resonance can be further improved via fine-tuning of the average coupling strength of the adaptive network. Furthermore, the small-world topology can significantly affect stochastic resonance of excitable neuronal networks. It is found that there exists an optimal probability of adding links by which the noise-induced transmission of weak periodic signal peaks

Power and Relation in the World Polity: The INGO Network Country Score, 1978-1998

Science.gov (United States)

Hughes, Melanie M.; Peterson, Lindsey; Harrison, Jill Ann; Paxton, Pamela

2009-01-01

World polity theory is explicitly relational, implying a global network structure that exists outside of the nation-state. And world polity theory increasingly acknowledges power--that some states and regions are dominant in the international field. But current world polity measures of international non-governmental organizations do not…

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.

Suppression of anomalous synchronization and nonstationary behavior of neural network under small-world topology

Science.gov (United States)

Boaretto, B. R. R.; Budzinski, R. C.; Prado, T. L.; Kurths, J.; Lopes, S. R.

2018-05-01

It is known that neural networks under small-world topology can present anomalous synchronization and nonstationary behavior for weak coupling regimes. Here, we propose methods to suppress the anomalous synchronization and also to diminish the nonstationary behavior occurring in weakly coupled neural network under small-world topology. We consider a network of 2000 thermally sensitive identical neurons, based on the model of Hodgkin-Huxley in a small-world topology, with the probability of adding non local connection equal to p = 0 . 001. Based on experimental protocols to suppress anomalous synchronization, as well as nonstationary behavior of the neural network dynamics, we make use of (i) external stimulus (pulsed current); (ii) biologic parameters changing (neuron membrane conductance changes); and (iii) body temperature changes. Quantification analysis to evaluate phase synchronization makes use of the Kuramoto's order parameter, while recurrence quantification analysis, particularly the determinism, computed over the easily accessible mean field of network, the local field potential (LFP), is used to evaluate nonstationary states. We show that the methods proposed can control the anomalous synchronization and nonstationarity occurring for weak coupling parameter without any effect on the individual neuron dynamics, neither in the expected asymptotic synchronized states occurring for large values of the coupling parameter.

Fitness networks for real world systems via modified preferential attachment

Science.gov (United States)

Shang, Ke-ke; Small, Michael; Yan, Wei-sheng

2017-05-01

Complex networks are virtually ubiquitous, and the Barabási and Albert model (BA model) has became an acknowledged standard for the modelling of these systems. The so-called BA model is a kind of preferential attachment growth model based on the intuitive premise that popularity is attractive. However, preferential attachment alone is insufficient to describe the diversity of complex networks observed in the real world. In this paper we first use the accuracy of a link prediction method, as a metric for network fitness. The link prediction method predicts the occurrence of links consistent with preferential attachment, the performance of this link prediction scheme is then a natural measure of the ;preferential-attachment-likeness; of a given network. We then propose several modification methods and modified BA models to construct networks which more accurately describe the fitness properties of real networks. We find that all features assortativity, degree distribution and rich-club formation can play significant roles for the network construction and eventual structure. Moreover, link sparsity and the size of a network are key factors for network reconstruction. In addition, we find that the structure of the network which is limited by geographic location (nodes are embedded in a Euclidean space and connectivity is correlated with distances) differs from other typical networks. In social networks, we observe that the high school contact network has similar structure as the friends network and so we speculate that the contact behaviours can reflect real friendships.

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

Impact of small-world network topology on the conventional artificial neural network for the diagnosis of diabetes

International Nuclear Information System (INIS)

Erkaymaz, Okan; Ozer, Mahmut

2016-01-01

Artificial intelligent systems have been widely used for diagnosis of diseases. Due to their importance, new approaches are attempted consistently to increase the performance of these systems. In this study, we introduce a new approach for diagnosis of diabetes based on the Small-World Feed Forward Artificial Neural Network (SW- FFANN). We construct the small-world network by following the Watts–Strogatz approach, and use this architecture for classifying the diabetes, and compare its performance with that of the regular or the conventional FFANN. We show that the classification performance of the SW-FFANN is better than that of the conventional FFANN. The SW-FFANN approach also results in both the highest output correlation and the best output error parameters. We also perform the accuracy analysis and show that SW-FFANN approach exhibits the highest classifier performance.

Networking to build a world-class bioenergy industry in British Columbia

Energy Technology Data Exchange (ETDEWEB)

Weedon, M. [BC Bioenergy Network, Vancouver, BC (Canada)

2009-07-01

This presentation described the role of the BC Bioenergy Network and its goal of maximizing the value of biomass resources in British Columbia (BC) and developing a world-class bioenergy industry in the province. Established in March 2008 with $25 million in funding from the BC government, the BC Bioenergy Network is an industry-led association that promotes the development of near-term bioenergy technologies and demonstration of new bioenergy technologies that are environmentally appropriate for the province of BC. The following technology areas require funding support: solid wood residues, pulp and paper residues, harvesting and pelleting, agriculture residues, municipal wastewater, municipal landfill waste, municipal solid waste, and community heating-electricity greenhouse systems. This presentation demonstrated that BC is well positioned to become a major player in the global bioenergy sector, as it has one of the largest forested areas in the world, and is a leader in biomass to value-added wood products. The opportunities, challenges, and requirements to build a world class bioenergy industry in British Columbia were discussed along with successful Canadian, US, and European collaborations with industry, research, and government. tabs., figs.

Chaos in complex motor networks induced by Newman—Watts small-world connections

International Nuclear Information System (INIS)

Wei Du-Qu; Luo Xiao-Shu; Zhang Bo

2011-01-01

We investigate how dynamical behaviours of complex motor networks depend on the Newman—Watts small-world (NWSW) connections. Network elements are described by the permanent magnet synchronous motor (PMSM) with the values of parameters at which each individual PMSM is stable. It is found that with the increase of connection probability p, the motor in networks becomes periodic and falls into chaotic motion as p further increases. These phenomena imply that NWSW connections can induce and enhance chaos in motor networks. The possible mechanism behind the action of NWSW connections is addressed based on stability theory. (interdisciplinary physics and related areas of science and technology)

Transmission of severe acute respiratory syndrome in dynamical small-world networks

Science.gov (United States)

Masuda, Naoki; Konno, Norio; Aihara, Kazuyuki

2004-03-01

The outbreak of severe acute respiratory syndrome (SARS) is still threatening the world because of a possible resurgence. In the current situation that effective medical treatments such as antiviral drugs are not discovered yet, dynamical features of the epidemics should be clarified for establishing strategies for tracing, quarantine, isolation, and regulating social behavior of the public at appropriate costs. Here we propose a network model for SARS epidemics and discuss why superspreaders emerged and why SARS spread especially in hospitals, which were key factors of the recent outbreak. We suggest that superspreaders are biologically contagious patients, and they may amplify the spreads by going to potentially contagious places such as hospitals. To avoid mass transmission in hospitals, it may be a good measure to treat suspected cases without hospitalizing them. Finally, we indicate that SARS probably propagates in small-world networks associated with human contacts and that the biological nature of individuals and social group properties are factors more important than the heterogeneous rates of social contacts among individuals. This is in marked contrast with epidemics of sexually transmitted diseases or computer viruses to which scale-free network models often apply.

Phase synchronization of non-Abelian oscillators on small-world networks

Energy Technology Data Exchange (ETDEWEB)

Gu, Zhi-Ming [College of Science, Nanjing University of Aeronautics and Astronautics, Nanjing 210016 (China); Zhao, Ming [Department of Modern Physics, University of Science and Technology of China, Hefei 230026 (China); Zhou, Tao [Department of Modern Physics, University of Science and Technology of China, Hefei 230026 (China)]. E-mail: zhutou@ustc.edu; Zhu, Chen-Ping [College of Science, Nanjing University of Aeronautics and Astronautics, Nanjing 210016 (China); Wang, Bing-Hong [Department of Modern Physics, University of Science and Technology of China, Hefei 230026 (China)

2007-02-26

In this Letter, by extending the concept of Kuramoto oscillator to the left-invariant flow on general Lie group, we investigate the generalized phase synchronization on networks. The analyses and simulations of some typical dynamical systems on Watts-Strogatz networks are given, including the n-dimensional torus, the identity component of 3-dimensional general linear group, the special unitary group, and the special orthogonal group. In all cases, the greater disorder of networks will predict better synchronizability, and the small-world effect ensures the global synchronization for sufficiently large coupling strength. The collective synchronized behaviors of many dynamical systems, such as the integrable systems, the two-state quantum systems and the top systems, can be described by the present phase synchronization frame. In addition, it is intuitive that the low-dimensional systems are more easily to synchronize, however, to our surprise, we found that the high-dimensional systems display obviously synchronized behaviors in regular networks, while these phenomena cannot be observed in low-dimensional systems.

Phase synchronization of non-Abelian oscillators on small-world networks

International Nuclear Information System (INIS)

Gu, Zhi-Ming; Zhao, Ming; Zhou, Tao; Zhu, Chen-Ping; Wang, Bing-Hong

2007-01-01

In this Letter, by extending the concept of Kuramoto oscillator to the left-invariant flow on general Lie group, we investigate the generalized phase synchronization on networks. The analyses and simulations of some typical dynamical systems on Watts-Strogatz networks are given, including the n-dimensional torus, the identity component of 3-dimensional general linear group, the special unitary group, and the special orthogonal group. In all cases, the greater disorder of networks will predict better synchronizability, and the small-world effect ensures the global synchronization for sufficiently large coupling strength. The collective synchronized behaviors of many dynamical systems, such as the integrable systems, the two-state quantum systems and the top systems, can be described by the present phase synchronization frame. In addition, it is intuitive that the low-dimensional systems are more easily to synchronize, however, to our surprise, we found that the high-dimensional systems display obviously synchronized behaviors in regular networks, while these phenomena cannot be observed in low-dimensional systems

Analysis of world terror networks from the reduced Google matrix of Wikipedia

Science.gov (United States)

El Zant, Samer; Frahm, Klaus M.; Jaffrès-Runser, Katia; Shepelyansky, Dima L.

2018-01-01

We apply the reduced Google matrix method to analyze interactions between 95 terrorist groups and determine their relationships and influence on 64 world countries. This is done on the basis of the Google matrix of the English Wikipedia (2017) composed of 5 416 537 articles which accumulate a great part of global human knowledge. The reduced Google matrix takes into account the direct and hidden links between a selection of 159 nodes (articles) appearing due to all paths of a random surfer moving over the whole network. As a result we obtain the network structure of terrorist groups and their relations with selected countries including hidden indirect links. Using the sensitivity of PageRank to a weight variation of specific links we determine the geopolitical sensitivity and influence of specific terrorist groups on world countries. The world maps of the sensitivity of various countries to influence of specific terrorist groups are obtained. We argue that this approach can find useful application for more extensive and detailed data bases analysis.

A review of structural and functional brain networks: small world and atlas.

Science.gov (United States)

Yao, Zhijun; Hu, Bin; Xie, Yuanwei; Moore, Philip; Zheng, Jiaxiang

2015-03-01

Brain networks can be divided into two categories: structural and functional networks. Many studies of neuroscience have reported that the complex brain networks are characterized by small-world or scale-free properties. The identification of nodes is the key factor in studying the properties of networks on the macro-, micro- or mesoscale in both structural and functional networks. In the study of brain networks, nodes are always determined by atlases. Therefore, the selection of atlases is critical, and appropriate atlases are helpful to combine the analyses of structural and functional networks. Currently, some problems still exist in the establishment or usage of atlases, which are often caused by the segmentation or the parcellation of the brain. We suggest that quantification of brain networks might be affected by the selection of atlases to a large extent. In the process of building atlases, the influences of single subjects and groups should be balanced. In this article, we focused on the effects of atlases on the analysis of brain networks and the improved divisions based on the tractography or connectivity in the parcellation of atlases.

Zombie projects, negative networks, and multigenerational science: The temporality of the International Map of the World.

Science.gov (United States)

Rankin, William

2017-06-01

The International Map of the World was a hugely ambitious scheme to create standardized maps of the entire world. It was first proposed in 1891 and remained a going concern until 1986. Over the course of the project's official life, nearly every country in the world took part, and map sheets were published showing all but a few areas of the planet. But the project ended quite unceremoniously, repudiated by cartographers and mapping institutions alike, and it is now remembered as a 'sad story' of network failure. How can we evaluate this kind of sprawling, multigenerational project? In order to move beyond practitioners' (and historians') habit of summarizing the entire endeavor using the blunt categories of success and failure, I propose a more temporally aware reading, one that both disaggregates the (persistent) project from the (always changing) network and sees project and network as invertible, with the possibility of zombie projects and negative networks that can remain robust even when disconnected from their original goals. I therefore see the abandonment of the International Map of the World as resulting from vigorous collaboration and new norms in cartography, not from lack of cooperation or other resources. New categories are required for analyzing science over the long durée.

Altered small-world properties of gray matter networks in breast cancer

Directory of Open Access Journals (Sweden)

Hosseini S M

2012-05-01

Full Text Available Abstract Background Breast cancer survivors, particularly those treated with chemotherapy, are at significantly increased risk for long-term cognitive and neurobiologic impairments. These deficits tend to involve skills that are subserved by distributed brain networks. Additionally, neuroimaging studies have shown a diffuse pattern of brain structure changes in chemotherapy-treated breast cancer survivors that might impact large-scale brain networks. Methods We therefore applied graph theoretical analysis to compare the gray matter structural networks of female breast cancer survivors with a history of chemotherapy treatment and healthy age and education matched female controls. Results Results revealed reduced clustering coefficient and small-world index in the brain network of the breast cancer patients across a range of network densities. In addition, the network of the breast cancer group had less highly interactive nodes and reduced degree/centrality in the frontotemporal regions compared to controls, which may help explain the common impairments of memory and executive functioning among these patients. Conclusions These results suggest that breast cancer and chemotherapy may decrease regional connectivity as well as global network organization and integration, reducing efficiency of the network. To our knowledge, this is the first report of altered large-scale brain networks associated with breast cancer and chemotherapy.

Stability of the spreading in small-world network with predictive controller

International Nuclear Information System (INIS)

Bao, Z.J.; Jiang, Q.Y.; Yan, W.J.; Cao, Y.J.

2010-01-01

In this Letter, we apply the predictive control strategy to suppress the propagation of diseases or viruses in small-world network. The stability of small-world spreading model with predictive controller is investigated. The sufficient and necessary stability condition is given, which is closely related to the controller parameters and small-world rewiring probability p. Our simulations discover a phenomenon that, with the fixed predictive controller parameters, the spreading dynamics become more and more stable when p decreases from a larger value to a smaller one, and the suitable controller parameters can effectively suppress the spreading behaviors even when p varies within the whole spectrum, and the unsuitable controller parameters can lead to oscillation when p lies within a certain range.

Critical behavior of the XY-rotor model on regular and small-world networks

Science.gov (United States)

De Nigris, Sarah; Leoncini, Xavier

2013-07-01

We study the XY rotors model on small networks whose number of links scales with the system size Nlinks˜Nγ, where 1≤γ≤2. We first focus on regular one-dimensional rings in the microcanonical ensemble. For γ1.5, the system equilibrium properties are found to be identical to the mean field, which displays a second-order phase transition at a critical energy density ɛ=E/N,ɛc=0.75. Moreover, for γc≃1.5 we find that a nontrivial state emerges, characterized by an infinite susceptibility. We then consider small-world networks, using the Watts-Strogatz mechanism on the regular networks parametrized by γ. We first analyze the topology and find that the small-world regime appears for rewiring probabilities which scale as pSW∝1/Nγ. Then considering the XY-rotors model on these networks, we find that a second-order phase transition occurs at a critical energy ɛc which logarithmically depends on the topological parameters p and γ. We also define a critical probability pMF, corresponding to the probability beyond which the mean field is quantitatively recovered, and we analyze its dependence on γ.

Disease spreading with epidemic alert on small-world networks

International Nuclear Information System (INIS)

Han, Xiao-Pu

2007-01-01

Base on two-dimension small-world networks, a susceptible-infected model with epidemic alert is proposed in this Letter. In this model, if some parts of the network are alarmed as dangerous, a fraction of edges between the alarmed parts and others will be removed, and two cases of alerting rules that the degree and frequency of contacts kept unchanged are considered respectively. The numerical simulations show that the spreading velocity is reduced by the accurate and timely epidemic alert, and the more accurate and timely, the stronger the deceleration effect. This model indicates that to broadcast epidemic alert timely is helpful and necessary in the control of epidemic spreading, and in agreement with the general view of epidemic alert. This work is helpful to understand the effects of epidemic alert on disease spreading

A network of experimental forests and ranges: Providing soil solutions for a changing world

Science.gov (United States)

Mary Beth. Adams

2010-01-01

The network of experimental forests and ranges of the USDA Forest Service represents significant opportunities to provide soil solutions to critical issues of a changing world. This network of 81 experimental forests and ranges encompasses broad geographic, biological, climatic and physical scales, and includes long-term data sets, and long-term experimental...

A long-time limit for world subway networks.

Science.gov (United States)

Roth, Camille; Kang, Soong Moon; Batty, Michael; Barthelemy, Marc

2012-10-07

We study the temporal evolution of the structure of the world's largest subway networks in an exploratory manner. We show that, remarkably, all these networks converge to a shape that shares similar generic features despite their geographical and economic differences. This limiting shape is made of a core with branches radiating from it. For most of these networks, the average degree of a node (station) within the core has a value of order 2.5 and the proportion of k = 2 nodes in the core is larger than 60 per cent. The number of branches scales roughly as the square root of the number of stations, the current proportion of branches represents about half of the total number of stations, and the average diameter of branches is about twice the average radial extension of the core. Spatial measures such as the number of stations at a given distance to the barycentre display a first regime which grows as r(2) followed by another regime with different exponents, and eventually saturates. These results--difficult to interpret in the framework of fractal geometry--confirm and yield a natural explanation in the geometric picture of this core and their branches: the first regime corresponds to a uniform core, while the second regime is controlled by the interstation spacing on branches. The apparent convergence towards a unique network shape in the temporal limit suggests the existence of dominant, universal mechanisms governing the evolution of these structures.

Time reversibility of quantum diffusion in small-world networks

Science.gov (United States)

Han, Sung-Guk; Kim, Beom Jun

2012-02-01

We study the time-reversal dynamics of a tight-binding electron in the Watts-Strogatz (WS) small-world networks. The localized initial wave packet at time t = 0 diffuses as time proceeds until the time-reversal operation, together with the momentum perturbation of the strength η, is made at the reversal time T. The time irreversibility is measured by I = |Π( t = 2 T) - Π( t = 0)|, where Π is the participation ratio gauging the extendedness of the wavefunction and for convenience, t is measured forward even after the time reversal. When η = 0, the time evolution after T makes the wavefunction at t = 2 T identical to the one at t = 0, and we find I = 0, implying a null irreversibility or a complete reversibility. On the other hand, as η is increased from zero, the reversibility becomes weaker, and we observe enhancement of the irreversibility. We find that I linearly increases with increasing η in the weakly-perturbed region, and that the irreversibility is much stronger in the WS network than in the local regular network.

Stretched exponential dynamics of coupled logistic maps on a small-world network

Science.gov (United States)

Mahajan, Ashwini V.; Gade, Prashant M.

2018-02-01

We investigate the dynamic phase transition from partially or fully arrested state to spatiotemporal chaos in coupled logistic maps on a small-world network. Persistence of local variables in a coarse grained sense acts as an excellent order parameter to study this transition. We investigate the phase diagram by varying coupling strength and small-world rewiring probability p of nonlocal connections. The persistent region is a compact region bounded by two critical lines where band-merging crisis occurs. On one critical line, the persistent sites shows a nonexponential (stretched exponential) decay for all p while for another one, it shows crossover from nonexponential to exponential behavior as p → 1 . With an effectively antiferromagnetic coupling, coupling to two neighbors on either side leads to exchange frustration. Apart from exchange frustration, non-bipartite topology and nonlocal couplings in a small-world network could be a reason for anomalous relaxation. The distribution of trap times in asymptotic regime has a long tail as well. The dependence of temporal evolution of persistence on initial conditions is studied and a scaling form for persistence after waiting time is proposed. We present a simple possible model for this behavior.

A hybrid neural network – world cup optimization algorithm for melanoma detection

Directory of Open Access Journals (Sweden)

Razmjooy Navid

2018-03-01

Full Text Available One of the most dangerous cancers in humans is Melanoma. However, early detection of melanoma can help us to cure it completely. This paper presents a new efficient method to detect malignancy in melanoma via images. At first, the extra scales are eliminated by using edge detection and smoothing. Afterwards, the proposed method can be utilized to segment the cancer images. Finally, the extra information is eliminated by morphological operations and used to focus on the area which melanoma boundary potentially exists. To do this, World Cup Optimization algorithm is utilized to optimize an MLP neural Networks (ANN. World Cup Optimization algorithm is a new meta-heuristic algorithm which is recently presented and has a good performance in some optimization problems. WCO is a derivative-free, Meta-Heuristic algorithm, mimicking the world’s FIFA competitions. World cup Optimization algorithm is a global search algorithm while gradient-based back propagation method is local search. In this proposed algorithm, multi-layer perceptron network (MLP employs the problem’s constraints and WCO algorithm attempts to minimize the root mean square error. Experimental results show that the proposed method can develop the performance of the standard MLP algorithm significantly.

Critical features of coupling parameter in synchronization of small world neural networks

International Nuclear Information System (INIS)

Li Yanlong; Ma Jun; Xu Wenke; Li Hongbo; Wu Min

2008-01-01

The critical features of a coupling parameter in the synchronization of small world neural networks are investigated. A power law decay form is observed in this spatially extended system, the larger linked degree becomes, the larger critical coupling intensity. There exists maximal and minimal critical coupling intensity for synchronization in the extended system. An approximate synchronization diagram has been constructed. In the case of partial coupling, a primary result is presented about the critical coupling fraction for various linked degree of networks

A family of small-world network models built by complete graph and iteration-function

Science.gov (United States)

Ma, Fei; Yao, Bing

2018-02-01

Small-world networks are popular in real-life complex systems. In the past few decades, researchers presented amounts of small-world models, in which some are stochastic and the rest are deterministic. In comparison with random models, it is not only convenient but also interesting to study the topological properties of deterministic models in some fields, such as graph theory, theorem computer sciences and so on. As another concerned darling in current researches, community structure (modular topology) is referred to as an useful statistical parameter to uncover the operating functions of network. So, building and studying such models with community structure and small-world character will be a demanded task. Hence, in this article, we build a family of sparse network space N(t) which is different from those previous deterministic models. Even though, our models are established in the same way as them, iterative generation. By randomly connecting manner in each time step, every resulting member in N(t) has no absolutely self-similar feature widely shared in a large number of previous models. This makes our insight not into discussing a class certain model, but into investigating a group various ones spanning a network space. Somewhat surprisingly, our results prove all members of N(t) to possess some similar characters: (a) sparsity, (b) exponential-scale feature P(k) ∼α-k, and (c) small-world property. Here, we must stress a very screming, but intriguing, phenomenon that the difference of average path length (APL) between any two members in N(t) is quite small, which indicates this random connecting way among members has no great effect on APL. At the end of this article, as a new topological parameter correlated to reliability, synchronization capability and diffusion properties of networks, the number of spanning trees on a representative member NB(t) of N(t) is studied in detail, then an exact analytical solution for its spanning trees entropy is also

Synchronizations in small-world networks of spiking neurons: Diffusive versus sigmoid couplings

International Nuclear Information System (INIS)

Hasegawa, Hideo

2005-01-01

By using a semianalytical dynamical mean-field approximation previously proposed by the author [H. Hasegawa, Phys. Rev. E 70, 066107 (2004)], we have studied the synchronization of stochastic, small-world (SW) networks of FitzHugh-Nagumo neurons with diffusive couplings. The difference and similarity between results for diffusive and sigmoid couplings have been discussed. It has been shown that with introducing the weak heterogeneity to regular networks, the synchronization may be slightly increased for diffusive couplings, while it is decreased for sigmoid couplings. This increase in the synchronization for diffusive couplings is shown to be due to their local, negative feedback contributions, but not due to the short average distance in SW networks. Synchronization of SW networks depends not only on their structure but also on the type of couplings

An Appraisal of Asia-Pacific Cities as Control and Command Centres Embedded in World City Network

Directory of Open Access Journals (Sweden)

Z. Li

2017-08-01

Full Text Available Since the globalization trend is proliferating at a staggering rate, world cities have emerged as the most dominant vanguard incorporated into global economy. Control and command function is one of the robust integral parts of world city formation, which is closely associated with the corporate headquarter status of some dominant multinational companies. Previous research works on this topic tend to concentrate on the Western Europe and North American arenas neglecting the Asia-Pacific region. Hence, the objective of this paper is to explore control and command functions of Asia-Pacific cities with reference to headquarters’ locations of multinational companies. The methodology will utilize the Forbes global 2000 dataset from the seminal study of GaWC research group, and apply the control and command center model and the interlocking city network model to discover the control and command index, as well as network connectivity of Asia-Pacific cities. Based upon the empirical study of this research, we could identify the hierarchical structure and spatial structure of Asia-Pacific world cities to emerge as some control and command centers embedded in world city network.

Heterogeneous delay-induced asynchrony and resonance in a small-world neuronal network system

Science.gov (United States)

Yu, Wen-Ting; Tang, Jun; Ma, Jun; Yang, Xianqing

2016-06-01

A neuronal network often involves time delay caused by the finite signal propagation time in a given biological network. This time delay is not a homogenous fluctuation in a biological system. The heterogeneous delay-induced asynchrony and resonance in a noisy small-world neuronal network system are numerically studied in this work by calculating synchronization measure and spike interval distribution. We focus on three different delay conditions: double-values delay, triple-values delay, and Gaussian-distributed delay. Our results show the following: 1) the heterogeneity in delay results in asynchronous firing in the neuronal network, and 2) maximum synchronization could be achieved through resonance given that the delay values are integer or half-integer times of each other.

Synchronization and Control of Halo-Chaos in Beam Transport Network with Small World Topology

International Nuclear Information System (INIS)

Liu Qiang; Fang Jinqing; Li Yong

2007-01-01

The synchronous conditions of two kinds of the small-world (SW) network are studied. The small world topology can affect on dynamical behaviors of the beam transport network (BTN) largely, if the BTN is constructed with the SW topology, the global linear coupling and special linear feedback can realize the synchronization control of beam halo-chaos as well as periodic state in the BTN with the SW topology, respectively. This important result can provide an effective way for the experimental study and the engineering design of the BTN in the high-current accelerator driven radioactive clean nuclear power systems, and may have potential use in prospective applications for halo-chaos secure communication.

Google matrix analysis of the multiproduct world trade network

Science.gov (United States)

Ermann, Leonardo; Shepelyansky, Dima L.

2015-04-01

Using the United Nations COMTRADE database [United Nations Commodity Trade Statistics Database, available at: http://comtrade.un.org/db/. Accessed November (2014)] we construct the Google matrix G of multiproduct world trade between the UN countries and analyze the properties of trade flows on this network for years 1962-2010. This construction, based on Markov chains, treats all countries on equal democratic grounds independently of their richness and at the same time it considers the contributions of trade products proportionally to their trade volume. We consider the trade with 61 products for up to 227 countries. The obtained results show that the trade contribution of products is asymmetric: some of them are export oriented while others are import oriented even if the ranking by their trade volume is symmetric in respect to export and import after averaging over all world countries. The construction of the Google matrix allows to investigate the sensitivity of trade balance in respect to price variations of products, e.g. petroleum and gas, taking into account the world connectivity of trade links. The trade balance based on PageRank and CheiRank probabilities highlights the leading role of China and other BRICS countries in the world trade in recent years. We also show that the eigenstates of G with large eigenvalues select specific trade communities.

Monte Carlo tests of small-world architecture for coarse-grained networks of the United States railroad and highway transportation systems

Science.gov (United States)

Aldrich, Preston R.; El-Zabet, Jermeen; Hassan, Seerat; Briguglio, Joseph; Aliaj, Enela; Radcliffe, Maria; Mirza, Taha; Comar, Timothy; Nadolski, Jeremy; Huebner, Cynthia D.

2015-11-01

Several studies have shown that human transportation networks exhibit small-world structure, meaning they have high local clustering and are easily traversed. However, some have concluded this without statistical evaluations, and others have compared observed structure to globally random rather than planar models. Here, we use Monte Carlo randomizations to test US transportation infrastructure data for small-worldness. Coarse-grained network models were generated from GIS data wherein nodes represent the 3105 contiguous US counties and weighted edges represent the number of highway or railroad links between counties; thus, we focus on linkage topologies and not geodesic distances. We compared railroad and highway transportation networks with a simple planar network based on county edge-sharing, and with networks that were globally randomized and those that were randomized while preserving their planarity. We conclude that terrestrial transportation networks have small-world architecture, as it is classically defined relative to global randomizations. However, this topological structure is sufficiently explained by the planarity of the graphs, and in fact the topological patterns established by the transportation links actually serve to reduce the amount of small-world structure.

Brain anatomical networks in world class gymnasts: a DTI tractography study.

Science.gov (United States)

Wang, Bin; Fan, Yuanyuan; Lu, Min; Li, Shumei; Song, Zheng; Peng, Xiaoling; Zhang, Ruibin; Lin, Qixiang; He, Yong; Wang, Jun; Huang, Ruiwang

2013-01-15

The excellent motor skills of world class gymnasts amaze everyone. People marvel at the way they precisely control their movements and wonder how the brain structure and function of these elite athletes differ from those of non-athletes. In this study, we acquired diffusion images from thirteen world class gymnasts and fourteen matched controls, constructed their anatomical networks, and calculated the topological properties of each network based on graph theory. From a connectivity-based analysis, we found that most of the edges with increased connection density in the champions were linked to brain regions that are located in the sensorimotor, attentional, and default-mode systems. From graph-based metrics, we detected significantly greater global and local efficiency but shorter characteristic path length in the anatomical networks of the champions compared with the controls. Moreover, in the champions we found a significantly higher nodal degree and greater regional efficiency in several brain regions that correspond to motor and attention functions. These included the left precentral gyrus, left postcentral gyrus, right anterior cingulate gyrus and temporal lobes. In addition, we revealed an increase in the mean fractional anisotropy of the corticospinal tract in the champions, possibly in response to long-term gymnastic training. Our study indicates that neuroanatomical adaptations and plastic changes occur in gymnasts' brain anatomical networks either in response to long-term intensive gymnastic training or as an innate predisposition or both. Our findings may help to explain gymnastic skills at the highest levels of performance and aid in understanding the neural mechanisms that distinguish expert gymnasts from novices. Copyright © 2012 Elsevier Inc. All rights reserved.

Spectral properties of the Google matrix of the World Wide Web and other directed networks.

Science.gov (United States)

Georgeot, Bertrand; Giraud, Olivier; Shepelyansky, Dima L

2010-05-01

We study numerically the spectrum and eigenstate properties of the Google matrix of various examples of directed networks such as vocabulary networks of dictionaries and university World Wide Web networks. The spectra have gapless structure in the vicinity of the maximal eigenvalue for Google damping parameter α equal to unity. The vocabulary networks have relatively homogeneous spectral density, while university networks have pronounced spectral structures which change from one university to another, reflecting specific properties of the networks. We also determine specific properties of eigenstates of the Google matrix, including the PageRank. The fidelity of the PageRank is proposed as a characterization of its stability.

Networked learning in, for, and with the world

DEFF Research Database (Denmark)

Nørgård, Rikke Toft; Mor, Yishay; Bengtsen, Søren Smedegaard

2018-01-01

With the so-called ‘Mode 3’ university as overarching framework (Barnett, 2004; Bengtsen & Nørgård, 2016; Barnett & Bengtsen, 2017; Nørgård, Olesen & Toft-Nielsen, 2018) this chapter considers how traditional forms of and formats for teaching and learning within higher education can be rethought,......’ in higher education. In the following sections, we will describe these transformations of university being, before considering some of the new challenges, opportunities, and potentials of teaching and learning in and through hybrid networks in the Mode 3 institution......., opportunities, and potentials to the teaching and learning that takes place at the university. Through history, and across different present national contexts and cultures, the ‘being’ of the university and its livelihood and mandate has changed (Wright, 2016; Barnett, 2018). Through these transformations where......, reconfigured, and redesigned in order to facilitate valuable, meaningful and relevant hybrid networked learning in, for, and with the world. What it means to ‘be’ a university is changing and the university is a ‘being’ that in itself is changing (Barnett, 2011), something also offering challenges...

ATLAS WORLD-cloud and networking in PanDA

CERN Document Server

AUTHOR|(SzGeCERN)643806; The ATLAS collaboration; De, Kaushik; Di Girolamo, Alessandro; Maeno, Tadashi; Walker, Rodney

2017-01-01

The ATLAS computing model was originally designed as static clouds (usually national or geographical groupings of sites) around the Tier 1 centres, which confined tasks and most of the data traffic. Since those early days, the sites' network bandwidth has increased at 0(1000) and the difference in functionalities between Tier 1s and Tier 2s has reduced. After years of manual, intermediate solutions, we have now ramped up to full usage of World-cloud, the latest step in the PanDA Workload Management System to increase resource utilization on the ATLAS Grid, for all workflows (MC production, data (re)processing, etc.). We have based the development on two new site concepts. Nuclei sites are the Tier 1s and large Tier 2s, where tasks will be assigned and the output aggregated, and satellites are the sites that will execute the jobs and send the output to their nucleus. PanDA dynamically pairs nuclei and satellite sites for each task based on the input data availability, capability matching, site load and network...

Trends of the World Input and Output Network of Global Trade.

Science.gov (United States)

Del Río-Chanona, Rita María; Grujić, Jelena; Jeldtoft Jensen, Henrik

2017-01-01

The international trade naturally maps onto a complex networks. Theoretical analysis of this network gives valuable insights about the global economic system. Although different economic data sets have been investigated from the network perspective, little attention has been paid to its dynamical behaviour. Here we take the World Input Output Data set, which has values of the annual transactions between 40 different countries of 35 different sectors for the period of 15 years, and infer the time interdependence between countries and sectors. As a measure of interdependence we use correlations between various time series of the network characteristics. First we form 15 primary networks for each year of the data we have, where nodes are countries and links are annual exports from one country to the other. Then we calculate the strengths (weighted degree) and PageRank of each country in each of the 15 networks for 15 different years. This leads to sets of time series and by calculating the correlations between these we form a secondary network where the links are the positive correlations between different countries or sectors. Furthermore, we also form a secondary network where the links are negative correlations in order to study the competition between countries and sectors. By analysing this secondary network we obtain a clearer picture of the mutual influences between countries. As one might expect, we find that political and geographical circumstances play an important role. However, the derived correlation network reveals surprising aspects which are hidden in the primary network. Sometimes countries which belong to the same community in the original network are found to be competitors in the secondary networks. E.g. Spain and Portugal are always in the same trade flow community, nevertheless secondary network analysis reveal that they exhibit contrary time evolution.

Trends of the World Input and Output Network of Global Trade.

Directory of Open Access Journals (Sweden)

Rita María Del Río-Chanona

Full Text Available The international trade naturally maps onto a complex networks. Theoretical analysis of this network gives valuable insights about the global economic system. Although different economic data sets have been investigated from the network perspective, little attention has been paid to its dynamical behaviour. Here we take the World Input Output Data set, which has values of the annual transactions between 40 different countries of 35 different sectors for the period of 15 years, and infer the time interdependence between countries and sectors. As a measure of interdependence we use correlations between various time series of the network characteristics. First we form 15 primary networks for each year of the data we have, where nodes are countries and links are annual exports from one country to the other. Then we calculate the strengths (weighted degree and PageRank of each country in each of the 15 networks for 15 different years. This leads to sets of time series and by calculating the correlations between these we form a secondary network where the links are the positive correlations between different countries or sectors. Furthermore, we also form a secondary network where the links are negative correlations in order to study the competition between countries and sectors. By analysing this secondary network we obtain a clearer picture of the mutual influences between countries. As one might expect, we find that political and geographical circumstances play an important role. However, the derived correlation network reveals surprising aspects which are hidden in the primary network. Sometimes countries which belong to the same community in the original network are found to be competitors in the secondary networks. E.g. Spain and Portugal are always in the same trade flow community, nevertheless secondary network analysis reveal that they exhibit contrary time evolution.

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

International Nuclear Information System (INIS)

Zhang, Jianbao; Ma, Zhongjun; Chen, Guanrong

2014-01-01

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

Science.gov (United States)

Zhang, Jianbao; Ma, Zhongjun; Chen, Guanrong

2014-06-01

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

Energy Technology Data Exchange (ETDEWEB)

Zhang, Jianbao [School of Science, Hangzhou Dianzi University, Hangzhou 310018 (China); Ma, Zhongjun, E-mail: mzj1234402@163.com [School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004 (China); Chen, Guanrong [Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong (China)

2014-06-15

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

Abnormal small-world brain functional networks in obsessive-compulsive disorder patients with poor insight.

Science.gov (United States)

Lei, Hui; Cui, Yan; Fan, Jie; Zhang, Xiaocui; Zhong, Mingtian; Yi, Jinyao; Cai, Lin; Yao, Dezhong; Zhu, Xiongzhao

2017-09-01

There are limited data on neurobiological correlates of poor insight in obsessive-compulsive disorder (OCD). This study explored whether specific changes occur in small-world network (SWN) properties in the brain functional network of OCD patients with poor insight. Resting-state electroencephalograms (EEGs) were recorded for 12 medication-free OCD patients with poor insight, 50 medication-free OCD patients with good insight, and 36 healthy controls. Both of the OCD groups exhibited topological alterations in the brain functional network characterized by abnormal small-world parameters at the beta band. However, the alterations at the theta band only existed in the OCD patients with poor insight. A relatively small sample size. Subjects were naïve to medications and those with Axis I comorbidity were excluded, perhaps limiting generalizability. Disrupted functional integrity at the beta bands of the brain functional network may be related to OCD, while disrupted functional integrity at the theta band may be associated with poor insight in OCD patients, thus this study might provide novel insight into our understanding of the pathophysiology of OCD. Copyright © 2017 Elsevier B.V. All rights reserved.

Local communities obstruct global consensus: Naming game on multi-local-world networks

Science.gov (United States)

Lou, Yang; Chen, Guanrong; Fan, Zhengping; Xiang, Luna

2018-02-01

Community structure is essential for social communications, where individuals belonging to the same community are much more actively interacting and communicating with each other than those in different communities within the human society. Naming game, on the other hand, is a social communication model that simulates the process of learning a name of an object within a community of humans, where the individuals can generally reach global consensus asymptotically through iterative pair-wise conversations. The underlying network indicates the relationships among the individuals. In this paper, three typical topologies, namely random-graph, small-world and scale-free networks, are employed, which are embedded with the multi-local-world community structure, to study the naming game. Simulations show that (1) the convergence process to global consensus is getting slower as the community structure becomes more prominent, and eventually might fail; (2) if the inter-community connections are sufficiently dense, neither the number nor the size of the communities affects the convergence process; and (3) for different topologies with the same (or similar) average node-degree, local clustering of individuals obstruct or prohibit global consensus to take place. The results reveal the role of local communities in a global naming game in social network studies.

The world network of scientific collaborations between cities: domestic or international dynamics?

Energy Technology Data Exchange (ETDEWEB)

Maisonobe, M.; Eckert, D.; Grossetti, M.; Jégou, L.; Milard, B.

2016-07-01

Earlier publication (Grossetti et al., 2014) has established that we are attending a decreasing concentration of scientific activities within “world-cities”. Given that more and more cities and countries are contributing to the world production of knowledge, this article analyzes the evolution of the world network of collaborations both at the domestic and international levels during the 2000s. Using data from the Science Citation Index Expanded, scientific authors’ addresses are geo-localized and grouped by urban areas. Our data suggests that interurban collaborations within countries have increased together with international linkages. In most countries, domestic collaborations have increased faster than international collaborations. Even among the top collaborating cities, sometimes referred to as “world cities”, the share of domestic collaborations is gaining momentum. Our results suggest that, contrary to common beliefs about the globalization process, national systems of research have been strengthening during the 2000s. (Author)

Building Real World Domain-Specific Social Network Websites as a Capstone Project

Science.gov (United States)

Yue, Kwok-Bun; De Silva, Dilhar; Kim, Dan; Aktepe, Mirac; Nagle, Stewart; Boerger, Chris; Jain, Anubha; Verma, Sunny

2009-01-01

This paper describes our experience of using Content Management Software (CMS), specifically Joomla, to build a real world domain-specific social network site (SNS) as a capstone project for graduate information systems and computer science students. As Web 2.0 technologies become increasingly important in driving business application development,…

Simple, distance-dependent formulation of the Watts-Strogatz model for directed and undirected small-world networks

Science.gov (United States)

Song, H. Francis; Wang, Xiao-Jing

2014-12-01

Small-world networks—complex networks characterized by a combination of high clustering and short path lengths—are widely studied using the paradigmatic model of Watts and Strogatz (WS). Although the WS model is already quite minimal and intuitive, we describe an alternative formulation of the WS model in terms of a distance-dependent probability of connection that further simplifies, both practically and theoretically, the generation of directed and undirected WS-type small-world networks. In addition to highlighting an essential feature of the WS model that has previously been overlooked, namely the equivalence to a simple distance-dependent model, this alternative formulation makes it possible to derive exact expressions for quantities such as the degree and motif distributions and global clustering coefficient for both directed and undirected networks in terms of model parameters.

[Analysis of the Characteristics of Infantile Small World Neural Network Node Properties Correlated with the Influencing Factors].

Science.gov (United States)

Qu, Haibo; Lu, Su; Zhang, Wenjing; Xiao, Yuan; Ning, Gang; Sun, Huaiqiang

2016-10-01

We applied resting-state functional magnetic resonance imaging(rfMRI)combined with graph theory to analyze 90 regions of the infantile small world neural network of the whole brain.We tried to get the following two points clear:1 whether the parameters of the node property of the infantile small world neural network are correlated with the level of infantile intelligence development;2 whether the parameters of the infantile small world neural network are correlated with the children’s baseline parameters,i.e.,the demographic parameters such as gender,age,parents’ education level,etc.Twelve cases of healthy infants were included in the investigation(9males and 3females with the average age of 33.42±8.42 months.)We then evaluated the level of infantile intelligence of all the cases and graded by Gesell Development Scale Test.We used a Siemens 3.0T Trio imaging system to perform resting-state(rs)EPI scans,and collected the BOLD functional Magnetic Resonance Imaging(fMRI)data.We performed the data processing with Statistical Parametric Mapping 5(SPM5)based on Matlab environment.Furthermore,we got the attributes of the whole brain small world and node attributes of 90 encephalic regions of templates of Anatomatic Automatic Labeling(ALL).At last,we carried out correlation study between the above-mentioned attitudes,intelligence scale parameters and demographic data.The results showed that many node attributes of small world neural network were closely correlated with intelligence scale parameters.Betweeness was mainly centered in thalamus,superior frontal gyrus,and occipital lobe(negative correlation).The r value of superior occipital gyrus associated with the individual and social intelligent scale was-0.729(P=0.007);degree was mainly centered in amygdaloid nucleus,superior frontal gyrus,and inferior parietal gyrus(positive correlation).The r value of inferior parietal gyrus associated with the gross motor intelligent scale was 0.725(P=0.008);efficiency was mainly

Impact of Partial Time Delay on Temporal Dynamics of Watts-Strogatz Small-World Neuronal Networks

Science.gov (United States)

Yan, Hao; Sun, Xiaojuan

2017-06-01

In this paper, we mainly discuss effects of partial time delay on temporal dynamics of Watts-Strogatz (WS) small-world neuronal networks by controlling two parameters. One is the time delay τ and the other is the probability of partial time delay pdelay. Temporal dynamics of WS small-world neuronal networks are discussed with the aid of temporal coherence and mean firing rate. With the obtained simulation results, it is revealed that for small time delay τ, the probability pdelay could weaken temporal coherence and increase mean firing rate of neuronal networks, which indicates that it could improve neuronal firings of the neuronal networks while destroying firing regularity. For large time delay τ, temporal coherence and mean firing rate do not have great changes with respect to pdelay. Time delay τ always has great influence on both temporal coherence and mean firing rate no matter what is the value of pdelay. Moreover, with the analysis of spike trains and histograms of interspike intervals of neurons inside neuronal networks, it is found that the effects of partial time delays on temporal coherence and mean firing rate could be the result of locking between the period of neuronal firing activities and the value of time delay τ. In brief, partial time delay could have great influence on temporal dynamics of the neuronal networks.

The General Evolving Model for Energy Supply-Demand Network with Local-World

Science.gov (United States)

Sun, Mei; Han, Dun; Li, Dandan; Fang, Cuicui

2013-10-01

In this paper, two general bipartite network evolving models for energy supply-demand network with local-world are proposed. The node weight distribution, the "shifting coefficient" and the scaling exponent of two different kinds of nodes are presented by the mean-field theory. The numerical results of the node weight distribution and the edge weight distribution are also investigated. The production's shifted power law (SPL) distribution of coal enterprises and the installed capacity's distribution of power plants in the US are obtained from the empirical analysis. Numerical simulations and empirical results are given to verify the theoretical results.

VIRTUAL WORLD MARKETING: THE IMPORTANCE OF BEING ON SOCIAL NETWORKS

OpenAIRE

EVERTON DAMIÃO TAVANO SANTOS; JOÃO PAULO DA SILVA GOMES; CARLOS EDUARDO CICCONE

2012-01-01

Increasingly present at peolpe´s daily life and seeking to satisfy their wishes, marketing is searching to adapt itself to consumer´s real necessities as well as to the environments currently used by them. With the growing use of technology and internet access, marketing ceases to act only on physical media such as magazines, newspapers and pamphlets to go further, searching for a new environment where customers go like social networking in virtual world where the dissemination of informa...

A small world of weak ties provides optimal global integration of self-similar modules in functional brain networks.

Science.gov (United States)

Gallos, Lazaros K; Makse, Hernán A; Sigman, Mariano

2012-02-21

The human brain is organized in functional modules. Such an organization presents a basic conundrum: Modules ought to be sufficiently independent to guarantee functional specialization and sufficiently connected to bind multiple processors for efficient information transfer. It is commonly accepted that small-world architecture of short paths and large local clustering may solve this problem. However, there is intrinsic tension between shortcuts generating small worlds and the persistence of modularity, a global property unrelated to local clustering. Here, we present a possible solution to this puzzle. We first show that a modified percolation theory can define a set of hierarchically organized modules made of strong links in functional brain networks. These modules are "large-world" self-similar structures and, therefore, are far from being small-world. However, incorporating weaker ties to the network converts it into a small world preserving an underlying backbone of well-defined modules. Remarkably, weak ties are precisely organized as predicted by theory maximizing information transfer with minimal wiring cost. This trade-off architecture is reminiscent of the "strength of weak ties" crucial concept of social networks. Such a design suggests a natural solution to the paradox of efficient information flow in the highly modular structure of the brain.

Using the world-wide computer network, Internet, in chemical sciences

International Nuclear Information System (INIS)

Edvardsen, Oe.

1995-01-01

Modern computer and information technology has opened up many possibilities for communicating various types of information efficiently throughout the world. A non-technical introduction to some of the available resources on the computer network, Internet, is given in this paper. Hints on where to start exploring the Internet and how to obtain information are provided. Methods of communicating between scientists, how to access archives, and modern multi-media information systems are described. Several examples of services available to chemists are shown. (au) (26 refs.)

Finite Memory Walk and Its Application to Small-World Network

Science.gov (United States)

Oshima, Hiraku; Odagaki, Takashi

2012-07-01

In order to investigate the effects of cycles on the dynamical process on both regular lattices and complex networks, we introduce a finite memory walk (FMW) as an extension of the simple random walk (SRW), in which a walker is prohibited from moving to sites visited during m steps just before the current position. This walk interpolates the simple random walk (SRW), which has no memory (m = 0), and the self-avoiding walk (SAW), which has an infinite memory (m = ∞). We investigate the FMW on regular lattices and clarify the fundamental characteristics of the walk. We find that (1) the mean-square displacement (MSD) of the FMW shows a crossover from the SAW at a short time step to the SRW at a long time step, and the crossover time is approximately equivalent to the number of steps remembered, and that the MSD can be rescaled in terms of the time step and the size of memory; (2) the mean first-return time (MFRT) of the FMW changes significantly at the number of remembered steps that corresponds to the size of the smallest cycle in the regular lattice, where ``smallest'' indicates that the size of the cycle is the smallest in the network; (3) the relaxation time of the first-return time distribution (FRTD) decreases as the number of cycles increases. We also investigate the FMW on the Watts--Strogatz networks that can generate small-world networks, and show that the clustering coefficient of the Watts--Strogatz network is strongly related to the MFRT of the FMW that can remember two steps.

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.

World Cities of Scientific Knowledge: Systems, Networks and Potential Dynamics. An Analysis Based on Bibliometric Indicators

DEFF Research Database (Denmark)

Matthiessen, Christian Wichmann; Schwarz, Annette Winkel; Find, Søren

2010-01-01

This paper is based on identification of the pattern of the upper level of the world city network of knowledge as published in a series of papers.It is our aim to update the findings and relate to the general world city discussion. The structure of the world cities of knowledge network has changed...... over the last decade in favour of south east Asian and south European cities and in disfavour of the traditional centres of North America and north-western Europe. The analysis is based on bibliometric data on the world’s 100 largest cities measured in terms of research output. Then level of co......-authorships between researchers in different cities is an indicators of links and respect, and the number of citations to papers produced by researchers located in each city is an indicator of respect. Finally, one research discipline is selected for an experiment in forecasting future hot spots of research....

A hybrid small-world network/semi-physical model for predicting wildfire spread in heterogeneous landscapes

International Nuclear Information System (INIS)

Billaud, Y; Kaiss, A; Drissi, M; Pizzo, Y; Porterie, B; Zekri, N; Acem, Z; Collin, A; Boulet, P; Santoni, P-A; Bosseur, F

2012-01-01

This paper presents the latest developments and validation results of a hybrid model which combines a broad-scale stochastic small-world network model with a macroscopic deterministic approach, to simulate the effects of large fires burning in heterogeneous landscapes. In the extended version of the model, vegetation is depicted as an amorphous network of combustible cells, and both radiation and convection from the flaming zone are considered in the preheating process of unburned cells. Examples are given to illustrate small-world effects and fire behavior near the percolation threshold. The model is applied to a Mediterranean fire that occurred in Corsica in 2009 showing a good agreement in terms of rate of spread, and area and shape of the burn. A study, based on a fractional factorial plan, is conducted to evaluate the influence of variations of model parameters on fire propagation.

A small-world methodology of analysis of interchange energy-networks: The European behaviour in the economical crisis

International Nuclear Information System (INIS)

Dassisti, M.; Carnimeo, L.

2013-01-01

European energy policy pursues the objective of a sustainable, competitive and reliable supply of energy. In 2007, the European Commission adopted a proper energy policy for Europe supported by several documents and included an action plan to meet the major energy challenges Europe has to face. A farsighted diversified yearly mix of energies was suggested to countries, aiming at increasing security of supply and efficiency, but a wide and systemic view of energy interchanges between states was missing. In this paper, a Small-World methodology of analysis of Interchange Energy-Networks (IENs) is presented, with the aim of providing a useful tool for planning sustainable energy policies. A proof case is presented to validate the methodology by considering the European IEN behaviour in the period of economical crisis. This network is approached as a Small World Net from a modelling point of view, by supposing that connections between States are characterised by a probability value depending on economic/political relations between countries. - Highlights: • Different view of the imports and exports of electric energy flows between European for potential use in ruling exchanges. • Panel data from 1996 to 2010 as part of a network of exchanges was considered from Eurostat official database. • The European import/export energy flows modelled as a network with Small World phenomena, interpreting the evolution over the years. • Interesting systemic tool for ruling and governing energy flows between countries

What Does Global Migration Network Say about Recent Changes in the World System Structure?

Science.gov (United States)

Zinkina, Julia; Korotayev, Andrey

2014-01-01

Purpose: The aim of this paper is to investigate whether the structure of the international migration system has remained stable through the recent turbulent changes in the world system. Design/methodology/approach: The methodology draws on the social network analysis framework--but with some noteworthy limitations stipulated by the specifics of…

Making Choices in the Virtual World: The New Model at United Technologies Information Network.

Science.gov (United States)

Gulliford, Bradley

1998-01-01

Describes changes in services of the United Technologies Corporation Information Network from a traditional library system to a virtual system of World Wide Web sites, a document-delivery unit, telephone and e-mail reference, and desktop technical support to provide remote access. Staff time, security, and licensing issues are addressed.…

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

Small-worldness and gender differences of large scale brain metabolic covariance networks in young adults: a FDG PET study of 400 subjects.

Science.gov (United States)

Hu, Yuxiao; Xu, Qiang; Shen, Junkang; Li, Kai; Zhu, Hong; Zhang, Zhiqiang; Lu, Guangming

2015-02-01

Many studies have demonstrated the small-worldness of the human brain, and have revealed a sexual dimorphism in brain network properties. However, little is known about the gender effects on the topological organization of the brain metabolic covariance networks. To investigate the small-worldness and the gender differences in the topological architectures of human brain metabolic networks. FDG-PET data of 400 healthy right-handed subjects (200 women and 200 age-matched men) were involved in the present study. Metabolic networks of each gender were constructed by calculating the covariance of regional cerebral glucose metabolism (rCMglc) across subjects on the basis of AAL parcellation. Gender differences of network and nodal properties were investigated by using the graph theoretical approaches. Moreover, the gender-related difference of rCMglc in each brain region was tested for investigating the relationships between the hub regions and the brain regions showing significant gender-related differences in rCMglc. We found prominent small-world properties in the domain of metabolic networks in each gender. No significant gender difference in the global characteristics was found. Gender differences of nodal characteristic were observed in a few brain regions. We also found bilateral and lateralized distributions of network hubs in the females and males. Furthermore, we first reported that some hubs of a gender located in the brain regions showing weaker rCMglc in this gender than the other gender. The present study demonstrated that small-worldness was existed in metabolic networks, and revealed gender differences of organizational patterns in metabolic network. These results maybe provided insights into the understanding of the metabolic substrates underlying individual differences in cognition and behaviors. © The Foundation Acta Radiologica 2014 Reprints and permissions: sagepub.co.uk/journalsPermissions.nav.

Interictal to Ictal Phase Transition in a Small-World Network

Science.gov (United States)

Nemzer, Louis; Cravens, Gary; Worth, Robert

Real-time detection and prediction of seizures in patients with epilepsy is essential for rapid intervention. Here, we perform a full Hodgkin-Huxley calculation using n 50 in silico neurons configured in a small-world network topology to generate simulated EEG signals. The connectivity matrix, constructed using a Watts-Strogatz algorithm, admits randomized or deterministic entries. We find that situations corresponding to interictal (non-seizure) and ictal (seizure) states are separated by a phase transition that can be influenced by congenital channelopathies, anticonvulsant drugs, and connectome plasticity. The interictal phase exhibits scale-free phenomena, as characterized by a power law form of the spectral power density, while the ictal state suffers from pathological synchronization. We compare the results with intracranial EEG data and show how these findings may be used to detect or even predict seizure onset. Along with the balance of excitatory and inhibitory factors, the network topology plays a large role in determining the overall characteristics of brain activity. We have developed a new platform for testing the conditions that contribute to the phase transition between non-seizure and seizure states.

NETWORK ANALYSIS OF PORTUGUESE TEAM ON FIFA WORLD CUP 2014

Directory of Open Access Journals (Sweden)

Rui Sousa Mendes,

2015-05-01

Full Text Available Match analysis has been using in football case to identify properties and patterns of teams (Sarmento et al., 2014. From the regular notational analysis until the most recent computational tactical metrics, a lot of different outcomes can be possible to extract from a single match (Clemente, Couceiro, Martins, & Mendes, 2015. In the specific case of football, the cooperation among team-members is one of the main factors that contribute for a better performance (Grund, 2012. Thus, to analyse such cooperation the Social Network Analysis have been used to identify how team-members are connected and if there are cooperation tendencies inside the team (Clemente et al., 2015. The prominent players have been also analysed in order to identify the central players in the team (Clemente, Couceiro, Martins, & Mendes, 2014.Objectives: Therefore, using the social network analysis approach the aim of this study was to analyse the centrality levels of Portuguese positional roles during the FIFA World Cup 2014 and to identify the prominent tactical positions that determined the moments with ball.

Propagation phenomena in real world networks

CERN Document Server

Fay, Damien; Gabryś, Bogdan

2015-01-01

“Propagation, which looks at spreading in complex networks, can be seen from many viewpoints; it is undesirable, or desirable, controllable, the mechanisms generating that propagation can be the topic of interest, but in the end all depends on the setting. This book covers leading research on a wide spectrum of propagation phenomenon and the techniques currently used in its modelling, prediction, analysis and control. Fourteen papers range over topics including epidemic models, models for trust inference, coverage strategies for networks, vehicle flow propagation, bio-inspired routing algorithms, P2P botnet attacks and defences, fault propagation in gene-cellular networks, malware propagation for mobile networks, information propagation in crisis situations, financial contagion in interbank networks, and finally how to maximize the spread of influence in social networks. The compendium will be of interest to researchers, those working in social networking, communications and finance and is aimed at providin...

Effects of channel noise on firing coherence of small-world Hodgkin-Huxley neuronal networks

Science.gov (United States)

Sun, X. J.; Lei, J. Z.; Perc, M.; Lu, Q. S.; Lv, S. J.

2011-01-01

We investigate the effects of channel noise on firing coherence of Watts-Strogatz small-world networks consisting of biophysically realistic HH neurons having a fraction of blocked voltage-gated sodium and potassium ion channels embedded in their neuronal membranes. The intensity of channel noise is determined by the number of non-blocked ion channels, which depends on the fraction of working ion channels and the membrane patch size with the assumption of homogeneous ion channel density. We find that firing coherence of the neuronal network can be either enhanced or reduced depending on the source of channel noise. As shown in this paper, sodium channel noise reduces firing coherence of neuronal networks; in contrast, potassium channel noise enhances it. Furthermore, compared with potassium channel noise, sodium channel noise plays a dominant role in affecting firing coherence of the neuronal network. Moreover, we declare that the observed phenomena are independent of the rewiring probability.

Tales of two cities: political capitals and economic centres in the world city network.

Directory of Open Access Journals (Sweden)

Peter J. Taylor

2014-12-01

Full Text Available The majority of major cities in the world city network are capital cities. Between primacy and political specialization there are examples of countries where the capital city and a second city remain as major rival cities in contemporary globalization. In this paper we focus upon situations where the capital city is less important in global economic capacity: Rome and Milan, Berlin and Frankfurt, Abu Dhabi and Dubai, Delhi and Mumbai, Islamabad and Karachi. This is an exercise in double comparisons: between cities in each pairing and between the pairings. Despite the massive differences – economic, cultural and political – amongst our chosen pairs of cities we have found communalities relating to the specific circumstance we are investigating. First, there is some evidence that economic centres are more global and less local than their capital cities. Second, more particularly, we have shown that in terms of global economic connections there is a very consistent pattern: economic centres have a much more coherent and telling integration into the world city network.

Neural mechanisms tracking popularity in real-world social networks.

Science.gov (United States)

Zerubavel, Noam; Bearman, Peter S; Weber, Jochen; Ochsner, Kevin N

2015-12-08

Differences in popularity are a key aspect of status in virtually all human groups and shape social interactions within them. Little is known, however, about how we track and neurally represent others' popularity. We addressed this question in two real-world social networks using sociometric methods to quantify popularity. Each group member (perceiver) viewed faces of every other group member (target) while whole-brain functional MRI data were collected. Independent functional localizer tasks were used to identify brain systems supporting affective valuation (ventromedial prefrontal cortex, ventral striatum, amygdala) and social cognition (dorsomedial prefrontal cortex, precuneus, temporoparietal junction), respectively. During the face-viewing task, activity in both types of neural systems tracked targets' sociometric popularity, even when controlling for potential confounds. The target popularity-social cognition system relationship was mediated by valuation system activity, suggesting that observing popular individuals elicits value signals that facilitate understanding their mental states. The target popularity-valuation system relationship was strongest for popular perceivers, suggesting enhanced sensitivity to differences among other group members' popularity. Popular group members also demonstrated greater interpersonal sensitivity by more accurately predicting how their own personalities were perceived by other individuals in the social network. These data offer insights into the mechanisms by which status guides social behavior.

Leading Trade Networks in the Context of Globalisation of the World Retail Trade

Directory of Open Access Journals (Sweden)

Kavun Olha O.

2013-12-01

Full Text Available The article considers main tendencies of development of trade networks during 2002 – 2012 and determines that the overwhelming majority of them increased their presence in foreign markets. It analyses specific features of manifestation of the expansion policy by trade structures depending on the region of their origin. It studies motives that make leading retailers go out of boundaries of the national markets. Main of them are sharpening of competition in domestic, more mature markets, due to increase of concentration of network structures and also application of the state policy of restrictions in the trading activity. It considers methods that were selected by major trade networks in 2011 – 2012 for entering foreign markets. It establishes that the most popular was franchising. It determines directions of manifestation of regulation barriers, faced by major trade networks of the world when entering markets of developing countries. It establishes that major national structures, which are the main competitors for international trade networks and which make them develop a more weighted approach to making decisions that are connected with entering a new market and adjustment of existing strategies of development, are represented in markets of individual countries, in particular, in Asia and South Africa.

Risks, prices, and positions: A social network analysis of illegal drug trafficking in the world-economy.

Science.gov (United States)

Boivin, Rémi

2014-03-01

Illegal drug prices are extremely high, compared to similar goods. There is, however, considerable variation in value depending on place, market level and type of drugs. A prominent framework for the study of illegal drugs is the "risks and prices" model (Reuter & Kleiman, 1986). Enforcement is seen as a "tax" added to the regular price. In this paper, it is argued that such economic models are not sufficient to explain price variations at country-level. Drug markets are analysed as global trade networks in which a country's position has an impact on various features, including illegal drug prices. This paper uses social network analysis (SNA) to explain price markups between pairs of countries involved in the trafficking of illegal drugs between 1998 and 2007. It aims to explore a simple question: why do prices increase between two countries? Using relational data from various international organizations, separate trade networks were built for cocaine, heroin and cannabis. Wholesale price markups are predicted with measures of supply, demand, risks of seizures, geographic distance and global positioning within the networks. Reported prices (in $US) and purchasing power parity-adjusted values are analysed. Drug prices increase more sharply when drugs are headed to countries where law enforcement imposes higher costs on traffickers. The position and role of a country in global drug markets are also closely associated with the value of drugs. Price markups are lower if the destination country is a transit to large potential markets. Furthermore, price markups for cocaine and heroin are more pronounced when drugs are exported to countries that are better positioned in the legitimate world-economy, suggesting that relations in legal and illegal markets are directed in opposite directions. Consistent with the world-system perspective, evidence is found of coherent world drug markets driven by both local realities and international relations. Copyright © 2013 Elsevier B

Empirical Analysis on Evolution and Small World Effect of Chinese Enterprise-Enterprise Patent Cooperation Network: From the Perspective of Open Innovation

Directory of Open Access Journals (Sweden)

Wei Li

2013-10-01

Full Text Available The patent cooperation network which enterprises join is a very important network platform for enterprises’ open innovation. However, very limited work has been done to empirically investigate the dynamic change process of the network in China. To address this issue, this paper analyzes dynamic change process of cooperation network of enterprises and the small-world effect of the biggest subgroup according to the data of 36731 items of cooperative patents between enterprises from 1985 to 2010 published by the State Intellectual Property Office of China. A conclusion can be drawn from the analysis results that the biggest subgroup has the characteristics of small-world effect, but the overall network structure also has some defects, which limit the development of open innovation. For the first time, suggestions on open innovation strategies are put forward to provide theoretical reference for both the government and enterprises.

Complex networks generated by the Penna bit-string model: Emergence of small-world and assortative mixing

Science.gov (United States)

Li, Chunguang; Maini, Philip K.

2005-10-01

The Penna bit-string model successfully encompasses many phenomena of population evolution, including inheritance, mutation, evolution, and aging. If we consider social interactions among individuals in the Penna model, the population will form a complex network. In this paper, we first modify the Verhulst factor to control only the birth rate, and introduce activity-based preferential reproduction of offspring in the Penna model. The social interactions among individuals are generated by both inheritance and activity-based preferential increase. Then we study the properties of the complex network generated by the modified Penna model. We find that the resulting complex network has a small-world effect and the assortative mixing property.

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

International Nuclear Information System (INIS)

Moujahid, Abdelmalik; D’Anjou, Alicia; Cases, Blanca

2012-01-01

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

Adaption of the temporal correlation coefficient calculation for temporal networks (applied to a real-world pig trade network).

Science.gov (United States)

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-01-01

The average topological overlap of two graphs of two consecutive time steps measures the amount of changes in the edge configuration between the two snapshots. This value has to be zero if the edge configuration changes completely and one if the two consecutive graphs are identical. Current methods depend on the number of nodes in the network or on the maximal number of connected nodes in the consecutive time steps. In the first case, this methodology breaks down if there are nodes with no edges. In the second case, it fails if the maximal number of active nodes is larger than the maximal number of connected nodes. In the following, an adaption of the calculation of the temporal correlation coefficient and of the topological overlap of the graph between two consecutive time steps is presented, which shows the expected behaviour mentioned above. The newly proposed adaption uses the maximal number of active nodes, i.e. the number of nodes with at least one edge, for the calculation of the topological overlap. The three methods were compared with the help of vivid example networks to reveal the differences between the proposed notations. Furthermore, these three calculation methods were applied to a real-world network of animal movements in order to detect influences of the network structure on the outcome of the different methods.

Focus-based filtering + clustering technique for power-law networks with small world phenomenon

Science.gov (United States)

Boutin, François; Thièvre, Jérôme; Hascoët, Mountaz

2006-01-01

Realistic interaction networks usually present two main properties: a power-law degree distribution and a small world behavior. Few nodes are linked to many nodes and adjacent nodes are likely to share common neighbors. Moreover, graph structure usually presents a dense core that is difficult to explore with classical filtering and clustering techniques. In this paper, we propose a new filtering technique accounting for a user-focus. This technique extracts a tree-like graph with also power-law degree distribution and small world behavior. Resulting structure is easily drawn with classical force-directed drawing algorithms. It is also quickly clustered and displayed into a multi-level silhouette tree (MuSi-Tree) from any user-focus. We built a new graph filtering + clustering + drawing API and report a case study.

Complex Behavior in an Integrate-and-Fire Neuron Model Based on Small World Networks

International Nuclear Information System (INIS)

Lin Min; Chen Tianlun

2005-01-01

Based on our previously pulse-coupled integrate-and-fire neuron model in small world networks, we investigate the complex behavior of electroencephalographic (EEG)-like activities produced by such a model. We find EEG-like activities have obvious chaotic characteristics. We also analyze the complex behaviors of EEG-like signals, such as spectral analysis, reconstruction of the phase space, the correlation dimension, and so on.

Optimal convergence in naming game with geography-based negotiation on small-world networks

Energy Technology Data Exchange (ETDEWEB)

Liu Runran, E-mail: runran@mail.ustc.edu.c [Department of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefei Anhui 230026 (China); Wang Wenxu [School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ 85287 (United States); Lai Yingcheng [School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ 85287 (United States); Department of Physics, Arizona State University, Tempe, AZ 85287 (United States); Chen Guanrong [Department of Electronic Engineering, City University of Hong Kong, Hong Kong (Hong Kong); Wang Binghong [Department of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefei Anhui 230026 (China); Research Center for Complex System Science, University of Shanghai for Science and Technology and Shanghai Academy of System Science, Shanghai 200093 (China)

2011-01-17

We propose a negotiation strategy to address the effect of geography on the dynamics of naming games over small-world networks. Communication and negotiation frequencies between two agents are determined by their geographical distance in terms of a parameter characterizing the correlation between interaction strength and the distance. A finding is that there exists an optimal parameter value leading to fastest convergence to global consensus on naming. Numerical computations and a theoretical analysis are provided to substantiate our findings.

Optimal convergence in naming game with geography-based negotiation on small-world networks

International Nuclear Information System (INIS)

Liu Runran; Wang Wenxu; Lai Yingcheng; Chen Guanrong; Wang Binghong

2011-01-01

We propose a negotiation strategy to address the effect of geography on the dynamics of naming games over small-world networks. Communication and negotiation frequencies between two agents are determined by their geographical distance in terms of a parameter characterizing the correlation between interaction strength and the distance. A finding is that there exists an optimal parameter value leading to fastest convergence to global consensus on naming. Numerical computations and a theoretical analysis are provided to substantiate our findings.

The Pharmacogenomics Research Network Translational Pharmacogenetics Program: Overcoming Challenges of Real-World Implementation

Science.gov (United States)

Shuldiner, AR; Relling, MV; Peterson, JF; Hicks, JK; Freimuth, RR; Sadee, W; Pereira, NL; Roden, DM; Johnson, JA; Klein, TE

2013-01-01

The pace of discovery of potentially actionable pharmacogenetic variants has increased dramatically in recent years. However, the implementation of this new knowledge for individualized patient care has been slow. The Pharmacogenomics Research Network (PGRN) Translational Pharmacogenetics Program seeks to identify barriers and develop real-world solutions to implementation of evidence-based pharmacogenetic tests in diverse health-care settings. Dissemination of the resulting toolbox of “implementation best practices” will prove useful to a broad audience. PMID:23588301

Disrupted small world networks in patients without overt hepatic encephalopathy: A resting state fMRI study

Energy Technology Data Exchange (ETDEWEB)

Zhang, Long Jiang, E-mail: kevinzhlj@163.com [Department of Medical Imaging, Jinling Hospital, Medical School of Nanjing University, Nanjing, Jiangsu 210002 (China); Zheng, Gang [Department of Medical Imaging, Jinling Hospital, Medical School of Nanjing University, Nanjing, Jiangsu 210002 (China); College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu 210016 (China); Zhang, Liping [College of Natural Science, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu 210016 (China); Zhong, Jianhui [Department of Biomedical Engineering, Zhejiang University, Hangzhou, Zhejiang 310027 (China); Li, Qiang [College of Natural Science, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu 210016 (China); Zhao, Tie Zhu [Department of Medical Imaging, Jinling Hospital, Medical School of Nanjing University, Nanjing, Jiangsu 210002 (China); College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu 210016 (China); Lu, Guang Ming, E-mail: cjr.luguangming@vip.163.com [Department of Medical Imaging, Jinling Hospital, Medical School of Nanjing University, Nanjing, Jiangsu 210002 (China)

2014-10-15

Purpose: To explore changes in functional connectivity and topological organization of brain functional networks in cirrhotic patients with minimal hepatic encephalopathy (MHE) and non hepatic encephalopathy (nonHE) and their relationship with clinical markers. Materials and methods: Resting-state functional MR imaging was acquired in 22 MHE, 29 nonHE patients and 33 healthy controls. Functional connectivity networks were obtained by computing temporal correlations between any pairs of 90 cortical and subcortical regions. Graph analysis measures were quantitatively assessed for each subject. One-way analysis of covariance was applied to identify statistical differences of functional connectivity and network parameters among three groups. Correlations between clinical markers, such as Child–Pugh scores, venous blood ammonia level, and number connection test type A (NCT-A)/digit symbol test (DST) scores, and connectivity/graph metrics were calculated. Results: Thirty functional connectivities represented by edges were found to be abnormal (P < 0.05, FDR corrected) in cirrhotic patients, in which 16 edges (53.3%) were related with sub-cortical regions. MHE patients showed abnormal small-world attributes in the functional connectivity networks. Cirrhotic patients had significantly reduced nodal degree in 8 cortical regions and increased nodal centrality in 3 cortical regions. Twenty edges were correlated with either NCT-A or DST scores, in which 13 edges were related with sub-cortical regions. No correlation was found between Child–Pugh scores and graph theoretical measures in cirrhotic patients. Conclusion: Disturbances of brain functional connectivity and small world property loss are associated with neurocognitive impairment of cirrhotic patients. Reorganization of brain network occurred during disease progression from nonHE to MHE.

Disrupted small world networks in patients without overt hepatic encephalopathy: A resting state fMRI study

International Nuclear Information System (INIS)

Zhang, Long Jiang; Zheng, Gang; Zhang, Liping; Zhong, Jianhui; Li, Qiang; Zhao, Tie Zhu; Lu, Guang Ming

2014-01-01

Purpose: To explore changes in functional connectivity and topological organization of brain functional networks in cirrhotic patients with minimal hepatic encephalopathy (MHE) and non hepatic encephalopathy (nonHE) and their relationship with clinical markers. Materials and methods: Resting-state functional MR imaging was acquired in 22 MHE, 29 nonHE patients and 33 healthy controls. Functional connectivity networks were obtained by computing temporal correlations between any pairs of 90 cortical and subcortical regions. Graph analysis measures were quantitatively assessed for each subject. One-way analysis of covariance was applied to identify statistical differences of functional connectivity and network parameters among three groups. Correlations between clinical markers, such as Child–Pugh scores, venous blood ammonia level, and number connection test type A (NCT-A)/digit symbol test (DST) scores, and connectivity/graph metrics were calculated. Results: Thirty functional connectivities represented by edges were found to be abnormal (P < 0.05, FDR corrected) in cirrhotic patients, in which 16 edges (53.3%) were related with sub-cortical regions. MHE patients showed abnormal small-world attributes in the functional connectivity networks. Cirrhotic patients had significantly reduced nodal degree in 8 cortical regions and increased nodal centrality in 3 cortical regions. Twenty edges were correlated with either NCT-A or DST scores, in which 13 edges were related with sub-cortical regions. No correlation was found between Child–Pugh scores and graph theoretical measures in cirrhotic patients. Conclusion: Disturbances of brain functional connectivity and small world property loss are associated with neurocognitive impairment of cirrhotic patients. Reorganization of brain network occurred during disease progression from nonHE to MHE

Online worlds as media and communication format

DEFF Research Database (Denmark)

2009-01-01

Digital media and network communication technology have not changed this setup, but rather have opened the possibility for encountering and experiencing additional types of worlds and performing additional types of spatial practices. Being situated online and being globally networked with the pos......Digital media and network communication technology have not changed this setup, but rather have opened the possibility for encountering and experiencing additional types of worlds and performing additional types of spatial practices. Being situated online and being globally networked...... with the possibility of both synchronous and asynchronous communication, digitally mediated worlds provide possible interactions between users which are radically more independent of time and place than the ones facilitated by older media. From this perspective, the concept of online worlds both challenges...... and broadens our understanding of how media shape the world and how the media technology creates new social structures...

ATLAS World-cloud and networking in PanDA

CERN Document Server

Barreiro Megino, Fernando Harald; The ATLAS collaboration; De, Kaushik; Di Girolamo, Alessandro; Walker, Rodney

2016-01-01

The ATLAS computing model was originally designed as static clouds (usually national or geographical groupings of sites) around the Tier 1 centers, which confined tasks and most of the data traffic. Since those early days, the sites' network bandwidth has increased at O(1000) and the difference in functionalities between Tier 1s and Tier 2s has reduced. After years of manual, intermediate solutions, we have now ramped up to full usage of World-cloud, the latest step in the PanDA Workload Management System to increase resource utilization on the ATLAS Grid, for all workflows (MC production, data (re)processing, etc.). We have based the development on two new site concepts. Nuclei sites are the Tier 1s and large Tier 2s, where tasks will be assigned and the output aggregated, and satellites are the sites that will execute the jobs and send the output to their nucleus. Nuclei and satellite sites are dynamically paired by PanDA for each task based on the input data availability, capability matching, site load and...

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.

Effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks

Science.gov (United States)

Sun, Xiaojuan; Perc, Matjaž; Kurths, Jürgen

2017-05-01

In this paper, we study effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks. Our focus is on the impact of two parameters, namely the time delay τ and the probability of partial time delay pdelay, whereby the latter determines the probability with which a connection between two neurons is delayed. Our research reveals that partial time delays significantly affect phase synchronization in this system. In particular, partial time delays can either enhance or decrease phase synchronization and induce synchronization transitions with changes in the mean firing rate of neurons, as well as induce switching between synchronized neurons with period-1 firing to synchronized neurons with period-2 firing. Moreover, in comparison to a neuronal network where all connections are delayed, we show that small partial time delay probabilities have especially different influences on phase synchronization of neuronal networks.

Hemisphere- and gender-related differences in small-world brain networks: a resting-state functional MRI study.

Science.gov (United States)

Tian, Lixia; Wang, Jinhui; Yan, Chaogan; He, Yong

2011-01-01

We employed resting-state functional MRI (R-fMRI) to investigate hemisphere- and gender-related differences in the topological organization of human brain functional networks. Brain networks were first constructed by measuring inter-regional temporal correlations of R-fMRI data within each hemisphere in 86 young, healthy, right-handed adults (38 males and 48 females) followed by a graph-theory analysis. The hemispheric networks exhibit small-world attributes (high clustering and short paths) that are compatible with previous results in the whole-brain functional networks. Furthermore, we found that compared with females, males have a higher normalized clustering coefficient in the right hemispheric network but a lower clustering coefficient in the left hemispheric network, suggesting a gender-hemisphere interaction. Moreover, we observed significant hemisphere-related differences in the regional nodal characteristics in various brain regions, such as the frontal and occipital regions (leftward asymmetry) and the temporal regions (rightward asymmetry), findings that are consistent with previous studies of brain structural and functional asymmetries. Together, our results suggest that the topological organization of human brain functional networks is associated with gender and hemispheres, and they provide insights into the understanding of functional substrates underlying individual differences in behaviors and cognition. Copyright © 2010 Elsevier Inc. All rights reserved.

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.

Markov models for fMRI correlation structure: Is brain functional connectivity small world, or decomposable into networks?

Science.gov (United States)

Varoquaux, G; Gramfort, A; Poline, J B; Thirion, B

2012-01-01

Correlations in the signal observed via functional Magnetic Resonance Imaging (fMRI), are expected to reveal the interactions in the underlying neural populations through hemodynamic response. In particular, they highlight distributed set of mutually correlated regions that correspond to brain networks related to different cognitive functions. Yet graph-theoretical studies of neural connections give a different picture: that of a highly integrated system with small-world properties: local clustering but with short pathways across the complete structure. We examine the conditional independence properties of the fMRI signal, i.e. its Markov structure, to find realistic assumptions on the connectivity structure that are required to explain the observed functional connectivity. In particular we seek a decomposition of the Markov structure into segregated functional networks using decomposable graphs: a set of strongly-connected and partially overlapping cliques. We introduce a new method to efficiently extract such cliques on a large, strongly-connected graph. We compare methods learning different graph structures from functional connectivity by testing the goodness of fit of the model they learn on new data. We find that summarizing the structure as strongly-connected networks can give a good description only for very large and overlapping networks. These results highlight that Markov models are good tools to identify the structure of brain connectivity from fMRI signals, but for this purpose they must reflect the small-world properties of the underlying neural systems. Copyright © 2012 Elsevier Ltd. All rights reserved.

Networks of neuroblastoma cells on porous silicon substrates reveal a small world topology

KAUST Repository

Marinaro, Giovanni; La Rocca, Rosanna; Toma, Andrea; Barberio, Marianna; Cancedda, Laura; Di Fabrizio, Enzo M.; Decuzzi, Paolo C W; Gentile, Francesco T.

2015-01-01

The human brain is a tightly interweaving network of neural cells where the complexity of the network is given by the large number of its constituents and its architecture. The topological structure of neurons in the brain translates into its increased computational capabilities, low energy consumption, and nondeterministic functions, which differentiate human behavior from artificial computational schemes. In this manuscript, we fabricated porous silicon chips with a small pore size ranging from 8 to 75 nm and large fractal dimensions up to Df ∼ 2.8. In culturing neuroblastoma N2A cells on the described substrates, we found that those cells adhere more firmly to and proliferate on the porous surfaces compared to the conventional nominally flat silicon substrates, which were used as controls. More importantly, we observed that N2A cells on the porous substrates create highly clustered, small world topology patterns. We conjecture that neurons with a similar architecture may elaborate information more efficiently than in random or regular grids. Moreover, we hypothesize that systems of neurons on nano-scale geometry evolve in time to form networks in which the propagation of information is maximized. This journal is

The dynamic consequences of cooperation and competition in small-world networks.

Directory of Open Access Journals (Sweden)

Iván Y Fernández-Rosales

Full Text Available We present a study of the social dynamics among cooperative and competitive actors interacting on a complex network that has a small-world topology. In this model, the state of each actor depends on its previous state in time, its inertia to change, and the influence of its neighboring actors. Using numerical simulations, we determine how the distribution of final states of the actors and measures of the distances between the values of the actors at local and global levels, depend on the number of cooperative to competitive actors and the connectivity of the actors in the network. We find that similar numbers of cooperative and competitive actors yield the lowest values for the local and global measures of the distances between the values of the actors. On the other hand, when the number of either cooperative or competitive actors dominate the system, then the divergence is largest between the values of the actors. Our findings make new testable predictions on how the dynamics of a conflict depends on the strategies chosen by groups of actors and also have implications for the evolution of behaviors.

Long-duration transcutaneous electric acupoint stimulation alters small-world brain functional networks.

Science.gov (United States)

Zhang, Yue; Jiang, Yin; Glielmi, Christopher B; Li, Longchuan; Hu, Xiaoping; Wang, Xiaoying; Han, Jisheng; Zhang, Jue; Cui, Cailian; Fang, Jing

2013-09-01

Acupuncture, which is recognized as an alternative and complementary treatment in Western medicine, has long shown efficiencies in chronic pain relief, drug addiction treatment, stroke rehabilitation and other clinical practices. The neural mechanism underlying acupuncture, however, is still unclear. Many studies have focused on the sustained effects of acupuncture on healthy subjects, yet there are very few on the topological organization of functional networks in the whole brain in response to long-duration acupuncture (longer than 20 min). This paper presents a novel study on the effects of long-duration transcutaneous electric acupoint stimulation (TEAS) on the small-world properties of brain functional networks. Functional magnetic resonance imaging was used to construct brain functional networks of 18 healthy subjects (9 males and 9 females) during the resting state. All subjects received both TEAS and minimal TEAS (MTEAS) and were scanned before and after each stimulation. An altered functional network was found with lower local efficiency and no significant change in global efficiency for healthy subjects after TEAS, while no significant difference was observed after MTEAS. The experiments also showed that the nodal efficiencies in several paralimbic/limbic regions were altered by TEAS, and those in middle frontal gyrus and other regions by MTEAS. To remove the psychological effects and the baseline, we compared the difference between diffTEAS (difference between after and before TEAS) and diffMTEAS (difference between after and before MTEAS). The results showed that the local efficiency was decreased and that the nodal efficiencies in frontal gyrus, orbitofrontal cortex, anterior cingulate gyrus and hippocampus gyrus were changed. Based on those observations, we conclude that long-duration TEAS may modulate the short-range connections of brain functional networks and also the limbic system. Copyright © 2013 Elsevier Inc. All rights reserved.

Modeling and Analysis of Epidemic Diffusion within Small-World Network

Directory of Open Access Journals (Sweden)

Ming Liu

2012-01-01

Full Text Available To depict the rule of epidemic diffusion, two different models, the Susceptible-Exposure-Infected-Recovered-Susceptible (SEIRS model and the Susceptible-Exposure-Infected-Quarantine-Recovered-Susceptible (SEIQRS model, are proposed and analyzed within small-world network in this paper. Firstly, the epidemic diffusion models are constructed with mean-filed theory, and condition for the occurrence of disease diffusion is explored. Then, the existence and global stability of the disease-free equilibrium and the endemic equilibrium for these two complex epidemic systems are proved by differential equations knowledge and Routh-Hurwiz theory. At last, a numerical example which includes key parameters analysis and critical topic discussion is presented to test how well the proposed two models may be applied in practice. These works may provide some guidelines for decision makers when coping with epidemic diffusion controlling problems.

MARKET ORIENTATION IN DIGITAL ENTREPRENEURSHIP: ADVANTAGES AND CHALLENGES IN A WEB 2.0 NETWORKED WORLD

OpenAIRE

NEIL HAIR; LYLE R. WETSCH; CLYDE EIRÍKUR HULL; VICTOR PEROTTI; YU-TING CAISY HUNG

2012-01-01

Strong market orientation is essential to firm success. In the diverse and dynamic digital environment, a strong market orientation philosophy is even more important to the digital entrepreneur. We explore the advantages and challenges that the networked world offers the market-oriented digital entrepreneur. In particular, we examine the role of electronic community and communication and how successful digital entrepreneurs takes advantage of electronic community technologies to facilitate mo...

Measuring the potential of individual airports for pandemic spread over the world airline network.

Science.gov (United States)

Lawyer, Glenn

2016-02-09

Massive growth in human mobility has dramatically increased the risk and rate of pandemic spread. Macro-level descriptors of the topology of the World Airline Network (WAN) explains middle and late stage dynamics of pandemic spread mediated by this network, but necessarily regard early stage variation as stochastic. We propose that much of this early stage variation can be explained by appropriately characterizing the local network topology surrounding an outbreak's debut location. Based on a model of the WAN derived from public data, we measure for each airport the expected force of infection (AEF) which a pandemic originating at that airport would generate, assuming an epidemic process which transmits from airport to airport via scheduled commercial flights. We observe, for a subset of world airports, the minimum transmission rate at which a disease becomes pandemically competent at each airport. We also observe, for a larger subset, the time until a pandemically competent outbreak achieves pandemic status given its debut location. Observations are generated using a highly sophisticated metapopulation reaction-diffusion simulator under a disease model known to well replicate the 2009 influenza pandemic. The robustness of the AEF measure to model misspecification is examined by degrading the underlying model WAN. AEF powerfully explains pandemic risk, showing correlation of 0.90 to the transmission level needed to give a disease pandemic competence, and correlation of 0.85 to the delay until an outbreak becomes a pandemic. The AEF is robust to model misspecification. For 97 % of airports, removing 15 % of airports from the model changes their AEF metric by less than 1 %. Appropriately summarizing the size, shape, and diversity of an airport's local neighborhood in the WAN accurately explains much of the macro-level stochasticity in pandemic outcomes.

World science

International Nuclear Information System (INIS)

Anon.

1989-01-01

The aim of the Third World Network of Scientific Organizations (TWNSO), established last year with its headquarters in Trieste, Italy, is to promote the role of science and technology in developing countries. TWNSO, under the presidency of Abdus Salam, is an offshoot of the Third World Academy of Sciences, which has pushed the cause of international scientific collaboration since its establishment in 1983. (orig./HSI).

Small Worlds and Cultural Polarization

NARCIS (Netherlands)

Flache, Andreas; Macy, Michael W.

2011-01-01

Building on Granovetter's theory of the "strength of weak ties,'' research on "small-world'' networks suggests that bridges between clusters in a social network (long-range ties) promote cultural diffusion, homogeneity, and integration. We show that this macro-level implication of network structure

Algebraic approach to small-world network models

Science.gov (United States)

Rudolph-Lilith, Michelle; Muller, Lyle E.

2014-01-01

We introduce an analytic model for directed Watts-Strogatz small-world graphs and deduce an algebraic expression of its defining adjacency matrix. The latter is then used to calculate the small-world digraph's asymmetry index and clustering coefficient in an analytically exact fashion, valid nonasymptotically for all graph sizes. The proposed approach is general and can be applied to all algebraically well-defined graph-theoretical measures, thus allowing for an analytical investigation of finite-size small-world graphs.

Infection dynamics on spatial small-world network models

Science.gov (United States)

Iotti, Bryan; Antonioni, Alberto; Bullock, Seth; Darabos, Christian; Tomassini, Marco; Giacobini, Mario

2017-11-01

The study of complex networks, and in particular of social networks, has mostly concentrated on relational networks, abstracting the distance between nodes. Spatial networks are, however, extremely relevant in our daily lives, and a large body of research exists to show that the distances between nodes greatly influence the cost and probability of establishing and maintaining a link. A random geometric graph (RGG) is the main type of synthetic network model used to mimic the statistical properties and behavior of many social networks. We propose a model, called REDS, that extends energy-constrained RGGs to account for the synergic effect of sharing the cost of a link with our neighbors, as is observed in real relational networks. We apply both the standard Watts-Strogatz rewiring procedure and another method that conserves the degree distribution of the network. The second technique was developed to eliminate unwanted forms of spatial correlation between the degree of nodes that are affected by rewiring, limiting the effect on other properties such as clustering and assortativity. We analyze both the statistical properties of these two network types and their epidemiological behavior when used as a substrate for a standard susceptible-infected-susceptible compartmental model. We consider and discuss the differences in properties and behavior between RGGs and REDS as rewiring increases and as infection parameters are changed. We report considerable differences both between the network types and, in the case of REDS, between the two rewiring schemes. We conclude that REDS represent, with the application of these rewiring mechanisms, extremely useful and interesting tools in the study of social and epidemiological phenomena in synthetic complex networks.

Spatiotemporal dynamics on small-world neuronal networks: The roles of two types of time-delayed coupling

Energy Technology Data Exchange (ETDEWEB)

Wu Hao; Jiang Huijun [Hefei National Laboratory for Physical Sciences at the Microscale and Department of Chemical Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); Hou Zhonghuai, E-mail: hzhlj@ustc.edu.cn [Hefei National Laboratory for Physical Sciences at the Microscale and Department of Chemical Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China)

2011-10-15

Highlights: > We compare neuronal dynamics in dependence on two types of delayed coupling. > Distinct results induced by different delayed coupling can be achieved. > Time delays in type 1 coupling can induce a most spatiotemporal ordered state. > For type 2 coupling, the systems exhibit synchronization transitions with delay. - Abstract: We investigate temporal coherence and spatial synchronization on small-world networks consisting of noisy Terman-Wang (TW) excitable neurons in dependence on two types of time-delayed coupling: {l_brace}x{sub j}(t - {tau}) - x{sub i}(t){r_brace} and {l_brace}x{sub j}(t - {tau}) - x{sub i}(t - {tau}){r_brace}. For the former case, we show that time delay in the coupling can dramatically enhance temporal coherence and spatial synchrony of the noise-induced spike trains. In addition, if the delay time {tau} is tuned to nearly match the intrinsic spike period of the neuronal network, the system dynamics reaches a most ordered state, which is both periodic in time and nearly synchronized in space, demonstrating an interesting resonance phenomenon with delay. For the latter case, however, we cannot achieve a similar spatiotemporal ordered state, but the neuronal dynamics exhibits interesting synchronization transitions with time delay from zigzag fronts of excitations to dynamic clustering anti-phase synchronization (APS), and further to clustered chimera states which have spatially distributed anti-phase coherence separated by incoherence. Furthermore, we also show how these findings are influenced by the change of the noise intensity and the rewiring probability of the small-world networks. Finally, qualitative analysis is given to illustrate the numerical results.

Spatiotemporal dynamics on small-world neuronal networks: The roles of two types of time-delayed coupling

International Nuclear Information System (INIS)

Wu Hao; Jiang Huijun; Hou Zhonghuai

2011-01-01

Highlights: → We compare neuronal dynamics in dependence on two types of delayed coupling. → Distinct results induced by different delayed coupling can be achieved. → Time delays in type 1 coupling can induce a most spatiotemporal ordered state. → For type 2 coupling, the systems exhibit synchronization transitions with delay. - Abstract: We investigate temporal coherence and spatial synchronization on small-world networks consisting of noisy Terman-Wang (TW) excitable neurons in dependence on two types of time-delayed coupling: {x j (t - τ) - x i (t)} and {x j (t - τ) - x i (t - τ)}. For the former case, we show that time delay in the coupling can dramatically enhance temporal coherence and spatial synchrony of the noise-induced spike trains. In addition, if the delay time τ is tuned to nearly match the intrinsic spike period of the neuronal network, the system dynamics reaches a most ordered state, which is both periodic in time and nearly synchronized in space, demonstrating an interesting resonance phenomenon with delay. For the latter case, however, we cannot achieve a similar spatiotemporal ordered state, but the neuronal dynamics exhibits interesting synchronization transitions with time delay from zigzag fronts of excitations to dynamic clustering anti-phase synchronization (APS), and further to clustered chimera states which have spatially distributed anti-phase coherence separated by incoherence. Furthermore, we also show how these findings are influenced by the change of the noise intensity and the rewiring probability of the small-world networks. Finally, qualitative analysis is given to illustrate the numerical results.

Where value lives in a networked world.

Science.gov (United States)

Sawhney, M; Parikh, D

2001-01-01

While many management thinkers proclaim an era of radical uncertainty, authors Sawhney and Parikh assert that the seemingly endless upheavals of the digital age are more predictable than that: today's changes have a common root, and that root lies in the nature of intelligence in networks. Understanding the patterns of intelligence migration can help companies decipher and plan for the inevitable disruptions in today's business environment. Two patterns in network intelligence are reshaping industries and organizations. First, intelligence is decoupling--that is, modern high-speed networks are pushing back-end intelligence and front-end intelligence toward opposite ends of the network, making the ends the two major sources of potential profits. Second, intelligence is becoming more fluid and modular. Small units of intelligence now float freely like molecules in the ether, coalescing into temporary bundles whenever and wherever necessary to solve problems. The authors present four strategies that companies can use to profit from these patterns: arbitrage allows companies to move intelligence to new regions or countries where the cost of maintaining intelligence is lower; aggregation combines formerly isolated pieces of infrastructure intelligence into a large pool of shared infrastructure provided over a network; rewiring allows companies to connect islands of intelligence by creating common information backbones; and reassembly allows businesses to reorganize pieces of intelligence into coherent, personalized packages for customers. By being aware of patterns in network intelligence and by acting rather than reacting, companies can turn chaos into opportunity, say the authors.

Plasticity-induced characteristic changes of pattern dynamics and the related phase transitions in small-world neuronal networks

International Nuclear Information System (INIS)

Huang Xu-Hui; Hu Gang

2014-01-01

Phase transitions widely exist in nature and occur when some control parameters are changed. In neural systems, their macroscopic states are represented by the activity states of neuron populations, and phase transitions between different activity states are closely related to corresponding functions in the brain. In particular, phase transitions to some rhythmic synchronous firing states play significant roles on diverse brain functions and disfunctions, such as encoding rhythmical external stimuli, epileptic seizure, etc. However, in previous studies, phase transitions in neuronal networks are almost driven by network parameters (e.g., external stimuli), and there has been no investigation about the transitions between typical activity states of neuronal networks in a self-organized way by applying plastic connection weights. In this paper, we discuss phase transitions in electrically coupled and lattice-based small-world neuronal networks (LBSW networks) under spike-timing-dependent plasticity (STDP). By applying STDP on all electrical synapses, various known and novel phase transitions could emerge in LBSW networks, particularly, the phenomenon of self-organized phase transitions (SOPTs): repeated transitions between synchronous and asynchronous firing states. We further explore the mechanics generating SOPTs on the basis of synaptic weight dynamics. (interdisciplinary physics and related areas of science and technology)

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.

Collective Classification in Network Data

OpenAIRE

Sen, Prithviraj; Namata, Galileo; Bilgic, Mustafa; Getoor, Lise; University of Maryland; Galligher, Brian; Eliassi-Rad, Tina

2008-01-01

Many real-world applications produce networked data such as the world-wide web (hypertext documents connected via hyperlinks), social networks (for example, people connected by friendship links), communication networks (computers connected via communication links) and biological networks (for example, protein interaction networks). A recent focus in machine learning research has been to extend traditional machine learning classification techniques to classify nodes in such networks. In this a...

The World Radiation Monitoring Center of the Baseline Surface Radiation Network: Status 2017

Science.gov (United States)

Driemel, Amelie; König-Langlo, Gert; Sieger, Rainer; Long, Charles N.

2017-04-01

The World Radiation Monitoring Center (WRMC) is the central archive of the Baseline Surface Radiation Network (BSRN). The BSRN was initiated by the World Climate Research Programme (WCRP) Working Group on Radiative Fluxes and began operations in 1992. One of its aims is to provide short and long-wave surface radiation fluxes of the best possible quality to support the research projects of the WCRP and other scientific projects. The high quality, uniform and consistent measurements of the BSRN network can be used to monitor the short- and long-wave radiative components and their changes with the best methods currently available, to validate and evaluate satellite-based estimates of the surface radiative fluxes, and to verify the results of global climate models. In 1992 the BSRN/WRMC started at ETH Zurich, Switzerland with 9 stations. Since 2007 the archive is hosted by the Alfred-Wegener-Institut (AWI) in Bremerhaven, Germany (http://www.bsrn.awi.de/) and comprises a network of currently 59 stations in contrasting climatic zones, covering a latitude range from 80°N to 90°S. Of the 59 stations, 23 offer the complete radiation budget (down- and upwelling short- and long-wave data). In addition to the ftp-service access instituted at ETH Zurich, the archive at AWI offers data access via PANGAEA - Data Publisher for Earth & Environmental Science (https://www.pangaea.de). PANGAEA guarantees the long-term availability of its content through a commitment of the operating institutions. Within PANGAEA, the metadata of the stations are freely available. To access the data itself an account is required. If the scientist accepts to follow the data release guidelines of the archive (http://bsrn.awi.de/data/conditions-of-data-release/) he or she can get an account from amelie.driemel@awi.de. Currently, more than 9,400 station months (>780 years) are available for interested scientists (see also https://dataportals.pangaea.de/bsrn/?q=LR0100 for an overview on available data

Guidelines for a Changing World

Science.gov (United States)

Wood, Jo Nell; Brack, Karen

2011-01-01

This article investigates the issues surrounding teachers' use of social networking media and their First Amendment rights. It focuses on the need to develop a school district policy outlining specific guidelines for the use of technology and social networking. It also focuses on the changing world of technology and social networking as well as…

Autaptic pacemaker mediated propagation of weak rhythmic activity across small-world neuronal networks

Science.gov (United States)

Yilmaz, Ergin; Baysal, Veli; Ozer, Mahmut; Perc, Matjaž

2016-02-01

We study the effects of an autapse, which is mathematically described as a self-feedback loop, on the propagation of weak, localized pacemaker activity across a Newman-Watts small-world network consisting of stochastic Hodgkin-Huxley neurons. We consider that only the pacemaker neuron, which is stimulated by a subthreshold periodic signal, has an electrical autapse that is characterized by a coupling strength and a delay time. We focus on the impact of the coupling strength, the network structure, the properties of the weak periodic stimulus, and the properties of the autapse on the transmission of localized pacemaker activity. Obtained results indicate the existence of optimal channel noise intensity for the propagation of the localized rhythm. Under optimal conditions, the autapse can significantly improve the propagation of pacemaker activity, but only for a specific range of the autaptic coupling strength. Moreover, the autaptic delay time has to be equal to the intrinsic oscillation period of the Hodgkin-Huxley neuron or its integer multiples. We analyze the inter-spike interval histogram and show that the autapse enhances or suppresses the propagation of the localized rhythm by increasing or decreasing the phase locking between the spiking of the pacemaker neuron and the weak periodic signal. In particular, when the autaptic delay time is equal to the intrinsic period of oscillations an optimal phase locking takes place, resulting in a dominant time scale of the spiking activity. We also investigate the effects of the network structure and the coupling strength on the propagation of pacemaker activity. We find that there exist an optimal coupling strength and an optimal network structure that together warrant an optimal propagation of the localized rhythm.

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.

Inferring general relations between network characteristics from specific network ensembles.

Science.gov (United States)

Cardanobile, Stefano; Pernice, Volker; Deger, Moritz; Rotter, Stefan

2012-01-01

Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely considered to which degree the results obtained for one particular network class can be extrapolated to real-world networks. We address this issue by comparing different classical and more recently developed network models with respect to their ability to generate networks with large structural variability. In particular, we consider the statistical constraints which the respective construction scheme imposes on the generated networks. After having identified the most variable networks, we address the issue of which constraints are common to all network classes and are thus suitable candidates for being generic statistical laws of complex networks. In fact, we find that generic, not model-related dependencies between different network characteristics do exist. This makes it possible to infer global features from local ones using regression models trained on networks with high generalization power. Our results confirm and extend previous findings regarding the synchronization properties of neural networks. Our method seems especially relevant for large networks, which are difficult to map completely, like the neural networks in the brain. The structure of such large networks cannot be fully sampled with the present technology. Our approach provides a method to estimate global properties of under-sampled networks in good approximation. Finally, we demonstrate on three different data sets (C. elegans neuronal network, R. prowazekii metabolic network, and a network of synonyms extracted from Roget's Thesaurus) that real-world networks have statistical relations compatible with those obtained using regression models.

SmallWorld Behavior of the Worldwide Active Volcanoes Network: Preliminary Results

Science.gov (United States)

Spata, A.; Bonforte, A.; Nunnari, G.; Puglisi, G.

2009-12-01

We propose a preliminary complex networks based approach in order to model and characterize volcanoes activity correlation observed on a planetary scale over the last two thousand years. Worldwide volcanic activity is in fact related to the general plate tectonics that locally drives the faults activity, that in turn controls the magma upraise beneath the volcanoes. To find correlations among different volcanoes could indicate a common underlying mechanism driving their activity and could help us interpreting the deeper common dynamics controlling their unrest. All the first evidences found testing the procedure, suggest the suitability of this analysis to investigate global volcanism related to plate tectonics. The first correlations found, in fact, indicate that an underlying common large-scale dynamics seems to drive volcanic activity at least around the Pacific plate, where it collides and subduces beneath American, Eurasian and Australian plates. From this still preliminary analysis, also more complex relationships among volcanoes lying on different tectonic margins have been found, suggesting some more complex interrelationships between different plates. The understanding of eventually detected correlations could be also used to further implement warning systems, relating the unrest probabilities of a specific volcano also to the ongoing activity to the correlated ones. Our preliminary results suggest that, as for other many physical and biological systems, an underlying organizing principle of planetary volcanoes activity might exist and it could be a small-world principle. In fact we found that, from a topological perspective, volcanoes correlations are characterized by the typical features of small-world network: a high clustering coefficient and a low characteristic path length. These features confirm that global volcanoes activity is characterized by both short and long-range correlations. We stress here the fact that numerical simulation carried out in

Quality of Care as an Emergent Phenomenon out of a Small-World Network of Relational Actors.

Science.gov (United States)

Fiorini, Rodolfo; De Giacomo, Piero; Marconi, Pier Luigi; L'Abate, Luciano

2014-01-01

In Healthcare Decision Support System, the development and evaluation of effective "Quality of Care" (QOC) indicators, in simulation-based training, are key feature to develop resilient and antifragile organization scenarios. Is it possible to conceive of QOC not only as a result of a voluntary and rational decision, imposed or even not, but also as an overall system "emergent phenomenon" out of a small-world network of relational synthetic actors, endowed with their own personality profiles to simulate human behaviour (for short, called "subjects")? In order to answer this question and to observe the phenomena of real emergence we should use computational models of high complexity, with heavy computational load and extensive computational time. Nevertheless, De Giacomo's Elementary Pragmatic Model (EPM) intrinsic self-reflexive functional logical closure enables to run simulation examples to classify the outcomes grown out of a small-world network of relational subjects fast and effectively. Therefore, it is possible to take note and to learn of how much strategic systemic interventions can induce context conditions of QOC facilitation, which can improve the effectiveness of specific actions, which otherwise might be paradoxically counterproductive also. Early results are so encouraging to use EPM as basic block to start designing more powerful Evolutive Elementary Pragmatic Model (E2PM) for real emergence computational model, to cope with ontological uncertainty at system level.

A dynamical characterization of the small world phase

Energy Technology Data Exchange (ETDEWEB)

Araujo, Tanya; Vilela Mendes, R.; Seixas, Joao

2003-12-08

Small-world (SW) networks have been identified in many different fields. Topological coefficients like the clustering coefficient and the characteristic path length have been used in the past for a qualitative characterization of these networks. Here a dynamical approach is used to characterize the small-world phenomenon. Using the Watts-Strogatz {beta}-model, a coupled map dynamical system is defined on the network. Entrance to and exit from the SW phase are related to the behavior of the ergodic invariants of the dynamics.

A dynamical characterization of the small world phase

International Nuclear Information System (INIS)

Araujo, Tanya; Vilela Mendes, R.; Seixas, Joao

2003-01-01

Small-world (SW) networks have been identified in many different fields. Topological coefficients like the clustering coefficient and the characteristic path length have been used in the past for a qualitative characterization of these networks. Here a dynamical approach is used to characterize the small-world phenomenon. Using the Watts-Strogatz β-model, a coupled map dynamical system is defined on the network. Entrance to and exit from the SW phase are related to the behavior of the ergodic invariants of the dynamics

Resilience of networks to environmental stress: From regular to random networks

Science.gov (United States)

Eom, Young-Ho

2018-04-01

Despite the huge interest in network resilience to stress, most of the studies have concentrated on internal stress damaging network structure (e.g., node removals). Here we study how networks respond to environmental stress deteriorating their external conditions. We show that, when regular networks gradually disintegrate as environmental stress increases, disordered networks can suddenly collapse at critical stress with hysteresis and vulnerability to perturbations. We demonstrate that this difference results from a trade-off between node resilience and network resilience to environmental stress. The nodes in the disordered networks can suppress their collapses due to the small-world topology of the networks but eventually collapse all together in return. Our findings indicate that some real networks can be highly resilient against environmental stress to a threshold yet extremely vulnerable to the stress above the threshold because of their small-world topology.

Tobacco Industry vs. the World Health Organization: a historical confrontation between social networks of stakeholders

Directory of Open Access Journals (Sweden)

Sérgio Boeira

2007-04-01

Full Text Available The aim of this article is to present an introduction to the history of the tobacco industry and the confrontation between its social network of stakeholders and the network led by the World Health Organization (WHO, with a focus on the Brazilian context and the role of the Alliance for the Control of Tobacco Use (ACT as the coordinator of multiple stakeholders opposing the tobacco industry strategies in Brazil. The article seeks to describe the problematic relationship between tobacco production and export on the one hand and tobacco control on the other, as exemplified by the approval, in February 2005, of the first international public health treaty (WHO Framework Convention for Tobacco Control. The text is based on research leading to a PhD thesis in 2000, which has been updated through articles and ongoing research since then, with the aim of monitoring the unfolding of this issue that is central to the public health policies

Making “World Machines”

DEFF Research Database (Denmark)

Light, Ann; Bardzell, Jeffrey; Bardzell, Shaowen

2015-01-01

be combined and turned to crowd-sourcing public engagement with shared world issues - as an alternative to business-as-usual in the context of developing and deploying networked technology. We combine theoretical aspects of world machines, such as what a political entity of this kind might seek to do......The world machine is a new archetype for a socio-technical system drawing together a group of tools that combine computational powers with a social agenda of cross-world collaboration in resistance to dominant market rhetoric. Specifically, we look at how powers to connect, sense and infer can...

Current-flow efficiency of networks

Science.gov (United States)

Liu, Kai; Yan, Xiaoyong

2018-02-01

Many real-world networks, from infrastructure networks to social and communication networks, can be formulated as flow networks. How to realistically measure the transport efficiency of these networks is of fundamental importance. The shortest-path-based efficiency measurement has limitations, as it assumes that flow travels only along those shortest paths. Here, we propose a new metric named current-flow efficiency, in which we calculate the average reciprocal effective resistance between all pairs of nodes in the network. This metric takes the multipath effect into consideration and is more suitable for measuring the efficiency of many real-world flow equilibrium networks. Moreover, this metric can handle a disconnected graph and can thus be used to identify critical nodes and edges from the efficiency-loss perspective. We further analyze how the topological structure affects the current-flow efficiency of networks based on some model and real-world networks. Our results enable a better understanding of flow networks and shed light on the design and improvement of such networks with higher transport efficiency.

Behavioral and network origins of wealth inequality: insights from a virtual world.

Directory of Open Access Journals (Sweden)

Benedikt Fuchs

Full Text Available Almost universally, wealth is not distributed uniformly within societies or economies. Even though wealth data have been collected in various forms for centuries, the origins for the observed wealth-disparity and social inequality are not yet fully understood. Especially the impact and connections of human behavior on wealth could so far not be inferred from data. Here we study wealth data from the virtual economy of the massive multiplayer online game (MMOG Pardus. This data not only contains every player's wealth at every point in time, but also all actions over a timespan of almost a decade. We find that wealth distributions in the virtual world are very similar to those in Western countries. In particular we find an approximate exponential distribution for low wealth levels and a power-law tail for high levels. The Gini index is found to be g = 0.65, which is close to the indices of many Western countries. We find that wealth-increase rates depend on the time when players entered the game. Players that entered the game early on tend to have remarkably higher wealth-increase rates than those who joined later. Studying the players' positions within their social networks, we find that the local position in the trade network is most relevant for wealth. Wealthy people have high in- and out-degrees in the trade network, relatively low nearest-neighbor degrees, and low clustering coefficients. Wealthy players have many mutual friendships and are socially well respected by others, but spend more time on business than on socializing. Wealthy players have few personal enemies, but show animosity towards players that behave as public enemies. We find that players that are not organized within social groups are significantly poorer on average. We observe that "political" status and wealth go hand in hand.

Behavioral and network origins of wealth inequality: insights from a virtual world.

Science.gov (United States)

Fuchs, Benedikt; Thurner, Stefan

2014-01-01

Almost universally, wealth is not distributed uniformly within societies or economies. Even though wealth data have been collected in various forms for centuries, the origins for the observed wealth-disparity and social inequality are not yet fully understood. Especially the impact and connections of human behavior on wealth could so far not be inferred from data. Here we study wealth data from the virtual economy of the massive multiplayer online game (MMOG) Pardus. This data not only contains every player's wealth at every point in time, but also all actions over a timespan of almost a decade. We find that wealth distributions in the virtual world are very similar to those in Western countries. In particular we find an approximate exponential distribution for low wealth levels and a power-law tail for high levels. The Gini index is found to be g = 0.65, which is close to the indices of many Western countries. We find that wealth-increase rates depend on the time when players entered the game. Players that entered the game early on tend to have remarkably higher wealth-increase rates than those who joined later. Studying the players' positions within their social networks, we find that the local position in the trade network is most relevant for wealth. Wealthy people have high in- and out-degrees in the trade network, relatively low nearest-neighbor degrees, and low clustering coefficients. Wealthy players have many mutual friendships and are socially well respected by others, but spend more time on business than on socializing. Wealthy players have few personal enemies, but show animosity towards players that behave as public enemies. We find that players that are not organized within social groups are significantly poorer on average. We observe that "political" status and wealth go hand in hand.

IMMANUEL WALLERSTEIN'S WORLD SYSTEM THEORY

Directory of Open Access Journals (Sweden)

Cosma Sorinel

2010-12-01

Full Text Available World-systems analysis is not a theory, but an approach to social analysis and social change developed, among others by the Immanuel Wallerstein. Professor Wallerstein writes in three domains of world-systems analysis: the historical development of the modern world-system; the contemporary crisis of the capitalist world-economy; the structures of knowledge. The American anlyst rejects the notion of a "Third World", claiming there is only one world connected by a complex network of economic exchange relationship. Our world system is characterized by mechanisms which bring about a redistribution of resources from the periphery to the core. His analytical approach has made a significant impact and established an institutional base devoted to the general approach.

Ripple-Spreading Network Model Optimization by Genetic Algorithm

Directory of Open Access Journals (Sweden)

Xiao-Bing Hu

2013-01-01

Full Text Available Small-world and scale-free properties are widely acknowledged in many real-world complex network systems, and many network models have been developed to capture these network properties. The ripple-spreading network model (RSNM is a newly reported complex network model, which is inspired by the natural ripple-spreading phenomenon on clam water surface. The RSNM exhibits good potential for describing both spatial and temporal features in the development of many real-world networks where the influence of a few local events spreads out through nodes and then largely determines the final network topology. However, the relationships between ripple-spreading related parameters (RSRPs of RSNM and small-world and scale-free topologies are not as obvious or straightforward as in many other network models. This paper attempts to apply genetic algorithm (GA to tune the values of RSRPs, so that the RSNM may generate these two most important network topologies. The study demonstrates that, once RSRPs are properly tuned by GA, the RSNM is capable of generating both network topologies and therefore has a great flexibility to study many real-world complex network systems.

Large Scale Community Detection Using a Small World Model

Directory of Open Access Journals (Sweden)

Ranjan Kumar Behera

2017-11-01

Full Text Available In a social network, small or large communities within the network play a major role in deciding the functionalities of the network. Despite of diverse definitions, communities in the network may be defined as the group of nodes that are more densely connected as compared to nodes outside the group. Revealing such hidden communities is one of the challenging research problems. A real world social network follows small world phenomena, which indicates that any two social entities can be reachable in a small number of steps. In this paper, nodes are mapped into communities based on the random walk in the network. However, uncovering communities in large-scale networks is a challenging task due to its unprecedented growth in the size of social networks. A good number of community detection algorithms based on random walk exist in literature. In addition, when large-scale social networks are being considered, these algorithms are observed to take considerably longer time. In this work, with an objective to improve the efficiency of algorithms, parallel programming framework like Map-Reduce has been considered for uncovering the hidden communities in social network. The proposed approach has been compared with some standard existing community detection algorithms for both synthetic and real-world datasets in order to examine its performance, and it is observed that the proposed algorithm is more efficient than the existing ones.

Directed network modules

International Nuclear Information System (INIS)

Palla, Gergely; Farkas, Illes J; Pollner, Peter; Derenyi, Imre; Vicsek, Tamas

2007-01-01

A search technique locating network modules, i.e. internally densely connected groups of nodes in directed networks is introduced by extending the clique percolation method originally proposed for undirected networks. After giving a suitable definition for directed modules we investigate their percolation transition in the Erdos-Renyi graph both analytically and numerically. We also analyse four real-world directed networks, including Google's own web-pages, an email network, a word association graph and the transcriptional regulatory network of the yeast Saccharomyces cerevisiae. The obtained directed modules are validated by additional information available for the nodes. We find that directed modules of real-world graphs inherently overlap and the investigated networks can be classified into two major groups in terms of the overlaps between the modules. Accordingly, in the word-association network and Google's web-pages, overlaps are likely to contain in-hubs, whereas the modules in the email and transcriptional regulatory network tend to overlap via out-hubs

Complex Network Analysis of Guangzhou Metro

OpenAIRE

Yasir Tariq Mohmand; Fahad Mehmood; Fahd Amjad; Nedim Makarevic

2015-01-01

The structure and properties of public transportation networks can provide suggestions for urban planning and public policies. This study contributes a complex network analysis of the Guangzhou metro. The metro network has 236 kilometers of track and is the 6th busiest metro system of the world. In this paper topological properties of the network are explored. We observed that the network displays small world properties and is assortative in nature. The network possesses a high average degree...

Hazard tolerance of spatially distributed complex networks

International Nuclear Information System (INIS)

Dunn, Sarah; Wilkinson, Sean

2017-01-01

In this paper, we present a new methodology for quantifying the reliability of complex systems, using techniques from network graph theory. In recent years, network theory has been applied to many areas of research and has allowed us to gain insight into the behaviour of real systems that would otherwise be difficult or impossible to analyse, for example increasingly complex infrastructure systems. Although this work has made great advances in understanding complex systems, the vast majority of these studies only consider a systems topological reliability and largely ignore their spatial component. It has been shown that the omission of this spatial component can have potentially devastating consequences. In this paper, we propose a number of algorithms for generating a range of synthetic spatial networks with different topological and spatial characteristics and identify real-world networks that share the same characteristics. We assess the influence of nodal location and the spatial distribution of highly connected nodes on hazard tolerance by comparing our generic networks to benchmark networks. We discuss the relevance of these findings for real world networks and show that the combination of topological and spatial configurations renders many real world networks vulnerable to certain spatial hazards. - Highlights: • We develop a method for quantifying the reliability of real-world systems. • We assess the spatial resilience of synthetic spatially distributed networks. • We form algorithms to generate spatial scale-free and exponential networks. • We show how these “synthetic” networks are proxies for real world systems. • Conclude that many real world systems are vulnerable to spatially coherent hazard.

Researching virtual worlds methodologies for studying emergent practices

CERN Document Server

Phillips, Louise

2013-01-01

This volume presents a wide range of methodological strategies that are designed to take into account the complex, emergent, and continually shifting character of virtual worlds. It interrogates how virtual worlds emerge as objects of study through the development and application of various methodological strategies. Virtual worlds are not considered objects that exist as entities with fixed attributes independent of our continuous engagement with them and interpretation of them. Instead, they are conceived of as complex ensembles of technology, humans, symbols, discourses, and economic structures, ensembles that emerge in ongoing practices and specific situations. A broad spectrum of perspectives and methodologies is presented: Actor-Network-Theory and post-Actor-Network-Theory, performativity theory, ethnography, discourse analysis, Sense-Making Methodology, visual ethnography, multi-sited ethnography, and Social Network Analysis.

A New World of Mathematics Thinking

Science.gov (United States)

Schwartz, James E.

2010-01-01

The "flat" world described by Friedman (2006) is one of global supply chains and economic networks, outsourcing, international personal entrepreneurial opportunities, and nearly unlimited, universal information availability. American children will inherit a world in which their competition and opportunities are international. In light of these…

Network charges in a low CO2 world

Science.gov (United States)

Rubino, Alessandro

2018-04-01

New and emerging energy consumption patterns driven by the rise of prosumers may lead to under-recovery of network costs under current network charges, so new tariffs are being sought. A study using detailed household consumption data now illustrates the potentially disproportionate impact of different tariffs on household budgets.

A good supply network must have one`s feet firmly on the ground. 1. Problem and solutions in the world - 2. The new french development

Energy Technology Data Exchange (ETDEWEB)

Griffel, D.; Bergeal, J.; Berthet, L. [Electricite de France (EDF), 92 - Clamart (France)

1995-07-01

Various neutral grounding techniques are applied in distribution networks throughout the world. On MV networks, there is plenty of choice. This is due to the fact that implementation of a particular grounding solution is the result of compromise between several objectives which are sometimes contradictory such as: the physical characteristics of the networks, the type and density of loads and the importance awarded to safety and power supply quality. We summarize the major possible alternatives together with their pros and cons. (authors).

Extending Resolution of Fault Slip With Geodetic Networks Through Optimal Network Design

Science.gov (United States)

Sathiakumar, Sharadha; Barbot, Sylvain Denis; Agram, Piyush

2017-12-01

Geodetic networks consisting of high precision and high rate Global Navigation Satellite Systems (GNSS) stations continuously monitor seismically active regions of the world. These networks measure surface displacements and the amount of geodetic strain accumulated in the region and give insight into the seismic potential. SuGar (Sumatra GPS Array) in Sumatra, GEONET (GNSS Earth Observation Network System) in Japan, and PBO (Plate Boundary Observatory) in California are some examples of established networks around the world that are constantly expanding with the addition of new stations to improve the quality of measurements. However, installing new stations to existing networks is tedious and expensive. Therefore, it is important to choose suitable locations for new stations to increase the precision obtained in measuring the geophysical parameters of interest. Here we describe a methodology to design optimal geodetic networks that augment the existing system and use it to investigate seismo-tectonics at convergent and transform boundaries considering land-based and seafloor geodesy. The proposed network design optimization would be pivotal to better understand seismic and tsunami hazards around the world. Land-based and seafloor networks can monitor fault slip around subduction zones with significant resolution, but transform faults are more challenging to monitor due to their near-vertical geometry.

Google matrix analysis of directed networks

Science.gov (United States)

Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.

2015-10-01

In the past decade modern societies have developed enormous communication and social networks. Their classification and information retrieval processing has become a formidable task for the society. Because of the rapid growth of the World Wide Web, and social and communication networks, new mathematical methods have been invented to characterize the properties of these networks in a more detailed and precise way. Various search engines extensively use such methods. It is highly important to develop new tools to classify and rank a massive amount of network information in a way that is adapted to internal network structures and characteristics. This review describes the Google matrix analysis of directed complex networks demonstrating its efficiency using various examples including the World Wide Web, Wikipedia, software architectures, world trade, social and citation networks, brain neural networks, DNA sequences, and Ulam networks. The analytical and numerical matrix methods used in this analysis originate from the fields of Markov chains, quantum chaos, and random matrix theory.

Role of Social Networks in Developing Religious and Social Values of the Students of the World Islamic Sciences & Education University

Science.gov (United States)

Al-Mosa, Nosiba Ali

2015-01-01

The study aimed to identify the role of Social Networks in the social and religious values of The World Islamic Sciences & Education University students. The study applied the survey and descriptive Approach. The population of the study represents all BA students who enrolled in the first academic semester for the year 2014-2015. The sample of…

Carbon Reduction Strategies Based on an NW Small-World Network with a Progressive Carbon Tax

Directory of Open Access Journals (Sweden)

Bin Wu

2017-09-01

Full Text Available There is an increasingly urgent need to reduce carbon emissions. Devising effective carbon tax policies has become an important research topic. It is necessary to explore carbon reduction strategies based on the design of carbon tax elements. In this study, we explore the effect of a progressive carbon tax policy on carbon emission reductions using the logical deduction method. We apply experience-weighted attraction learning theory to construct an evolutionary game model for enterprises with different levels of energy consumption in an NW small-world network, and study their strategy choices when faced with a progressive carbon tax policy. The findings suggest that enterprises that adopt other energy consumption strategies gradually transform to a low energy consumption strategy, and that this trend eventually spreads to the entire system. With other conditions unchanged, the rate at which enterprises change to a low energy consumption strategy becomes faster as the discount coefficient, the network externality, and the expected adjustment factor increase. Conversely, the rate of change slows as the cost of converting to a low energy consumption strategy increases.

Time Delay and Long-Range Connection Induced Synchronization Transitions in Newman-Watts Small-World Neuronal Networks

Science.gov (United States)

Qian, Yu

2014-01-01

The synchronization transitions in Newman-Watts small-world neuronal networks (SWNNs) induced by time delay and long-range connection (LRC) probability have been investigated by synchronization parameter and space-time plots. Four distinct parameter regions, that is, asynchronous region, transition region, synchronous region, and oscillatory region have been discovered at certain LRC probability as time delay is increased. Interestingly, desynchronization is observed in oscillatory region. More importantly, we consider the spatiotemporal patterns obtained in delayed Newman-Watts SWNNs are the competition results between long-range drivings (LRDs) and neighboring interactions. In addition, for moderate time delay, the synchronization of neuronal network can be enhanced remarkably by increasing LRC probability. Furthermore, lag synchronization has been found between weak synchronization and complete synchronization as LRC probability is a little less than 1.0. Finally, the two necessary conditions, moderate time delay and large numbers of LRCs, are exposed explicitly for synchronization in delayed Newman-Watts SWNNs. PMID:24810595

Organization of signal flow in directed networks

International Nuclear Information System (INIS)

Bányai, M; Bazsó, F; Négyessy, L

2011-01-01

Confining an answer to the question of whether and how the coherent operation of network elements is determined by the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the degree of edge convergence and the overlap between the in- and output sets of an edge. Definitions of convergence degree and overlap are based on the shortest paths, thus they encapsulate global network properties. Using the defining notions of convergence degree and overlapping set we clarify the meaning of network causality and demonstrate the crucial role of chordless circles. In real-world networks the flow representation distinguishes nodes according to their signal transmitting, processing and control properties. The analysis of real-world networks in terms of flow representation was in accordance with the known functional properties of the network nodes. It is shown that nodes with different signal processing, transmitting and control properties are randomly connected at the global scale, while local connectivity patterns depart from randomness. The grouping of network nodes according to their signal flow properties was unrelated to the network's community structure. We present evidence that the signal flow properties of small-world-like, real-world networks cannot be reconstructed by algorithms used to generate small-world networks. Convergence degree values were calculated for regular oriented trees, and the probability density function for networks grown with the preferential attachment mechanism. For Erdos–Rényi graphs we calculated the probability density function of both convergence degrees and overlaps

LCOGT: A World-Wide Network of Robotic Telescopes

Science.gov (United States)

Brown, T.

2013-05-01

Las Cumbres Observatory Global Telescope (LCOGT) is an organization dedicated to time-domain astronomy. To carry out the necessary observations in fields such as supernovae, extrasolar planets, small solar-system bodies, and pulsating stars, we have developed and are now deploying a set of robotic optical telescopes at sites around the globe. In this talk I will concentrate on the core of this network, consisting of up to 15 identical 1m telescopes deployed across multiple sites in both the northern and southern hemispheres. I will summarize the technical and performance aspect of these telescopes, including both their imaging and their anticipated spectroscopic capabilities. But I will also delve into the network organization, including communication among telescopes (to assure that observations are properly carried out), interactions among the institutions and scientists who will use the network (to optimize the scientific returns), and our funding model (which until now has relied entirely on one private donor, but will soon require funding from outside sources, if the full potential of the network is to be achieved).

Introduction: Researching online worlds: challenging media and communication studies

Directory of Open Access Journals (Sweden)

Kjetil Sandvik

2009-12-01

Full Text Available Digital media and network communication technology have not changed this setup, but rather have opened the possibility for encountering and experiencing additional types of worlds and performing additional types of spatial practices. Being situated online and being globally networked with the possibility of both synchronous and asynchronous communication, digitally mediated worlds provide possible interactions between users which are radically more independent of time and place than the ones facilitated by older media. From this perspective, the concept of online worlds both challenges and broadens our understanding of how media shape the world and how the media technology creates new social structures.

Border detection in complex networks

International Nuclear Information System (INIS)

Travencolo, Bruno A N; Viana, Matheus Palhares; Costa, Luciano da Fontoura

2009-01-01

One important issue implied by the finite nature of real-world networks regards the identification of their more external (border) and internal nodes. The present work proposes a formal and objective definition of these properties, founded on the recently introduced concept of node diversity. It is shown that this feature does not exhibit any relevant correlation with several well-established complex networks measurements. A methodology for the identification of the borders of complex networks is described and illustrated with respect to theoretical (geographical and knitted networks) as well as real-world networks (urban and word association networks), yielding interesting results and insights in both cases.

Active Versus Passive Academic Networking

DEFF Research Database (Denmark)

Goel, Rajeev K.; Grimpe, Christoph

2013-01-01

This paper examines determinants of networking by academics. Using information from a unique large survey of German researchers, the key contribution focuses on the active versus passive networking distinction. Is active networking by researchers a substitute or a complement to passive networking......? Other contributions include examining the role of geographic factors in networking and whether research bottlenecks affect a researcher's propensity to network. Are the determinants of European conference participation by German researchers different from conferences in rest of the world? Results show...... that some types of passive academic networking are complementary to active networking, while others are substitute. Further, we find differences in factors promoting participation in European conferences versus conferences in rest of the world. Finally, publishing bottlenecks as a group generally do...

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)

World-System Mobility and Economic Growth, 1980-2000

Science.gov (United States)

Clark, Rob

2010-01-01

World-system scholars have traditionally emphasized the stability of the core/periphery hierarchy. However, prior network studies employing both categorical and continuous measures of world-system position reveal substantial mobility across time, whereby a number of developing states have become more integrated in the world economy over the past…

Raspberry Shake- A World-Wide Citizen Seismograph Network

Science.gov (United States)

Christensen, B. C.; Blanco Chia, J. F.

2017-12-01

Raspberry Shake was conceived as an inexpensive plug-and-play solution to satisfy the need for universal, quick and accurate earthquake detections. First launched on Kickstarter's crowdfunding platform in July of 2016, the Raspberry Shake project was funded within hours of the launch date and, by the end of the campaign, reached more than 1000% of its initial funding goal. This demonstrated for the first time that there exists a strong interest among Makers, Hobbyists and Do It Yourselfers for personal seismographs. From here, a citizen scientist network was created and it has steadily been growing. The Raspberry Shake network is currently being used in conjunction with publicly available broadband data from the GSN and other state-run seismic networks available through the IRIS, Geoscope and GEOFON data centers to detect and locate earthquakes large and small around the globe. Raspberry Shake looks well positioned to improve local monitoring of earthquakes on a global scale, deepen community's understanding of earthquakes, and serve as a formidable teaching tool. We present the main results of the project, the current state of the network, and the new Raspberry Shake models that are being built.

WorldWide Web: Hypertext from CERN.

Science.gov (United States)

Nickerson, Gord

1992-01-01

Discussion of software tools for accessing information on the Internet focuses on the WorldWideWeb (WWW) system, which was developed at the European Particle Physics Laboratory (CERN) in Switzerland to build a worldwide network of hypertext links using available networking technology. Its potential for use with multimedia documents is also…

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.

Keeping their world together--meanings and actions created through network-focused nursing in teenager and young adult cancer care.

Science.gov (United States)

Olsen, Pia Riis; Harder, Ingegerd

2009-01-01

In the transition between dependent childhood and independent young adulthood, teenagers and young adults (TYAs) are extremely vulnerable when diagnosed with cancer and while undergoing treatment. Nurses working on a youth unit for patients aged 15 to 22 years developed a nursing program that aims at supporting these young patients and their significant others to maintain, establish, and strengthen their social network during the treatment period. This article presents a grounded theory study that explored how the network-focused program was perceived by TYAs with cancer and their significant others. A theoretical account is presented on the meanings and actions that the inherent processes and interactions created. Twelve TYAs and 19 significant others participated. Data were generated through interviews, observations, and informal conversations. Embracing the program and building strength were the 2 subcategories that linked to a core concept of keeping their world together. The findings show that nurses are in a unique position to enhance and support the efforts of these young patients and their significant others in connecting with the social network that extends beyond the family and includes the wider social network.

Handedness- and brain size-related efficiency differences in small-world brain networks: a resting-state functional magnetic resonance imaging study.

Science.gov (United States)

Li, Meiling; Wang, Junping; Liu, Feng; Chen, Heng; Lu, Fengmei; Wu, Guorong; Yu, Chunshui; Chen, Huafu

2015-05-01

The human brain has been described as a complex network, which integrates information with high efficiency. However, the relationships between the efficiency of human brain functional networks and handedness and brain size remain unclear. Twenty-one left-handed and 32 right-handed healthy subjects underwent a resting-state functional magnetic resonance imaging scan. The whole brain functional networks were constructed by thresholding Pearson correlation matrices of 90 cortical and subcortical regions. Graph theory-based methods were employed to further analyze their topological properties. As expected, all participants demonstrated small-world topology, suggesting a highly efficient topological structure. Furthermore, we found that smaller brains showed higher local efficiency, whereas larger brains showed higher global efficiency, reflecting a suitable efficiency balance between local specialization and global integration of brain functional activity. Compared with right-handers, significant alterations in nodal efficiency were revealed in left-handers, involving the anterior and median cingulate gyrus, middle temporal gyrus, angular gyrus, and amygdala. Our findings indicated that the functional network organization in the human brain was associated with handedness and brain size.

Networking Journalism Studies: Towards a World Journalism Survey

Directory of Open Access Journals (Sweden)

Thomas Hanitzsch

2007-12-01

Full Text Available Most scholars argue that cross-national research is indispensable for establishing the generalizability of theories and the validity of interpretations derived from single-nation studies. Another important aspect of comparative studies is that they force us to test our interpretations against cross-cultural diferences and inconsistencies. In journalism studies, the advantages of cross-national research are obvious. While the empirical inquiry into news-making has generated a vast quantity of data, some of the more fundamental questions in journalism research remain largely unresolved: What shapes the news and the structures of journalism most? Is it politics, economy, or culture? How do the conventional Western values of objective journalism ft in with non-Western cultures? In this article, I would like to propose the creation of a “World Journalism Survey”, modeled after the World Values Survey, for a better map of the cultural diferences in journalism practices around the world.

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.

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.

Arrangement between the International Atomic Energy Agency and the World Health Organization concerning the establishment and operation of a network of Secondary Standard Dosimetry Laboratories

International Nuclear Information System (INIS)

1986-01-01

The International Atomic Energy Agency (IAEA) and the World Health Organization (WHO), recognizing that they have been co-operating in the operation of a network of Secondary Standard Dosimetry Laboratories (the Network), established pursuant to a Working Arrangement, dated 5 April 1976; and desiring to continue this co-operation in accordance with Article V of the relationship agreement concluded by IAEA and WHO in 1959; hereby enter a new arrangement to guide their work in operating the Network and providing assistance, when needed, to individual Secondary Standard Dosimetry Laboratories (SSDLs). The purpose of this Arrangement is to set forth responsibilities of IAEA and WHO in the operation and support of the Network and to establish criteria for SSDLs

Local dependency in networks

Directory of Open Access Journals (Sweden)

Kudĕlka Miloš

2015-06-01

Full Text Available Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network’s nodes from the structure in local surroundings of individual nodes. For the tasks we deal with in this article, the key technical parameter is locality. Since only the surroundings of the examined nodes are used in computations, there is no need to analyze the entire network. This allows the application of our approach in the area of large-scale networks. We present several experiments using small networks as well as large-scale artificial and real world networks. The results of the experiments show high effectiveness due to the locality of our approach and also high quality node ranking comparable to PageRank.

Dynamic Evolution with Limited Learning Information on a Small-World Network

International Nuclear Information System (INIS)

Dong Linrong

2010-01-01

This paper investigates the dynamic evolution with limited learning information on a small-world network. In the system, the information among the interaction players is not very lucid, and the players are not allowed to inspect the profit collected by its neighbors, thus the focal player cannot choose randomly a neighbor or the wealthiest one and compare its payoff to copy its strategy. It is assumed that the information acquainted by the player declines in the form of the exponential with the geographical distance between the players, and a parameter V is introduced to denote the inspect-ability about the players. It is found that under the hospitable conditions, cooperation increases with the randomness and is inhibited by the large connectivity for the prisoner's dilemma; however, cooperation is maximal at the moderate rewiring probability and is chaos with the connectivity for the snowdrift game. For the two games, the acuminous sight is in favor of the cooperation under the hospitable conditions; whereas, the myopic eyes are advantageous to cooperation and cooperation increases with the randomness under the hostile condition. (interdisciplinary physics and related areas of science and technology)

Critiques of World-Systems Analysis and Alternatives: Unequal Exchange and Three Forms of Class and Struggle in the Japan–US Silk Network, 1880–1890

Directory of Open Access Journals (Sweden)

Elson E. Boles

2015-08-01

Full Text Available Sympathetic critics of world-system analysis contend that its systemic level of abstraction results in one-sided generalizations of systemic change. Unequal exchange theory and commodity chain analysis similarly reduce distinct and historical forms of labor and their interrelationships to common functional and ahistorical essences. This paper applies an incorporated comparisons method to give historical content to an understanding of unequal exchange and global inequality through a study of the Japan–US silk network’s formation and change during the mid 1880–1890s. Analysis of unequal exchange processes requires, in this case, an examination of the mutual integration and transformation of distinct labor and value forms —peasant sericulture, ?lature wage-labor, and industrial silk factory wage-labor—and the infundibular market forces they structured. These relations were decisively conditioned by new landlordism and debt-peonage, class-patriarchy, state mediations, migration, and by peasant and worker struggles against deteriorating conditions. Indeed, the transitional nature of the silk network’s formation, which concluded the Tokugawa system and decisively contributed to Japan’s emergence as a nation-state of the capitalist world-economy, was signi?ed by the very last millenarian and quasi-modern peasant uprising in 1884 among indebted sericulturists, the very ?rst recorded factory strikes in 1885–86, by women raw silk reelers in K?fu, and by strikes among unionizing workers in patriarchal and mechanized silk factories in Paterson, New Jersey, 1885–86 (Boles 1996, 1998. The “local” conditions of each con?ict were molded by the interdependence of those conditions that constituted a formative part of the world-system and its development. In the face of struggles and intensifying world-market competition, Japanese and US manufacturers took opposite spatial strategies of regional expansion to overcome the structural constraints of

Breakdown of interdependent directed networks.

Science.gov (United States)

Liu, Xueming; Stanley, H Eugene; Gao, Jianxi

2016-02-02

Increasing evidence shows that real-world systems interact with one another via dependency connectivities. Failing connectivities are the mechanism behind the breakdown of interacting complex systems, e.g., blackouts caused by the interdependence of power grids and communication networks. Previous research analyzing the robustness of interdependent networks has been limited to undirected networks. However, most real-world networks are directed, their in-degrees and out-degrees may be correlated, and they are often coupled to one another as interdependent directed networks. To understand the breakdown and robustness of interdependent directed networks, we develop a theoretical framework based on generating functions and percolation theory. We find that for interdependent Erdős-Rényi networks the directionality within each network increases their vulnerability and exhibits hybrid phase transitions. We also find that the percolation behavior of interdependent directed scale-free networks with and without degree correlations is so complex that two criteria are needed to quantify and compare their robustness: the percolation threshold and the integrated size of the giant component during an entire attack process. Interestingly, we find that the in-degree and out-degree correlations in each network layer increase the robustness of interdependent degree heterogeneous networks that most real networks are, but decrease the robustness of interdependent networks with homogeneous degree distribution and with strong coupling strengths. Moreover, by applying our theoretical analysis to real interdependent international trade networks, we find that the robustness of these real-world systems increases with the in-degree and out-degree correlations, confirming our theoretical analysis.

Bayesian networks with examples in R

CERN Document Server

Scutari, Marco

2014-01-01

Introduction. The Discrete Case: Multinomial Bayesian Networks. The Continuous Case: Gaussian Bayesian Networks. More Complex Cases. Theory and Algorithms for Bayesian Networks. Real-World Applications of Bayesian Networks. Appendices. Bibliography.

Stages of neuronal network formation

International Nuclear Information System (INIS)

Woiterski, Lydia; Käs, Josef A; Claudepierre, Thomas; Luxenhofer, Robert; Jordan, Rainer

2013-01-01

Graph theoretical approaches have become a powerful tool for investigating the architecture and dynamics of complex networks. The topology of network graphs revealed small-world properties for very different real systems among these neuronal networks. In this study, we observed the early development of mouse retinal ganglion cell (RGC) networks in vitro using time-lapse video microscopy. By means of a time-resolved graph theoretical analysis of the connectivity, shortest path length and the edge length, we were able to discover the different stages during the network formation. Starting from single cells, at the first stage neurons connected to each other ending up in a network with maximum complexity. In the further course, we observed a simplification of the network which manifested in a change of relevant network parameters such as the minimization of the path length. Moreover, we found that RGC networks self-organized as small-world networks at both stages; however, the optimization occurred only in the second stage. (paper)

Basics of Computer Networking

CERN Document Server

Robertazzi, Thomas

2012-01-01

Springer Brief Basics of Computer Networking provides a non-mathematical introduction to the world of networks. This book covers both technology for wired and wireless networks. Coverage includes transmission media, local area networks, wide area networks, and network security. Written in a very accessible style for the interested layman by the author of a widely used textbook with many years of experience explaining concepts to the beginner.

Spatio-temporal networks: reachability, centrality and robustness.

Science.gov (United States)

Williams, Matthew J; Musolesi, Mirco

2016-06-01

Recent advances in spatial and temporal networks have enabled researchers to more-accurately describe many real-world systems such as urban transport networks. In this paper, we study the response of real-world spatio-temporal networks to random error and systematic attack, taking a unified view of their spatial and temporal performance. We propose a model of spatio-temporal paths in time-varying spatially embedded networks which captures the property that, as in many real-world systems, interaction between nodes is non-instantaneous and governed by the space in which they are embedded. Through numerical experiments on three real-world urban transport systems, we study the effect of node failure on a network's topological, temporal and spatial structure. We also demonstrate the broader applicability of this framework to three other classes of network. To identify weaknesses specific to the behaviour of a spatio-temporal system, we introduce centrality measures that evaluate the importance of a node as a structural bridge and its role in supporting spatio-temporally efficient flows through the network. This exposes the complex nature of fragility in a spatio-temporal system, showing that there is a variety of failure modes when a network is subject to systematic attacks.

Virus world as an evolutionary network of viruses and capsidless selfish elements.

Science.gov (United States)

Koonin, Eugene V; Dolja, Valerian V

2014-06-01

Viruses were defined as one of the two principal types of organisms in the biosphere, namely, as capsid-encoding organisms in contrast to ribosome-encoding organisms, i.e., all cellular life forms. Structurally similar, apparently homologous capsids are present in a huge variety of icosahedral viruses that infect bacteria, archaea, and eukaryotes. These findings prompted the concept of the capsid as the virus "self" that defines the identity of deep, ancient viral lineages. However, several other widespread viral "hallmark genes" encode key components of the viral replication apparatus (such as polymerases and helicases) and combine with different capsid proteins, given the inherently modular character of viral evolution. Furthermore, diverse, widespread, capsidless selfish genetic elements, such as plasmids and various types of transposons, share hallmark genes with viruses. Viruses appear to have evolved from capsidless selfish elements, and vice versa, on multiple occasions during evolution. At the earliest, precellular stage of life's evolution, capsidless genetic parasites most likely emerged first and subsequently gave rise to different classes of viruses. In this review, we develop the concept of a greater virus world which forms an evolutionary network that is held together by shared conserved genes and includes both bona fide capsid-encoding viruses and different classes of capsidless replicons. Theoretical studies indicate that selfish replicons (genetic parasites) inevitably emerge in any sufficiently complex evolving ensemble of replicators. Therefore, the key signature of the greater virus world is not the presence of a capsid but rather genetic, informational parasitism itself, i.e., various degrees of reliance on the information processing systems of the host. Copyright © 2014, American Society for Microbiology. All Rights Reserved.

Game-Based Virtual Worlds as Decentralized Virtual Activity Systems

Science.gov (United States)

Scacchi, Walt

There is widespread interest in the development and use of decentralized systems and virtual world environments as possible new places for engaging in collaborative work activities. Similarly, there is widespread interest in stimulating new technological innovations that enable people to come together through social networking, file/media sharing, and networked multi-player computer game play. A decentralized virtual activity system (DVAS) is a networked computer supported work/play system whose elements and social activities can be both virtual and decentralized (Scacchi et al. 2008b). Massively multi-player online games (MMOGs) such as World of Warcraft and online virtual worlds such as Second Life are each popular examples of a DVAS. Furthermore, these systems are beginning to be used for research, deve-lopment, and education activities in different science, technology, and engineering domains (Bainbridge 2007, Bohannon et al. 2009; Rieber 2005; Scacchi and Adams 2007; Shaffer 2006), which are also of interest here. This chapter explores two case studies of DVASs developed at the University of California at Irvine that employ game-based virtual worlds to support collaborative work/play activities in different settings. The settings include those that model and simulate practical or imaginative physical worlds in different domains of science, technology, or engineering through alternative virtual worlds where players/workers engage in different kinds of quests or quest-like workflows (Jakobsson 2006).

5th Workshop on Complex Networks

CERN Document Server

Menezes, Ronaldo; Omicini, Andrea; Poncela-Casasnovas, Julia

2014-01-01

A network is a mathematical object consisting of a set of points that are connected to each other in some fashion by lines. It turns out this simple description corresponds to a bewildering array of systems in the real world, ranging from technological ones such as the Internet and World Wide Web, biological networks such as that of connections of the nervous systems, food webs, or  protein interactions, infrastructural systems such as networks of roads, airports or the power-grid, to patterns of social and professional relationships such as friendship, sex partners, network of Hollywood actors, co-authorship networks and many more. Recent years have witnessed a substantial amount of interest within the scientific community in the properties of these networks. The emergence of the internet in particular, coupled with the widespread availability of inexpensive computing resources has facilitated studies ranging from large scale empirical analysis of networks in the real world, to the development...

Networks and network analysis for defence and security

CERN Document Server

Masys, Anthony J

2014-01-01

Networks and Network Analysis for Defence and Security discusses relevant theoretical frameworks and applications of network analysis in support of the defence and security domains. This book details real world applications of network analysis to support defence and security. Shocks to regional, national and global systems stemming from natural hazards, acts of armed violence, terrorism and serious and organized crime have significant defence and security implications. Today, nations face an uncertain and complex security landscape in which threats impact/target the physical, social, economic

Neural-network classifiers for automatic real-world aerial image recognition

Science.gov (United States)

Greenberg, Shlomo; Guterman, Hugo

1996-08-01

We describe the application of the multilayer perceptron (MLP) network and a version of the adaptive resonance theory version 2-A (ART 2-A) network to the problem of automatic aerial image recognition (AAIR). The classification of aerial images, independent of their positions and orientations, is required for automatic tracking and target recognition. Invariance is achieved by the use of different invariant feature spaces in combination with supervised and unsupervised neural networks. The performance of neural-network-based classifiers in conjunction with several types of invariant AAIR global features, such as the Fourier-transform space, Zernike moments, central moments, and polar transforms, are examined. The advantages of this approach are discussed. The performance of the MLP network is compared with that of a classical correlator. The MLP neural-network correlator outperformed the binary phase-only filter (BPOF) correlator. It was found that the ART 2-A distinguished itself with its speed and its low number of required training vectors. However, only the MLP classifier was able to deal with a combination of shift and rotation geometric distortions.

Border trees of complex networks

International Nuclear Information System (INIS)

Villas Boas, Paulino R; Rodrigues, Francisco A; Travieso, Gonzalo; Fontoura Costa, Luciano da

2008-01-01

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed

A Novel Memristive Multilayer Feedforward Small-World Neural Network with Its Applications in PID Control

Directory of Open Access Journals (Sweden)

Zhekang Dong

2014-01-01

Full Text Available In this paper, we present an implementation scheme of memristor-based multilayer feedforward small-world neural network (MFSNN inspirited by the lack of the hardware realization of the MFSNN on account of the need of a large number of electronic neurons and synapses. More specially, a mathematical closed-form charge-governed memristor model is presented with derivation procedures and the corresponding Simulink model is presented, which is an essential block for realizing the memristive synapse and the activation function in electronic neurons. Furthermore, we investigate a more intelligent memristive PID controller by incorporating the proposed MFSNN into intelligent PID control based on the advantages of the memristive MFSNN on computation speed and accuracy. Finally, numerical simulations have demonstrated the effectiveness of the proposed scheme.

A novel memristive multilayer feedforward small-world neural network with its applications in PID control.

Science.gov (United States)

Dong, Zhekang; Duan, Shukai; Hu, Xiaofang; Wang, Lidan; Li, Hai

2014-01-01

In this paper, we present an implementation scheme of memristor-based multilayer feedforward small-world neural network (MFSNN) inspirited by the lack of the hardware realization of the MFSNN on account of the need of a large number of electronic neurons and synapses. More specially, a mathematical closed-form charge-governed memristor model is presented with derivation procedures and the corresponding Simulink model is presented, which is an essential block for realizing the memristive synapse and the activation function in electronic neurons. Furthermore, we investigate a more intelligent memristive PID controller by incorporating the proposed MFSNN into intelligent PID control based on the advantages of the memristive MFSNN on computation speed and accuracy. Finally, numerical simulations have demonstrated the effectiveness of the proposed scheme.

Networking with China

Energy Technology Data Exchange (ETDEWEB)

Cottrell, R L.A.; Granieri, C [Stanford Linear Accelerator Center, Menlo Park, CA (United States); Fan, Lan; Xu, Rongsheng [Institute of High Energy Physics, Beijing, BJ (China); Karita, Yukio [National Lab. for High Energy Physics, Tsukuba, Ibaraki (Japan)

1944-04-01

This paper presents the history and current status Of computer networking between IHEP in Beijing, China and the rest of the world, starting with no links at the beginning of 1987 thru X.25 public networks and dial up links, to the installing, in March 1993, of one of the first dedicated 64 kbps satellite computer links between China and the outside world. In May 1994, IHEP became the first Chinese institution to have a fully operational world-wide Internet connection. Experience with this dedicated link between SLAC and IHEP will be presented together with future plans to add a land line between KEK and IHEP and to extend the links within China.

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.

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

Virtual Worlds for Virtual Organizing

Science.gov (United States)

Rhoten, Diana; Lutters, Wayne

The members and resources of a virtual organization are dispersed across time and space, yet they function as a coherent entity through the use of technologies, networks, and alliances. As virtual organizations proliferate and become increasingly important in society, many may exploit the technical architecture s of virtual worlds, which are the confluence of computer-mediated communication, telepresence, and virtual reality originally created for gaming. A brief socio-technical history describes their early origins and the waves of progress followed by stasis that brought us to the current period of renewed enthusiasm. Examination of contemporary examples demonstrates how three genres of virtual worlds have enabled new arenas for virtual organizing: developer-defined closed worlds, user-modifiable quasi-open worlds, and user-generated open worlds. Among expected future trends are an increase in collaboration born virtually rather than imported from existing organizations, a tension between high-fidelity recreations of the physical world and hyper-stylized imaginations of fantasy worlds, and the growth of specialized worlds optimized for particular sectors, companies, or cultures.

A light-connected world

Science.gov (United States)

Haas, Harald

2016-08-01

The humble household light bulb - once a simple source of illumination - could soon be transformed into the backbone of a revolutionary new wireless communications network based on visible light. Harald Haas explains how this “LiFi” system works and how it could shape our increasingly data-driven world

Brain anatomical networks in early human brain development.

Science.gov (United States)

Fan, Yong; Shi, Feng; Smith, Jeffrey Keith; Lin, Weili; Gilmore, John H; Shen, Dinggang

2011-02-01

Recent neuroimaging studies have demonstrated that human brain networks have economic small-world topology and modular organization, enabling efficient information transfer among brain regions. However, it remains largely unknown how the small-world topology and modular organization of human brain networks emerge and develop. Using longitudinal MRI data of 28 healthy pediatric subjects, collected at their ages of 1 month, 1 year, and 2 years, we analyzed development patterns of brain anatomical networks derived from morphological correlations of brain regional volumes. The results show that the brain network of 1-month-olds has the characteristically economic small-world topology and nonrandom modular organization. The network's cost efficiency increases with the brain development to 1 year and 2 years, so does the modularity, providing supportive evidence for the hypothesis that the small-world topology and the modular organization of brain networks are established during early brain development to support rapid synchronization and information transfer with minimal rewiring cost, as well as to balance between local processing and global integration of information. Copyright © 2010. Published by Elsevier Inc.

Inefficiency of IDS Static Anomaly Detectors in Real-World Networks

Directory of Open Access Journals (Sweden)

Edward Guillen

2015-05-01

Full Text Available A wide range of IDS implementations with anomaly detection modules have been deployed. In general, those modules depend on intrusion knowledge databases, such as Knowledge Discovery Dataset (KDD99, Center for Applied Internet Data Analysis (CAIDA or Community Resource for Archiving Wireless Data at Dartmouth (CRAWDAD, among others. Once the database is analyzed and a machine learning method is employed to generate detectors, some classes of new detectors are created. Thereafter, detectors are supposed to be deployed in real network environments in order to achieve detection with good results for false positives and detection rates. Since the traffic behavior is quite different according to the user’s network activities over available services, restrictions and applications, it is supposed that behavioral-based detectors are not well suited to all kind of networks. This paper presents the differences of detection results between some network scenarios by applying traditional detectors that were calculated with artificial neural networks. The same detector is deployed in different scenarios to measure the efficiency or inefficiency of static training detectors.

Managing Cisco network security

CERN Document Server

Knipp, Eric

2002-01-01

An in-depth knowledge of how to configure Cisco IP network security is a MUST for anyone working in today''s internetworked world"There''s no question that attacks on enterprise networks are increasing in frequency and sophistication..."-Mike Fuhrman, Cisco Systems Manager, Security ConsultingManaging Cisco Network Security, Second Edition offers updated and revised information covering many of Cisco''s security products that provide protection from threats, detection of network security incidents, measurement of vulnerability and policy compliance and management of security policy across an extended organization. These are the tools that network administrators have to mount defenses against threats. Chapters also cover the improved functionality and ease of the Cisco Secure Policy Manger software used by thousands of small-to-midsized businesses and a special section on the Cisco Aironet Wireless Security Solutions.Security from a real-world perspectiveKey coverage of the new technologies offered by the Cisc...

An evolving network model with modular growth

International Nuclear Information System (INIS)

Zou Zhi-Yun; Liu Peng; Lei Li; Gao Jian-Zhi

2012-01-01

In this paper, we propose an evolving network model growing fast in units of module, according to the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected nodes and the nodes between the modules are linked by preferential attachment on degree of nodes. We study the modularity measure of the proposed model, which can be adjusted by changing the ratio of the number of inner-module edges and the number of inter-module edges. In view of the mean-field theory, we develop an analytical function of the degree distribution, which is verified by a numerical example and indicates that the degree distribution shows characteristics of the small-world network and the scale-free network distinctly at different segments. The clustering coefficient and the average path length of the network are simulated numerically, indicating that the network shows the small-world property and is affected little by the randomness of the new module. (interdisciplinary physics and related areas of science and technology)

World Antimalarial Resistance Network (WARN IV: Clinical pharmacology

Directory of Open Access Journals (Sweden)

Gbotosho Grace O

2007-09-01

Full Text Available Abstract A World Antimalarial Resistance Network (WARN database has the potential to improve the treatment of malaria, through informing current drug selection and use and providing a prompt warning of when treatment policies need changing. This manuscript outlines the contribution and structure of the clinical pharmacology component of this database. The determinants of treatment response are multi-factorial, but clearly providing adequate blood concentrations is pivotal to curing malaria. The ability of available antimalarial pharmacokinetic data to inform optimal dosing is constrained by the small number of patients studied, with even fewer (if any studies conducted in the most vulnerable populations. There are even less data relating blood concentration data to the therapeutic response (pharmacodynamics. By pooling all available pharmacokinetic data, while paying careful attention to the analytical methodologies used, the limitations of small (and thus underpowered individual studies may be overcome and factors that contribute to inter-individual variability in pharmacokinetic parameters defined. Key variables for pharmacokinetic studies are defined in terms of patient (or study subject characteristics, the formulation and route of administration of the antimalarial studied, the sampling and assay methodology, and the approach taken to data analysis. Better defining these information needs and criteria of acceptability of pharmacokinetic-pharmacodynamic (PK-PD studies should contribute to improving the quantity, relevance and quality of these studies. A better understanding of the pharmacokinetic properties of antimalarials and a more clear definition of what constitutes "therapeutic drug levels" would allow more precise use of the term "antimalarial resistance", as it would indicate when treatment failure is not caused by intrinsic parasite resistance but is instead the result of inadequate drug levels. The clinical pharmacology component

NETWORK UNIVERSITIES: INTERNATIONAL EXPERIENCE AND TRENDS

Directory of Open Access Journals (Sweden)

Г А Краснова

2016-12-01

Full Text Available The article is devoted to networking foreign universities, in particular, it considers the experience of cooperation of Vietnamese and Chinese universities with the leading universities of the world and the implementation of joint educational projects. The article deals with the basic characteristics of university networks that emerged in the last decade in developing countries. The authors analyzed the model, sources of financing, the organization of educational process, teaching of languages and the number of students in the university network, as well as the main mechanisms that allow open network structure of education in different countries of the world. The authors also address the main reasons for encouraging networking of foreign universities.

Cisco Networking Essentials

CERN Document Server

McMillan, Troy

2011-01-01

An engaging approach for anyone beginning a career in networking As the world leader of networking products and services, Cisco products are constantly growing in demand. Yet, few books are aimed at those who are beginning a career in IT--until now. Cisco Networking Essentials provides a solid foundation on the Cisco networking products and services with thorough coverage of fundamental networking concepts. Author Troy McMillan applies his years of classroom instruction to effectively present high-level topics in easy-to-understand terms for beginners. With this indispensable full-color resour

Complex Network Analysis of Guangzhou Metro

Directory of Open Access Journals (Sweden)

Yasir Tariq Mohmand

2015-11-01

Full Text Available The structure and properties of public transportation networks can provide suggestions for urban planning and public policies. This study contributes a complex network analysis of the Guangzhou metro. The metro network has 236 kilometers of track and is the 6th busiest metro system of the world. In this paper topological properties of the network are explored. We observed that the network displays small world properties and is assortative in nature. The network possesses a high average degree of 17.5 with a small diameter of 5. Furthermore, we also identified the most important metro stations based on betweenness and closeness centralities. These could help in identifying the probable congestion points in the metro system and provide policy makers with an opportunity to improve the performance of the metro system.

Intelligent sensor networks the integration of sensor networks, signal processing and machine learning

CERN Document Server

Hu, Fei

2012-01-01

Although governments worldwide have invested significantly in intelligent sensor network research and applications, few books cover intelligent sensor networks from a machine learning and signal processing perspective. Filling this void, Intelligent Sensor Networks: The Integration of Sensor Networks, Signal Processing and Machine Learning focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on the world-class research of award-winning authors, the book provides a firm grounding in the fundamentals of intelligent sensor networks, incl

Securing Gateways within Clustered Power Centric Network of Nodes

Directory of Open Access Journals (Sweden)

Qaisar Javaid

2016-01-01

Full Text Available Knowledge Networks are gaining momentum within cyber world. Knowledge leads to innovation and for this reason organizations focus on research and information gathering in order to gain and improve existing knowledge. This of information era, which is primarily based on world wide web technologies, enables significantly expanded networks of people to communicate and collaborate 'virtually' across teams, across entire organizations and across the world, anytime and anywhere. Innovations in computing and telecommunications have transformed the corporations from structured and manageable types to interwoven network of blurred boundaries such as; ad hoc networks and mobile wireless networks, etc. This study explores knowledge networks in Information Technology and security leaks that are found, as well as measures that are taken to counter this menace which is coming up with optimal Secure Clustered Power Centric node network. The paper concludes these measures, evaluating and integrating them to come up with a secured network design.

Computer Networks and Globalization

Directory of Open Access Journals (Sweden)

J. Magliaro

2007-07-01

Full Text Available Communication and information computer networks connect the world in ways that make globalization more natural and inequity more subtle. As educators, we look at these phenomena holistically analyzing them from the realist’s view, thus exploring tensions, (in equity and (injustice, and from the idealist’s view, thus embracing connectivity, convergence and development of a collective consciousness. In an increasingly market- driven world we find examples of openness and human generosity that are based on networks, specifically the Internet. After addressing open movements in publishing, software industry and education, we describe the possibility of a dialectic equilibrium between globalization and indigenousness in view of ecologically designed future smart networks

A Squeezed Artificial Neural Network for the Symbolic Network Reliability Functions of Binary-State Networks.

Science.gov (United States)

Yeh, Wei-Chang

Network reliability is an important index to the provision of useful information for decision support in the modern world. There is always a need to calculate symbolic network reliability functions (SNRFs) due to dynamic and rapid changes in network parameters. In this brief, the proposed squeezed artificial neural network (SqANN) approach uses the Monte Carlo simulation to estimate the corresponding reliability of a given designed matrix from the Box-Behnken design, and then the Taguchi method is implemented to find the appropriate number of neurons and activation functions of the hidden layer and the output layer in ANN to evaluate SNRFs. According to the experimental results of the benchmark networks, the comparison appears to support the superiority of the proposed SqANN method over the traditional ANN-based approach with at least 16.6% improvement in the median absolute deviation in the cost of extra 2 s on average for all experiments.Network reliability is an important index to the provision of useful information for decision support in the modern world. There is always a need to calculate symbolic network reliability functions (SNRFs) due to dynamic and rapid changes in network parameters. In this brief, the proposed squeezed artificial neural network (SqANN) approach uses the Monte Carlo simulation to estimate the corresponding reliability of a given designed matrix from the Box-Behnken design, and then the Taguchi method is implemented to find the appropriate number of neurons and activation functions of the hidden layer and the output layer in ANN to evaluate SNRFs. According to the experimental results of the benchmark networks, the comparison appears to support the superiority of the proposed SqANN method over the traditional ANN-based approach with at least 16.6% improvement in the median absolute deviation in the cost of extra 2 s on average for all experiments.

Changes of hierarchical network in local and world stock market

Science.gov (United States)

Patwary, Enayet Ullah; Lee, Jong Youl; Nobi, Ashadun; Kim, Doo Hwan; Lee, Jae Woo

2017-10-01

We consider the cross-correlation coefficients of the daily returns in the local and global stock markets. We generate the minimal spanning tree (MST) using the correlation matrix. We observe that the MSTs change their structure from chain-like networks to star-like networks during periods of market uncertainty. We quantify the measure of the hierarchical network utilizing the value of the hierarchy measured by the hierarchical path. The hierarchy and betweenness centrality characterize the state of the market regarding the impact of crises. During crises, the non-financial company is established as the central node of the MST. However, before the crisis and during stable periods, the financial company is occupying the central node of the MST in the Korean and the U.S. stock markets. The changes in the network structure and the central node are good indicators of an upcoming crisis.

A network-based frequency analysis of Inclusive Wealth to track sustainable development in world countries.

Science.gov (United States)

Ahmad, Nasir; Derrible, Sybil; Managi, Shunsuke

2018-07-15

Using human (HC), natural (NC), and produced (PC) capital from Inclusive Wealth as representatives of the triple bottom line of sustainability and utilizing elements of network science, we introduce a Network-based Frequency Analysis (NFA) method to track sustainable development in world countries from 1990 to 2014. The method compares every country with every other and links them when values are close. The country with the most links becomes the main trend, and the performance of every other country is assessed based on its 'orbital' distance from the main trend. Orbital speeds are then calculated to evaluate country-specific dynamic trends. Overall, we find an optimistic trend for HC only, indicating positive impacts of global initiatives aiming towards socio-economic development in developing countries like the Millennium Development Goals and 'Agenda 21'. However, we also find that the relative performance of most countries has not changed significantly in this period, regardless of their gradual development. Specifically, we measure a decrease in produced and natural capital for most countries, despite an increase in GDP, suggesting unsustainable development. Furthermore, we develop a technique to cluster countries and project the results to 2050, and we find a significant decrease in NC for nearly all countries, suggesting an alarming depletion of natural resources worldwide. Copyright © 2018 Elsevier Ltd. All rights reserved.

Multirelational organization of large-scale social networks in an online world.

Science.gov (United States)

Szell, Michael; Lambiotte, Renaud; Thurner, Stefan

2010-08-03

The capacity to collect fingerprints of individuals in online media has revolutionized the way researchers explore human society. Social systems can be seen as a nonlinear superposition of a multitude of complex social networks, where nodes represent individuals and links capture a variety of different social relations. Much emphasis has been put on the network topology of social interactions, however, the multidimensional nature of these interactions has largely been ignored, mostly because of lack of data. Here, for the first time, we analyze a complete, multirelational, large social network of a society consisting of the 300,000 odd players of a massive multiplayer online game. We extract networks of six different types of one-to-one interactions between the players. Three of them carry a positive connotation (friendship, communication, trade), three a negative (enmity, armed aggression, punishment). We first analyze these types of networks as separate entities and find that negative interactions differ from positive interactions by their lower reciprocity, weaker clustering, and fatter-tail degree distribution. We then explore how the interdependence of different network types determines the organization of the social system. In particular, we study correlations and overlap between different types of links and demonstrate the tendency of individuals to play different roles in different networks. As a demonstration of the power of the approach, we present the first empirical large-scale verification of the long-standing structural balance theory, by focusing on the specific multiplex network of friendship and enmity relations.

Digital Networked Information Society and Public Health: Problems and Promises of Networked Health Communication of Lay Publics.

Science.gov (United States)

Kim, Jeong-Nam

2018-01-01

This special issue of Health Communication compiles 10 articles to laud the promise and yet confront the problems in the digital networked information society related to public health. We present this anthology of symphony and cacophony of lay individuals' communicative actions in a digital networked information society. The collection of problems and promise of the new digital world may be a cornerstone joining two worlds-pre- and postdigital network society-and we hope this special issue will help better shape our future states of public health.

Urban air pollution in megacities of the world

Science.gov (United States)

Mage, David; Ozolins, Guntis; Peterson, Peter; Webster, Anthony; Orthofer, Rudi; Vandeweerd, Veerle; Gwynne, Michael

Urban air pollution is a major environmental problem in the developing countries of the world. WHO and UNEP created an air pollution monitoring network as part of the Global Environment Monitoring System. This network now covers over 50 cities in 35 developing and developed countries throughout the world. The analyses of the data reported by the network over the past 15-20 yr indicate that the lessons of the prior experiences in the developed countries (U.S.A., U.K.) have not been learned. A study of air pollution in 20 of the 24 megacities of the world (over 10 million people by year 2000) shows that ambient air pollution concentrations are at levels where serious health effects are reported. The expected rise of population in the next century, mainly in the developing countries with a lack of capital for air pollution control, means that there is a great potential that conditions will worsen in many more cities that will reach megacity status. This paper maps the potential for air pollution that cities will experience in the future unless control strategies are developed and implemented during the next several decades.

Statistical complexity is maximized in a small-world brain.

Directory of Open Access Journals (Sweden)

Teck Liang Tan

Full Text Available In this paper, we study a network of Izhikevich neurons to explore what it means for a brain to be at the edge of chaos. To do so, we first constructed the phase diagram of a single Izhikevich excitatory neuron, and identified a small region of the parameter space where we find a large number of phase boundaries to serve as our edge of chaos. We then couple the outputs of these neurons directly to the parameters of other neurons, so that the neuron dynamics can drive transitions from one phase to another on an artificial energy landscape. Finally, we measure the statistical complexity of the parameter time series, while the network is tuned from a regular network to a random network using the Watts-Strogatz rewiring algorithm. We find that the statistical complexity of the parameter dynamics is maximized when the neuron network is most small-world-like. Our results suggest that the small-world architecture of neuron connections in brains is not accidental, but may be related to the information processing that they do.

Competition between global and local online social networks

Science.gov (United States)

Kleineberg, Kaj-Kolja; Boguñá, Marián

2016-04-01

The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.

Competition between global and local online social networks.

Science.gov (United States)

Kleineberg, Kaj-Kolja; Boguñá, Marián

2016-04-27

The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.

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.

Clustering coefficient and community structure of bipartite networks

Science.gov (United States)

Zhang, Peng; Wang, Jinliang; Li, Xiaojia; Li, Menghui; Di, Zengru; Fan, Ying

2008-12-01

Many real-world networks display natural bipartite structure, where the basic cycle is a square. In this paper, with the similar consideration of standard clustering coefficient in binary networks, a definition of the clustering coefficient for bipartite networks based on the fraction of squares is proposed. In order to detect community structures in bipartite networks, two different edge clustering coefficients LC4 and LC3 of bipartite networks are defined, which are based on squares and triples respectively. With the algorithm of cutting the edge with the least clustering coefficient, communities in artificial and real world networks are identified. The results reveal that investigating bipartite networks based on the original structure can show the detailed properties that is helpful to get deep understanding about the networks.

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.

Interconnected networks

CERN Document Server

2016-01-01

This volume provides an introduction to and overview of the emerging field of interconnected networks which include multi layer or multiplex networks, as well as networks of networks. Such networks present structural and dynamical features quite different from those observed in isolated networks. The presence of links between different networks or layers of a network typically alters the way such interconnected networks behave – understanding the role of interconnecting links is therefore a crucial step towards a more accurate description of real-world systems. While examples of such dissimilar properties are becoming more abundant – for example regarding diffusion, robustness and competition – the root of such differences remains to be elucidated. Each chapter in this topical collection is self-contained and can be read on its own, thus making it also suitable as reference for experienced researchers wishing to focus on a particular topic.

The lesioned brain: still a small world?

Directory of Open Access Journals (Sweden)

Linda Douw

2010-11-01

Full Text Available The intra-arterial amobarbital procedure (IAP or Wada test is used to determine language lateralization and contralateral memory functioning in patients eligible for neurosurgery because of pharmaco-resistant epilepsy. During unilateral sedation, functioning of the contralateral hemisphere is assessed by means of neuropsychological tests. We use the IAP as a reversible model for the effect of lesions on brain network topology. Three artifact free epochs (4096 samples were selected from each EEG record before and after amobarbital injection. Functional connectivity was assessed by means of the synchronization likelihood (SL. The resulting functional connectivity matrices were constructed for all six epochs per patient in four frequency bands, and weighted network analysis was performed. The clustering coefficient, average path length, small-world-index, and edge weight correlation were calculated. Recordings of 33 patients were available. Network topology changed significantly after amobarbital injection: clustering decreased in all frequency bands, while path length decreased in the theta and lower alpha band, indicating a shift towards a more random network topology. Likewise, the edge weight correlation decreased after injection of amobarbital in the theta and beta bands. Network characteristics after injection of amobarbital were correlated with memory score: higher theta band small-world-index and increased upper alpha path length were related to better memory score. The whole-brain network topology in patients eligible for epilepsy surgery becomes more random and less optimally organized after selective sedation of one hemisphere, as has been reported in studies with brain tumor patients. Furthermore, memory functioning after injection seems related to network topology, indicating that functional performance is related to topological network properties of the brain.

Cascade-based attacks on complex networks

Science.gov (United States)

Motter, Adilson E.; Lai, Ying-Cheng

2002-12-01

We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized by the loads on nodes, is important. We show that for such networks where loads can redistribute among the nodes, intentional attacks can lead to a cascade of overload failures, which can in turn cause the entire or a substantial part of the network to collapse. This is relevant for real-world networks that possess a highly heterogeneous distribution of loads, such as the Internet and power grids. We demonstrate that the heterogeneity of these networks makes them particularly vulnerable to attacks in that a large-scale cascade may be triggered by disabling a single key node. This brings obvious concerns on the security of such systems.

Copula-based modeling of degree-correlated networks

International Nuclear Information System (INIS)

Raschke, Mathias; Schläpfer, Markus; Trantopoulos, Konstantinos

2014-01-01

Dynamical processes on complex networks such as information exchange, innovation diffusion, cascades in financial networks or epidemic spreading are highly affected by their underlying topologies as characterized by, for instance, degree–degree correlations. Here, we introduce the concept of copulas in order to generate random networks with an arbitrary degree distribution and a rich a priori degree–degree correlation (or ‘association’) structure. The accuracy of the proposed formalism and corresponding algorithm is numerically confirmed, while the method is tested on a real-world network of yeast protein–protein interactions. The derived network ensembles can be systematically deployed as proper null models, in order to unfold the complex interplay between the topology of real-world networks and the dynamics on top of them. (paper)

Detecting the influence of spreading in social networks with excitable sensor networks.

Directory of Open Access Journals (Sweden)

Sen Pei

Full Text Available Detecting spreading outbreaks in social networks with sensors is of great significance in applications. Inspired by the formation mechanism of humans' physical sensations to external stimuli, we propose a new method to detect the influence of spreading by constructing excitable sensor networks. Exploiting the amplifying effect of excitable sensor networks, our method can better detect small-scale spreading processes. At the same time, it can also distinguish large-scale diffusion instances due to the self-inhibition effect of excitable elements. Through simulations of diverse spreading dynamics on typical real-world social networks (Facebook, coauthor, and email social networks, we find that the excitable sensor networks are capable of detecting and ranking spreading processes in a much wider range of influence than other commonly used sensor placement methods, such as random, targeted, acquaintance and distance strategies. In addition, we validate the efficacy of our method with diffusion data from a real-world online social system, Twitter. We find that our method can detect more spreading topics in practice. Our approach provides a new direction in spreading detection and should be useful for designing effective detection methods.

Scheduling optimization of a real-world multi product pipeline network; Otimizacao das operacoes de transporte de derivados de petroleo em redes de dutos

Energy Technology Data Exchange (ETDEWEB)

Boschetto, Suelen N.; Felizari, Luiz C.; Magatao, Leandro; Stebel, Sergio L.; Neves Junior, Flavio; Lueders, Ricardo; Arruda, Lucia V.R. de [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil); Ribas, Paulo Cesar; Bernardo, Luiz F.J. [PETROBRAS S.A., Rio de Janeiro, RJ (Brazil). Centro de Pesquisas (CENPES)

2008-07-01

This work develops an optimization structure to aid the operational decision-making of scheduling activities in a real world pipeline network. The proposed approach is based on a decomposition method to address complex problems with high computational burden. The Pre-analysis makes a previous evaluation of a batch sequencing, getting information to be entered into optimization block. The continuous time Mixed Integer Linear Program (MILP) model gets such information and calculates the scheduling. The models are applied to a pipeline network that connects different areas including refineries, terminals, and final clients. Many oil derivatives (e.g. gasoline, liquefied petroleum gas, naphtha) can be sent or received in this network. The computational burden to determine a short-term scheduling within the considered scenario is a relevant issue. Many insights have been derived from the obtained solutions, which are given in a reduced computational time for oil industrial-size scenarios. (author)

It's a Whole New World.

Science.gov (United States)

Novelli, Joan

1994-01-01

The article presents technology projects that provide real-life reasons for students to learn geography. A variety of online networks take students on online field trips, linking them with scientists, zoologists, archaeologists, and explorers. Other interactive software is available to simulate trips to various locations around the world. (SM)

Wikipedia ranking of world universities

Science.gov (United States)

Lages, José; Patt, Antoine; Shepelyansky, Dima L.

2016-03-01

We use the directed networks between articles of 24 Wikipedia language editions for producing the wikipedia ranking of world Universities (WRWU) using PageRank, 2DRank and CheiRank algorithms. This approach allows to incorporate various cultural views on world universities using the mathematical statistical analysis independent of cultural preferences. The Wikipedia ranking of top 100 universities provides about 60% overlap with the Shanghai university ranking demonstrating the reliable features of this approach. At the same time WRWU incorporates all knowledge accumulated at 24 Wikipedia editions giving stronger highlights for historically important universities leading to a different estimation of efficiency of world countries in university education. The historical development of university ranking is analyzed during ten centuries of their history.

Networking with China

International Nuclear Information System (INIS)

Cottrell, R.L.A.; Granieri, C.; Fan, Lan; Xu, Rongsheng; Karita, Yukio

1994-01-01

This paper presents the history and current status of computer networking between IHEP in Beijing, China and the rest of the world, starting with no links at the beginning of 1987 through X.25 public networks and dial up links, to the installing, in March 1993, of one of the first dedicated 64 kbps satellite computer links between China and the outside world. In May 1994, IHEP became the first operational worldwide Internet connection. Experience with this dedicated link between SLAC and IHEP will be presented together with future plans to add a land line between KEK and IHEP and to extend the links within China

Network structure exploration in networks with node attributes

Science.gov (United States)

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

2016-05-01

Complex networks provide a powerful way to represent complex systems and have been widely studied during the past several years. One of the most important tasks of network analysis is to detect structures (also called structural regularities) embedded in networks by determining group number and group partition. Most of network structure exploration models only consider network links. However, in real world networks, nodes may have attributes that are useful for network structure exploration. In this paper, we propose a novel Bayesian nonparametric (BNP) model to explore structural regularities in networks with node attributes, called Bayesian nonparametric attribute (BNPA) model. This model does not only take full advantage of both links between nodes and node attributes for group partition via shared hidden variables, but also determine group number automatically via the Bayesian nonparametric theory. Experiments conducted on a number of real and synthetic networks show that our BNPA model is able to automatically explore structural regularities in networks with node attributes and is competitive with other state-of-the-art models.

Consuming Social Networks: A Study on BeeTalk Network

Directory of Open Access Journals (Sweden)

Jamal Mohammadi

Full Text Available BeeTalk is one of the most common social networks that have attracted many users during these years. As a whole, social networks are parts of everyday life nowadays and, especially among the new generation, have caused some basic alterations in the field of identity-formation, sense-making and the form and content of communication. This article is a research about BeeTalk users, their virtual interactions and experiences, and the feelings, pleasures, meanings and attitudes that they obtain through participating in the virtual world. This is a qualitative research. The sample is selected by way of theoretical sampling among the students of University of Kurdistan. Direct observation and semistructured interviews are used to gathering data, which are interpreted through grounded theory. The findings show that some contexts like “searching real interests in a non-real world” and “the representation of users’ voices in virtual space” have provided the space for participating in BeeTalk, and an intervening factor called “instant availability” has intensified this participation. Users’ participation in this social network has changed their social interaction in the real world and formed some new types of communication among them such as “representation of faked identities”, “experiencing ceremonial space” and “artificial literacy”. Moreover, this participation has some consequences like “virtual addiction” and “virtual collectivism” in users’ everyday life that effects their ways of providing meaning and identity in their social lives. It can be said that the result of user’s activity in this network is to begin a kind of simulated relation that has basic differences with relations in the real world. The experience of relation in this network lacks nobility, enrichment and animation, rather it is instant, artificial and without any potential to vitalization.

The production of places in the globalized world

Directory of Open Access Journals (Sweden)

Olivier Walther

2012-09-01

Full Text Available Books about globalization that describe a world characterized by convergence, without also assuming homogeneity, are quite rare. The Production of Places in the Globalized World (Les Lieux de la Mondialisation by geographer Denis Retaillé is one notable exception. Faced with the challenge of studying ten places in the world, the author has developed a conceptual framework that situates each in terms of their global networks and flows and demonstrates how they continue to be substantially dif...

Complex networks principles, methods and applications

CERN Document Server

Latora, Vito; Russo, Giovanni

2017-01-01

Networks constitute the backbone of complex systems, from the human brain to computer communications, transport infrastructures to online social systems and metabolic reactions to financial markets. Characterising their structure improves our understanding of the physical, biological, economic and social phenomena that shape our world. Rigorous and thorough, this textbook presents a detailed overview of the new theory and methods of network science. Covering algorithms for graph exploration, node ranking and network generation, among the others, the book allows students to experiment with network models and real-world data sets, providing them with a deep understanding of the basics of network theory and its practical applications. Systems of growing complexity are examined in detail, challenging students to increase their level of skill. An engaging presentation of the important principles of network science makes this the perfect reference for researchers and undergraduate and graduate students in physics, ...

Searching for the most cost-effective strategy for controlling epidemics spreading on regular and small-world networks.

Science.gov (United States)

Kleczkowski, Adam; Oleś, Katarzyna; Gudowska-Nowak, Ewa; Gilligan, Christopher A

2012-01-07

We present a combined epidemiological and economic model for control of diseases spreading on local and small-world networks. The disease is characterized by a pre-symptomatic infectious stage that makes detection and control of cases more difficult. The effectiveness of local (ring-vaccination or culling) and global control strategies is analysed by comparing the net present values of the combined cost of preventive treatment and illness. The optimal strategy is then selected by minimizing the total cost of the epidemic. We show that three main strategies emerge, with treating a large number of individuals (global strategy, GS), treating a small number of individuals in a well-defined neighbourhood of a detected case (local strategy) and allowing the disease to spread unchecked (null strategy, NS). The choice of the optimal strategy is governed mainly by a relative cost of palliative and preventive treatments. If the disease spreads within the well-defined neighbourhood, the local strategy is optimal unless the cost of a single vaccine is much higher than the cost associated with hospitalization. In the latter case, it is most cost-effective to refrain from prevention. Destruction of local correlations, either by long-range (small-world) links or by inclusion of many initial foci, expands the range of costs for which the NS is most cost-effective. The GS emerges for the case when the cost of prevention is much lower than the cost of treatment and there is a substantial non-local component in the disease spread. We also show that local treatment is only desirable if the disease spreads on a small-world network with sufficiently few long-range links; otherwise it is optimal to treat globally. In the mean-field case, there are only two optimal solutions, to treat all if the cost of the vaccine is low and to treat nobody if it is high. The basic reproduction ratio, R(0), does not depend on the rate of responsive treatment in this case and the disease always invades

The Best of Both World

DEFF Research Database (Denmark)

Korsgaard, Steffen; Ferguson, Richard; Gaddefors, Johan

2015-01-01

impacts on their opportunity creation. Based on a multiple case study we find that rural entrepreneurs mix what we refer to as placial embeddedness – an intimate knowledge of and concern for the place – with strategically built non-local networks, i.e. the best of two worlds. Notably, the entrepreneurs...

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 ...

Small World Properties Generated by a New Algorithm Under Same Degree of All Nodes

International Nuclear Information System (INIS)

Li Yong; Fang Jinqing; Liu Qiang; Liang Yong

2006-01-01

Based on the model of the same degree of all nodes we proposed before, a new algorithm, the so-called 'spread all over vertices' (SAV) algorithm, is proposed for generating small-world properties from a regular ring lattices. During randomly rewiring connections the SAV is used to keep the unchanged number of links. Comparing the SAV algorithm with the Watts-Strogatz model and the 'spread all over boundaries' algorithm, three methods can have the same topological properties of the small world networks. These results offer diverse formation of small world networks. It is helpful to the research of some applications for dynamics of mutual oscillator inside nodes and interacting automata associated with networks.

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.

Identifying Gatekeepers in Online Learning Networks

Science.gov (United States)

Gursakal, Necmi; Bozkurt, Aras

2017-01-01

The rise of the networked society has not only changed our perceptions but also the definitions, roles, processes and dynamics of online learning networks. From offline to online worlds, networks are everywhere and gatekeepers are an important entity in these networks. In this context, the purpose of this paper is to explore gatekeeping and…

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.

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.

Temporal node centrality in complex networks

Science.gov (United States)

Kim, Hyoungshick; Anderson, Ross

2012-02-01

Many networks are dynamic in that their topology changes rapidly—on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been lacking for the dynamic case. In this paper we present a simple but powerful model, the time-ordered graph, which reduces a dynamic network to a static network with directed flows. This enables us to extend network properties such as vertex degree, closeness, and betweenness centrality metrics in a very natural way to the dynamic case. We then demonstrate how our model applies to a number of interesting edge cases, such as where the network connectivity depends on a small number of highly mobile vertices or edges, and show that our centrality definition allows us to track the evolution of connectivity. Finally we apply our model and techniques to two real-world dynamic graphs of human contact networks and then discuss the implication of temporal centrality metrics in the real world.

7th WACBE World Congress on Bioengineering 2015

CERN Document Server

Lim, Chwee

2015-01-01

This volume publishes the proceedings of the WACBE World Congress on Bioengineering 2015 (WACBE 2015), which was be held in Singapore, from 6 to 8 July 2015. The World Association for Chinese Biomedical Engineers (WACBE) organizes this World Congress biannually. Our past congresses have brought together many biomedical engineers from over the world to share their experiences and views on the future development of biomedical engineering. The 7th WACBE World Congress on Bioengineering 2015 in Singapore continued to offer such a networking platform for all biomedical engineers. Hosted by the Biomedical Engineering Society (Singapore) and the Department of Biomedical Engineering, National University of Singapore, the congress covered all related areas in bioengineering.

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.

Networks of networks – An introduction

International Nuclear Information System (INIS)

Kenett, Dror Y.; Perc, Matjaž; Boccaletti, Stefano

2015-01-01

Graphical abstract: Interdependent network reciprocity. Only those blue cooperative domains that are initially present on both networks survive. Abstract: This is an introduction to the special issue titled “Networks of networks” that is in the making at Chaos, Solitons & Fractals. Recent research and reviews attest to the fact that networks of networks are the next frontier in network science [1–7]. Not only are interactions limited and thus inadequately described by well-mixed models, it is also a fact that the networks that should be an integral part of such models are often interconnected, thus making the processes that are unfolding on them interdependent. From the World economy and transportation systems to social media, it is clear that processes taking place in one network might significantly affect what is happening in many other networks. Within an interdependent system, each type of interaction has a certain relevance and meaning, so that treating all the links identically inevitably leads to information loss. Networks of networks, interdependent networks, or multilayer networks are therefore a much better and realistic description of such systems, and this Special Issue is devoted to their structure, dynamics and evolution, as well as to the study of emergent properties in multi-layered systems in general. Topics of interest include but are not limited to the spread of epidemics and information, percolation, diffusion, synchronization, collective behavior, and evolutionary games on networks of networks. Interdisciplinary work on all aspects of networks of networks, regardless of background and motivation, is very welcome.

Fast long-range connections in transportation networks

International Nuclear Information System (INIS)

Palhares Viana, Matheus; Fontoura Costa, Luciano da

2011-01-01

Multidimensional scaling is applied in order to visualize an analogue of the small-world effect implied by edges having different displacement velocities in transportation networks. Our findings are illustrated for two real-world systems, namely the London urban network (streets and underground) and the US highway network enhanced by some of the main US airlines routes. We also show that the travel time in these two networks is drastically changed by attacks targeting the edges with large displacement velocities. - Highlights: → Multidimensional scaling used to visualize the effects of fast long-range connections. → Fast long-range connections are important to decrease the average travel time. → The average travel time diverges quickly when the network is under target attacks.

Introduction to wireless sensor networks

CERN Document Server

Forster, Anna

2016-01-01

Explores real-world wireless sensor network development, deployment, and applications. The book begins with an introduction to wireless sensor networks and their fundamental concepts. Hardware components, operating systems, protocols, and algorithms that make up the anatomy of a sensor node are described in chapter two. Properties of wireless communications, medium access protocols, wireless links, and link estimation protocols are described in chapter three and chapter four. Routing basics and metrics, clustering techniques, time synchronization and localization protocols, as well as sensing techniques are introduced in chapter five to nine. The concluding chapter summarizes the learnt methods and shows how to use them to deploy real-world sensor networks in a structured way.

Network Coding Designs Suited for the Real World

DEFF Research Database (Denmark)

Pedersen, Morten Videbæk; Roetter, Daniel Enrique Lucani; Fitzek, Frank

2013-01-01

design have produced a large influx of new ideas and approaches to harness the power of NC. But, which of these designs are truly successful in practice? and which designs will not live up to their promised theoretical gains due to real-world constraints? Without attempting a comprehensive view of all...

Community detection for networks with unipartite and bipartite structure

Science.gov (United States)

Chang, Chang; Tang, Chao

2014-09-01

Finding community structures in networks is important in network science, technology, and applications. To date, most algorithms that aim to find community structures only focus either on unipartite or bipartite networks. A unipartite network consists of one set of nodes and a bipartite network consists of two nonoverlapping sets of nodes with only links joining the nodes in different sets. However, a third type of network exists, defined here as the mixture network. Just like a bipartite network, a mixture network also consists of two sets of nodes, but some nodes may simultaneously belong to two sets, which breaks the nonoverlapping restriction of a bipartite network. The mixture network can be considered as a general case, with unipartite and bipartite networks viewed as its limiting cases. A mixture network can represent not only all the unipartite and bipartite networks, but also a wide range of real-world networks that cannot be properly represented as either unipartite or bipartite networks in fields such as biology and social science. Based on this observation, we first propose a probabilistic model that can find modules in unipartite, bipartite, and mixture networks in a unified framework based on the link community model for a unipartite undirected network [B Ball et al (2011 Phys. Rev. E 84 036103)]. We test our algorithm on synthetic networks (both overlapping and nonoverlapping communities) and apply it to two real-world networks: a southern women bipartite network and a human transcriptional regulatory mixture network. The results suggest that our model performs well for all three types of networks, is competitive with other algorithms for unipartite or bipartite networks, and is applicable to real-world networks.

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.

Future networks and technologies supporting innovative communications

DEFF Research Database (Denmark)

Prasad, Ramjee

2012-01-01

-communications (WISDOM) that combines the aspects of personal- and cognitive radio- networks to let seamlessly bridge the virtual and physical worlds offering a constant level of all-senses, context-based, rich communication experience over fixed and wireless networks for the end users while realizing a new generation......Within a fully interconnected world, the distinct relationship between end users, consumers and providers rapidly changes towards a scenario of collaboration and competition of multiple parties within one system. ‘Convergence’, ‘ubiquitous’ and ‘smart’ are key words describing future networks...

Environmental isotope data no. 10: World survey of isotope concentration in precipitation (1988-1991). Report from a network

International Nuclear Information System (INIS)

1994-01-01

This is the tenth volume of the publication Environmental Isotope Data: World Survey of Isotope Concentration in Precipitation. This volume is primarily concerned with the concentration of the environmental isotopes (tritium, deuterium and oxygen-18) in monthly samples of precipitation taken by a global network of 169 stations in the period 1988 to 1991. Selected meteorological data, such as the amount of precipitation, mean water vapour pressure and surface air temperature, are also presented. Data before 1988 which were unavailable at the time of the earlier issues have also been included in the latter part of this volume as late reports. The data are being widely used in hydrological, hydrometeorological and climatological studies. 9 refs, 2 figs

Network evolution by nonlinear preferential rewiring of edges

Science.gov (United States)

Xu, Xin-Jian; Hu, Xiao-Ming; Zhang, Li-Jie

2011-06-01

The mathematical framework for small-world networks proposed in a seminal paper by Watts and Strogatz sparked a widespread interest in modeling complex networks in the past decade. However, most of research contributing to static models is in contrast to real-world dynamic networks, such as social and biological networks, which are characterized by rearrangements of connections among agents. In this paper, we study dynamic networks evolved by nonlinear preferential rewiring of edges. The total numbers of vertices and edges of the network are conserved, but edges are continuously rewired according to the nonlinear preference. Assuming power-law kernels with exponents α and β, the network structures in stationary states display a distinct behavior, depending only on β. For β>1, the network is highly heterogeneous with the emergence of starlike structures. For β<1, the network is widely homogeneous with a typical connectivity. At β=1, the network is scale free with an exponential cutoff.

Mining human mobility in location-based social networks

CERN Document Server

Gao, Huiji

2015-01-01

In recent years, there has been a rapid growth of location-based social networking services, such as Foursquare and Facebook Places, which have attracted an increasing number of users and greatly enriched their urban experience. Typical location-based social networking sites allow a user to ""check in"" at a real-world POI (point of interest, e.g., a hotel, restaurant, theater, etc.), leave tips toward the POI, and share the check-in with their online friends. The check-in action bridges the gap between real world and online social networks, resulting in a new type of social networks, namely l

Social Networks Use, Loneliness and Academic Performance among University Students

Science.gov (United States)

Stankovska, Gordana; Angelkovska, Slagana; Grncarovska, Svetlana Pandiloska

2016-01-01

The world is extensively changed by Social Networks Sites (SNSs) on the Internet. A large number of children and adolescents in the world have access to the internet and are exposed to the internet at a very early age. Most of them use the Social Networks Sites with the purpose of exchanging academic activities and developing a social network all…

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.

Worlds largest particle physics laboratory selects Proxim Wireless Mesh

CERN Multimedia

2007-01-01

"Proxim Wireless has announced that the European Organization for Nuclear Research (CERN), the world's largest particle physics laboratory and the birthplace of the World Wide Web, is using it's ORiNOCO AP-4000 mesh access points to extend the range of the laboratory's Wi-Fi network and to provide continuous monitoring of the lab's calorimeters" (1/2 page)

Virtual worlds: a new frontier for nurse education?

Science.gov (United States)

Green, Janet; Wyllie, Aileen; Jackson, Debra

2014-01-01

Virtual worlds have the potential to offer nursing students social networking and, learning, opportunities through the use of collaborative and immersive learning. If nursing educators, are to stay, abreast of contemporary learning opportunities an exploration of the potential benefits of, virtual, worlds and their possibilities is needed. Literature was sourced that explored virtual worlds, and their, use in education, but nursing education specifically. It is clear that immersive learning has, positive, benefits for nursing, however the best way to approach virtual reality in nursing education, has yet to, be ascertained.

Network Warrior

CERN Document Server

Donahue, Gary

2011-01-01

Pick up where certification exams leave off. With this practical, in-depth guide to the entire network infrastructure, you'll learn how to deal with real Cisco networks, rather than the hypothetical situations presented on exams like the CCNA. Network Warrior takes you step by step through the world of routers, switches, firewalls, and other technologies based on the author's extensive field experience. You'll find new content for MPLS, IPv6, VoIP, and wireless in this completely revised second edition, along with examples of Cisco Nexus 5000 and 7000 switches throughout. Topics include: An

Computer Networks A Systems Approach

CERN Document Server

Peterson, Larry L

2011-01-01

This best-selling and classic book teaches you the key principles of computer networks with examples drawn from the real world of network and protocol design. Using the Internet as the primary example, the authors explain various protocols and networking technologies. Their systems-oriented approach encourages you to think about how individual network components fit into a larger, complex system of interactions. Whatever your perspective, whether it be that of an application developer, network administrator, or a designer of network equipment or protocols, you will come away with a "big pictur

Evaluation of Network Reliability for Computer Networks with Multiple Sources

Directory of Open Access Journals (Sweden)

Yi-Kuei Lin

2012-01-01

Full Text Available Evaluating the reliability of a network with multiple sources to multiple sinks is a critical issue from the perspective of quality management. Due to the unrealistic definition of paths of network models in previous literature, existing models are not appropriate for real-world computer networks such as the Taiwan Advanced Research and Education Network (TWAREN. This paper proposes a modified stochastic-flow network model to evaluate the network reliability of a practical computer network with multiple sources where data is transmitted through several light paths (LPs. Network reliability is defined as being the probability of delivering a specified amount of data from the sources to the sink. It is taken as a performance index to measure the service level of TWAREN. This paper studies the network reliability of the international portion of TWAREN from two sources (Taipei and Hsinchu to one sink (New York that goes through a submarine and land surface cable between Taiwan and the United States.

Discriminative topological features reveal biological network mechanisms

Directory of Open Access Journals (Sweden)

Levovitz Chaya

2004-11-01

Full Text Available Abstract Background Recent genomic and bioinformatic advances have motivated the development of numerous network models intending to describe graphs of biological, technological, and sociological origin. In most cases the success of a model has been evaluated by how well it reproduces a few key features of the real-world data, such as degree distributions, mean geodesic lengths, and clustering coefficients. Often pairs of models can reproduce these features with indistinguishable fidelity despite being generated by vastly different mechanisms. In such cases, these few target features are insufficient to distinguish which of the different models best describes real world networks of interest; moreover, it is not clear a priori that any of the presently-existing algorithms for network generation offers a predictive description of the networks inspiring them. Results We present a method to assess systematically which of a set of proposed network generation algorithms gives the most accurate description of a given biological network. To derive discriminative classifiers, we construct a mapping from the set of all graphs to a high-dimensional (in principle infinite-dimensional "word space". This map defines an input space for classification schemes which allow us to state unambiguously which models are most descriptive of a given network of interest. Our training sets include networks generated from 17 models either drawn from the literature or introduced in this work. We show that different duplication-mutation schemes best describe the E. coli genetic network, the S. cerevisiae protein interaction network, and the C. elegans neuronal network, out of a set of network models including a linear preferential attachment model and a small-world model. Conclusions Our method is a first step towards systematizing network models and assessing their predictability, and we anticipate its usefulness for a number of communities.

Network science

CERN Document Server

Barabasi, Albert-Laszlo

2016-01-01

Networks are everywhere, from the Internet, to social networks, and the genetic networks that determine our biological existence. Illustrated throughout in full colour, this pioneering textbook, spanning a wide range of topics from physics to computer science, engineering, economics and the social sciences, introduces network science to an interdisciplinary audience. From the origins of the six degrees of separation to explaining why networks are robust to random failures, the author explores how viruses like Ebola and H1N1 spread, and why it is that our friends have more friends than we do. Using numerous real-world examples, this innovatively designed text includes clear delineation between undergraduate and graduate level material. The mathematical formulas and derivations are included within Advanced Topics sections, enabling use at a range of levels. Extensive online resources, including films and software for network analysis, make this a multifaceted companion for anyone with an interest in network sci...

Accelerating networks

International Nuclear Information System (INIS)

Smith, David M D; Onnela, Jukka-Pekka; Johnson, Neil F

2007-01-01

Evolving out-of-equilibrium networks have been under intense scrutiny recently. In many real-world settings the number of links added per new node is not constant but depends on the time at which the node is introduced in the system. This simple idea gives rise to the concept of accelerating networks, for which we review an existing definition and-after finding it somewhat constrictive-offer a new definition. The new definition provided here views network acceleration as a time dependent property of a given system as opposed to being a property of the specific algorithm applied to grow the network. The definition also covers both unweighted and weighted networks. As time-stamped network data becomes increasingly available, the proposed measures may be easily applied to such empirical datasets. As a simple case study we apply the concepts to study the evolution of three different instances of Wikipedia, namely, those in English, German, and Japanese, and find that the networks undergo different acceleration regimes in their evolution

Spectrum-Based and Collaborative Network Topology Analysis and Visualization

Science.gov (United States)

Hu, Xianlin

2013-01-01

Networks are of significant importance in many application domains, such as World Wide Web and social networks, which often embed rich topological information. Since network topology captures the organization of network nodes and links, studying network topology is very important to network analysis. In this dissertation, we study networks by…

STATE NETWORK INTERNATIONAL POLITICAL INTERACTION

Directory of Open Access Journals (Sweden)

D. M. Feldman

2011-01-01

Full Text Available Abstract: The processes of fragmentation (regionalization and localization and globalization turn the state as the basic system forming element of the state-centric world political system into the component of the world political network. The political relations between actors of the world political network are ruled by the effectiveness and not by legitimacy (“victory rules”, what is different from the participatory principles of interstate relations (“participation rules” accepted by the Westphalian state system. The article argues that the post-Westphalian world political system will witness the clashes between victory rules and participation rules and their eventual coexistence since the very nature of the victory rules hinders its institutionalization, consolidation and legitimation. The article suggests that the new system of state relations regardless of the name will be not less Westphalian than the preceding one thus new participation rules will have to be formulated and codified.

Computer Network Security- The Challenges of Securing a Computer Network

Science.gov (United States)

Scotti, Vincent, Jr.

2011-01-01

This article is intended to give the reader an overall perspective on what it takes to design, implement, enforce and secure a computer network in the federal and corporate world to insure the confidentiality, integrity and availability of information. While we will be giving you an overview of network design and security, this article will concentrate on the technology and human factors of securing a network and the challenges faced by those doing so. It will cover the large number of policies and the limits of technology and physical efforts to enforce such policies.

IAU Public Astronomical Organisations Network

Science.gov (United States)

Canas, Lina; Cheung, Sze Leung

2015-08-01

The Office for Astronomy Outreach has devoted intensive means to create and support a global network of public astronomical organisations around the world. Focused on bringing established and newly formed amateur astronomy organizations together, providing communications channels and platforms for disseminating news to the global community and the sharing of best practices and resources among these associations around the world. In establishing the importance that these organizations have for the dissemination of activities globally and acting as key participants in IAU various campaigns social media has played a key role in keeping this network engaged and connected. Here we discuss the implementation process of maintaining this extensive network, the processing and gathering of information and the interactions between local active members at a national and international level.

Network-Embedded Management and Applications Understanding Programmable Networking Infrastructure

CERN Document Server

Wolter, Ralf

2013-01-01

Despite the explosion of networking services and applications in the past decades, the basic technological underpinnings of the Internet have remained largely unchanged. At its heart are special-purpose appliances that connect us to the digital world, commonly known as switches and routers. Now, however, the traditional framework is being increasingly challenged by new methods that are jostling for a position in the next-generation Internet. The concept of a network that is becoming more programmable is one of the aspects that are taking center stage. This opens new possibilities to embed software applications inside the network itself and to manage networks and communications services with unprecedented ease and efficiency. In this edited volume, distinguished experts take the reader on a tour of different facets of programmable network infrastructure and application exploit it. Presenting the state of the art in network embedded management and applications and programmable network infrastructure, the book c...

Linear analysis of degree correlations in complex networks

Indian Academy of Sciences (India)

Many real-world networks such as the protein–protein interaction networks and metabolic networks often display nontrivial correlations between degrees of vertices connected by edges. Here, we analyse the statistical methods used usually to describe the degree correlation in the networks, and analytically give linear ...

Epidemic spreading on complex networks with community structures

NARCIS (Netherlands)

Stegehuis, C.; van der Hofstad, R.W.; van Leeuwaarden, J.S.H.

2016-01-01

Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities

Noise influence on spike activation in a Hindmarsh–Rose small-world neural network

International Nuclear Information System (INIS)

Zhe, Sun; Micheletto, Ruggero

2016-01-01

We studied the role of noise in neural networks, especially focusing on its relation to the propagation of spike activity in a small sized system. We set up a source of information using a single neuron that is constantly spiking. This element called initiator x o feeds spikes to the rest of the network that is initially quiescent and subsequently reacts with vigorous spiking after a transitional period of time. We found that noise quickly suppresses the initiator’s influence and favors spontaneous spike activity and, using a decibel representation of noise intensity, we established a linear relationship between noise amplitude and the interval from the initiator’s first spike and the rest of the network activation. We studied the same process with networks of different sizes (number of neurons) and found that the initiator x o has a measurable influence on small networks, but as the network grows in size, spontaneous spiking emerges disrupting its effects on networks of more than about N = 100 neurons. This suggests that the mechanism of internal noise generation allows information transmission within a small neural neighborhood, but decays for bigger network domains. We also analyzed the Fourier spectrum of the whole network membrane potential and verified that noise provokes the reduction of main θ and α peaks before transitioning into chaotic spiking. However, network size does not reproduce a similar phenomena; instead we recorded a reduction in peaks’ amplitude, a better sharpness and definition of Fourier peaks, but not the evident degeneration to chaos observed with increasing external noise. This work aims to contribute to the understanding of the fundamental mechanisms of propagation of spontaneous spiking in neural networks and gives a quantitative assessment of how noise can be used to control and modulate this phenomenon in Hindmarsh−Rose (H−R) neural networks. (paper)

Noise influence on spike activation in a Hindmarsh-Rose small-world neural network

Science.gov (United States)

Zhe, Sun; Micheletto, Ruggero

2016-07-01

We studied the role of noise in neural networks, especially focusing on its relation to the propagation of spike activity in a small sized system. We set up a source of information using a single neuron that is constantly spiking. This element called initiator x o feeds spikes to the rest of the network that is initially quiescent and subsequently reacts with vigorous spiking after a transitional period of time. We found that noise quickly suppresses the initiator’s influence and favors spontaneous spike activity and, using a decibel representation of noise intensity, we established a linear relationship between noise amplitude and the interval from the initiator’s first spike and the rest of the network activation. We studied the same process with networks of different sizes (number of neurons) and found that the initiator x o has a measurable influence on small networks, but as the network grows in size, spontaneous spiking emerges disrupting its effects on networks of more than about N = 100 neurons. This suggests that the mechanism of internal noise generation allows information transmission within a small neural neighborhood, but decays for bigger network domains. We also analyzed the Fourier spectrum of the whole network membrane potential and verified that noise provokes the reduction of main θ and α peaks before transitioning into chaotic spiking. However, network size does not reproduce a similar phenomena; instead we recorded a reduction in peaks’ amplitude, a better sharpness and definition of Fourier peaks, but not the evident degeneration to chaos observed with increasing external noise. This work aims to contribute to the understanding of the fundamental mechanisms of propagation of spontaneous spiking in neural networks and gives a quantitative assessment of how noise can be used to control and modulate this phenomenon in Hindmarsh-Rose (H-R) neural networks.

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

Klasifikasi Paket Jaringan Berbasis Analisis Statistik dan Neural Network

Directory of Open Access Journals (Sweden)

Harsono Harsono

2018-01-01

Full Text Available Distributed Denial-of-Service (DDoS is one of network attack technique which increased every year, especially in both of intensity and volume. DDoS attacks are still one of the world's major Internet threats and become a major problem of cyber-world security. Research in this paper aims to establish a new approach on network packets classification, which can be a basis for framework development on Distributed Denial-of-Service (DDoS attack detection systems. The proposed approach to solving the problem on network packet classification is by combining statistical data quantification methods with neural network methods. Based on the test, it is found that the average percentage of neural network classification accuracy against network data packet is 92.99%.

Network secure communications based on beam halo-chaos

International Nuclear Information System (INIS)

Liu Qiang; Fang Jinqing; Li Yong

2010-01-01

Based on beam halo-chaos synchronization in the beam transport network (line)with small-world effect, using three synchronization methods:the driver-response synchronization, small-world topology coupling synchronization and multi-local small-world topology coupling synchronization, three kinds of secure communication projects were designed respectively, and were studied numerically by the Simulink tool of the Matlab software. Numerical experimental results demonstrate that encryption and decryption of the original signal are realized successfully. It provides effective theoretical foundation and reference for the next engineering design and network experiment. (authors)

Homophyly/kinship hypothesis: Natural communities, and predicting in networks

Science.gov (United States)

Li, Angsheng; Li, Jiankou; Pan, Yicheng

2015-02-01

It has been a longstanding challenge to understand natural communities in real world networks. We proposed a community finding algorithm based on fitness of networks, two algorithms for prediction, accurate prediction and confirmation of keywords for papers in the citation network Arxiv HEP-TH (high energy physics theory), and the measures of internal centrality, external de-centrality, internal and external slopes to characterize the structures of communities. We implemented our algorithms on 2 citation and 5 cooperation graphs. Our experiments explored and validated a homophyly/kinship principle of real world networks. The homophyly/kinship principle includes: (1) homophyly is the natural selection in real world networks, similar to Darwin's kinship selection in nature, (2) real world networks consist of natural communities generated by the natural selection of homophyly, (3) most individuals in a natural community share a short list of common attributes, (4) natural communities have an internal centrality (or internal heterogeneity) that a natural community has a few nodes dominating most of the individuals in the community, (5) natural communities have an external de-centrality (or external homogeneity) that external links of a natural community homogeneously distributed in different communities, and (6) natural communities of a given network have typical structures determined by the internal slopes, and have typical patterns of outgoing links determined by external slopes, etc. Our homophyly/kinship principle perfectly matches Darwin's observation that animals from ants to people form social groups in which most individuals work for the common good, and that kinship could encourage altruistic behavior. Our homophyly/kinship principle is the network version of Darwinian theory, and builds a bridge between Darwinian evolution and network science.

Modeling Temporal Evolution and Multiscale Structure in Networks

DEFF Research Database (Denmark)

Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard

2013-01-01

Many real-world networks exhibit both temporal evolution and multiscale structure. We propose a model for temporally correlated multifurcating hierarchies in complex networks which jointly capture both effects. We use the Gibbs fragmentation tree as prior over multifurcating trees and a change......-point model to account for the temporal evolution of each vertex. We demonstrate that our model is able to infer time-varying multiscale structure in synthetic as well as three real world time-evolving complex networks. Our modeling of the temporal evolution of hierarchies brings new insights...

Robustness and structure of complex networks

Science.gov (United States)

Shao, Shuai

This dissertation covers the two major parts of my PhD research on statistical physics and complex networks: i) modeling a new type of attack -- localized attack, and investigating robustness of complex networks under this type of attack; ii) discovering the clustering structure in complex networks and its influence on the robustness of coupled networks. Complex networks appear in every aspect of our daily life and are widely studied in Physics, Mathematics, Biology, and Computer Science. One important property of complex networks is their robustness under attacks, which depends crucially on the nature of attacks and the structure of the networks themselves. Previous studies have focused on two types of attack: random attack and targeted attack, which, however, are insufficient to describe many real-world damages. Here we propose a new type of attack -- localized attack, and study the robustness of complex networks under this type of attack, both analytically and via simulation. On the other hand, we also study the clustering structure in the network, and its influence on the robustness of a complex network system. In the first part, we propose a theoretical framework to study the robustness of complex networks under localized attack based on percolation theory and generating function method. We investigate the percolation properties, including the critical threshold of the phase transition pc and the size of the giant component Pinfinity. We compare localized attack with random attack and find that while random regular (RR) networks are more robust against localized attack, Erdoḧs-Renyi (ER) networks are equally robust under both types of attacks. As for scale-free (SF) networks, their robustness depends crucially on the degree exponent lambda. The simulation results show perfect agreement with theoretical predictions. We also test our model on two real-world networks: a peer-to-peer computer network and an airline network, and find that the real-world networks

Large-Scale Recurrent Neural Network Based Modelling of Gene Regulatory Network Using Cuckoo Search-Flower Pollination Algorithm.

Science.gov (United States)

Mandal, Sudip; Khan, Abhinandan; Saha, Goutam; Pal, Rajat K

2016-01-01

The accurate prediction of genetic networks using computational tools is one of the greatest challenges in the postgenomic era. Recurrent Neural Network is one of the most popular but simple approaches to model the network dynamics from time-series microarray data. To date, it has been successfully applied to computationally derive small-scale artificial and real-world genetic networks with high accuracy. However, they underperformed for large-scale genetic networks. Here, a new methodology has been proposed where a hybrid Cuckoo Search-Flower Pollination Algorithm has been implemented with Recurrent Neural Network. Cuckoo Search is used to search the best combination of regulators. Moreover, Flower Pollination Algorithm is applied to optimize the model parameters of the Recurrent Neural Network formalism. Initially, the proposed method is tested on a benchmark large-scale artificial network for both noiseless and noisy data. The results obtained show that the proposed methodology is capable of increasing the inference of correct regulations and decreasing false regulations to a high degree. Secondly, the proposed methodology has been validated against the real-world dataset of the DNA SOS repair network of Escherichia coli. However, the proposed method sacrifices computational time complexity in both cases due to the hybrid optimization process.

Epidemic threshold in directed networks

Science.gov (United States)

Li, Cong; Wang, Huijuan; Van Mieghem, Piet

2013-12-01

Epidemics have so far been mostly studied in undirected networks. However, many real-world networks, such as the online social network Twitter and the world wide web, on which information, emotion, or malware spreads, are directed networks, composed of both unidirectional links and bidirectional links. We define the directionality ξ as the percentage of unidirectional links. The epidemic threshold τc for the susceptible-infected-susceptible (SIS) epidemic is lower bounded by 1/λ1 in directed networks, where λ1, also called the spectral radius, is the largest eigenvalue of the adjacency matrix. In this work, we propose two algorithms to generate directed networks with a given directionality ξ. The effect of ξ on the spectral radius λ1, principal eigenvector x1, spectral gap (λ1-λ2), and algebraic connectivity μN-1 is studied. Important findings are that the spectral radius λ1 decreases with the directionality ξ, whereas the spectral gap and the algebraic connectivity increase with the directionality ξ. The extent of the decrease of the spectral radius depends on both the degree distribution and the degree-degree correlation ρD. Hence, in directed networks, the epidemic threshold is larger and a random walk converges to its steady state faster than that in undirected networks with the same degree distribution.

Identification of important nodes in directed biological networks: a network motif approach.

Directory of Open Access Journals (Sweden)

Pei Wang

Full Text Available Identification of important nodes in complex networks has attracted an increasing attention over the last decade. Various measures have been proposed to characterize the importance of nodes in complex networks, such as the degree, betweenness and PageRank. Different measures consider different aspects of complex networks. Although there are numerous results reported on undirected complex networks, few results have been reported on directed biological networks. Based on network motifs and principal component analysis (PCA, this paper aims at introducing a new measure to characterize node importance in directed biological networks. Investigations on five real-world biological networks indicate that the proposed method can robustly identify actually important nodes in different networks, such as finding command interneurons, global regulators and non-hub but evolutionary conserved actually important nodes in biological networks. Receiver Operating Characteristic (ROC curves for the five networks indicate remarkable prediction accuracy of the proposed measure. The proposed index provides an alternative complex network metric. Potential implications of the related investigations include identifying network control and regulation targets, biological networks modeling and analysis, as well as networked medicine.

The small world of osteocytes: connectomics of the lacuno-canalicular network in bone

Science.gov (United States)

Kollmannsberger, Philip; Kerschnitzki, Michael; Repp, Felix; Wagermaier, Wolfgang; Weinkamer, Richard; Fratzl, Peter

2017-07-01

Osteocytes and their cell processes reside in a large, interconnected network of voids pervading the mineralized bone matrix of most vertebrates. This osteocyte lacuno-canalicular network (OLCN) is believed to play important roles in mechanosensing, mineral homeostasis, and for the mechanical properties of bone. While the extracellular matrix structure of bone is extensively studied on ultrastructural and macroscopic scales, there is a lack of quantitative knowledge on how the cellular network is organized. Using a recently introduced imaging and quantification approach, we analyze the OLCN in different bone types from mouse and sheep that exhibit different degrees of structural organization not only of the cell network but also of the fibrous matrix deposited by the cells. We define a number of robust, quantitative measures that are derived from the theory of complex networks. These measures enable us to gain insights into how efficient the network is organized with regard to intercellular transport and communication. Our analysis shows that the cell network in regularly organized, slow-growing bone tissue from sheep is less connected, but more efficiently organized compared to irregular and fast-growing bone tissue from mice. On the level of statistical topological properties (edges per node, edge length and degree distribution), both network types are indistinguishable, highlighting that despite pronounced differences at the tissue level, the topological architecture of the osteocyte canalicular network at the subcellular level may be independent of species and bone type. Our results suggest a universal mechanism underlying the self-organization of individual cells into a large, interconnected network during bone formation and mineralization.

The small world of osteocytes: connectomics of the lacuno-canalicular network in bone

International Nuclear Information System (INIS)

Kollmannsberger, Philip; Kerschnitzki, Michael; Repp, Felix; Wagermaier, Wolfgang; Weinkamer, Richard; Fratzl, Peter

2017-01-01

Osteocytes and their cell processes reside in a large, interconnected network of voids pervading the mineralized bone matrix of most vertebrates. This osteocyte lacuno-canalicular network (OLCN) is believed to play important roles in mechanosensing, mineral homeostasis, and for the mechanical properties of bone. While the extracellular matrix structure of bone is extensively studied on ultrastructural and macroscopic scales, there is a lack of quantitative knowledge on how the cellular network is organized. Using a recently introduced imaging and quantification approach, we analyze the OLCN in different bone types from mouse and sheep that exhibit different degrees of structural organization not only of the cell network but also of the fibrous matrix deposited by the cells. We define a number of robust, quantitative measures that are derived from the theory of complex networks. These measures enable us to gain insights into how efficient the network is organized with regard to intercellular transport and communication. Our analysis shows that the cell network in regularly organized, slow-growing bone tissue from sheep is less connected, but more efficiently organized compared to irregular and fast-growing bone tissue from mice. On the level of statistical topological properties (edges per node, edge length and degree distribution), both network types are indistinguishable, highlighting that despite pronounced differences at the tissue level, the topological architecture of the osteocyte canalicular network at the subcellular level may be independent of species and bone type. Our results suggest a universal mechanism underlying the self-organization of individual cells into a large, interconnected network during bone formation and mineralization. (paper)

"Price-quakes" shaking the world's stock exchanges.

Directory of Open Access Journals (Sweden)

Jørgen Vitting Andersen

Full Text Available BACKGROUND: Systemic risk has received much more awareness after the excessive risk taking by major financial instituations pushed the world's financial system into what many considered a state of near systemic failure in 2008. The IMF for example in its yearly 2009 Global Financial Stability Report acknowledged the lack of proper tools and research on the topic. Understanding how disruptions can propagate across financial markets is therefore of utmost importance. METHODOLOGY/PRINCIPAL FINDINGS: Here, we use empirical data to show that the world's markets have a non-linear threshold response to events, consistent with the hypothesis that traders exhibit change blindness. Change blindness is the tendency of humans to ignore small changes and to react disproportionately to large events. As we show, this may be responsible for generating cascading events--pricequakes--in the world's markets. We propose a network model of the world's stock exchanges that predicts how an individual stock exchange should be priced in terms of the performance of the global market of exchanges, but with change blindness included in the pricing. The model has a direct correspondence to models of earth tectonic plate movements developed in physics to describe the slip-stick movement of blocks linked via spring forces. CONCLUSIONS/SIGNIFICANCE: We have shown how the price dynamics of the world's stock exchanges follows a dynamics of build-up and release of stress, similar to earthquakes. The nonlinear response allows us to classify price movements of a given stock index as either being generated internally, due to specific economic news for the country in question, or externally, by the ensemble of the world's stock exchanges reacting together like a complex system. The model may provide new insight into the origins and thereby also prevent systemic risks in the global financial network.

"Price-quakes" shaking the world's stock exchanges.

Science.gov (United States)

Andersen, Jørgen Vitting; Nowak, Andrzej; Rotundo, Giulia; Parrott, Lael; Martinez, Sebastian

2011-01-01

Systemic risk has received much more awareness after the excessive risk taking by major financial instituations pushed the world's financial system into what many considered a state of near systemic failure in 2008. The IMF for example in its yearly 2009 Global Financial Stability Report acknowledged the lack of proper tools and research on the topic. Understanding how disruptions can propagate across financial markets is therefore of utmost importance. Here, we use empirical data to show that the world's markets have a non-linear threshold response to events, consistent with the hypothesis that traders exhibit change blindness. Change blindness is the tendency of humans to ignore small changes and to react disproportionately to large events. As we show, this may be responsible for generating cascading events--pricequakes--in the world's markets. We propose a network model of the world's stock exchanges that predicts how an individual stock exchange should be priced in terms of the performance of the global market of exchanges, but with change blindness included in the pricing. The model has a direct correspondence to models of earth tectonic plate movements developed in physics to describe the slip-stick movement of blocks linked via spring forces. We have shown how the price dynamics of the world's stock exchanges follows a dynamics of build-up and release of stress, similar to earthquakes. The nonlinear response allows us to classify price movements of a given stock index as either being generated internally, due to specific economic news for the country in question, or externally, by the ensemble of the world's stock exchanges reacting together like a complex system. The model may provide new insight into the origins and thereby also prevent systemic risks in the global financial network.

Spontane strategier i innovationsnetværk: materialitetens betydning for stabiliseringen af virtuelle verdner som professionelt kommunikationsmedie [Spontaneous strategies in innovation networks: The importance of materiality in stabilising virtual worlds

Directory of Open Access Journals (Sweden)

Emil Husted

2012-09-01

Full Text Available Much research has dealt with how social and organisational processes change when they take place in virtual spaces. This article considers innovation processes in which actors try to establish virtual worlds as platforms for professional communication. However, instead of focusing on internal communication processes in virtual worlds, the article seeks to question the dichotomy between physical and virtual worlds and to explore the importance of materiality in organising the virtual. Adopting a perspective inspired by actor-network theory, the article argues that physical places and objects do not only serve as context for innovation processes, but on the contrary are incorporated as strategic resources that actively help create the virtual worlds. The article is based on an empirical analysis of five Danish companies, and shows how companies make use of physical places and objects as strategic resources in the innovation process. Thus the article contributes to the literature on innovation in new media such as virtual worlds.

Extreme Networks' 10-Gigabit Ethernet enables

CERN Multimedia

2002-01-01

" Extreme Networks, Inc.'s 10-Gigabit switching platform enabled researchers to transfer one Terabyte of information from Vancouver to Geneva across a single network hop, the world's first large-scale, end-to-end transfer of its kind" (1/2 page).

Complexities of social networks: A Physicist's perspective

OpenAIRE

Sen, Parongama

2006-01-01

The review is a survey of the present status of research in social networks highlighting the topics of small world property, degree distributions, community structure, assortativity, modelling, dynamics and searching in social networks.

Motif formation and industry specific topologies in the Japanese business firm network

Science.gov (United States)

Maluck, Julian; Donner, Reik V.; Takayasu, Hideki; Takayasu, Misako

2017-05-01

Motifs and roles are basic quantities for the characterization of interactions among 3-node subsets in complex networks. In this work, we investigate how the distribution of 3-node motifs can be influenced by modifying the rules of an evolving network model while keeping the statistics of simpler network characteristics, such as the link density and the degree distribution, invariant. We exemplify this problem for the special case of the Japanese Business Firm Network, where a well-studied and relatively simple yet realistic evolving network model is available, and compare the resulting motif distribution in the real-world and simulated networks. To better approximate the motif distribution of the real-world network in the model, we introduce both subgraph dependent and global additional rules. We find that a specific rule that allows only for the merging process between nodes with similar link directionality patterns reduces the observed excess of densely connected motifs with bidirectional links. Our study improves the mechanistic understanding of motif formation in evolving network models to better describe the characteristic features of real-world networks with a scale-free topology.

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)

Analyzing complex networks through correlations in centrality measurements

International Nuclear Information System (INIS)

Ricardo Furlan Ronqui, José; Travieso, Gonzalo

2015-01-01

Many real world systems can be expressed as complex networks of interconnected nodes. It is frequently important to be able to quantify the relative importance of the various nodes in the network, a task accomplished by defining some centrality measures, with different centrality definitions stressing different aspects of the network. It is interesting to know to what extent these different centrality definitions are related for different networks. In this work, we study the correlation between pairs of a set of centrality measures for different real world networks and two network models. We show that the centralities are in general correlated, but with stronger correlations for network models than for real networks. We also show that the strength of the correlation of each pair of centralities varies from network to network. Taking this fact into account, we propose the use of a centrality correlation profile, consisting of the values of the correlation coefficients between all pairs of centralities of interest, as a way to characterize networks. Using the yeast protein interaction network as an example we show also that the centrality correlation profile can be used to assess the adequacy of a network model as a representation of a given real network. (paper)

Multilayer Brain Networks

Science.gov (United States)

Vaiana, Michael; Muldoon, Sarah Feldt

2018-01-01

The field of neuroscience is facing an unprecedented expanse in the volume and diversity of available data. Traditionally, network models have provided key insights into the structure and function of the brain. With the advent of big data in neuroscience, both more sophisticated models capable of characterizing the increasing complexity of the data and novel methods of quantitative analysis are needed. Recently, multilayer networks, a mathematical extension of traditional networks, have gained increasing popularity in neuroscience due to their ability to capture the full information of multi-model, multi-scale, spatiotemporal data sets. Here, we review multilayer networks and their applications in neuroscience, showing how incorporating the multilayer framework into network neuroscience analysis has uncovered previously hidden features of brain networks. We specifically highlight the use of multilayer networks to model disease, structure-function relationships, network evolution, and link multi-scale data. Finally, we close with a discussion of promising new directions of multilayer network neuroscience research and propose a modified definition of multilayer networks designed to unite and clarify the use of the multilayer formalism in describing real-world systems.

The Best of All Worlds: Immersive Interfaces for Art Education in Virtual and Real World Teaching and Learning Environments

Science.gov (United States)

Grenfell, Janette

2013-01-01

Selected ubiquitous technologies encourage collaborative participation between higher education students and educators within a virtual socially networked e-learning landscape. Multiple modes of teaching and learning, ranging from real world experiences, to text and digital images accessed within the Deakin studies online learning management…

The degree distribution of fixed act-size collaboration networks

Indian Academy of Sciences (India)

ranging from the physical to biological, to even social sciences. Typical complex networks include the World Wide Web [1], biological interacting networks [2–4], ... and dynamical features of such complex networks has become overwhelming.

Exploring the story, science, and adventure of small worlds

Science.gov (United States)

Swann, J. L.; Elkins-Tanton, L. T.; Anbar, A. D.; Klug Boonstra, S.; Tamer, A. J.; Mead, C.; Hunsley, D.

2017-12-01

Small worlds are a strategic focus at NASA, reflected by missions such as Osiris Rex and Psyche among others. The Infiniscope project, with funding from NASA SMD, is building on this scientific and public interest to teach formal and informal learners about asteroids and other small worlds. The digital learning experience, "Where are the small worlds?", and future Infiniscope experiences, incorporate a design theory that we describe as "education through exploration" (ETX) which is provided through an adaptive e-learning platform. This design ensures that learners actively engage in exploration and discovery, while receiving targeted feedback to push through challenges. To ensure that this and future experiences reach and meet the needs of as many educators as possible, Infiniscope includes a digital teaching network to host the experiences and support the reuse and adaptation of digital resources in new lessons. "Where are the small worlds?" puts learners in an interactive simulation of the solar system and provides a mission structure in which they hunt for "astrocaches" on near earth objects, main belt asteroids, and Kuiper-belt objects. These activities allow the learner to discover the locations of the small worlds in the solar system and develop an intuitive understanding for the relative motion of objects at various distances from the Sun. The experience is NGSS-aligned and accompanied by a lesson plan for integration into the classroom. In testing with more than 500 middle-school students, 83% of participants said they wanted to do more experiences like "Where are the small worlds?" They also found the experience both "fun" and "interesting" while being moderately difficult. "Where are the small worlds?" is one of many visualizations and lessons that is available within the Infiniscope teaching network. The network already has hundreds of members and is expected to grow in both numbers and engagement over time. Currently, educators can search and use pre

World-Wide Web: The Information Universe.

Science.gov (United States)

Berners-Lee, Tim; And Others

1992-01-01

Describes the World-Wide Web (W3) project, which is designed to create a global information universe using techniques of hypertext, information retrieval, and wide area networking. Discussion covers the W3 data model, W3 architecture, the document naming scheme, protocols, document formats, comparison with other systems, experience with the W3…

Connecting the Greeks : Festival networks in the Hellenistic world

NARCIS (Netherlands)

Williamson, Christina; van Nijf, Onno; Mann, Christian; Remijssen, Sophie; Scharff, Sebastian

2016-01-01

Panhellenic festivals were central to the ancient Greek world since archaic times, with places such as Delphi and Olympia defining the essence of a Greek ‘imagined community’. In the Hellenistic period, several Greek cities began to organize large-scale festivals of their own at their main

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks

Science.gov (United States)

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-11-01

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.

Simulating synchronization in neuronal networks

Science.gov (United States)

Fink, Christian G.

2016-06-01

We discuss several techniques used in simulating neuronal networks by exploring how a network's connectivity structure affects its propensity for synchronous spiking. Network connectivity is generated using the Watts-Strogatz small-world algorithm, and two key measures of network structure are described. These measures quantify structural characteristics that influence collective neuronal spiking, which is simulated using the leaky integrate-and-fire model. Simulations show that adding a small number of random connections to an otherwise lattice-like connectivity structure leads to a dramatic increase in neuronal synchronization.

Network management, status and directions

International Nuclear Information System (INIS)

Cottrell, R.L.A.; Streater, T.C.

1992-09-01

It has been said that the ''network is the system''. This implies providing levels of service, reliability, predictability and availability that are commensurate with or better than those that individual computers provide today. To provide this requires integrated network management for interconnected networks of heterogeneous devices covering both the local campus and across the world and spanning many administrative domains. This talk will review the status of existing tools to address management for networks. It draws on experience from both within and outside the HEP community

Human behavior understanding in networked sensing theory and applications of networks of sensors

CERN Document Server

Spagnolo, Paolo; Distante, Cosimo

2014-01-01

This unique text/reference provides a broad overview of both the technical challenges in sensor network development, and the real-world applications of distributed sensing. Important aspects of distributed computing in large-scale networked sensor systems are analyzed in the context of human behavior understanding, including such topics as systems design tools and techniques, in-network signals, and information processing. Additionally, the book examines a varied range of application scenarios, covering surveillance, indexing and retrieval, patient care, industrial safety, social and ambient

Estimation of Anonymous Email Network Characteristics through Statistical Disclosure Attacks

Directory of Open Access Journals (Sweden)

Javier Portela

2016-11-01

Full Text Available Social network analysis aims to obtain relational data from social systems to identify leaders, roles, and communities in order to model profiles or predict a specific behavior in users’ network. Preserving anonymity in social networks is a subject of major concern. Anonymity can be compromised by disclosing senders’ or receivers’ identity, message content, or sender-receiver relationships. Under strongly incomplete information, a statistical disclosure attack is used to estimate the network and node characteristics such as centrality and clustering measures, degree distribution, and small-world-ness. A database of email networks in 29 university faculties is used to study the method. A research on the small-world-ness and Power law characteristics of these email networks is also developed, helping to understand the behavior of small email networks.

Estimation of Anonymous Email Network Characteristics through Statistical Disclosure Attacks

Science.gov (United States)

Portela, Javier; García Villalba, Luis Javier; Silva Trujillo, Alejandra Guadalupe; Sandoval Orozco, Ana Lucila; Kim, Tai-Hoon

2016-01-01

Social network analysis aims to obtain relational data from social systems to identify leaders, roles, and communities in order to model profiles or predict a specific behavior in users’ network. Preserving anonymity in social networks is a subject of major concern. Anonymity can be compromised by disclosing senders’ or receivers’ identity, message content, or sender-receiver relationships. Under strongly incomplete information, a statistical disclosure attack is used to estimate the network and node characteristics such as centrality and clustering measures, degree distribution, and small-world-ness. A database of email networks in 29 university faculties is used to study the method. A research on the small-world-ness and Power law characteristics of these email networks is also developed, helping to understand the behavior of small email networks. PMID:27809275

How can social networks ever become complex? Modelling the emergence of complex networks from local social exchanges

NARCIS (Netherlands)

Pujol, Josep M.; Flache, Andreas; Delgado, Jordi; Sangüesa, Ramon; Sanguessa, R.

2005-01-01

Small-world and power-law network structures have been prominently proposed as models of large networks. However, the assumptions of these models usually-lack sociological grounding. We present a computational model grounded in social exchange theory. Agents search attractive exchange partners in a

Social networks as a new tool of information warfare in the modern world

Directory of Open Access Journals (Sweden)

B. W. Kovalevych

2014-03-01

Full Text Available With the rapid development of information technologies, especially the Internet, people are becoming increasingly dependent on information that surrounds them. And social networks, where a person spends most of their time, become the ideal instruments of influence on the people consciousness and information warfare. Due to psychological factors ( such as ‘spiral of silence’, the herd instinct, the entire credibility of published information, opinion leaders, the desire for self­realization or replacement of reality that influence the human behavior in the network and the use of models of influence (model of network attack, model of involving users as volunteers, total block model, social networks become a platform for the dissemination of political ideas, ideologies and implementation of the ‘color revolutions’. However, social media play a positive role, especially in the establishment of civil society and the free flow of information. Positive or negative impact of networks primary depends on the purpose of use of social networking tools.

Interfacing Network Simulations and Empirical Data

Science.gov (United States)

2009-05-01

contraceptive innovations in the Cameroon. He found that real-world adoption rates did not follow simulation models when the network relationships were...Analysis of the Coevolution of Adolescents ’ Friendship Networks, Taste in Music, and Alcohol Consumption. Methodology, 2: 48-56. Tichy, N.M., Tushman

Finding overlapping communities in multilayer networks.

Science.gov (United States)

Liu, Weiyi; Suzumura, Toyotaro; Ji, Hongyu; Hu, Guangmin

2018-01-01

Finding communities in multilayer networks is a vital step in understanding the structure and dynamics of these layers, where each layer represents a particular type of relationship between nodes in the natural world. However, most community discovery methods for multilayer networks may ignore the interplay between layers or the unique topological structure in a layer. Moreover, most of them can only detect non-overlapping communities. In this paper, we propose a new community discovery method for multilayer networks, which leverages the interplay between layers and the unique topology in a layer to reveal overlapping communities. Through a comprehensive analysis of edge behaviors within and across layers, we first calculate the similarities for edges from the same layer and the cross layers. Then, by leveraging these similarities, we can construct a dendrogram for the multilayer networks that takes both the unique topological structure and the important interplay into consideration. Finally, by introducing a new community density metric for multilayer networks, we can cut the dendrogram to get the overlapping communities for these layers. By applying our method on both synthetic and real-world datasets, we demonstrate that our method has an accurate performance in discovering overlapping communities in multilayer networks.