From brain to earth and climate systems: small-world interaction networks or not?
Bialonski, Stephan; Horstmann, Marie-Therese; Lehnertz, Klaus
2010-03-01
We consider recent reports on small-world topologies of interaction networks derived from the dynamics of spatially extended systems that are investigated in diverse scientific fields such as neurosciences, geophysics, or meteorology. With numerical simulations that mimic typical experimental situations, we have identified an important constraint when characterizing such networks: indications of a small-world topology can be expected solely due to the spatial sampling of the system along with the commonly used time series analysis based approaches to network characterization.
A Small World of Neuronal Synchrony
Yu, Shan; Huang, Debin; Singer, Wolf
2008-01-01
A small-world network has been suggested to be an efficient solution for achieving both modular and global processing—a property highly desirable for brain computations. Here, we investigated functional networks of cortical neurons using correlation analysis to identify functional connectivity. To reconstruct the interaction network, we applied the Ising model based on the principle of maximum entropy. This allowed us to assess the interactions by measuring pairwise correlations and to assess the strength of coupling from the degree of synchrony. Visual responses were recorded in visual cortex of anesthetized cats, simultaneously from up to 24 neurons. First, pairwise correlations captured most of the patterns in the population's activity and, therefore, provided a reliable basis for the reconstruction of the interaction networks. Second, and most importantly, the resulting networks had small-world properties; the average path lengths were as short as in simulated random networks, but the clustering coefficients were larger. Neurons differed considerably with respect to the number and strength of interactions, suggesting the existence of “hubs” in the network. Notably, there was no evidence for scale-free properties. These results suggest that cortical networks are optimized for the coexistence of local and global computations: feature detection and feature integration or binding. PMID:18400792
Competition between global and local online social networks
NASA Astrophysics Data System (ADS)
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.
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.
Modes of Interaction between Individuals Dominate the Topologies of Real World Networks
Lee, Insuk; Kim, Eiru; Marcotte, Edward M.
2015-01-01
We find that the topologies of real world networks, such as those formed within human societies, by the Internet, or among cellular proteins, are dominated by the mode of the interactions considered among the individuals. Specifically, a major dichotomy in previously studied networks arises from modeling networks in terms of pairwise versus group tasks. The former often intrinsically give rise to scale-free, disassortative, hierarchical networks, whereas the latter often give rise to single- or broad-scale, assortative, nonhierarchical networks. These dependencies explain contrasting observations among previous topological analyses of real world complex systems. We also observe this trend in systems with natural hierarchies, in which alternate representations of the same networks, but which capture different levels of the hierarchy, manifest these signature topological differences. For example, in both the Internet and cellular proteomes, networks of lower-level system components (routers within domains or proteins within biological processes) are assortative and nonhierarchical, whereas networks of upper-level system components (internet domains or biological processes) are disassortative and hierarchical. Our results demonstrate that network topologies of complex systems must be interpreted in light of their hierarchical natures and interaction types. PMID:25793969
From calls to communities: a model for time-varying social networks
NASA Astrophysics Data System (ADS)
Laurent, Guillaume; Saramäki, Jari; Karsai, Márton
2015-11-01
Social interactions vary in time and appear to be driven by intrinsic mechanisms that shape the emergent structure of social networks. Large-scale empirical observations of social interaction structure have become possible only recently, and modelling their dynamics is an actual challenge. Here we propose a temporal network model which builds on the framework of activity-driven time-varying networks with memory. The model integrates key mechanisms that drive the formation of social ties - social reinforcement, focal closure and cyclic closure, which have been shown to give rise to community structure and small-world connectedness in social networks. We compare the proposed model with a real-world time-varying network of mobile phone communication, and show that they share several characteristics from heterogeneous degrees and weights to rich community structure. Further, the strong and weak ties that emerge from the model follow similar weight-topology correlations as real-world social networks, including the role of weak ties.
Coevolution of dynamical states and interactions in dynamic networks
NASA Astrophysics Data System (ADS)
Zimmermann, Martín G.; Eguíluz, Víctor M.; San Miguel, Maxi
2004-06-01
We explore the coupled dynamics of the internal states of a set of interacting elements and the network of interactions among them. Interactions are modeled by a spatial game and the network of interaction links evolves adapting to the outcome of the game. As an example, we consider a model of cooperation in which the adaptation is shown to facilitate the formation of a hierarchical interaction network that sustains a highly cooperative stationary state. The resulting network has the characteristics of a small world network when a mechanism of local neighbor selection is introduced in the adaptive network dynamics. The highly connected nodes in the hierarchical structure of the network play a leading role in the stability of the network. Perturbations acting on the state of these special nodes trigger global avalanches leading to complete network reorganization.
Thrush, Simon F; Hewitt, Judi E; Parkes, Samantha; Lohrer, Andrew M; Pilditch, Conrad; Woodin, Sarah A; Wethey, David S; Chiantore, Mariachiara; Asnaghi, Valentina; De Juan, Silvia; Kraan, Casper; Rodil, Ivan; Savage, Candida; Van Colen, Carl
2014-06-01
Thresholds profoundly affect our understanding and management of ecosystem dynamics, but we have yet to develop practical techniques to assess the risk that thresholds will be crossed. Combining ecological knowledge of critical system interdependencies with a large-scale experiment, we tested for breaks in the ecosystem interaction network to identify threshold potential in real-world ecosystem dynamics. Our experiment with the bivalves Macomona liliana and Austrovenus stutchburyi on marine sandflats in New Zealand demonstrated that reductions in incident sunlight changed the interaction network between sediment biogeochemical fluxes, productivity, and macrofauna. By demonstrating loss of positive feedbacks and changes in the architecture of the network, we provide mechanistic evidence that stressors lead to break points in dynamics, which theory predicts predispose a system to a critical transition.
Right-side-stretched multifractal spectra indicate small-worldness in networks
NASA Astrophysics Data System (ADS)
Oświȩcimka, Paweł; Livi, Lorenzo; Drożdż, Stanisław
2018-04-01
Complex network formalism allows to explain the behavior of systems composed by interacting units. Several prototypical network models have been proposed thus far. The small-world model has been introduced to mimic two important features observed in real-world systems: i) local clustering and ii) the possibility to move across a network by means of long-range links that significantly reduce the characteristic path length. A natural question would be whether there exist several ;types; of small-world architectures, giving rise to a continuum of models with properties (partially) shared with other models belonging to different network families. Here, we take advantage of the interplay between network theory and time series analysis and propose to investigate small-world signatures in complex networks by analyzing multifractal characteristics of time series generated from such networks. In particular, we suggest that the degree of right-sided asymmetry of multifractal spectra is linked with the degree of small-worldness present in networks. This claim is supported by numerical simulations performed on several parametric models, including prototypical small-world networks, scale-free, fractal and also real-world networks describing protein molecules. Our results also indicate that right-sided asymmetry emerges with the presence of the following topological properties: low edge density, low average shortest path, and high clustering coefficient.
Emergence of structural patterns out of synchronization in networks with competitive interactions
NASA Astrophysics Data System (ADS)
Assenza, Salvatore; Gutiérrez, Ricardo; Gómez-Gardeñes, Jesús; Latora, Vito; Boccaletti, Stefano
2011-09-01
Synchronization is a collective phenomenon occurring in systems of interacting units, and is ubiquitous in nature, society and technology. Recent studies have enlightened the important role played by the interaction topology on the emergence of synchronized states. However, most of these studies neglect that real world systems change their interaction patterns in time. Here, we analyze synchronization features in networks in which structural and dynamical features co-evolve. The feedback of the node dynamics on the interaction pattern is ruled by the competition of two mechanisms: homophily (reinforcing those interactions with other correlated units in the graph) and homeostasis (preserving the value of the input strength received by each unit). The competition between these two adaptive principles leads to the emergence of key structural properties observed in real world networks, such as modular and scale-free structures, together with a striking enhancement of local synchronization in systems with no global order.
Statistical Mechanics of Temporal and Interacting Networks
NASA Astrophysics Data System (ADS)
Zhao, Kun
In the last ten years important breakthroughs in the understanding of the topology of complexity have been made in the framework of network science. Indeed it has been found that many networks belong to the universality classes called small-world networks or scale-free networks. Moreover it was found that the complex architecture of real world networks strongly affects the critical phenomena defined on these structures. Nevertheless the main focus of the research has been the characterization of single and static networks. Recently, temporal networks and interacting networks have attracted large interest. Indeed many networks are interacting or formed by a multilayer structure. Example of these networks are found in social networks where an individual might be at the same time part of different social networks, in economic and financial networks, in physiology or in infrastructure systems. Moreover, many networks are temporal, i.e. the links appear and disappear on the fast time scale. Examples of these networks are social networks of contacts such as face-to-face interactions or mobile-phone communication, the time-dependent correlations in the brain activity and etc. Understanding the evolution of temporal and multilayer networks and characterizing critical phenomena in these systems is crucial if we want to describe, predict and control the dynamics of complex system. In this thesis, we investigate several statistical mechanics models of temporal and interacting networks, to shed light on the dynamics of this new generation of complex networks. First, we investigate a model of temporal social networks aimed at characterizing human social interactions such as face-to-face interactions and phone-call communication. Indeed thanks to the availability of data on these interactions, we are now in the position to compare the proposed model to the real data finding good agreement. Second, we investigate the entropy of temporal networks and growing networks , to provide a new framework to quantify the information encoded in these networks and to answer a fundamental problem in network science: how complex are temporal and growing networks. Finally, we consider two examples of critical phenomena in interacting networks. In particular, on one side we investigate the percolation of interacting networks by introducing antagonistic interactions. On the other side, we investigate a model of political election based on the percolation of antagonistic networks. The aim of this research is to show how antagonistic interactions change the physics of critical phenomena on interacting networks. We believe that the work presented in these thesis offers the possibility to appreciate the large variability of problems that can be addressed in the new framework of temporal and interacting networks.
Motif structure and cooperation in real-world complex networks
NASA Astrophysics Data System (ADS)
Salehi, Mostafa; Rabiee, Hamid R.; Jalili, Mahdi
2010-12-01
Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs’ cooperation properties and their abundance in a number of real-world networks including yeast protein-protein interaction, human brain, protein structure, email communication, dolphins’ social interaction, Zachary karate club and Net-science coauthorship networks. First, the amount of cooperativity for all possible undirected subgraphs with three to six nodes is calculated. To this end, the evolutionary dynamics of the Prisoner’s Dilemma game is considered and the cooperativity of each subgraph is calculated as the percentage of cooperating agents at the end of the simulation time. Then, the three- to six-node motifs are extracted for each network. The significance of the abundance of a motif, represented by a Z-value, is obtained by comparing them with some properly randomized versions of the original network. We found that there is always a group of motifs showing a significant inverse correlation between their cooperativity amount and Z-value, i.e. the more the Z-value the less the amount of cooperativity. This suggests that networks composed of well-structured units do not have good cooperativity properties.
NASA Astrophysics Data System (ADS)
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.
The Correlation Fractal Dimension of Complex Networks
NASA Astrophysics Data System (ADS)
Wang, Xingyuan; Liu, Zhenzhen; Wang, Mogei
2013-05-01
The fractality of complex networks is studied by estimating the correlation dimensions of the networks. Comparing with the previous algorithms of estimating the box dimension, our algorithm achieves a significant reduction in time complexity. For four benchmark cases tested, that is, the Escherichia coli (E. Coli) metabolic network, the Homo sapiens protein interaction network (H. Sapiens PIN), the Saccharomyces cerevisiae protein interaction network (S. Cerevisiae PIN) and the World Wide Web (WWW), experiments are provided to demonstrate the validity of our algorithm.
Breakdown of interdependent directed networks.
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.
Characterizing Mobility and Contact Networks in Virtual Worlds
NASA Astrophysics Data System (ADS)
Machado, Felipe; Santos, Matheus; Almeida, Virgílio; Guedes, Dorgival
Virtual worlds have recently gained wide recognition as an important field of study in Computer Science. In this work we present an analysis of the mobility and interactions among characters in World of Warcraft (WoW) and Second Life based on the contact opportunities extracted from actual user data in each of those domains. We analyze character contacts in terms of their spatial and temporal characteristics, as well as the social network derived from such contacts. Our results show that the contacts observed may be more influenced by the nature of the interactions and goals of the users in each situation than by the intrinsic structure of such worlds. In particular, observations from a city in WoW are closer to those of Second Life than to other areas in WoW itself.
Coevolution of game and network structure with adjustable linking
NASA Astrophysics Data System (ADS)
Qin, Shao-Meng; Zhang, Guo-Yong; Chen, Yong
2009-12-01
Most papers about the evolutionary game on graph assume the statistic network structure. However, in the real world, social interaction could change the relationship among people. And the change of social structure will also affect people’s strategies. We build a coevolution model of prisoner’s dilemma game and network structure to study the dynamic interaction in the real world. Differing from other coevolution models, players rewire their network connections according to the density of cooperation and other players’ payoffs. We use a parameter α to control the effect of payoff in the process of rewiring. Based on the asynchronous update rule and Monte Carlo simulation, we find that, when players prefer to rewire their links to those who are richer, the temptation can increase the cooperation density.
Understanding and Designing for Interactional Privacy Needs within Social Networking Sites
ERIC Educational Resources Information Center
Wisniewski, Pamela J.
2012-01-01
"Interpersonal boundary regulation" is a way to optimize social interactions when sharing and connecting through Social Networking Sites (SNSs). The theoretical foundation of much of my research comes from Altman's work on privacy management in the physical world. Altman believed that "we should attempt to design responsive…
Effect of interaction strength on robustness of controlling edge dynamics in complex networks
NASA Astrophysics Data System (ADS)
Pang, Shao-Peng; Hao, Fei
2018-05-01
Robustness plays a critical role in the controllability of complex networks to withstand failures and perturbations. Recent advances in the edge controllability show that the interaction strength among edges plays a more important role than network structure. Therefore, we focus on the effect of interaction strength on the robustness of edge controllability. Using three categories of all edges to quantify the robustness, we develop a universal framework to evaluate and analyze the robustness in complex networks with arbitrary structures and interaction strengths. Applying our framework to a large number of model and real-world networks, we find that the interaction strength is a dominant factor for the robustness in undirected networks. Meanwhile, the strongest robustness and the optimal edge controllability in undirected networks can be achieved simultaneously. Different from the case of undirected networks, the robustness in directed networks is determined jointly by the interaction strength and the network's degree distribution. Moreover, a stronger robustness is usually associated with a larger number of driver nodes required to maintain full control in directed networks. This prompts us to provide an optimization method by adjusting the interaction strength to optimize the robustness of edge controllability.
A game-theoretic approach to optimize ad hoc networks inspired by small-world network topology
NASA Astrophysics Data System (ADS)
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.
Interactive Display of High-Resolution Images on the World Wide Web.
ERIC Educational Resources Information Center
Clyde, Stephen W.; Hirschi, Gregory W.
Viewing high-resolution images on the World Wide Web at a level of detail necessary for collaborative research is still a problem today, given the Internet's current bandwidth limitations and its ever increasing network traffic. ImageEyes is an interactive display tool being developed at Utah State University that addresses this problem by…
NASA Astrophysics Data System (ADS)
Frahm, Klaus M.; El Zant, Samer; Jaffrès-Runser, Katia; Shepelyansky, Dima L.
2017-09-01
Geopolitics focuses on political power in relation to geographic space. Interactions among world countries have been widely studied at various scales, observing economic exchanges, world history or international politics among others. This work exhibits the potential of Wikipedia mining for such studies. Indeed, Wikipedia stores valuable fine-grained dependencies among countries by linking webpages together for diverse types of interactions (not only related to economical, political or historical facts). We mine herein the Wikipedia networks of several language editions using the recently proposed method of reduced Google matrix analysis. This approach allows to establish direct and hidden links between a subset of nodes that belong to a much larger directed network. Our study concentrates on 40 major countries chosen worldwide. Our aim is to offer a multicultural perspective on their interactions by comparing networks extracted from five different Wikipedia language editions, emphasizing English, Russian and Arabic ones. We demonstrate that this approach allows to recover meaningful direct and hidden links among the 40 countries of interest.
Gotts, Nicholas M
2009-01-01
Small patterns of state 1 cells on an infinite, otherwise empty array of Conway's game of Life can produce sets of growing structures resembling in significant ways a population of spatially situated individuals in a nonuniform, highly structured environment. Ramifying feedback networks and cross-scale interactions play a central role in the emergence and subsequent dynamics of the quasi population. The implications are discussed: It is proposed that analogous networks and interactions may have been precursors to natural selection in the real world.
Spatio-temporal networks: reachability, centrality and robustness.
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.
ERIC Educational Resources Information Center
Cohen, Moshe; And Others
Electronic networks provide new opportunities to create functional learning environments which allow students in many different locations to carry out joint educational activities. A set of participant observation studies was conducted in the context of a cross-cultural, cross-language network called the Intercultural Learning Network in order to…
Emergent Complexity in Conway's Game of Life
NASA Astrophysics Data System (ADS)
Gotts, Nick
It is shown that both small, finite patterns and random infinite very low density ("sparse") arrays of the Game of Life can produce emergent structures and processes of great complexity, through ramifying feedback networks and cross-scale interactions. The implications are discussed: it is proposed that analogous networks and interactions may have been precursors to natural selection in the real world.
Real beards and real networks: a spin-glass model for interacting individuals
NASA Astrophysics Data System (ADS)
O'Neale, Dion
''I want to be different, just like all the other different people'' sang the band King Missile. Whether they are the Beatniks of the 1950s, the punks of the 1970s, or the hipsters of today, non-conformists often tend to look the same, seemingly at odds with their goal of non-conformity. The spin-glass model, originally developed to describe the interaction of magnetic spins, and since applied to situations as diverse as the electrical activity of networks of neurons, to trades on a financial market, has recently been used in social science to study populations of interacting individuals comprised of a mix of both conformists and anti-conformists - or hipsters. Including delay effects for the interactions between individuals has been shown to give a system with non-trivial dynamics with a phase transition from stable behaviour to periodic switching between two states (let's call them bushy bearded and clean shaven). Analytic solutions to such a model are possible, but only for particular assumptions about the interaction and delay matrices. In this work we will show what happens when the interactions in the model are based on real-world networks with ''small-world'' effects and clustering.
Structural controllability of unidirectional bipartite networks
NASA Astrophysics Data System (ADS)
Nacher, Jose C.; Akutsu, Tatsuya
2013-04-01
The interactions between fundamental life molecules, people and social organisations build complex architectures that often result in undesired behaviours. Despite all of the advances made in our understanding of network structures over the past decade, similar progress has not been achieved in the controllability of real-world networks. In particular, an analytical framework to address the controllability of bipartite networks is still absent. Here, we present a dominating set (DS)-based approach to bipartite network controllability that identifies the topologies that are relatively easy to control with the minimum number of driver nodes. Our theoretical calculations, assisted by computer simulations and an evaluation of real-world networks offer a promising framework to control unidirectional bipartite networks. Our analysis should open a new approach to reverting the undesired behaviours in unidirectional bipartite networks at will.
Epidemic spread on interconnected metapopulation networks
NASA Astrophysics Data System (ADS)
Wang, Bing; Tanaka, Gouhei; Suzuki, Hideyuki; Aihara, Kazuyuki
2014-09-01
Numerous real-world networks have been observed to interact with each other, resulting in interconnected networks that exhibit diverse, nontrivial behavior with dynamical processes. Here we investigate epidemic spreading on interconnected networks at the level of metapopulation. Through a mean-field approximation for a metapopulation model, we find that both the interaction network topology and the mobility probabilities between subnetworks jointly influence the epidemic spread. Depending on the interaction between subnetworks, proper controls of mobility can efficiently mitigate epidemics, whereas an extremely biased mobility to one subnetwork will typically cause a severe outbreak and promote the epidemic spreading. Our analysis provides a basic framework for better understanding of epidemic behavior in related transportation systems as well as for better control of epidemics by guiding human mobility patterns.
Motif formation and industry specific topologies in the Japanese business firm network
NASA Astrophysics Data System (ADS)
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.
Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions
NASA Astrophysics Data System (ADS)
Bick, Christian; Sebek, Michael; Kiss, István Z.
2017-10-01
We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.
Nonequilibrium transitions in complex networks: A model of social interaction
NASA Astrophysics Data System (ADS)
Klemm, Konstantin; Eguíluz, Víctor M.; Toral, Raúl; San Miguel, Maxi
2003-02-01
We analyze the nonequilibrium order-disorder transition of Axelrod’s model of social interaction in several complex networks. In a small-world network, we find a transition between an ordered homogeneous state and a disordered state. The transition point is shifted by the degree of spatial disorder of the underlying network, the network disorder favoring ordered configurations. In random scale-free networks the transition is only observed for finite size systems, showing system size scaling, while in the thermodynamic limit only ordered configurations are always obtained. Thus, in the thermodynamic limit the transition disappears. However, in structured scale-free networks, the phase transition between an ordered and a disordered phase is restored.
Applications of Temporal Graph Metrics to Real-World Networks
NASA Astrophysics Data System (ADS)
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.
Son, Seokshin; Kang, Ah Reum; Kim, Hyun-chul; Kwon, Taekyoung; Park, Juyong; Kim, Huy Kang
2012-01-01
Rapid advances in modern computing and information technology have enabled millions of people to interact online via various social network and gaming services. The widespread adoption of such online services have made possible analysis of large-scale archival data containing detailed human interactions, presenting a very promising opportunity to understand the rich and complex human behavior. In collaboration with a leading global provider of Massively Multiplayer Online Role-Playing Games (MMORPGs), here we present a network science-based analysis of the interplay between distinct types of user interaction networks in the virtual world. We find that their properties depend critically on the nature of the context-interdependence of the interactions, highlighting the complex and multilayered nature of human interactions, a robust understanding of which we believe may prove instrumental in the designing of more realistic future virtual arenas as well as provide novel insights to the science of collective human behavior.
Network structure, topology, and dynamics in generalized models of synchronization
NASA Astrophysics Data System (ADS)
Lerman, Kristina; Ghosh, Rumi
2012-08-01
Network structure is a product of both its topology and interactions between its nodes. We explore this claim using the paradigm of distributed synchronization in a network of coupled oscillators. As the network evolves to a global steady state, nodes synchronize in stages, revealing the network's underlying community structure. Traditional models of synchronization assume that interactions between nodes are mediated by a conservative process similar to diffusion. However, social and biological processes are often nonconservative. We propose a model of synchronization in a network of oscillators coupled via nonconservative processes. We study the dynamics of synchronization of a synthetic and real-world networks and show that the traditional and nonconservative models of synchronization reveal different structures within the same network.
Dynamic phenomena and human activity in an artificial society
NASA Astrophysics Data System (ADS)
Grabowski, A.; Kruszewska, N.; Kosiński, R. A.
2008-12-01
We study dynamic phenomena in a large social network of nearly 3×104 individuals who interact in the large virtual world of a massive multiplayer online role playing game. On the basis of a database received from the online game server, we examine the structure of the friendship network and human dynamics. To investigate the relation between networks of acquaintances in virtual and real worlds, we carried out a survey among the players. We show that, even though the virtual network did not develop as a growing graph of an underlying network of social acquaintances in the real world, it influences it. Furthermore we find very interesting scaling laws concerning human dynamics. Our research shows how long people are interested in a single task and how much time they devote to it. Surprisingly, exponent values in both cases are close to -1 . We calculate the activity of individuals, i.e., the relative time daily devoted to interactions with others in the artificial society. Our research shows that the distribution of activity is not uniform and is highly correlated with the degree of the node, and that such human activity has a significant influence on dynamic phenomena, e.g., epidemic spreading and rumor propagation, in complex networks. We find that spreading is accelerated (an epidemic) or decelerated (a rumor) as a result of superspreaders’ various behavior.
Revealing the hidden language of complex networks.
Yaveroğlu, Ömer Nebil; Malod-Dognin, Noël; Davis, Darren; Levnajic, Zoran; Janjic, Vuk; Karapandza, Rasa; Stojmirovic, Aleksandar; Pržulj, Nataša
2014-04-01
Sophisticated methods for analysing complex networks promise to be of great benefit to almost all scientific disciplines, yet they elude us. In this work, we make fundamental methodological advances to rectify this. We discover that the interaction between a small number of roles, played by nodes in a network, can characterize a network's structure and also provide a clear real-world interpretation. Given this insight, we develop a framework for analysing and comparing networks, which outperforms all existing ones. We demonstrate its strength by uncovering novel relationships between seemingly unrelated networks, such as Facebook, metabolic, and protein structure networks. We also use it to track the dynamics of the world trade network, showing that a country's role of a broker between non-trading countries indicates economic prosperity, whereas peripheral roles are associated with poverty. This result, though intuitive, has escaped all existing frameworks. Finally, our approach translates network topology into everyday language, bringing network analysis closer to domain scientists.
A multilayer network dataset of interaction and influence spreading in a virtual world
NASA Astrophysics Data System (ADS)
Jankowski, Jarosław; Michalski, Radosław; Bródka, Piotr
2017-10-01
Presented data contains the record of five spreading campaigns that occurred in a virtual world platform. Users distributed avatars between each other during the campaigns. The processes varied in time and range and were either incentivized or not incentivized. Campaign data is accompanied by events. The data can be used to build a multilayer network to place the campaigns in a wider context. To the best of the authors' knowledge, the study is the first publicly available dataset containing a complete real multilayer social network together, along with five complete spreading processes in it.
Directionality of real world networks as predicted by path length in directed and undirected graphs
NASA Astrophysics Data System (ADS)
Rosen, Yonatan; Louzoun, Yoram
2014-05-01
Many real world networks either support ordered processes, or are actually representations of such processes. However, the same networks contain large strong connectivity components and long circles, which hide a possible inherent order, since each vertex can be reached from each vertex in a directed path. Thus, the presence of an inherent directionality in networks may be hidden. We here discuss a possible definition of such a directionality and propose a method to detect it. Several common algorithms, such as the betweenness centrality or the degree, measure various aspects of centrality in networks. However, they do not address directly the issue of inherent directionality. The goal of the algorithm discussed here is the detection of global directionality in directed networks. Such an algorithm is essential to detangle complex networks into ordered process. We show that indeed the vast majority of measured real world networks have a clear directionality. Moreover, this directionality can be used to classify vertices in these networks from sources to sinks. Such an algorithm can be highly useful in order to extract a meaning from large interaction networks assembled in many domains.
Interweaving interactions in virtual worlds: a case study.
Cantamesse, Matteo; Galimberti, Carlo; Giacoma, Gianandrea
2011-01-01
The aim of this study was to examine the effect of playing the online game World of Warcraft (WoW), both on adolescent's (effective) social interaction and on the competence they developed on it. Social interactions within the game environment have been investigated by integrating qualitative and quantitative methods: conversation analysis and social network analysis (SNA). From a psychosocial point of view, the in-game interactions, and in particular conversational exchanges, turn out to be a collaborative path of the joint definition of identities and social ties, with reflection on in-game processes and out-game relationship.
Measuring and modeling correlations in multiplex networks.
Nicosia, Vincenzo; Latora, Vito
2015-09-01
The interactions among the elementary components of many complex systems can be qualitatively different. Such systems are therefore naturally described in terms of multiplex or multilayer networks, i.e., networks where each layer stands for a different type of interaction between the same set of nodes. There is today a growing interest in understanding when and why a description in terms of a multiplex network is necessary and more informative than a single-layer projection. Here we contribute to this debate by presenting a comprehensive study of correlations in multiplex networks. Correlations in node properties, especially degree-degree correlations, have been thoroughly studied in single-layer networks. Here we extend this idea to investigate and characterize correlations between the different layers of a multiplex network. Such correlations are intrinsically multiplex, and we first study them empirically by constructing and analyzing several multiplex networks from the real world. In particular, we introduce various measures to characterize correlations in the activity of the nodes and in their degree at the different layers and between activities and degrees. We show that real-world networks exhibit indeed nontrivial multiplex correlations. For instance, we find cases where two layers of the same multiplex network are positively correlated in terms of node degrees, while other two layers are negatively correlated. We then focus on constructing synthetic multiplex networks, proposing a series of models to reproduce the correlations observed empirically and/or to assess their relevance.
Asymptotic theory of time varying networks with burstiness and heterogeneous activation patterns
NASA Astrophysics Data System (ADS)
Burioni, Raffaella; Ubaldi, Enrico; Vezzani, Alessandro
2017-05-01
The recent availability of large-scale, time-resolved and high quality digital datasets has allowed for a deeper understanding of the structure and properties of many real-world networks. The empirical evidence of a temporal dimension prompted the switch of paradigm from a static representation of networks to a time varying one. In this work we briefly review the framework of time-varying-networks in real world social systems, especially focusing on the activity-driven paradigm. We develop a framework that allows for the encoding of three generative mechanisms that seem to play a central role in the social networks’ evolution: the individual’s propensity to engage in social interactions, its strategy in allocate these interactions among its alters and the burstiness of interactions amongst social actors. The functional forms and probability distributions encoding these mechanisms are typically data driven. A natural question arises if different classes of strategies and burstiness distributions, with different local scale behavior and analogous asymptotics can lead to the same long time and large scale structure of the evolving networks. We consider the problem in its full generality, by investigating and solving the system dynamics in the asymptotic limit, for general classes of ties allocation mechanisms and waiting time probability distributions. We show that the asymptotic network evolution is driven by a few characteristics of these functional forms, that can be extracted from direct measurements on large datasets.
The Role of Temporal Trends in Growing Networks
Ruppin, Eytan; Shavitt, Yuval
2016-01-01
The rich get richer principle, manifested by the Preferential attachment (PA) mechanism, is widely considered one of the major factors in the growth of real-world networks. PA stipulates that popular nodes are bound to be more attractive than less popular nodes; for example, highly cited papers are more likely to garner further citations. However, it overlooks the transient nature of popularity, which is often governed by trends. Here, we show that in a wide range of real-world networks the recent popularity of a node, i.e., the extent by which it accumulated links recently, significantly influences its attractiveness and ability to accumulate further links. We proceed to model this observation with a natural extension to PA, named Trending Preferential Attachment (TPA), in which edges become less influential as they age. TPA quantitatively parametrizes a fundamental network property, namely the network’s tendency to trends. Through TPA, we find that real-world networks tend to be moderately to highly trendy. Networks are characterized by different susceptibilities to trends, which determine their structure to a large extent. Trendy networks display complex structural traits, such as modular community structure and degree-assortativity, occurring regularly in real-world networks. In summary, this work addresses an inherent trait of complex networks, which greatly affects their growth and structure, and develops a unified model to address its interaction with preferential attachment. PMID:27486847
Optimal convergence in naming game with geography-based negotiation on small-world networks
NASA Astrophysics Data System (ADS)
Liu, Run-Ran; Wang, Wen-Xu; Lai, Ying-Cheng; Chen, Guanrong; Wang, Bing-Hong
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.
SPACEWAY: Providing affordable and versatile communication solutions
NASA Astrophysics Data System (ADS)
Fitzpatrick, E. J.
1995-08-01
By the end of this decade, Hughes' SPACEWAY network will provide the first interactive 'bandwidth on demand' communication services for a variety of applications. High quality digital voice, interactive video, global access to multimedia databases, and transborder workgroup computing will make SPACEWAY an essential component of the computer-based workplace of the 21st century. With relatively few satellites to construct, insure, and launch -- plus extensive use of cost-effective, tightly focused spot beams on the world's most populated areas -- the high capacity SPACEWAY system can pass its significant cost savings onto its customers. The SPACEWAY network is different from other proposed global networks in that its geostationary orbit location makes it a truly market driven system: each satellite will make available extensive telecom services to hundreds of millions of people within the continuous view of that satellite, providing immediate capacity within a specific region of the world.
SPACEWAY: Providing affordable and versatile communication solutions
NASA Technical Reports Server (NTRS)
Fitzpatrick, E. J.
1995-01-01
By the end of this decade, Hughes' SPACEWAY network will provide the first interactive 'bandwidth on demand' communication services for a variety of applications. High quality digital voice, interactive video, global access to multimedia databases, and transborder workgroup computing will make SPACEWAY an essential component of the computer-based workplace of the 21st century. With relatively few satellites to construct, insure, and launch -- plus extensive use of cost-effective, tightly focused spot beams on the world's most populated areas -- the high capacity SPACEWAY system can pass its significant cost savings onto its customers. The SPACEWAY network is different from other proposed global networks in that its geostationary orbit location makes it a truly market driven system: each satellite will make available extensive telecom services to hundreds of millions of people within the continuous view of that satellite, providing immediate capacity within a specific region of the world.
Stream On: Video Servers in the Real World.
ERIC Educational Resources Information Center
Tristram, Claire
1995-01-01
Despite plans for corporate training networks, digital ad-insertion systems, hotel video-on-demand, and interactive television, only small scale video networks presently work. Four case studies examine the design and implementation decisions for different markets: corporate; advertising; hotel; and commercial video via cable, satellite or…
Son, Seokshin; Kang, Ah Reum; Kim, Hyun-chul; Kwon, Taekyoung; Park, Juyong; Kim, Huy Kang
2012-01-01
Rapid advances in modern computing and information technology have enabled millions of people to interact online via various social network and gaming services. The widespread adoption of such online services have made possible analysis of large-scale archival data containing detailed human interactions, presenting a very promising opportunity to understand the rich and complex human behavior. In collaboration with a leading global provider of Massively Multiplayer Online Role-Playing Games (MMORPGs), here we present a network science-based analysis of the interplay between distinct types of user interaction networks in the virtual world. We find that their properties depend critically on the nature of the context-interdependence of the interactions, highlighting the complex and multilayered nature of human interactions, a robust understanding of which we believe may prove instrumental in the designing of more realistic future virtual arenas as well as provide novel insights to the science of collective human behavior. PMID:22496771
Consumers don’t play dice, influence of social networks and advertisements
NASA Astrophysics Data System (ADS)
Groot, Robert D.
2006-05-01
Empirical data of supermarket sales show stylised facts that are similar to stock markets, with a broad (truncated) Lévy distribution of weekly sales differences in the baseline sales [R.D. Groot, Physica A 353 (2005) 501]. To investigate the cause of this, the influence of social interactions and advertisements are studied in an agent-based model of consumers in a social network. The influence of network topology was varied by using a small-world network, a random network and a Barabási-Albert network. The degree to which consumers value the opinion of their peers was also varied. On a small-world and random network we find a phase transition between an open market and a locked-in market that is similar to condensation in liquids. At the critical point, fluctuations become large and buying behaviour is strongly correlated. However, on the small world network the noise distribution at the critical point is Gaussian, and critical slowing down occurs which is not observed in supermarket sales. On a scale-free network, the model shows a transition between a gas-like phase and a glassy state, but at the transition point the noise amplitude is much larger than what is seen in supermarket sales. To explore the role of advertisements, a model is studied where imprints are placed on the minds of consumers that ripen when a decision for a product is made. The correct distribution of weekly sales returns follows naturally from this model, as well as the noise amplitude, the correlation time and cross-correlation of sales fluctuations. For particular parameter values, simulated sales correlation shows power-law decay in time. The model predicts that social interaction helps to prevent aversion, and that products are viewed more positively when their consumption rate is higher.
A small-world network model of facial emotion recognition.
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.
Epidemic spreading on complex networks with overlapping and non-overlapping community structure
NASA Astrophysics Data System (ADS)
Shang, Jiaxing; Liu, Lianchen; Li, Xin; Xie, Feng; Wu, Cheng
2015-02-01
Many real-world networks exhibit community structure where vertices belong to one or more communities. Recent studies show that community structure plays an import role in epidemic spreading. In this paper, we investigate how the extent of overlap among communities affects epidemics. In order to experiment on the characteristic of overlapping communities, we propose a rewiring algorithm that can change the community structure from overlapping to non-overlapping while maintaining the degree distribution of the network. We simulate the Susceptible-Infected-Susceptible (SIS) epidemic process on synthetic scale-free networks and real-world networks by applying our rewiring algorithm. Experiments show that epidemics spread faster on networks with higher level of overlapping communities. Furthermore, overlapping communities' effect interacts with the average degree's effect. Our work further illustrates the important role of overlapping communities in the process of epidemic spreading.
How Relations are Built within a SNS World -- Social Network Analysis on Mixi --
NASA Astrophysics Data System (ADS)
Matsuo, Yutaka; Yasud, Yuki
Our purpose here is to (1) investigate the structure of the personal networks developed on mixi, a Japanese social networking service (SNS), and (2) to consider the governing mechanism which guides participants of a SNS to form an aggregate network. Our findings are as follows:the clustering coefficient of the network is as high as 0.33 while the characteristic path lenght is as low as 5.5. A network among central users (over 300 edges) consist of two cliques, which seems to be very fragile. Community-affiliation network suggests there are several easy-entry communities which later lead users to more high-entry, unique-theme communities. The analysis on connectedness within a community reveals the importance of real-world interaction. Lastly, we depict a probable image of the entire ecology on {\\\\em mixi} among users and communities, which contributes broadly to social systems on the Web.
Unraveling spurious properties of interaction networks with tailored random networks.
Bialonski, Stephan; Wendler, Martin; Lehnertz, Klaus
2011-01-01
We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures--known for their complex spatial and temporal dynamics--we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis.
Unraveling Spurious Properties of Interaction Networks with Tailored Random Networks
Bialonski, Stephan; Wendler, Martin; Lehnertz, Klaus
2011-01-01
We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures – known for their complex spatial and temporal dynamics – we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis. PMID:21850239
Revealing the Hidden Language of Complex Networks
Yaveroğlu, Ömer Nebil; Malod-Dognin, Noël; Davis, Darren; Levnajic, Zoran; Janjic, Vuk; Karapandza, Rasa; Stojmirovic, Aleksandar; Pržulj, Nataša
2014-01-01
Sophisticated methods for analysing complex networks promise to be of great benefit to almost all scientific disciplines, yet they elude us. In this work, we make fundamental methodological advances to rectify this. We discover that the interaction between a small number of roles, played by nodes in a network, can characterize a network's structure and also provide a clear real-world interpretation. Given this insight, we develop a framework for analysing and comparing networks, which outperforms all existing ones. We demonstrate its strength by uncovering novel relationships between seemingly unrelated networks, such as Facebook, metabolic, and protein structure networks. We also use it to track the dynamics of the world trade network, showing that a country's role of a broker between non-trading countries indicates economic prosperity, whereas peripheral roles are associated with poverty. This result, though intuitive, has escaped all existing frameworks. Finally, our approach translates network topology into everyday language, bringing network analysis closer to domain scientists. PMID:24686408
IAU Public Astronomical Organisations Network
NASA Astrophysics Data System (ADS)
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.
Social patterns revealed through random matrix theory
NASA Astrophysics Data System (ADS)
Sarkar, Camellia; Jalan, Sarika
2014-11-01
Despite the tremendous advancements in the field of network theory, very few studies have taken weights in the interactions into consideration that emerge naturally in all real-world systems. Using random matrix analysis of a weighted social network, we demonstrate the profound impact of weights in interactions on emerging structural properties. The analysis reveals that randomness existing in particular time frame affects the decisions of individuals rendering them more freedom of choice in situations of financial security. While the structural organization of networks remains the same throughout all datasets, random matrix theory provides insight into the interaction pattern of individuals of the society in situations of crisis. It has also been contemplated that individual accountability in terms of weighted interactions remains as a key to success unless segregation of tasks comes into play.
Analysis and Visualization of Internet QA Bulletin Boards Represented as Heterogeneous Networks
NASA Astrophysics Data System (ADS)
Murata, Tsuyoshi; Ikeya, Tomoyuki
Visualizing and analyzing social interactions of CGM (Consumer Generated Media) are important for understanding overall activities on the internet. Social interactions are often represented as simple networks that are composed of homogeneous nodes and edges between them. However, related entities in real world are often not homogeneous. Such relations are naturally represented as heterogeneous networks composed of more than one kind of nodes and edges connecting them. In the case of CGM, for example, users and their contents constitute nodes of heterogeneous networks. There are related users (user communities) and related contents (contents communities) in the heterogeneous networks. Discovering both communities and finding correspondence among them will clarify the characteristics of the communites. This paper describes an attempt for visualizing and analyzing social interactions of Yahoo! Chiebukuro (Japanese Yahoo! Answers). New criteria for measuring correspondence between user communities and board communites are defined, and characteristics of both communities are analyzed using the criteria.
Data reliability in complex directed networks
NASA Astrophysics Data System (ADS)
Sanz, Joaquín; Cozzo, Emanuele; Moreno, Yamir
2013-12-01
The availability of data from many different sources and fields of science has made it possible to map out an increasing number of networks of contacts and interactions. However, quantifying how reliable these data are remains an open problem. From Biology to Sociology and Economics, the identification of false and missing positives has become a problem that calls for a solution. In this work we extend one of the newest, best performing models—due to Guimerá and Sales-Pardo in 2009—to directed networks. The new methodology is able to identify missing and spurious directed interactions with more precision than previous approaches, which renders it particularly useful for analyzing data reliability in systems like trophic webs, gene regulatory networks, communication patterns and several social systems. We also show, using real-world networks, how the method can be employed to help search for new interactions in an efficient way.
Social network analysis of character interaction in the Stargate and Star Trek television series
NASA Astrophysics Data System (ADS)
Tan, Melody Shi Ai; Ujum, Ephrance Abu; Ratnavelu, Kuru
This paper undertakes a social network analysis of two science fiction television series, Stargate and Star Trek. Television series convey stories in the form of character interaction, which can be represented as “character networks”. We connect each pair of characters that exchanged spoken dialogue in any given scene demarcated in the television series transcripts. These networks are then used to characterize the overall structure and topology of each series. We find that the character networks of both series have similar structure and topology to that found in previous work on mythological and fictional networks. The character networks exhibit the small-world effects but found no significant support for power-law. Since the progression of an episode depends to a large extent on the interaction between each of its characters, the underlying network structure tells us something about the complexity of that episode’s storyline. We assessed the complexity using techniques from spectral graph theory. We found that the episode networks are structured either as (1) closed networks, (2) those containing bottlenecks that connect otherwise disconnected clusters or (3) a mixture of both.
A Survey of Recent Advances in Optical and Multimedia Information Technologies.
ERIC Educational Resources Information Center
Jessop, Deborah
1997-01-01
Examines developments in multimedia technologies and in the World Wide Web. Discusses CD-recordable, CD-rewritable, cable modems, personal digital assistants, digital video discs, interactivity and virtual worlds, advertising on the Web, and Intranets and CD-ROM networks. Eight tables and figures show costs, download time, estimated sales, storage…
ERIC Educational Resources Information Center
Karalar, Halit; Dogan, Ugur
2017-01-01
FATIH Project carried out by the Turkish government is one of the comprehensive technology integration project in the World. With this project, interactive boards, tablets and multifunctional printers have been distributed to schools and Internet infrastructure of schools improved. EIN (Educational Informatics Network) platform, known as EBA…
Integrating Social Networking Tools into ESL Writing Classroom: Strengths and Weaknesses
ERIC Educational Resources Information Center
Yunus, Melor Md; Salehi, Hadi; Chenzi, Chen
2012-01-01
With the rapid development of world and technology, English learning has become more important. Teachers frequently use teacher-centered pedagogy that leads to lack of interaction with students. This paper aims to investigate the advantages and disadvantages of integrating social networking tools into ESL writing classroom and discuss the ways to…
Inferring general relations between network characteristics from specific network ensembles.
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.
Teaching Ethical Know-How in New Literary Spaces
ERIC Educational Resources Information Center
Luce-Kapler, Rebecca; Sumara, Dennis; Iftody, Tammy
2010-01-01
The proliferation of digital media and social networking software highlighted the need for scholars to identify what has been coined "New Literacies". This thinking recognizes that being literate in a digitized world means navigating and interpreting multiple contexts and complex interactions of identification as people communicate, interact, and…
Analysis of world terror networks from the reduced Google matrix of Wikipedia
NASA Astrophysics Data System (ADS)
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.
The scientific research potential of virtual worlds.
Bainbridge, William Sims
2007-07-27
Online virtual worlds, electronic environments where people can work and interact in a somewhat realistic manner, have great potential as sites for research in the social, behavioral, and economic sciences, as well as in human-centered computer science. This article uses Second Life and World of Warcraft as two very different examples of current virtual worlds that foreshadow future developments, introducing a number of research methodologies that scientists are now exploring, including formal experimentation, observational ethnography, and quantitative analysis of economic markets or social networks.
Prediction and functional analysis of the sweet orange protein-protein interaction network.
Ding, Yu-Duan; Chang, Ji-Wei; Guo, Jing; Chen, Dijun; Li, Sen; Xu, Qiang; Deng, Xiu-Xin; Cheng, Yun-Jiang; Chen, Ling-Ling
2014-08-05
Sweet orange (Citrus sinensis) is one of the most important fruits world-wide. Because it is a woody plant with a long growth cycle, genetic studies of sweet orange are lagging behind those of other species. In this analysis, we employed ortholog identification and domain combination methods to predict the protein-protein interaction (PPI) network for sweet orange. The K-nearest neighbors (KNN) classification method was used to verify and filter the network. The final predicted PPI network, CitrusNet, contained 8,195 proteins with 124,491 interactions. The quality of CitrusNet was evaluated using gene ontology (GO) and Mapman annotations, which confirmed the reliability of the network. In addition, we calculated the expression difference of interacting genes (EDI) in CitrusNet using RNA-seq data from four sweet orange tissues, and also analyzed the EDI distribution and variation in different sub-networks. Gene expression in CitrusNet has significant modular features. Target of rapamycin (TOR) protein served as the central node of the hormone-signaling sub-network. All evidence supported the idea that TOR can integrate various hormone signals and affect plant growth. CitrusNet provides valuable resources for the study of biological functions in sweet orange.
Evolution of cooperation on complex networks with synergistic and discounted group interactions
NASA Astrophysics Data System (ADS)
Zhou, Lei; Li, Aming; Wang, Long
2015-06-01
In the real world individuals often engage in group interactions and their payoffs are determined by many factors, including the typical nonlinear interactions, i.e., synergy and discounting. Previous literatures assume that individual payoffs are either synergistically enhanced or discounted with the additional cooperators. Such settings ignore the interplay of these two factors, which is in sharp contrast with the fact that they ubiquitously coexist. Here we investigate how the coexistence and periodical switching of synergistic and discounted group interactions affect the evolution of cooperation on various complex networks. We show that scale-free networks facilitate the emergence of cooperation in terms of fixation probability for group interactions. With nonlinear interactions the heterogeneity of the degree acts as a double-edged sword: below the neutral drift it is the best for cooperation while above the neutral drift it instead provides the least opportunity for cooperators to be fixed. The advantages of the heterogeneity fade as interactive attributes switch between synergy and discounting, which suggests that the heterogeneity of population structures cannot favor cooperators in group interactions even with simple nonlinear interactions. Nonetheless, scale-free networks always guarantee cooperators the fastest rate of fixation. Our work implies that even very simple nonlinear group interactions could greatly shape the fixation probability and fixation time of cooperators in structured populations indicated by complex networks.
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
DOE Office of Scientific and Technical Information (OSTI.GOV)
Jin, R; McCallen, S; Almaas, E
2007-05-28
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of complex networks have mainly focused on their network topology. However, in many real world applications, the edges and vertices have associated attributes that are frequently represented as vertex or edge weights. Furthermore, these weights are often not static, instead changing with time and forming a time series. Hence, to fully understand the dynamics of the complex network, we have to consider both network topology and related time series data. In this work, we propose a motifmore » mining approach to identify trend motifs for such purposes. Simply stated, a trend motif describes a recurring subgraph where each of its vertices or edges displays similar dynamics over a userdefined period. Given this, each trend motif occurrence can help reveal significant events in a complex system; frequent trend motifs may aid in uncovering dynamic rules of change for the system, and the distribution of trend motifs may characterize the global dynamics of the system. Here, we have developed efficient mining algorithms to extract trend motifs. Our experimental validation using three disparate empirical datasets, ranging from the stock market, world trade, to a protein interaction network, has demonstrated the efficiency and effectiveness of our approach.« less
A Living Library: New Model for Global Electronic Interactivity and Networking in the Garden.
ERIC Educational Resources Information Center
Sherk, Bonnie
1995-01-01
Describes the Living Library, an idea to create a network of international cultural parks in different cities of the world using new communications technologies on-line in a garden setting, bringing the humanities, sciences, and social sciences to life through plants, visual and performed artworks, lectures, and computer and on-line satellite…
Assessment of Learning in Digital Interactive Social Networks: A Learning Analytics Approach
ERIC Educational Resources Information Center
Wilson, Mark; Gochyyev, Perman; Scalise, Kathleen
2016-01-01
This paper summarizes initial field-test results from data analytics used in the work of the Assessment and Teaching of 21st Century Skills (ATC21S) project, on the "ICT Literacy--Learning in digital networks" learning progression. This project, sponsored by Cisco, Intel and Microsoft, aims to help educators around the world enable…
Interaction Design and Usability of Learning Spaces in 3D Multi-user Virtual Worlds
NASA Astrophysics Data System (ADS)
Minocha, Shailey; Reeves, Ahmad John
Three-dimensional virtual worlds are multimedia, simulated environments, often managed over the Web, which users can 'inhabit' and interact via their own graphical, self-representations known as 'avatars'. 3D virtual worlds are being used in many applications: education/training, gaming, social networking, marketing and commerce. Second Life is the most widely used 3D virtual world in education. However, problems associated with usability, navigation and way finding in 3D virtual worlds may impact on student learning and engagement. Based on empirical investigations of learning spaces in Second Life, this paper presents design guidelines to improve the usability and ease of navigation in 3D spaces. Methods of data collection include semi-structured interviews with Second Life students, educators and designers. The findings have revealed that design principles from the fields of urban planning, Human- Computer Interaction, Web usability, geography and psychology can influence the design of spaces in 3D multi-user virtual environments.
Sambo, Francesco; de Oca, Marco A Montes; Di Camillo, Barbara; Toffolo, Gianna; Stützle, Thomas
2012-01-01
Reverse engineering is the problem of inferring the structure of a network of interactions between biological variables from a set of observations. In this paper, we propose an optimization algorithm, called MORE, for the reverse engineering of biological networks from time series data. The model inferred by MORE is a sparse system of nonlinear differential equations, complex enough to realistically describe the dynamics of a biological system. MORE tackles separately the discrete component of the problem, the determination of the biological network topology, and the continuous component of the problem, the strength of the interactions. This approach allows us both to enforce system sparsity, by globally constraining the number of edges, and to integrate a priori information about the structure of the underlying interaction network. Experimental results on simulated and real-world networks show that the mixed discrete/continuous optimization approach of MORE significantly outperforms standard continuous optimization and that MORE is competitive with the state of the art in terms of accuracy of the inferred networks.
Evolving Digital Ecological Networks
Wagner, Aaron P.; Ofria, Charles
2013-01-01
“It is hard to realize that the living world as we know it is just one among many possibilities” [1]. Evolving digital ecological networks are webs of interacting, self-replicating, and evolving computer programs (i.e., digital organisms) that experience the same major ecological interactions as biological organisms (e.g., competition, predation, parasitism, and mutualism). Despite being computational, these programs evolve quickly in an open-ended way, and starting from only one or two ancestral organisms, the formation of ecological networks can be observed in real-time by tracking interactions between the constantly evolving organism phenotypes. These phenotypes may be defined by combinations of logical computations (hereafter tasks) that digital organisms perform and by expressed behaviors that have evolved. The types and outcomes of interactions between phenotypes are determined by task overlap for logic-defined phenotypes and by responses to encounters in the case of behavioral phenotypes. Biologists use these evolving networks to study active and fundamental topics within evolutionary ecology (e.g., the extent to which the architecture of multispecies networks shape coevolutionary outcomes, and the processes involved). PMID:23533370
Verbal Interaction in "Second Life": Towards a Pedagogic Framework for Task Design
ERIC Educational Resources Information Center
Jauregi, Kristi; Canto, Silvia; de Graaff, Rick; Koenraad, Ton; Moonen, Machteld
2011-01-01
Within a European project on Networked Interaction in Foreign Language Acquisition and Research (NIFLAR), "Second Life" was used as a 3D virtual world in which language students can communicate synchronously with native speakers in the target language, while undertaking action together. For this context, a set of design principles for…
Visualising the Invisible: A Network Approach to Reveal the Informal Social Side of Student Learning
ERIC Educational Resources Information Center
Hommes, J.; Rienties, B.; de Grave, W.; Bos, G.; Schuwirth, L.; Scherpbier, A.
2012-01-01
World-wide, universities in health sciences have transformed their curriculum to include collaborative learning and facilitate the students' learning process. Interaction has been acknowledged to be the synergistic element in this learning context. However, students spend the majority of their time outside their classroom and interaction does not…
Generalised Sandpile Dynamics on Artificial and Real-World Directed Networks
Zachariou, Nicky; Expert, Paul; Takayasu, Misako; Christensen, Kim
2015-01-01
The main finding of this paper is a novel avalanche-size exponent τ ≈ 1.87 when the generalised sandpile dynamics evolves on the real-world Japanese inter-firm network. The topology of this network is non-layered and directed, displaying the typical bow tie structure found in real-world directed networks, with cycles and triangles. We show that one can move from a strictly layered regular lattice to a more fluid structure of the inter-firm network in a few simple steps. Relaxing the regular lattice structure by introducing an interlayer distribution for the interactions, forces the scaling exponent of the avalanche-size probability density function τ out of the two-dimensional directed sandpile universality class τ = 4/3, into the mean field universality class τ = 3/2. Numerical investigation shows that these two classes are the only that exist on the directed sandpile, regardless of the underlying topology, as long as it is strictly layered. Randomly adding a small proportion of links connecting non adjacent layers in an otherwise layered network takes the system out of the mean field regime to produce non-trivial avalanche-size probability density function. Although these do not display proper scaling, they closely reproduce the behaviour observed on the Japanese inter-firm network. PMID:26606143
Generalised Sandpile Dynamics on Artificial and Real-World Directed Networks.
Zachariou, Nicky; Expert, Paul; Takayasu, Misako; Christensen, Kim
2015-01-01
The main finding of this paper is a novel avalanche-size exponent τ ≈ 1.87 when the generalised sandpile dynamics evolves on the real-world Japanese inter-firm network. The topology of this network is non-layered and directed, displaying the typical bow tie structure found in real-world directed networks, with cycles and triangles. We show that one can move from a strictly layered regular lattice to a more fluid structure of the inter-firm network in a few simple steps. Relaxing the regular lattice structure by introducing an interlayer distribution for the interactions, forces the scaling exponent of the avalanche-size probability density function τ out of the two-dimensional directed sandpile universality class τ = 4/3, into the mean field universality class τ = 3/2. Numerical investigation shows that these two classes are the only that exist on the directed sandpile, regardless of the underlying topology, as long as it is strictly layered. Randomly adding a small proportion of links connecting non adjacent layers in an otherwise layered network takes the system out of the mean field regime to produce non-trivial avalanche-size probability density function. Although these do not display proper scaling, they closely reproduce the behaviour observed on the Japanese inter-firm network.
The new challenges of multiplex networks: Measures and models
NASA Astrophysics Data System (ADS)
Battiston, Federico; Nicosia, Vincenzo; Latora, Vito
2017-02-01
What do societies, the Internet, and the human brain have in common? They are all examples of complex relational systems, whose emerging behaviours are largely determined by the non-trivial networks of interactions among their constituents, namely individuals, computers, or neurons, rather than only by the properties of the units themselves. In the last two decades, network scientists have proposed models of increasing complexity to better understand real-world systems. Only recently we have realised that multiplexity, i.e. the coexistence of several types of interactions among the constituents of a complex system, is responsible for substantial qualitative and quantitative differences in the type and variety of behaviours that a complex system can exhibit. As a consequence, multilayer and multiplex networks have become a hot topic in complexity science. Here we provide an overview of some of the measures proposed so far to characterise the structure of multiplex networks, and a selection of models aiming at reproducing those structural properties and quantifying their statistical significance. Focusing on a subset of relevant topics, this brief review is a quite comprehensive introduction to the most basic tools for the analysis of multiplex networks observed in the real-world. The wide applicability of multiplex networks as a framework to model complex systems in different fields, from biology to social sciences, and the colloquial tone of the paper will make it an interesting read for researchers working on both theoretical and experimental analysis of networked systems.
Building a glaucoma interaction network using a text mining approach.
Soliman, Maha; Nasraoui, Olfa; Cooper, Nigel G F
2016-01-01
The volume of biomedical literature and its underlying knowledge base is rapidly expanding, making it beyond the ability of a single human being to read through all the literature. Several automated methods have been developed to help make sense of this dilemma. The present study reports on the results of a text mining approach to extract gene interactions from the data warehouse of published experimental results which are then used to benchmark an interaction network associated with glaucoma. To the best of our knowledge, there is, as yet, no glaucoma interaction network derived solely from text mining approaches. The presence of such a network could provide a useful summative knowledge base to complement other forms of clinical information related to this disease. A glaucoma corpus was constructed from PubMed Central and a text mining approach was applied to extract genes and their relations from this corpus. The extracted relations between genes were checked using reference interaction databases and classified generally as known or new relations. The extracted genes and relations were then used to construct a glaucoma interaction network. Analysis of the resulting network indicated that it bears the characteristics of a small world interaction network. Our analysis showed the presence of seven glaucoma linked genes that defined the network modularity. A web-based system for browsing and visualizing the extracted glaucoma related interaction networks is made available at http://neurogene.spd.louisville.edu/GlaucomaINViewer/Form1.aspx. This study has reported the first version of a glaucoma interaction network using a text mining approach. The power of such an approach is in its ability to cover a wide range of glaucoma related studies published over many years. Hence, a bigger picture of the disease can be established. To the best of our knowledge, this is the first glaucoma interaction network to summarize the known literature. The major findings were a set of relations that could not be found in existing interaction databases and that were found to be new, in addition to a smaller subnetwork consisting of interconnected clusters of seven glaucoma genes. Future improvements can be applied towards obtaining a better version of this network.
Multirelational organization of large-scale social networks in an online world
Szell, Michael; Lambiotte, Renaud; Thurner, Stefan
2010-01-01
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. PMID:20643965
Multirelational organization of large-scale social networks in an online world.
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.
Rationalizing Tight Ligand Binding through Cooperative Interaction Networks
2011-01-01
Small modifications of the molecular structure of a ligand sometimes cause strong gains in binding affinity to a protein target, rendering a weakly active chemical series suddenly attractive for further optimization. Our goal in this study is to better rationalize and predict the occurrence of such interaction hot-spots in receptor binding sites. To this end, we introduce two new concepts into the computational description of molecular recognition. First, we take a broader view of noncovalent interactions and describe protein–ligand binding with a comprehensive set of favorable and unfavorable contact types, including for example halogen bonding and orthogonal multipolar interactions. Second, we go beyond the commonly used pairwise additive treatment of atomic interactions and use a small world network approach to describe how interactions are modulated by their environment. This approach allows us to capture local cooperativity effects and considerably improves the performance of a newly derived empirical scoring function, ScorpionScore. More importantly, however, we demonstrate how an intuitive visualization of key intermolecular interactions, interaction networks, and binding hot-spots supports the identification and rationalization of tight ligand binding. PMID:22087588
Network reconstructions with partially available data
NASA Astrophysics Data System (ADS)
Zhang, Chaoyang; Chen, Yang; Hu, Gang
2017-06-01
Many practical systems in natural and social sciences can be described by dynamical networks. Day by day we have measured and accumulated huge amounts of data from these networks, which can be used by us to further our understanding of the world. The structures of the networks producing these data are often unknown. Consequently, understanding the structures of these networks from available data turns to be one of the central issues in interdisciplinary fields, which is called the network reconstruction problem. In this paper, we considered problems of network reconstructions using partially available data and some situations where data availabilities are not sufficient for conventional network reconstructions. Furthermore, we proposed to infer subnetwork with data of the subnetwork available only and other nodes of the entire network hidden; to depict group-group interactions in networks with averages of groups of node variables available; and to perform network reconstructions with known data of node variables only when networks are driven by both unknown internal fast-varying noises and unknown external slowly-varying signals. All these situations are expected to be common in practical systems and the methods and results may be useful for real world applications.
Design Concerns in the Engineering of Virtual Worlds for Learning
ERIC Educational Resources Information Center
Rapanotti, Lucia; Hall, Jon G.
2011-01-01
The convergence of 3D simulation and social networking into current multi-user virtual environments has opened the door to new forms of interaction for learning in order to complement the face-to-face and Web 2.0-based systems. Yet, despite a growing user community, design knowledge for virtual worlds remains patchy, particularly when it comes to…
Integrated multimedia information system on interactive CATV network
NASA Astrophysics Data System (ADS)
Lee, Meng-Huang; Chang, Shin-Hung
1998-10-01
In the current CATV system architectures, they provide one- way delivery of a common menu of entertainment to all the homes through the cable network. Through the technologies evolution, the interactive services (or two-way services) can be provided in the cable TV systems. They can supply customers with individualized programming and support real- time two-way communications. With a view to the service type changed from the one-way delivery systems to the two-way interactive systems, `on demand services' is a distinct feature of multimedia systems. In this paper, we present our work of building up an integrated multimedia system on interactive CATV network in Shih Chien University. Besides providing the traditional analog TV programming from the cable operator, we filter some channels to reserve them as our campus information channels. In addition to the analog broadcasting channel, the system also provides the interactive digital multimedia services, e.g. Video-On- Demand (VOD), Virtual Reality, BBS, World-Wide-Web, and Internet Radio Station. These two kinds of services are integrated in a CATV network by the separation of frequency allocation for the analog broadcasting service and the digital interactive services. Our ongoing work is to port our previous work of building up a VOD system conformed to DAVIC standard (for inter-operability concern) on Ethernet network into the current system.
Xu, Yungang; Guo, Maozu; Zou, Quan; Liu, Xiaoyan; Wang, Chunyu; Liu, Yang
2014-01-01
Cellular interactome, in which genes and/or their products interact on several levels, forming transcriptional regulatory-, protein interaction-, metabolic-, signal transduction networks, etc., has attracted decades of research focuses. However, such a specific type of network alone can hardly explain the various interactive activities among genes. These networks characterize different interaction relationships, implying their unique intrinsic properties and defects, and covering different slices of biological information. Functional gene network (FGN), a consolidated interaction network that models fuzzy and more generalized notion of gene-gene relations, have been proposed to combine heterogeneous networks with the goal of identifying functional modules supported by multiple interaction types. There are yet no successful precedents of FGNs on sparsely studied non-model organisms, such as soybean (Glycine max), due to the absence of sufficient heterogeneous interaction data. We present an alternative solution for inferring the FGNs of soybean (SoyFGNs), in a pioneering study on the soybean interactome, which is also applicable to other organisms. SoyFGNs exhibit the typical characteristics of biological networks: scale-free, small-world architecture and modularization. Verified by co-expression and KEGG pathways, SoyFGNs are more extensive and accurate than an orthology network derived from Arabidopsis. As a case study, network-guided disease-resistance gene discovery indicates that SoyFGNs can provide system-level studies on gene functions and interactions. This work suggests that inferring and modelling the interactome of a non-model plant are feasible. It will speed up the discovery and definition of the functions and interactions of other genes that control important functions, such as nitrogen fixation and protein or lipid synthesis. The efforts of the study are the basis of our further comprehensive studies on the soybean functional interactome at the genome and microRNome levels. Additionally, a web tool for information retrieval and analysis of SoyFGNs can be accessed at SoyFN: http://nclab.hit.edu.cn/SoyFN.
Xu, Yungang; Guo, Maozu; Zou, Quan; Liu, Xiaoyan; Wang, Chunyu; Liu, Yang
2014-01-01
Cellular interactome, in which genes and/or their products interact on several levels, forming transcriptional regulatory-, protein interaction-, metabolic-, signal transduction networks, etc., has attracted decades of research focuses. However, such a specific type of network alone can hardly explain the various interactive activities among genes. These networks characterize different interaction relationships, implying their unique intrinsic properties and defects, and covering different slices of biological information. Functional gene network (FGN), a consolidated interaction network that models fuzzy and more generalized notion of gene-gene relations, have been proposed to combine heterogeneous networks with the goal of identifying functional modules supported by multiple interaction types. There are yet no successful precedents of FGNs on sparsely studied non-model organisms, such as soybean (Glycine max), due to the absence of sufficient heterogeneous interaction data. We present an alternative solution for inferring the FGNs of soybean (SoyFGNs), in a pioneering study on the soybean interactome, which is also applicable to other organisms. SoyFGNs exhibit the typical characteristics of biological networks: scale-free, small-world architecture and modularization. Verified by co-expression and KEGG pathways, SoyFGNs are more extensive and accurate than an orthology network derived from Arabidopsis. As a case study, network-guided disease-resistance gene discovery indicates that SoyFGNs can provide system-level studies on gene functions and interactions. This work suggests that inferring and modelling the interactome of a non-model plant are feasible. It will speed up the discovery and definition of the functions and interactions of other genes that control important functions, such as nitrogen fixation and protein or lipid synthesis. The efforts of the study are the basis of our further comprehensive studies on the soybean functional interactome at the genome and microRNome levels. Additionally, a web tool for information retrieval and analysis of SoyFGNs can be accessed at SoyFN: http://nclab.hit.edu.cn/SoyFN. PMID:25423109
Scaling and percolation in the small-world network model
NASA Astrophysics Data System (ADS)
Newman, M. E. J.; Watts, D. J.
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 Padé 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.
Modeling the coevolution of topology and traffic on weighted technological networks
NASA Astrophysics Data System (ADS)
Xie, Yan-Bo; Wang, Wen-Xu; Wang, Bing-Hong
2007-02-01
For many technological networks, the network structures and the traffic taking place on them mutually interact. The demands of traffic increment spur the evolution and growth of the networks to maintain their normal and efficient functioning. In parallel, a change of the network structure leads to redistribution of the traffic. In this paper, we perform an extensive numerical and analytical study, extending results of Wang [Phys. Rev. Lett. 94, 188702 (2005)]. By introducing a general strength-coupling interaction driven by the traffic increment between any pair of vertices, our model generates networks of scale-free distributions of strength, weight, and degree. In particular, the obtained nonlinear correlation between vertex strength and degree, and the disassortative property demonstrate that the model is capable of characterizing weighted technological networks. Moreover, the generated graphs possess both dense clustering structures and an anticorrelation between vertex clustering and degree, which are widely observed in real-world networks. The corresponding theoretical predictions are well consistent with simulation results.
A high-resolution human contact network for infectious disease transmission
Salathé, Marcel; Kazandjieva, Maria; Lee, Jung Woo; Levis, Philip; Feldman, Marcus W.; Jones, James H.
2010-01-01
The most frequent infectious diseases in humans—and those with the highest potential for rapid pandemic spread—are usually transmitted via droplets during close proximity interactions (CPIs). Despite the importance of this transmission route, very little is known about the dynamic patterns of CPIs. Using wireless sensor network technology, we obtained high-resolution data of CPIs during a typical day at an American high school, permitting the reconstruction of the social network relevant for infectious disease transmission. At 94% coverage, we collected 762,868 CPIs at a maximal distance of 3 m among 788 individuals. The data revealed a high-density network with typical small-world properties and a relatively homogeneous distribution of both interaction time and interaction partners among subjects. Computer simulations of the spread of an influenza-like disease on the weighted contact graph are in good agreement with absentee data during the most recent influenza season. Analysis of targeted immunization strategies suggested that contact network data are required to design strategies that are significantly more effective than random immunization. Immunization strategies based on contact network data were most effective at high vaccination coverage. PMID:21149721
NASA Astrophysics Data System (ADS)
Liu, Quan-Hui; Wang, Wei; Cai, Shi-Min; Tang, Ming; Lai, Ying-Cheng
2018-02-01
Synergistic interactions are ubiquitous in the real world. Recent studies have revealed that, for a single-layer network, synergy can enhance spreading and even induce an explosive contagion. There is at the present a growing interest in behavior spreading dynamics on multiplex networks. What is the role of synergistic interactions in behavior spreading in such networked systems? To address this question, we articulate a synergistic behavior spreading model on a double layer network, where the key manifestation of the synergistic interactions is that the adoption of one behavior by a node in one layer enhances its probability of adopting the behavior in the other layer. A general result is that synergistic interactions can greatly enhance the spreading of the behaviors in both layers. A remarkable phenomenon is that the interactions can alter the nature of the phase transition associated with behavior adoption or spreading dynamics. In particular, depending on the transmission rate of one behavior in a network layer, synergistic interactions can lead to a discontinuous (first-order) or a continuous (second-order) transition in the adoption scope of the other behavior with respect to its transmission rate. A surprising two-stage spreading process can arise: due to synergy, nodes having adopted one behavior in one layer adopt the other behavior in the other layer and then prompt the remaining nodes in this layer to quickly adopt the behavior. Analytically, we develop an edge-based compartmental theory and perform a bifurcation analysis to fully understand, in the weak synergistic interaction regime where the dynamical correlation between the network layers is negligible, the role of the interactions in promoting the social behavioral spreading dynamics in the whole system.
Social Circles: A 3D User Interface for Facebook
NASA Astrophysics Data System (ADS)
Rodrigues, Diego; Oakley, Ian
Online social network services are increasingly popular web applications which display large amounts of rich multimedia content: contacts, status updates, photos and event information. Arguing that this quantity of information overwhelms conventional user interfaces, this paper presents Social Circles, a rich interactive visualization designed to support real world users of social network services in everyday tasks such as keeping up with friends and organizing their network. It achieves this by using 3D UIs, fluid animations and a spatial metaphor to enable direct manipulation of a social network.
NASA Astrophysics Data System (ADS)
Krawiecki, A.
A multi-agent spin model for changes of prices in the stock market based on the Ising-like cellular automaton with interactions between traders randomly varying in time is investigated by means of Monte Carlo simulations. The structure of interactions has topology of a small-world network obtained from regular two-dimensional square lattices with various coordination numbers by randomly cutting and rewiring edges. Simulations of the model on regular lattices do not yield time series of logarithmic price returns with statistical properties comparable with the empirical ones. In contrast, in the case of networks with a certain degree of randomness for a wide range of parameters the time series of the logarithmic price returns exhibit intermittent bursting typical of volatility clustering. Also the tails of distributions of returns obey a power scaling law with exponents comparable to those obtained from the empirical data.
NASA Astrophysics Data System (ADS)
Shi, Li; Wu, Lun; Chi, Guanghua; Liu, Yu
2016-10-01
Space and place are two fundamental concepts in geography. Geographical factors have long been known as drivers of many aspects of people's social networks. But whether and how space and place affect social networks differently are still unclear. The widespread use of location-aware devices provides a novel source for distinguishing the mechanisms of their impacts on social networks. Using mobile phone data, this paper explores the effects of space and place on social networks. From the perspective of space, we confirm the distance decay effect in social networks, based on a comparison between synthetic social ties generated by a null model and actual social ties derived from real-world data. From the perspective of place, we introduce several measures to evaluate interactions between individuals and inspect the trio relationship including distance, spatio-temporal co-occurrence, and social ties. We found that people's interaction is a more important factor than spatial proximity, indicating that the spatial factor has a stronger impact on social networks in place compared to that in space. Furthermore, we verify the hypothesis that interactions play an important role in strengthening friendships.
Identifying protein complexes in PPI network using non-cooperative sequential game.
Maulik, Ujjwal; Basu, Srinka; Ray, Sumanta
2017-08-21
Identifying protein complexes from protein-protein interaction (PPI) network is an important and challenging task in computational biology as it helps in better understanding of cellular mechanisms in various organisms. In this paper we propose a noncooperative sequential game based model for protein complex detection from PPI network. The key hypothesis is that protein complex formation is driven by mechanism that eventually optimizes the number of interactions within the complex leading to dense subgraph. The hypothesis is drawn from the observed network property named small world. The proposed multi-player game model translates the hypothesis into the game strategies. The Nash equilibrium of the game corresponds to a network partition where each protein either belong to a complex or form a singleton cluster. We further propose an algorithm to find the Nash equilibrium of the sequential game. The exhaustive experiment on synthetic benchmark and real life yeast networks evaluates the structural as well as biological significance of the network partitions.
Focus-based filtering + clustering technique for power-law networks with small world phenomenon
NASA Astrophysics Data System (ADS)
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.
ERIC Educational Resources Information Center
Kyei-Blankson, Lydia; Iyer, Kamakshi S.; Subramanian, Lavanya
2016-01-01
Social Networking Sites (SNSs) are web-based facilities that allow for social interaction, sharing, communication and collaboration in today's world. In the current study, patterns of use of social media among students at a public Midwestern university are examined. In addition, students were surveyed regarding concerns for privacy and trust and…
The spatial scaling of species interaction networks.
Galiana, Nuria; Lurgi, Miguel; Claramunt-López, Bernat; Fortin, Marie-Josée; Leroux, Shawn; Cazelles, Kevin; Gravel, Dominique; Montoya, José M
2018-05-01
Species-area relationships (SARs) are pivotal to understand the distribution of biodiversity across spatial scales. We know little, however, about how the network of biotic interactions in which biodiversity is embedded changes with spatial extent. Here we develop a new theoretical framework that enables us to explore how different assembly mechanisms and theoretical models affect multiple properties of ecological networks across space. We present a number of testable predictions on network-area relationships (NARs) for multi-trophic communities. Network structure changes as area increases because of the existence of different SARs across trophic levels, the preferential selection of generalist species at small spatial extents and the effect of dispersal limitation promoting beta-diversity. Developing an understanding of NARs will complement the growing body of knowledge on SARs with potential applications in conservation ecology. Specifically, combined with further empirical evidence, NARs can generate predictions of potential effects on ecological communities of habitat loss and fragmentation in a changing world.
How exotic plants integrate into pollination networks
Stouffer, Daniel B; Cirtwill, Alyssa R; Bascompte, Jordi; Bartomeus, Ignasi
2014-01-01
Summary There is increasing world-wide concern about the impact of the introduction of exotic species on ecological communities. Since many exotic plants depend on native pollinators to successfully establish, it is of paramount importance that we understand precisely how exotic species integrate into existing plant–pollinator communities. In this manuscript, we have studied a global data base of empirical pollination networks to determine whether community, network, species or interaction characteristics can help identify invaded communities. We found that a limited number of community and network properties showed significant differences across the empirical data sets – namely networks with exotic plants present are characterized by greater total, plant and pollinator richness, as well as higher values of relative nestedness. We also observed significant differences in terms of the pollinators that interact with the exotic plants. In particular, we found that specialist pollinators that are also weak contributors to community nestedness are far more likely to interact with exotic plants than would be expected by chance alone. Synthesis. By virtue of their interactions, it appears that exotic plants may provide a key service to a community's specialist pollinators as well as fill otherwise vacant ‘coevolutionary niches’. PMID:25558089
Multiscale Embedded Gene Co-expression Network Analysis
Song, Won-Min; Zhang, Bin
2015-01-01
Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma. PMID:26618778
Multiscale Embedded Gene Co-expression Network Analysis.
Song, Won-Min; Zhang, Bin
2015-11-01
Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma.
Social networks help to infer causality in the tumor microenvironment.
Crespo, Isaac; Doucey, Marie-Agnès; Xenarios, Ioannis
2016-03-15
Networks have become a popular way to conceptualize a system of interacting elements, such as electronic circuits, social communication, metabolism or gene regulation. Network inference, analysis, and modeling techniques have been developed in different areas of science and technology, such as computer science, mathematics, physics, and biology, with an active interdisciplinary exchange of concepts and approaches. However, some concepts seem to belong to a specific field without a clear transferability to other domains. At the same time, it is increasingly recognized that within some biological systems--such as the tumor microenvironment--where different types of resident and infiltrating cells interact to carry out their functions, the complexity of the system demands a theoretical framework, such as statistical inference, graph analysis and dynamical models, in order to asses and study the information derived from high-throughput experimental technologies. In this article we propose to adopt and adapt the concepts of influence and investment from the world of social network analysis to biological problems, and in particular to apply this approach to infer causality in the tumor microenvironment. We showed that constructing a bidirectional network of influence between cell and cell communication molecules allowed us to determine the direction of inferred regulations at the expression level and correctly recapitulate cause-effect relationships described in literature. This work constitutes an example of a transfer of knowledge and concepts from the world of social network analysis to biomedical research, in particular to infer network causality in biological networks. This causality elucidation is essential to model the homeostatic response of biological systems to internal and external factors, such as environmental conditions, pathogens or treatments.
Saha, Sudipto; Dazard, Jean-Eudes; Xu, Hua; Ewing, Rob M.
2013-01-01
Large-scale protein–protein interaction data sets have been generated for several species including yeast and human and have enabled the identification, quantification, and prediction of cellular molecular networks. Affinity purification-mass spectrometry (AP-MS) is the preeminent methodology for large-scale analysis of protein complexes, performed by immunopurifying a specific “bait” protein and its associated “prey” proteins. The analysis and interpretation of AP-MS data sets is, however, not straightforward. In addition, although yeast AP-MS data sets are relatively comprehensive, current human AP-MS data sets only sparsely cover the human interactome. Here we develop a framework for analysis of AP-MS data sets that addresses the issues of noise, missing data, and sparsity of coverage in the context of a current, real world human AP-MS data set. Our goal is to extend and increase the density of the known human interactome by integrating bait–prey and cocomplexed preys (prey–prey associations) into networks. Our framework incorporates a score for each identified protein, as well as elements of signal processing to improve the confidence of identified protein–protein interactions. We identify many protein networks enriched in known biological processes and functions. In addition, we show that integrated bait–prey and prey–prey interactions can be used to refine network topology and extend known protein networks. PMID:22845868
Epidemic spreading and immunization strategy in multiplex networks
NASA Astrophysics Data System (ADS)
Alvarez Zuzek, Lucila G.; Buono, Camila; Braunstein, Lidia A.
2015-09-01
A more connected world has brought major consequences such as facilitate the spread of diseases all over the world to quickly become epidemics, reason why researchers are concentrated in modeling the propagation of epidemics and outbreaks in multilayer networks. In this networks all nodes interact in different layers with different type of links. However, in many scenarios such as in the society, a multiplex network framework is not completely suitable since not all individuals participate in all layers. In this paper, we use a partially overlapped, multiplex network where only a fraction of the individuals are shared by the layers. We develop a mitigation strategy for stopping a disease propagation, considering the Susceptible-Infected- Recover model, in a system consisted by two layers. We consider a random immunization in one of the layers and study the effect of the overlapping fraction in both, the propagation of the disease and the immunization strategy. Using branching theory, we study this scenario theoretically and via simulations and find a lower epidemic threshold than in the case without strategy.
Google matrix of the world network of economic activities
NASA Astrophysics Data System (ADS)
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.
Reconstruction of a Real World Social Network using the Potts Model and Loopy Belief Propagation.
Bisconti, Cristian; Corallo, Angelo; Fortunato, Laura; Gentile, Antonio A; Massafra, Andrea; Pellè, Piergiuseppe
2015-01-01
The scope of this paper is to test the adoption of a statistical model derived from Condensed Matter Physics, for the reconstruction of the structure of a social network. The inverse Potts model, traditionally applied to recursive observations of quantum states in an ensemble of particles, is here addressed to observations of the members' states in an organization and their (anti)correlations, thus inferring interactions as links among the members. Adopting proper (Bethe) approximations, such an inverse problem is showed to be tractable. Within an operational framework, this network-reconstruction method is tested for a small real-world social network, the Italian parliament. In this study case, it is easy to track statuses of the parliament members, using (co)sponsorships of law proposals as the initial dataset. In previous studies of similar activity-based networks, the graph structure was inferred directly from activity co-occurrences: here we compare our statistical reconstruction with such standard methods, outlining discrepancies and advantages.
Reconstruction of a Real World Social Network using the Potts Model and Loopy Belief Propagation
Bisconti, Cristian; Corallo, Angelo; Fortunato, Laura; Gentile, Antonio A.; Massafra, Andrea; Pellè, Piergiuseppe
2015-01-01
The scope of this paper is to test the adoption of a statistical model derived from Condensed Matter Physics, for the reconstruction of the structure of a social network. The inverse Potts model, traditionally applied to recursive observations of quantum states in an ensemble of particles, is here addressed to observations of the members' states in an organization and their (anti)correlations, thus inferring interactions as links among the members. Adopting proper (Bethe) approximations, such an inverse problem is showed to be tractable. Within an operational framework, this network-reconstruction method is tested for a small real-world social network, the Italian parliament. In this study case, it is easy to track statuses of the parliament members, using (co)sponsorships of law proposals as the initial dataset. In previous studies of similar activity-based networks, the graph structure was inferred directly from activity co-occurrences: here we compare our statistical reconstruction with such standard methods, outlining discrepancies and advantages. PMID:26617539
VANLO - Interactive visual exploration of aligned biological networks
Brasch, Steffen; Linsen, Lars; Fuellen, Georg
2009-01-01
Background Protein-protein interaction (PPI) is fundamental to many biological processes. In the course of evolution, biological networks such as protein-protein interaction networks have developed. Biological networks of different species can be aligned by finding instances (e.g. proteins) with the same common ancestor in the evolutionary process, so-called orthologs. For a better understanding of the evolution of biological networks, such aligned networks have to be explored. Visualization can play a key role in making the various relationships transparent. Results We present a novel visualization system for aligned biological networks in 3D space that naturally embeds existing 2D layouts. In addition to displaying the intra-network connectivities, we also provide insight into how the individual networks relate to each other by placing aligned entities on top of each other in separate layers. We optimize the layout of the entire alignment graph in a global fashion that takes into account inter- as well as intra-network relationships. The layout algorithm includes a step of merging aligned networks into one graph, laying out the graph with respect to application-specific requirements, splitting the merged graph again into individual networks, and displaying the network alignment in layers. In addition to representing the data in a static way, we also provide different interaction techniques to explore the data with respect to application-specific tasks. Conclusion Our system provides an intuitive global understanding of aligned PPI networks and it allows the investigation of key biological questions. We evaluate our system by applying it to real-world examples documenting how our system can be used to investigate the data with respect to these key questions. Our tool VANLO (Visualization of Aligned Networks with Layout Optimization) can be accessed at . PMID:19821976
Interaction mining and skill-dependent recommendations for multi-objective team composition
Dorn, Christoph; Skopik, Florian; Schall, Daniel; Dustdar, Schahram
2011-01-01
Web-based collaboration and virtual environments supported by various Web 2.0 concepts enable the application of numerous monitoring, mining and analysis tools to study human interactions and team formation processes. The composition of an effective team requires a balance between adequate skill fulfillment and sufficient team connectivity. The underlying interaction structure reflects social behavior and relations of individuals and determines to a large degree how well people can be expected to collaborate. In this paper we address an extended team formation problem that does not only require direct interactions to determine team connectivity but additionally uses implicit recommendations of collaboration partners to support even sparsely connected networks. We provide two heuristics based on Genetic Algorithms and Simulated Annealing for discovering efficient team configurations that yield the best trade-off between skill coverage and team connectivity. Our self-adjusting mechanism aims to discover the best combination of direct interactions and recommendations when deriving connectivity. We evaluate our approach based on multiple configurations of a simulated collaboration network that features close resemblance to real world expert networks. We demonstrate that our algorithm successfully identifies efficient team configurations even when removing up to 40% of experts from various social network configurations. PMID:22298939
ERIC Educational Resources Information Center
Chun, Heasun
2013-01-01
The primary purpose of this study is to test whether dialogic interactions via SNSs can help revive political participation and help citizens to become involved in real-world politics. In a Tocquevillian sense, this study assumes a positive relationship between virtual associational life and political participation and therefore argues that SNSs…
Interspecific competition underlying mutualistic networks.
Maeng, Seong Eun; Lee, Jae Woo; Lee, Deok-Sun
2012-03-09
Multiple classes of interactions may exist affecting one another in a given system. For the mutualistic networks of plants and pollinating animals, it has been known that the degree distribution is broad but often deviates from power-law form more significantly for plants than animals. To illuminate the origin of such asymmetry, we study a model network in which links are assigned under generalized preferential-selection rules between two groups of nodes and find the sensitive dependence of the resulting connectivity pattern on the model parameters. The nonlinearity of preferential selection can come from interspecific interactions among animals and among plants. The model-based analysis of real-world mutualistic networks suggests that a new animal determines its partners not only by their abundance but also under the competition with existing animal species, which leads to the stretched-exponential degree distributions of plants.
Interspecific Competition Underlying Mutualistic Networks
NASA Astrophysics Data System (ADS)
Maeng, Seong Eun; Lee, Jae Woo; Lee, Deok-Sun
2012-03-01
Multiple classes of interactions may exist affecting one another in a given system. For the mutualistic networks of plants and pollinating animals, it has been known that the degree distribution is broad but often deviates from power-law form more significantly for plants than animals. To illuminate the origin of such asymmetry, we study a model network in which links are assigned under generalized preferential-selection rules between two groups of nodes and find the sensitive dependence of the resulting connectivity pattern on the model parameters. The nonlinearity of preferential selection can come from interspecific interactions among animals and among plants. The model-based analysis of real-world mutualistic networks suggests that a new animal determines its partners not only by their abundance but also under the competition with existing animal species, which leads to the stretched-exponential degree distributions of plants.
Gatica-Rojas, Valeska; Méndez-Rebolledo, Guillermo
2014-04-15
Two key characteristics of all virtual reality applications are interaction and immersion. Systemic interaction is achieved through a variety of multisensory channels (hearing, sight, touch, and smell), permitting the user to interact with the virtual world in real time. Immersion is the degree to which a person can feel wrapped in the virtual world through a defined interface. Virtual reality interface devices such as the Nintendo® Wii and its peripheral nunchuks-balance board, head mounted displays and joystick allow interaction and immersion in unreal environments created from computer software. Virtual environments are highly interactive, generating great activation of visual, vestibular and proprioceptive systems during the execution of a video game. In addition, they are entertaining and safe for the user. Recently, incorporating therapeutic purposes in virtual reality interface devices has allowed them to be used for the rehabilitation of neurological patients, e.g., balance training in older adults and dynamic stability in healthy participants. The improvements observed in neurological diseases (chronic stroke and cerebral palsy) have been shown by changes in the reorganization of neural networks in patients' brain, along with better hand function and other skills, contributing to their quality of life. The data generated by such studies could substantially contribute to physical rehabilitation strategies.
Gatica-Rojas, Valeska; Méndez-Rebolledo, Guillermo
2014-01-01
Two key characteristics of all virtual reality applications are interaction and immersion. Systemic interaction is achieved through a variety of multisensory channels (hearing, sight, touch, and smell), permitting the user to interact with the virtual world in real time. Immersion is the degree to which a person can feel wrapped in the virtual world through a defined interface. Virtual reality interface devices such as the Nintendo® Wii and its peripheral nunchuks-balance board, head mounted displays and joystick allow interaction and immersion in unreal environments created from computer software. Virtual environments are highly interactive, generating great activation of visual, vestibular and proprioceptive systems during the execution of a video game. In addition, they are entertaining and safe for the user. Recently, incorporating therapeutic purposes in virtual reality interface devices has allowed them to be used for the rehabilitation of neurological patients, e.g., balance training in older adults and dynamic stability in healthy participants. The improvements observed in neurological diseases (chronic stroke and cerebral palsy) have been shown by changes in the reorganization of neural networks in patients’ brain, along with better hand function and other skills, contributing to their quality of life. The data generated by such studies could substantially contribute to physical rehabilitation strategies. PMID:25206907
Agreement dynamics on interaction networks with diverse topologies
NASA Astrophysics Data System (ADS)
Barrat, Alain; Baronchelli, Andrea; Dall'Asta, Luca; Loreto, Vittorio
2007-06-01
We review the behavior of a recently introduced model of agreement dynamics, called the "Naming Game." This model describes the self-organized emergence of linguistic conventions and the establishment of simple communication systems in a population of agents with pairwise local interactions. The mechanisms of convergence towards agreement strongly depend on the network of possible interactions between the agents. In particular, the mean-field case in which all agents communicate with all the others is not efficient, since a large temporary memory is requested for the agents. On the other hand, regular lattice topologies lead to a fast local convergence but to a slow global dynamics similar to coarsening phenomena. The embedding of the agents in a small-world network represents an interesting tradeoff: a local consensus is easily reached, while the long-range links allow to bypass coarsening-like convergence. We also consider alternative adaptive strategies which can lead to faster global convergence.
First Lessons From The Biarritz Trial Network [1
NASA Astrophysics Data System (ADS)
Touyarot, P.; Marc, B.; de Panafieu, A.
1986-07-01
Opened for commercial operation in 1984, the trial optical fiber network at Biarritz in south-west France gives 1,500 subscribers access to a whole range of broadband services - videophony, audiovisual databases, TV and stereo sound program distribution, and an on-line TV program library - in addition to conventional narrow-band services like telephony and videotex. The Biarritz network is an outstanding technology and engineering testbed. It is also a sociological testing ground for new services, unique in the world, with results of particular relevance to the interactive cable TV and visual communications networks of the future.
Active learning of cortical connectivity from two-photon imaging data.
Bertrán, Martín A; Martínez, Natalia L; Wang, Ye; Dunson, David; Sapiro, Guillermo; Ringach, Dario
2018-01-01
Understanding how groups of neurons interact within a network is a fundamental question in system neuroscience. Instead of passively observing the ongoing activity of a network, we can typically perturb its activity, either by external sensory stimulation or directly via techniques such as two-photon optogenetics. A natural question is how to use such perturbations to identify the connectivity of the network efficiently. Here we introduce a method to infer sparse connectivity graphs from in-vivo, two-photon imaging of population activity in response to external stimuli. A novel aspect of the work is the introduction of a recommended distribution, incrementally learned from the data, to optimally refine the inferred network. Unlike existing system identification techniques, this "active learning" method automatically focuses its attention on key undiscovered areas of the network, instead of targeting global uncertainty indicators like parameter variance. We show how active learning leads to faster inference while, at the same time, provides confidence intervals for the network parameters. We present simulations on artificial small-world networks to validate the methods and apply the method to real data. Analysis of frequency of motifs recovered show that cortical networks are consistent with a small-world topology model.
Active learning of cortical connectivity from two-photon imaging data
Wang, Ye; Dunson, David; Sapiro, Guillermo; Ringach, Dario
2018-01-01
Understanding how groups of neurons interact within a network is a fundamental question in system neuroscience. Instead of passively observing the ongoing activity of a network, we can typically perturb its activity, either by external sensory stimulation or directly via techniques such as two-photon optogenetics. A natural question is how to use such perturbations to identify the connectivity of the network efficiently. Here we introduce a method to infer sparse connectivity graphs from in-vivo, two-photon imaging of population activity in response to external stimuli. A novel aspect of the work is the introduction of a recommended distribution, incrementally learned from the data, to optimally refine the inferred network. Unlike existing system identification techniques, this “active learning” method automatically focuses its attention on key undiscovered areas of the network, instead of targeting global uncertainty indicators like parameter variance. We show how active learning leads to faster inference while, at the same time, provides confidence intervals for the network parameters. We present simulations on artificial small-world networks to validate the methods and apply the method to real data. Analysis of frequency of motifs recovered show that cortical networks are consistent with a small-world topology model. PMID:29718955
Yang, Q; Siganos, G; Faloutsos, M; Lonardi, S
2006-01-01
Recent research efforts have made available genome-wide, high-throughput protein-protein interaction (PPI) maps for several model organisms. This has enabled the systematic analysis of PPI networks, which has become one of the primary challenges for the system biology community. In this study, we attempt to understand better the topological structure of PPI networks by comparing them against man-made communication networks, and more specifically, the Internet. Our comparative study is based on a comprehensive set of graph metrics. Our results exhibit an interesting dichotomy. On the one hand, both networks share several macroscopic properties such as scale-free and small-world properties. On the other hand, the two networks exhibit significant topological differences, such as the cliqueishness of the highest degree nodes. We attribute these differences to the distinct design principles and constraints that both networks are assumed to satisfy. We speculate that the evolutionary constraints that favor the survivability and diversification are behind the building process of PPI networks, whereas the leading force in shaping the Internet topology is a decentralized optimization process geared towards efficient node communication.
Properties of interaction networks underlying the minority game.
Caridi, Inés
2014-11-01
The minority game is a well-known agent-based model with no explicit interaction among its agents. However, it is known that they interact through the global magnitudes of the model and through their strategies. In this work we have attempted to formalize the implicit interactions among minority game agents as if they were links on a complex network. We have defined the link between two agents by quantifying the similarity between them. This link definition is based on the information of the instance of the game (the set of strategies assigned to each agent at the beginning) without any dynamic information on the game and brings about a static, unweighed and undirected network. We have analyzed the structure of the resulting network for different parameters, such as the number of agents (N) and the agent's capacity to process information (m), always taking into account games with two strategies per agent. In the region of crowd effects of the model, the resulting networks structure is a small-world network, whereas in the region where the behavior of the minority game is the same as in a game of random decisions, networks become a random network of Erdos-Renyi. The transition between these two types of networks is slow, without any peculiar feature of the network in the region of the coordination among agents. Finally, we have studied the resulting static networks for the full strategy minority game model, a maximal instance of the minority game in which all possible agents take part in the game. We have explicitly calculated the degree distribution of the full strategy minority game network and, on the basis of this analytical result, we have estimated the degree distribution of the minority game network, which is in accordance with computational results.
Framework based on communicability and flow to analyze complex network dynamics
NASA Astrophysics Data System (ADS)
Gilson, M.; Kouvaris, N. E.; Deco, G.; Zamora-López, G.
2018-05-01
Graph theory constitutes a widely used and established field providing powerful tools for the characterization of complex networks. The intricate topology of networks can also be investigated by means of the collective dynamics observed in the interactions of self-sustained oscillations (synchronization patterns) or propagationlike processes such as random walks. However, networks are often inferred from real-data-forming dynamic systems, which are different from those employed to reveal their topological characteristics. This stresses the necessity for a theoretical framework dedicated to the mutual relationship between the structure and dynamics in complex networks, as the two sides of the same coin. Here we propose a rigorous framework based on the network response over time (i.e., Green function) to study interactions between nodes across time. For this purpose we define the flow that describes the interplay between the network connectivity and external inputs. This multivariate measure relates to the concepts of graph communicability and the map equation. We illustrate our theory using the multivariate Ornstein-Uhlenbeck process, which describes stable and non-conservative dynamics, but the formalism can be adapted to other local dynamics for which the Green function is known. We provide applications to classical network examples, such as small-world ring and hierarchical networks. Our theory defines a comprehensive framework that is canonically related to directed and weighted networks, thus paving a way to revise the standards for network analysis, from the pairwise interactions between nodes to the global properties of networks including community detection.
Local communities obstruct global consensus: Naming game on multi-local-world networks
NASA Astrophysics Data System (ADS)
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.
Luo, Wei; Yin, Peifeng; Di, Qian; Hardisty, Frank; MacEachren, Alan M
2014-01-01
The world has become a complex set of geo-social systems interconnected by networks, including transportation networks, telecommunications, and the internet. Understanding the interactions between spatial and social relationships within such geo-social systems is a challenge. This research aims to address this challenge through the framework of geovisual analytics. We present the GeoSocialApp which implements traditional network analysis methods in the context of explicitly spatial and social representations. We then apply it to an exploration of international trade networks in terms of the complex interactions between spatial and social relationships. This exploration using the GeoSocialApp helps us develop a two-part hypothesis: international trade network clusters with structural equivalence are strongly 'balkanized' (fragmented) according to the geography of trading partners, and the geographical distance weighted by population within each network cluster has a positive relationship with the development level of countries. In addition to demonstrating the potential of visual analytics to provide insight concerning complex geo-social relationships at a global scale, the research also addresses the challenge of validating insights derived through interactive geovisual analytics. We develop two indicators to quantify the observed patterns, and then use a Monte-Carlo approach to support the hypothesis developed above.
Luo, Wei; Yin, Peifeng; Di, Qian; Hardisty, Frank; MacEachren, Alan M.
2014-01-01
The world has become a complex set of geo-social systems interconnected by networks, including transportation networks, telecommunications, and the internet. Understanding the interactions between spatial and social relationships within such geo-social systems is a challenge. This research aims to address this challenge through the framework of geovisual analytics. We present the GeoSocialApp which implements traditional network analysis methods in the context of explicitly spatial and social representations. We then apply it to an exploration of international trade networks in terms of the complex interactions between spatial and social relationships. This exploration using the GeoSocialApp helps us develop a two-part hypothesis: international trade network clusters with structural equivalence are strongly ‘balkanized’ (fragmented) according to the geography of trading partners, and the geographical distance weighted by population within each network cluster has a positive relationship with the development level of countries. In addition to demonstrating the potential of visual analytics to provide insight concerning complex geo-social relationships at a global scale, the research also addresses the challenge of validating insights derived through interactive geovisual analytics. We develop two indicators to quantify the observed patterns, and then use a Monte-Carlo approach to support the hypothesis developed above. PMID:24558409
The Impact of Developing Technology on Media Communications.
ERIC Educational Resources Information Center
MacDonald, Lindsay W.
1997-01-01
Examines changes in media communications resulting from new information technologies: communications technologies (networks, World Wide Web, digital set-top box); graphic arts (digital photography, CD and digital archives, desktop design and publishing, printing technology); television and video (digital editing, interactive television, news and…
National Systems of Innovation and Technological Differentiation:. a Multi-Country Model
NASA Astrophysics Data System (ADS)
Ribeiro, Leonardo C.; Ruiz, Ricardo M.; Albuquerque, Eduardo M.; Bernardes, Américo T.
Science and technology have a fundamental role in the economic development. Although this statement is generally well accepted, the internal mechanisms which are responsible for these interactions are not clear. In the last decade, dealing with this problem, many models have been proposed. In this paper, we introduce a model that creates an artificial world economy that is a network of countries. Each country has its own national system of innovation and the interactions between countries are given by functions that connect the competitiveness of their prices and their technological capabilities. Starting from different configurations, the artificial world economy self-organizes itself and creates a hierarchies of countries.
ERIC Educational Resources Information Center
Hamada, Mayumi
2012-01-01
Facebook is the most popular social network service (SNS) in the world and a great platform for a link to the world. It can also be used effectively for language learning in EFL environments. However, that is not the case in Japan. The number of Facebook users accounts for less than 6% of the population. This is partly because the most popular SNS…
The Implications of Pervasive Computing on Network Design
NASA Astrophysics Data System (ADS)
Briscoe, R.
Mark Weiser's late-1980s vision of an age of calm technology with pervasive computing disappearing into the fabric of the world [1] has been tempered by an industry-driven vision with more of a feel of conspicuous consumption. In the modified version, everyone carries around consumer electronics to provide natural, seamless interactions both with other people and with the information world, particularly for eCommerce, but still through a pervasive computing fabric.
Sig2BioPAX: Java tool for converting flat files to BioPAX Level 3 format.
Webb, Ryan L; Ma'ayan, Avi
2011-03-21
The World Wide Web plays a critical role in enabling molecular, cell, systems and computational biologists to exchange, search, visualize, integrate, and analyze experimental data. Such efforts can be further enhanced through the development of semantic web concepts. The semantic web idea is to enable machines to understand data through the development of protocol free data exchange formats such as Resource Description Framework (RDF) and the Web Ontology Language (OWL). These standards provide formal descriptors of objects, object properties and their relationships within a specific knowledge domain. However, the overhead of converting datasets typically stored in data tables such as Excel, text or PDF into RDF or OWL formats is not trivial for non-specialists and as such produces a barrier to seamless data exchange between researchers, databases and analysis tools. This problem is particularly of importance in the field of network systems biology where biochemical interactions between genes and their protein products are abstracted to networks. For the purpose of converting biochemical interactions into the BioPAX format, which is the leading standard developed by the computational systems biology community, we developed an open-source command line tool that takes as input tabular data describing different types of molecular biochemical interactions. The tool converts such interactions into the BioPAX level 3 OWL format. We used the tool to convert several existing and new mammalian networks of protein interactions, signalling pathways, and transcriptional regulatory networks into BioPAX. Some of these networks were deposited into PathwayCommons, a repository for consolidating and organizing biochemical networks. The software tool Sig2BioPAX is a resource that enables experimental and computational systems biologists to contribute their identified networks and pathways of molecular interactions for integration and reuse with the rest of the research community.
A Virtual Reality Exposure Therapy Application for Iraq War Post Traumatic Stress Disorder
2006-01-01
denial of social problems. Prior to the availability of VR therapy applications, the existing standard of care for PTSD was imaginal exposure...The application is built on ICT’s FlatWorld Simulation Control Architecture (FSCA) [13]. The FSCA enables a network -centric system of client displays...client-side interaction despite potential network delays. FCSA scripting is based on the Lua programming language [14] and provides facilities for real
Disease transmission in territorial populations: the small-world network of Serengeti lions
Craft, Meggan E.; Volz, Erik; Packer, Craig; Meyers, Lauren Ancel
2011-01-01
Territoriality in animal populations creates spatial structure that is thought to naturally buffer disease invasion. Often, however, territorial populations also include highly mobile, non-residential individuals that potentially serve as disease superspreaders. Using long-term data from the Serengeti Lion Project, we characterize the contact network structure of a territorial wildlife population and address the epidemiological impact of nomadic individuals. As expected, pride contacts are dominated by interactions with neighbouring prides and interspersed by encounters with nomads as they wander throughout the ecosystem. Yet the pride–pride network also includes occasional long-range contacts between prides, making it surprisingly small world and vulnerable to epidemics, even without nomads. While nomads increase both the local and global connectivity of the network, their epidemiological impact is marginal, particularly for diseases with short infectious periods like canine distemper virus. Thus, territoriality in Serengeti lions may be less protective and non-residents less important for disease transmission than previously considered. PMID:21030428
Dynamic behavior of the interaction between epidemics and cascades on heterogeneous networks
NASA Astrophysics Data System (ADS)
Jiang, Lurong; Jin, Xinyu; Xia, Yongxiang; Ouyang, Bo; Wu, Duanpo
2014-12-01
Epidemic spreading and cascading failure are two important dynamical processes on complex networks. They have been investigated separately for a long time. But in the real world, these two dynamics sometimes may interact with each other. In this paper, we explore a model combined with the SIR epidemic spreading model and a local load sharing cascading failure model. There exists a critical value of the tolerance parameter for which the epidemic with high infection probability can spread out and infect a fraction of the network in this model. When the tolerance parameter is smaller than the critical value, the cascading failure cuts off the abundance of paths and blocks the spreading of the epidemic locally. While the tolerance parameter is larger than the critical value, the epidemic spreads out and infects a fraction of the network. A method for estimating the critical value is proposed. In simulations, we verify the effectiveness of this method in the uncorrelated configuration model (UCM) scale-free networks.
Uncertainty Reduction for Stochastic Processes on Complex Networks
NASA Astrophysics Data System (ADS)
Radicchi, Filippo; Castellano, Claudio
2018-05-01
Many real-world systems are characterized by stochastic dynamical rules where a complex network of interactions among individual elements probabilistically determines their state. Even with full knowledge of the network structure and of the stochastic rules, the ability to predict system configurations is generally characterized by a large uncertainty. Selecting a fraction of the nodes and observing their state may help to reduce the uncertainty about the unobserved nodes. However, choosing these points of observation in an optimal way is a highly nontrivial task, depending on the nature of the stochastic process and on the structure of the underlying interaction pattern. In this paper, we introduce a computationally efficient algorithm to determine quasioptimal solutions to the problem. The method leverages network sparsity to reduce computational complexity from exponential to almost quadratic, thus allowing the straightforward application of the method to mid-to-large-size systems. Although the method is exact only for equilibrium stochastic processes defined on trees, it turns out to be effective also for out-of-equilibrium processes on sparse loopy networks.
Bayesian module identification from multiple noisy networks.
Zamani Dadaneh, Siamak; Qian, Xiaoning
2016-12-01
Module identification has been studied extensively in order to gain deeper understanding of complex systems, such as social networks as well as biological networks. Modules are often defined as groups of vertices in these networks that are topologically cohesive with similar interaction patterns with the rest of the vertices. Most of the existing module identification algorithms assume that the given networks are faithfully measured without errors. However, in many real-world applications, for example, when analyzing protein-protein interaction networks from high-throughput profiling techniques, there is significant noise with both false positive and missing links between vertices. In this paper, we propose a new model for more robust module identification by taking advantage of multiple observed networks with significant noise so that signals in multiple networks can be strengthened and help improve the solution quality by combining information from various sources. We adopt a hierarchical Bayesian model to integrate multiple noisy snapshots that capture the underlying modular structure of the networks under study. By introducing a latent root assignment matrix and its relations to instantaneous module assignments in all the observed networks to capture the underlying modular structure and combine information across multiple networks, an efficient variational Bayes algorithm can be derived to accurately and robustly identify the underlying modules from multiple noisy networks. Experiments on synthetic and protein-protein interaction data sets show that our proposed model enhances both the accuracy and resolution in detecting cohesive modules, and it is less vulnerable to noise in the observed data. In addition, it shows higher power in predicting missing edges compared to individual-network methods.
Moon, Hankyu; Lu, Tsai-Ching
2015-01-01
Critical events in society or biological systems can be understood as large-scale self-emergent phenomena due to deteriorating stability. We often observe peculiar patterns preceding these events, posing a question of—how to interpret the self-organized patterns to know more about the imminent crisis. We start with a very general description — of interacting population giving rise to large-scale emergent behaviors that constitute critical events. Then we pose a key question: is there a quantifiable relation between the network of interactions and the emergent patterns? Our investigation leads to a fundamental understanding to: 1. Detect the system's transition based on the principal mode of the pattern dynamics; 2. Identify its evolving structure based on the observed patterns. The main finding of this study is that while the pattern is distorted by the network of interactions, its principal mode is invariant to the distortion even when the network constantly evolves. Our analysis on real-world markets show common self-organized behavior near the critical transitions, such as housing market collapse and stock market crashes, thus detection of critical events before they are in full effect is possible. PMID:25822423
NASA Astrophysics Data System (ADS)
Moon, Hankyu; Lu, Tsai-Ching
2015-03-01
Critical events in society or biological systems can be understood as large-scale self-emergent phenomena due to deteriorating stability. We often observe peculiar patterns preceding these events, posing a question of--how to interpret the self-organized patterns to know more about the imminent crisis. We start with a very general description -- of interacting population giving rise to large-scale emergent behaviors that constitute critical events. Then we pose a key question: is there a quantifiable relation between the network of interactions and the emergent patterns? Our investigation leads to a fundamental understanding to: 1. Detect the system's transition based on the principal mode of the pattern dynamics; 2. Identify its evolving structure based on the observed patterns. The main finding of this study is that while the pattern is distorted by the network of interactions, its principal mode is invariant to the distortion even when the network constantly evolves. Our analysis on real-world markets show common self-organized behavior near the critical transitions, such as housing market collapse and stock market crashes, thus detection of critical events before they are in full effect is possible.
Neuron-Like Networks Between Ribosomal Proteins Within the Ribosome
NASA Astrophysics Data System (ADS)
Poirot, Olivier; Timsit, Youri
2016-05-01
From brain to the World Wide Web, information-processing networks share common scale invariant properties. Here, we reveal the existence of neural-like networks at a molecular scale within the ribosome. We show that with their extensions, ribosomal proteins form complex assortative interaction networks through which they communicate through tiny interfaces. The analysis of the crystal structures of 50S eubacterial particles reveals that most of these interfaces involve key phylogenetically conserved residues. The systematic observation of interactions between basic and aromatic amino acids at the interfaces and along the extension provides new structural insights that may contribute to decipher the molecular mechanisms of signal transmission within or between the ribosomal proteins. Similar to neurons interacting through “molecular synapses”, ribosomal proteins form a network that suggest an analogy with a simple molecular brain in which the “sensory-proteins” innervate the functional ribosomal sites, while the “inter-proteins” interconnect them into circuits suitable to process the information flow that circulates during protein synthesis. It is likely that these circuits have evolved to coordinate both the complex macromolecular motions and the binding of the multiple factors during translation. This opens new perspectives on nanoscale information transfer and processing.
Flow interaction based propagation model and bursty influence behavior analysis of Internet flows
NASA Astrophysics Data System (ADS)
Wu, Xiao-Yu; Gu, Ren-Tao; Ji, Yue-Feng
2016-11-01
QoS (quality of service) fluctuations caused by Internet bursty flows influence the user experience in the Internet, such as the increment of packet loss and transmission time. In this paper, we establish a mathematical model to study the influence propagation behavior of the bursty flow, which is helpful for developing a deep understanding of the network dynamics in the Internet complex system. To intuitively reflect the propagation process, a data flow interaction network with a hierarchical structure is constructed, where the neighbor order is proposed to indicate the neighborhood relationship between the bursty flow and other flows. The influence spreads from the bursty flow to each order of neighbors through flow interactions. As the influence spreads, the bursty flow has negative effects on the odd order neighbors and positive effects on the even order neighbors. The influence intensity of bursty flow decreases sharply between two adjacent orders and the decreasing degree can reach up to dozens of times in the experimental simulation. Moreover, the influence intensity increases significantly when network congestion situation becomes serious, especially for the 1st order neighbors. Network structural factors are considered to make a further study. Simulation results show that the physical network scale expansion can reduce the influence intensity of bursty flow by decreasing the flow distribution density. Furthermore, with the same network scale, the influence intensity in WS small-world networks is 38.18% and 18.40% lower than that in ER random networks and BA scale-free networks, respectively, due to a lower interaction probability between flows. These results indicate that the macro-structural changes such as network scales and styles will affect the inner propagation behaviors of the bursty flow.
The history of managed care and the role of the child and adolescent psychiatrist.
Glasser, Martin
2010-01-01
The child and adolescent psychiatrist cannot practice in today's world without interacting with the world of insurance and managed care. This article reviews the history of the development of the managed care industry. It also examines the variety of roles clinicians play, whether as members of physician networks, as a peer or utilization reviewers, or as medical directors. The skills required of the physician employee and the contractual and ethical concerns are discussed.
NASA Astrophysics Data System (ADS)
Ceola, S.; Laio, F.; Montanari, A.
2013-12-01
The study and the analysis of the interactions and feedbacks between hydrology and society constitute the main issue of socio-hydrology. Recent flood events, which occurred across the globe, highlighted once again that mitigation strategies are needed to reduce flood risk. In particular, quick procedures for the identification of vulnerable human settlements and flood prone areas are a necessary tool to identify priorities for flood risk management. To this aim, a 19-year long period of world-wide night light data, as a proxy of human population, and the global river network have been examined. The spatio-temporal evolution of artificial luminosity depending on the distance from the river network has been assessed in order to quantitatively identify the likelihood for a populated pixel to be reached by water. The analysis focuses both on a global and on a local scale. Hotspots, such as highly illuminated areas and developing regions, have been also examined. The analysis shows an increment of yearly-averaged artificial luminosity from 1992 to 2010 (i.e. the time period of satellite data availability), whereas light intensity tends to decrease with increasing distance from the river network. The results thus reveal an increased vulnerability of human settlements to flooding events. A nearly 70-year long period of peace and the economic development after the Second World War could reasonably explain the observed enhancement of human population proximity to water bodies.
Reciprocity in spatial evolutionary public goods game on double-layered network
NASA Astrophysics Data System (ADS)
Kim, Jinho; Yook, Soon-Hyung; Kim, Yup
2016-08-01
Spatial evolutionary games have mainly been studied on a single, isolated network. However, in real world systems, many interaction topologies are not isolated but many different types of networks are inter-connected to each other. In this study, we investigate the spatial evolutionary public goods game (SEPGG) on double-layered random networks (DRN). Based on the mean-field type arguments and numerical simulations, we find that SEPGG on DRN shows very rich interesting phenomena, especially, depending on the size of each layer, intra-connectivity, and inter-connected couplings, the network reciprocity of SEPGG on DRN can be drastically enhanced through the inter-connected coupling. Furthermore, SEPGG on DRN can provide a more general framework which includes the evolutionary dynamics on multiplex networks and inter-connected networks at the same time.
Reciprocity in spatial evolutionary public goods game on double-layered network
Kim, Jinho; Yook, Soon-Hyung; Kim, Yup
2016-01-01
Spatial evolutionary games have mainly been studied on a single, isolated network. However, in real world systems, many interaction topologies are not isolated but many different types of networks are inter-connected to each other. In this study, we investigate the spatial evolutionary public goods game (SEPGG) on double-layered random networks (DRN). Based on the mean-field type arguments and numerical simulations, we find that SEPGG on DRN shows very rich interesting phenomena, especially, depending on the size of each layer, intra-connectivity, and inter-connected couplings, the network reciprocity of SEPGG on DRN can be drastically enhanced through the inter-connected coupling. Furthermore, SEPGG on DRN can provide a more general framework which includes the evolutionary dynamics on multiplex networks and inter-connected networks at the same time. PMID:27503801
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.
Data-Driven Design of Intelligent Wireless Networks: An Overview and Tutorial.
Kulin, Merima; Fortuna, Carolina; De Poorter, Eli; Deschrijver, Dirk; Moerman, Ingrid
2016-06-01
Data science or "data-driven research" is a research approach that uses real-life data to gain insight about the behavior of systems. It enables the analysis of small, simple as well as large and more complex systems in order to assess whether they function according to the intended design and as seen in simulation. Data science approaches have been successfully applied to analyze networked interactions in several research areas such as large-scale social networks, advanced business and healthcare processes. Wireless networks can exhibit unpredictable interactions between algorithms from multiple protocol layers, interactions between multiple devices, and hardware specific influences. These interactions can lead to a difference between real-world functioning and design time functioning. Data science methods can help to detect the actual behavior and possibly help to correct it. Data science is increasingly used in wireless research. To support data-driven research in wireless networks, this paper illustrates the step-by-step methodology that has to be applied to extract knowledge from raw data traces. To this end, the paper (i) clarifies when, why and how to use data science in wireless network research; (ii) provides a generic framework for applying data science in wireless networks; (iii) gives an overview of existing research papers that utilized data science approaches in wireless networks; (iv) illustrates the overall knowledge discovery process through an extensive example in which device types are identified based on their traffic patterns; (v) provides the reader the necessary datasets and scripts to go through the tutorial steps themselves.
Data-Driven Design of Intelligent Wireless Networks: An Overview and Tutorial
Kulin, Merima; Fortuna, Carolina; De Poorter, Eli; Deschrijver, Dirk; Moerman, Ingrid
2016-01-01
Data science or “data-driven research” is a research approach that uses real-life data to gain insight about the behavior of systems. It enables the analysis of small, simple as well as large and more complex systems in order to assess whether they function according to the intended design and as seen in simulation. Data science approaches have been successfully applied to analyze networked interactions in several research areas such as large-scale social networks, advanced business and healthcare processes. Wireless networks can exhibit unpredictable interactions between algorithms from multiple protocol layers, interactions between multiple devices, and hardware specific influences. These interactions can lead to a difference between real-world functioning and design time functioning. Data science methods can help to detect the actual behavior and possibly help to correct it. Data science is increasingly used in wireless research. To support data-driven research in wireless networks, this paper illustrates the step-by-step methodology that has to be applied to extract knowledge from raw data traces. To this end, the paper (i) clarifies when, why and how to use data science in wireless network research; (ii) provides a generic framework for applying data science in wireless networks; (iii) gives an overview of existing research papers that utilized data science approaches in wireless networks; (iv) illustrates the overall knowledge discovery process through an extensive example in which device types are identified based on their traffic patterns; (v) provides the reader the necessary datasets and scripts to go through the tutorial steps themselves. PMID:27258286
Leischow, Scott J; Okamoto, Janet; McIntosh, Scott; Ossip, Deborah J; Lando, Harry A
2017-04-20
The World Conference on Tobacco or Health (WCTOH) is held every three years to foster communication and collaboration on global tobacco control. Very little is known about the nature of interactions between WCTOH attendees and their linkages to tobacco control organizations, so knowing this information could help improve tobacco control efforts. At the 2015 WCTOH, we implemented an online survey to assess barriers to global tobacco control activities, which information sources they use for tobacco control information, and with whom they interact regarding tobacco control. A total of 169 respondents completed the survey, with responses from all six World Health Organization (WHO) regions. Respondents worked in all areas of tobacco control; the most common were research (29.2%) and patient care/treatment (23.3%). The top barriers faced regarding tobacco control activities were: funding is weak (56.8%), government commitment (45.0%), tobacco industry interference (43.8%), and lack of coordination (34.3%). The network analysis identified Framework Convention Alliance (FCA) and Society for Research on Nicotine and Tobacco (SRNT) as the two most prominent groups that people belonged to and where they went to exchange information and best practices. Important regional and country specific groups also appear to be growing, such as the African Tobacco Control Alliance (ATCA) and the Argentinian Association of Tabacology (ASAT). Mapping and better understanding the global tobacco control network is important for informing knowledge exchange and best practices, particularly as increasing attention is being focused on global tobacco control efforts in low- and middle-income countries in particular. The present study demonstrates that even a subsample of the WCTOH shows considerable collaboration. The full WCTOH network should be mapped in order to foster greater collaboration that has the the potential to improve global tobacco control efforts.
2014-06-13
their rich history, strong economy and a powerful military. All this was done at a time when the rest of the world was mired in the Great Depression ...the use of internet social networking. Companies such as YouTube , Facebook, and Google+ provide internet users the ability to interact through photo
Resource Discovery within the Networked "Hybrid" Library.
ERIC Educational Resources Information Center
Leigh, Sally-Anne
This paper focuses on the development, adoption, and integration of resource discovery, knowledge management, and/or knowledge sharing interfaces such as interactive portals, and the use of the library's World Wide Web presence to increase the availability and usability of information services. The introduction addresses changes in library…
NASA Astrophysics Data System (ADS)
Chen, Zhan-Ming; Chen, G. Q.
2013-07-01
This study presents a network simulation of the global embodied energy flows in 2007 based on a multi-region input-output model. The world economy is portrayed as a 6384-node network and the energy interactions between any two nodes are calculated and analyzed. According to the results, about 70% of the world's direct energy input is invested in resource, heavy manufacture, and transportation sectors which provide only 30% of the embodied energy to satisfy final demand. By contrast, non-transportation services sectors contribute to 24% of the world's demand-driven energy requirement with only 6% of the direct energy input. Commodity trade is shown to be an important alternative to fuel trade in redistributing energy, as international commodity flows embody 1.74E + 20 J of energy in magnitude up to 89% of the traded fuels. China is the largest embodied energy exporter with a net export of 3.26E + 19 J, in contrast to the United States as the largest importer with a net import of 2.50E + 19 J. The recent economic fluctuations following the financial crisis accelerate the relative expansions of energy requirement by developing countries, as a consequence China will take over the place of the United States as the world's top demand-driven energy consumer in 2022 and India will become the third largest in 2015.
Complex network description of the ionosphere
NASA Astrophysics Data System (ADS)
Lu, Shikun; Zhang, Hao; Li, Xihai; Li, Yihong; Niu, Chao; Yang, Xiaoyun; Liu, Daizhi
2018-03-01
Complex networks have emerged as an essential approach of geoscience to generate novel insights into the nature of geophysical systems. To investigate the dynamic processes in the ionosphere, a directed complex network is constructed, based on a probabilistic graph of the vertical total electron content (VTEC) from 2012. The results of the power-law hypothesis test show that both the out-degree and in-degree distribution of the ionospheric network are not scale-free. Thus, the distribution of the interactions in the ionosphere is homogenous. None of the geospatial positions play an eminently important role in the propagation of the dynamic ionospheric processes. The spatial analysis of the ionospheric network shows that the interconnections principally exist between adjacent geographical locations, indicating that the propagation of the dynamic processes primarily depends on the geospatial distance in the ionosphere. Moreover, the joint distribution of the edge distances with respect to longitude and latitude directions shows that the dynamic processes travel further along the longitude than along the latitude in the ionosphere. The analysis of small-world-ness
indicates that the ionospheric network possesses the small-world property, which can make the ionosphere stable and efficient in the propagation of dynamic processes.
Global spatio-temporal patterns in human migration: a complex network perspective.
Davis, Kyle F; D'Odorico, Paolo; Laio, Francesco; Ridolfi, Luca
2013-01-01
Migration is a powerful adaptive strategy for humans to navigate hardship and pursue a better quality of life. As a universal vehicle facilitating exchanges of ideas, culture, money and goods, international migration is a major contributor to globalization. Consisting of countries linked by multiple connections of human movements, global migration constitutes a network. Despite the important role of human migration in connecting various communities in different parts of the world, the topology and behavior of the international migration network and its changes through time remain poorly understood. Here we show that the global human migration network became more interconnected during the latter half of the twentieth century and that migrant destination choice partly reflects colonial and postcolonial histories, language, religion, and distances. From 1960 to 2000 we found a steady increase in network transitivity (i.e. connectivity between nodes connected to the same node), a decrease in average path length and an upward shift in degree distribution, all of which strengthened the 'small-world' behavior of the migration network. Furthermore, we found that distinct groups of countries preferentially interact to form migration communities based largely on historical, cultural and economic factors.
Distributed nuclear medicine applications using World Wide Web and Java technology.
Knoll, P; Höll, K; Mirzaei, S; Koriska, K; Köhn, H
2000-01-01
At present, medical applications applying World Wide Web (WWW) technology are mainly used to view static images and to retrieve some information. The Java platform is a relative new way of computing, especially designed for network computing and distributed applications which enables interactive connection between user and information via the WWW. The Java 2 Software Development Kit (SDK) including Java2D API, Java Remote Method Invocation (RMI) technology, Object Serialization and the Java Advanced Imaging (JAI) extension was used to achieve a robust, platform independent and network centric solution. Medical image processing software based on this technology is presented and adequate performance capability of Java is demonstrated by an iterative reconstruction algorithm for single photon emission computerized tomography (SPECT).
Coevolving complex networks in the model of social interactions
NASA Astrophysics Data System (ADS)
Raducha, Tomasz; Gubiec, Tomasz
2017-04-01
We analyze Axelrod's model of social interactions on coevolving complex networks. We introduce four extensions with different mechanisms of edge rewiring. The models are intended to catch two kinds of interactions-preferential attachment, which can be observed in scientists or actors collaborations, and local rewiring, which can be observed in friendship formation in everyday relations. Numerical simulations show that proposed dynamics can lead to the power-law distribution of nodes' degree and high value of the clustering coefficient, while still retaining the small-world effect in three models. All models are characterized by two phase transitions of a different nature. In case of local rewiring we obtain order-disorder discontinuous phase transition even in the thermodynamic limit, while in case of long-distance switching discontinuity disappears in the thermodynamic limit, leaving one continuous phase transition. In addition, we discover a new and universal characteristic of the second transition point-an abrupt increase of the clustering coefficient, due to formation of many small complete subgraphs inside the network.
NASA Astrophysics Data System (ADS)
Hadzibeganovic, Tarik; Stauffer, Dietrich; Han, Xiao-Pu
2018-04-01
Cooperation is fundamental for the long-term survival of biological, social, and technological networks. Previously, mechanisms for the enhancement of cooperation, such as network reciprocity, have largely been studied in isolation and with often inconclusive findings. Here, we present an evolutionary, multiagent-based, and spatially explicit computer model to specifically address the interactive interplay between such mechanisms. We systematically investigate the effects of phenotypic diversity, network structure, and rewards on cooperative behavior emerging in a population of reproducing artificial decision makers playing tag-mediated evolutionary games. Cooperative interactions are rewarded such that both the benefits of recipients and costs of donators are affected by the reward size. The reward size is determined by the number of cooperative acts occurring within a given reward time frame. Our computational experiments reveal that small reward frames promote unconditional cooperation in populations with both low and high diversity, whereas large reward frames lead to cycles of conditional and unconditional strategies at high but not at low diversity. Moreover, an interaction between rewards and spatial structure shows that relative to small reward frames, there is a strong difference between the frequency of conditional cooperators populating rewired versus non-rewired networks when the reward frame is large. Notably, in a less diverse population, the total number of defections is comparable across different network topologies, whereas in more diverse environments defections become more frequent in a regularly structured than in a rewired, small-world network of contacts. Acknowledging the importance of such interaction effects in social dilemmas will have inevitable consequences for the future design of cooperation-enhancing protocols in large-scale, distributed, and decentralized systems such as peer-to-peer networks.
NASA Astrophysics Data System (ADS)
Ahonen, Pasi; Alahuhta, Petteri; Daskala, Barbara; Delaitre, Sabine; Hert, Paul De; Lindner, Ralf; Maghiros, Ioannis; Moscibroda, Anna; Schreurs, Wim; Verlinden, Michiel
The brave new world of ambient intelligence is almost upon us. Ambient intelligence is the phrase coined to describe a world in which "intelligence" is embedded in virtually everything around us. It has been called an Internet of things, where radio frequency identification (RFID) tags are attached to all products. It is a world of smart dust with networked sensors and actuators so small as to be virtually invisible, where the clothes you wear, the paint on your walls, the carpets on your floor, and the paper money in your pocket have a computer communications capability. It is a 4G world where today's mobile phone is transformed into a terminal capable of receiving television, accessing the Internet, downloading music, reading RFIDs, taking pictures, enabling interactive video telephony, and much more. It is a world of convergence, where heterogeneous devices are able to communicate seamlessly across today's disparate networks, a world of machine learning and intelligent software, where computers monitor our activities, routines and behaviours to predict what we will do or want next. In the brave new world of ambient intelligence, we will never have to worry about losing track of our children because they will have a location device implanted under the skin or, if they are squeamish about that, then at least they will have one in their wristwatch.
Enabling Controlling Complex Networks with Local Topological Information.
Li, Guoqi; Deng, Lei; Xiao, Gaoxi; Tang, Pei; Wen, Changyun; Hu, Wuhua; Pei, Jing; Shi, Luping; Stanley, H Eugene
2018-03-15
Complex networks characterize the nature of internal/external interactions in real-world systems including social, economic, biological, ecological, and technological networks. Two issues keep as obstacles to fulfilling control of large-scale networks: structural controllability which describes the ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs; and optimal control, which is a typical control approach to minimize the cost for driving the network to a predefined state with a given number of control inputs. For large complex networks without global information of network topology, both problems remain essentially open. Here we combine graph theory and control theory for tackling the two problems in one go, using only local network topology information. For the structural controllability problem, a distributed local-game matching method is proposed, where every node plays a simple Bayesian game with local information and local interactions with adjacent nodes, ensuring a suboptimal solution at a linear complexity. Starring from any structural controllability solution, a minimizing longest control path method can efficiently reach a good solution for the optimal control in large networks. Our results provide solutions for distributed complex network control and demonstrate a way to link the structural controllability and optimal control together.
The gravitational law of social interaction
NASA Astrophysics Data System (ADS)
Levy, Moshe; Goldenberg, Jacob
2014-01-01
While a great deal is known about the topology of social networks, there is much less agreement about the geographical structure of these networks. The fundamental question in this context is: how does the probability of a social link between two individuals depend on the physical distance between them? While it is clear that the probability decreases with the distance, various studies have found different functional forms for this dependence. The exact form of the distance dependence has crucial implications for network searchability and dynamics: Kleinberg (2000) [15] shows that the small-world property holds if the probability of a social link is a power-law function of the distance with power -2, but not with any other power. We investigate the distance dependence of link probability empirically by analyzing four very different sets of data: Facebook links, data from the electronic version of the Small-World experiment, email messages, and data from detailed personal interviews. All four datasets reveal the same empirical regularity: the probability of a social link is proportional to the inverse of the square of the distance between the two individuals, analogously to the distance dependence of the gravitational force. Thus, it seems that social networks spontaneously converge to the exact unique distance dependence that ensures the Small-World property.
Molecular ecological network analyses.
Deng, Ye; Jiang, Yi-Huei; Yang, Yunfeng; He, Zhili; Luo, Feng; Zhou, Jizhong
2012-05-30
Understanding the interaction among different species within a community and their responses to environmental changes is a central goal in ecology. However, defining the network structure in a microbial community is very challenging due to their extremely high diversity and as-yet uncultivated status. Although recent advance of metagenomic technologies, such as high throughout sequencing and functional gene arrays, provide revolutionary tools for analyzing microbial community structure, it is still difficult to examine network interactions in a microbial community based on high-throughput metagenomics data. Here, we describe a novel mathematical and bioinformatics framework to construct ecological association networks named molecular ecological networks (MENs) through Random Matrix Theory (RMT)-based methods. Compared to other network construction methods, this approach is remarkable in that the network is automatically defined and robust to noise, thus providing excellent solutions to several common issues associated with high-throughput metagenomics data. We applied it to determine the network structure of microbial communities subjected to long-term experimental warming based on pyrosequencing data of 16 S rRNA genes. We showed that the constructed MENs under both warming and unwarming conditions exhibited topological features of scale free, small world and modularity, which were consistent with previously described molecular ecological networks. Eigengene analysis indicated that the eigengenes represented the module profiles relatively well. In consistency with many other studies, several major environmental traits including temperature and soil pH were found to be important in determining network interactions in the microbial communities examined. To facilitate its application by the scientific community, all these methods and statistical tools have been integrated into a comprehensive Molecular Ecological Network Analysis Pipeline (MENAP), which is open-accessible now (http://ieg2.ou.edu/MENA). The RMT-based molecular ecological network analysis provides powerful tools to elucidate network interactions in microbial communities and their responses to environmental changes, which are fundamentally important for research in microbial ecology and environmental microbiology.
Semantic Visualization of Wireless Sensor Networks for Elderly Monitoring
NASA Astrophysics Data System (ADS)
Stocklöw, Carsten; Kamieth, Felix
In the area of Ambient Intelligence, Wireless Sensor Networks are commonly used for user monitoring purposes like health monitoring and user localization. Existing work on visualization of wireless sensor networks focuses mainly on displaying individual nodes and logical, graph-based topologies. This way, the relation to the real-world deployment is lost. This paper presents a novel approach for visualization of wireless sensor networks and interaction with complex services on the nodes. The environment is realized as a 3D model, and multiple nodes, that are worn by a single individual, are grouped together to allow an intuitive interface for end users. We describe application examples and show that our approach allows easier access to network information and functionality by comparing it with existing solutions.
Workshop on Incomplete Network Data Held at Sandia National Labs – Livermore
DOE Office of Scientific and Technical Information (OSTI.GOV)
Soundarajan, Sucheta; Wendt, Jeremy D.
2016-06-01
While network analysis is applied in a broad variety of scientific fields (including physics, computer science, biology, and the social sciences), how networks are constructed and the resulting bias and incompleteness have drawn more limited attention. For example, in biology, gene networks are typically developed via experiment -- many actual interactions are likely yet to be discovered. In addition to this incompleteness, the data-collection processes can introduce significant bias into the observed network datasets. For instance, if you observe part of the World Wide Web network through a classic random walk, then high degree nodes are more likely to bemore » found than if you had selected nodes at random. Unfortunately, such incomplete and biasing data collection methods must be often used.« less
Origin and implications of zero degeneracy in networks spectra.
Yadav, Alok; Jalan, Sarika
2015-04-01
The spectra of many real world networks exhibit properties which are different from those of random networks generated using various models. One such property is the existence of a very high degeneracy at the zero eigenvalue. In this work, we provide all the possible reasons behind the occurrence of the zero degeneracy in the network spectra, namely, the complete and partial duplications, as well as their implications. The power-law degree sequence and the preferential attachment are the properties which enhances the occurrence of such duplications and hence leading to the zero degeneracy. A comparison of the zero degeneracy in protein-protein interaction networks of six different species and in their corresponding model networks indicates importance of the degree sequences and the power-law exponent for the occurrence of zero degeneracy.
Resilience and Controllability of Dynamic Collective Behaviors
Komareji, Mohammad; Bouffanais, Roland
2013-01-01
The network paradigm is used to gain insight into the structural root causes of the resilience of consensus in dynamic collective behaviors, and to analyze the controllability of the swarm dynamics. Here we devise the dynamic signaling network which is the information transfer channel underpinning the swarm dynamics of the directed interagent connectivity based on a topological neighborhood of interactions. The study of the connectedness of the swarm signaling network reveals the profound relationship between group size and number of interacting neighbors, which is found to be in good agreement with field observations on flock of starlings [Ballerini et al. (2008) Proc. Natl. Acad. Sci. USA, 105: 1232]. Using a dynamical model, we generate dynamic collective behaviors enabling us to uncover that the swarm signaling network is a homogeneous clustered small-world network, thus facilitating emergent outcomes if connectedness is maintained. Resilience of the emergent consensus is tested by introducing exogenous environmental noise, which ultimately stresses how deeply intertwined are the swarm dynamics in the physical and network spaces. The availability of the signaling network allows us to analytically establish for the first time the number of driver agents necessary to fully control the swarm dynamics. PMID:24358209
Phase Transition for the Maki-Thompson Rumour Model on a Small-World Network
NASA Astrophysics Data System (ADS)
Agliari, Elena; Pachon, Angelica; Rodriguez, Pablo M.; Tavani, Flavia
2017-11-01
We consider the Maki-Thompson model for the stochastic propagation of a rumour within a population. In this model the population is made up of "spreaders", "ignorants" and "stiflers"; any spreader attempts to pass the rumour to the other individuals via pair-wise interactions and in case the other individual is an ignorant, it becomes a spreader, while in the other two cases the initiating spreader turns into a stifler. In a finite population the process will eventually reach an equilibrium situation where individuals are either stiflers or ignorants. We extend the original hypothesis of homogenously mixed population by allowing for a small-world network embedding the model, in such a way that interactions occur only between nearest-neighbours. This structure is realized starting from a k-regular ring and by inserting, in the average, c additional links in such a way that k and c are tuneable parameters for the population architecture. We prove that this system exhibits a transition between regimes of localization (where the final number of stiflers is at most logarithmic in the population size) and propagation (where the final number of stiflers grows algebraically with the population size) at a finite value of the network parameter c. A quantitative estimate for the critical value of c is obtained via extensive numerical simulations.
Loneliness and Social Internet Use: Pathways to Reconnection in a Digital World?
Nowland, Rebecca; Necka, Elizabeth A; Cacioppo, John T
2018-01-01
With the rise of online social networking, social relationships are increasingly developed and maintained in a digital domain. Drawing conclusions about the impact of the digital world on loneliness is difficult because there are contradictory findings, and cross-sectional studies dominate the literature, making causation difficult to establish. In this review, we present our theoretical model and propose that there is a bidirectional and dynamic relationship between loneliness and social Internet use. When the Internet is used as a way station on the route to enhancing existing relationships and forging new social connections, it is a useful tool for reducing loneliness. But when social technologies are used to escape the social world and withdraw from the "social pain" of interaction, feelings of loneliness are increased. We propose that loneliness is also a determinant of how people interact with the digital world. Lonely people express a preference for using the Internet for social interaction and are more likely to use the Internet in a way that displaces time spent in offline social activities. This suggests that lonely people may need support with their social Internet use so that they employ it in a way that enhances existing friendships and/or to forge new ones.
NASA Astrophysics Data System (ADS)
Wei, Xile; Si, Kaili; Yi, Guosheng; Wang, Jiang; Lu, Meili
2016-07-01
In this paper, we use a reduced two-compartment neuron model to investigate the interaction between extracellular subthreshold electric field and synchrony in small world networks. It is observed that network synchronization is closely related to the strength of electric field and geometric properties of the two-compartment model. Specifically, increasing the electric field induces a gradual improvement in network synchrony, while increasing the geometric factor results in an abrupt decrease in synchronization of network. In addition, increasing electric field can make the network become synchronous from asynchronous when the geometric parameter is set to a given value. Furthermore, it is demonstrated that network synchrony can also be affected by the firing frequency and dynamical bifurcation feature of single neuron. These results highlight the effect of weak field on network synchrony from the view of biophysical model, which may contribute to further understanding the effect of electric field on network activity.
Network structure from rich but noisy data
NASA Astrophysics Data System (ADS)
Newman, M. E. J.
2018-06-01
Driven by growing interest across the sciences, a large number of empirical studies have been conducted in recent years of the structure of networks ranging from the Internet and the World Wide Web to biological networks and social networks. The data produced by these experiments are often rich and multimodal, yet at the same time they may contain substantial measurement error1-7. Accurate analysis and understanding of networked systems requires a way of estimating the true structure of networks from such rich but noisy data8-15. Here we describe a technique that allows us to make optimal estimates of network structure from complex data in arbitrary formats, including cases where there may be measurements of many different types, repeated observations, contradictory observations, annotations or metadata, or missing data. We give example applications to two different social networks, one derived from face-to-face interactions and one from self-reported friendships.
Identification of hybrid node and link communities in complex networks
He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong
2015-01-01
Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately. PMID:25728010
Identification of hybrid node and link communities in complex networks.
He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong
2015-03-02
Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.
Identification of hybrid node and link communities in complex networks
NASA Astrophysics Data System (ADS)
He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong
2015-03-01
Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.
Random walks on activity-driven networks with attractiveness
NASA Astrophysics Data System (ADS)
Alessandretti, Laura; Sun, Kaiyuan; Baronchelli, Andrea; Perra, Nicola
2017-05-01
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously distributed. Here, we present a time-varying network model where each node and the dynamical formation of ties are characterized by these two features. We study how these properties affect random-walk processes unfolding on the network when the time scales describing the process and the network evolution are comparable. We derive analytical solutions for the stationary state and the mean first-passage time of the process, and we study cases informed by empirical observations of social networks. Our work shows that previously disregarded properties of real social systems, such as heterogeneous distributions of activity and attractiveness as well as the correlations between them, substantially affect the dynamical process unfolding on the network.
Pollen and spore monitoring in the world.
Buters, J T M; Antunes, C; Galveias, A; Bergmann, K C; Thibaudon, M; Galán, C; Schmidt-Weber, C; Oteros, J
2018-01-01
Ambient air quality monitoring is a governmental duty that is widely carried out in order to detect non-biological ("chemical") components in ambient air, such as particles of < 10 µm (PM 10 , PM 2.5 ), ozone, sulphur dioxide, and nitrogen oxides. These monitoring networks are publicly funded and air quality data are open to the public. The situation for biological particles that have detrimental effects on health, as is the case of pollen and fungal spores, is however very different. Most pollen and spore monitoring networks are not publicly funded and data are not freely available. The information regarding which biological particle is being monitored, where and by whom, is consequently often not known, even by aerobiologists themselves. This is a considerable problem, as local pollen data are an important tool for the prevention of allergic symptoms. The aim of this study was to review pollen monitoring stations throughout the world and to create an interactive visualization of their distribution. The method employed to collect information was based on: (a) a review of the recent and historical bibliography related to pollen and fungal spore monitoring, and (b) personal surveys of the managers of national and regional monitoring networks. The interactive application was developed using the R programming language. We have created an inventory of the active pollen and spore monitoring stations in the world. There are at least 879 active pollen monitoring stations in the world, most of which are in Europe (> 500). The prevalent monitoring method is based on the Hirst principle (> 600 stations). The inventory is visualised as an interactive and on-line map. It can be searched, its appearance can be adjusted to the users' needs and it is updated regularly, as new stations or changes to those that already exist can be submitted online. The map shows the current situation of pollen and spore monitoring and facilitates collaboration among those individuals who are interested in pollen and spore counts. It might also help to improve the monitoring of biological particles up to the current level employed for non-biological components.
Wavelet multiresolution complex network for decoding brain fatigued behavior from P300 signals
NASA Astrophysics Data System (ADS)
Gao, Zhong-Ke; Wang, Zi-Bo; Yang, Yu-Xuan; Li, Shan; Dang, Wei-Dong; Mao, Xiao-Qian
2018-09-01
Brain-computer interface (BCI) enables users to interact with the environment without relying on neural pathways and muscles. P300 based BCI systems have been extensively used to achieve human-machine interaction. However, the appearance of fatigue symptoms during operation process leads to the decline in classification accuracy of P300. Characterizing brain cognitive process underlying normal and fatigue conditions constitutes a problem of vital importance in the field of brain science. We in this paper propose a novel wavelet decomposition based complex network method to efficiently analyze the P300 signals recorded in the image stimulus test based on classical 'Oddball' paradigm. Initially, multichannel EEG signals are decomposed into wavelet coefficient series. Then we construct complex network by treating electrodes as nodes and determining the connections according to the 2-norm distances between wavelet coefficient series. The analysis of topological structure and statistical index indicates that the properties of brain network demonstrate significant distinctions between normal status and fatigue status. More specifically, the brain network reconfiguration in response to the cognitive task in fatigue status is reflected as the enhancement of the small-worldness.
Immunization strategy for epidemic spreading on multilayer networks
NASA Astrophysics Data System (ADS)
Buono, C.; Braunstein, L. A.
2015-01-01
In many real-world complex systems, individuals have many kinds of interactions among them, suggesting that it is necessary to consider a layered-structure framework to model systems such as social interactions. This structure can be captured by multilayer networks and can have major effects on the spreading of process that occurs over them, such as epidemics. In this letter we study a targeted immunization strategy for epidemic spreading over a multilayer network. We apply the strategy in one of the layers and study its effect in all layers of the network disregarding degree-degree correlation among layers. We found that the targeted strategy is not as efficient as in isolated networks, due to the fact that in order to stop the spreading of the disease it is necessary to immunize more than 80% of the individuals. However, the size of the epidemic is drastically reduced in the layer where the immunization strategy is applied compared to the case with no mitigation strategy. Thus, the immunization strategy has a major effect on the layer were it is applied, but does not efficiently protect the individuals of other layers.
Properties of four real world collaboration--competition networks
NASA Astrophysics Data System (ADS)
Fu, Chun-Hua; Xu, Xiu-Lian; He, Da-Ren
2009-03-01
Our research group has empirically investigated 9 real world collaboration networks and 25 real world cooperation-competition networks. Among the 34 real world systems, all the 9 real world collaboration networks and 6 real world cooperation-competition networks show the unimodal act-size distribution and the shifted power law distribution of degree and act-degree. We have proposed a collaboration network evolution model for an explanation of the rules [1]. The other 14 real world cooperation-competition networks show that the act-size distributions are not unimodal; instead, they take qualitatively the same shifted power law forms as the degree and act-degree distributions. The properties of four systems (the main land movie film network, Beijing restaurant network, 2004 Olympic network, and Tao-Bao notebook computer sale network) are reported in detail as examples. Via a numerical simulation, we show that the new rule can still be explained by the above-mentioned model. [1] H. Chang, B. B. Su, et al. Phsica A, 2007, 383: 687-702.
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.
Blacklock, Kristin; Verkhivker, Gennady M.
2014-01-01
The fundamental role of the Hsp90 chaperone in supporting functional activity of diverse protein clients is anchored by specific cochaperones. A family of immune sensing client proteins is delivered to the Hsp90 system with the aid of cochaperones Sgt1 and Rar1 that act cooperatively with Hsp90 to form allosterically regulated dynamic complexes. In this work, functional dynamics and protein structure network modeling are combined to dissect molecular mechanisms of Hsp90 regulation by the client recruiter cochaperones. Dynamic signatures of the Hsp90-cochaperone complexes are manifested in differential modulation of the conformational mobility in the Hsp90 lid motif. Consistent with the experiments, we have determined that targeted reorganization of the lid dynamics is a unifying characteristic of the client recruiter cochaperones. Protein network analysis of the essential conformational space of the Hsp90-cochaperone motions has identified structurally stable interaction communities, interfacial hubs and key mediating residues of allosteric communication pathways that act concertedly with the shifts in conformational equilibrium. The results have shown that client recruiter cochaperones can orchestrate global changes in the dynamics and stability of the interaction networks that could enhance the ATPase activity and assist in the client recruitment. The network analysis has recapitulated a broad range of structural and mutagenesis experiments, particularly clarifying the elusive role of Rar1 as a regulator of the Hsp90 interactions and a stability enhancer of the Hsp90-cochaperone complexes. Small-world organization of the interaction networks in the Hsp90 regulatory complexes gives rise to a strong correspondence between highly connected local interfacial hubs, global mediator residues of allosteric interactions and key functional hot spots of the Hsp90 activity. We have found that cochaperone-induced conformational changes in Hsp90 may be determined by specific interaction networks that can inhibit or promote progression of the ATPase cycle and thus control the recruitment of client proteins. PMID:24466147
Blacklock, Kristin; Verkhivker, Gennady M
2014-01-01
The fundamental role of the Hsp90 chaperone in supporting functional activity of diverse protein clients is anchored by specific cochaperones. A family of immune sensing client proteins is delivered to the Hsp90 system with the aid of cochaperones Sgt1 and Rar1 that act cooperatively with Hsp90 to form allosterically regulated dynamic complexes. In this work, functional dynamics and protein structure network modeling are combined to dissect molecular mechanisms of Hsp90 regulation by the client recruiter cochaperones. Dynamic signatures of the Hsp90-cochaperone complexes are manifested in differential modulation of the conformational mobility in the Hsp90 lid motif. Consistent with the experiments, we have determined that targeted reorganization of the lid dynamics is a unifying characteristic of the client recruiter cochaperones. Protein network analysis of the essential conformational space of the Hsp90-cochaperone motions has identified structurally stable interaction communities, interfacial hubs and key mediating residues of allosteric communication pathways that act concertedly with the shifts in conformational equilibrium. The results have shown that client recruiter cochaperones can orchestrate global changes in the dynamics and stability of the interaction networks that could enhance the ATPase activity and assist in the client recruitment. The network analysis has recapitulated a broad range of structural and mutagenesis experiments, particularly clarifying the elusive role of Rar1 as a regulator of the Hsp90 interactions and a stability enhancer of the Hsp90-cochaperone complexes. Small-world organization of the interaction networks in the Hsp90 regulatory complexes gives rise to a strong correspondence between highly connected local interfacial hubs, global mediator residues of allosteric interactions and key functional hot spots of the Hsp90 activity. We have found that cochaperone-induced conformational changes in Hsp90 may be determined by specific interaction networks that can inhibit or promote progression of the ATPase cycle and thus control the recruitment of client proteins.
Voss, Michelle W; Prakash, Ruchika Shaurya; Erickson, Kirk I; Boot, Walter R; Basak, Chandramallika; Neider, Mark B; Simons, Daniel J; Fabiani, Monica; Gratton, Gabriele; Kramer, Arthur F
2012-01-02
We used the Space Fortress videogame, originally developed by cognitive psychologists to study skill acquisition, as a platform to examine learning-induced plasticity of interacting brain networks. Novice videogame players learned Space Fortress using one of two training strategies: (a) focus on all aspects of the game during learning (fixed priority), or (b) focus on improving separate game components in the context of the whole game (variable priority). Participants were scanned during game play using functional magnetic resonance imaging (fMRI), both before and after 20 h of training. As expected, variable priority training enhanced learning, particularly for individuals who initially performed poorly. Functional connectivity analysis revealed changes in brain network interaction reflective of more flexible skill learning and retrieval with variable priority training, compared to procedural learning and skill implementation with fixed priority training. These results provide the first evidence for differences in the interaction of large-scale brain networks when learning with different training strategies. Our approach and findings also provide a foundation for exploring the brain plasticity involved in transfer of trained abilities to novel real-world tasks such as driving, sport, or neurorehabilitation. Copyright © 2011 Elsevier Inc. All rights reserved.
Hack-proof Synchronization Protocol for Multi-player Online Games
NASA Astrophysics Data System (ADS)
Fung, Yeung Siu; Lui, John C. S.
Modern multi-player online games are popular and attractive because they provide a sense of virtual world experience to users: players can interact with each other on the Internet but perceive a local area network responsiveness. To make this possible, most modern multi-player online games use similar networking architecture that aims to hide the effects of network latency, packet loss, and high variance of delay from players. Because real-time interactivity is a crucial feature from a player's point of view, any delay perceived by a player can affect his/her performance [16]. Therefore, the game client must be able to run and accept new user commands continuously regardless of the condition of the underlying communication channel, and that it will not stop responding because of waiting for update packets from other players. To make this possible, multi-player online games typically use protocols based on "dead-reckoning" [5, 6, 9] which allows loose synchronization between players.
Mapping the ecological networks of microbial communities.
Xiao, Yandong; Angulo, Marco Tulio; Friedman, Jonathan; Waldor, Matthew K; Weiss, Scott T; Liu, Yang-Yu
2017-12-11
Mapping the ecological networks of microbial communities is a necessary step toward understanding their assembly rules and predicting their temporal behavior. However, existing methods require assuming a particular population dynamics model, which is not known a priori. Moreover, those methods require fitting longitudinal abundance data, which are often not informative enough for reliable inference. To overcome these limitations, here we develop a new method based on steady-state abundance data. Our method can infer the network topology and inter-taxa interaction types without assuming any particular population dynamics model. Additionally, when the population dynamics is assumed to follow the classic Generalized Lotka-Volterra model, our method can infer the inter-taxa interaction strengths and intrinsic growth rates. We systematically validate our method using simulated data, and then apply it to four experimental data sets. Our method represents a key step towards reliable modeling of complex, real-world microbial communities, such as the human gut microbiota.
Luongo, Francisco J.; Zimmerman, Chris A.; Horn, Meryl E.
2016-01-01
Sequential patterns of prefrontal activity are believed to mediate important behaviors, e.g., working memory, but it remains unclear exactly how they are generated. In accordance with previous studies of cortical circuits, we found that prefrontal microcircuits in young adult mice spontaneously generate many more stereotyped sequences of activity than expected by chance. However, the key question of whether these sequences depend on a specific functional organization within the cortical microcircuit, or emerge simply as a by-product of random interactions between neurons, remains unanswered. We observed that correlations between prefrontal neurons do follow a specific functional organization—they have a small-world topology. However, until now it has not been possible to directly link small-world topologies to specific circuit functions, e.g., sequence generation. Therefore, we developed a novel analysis to address this issue. Specifically, we constructed surrogate data sets that have identical levels of network activity at every point in time but nevertheless represent various network topologies. We call this method shuffling activity to rearrange correlations (SHARC). We found that only surrogate data sets based on the actual small-world functional organization of prefrontal microcircuits were able to reproduce the levels of sequences observed in actual data. As expected, small-world data sets contained many more sequences than surrogate data sets with randomly arranged correlations. Surprisingly, small-world data sets also outperformed data sets in which correlations were maximally clustered. Thus the small-world functional organization of cortical microcircuits, which effectively balances the random and maximally clustered regimes, is optimal for producing stereotyped sequential patterns of activity. PMID:26888108
Kentzoglanakis, Kyriakos; Poole, Matthew
2012-01-01
In this paper, we investigate the problem of reverse engineering the topology of gene regulatory networks from temporal gene expression data. We adopt a computational intelligence approach comprising swarm intelligence techniques, namely particle swarm optimization (PSO) and ant colony optimization (ACO). In addition, the recurrent neural network (RNN) formalism is employed for modeling the dynamical behavior of gene regulatory systems. More specifically, ACO is used for searching the discrete space of network architectures and PSO for searching the corresponding continuous space of RNN model parameters. We propose a novel solution construction process in the context of ACO for generating biologically plausible candidate architectures. The objective is to concentrate the search effort into areas of the structure space that contain architectures which are feasible in terms of their topological resemblance to real-world networks. The proposed framework is initially applied to the reconstruction of a small artificial network that has previously been studied in the context of gene network reverse engineering. Subsequently, we consider an artificial data set with added noise for reconstructing a subnetwork of the genetic interaction network of S. cerevisiae (yeast). Finally, the framework is applied to a real-world data set for reverse engineering the SOS response system of the bacterium Escherichia coli. Results demonstrate the relative advantage of utilizing problem-specific knowledge regarding biologically plausible structural properties of gene networks over conducting a problem-agnostic search in the vast space of network architectures.
Teacher and Student Reflections on ICT-Rich Science Inquiry
ERIC Educational Resources Information Center
Williams, P. John; Otrel-Cass, Kathrin
2017-01-01
Background: Inquiry learning in science provides authentic and relevant contexts in which students can create knowledge to solve problems, make decisions and find solutions to issues in today's world. The use of electronic networks can facilitate this interaction, dialogue and sharing, and adds a new dimension to classroom pedagogy. Purpose: This…
Development and Validation of the Perception of Students towards Online Learning (POSTOL)
ERIC Educational Resources Information Center
Bhagat, Kaushal Kumar; Wu, Leon Yufeng; Chang, Chun-Yen
2016-01-01
In the twenty-first century, online learning has evolved as a worldwide platform to connect, collaborate and engage users in the learning process. Online learning today is integrated with social network connectivity, which builds an ecosystem for interaction between students, teachers, and professors from every corner of the world, providing them…
A Theory for Educational Research: Socialisation Theory and Symbolic Interaction
ERIC Educational Resources Information Center
Potts, Anthony
2015-01-01
This article develops a theory of socialisation based on the Chicago School of symbolic interactionism but infused with new and important insights offered by contemporary scholars and their writings on roles and relationships in the twenty first century and life in the informational, network and global world. While still rooted in the seminal…
Cyberbullying Prevention and Response: Expert Perspectives
ERIC Educational Resources Information Center
Patchin, Justin W., Ed.; Hinduja, Sameer, Ed.
2011-01-01
Just as the previous generation was raised in front of televisions, adolescents at the turn of the 21st century are being raised in an internet-enabled world where blogs, social networking, and instant messaging are competing with face-to-face and telephone communication as the dominant means through which personal interaction takes place.…
Spatiality and the Place of the Material in Schools
ERIC Educational Resources Information Center
McGregor, Jane
2004-01-01
Drawing on a research study into the spatiality of teachers' workplaces, this article explores the "concrete realities" of the artefact-filled world with which teachers, support staff and students interact, and considers the way in which networks of people and things order the spaces of the school. Spatiality is examined explicitly in…
Digital Leisure and Perceived Family Functioning in Youth of Upper Secondary Education
ERIC Educational Resources Information Center
Valdemoros-San-Emeterio, M-Angeles; Sanz-Arazuri, Eva; Ponce-de-León-Elizondo, Ana
2017-01-01
The "Network Society" is identified by accelerated changes that occur between real and virtual worlds. The progress of digital devices has generated a new model of leisure that has conditioned family interactions. The aim of this research was to identify the relationship between digital leisure experiences and perceived family…
Provenance-Based Approaches to Semantic Web Service Discovery and Usage
ERIC Educational Resources Information Center
Narock, Thomas William
2012-01-01
The World Wide Web Consortium defines a Web Service as "a software system designed to support interoperable machine-to-machine interaction over a network." Web Services have become increasingly important both within and across organizational boundaries. With the recent advent of the Semantic Web, web services have evolved into semantic…
Considering Materiality in Educational Policy: Messy Objects and Multiple Reals
ERIC Educational Resources Information Center
Fenwick, Tara; Edwards, Richard
2011-01-01
Educational analysts need new ways to engage with policy processes in a networked world of complex transnational connections. In this discussion, Tara Fenwick and Richard Edwards argue for a greater focus on materiality in educational policy as a way to trace the heterogeneous interactions and precarious linkages that enact policy as complex…
Inferring monopartite projections of bipartite networks: an entropy-based approach
NASA Astrophysics Data System (ADS)
Saracco, Fabio; Straka, Mika J.; Di Clemente, Riccardo; Gabrielli, Andrea; Caldarelli, Guido; Squartini, Tiziano
2017-05-01
Bipartite networks are currently regarded as providing a major insight into the organization of many real-world systems, unveiling the mechanisms driving the interactions occurring between distinct groups of nodes. One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves as much as possible the information encoded into the original bipartite structure. In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, according to which any two nodes sharing a statistically-significant number of neighbors are linked. Since assessing the statistical significance of nodes similarity requires a proper statistical benchmark, here we consider a set of four null models, defined within the exponential random graph framework. Our algorithm outputs a matrix of link-specific p-values, from which a validated projection is straightforwardly obtainable, upon running a multiple hypothesis testing procedure. Finally, we test our method on an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. MovieLens, collecting the users’ ratings of a list of movies). In both cases non-trivial communities are detected: while projecting the World Trade Web on the countries layer reveals modules of similarly-industrialized nations, projecting it on the products layer allows communities characterized by an increasing level of complexity to be detected; in the second case, projecting MovieLens on the films layer allows clusters of movies whose affinity cannot be fully accounted for by genre similarity to be individuated.
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.
ClueNet: Clustering a temporal network based on topological similarity rather than denseness.
Crawford, Joseph; Milenković, Tijana
2018-01-01
Network clustering is a very popular topic in the network science field. Its goal is to divide (partition) the network into groups (clusters or communities) of "topologically related" nodes, where the resulting topology-based clusters are expected to "correlate" well with node label information, i.e., metadata, such as cellular functions of genes/proteins in biological networks, or age or gender of people in social networks. Even for static data, the problem of network clustering is complex. For dynamic data, the problem is even more complex, due to an additional dimension of the data-their temporal (evolving) nature. Since the problem is computationally intractable, heuristic approaches need to be sought. Existing approaches for dynamic network clustering (DNC) have drawbacks. First, they assume that nodes should be in the same cluster if they are densely interconnected within the network. We hypothesize that in some applications, it might be of interest to cluster nodes that are topologically similar to each other instead of or in addition to requiring the nodes to be densely interconnected. Second, they ignore temporal information in their early steps, and when they do consider this information later on, they do so implicitly. We hypothesize that capturing temporal information earlier in the clustering process and doing so explicitly will improve results. We test these two hypotheses via our new approach called ClueNet. We evaluate ClueNet against six existing DNC methods on both social networks capturing evolving interactions between individuals (such as interactions between students in a high school) and biological networks capturing interactions between biomolecules in the cell at different ages. We find that ClueNet is superior in over 83% of all evaluation tests. As more real-world dynamic data are becoming available, DNC and thus ClueNet will only continue to gain importance.
Semantic web for integrated network analysis in biomedicine.
Chen, Huajun; Ding, Li; Wu, Zhaohui; Yu, Tong; Dhanapalan, Lavanya; Chen, Jake Y
2009-03-01
The Semantic Web technology enables integration of heterogeneous data on the World Wide Web by making the semantics of data explicit through formal ontologies. In this article, we survey the feasibility and state of the art of utilizing the Semantic Web technology to represent, integrate and analyze the knowledge in various biomedical networks. We introduce a new conceptual framework, semantic graph mining, to enable researchers to integrate graph mining with ontology reasoning in network data analysis. Through four case studies, we demonstrate how semantic graph mining can be applied to the analysis of disease-causal genes, Gene Ontology category cross-talks, drug efficacy analysis and herb-drug interactions analysis.
A Markov chain model for image ranking system in social networks
NASA Astrophysics Data System (ADS)
Zin, Thi Thi; Tin, Pyke; Toriu, Takashi; Hama, Hiromitsu
2014-03-01
In today world, different kinds of networks such as social, technological, business and etc. exist. All of the networks are similar in terms of distributions, continuously growing and expanding in large scale. Among them, many social networks such as Facebook, Twitter, Flickr and many others provides a powerful abstraction of the structure and dynamics of diverse kinds of inter personal connection and interaction. Generally, the social network contents are created and consumed by the influences of all different social navigation paths that lead to the contents. Therefore, identifying important and user relevant refined structures such as visual information or communities become major factors in modern decision making world. Moreover, the traditional method of information ranking systems cannot be successful due to their lack of taking into account the properties of navigation paths driven by social connections. In this paper, we propose a novel image ranking system in social networks by using the social data relational graphs from social media platform jointly with visual data to improve the relevance between returned images and user intentions (i.e., social relevance). Specifically, we propose a Markov chain based Social-Visual Ranking algorithm by taking social relevance into account. By using some extensive experiments, we demonstrated the significant and effectiveness of the proposed social-visual ranking method.
Investigation of a protein complex network
NASA Astrophysics Data System (ADS)
Mashaghi, A. R.; Ramezanpour, A.; Karimipour, V.
2004-09-01
The budding yeast Saccharomyces cerevisiae is the first eukaryote whose genome has been completely sequenced. It is also the first eukaryotic cell whose proteome (the set of all proteins) and interactome (the network of all mutual interactions between proteins) has been analyzed. In this paper we study the structure of the yeast protein complex network in which weighted edges between complexes represent the number of shared proteins. It is found that the network of protein complexes is a small world network with scale free behavior for many of its distributions. However we find that there are no strong correlations between the weights and degrees of neighboring complexes. To reveal non-random features of the network we also compare it with a null model in which the complexes randomly select their proteins. Finally we propose a simple evolutionary model based on duplication and divergence of proteins.
Identifying and tracking dynamic processes in social networks
NASA Astrophysics Data System (ADS)
Chung, Wayne; Savell, Robert; Schütt, Jan-Peter; Cybenko, George
2006-05-01
The detection and tracking of embedded malicious subnets in an active social network can be computationally daunting due to the quantity of transactional data generated in the natural interaction of large numbers of actors comprising a network. In addition, detection of illicit behavior may be further complicated by evasive strategies designed to camouflage the activities of the covert subnet. In this work, we move beyond traditional static methods of social network analysis to develop a set of dynamic process models which encode various modes of behavior in active social networks. These models will serve as the basis for a new application of the Process Query System (PQS) to the identification and tracking of covert dynamic processes in social networks. We present a preliminary result from application of our technique in a real-world data stream-- the Enron email corpus.
[HyperPsych--resources for medicine and psychology on the World Wide Web].
Laszig, P
1997-07-01
Progress in the research of interactive communication technology and the acceleration of processing and transmitting information have promoted the development of computer networks allowing global access to scientific information and services. The recently most well-known net is the internet. Based on its integrative structure as a communication-directed as well as an information-directed medium, the internet helps researchers design scientific research. Especially medicine and psychology as information-dependent scientific disciplines may profit by using this technological offer. As a method to coordinate to the vast amount of medical and psychological data around the globe and to communicate with researchers world-wide, it enhances innovative possibilities for research, diagnosis and therapy. Currently, the World Wide Web is regarded as the most user-friendly and practical of all the internet resources. Based on a systematic introduction to the applications of the WWW, this article discusses relevant resources, points out possibilities and limits of network-supported scientific research and proposes many uses of this new medium.
Simulating market dynamics: interactions between consumer psychology and social networks.
Janssen, Marco A; Jager, Wander
2003-01-01
Markets can show different types of dynamics, from quiet markets dominated by one or a few products, to markets with continual penetration of new and reintroduced products. In a previous article we explored the dynamics of markets from a psychological perspective using a multi-agent simulation model. The main results indicated that the behavioral rules dominating the artificial consumer's decision making determine the resulting market dynamics, such as fashions, lock-in, and unstable renewal. Results also show the importance of psychological variables like social networks, preferences, and the need for identity to explain the dynamics of markets. In this article we extend this work in two directions. First, we will focus on a more systematic investigation of the effects of different network structures. The previous article was based on Watts and Strogatz's approach, which describes the small-world and clustering characteristics in networks. More recent research demonstrated that many large networks display a scale-free power-law distribution for node connectivity. In terms of market dynamics this may imply that a small proportion of consumers may have an exceptional influence on the consumptive behavior of others (hubs, or early adapters). We show that market dynamics is a self-organized property depending on the interaction between the agents' decision-making process (heuristics), the product characteristics (degree of satisfaction of unit of consumption, visibility), and the structure of interactions between agents (size of network and hubs in a social network).
Odyssey of a community psychologist practitioner.
Swift, Carolyn F
2008-01-01
Carolyn Swift has pioneered new professional roles in unconventional settings, including a Midwestern city hall and an interactive TV network. Her career-long interest in the prevention of rape began when she learned of the sexual abuse of adolescent males in the city's jail, and projected the long-term implications of such abuse for reducing its incidence in future generations. She explored the use of QUBE, an experimental interactive TV network, as a platform for teaching prosocial behavior to children-a preliminary step in violence prevention. Empowering women and men in relationships was a theme throughout her career. Her life path reflects her challenge as an early feminist-to combine a devotion to family with a passion to build a more just world.
Yoon, Sunmoo
2017-01-01
Background Twitter can address the mental health challenges of dementia care. The aims of this study is to explore the contents and user interactions of tweets mentioning dementia to gain insights for dementia care. Methods We collected 35,260 tweets mentioning Alzheimer’s or dementia on World Alzheimer’s Day, September 21st in 2015. Topic modeling and social network analysis were applied to uncover content and structure of user communication. Results Global users generated keywords related to mental health and care including #psychology and #mental health. There were similarities and differences between the UK and the US in tweet content. The macro-level analysis uncovered substantial public interest on dementia. The meso-level network analysis revealed that top leaders of communities were spiritual organizations and traditional media. Conclusions The application of topic modeling and multi-level network analysis while incorporating visualization techniques can promote a global level understanding regarding public attention, interests, and insights regarding dementia care and mental health. PMID:27803262
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 P 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 P = 1.0 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 P 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.
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
Critical tipping point distinguishing two types of transitions in modular network structures
NASA Astrophysics Data System (ADS)
Shai, Saray; Kenett, Dror Y.; Kenett, Yoed N.; Faust, Miriam; Dobson, Simon; Havlin, Shlomo
2015-12-01
Modularity is a key organizing principle in real-world large-scale complex networks. The relatively sparse interactions between modules are critical to the functionality of the system and are often the first to fail. We model such failures as site percolation targeting interconnected nodes, those connecting between modules. We find, using percolation theory and simulations, that they lead to a "tipping point" between two distinct regimes. In one regime, removal of interconnected nodes fragments the modules internally and causes the system to collapse. In contrast, in the other regime, while only attacking a small fraction of nodes, the modules remain but become disconnected, breaking the entire system. We show that networks with broader degree distribution might be highly vulnerable to such attacks since only few nodes are needed to interconnect the modules, consequently putting the entire system at high risk. Our model has the potential to shed light on many real-world phenomena, and we briefly consider its implications on recent advances in the understanding of several neurocognitive processes and diseases.
Visual analysis and exploration of complex corporate shareholder networks
NASA Astrophysics Data System (ADS)
Tekušová, Tatiana; Kohlhammer, Jörn
2008-01-01
The analysis of large corporate shareholder network structures is an important task in corporate governance, in financing, and in financial investment domains. In a modern economy, large structures of cross-corporation, cross-border shareholder relationships exist, forming complex networks. These networks are often difficult to analyze with traditional approaches. An efficient visualization of the networks helps to reveal the interdependent shareholding formations and the controlling patterns. In this paper, we propose an effective visualization tool that supports the financial analyst in understanding complex shareholding networks. We develop an interactive visual analysis system by combining state-of-the-art visualization technologies with economic analysis methods. Our system is capable to reveal patterns in large corporate shareholder networks, allows the visual identification of the ultimate shareholders, and supports the visual analysis of integrated cash flow and control rights. We apply our system on an extensive real-world database of shareholder relationships, showing its usefulness for effective visual analysis.
Are the users of social networking sites homogeneous? A cross-cultural study.
Alarcón-Del-Amo, María-Del-Carmen; Gómez-Borja, Miguel-Ángel; Lorenzo-Romero, Carlota
2015-01-01
The growing use of Social Networking Sites (SNS) around the world has made it necessary to understand individuals' behaviors within these sites according to different cultures. Based on a comparative study between two different European countries (The Netherlands versus Spain), a comparison of typologies of networked Internet users has been obtained through a latent segmentation approach. These typologies are based on the frequency with which users perform different activities, their socio-demographic variables, and experience in social networking and interaction patterns. The findings show new insights regarding international segmentation in order to analyse SNS user behaviors in both countries. These results are relevant for marketing strategists eager to use the communication potential of networked individuals and for marketers willing to explore the potential of online networking as a low cost and a highly efficient alternative to traditional networking approaches. For most businesses, expert users could be valuable opinion leaders and potential brand influencers.
Are the users of social networking sites homogeneous? A cross-cultural study
Alarcón-del-Amo, María-del-Carmen; Gómez-Borja, Miguel-Ángel; Lorenzo-Romero, Carlota
2015-01-01
The growing use of Social Networking Sites (SNS) around the world has made it necessary to understand individuals' behaviors within these sites according to different cultures. Based on a comparative study between two different European countries (The Netherlands versus Spain), a comparison of typologies of networked Internet users has been obtained through a latent segmentation approach. These typologies are based on the frequency with which users perform different activities, their socio-demographic variables, and experience in social networking and interaction patterns. The findings show new insights regarding international segmentation in order to analyse SNS user behaviors in both countries. These results are relevant for marketing strategists eager to use the communication potential of networked individuals and for marketers willing to explore the potential of online networking as a low cost and a highly efficient alternative to traditional networking approaches. For most businesses, expert users could be valuable opinion leaders and potential brand influencers. PMID:26321971
Modelling indirect interactions during failure spreading in a project activity network.
Ellinas, Christos
2018-03-12
Spreading broadly refers to the notion of an entity propagating throughout a networked system via its interacting components. Evidence of its ubiquity and severity can be seen in a range of phenomena, from disease epidemics to financial systemic risk. In order to understand the dynamics of these critical phenomena, computational models map the probability of propagation as a function of direct exposure, typically in the form of pairwise interactions between components. By doing so, the important role of indirect interactions remains unexplored. In response, we develop a simple model that accounts for the effect of both direct and subsequent exposure, which we deploy in the novel context of failure propagation within a real-world engineering project. We show that subsequent exposure has a significant effect in key aspects, including the: (a) final spreading event size, (b) propagation rate, and (c) spreading event structure. In addition, we demonstrate the existence of 'hidden influentials' in large-scale spreading events, and evaluate the role of direct and subsequent exposure in their emergence. Given the evidence of the importance of subsequent exposure, our findings offer new insight on particular aspects that need to be included when modelling network dynamics in general, and spreading processes specifically.
NASA Astrophysics Data System (ADS)
Lay, Erin Hoffmann
In this dissertation, the capabilities of the World-Wide Lightning Location Network (WWLLN) are analyzed in order to study the interactions of lightning energy with the lower ionosphere. WWLLN is the first global ground-based lightning location network and the first lightning detection network that continuously monitors lightning around the world in real time. For this reason, a better characterization of the WWLLN could allow many global atmospheric science problems to be addressed, including further investigation into the global electric circuit and global mapping of regions of the lower ionosphere likely to be impacted by strong lightning and transient luminous events. This dissertation characterizes the World-Wide Location Network (WWLLN) in terms of detection efficiency, location and timing accuracy, and lightning type. This investigation finds excellent timing and location accuracy for WWLLN. It provides the first experimentally-determined estimate of relative global detection efficiency that is used to normalize lightning counts based on location. These normalized global lightning data from the WWLLN are used to map intense storm regions around the world with high time and spatial resolution as well as to provide information on energetic emissions known as elves and terrestrial gamma-ray flashes (TGFs). This dissertation also improves WWLLN by developing a procedure to provide the first estimate of relative lightning stroke radiated energy in the 1-24 kHz frequency range by a global lightning detection network. These characterizations and improvements to WWLLN are motivated by the desire to use WWLLN data to address the problem of lightning-to-ionosphere energy coupling. Therefore, WWLLN stroke rates are used as input to a model, developed by Professor Mengu Cho at the Kyushu Institute of Technology in Japan, that describes the non-linear effect of lightning electromagnetic pulses (EMP) on the ionosphere by accumulating electron density changes resulting from the interaction of the EMP of ten successive lightning strokes with the lower ionosphere. Further studies must be completed to narrow uncertainties in the model, but the qualitative ionospheric response to successive EMPs is presented. Results from this study show that the non-linear effect of lightning EMP due to successive lightning strokes must be taken into account, and varies with altitude, such that the most significant electron density enhancement occurs at 88 km altitude.
Lv, Jun; Liu, Dongdong; Ma, Jing; Wang, Xiaoying; Zhang, Jue
2015-01-01
Functional brain networks of human have been revealed to have small-world properties by both analyzing electroencephalogram (EEG) and functional magnetic resonance imaging (fMRI) time series. In our study, by using graph theoretical analysis, we attempted to investigate the changes of paralimbic-limbic cortex between wake and sleep states. Ten healthy young people were recruited to our experiment. Data from 2 subjects were excluded for the reason that they had not fallen asleep during the experiment. For each subject, blood oxygen level dependency (BOLD) images were acquired to analyze brain network, and peripheral pulse signals were obtained continuously to identify if the subject was in sleep periods. Results of fMRI showed that brain networks exhibited stronger small-world characteristics during sleep state as compared to wake state, which was in consistent with previous studies using EEG synchronization. Moreover, we observed that compared with wake state, paralimbic-limbic cortex had less connectivity with neocortical system and centrencephalic structure in sleep. In conclusion, this is the first study, to our knowledge, has observed that small-world properties of brain functional networks altered when human sleeps without EEG synchronization. Moreover, we speculate that paralimbic-limbic cortex organization owns an efficient defense mechanism responsible for suppressing the external environment interference when humans sleep, which is consistent with the hypothesis that the paralimbic-limbic cortex may be functionally disconnected from brain regions which directly mediate their interactions with the external environment. Our findings also provide a reasonable explanation why stable sleep exhibits homeostasis which is far less susceptible to outside world.
Social interaction and pain: An arctic expedition.
Block, Per; Heathcote, Lauren C; Burnett Heyes, Stephanie
2018-01-01
Complex human behaviour can only be understood within its social environment. However, disentangling the causal links between individual outcomes and social network position is empirically challenging. We present a research design in a closed real-world setting with high-resolution temporal data to understand this interplay within a fundamental human experience - physical pain. Study participants completed an isolated 3-week hiking expedition in the Arctic Circle during which they were subject to the same variation in environmental conditions and only interacted amongst themselves. Adolescents provided daily ratings of pain and social interaction partners. Using longitudinal network models, we analyze the interplay between social network position and the experience of pain. Specifically, we test whether experiencing pain is linked to decreasing popularity (increasing isolation), whether adolescents prefer to interact with others experiencing similar pain (homophily), and whether participants are increasingly likely to report similar pain as their interaction partners (contagion). We find that reporting pain is associated with decreasing popularity - interestingly, this effect holds for males only. Further exploratory analyses suggest this is at least partly driven by males withdrawing from contact with females when in pain, enhancing our understanding of pain and masculinity. Contrary to recent experimental and clinical studies, we found no evidence of pain homophily or contagion in the expedition group. Copyright © 2018 Elsevier Ltd. All rights reserved.
Modelling the role of national system of innovation in economical differentiation
NASA Astrophysics Data System (ADS)
Ruiz, Ricardo M.; Albuquerque, Eduardo; Ribeiro, Leonardo C.; Bernardes, Américo T.
2005-07-01
Nowadays it is well accepted that science and technology has a fundamental role in the economic development (GNP per capita) of any country. Aiming to study this role, we introduce a model that creates an artificial world economy that is a network of countries. Each country has its own national system of innovation (represented by a technological parameter). The interactions among the countries are given by functions that connect their prices, demands and incomes. Starting from random values, the artificial world economy self-organize itself and create hierarchies of countries.
Let's chat: developmental neural bases of social motivation during real-time peer interaction.
Warnell, Katherine Rice; Sadikova, Eleonora; Redcay, Elizabeth
2018-05-01
Humans are motivated to interact with each other, but the neural bases of social motivation have been predominantly examined in non-interactive contexts. Understanding real-world social motivation is of special importance during middle childhood (ages 8-12), a period when social skills improve, social networks grow, and social brain networks specialize. To assess interactive social motivation, the current study used a novel fMRI paradigm in which children believed they were chatting with a peer. The design targeted two phases of interaction: (1) Initiation, in which children engaged in a social bid via sharing a like or hobby, and (2) Reply, in which children received either an engaged ("Me too") or non-engaged ("I'm away") reply from the peer. On control trials, children were told that their answers were not shared and that they would receive either engaged ("Matched") or non-engaged ("Disconnected") replies from the computer. Results indicated that during Initiation and Reply, key components of reward circuitry (e.g., ventral striatum) were more active for the peer than the computer trials. In addition, during Reply, social cognitive regions were more activated by the peer, and this social cognitive specialization increased with age. Finally, the effect of engagement type on reward circuitry activation was larger for social than non-social trials, indicating developmental sensitivity to social contingency. These findings demonstrate that both reward and social cognitive brain systems support real-time social interaction in middle childhood. An interactive approach to understanding social reward has implications for clinical disorders, where social motivation is more affected in real-world contexts. © 2017 John Wiley & Sons Ltd.
[Dynamics and interactions between the university community and public health 2.0].
Rodríguez-Gómez, Rodolfo
2016-01-01
To explore the experiences of a group of participants in a university community with the web in general and with digital contents on public health, to describe their motivations and to understand how social networks influence their interaction with content on public health. Qualitative research. Deep semi-structured interviews were conducted to understand the phenomenon. Five categories emerged after the study: socialization and internalization of the cyberculture, social marketing linked to the web and public health, culture of fear and distrust, the concept of health, and the health system and public health. Participants have internalized the web and have given it a strong symbolic capital. The challenges of public health 2.0 are not only to achieve interaction with users and to get a place in cyberspace, but also to fight against the stigma of the "public" and to take advantage of the influence of the web on small-world networks to communicate.
The Laplacian spectrum of neural networks
de Lange, Siemon C.; de Reus, Marcel A.; van den Heuvel, Martijn P.
2014-01-01
The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks. Many popular graph metrics, however, encode average properties of individual network elements. Complementing these “conventional” graph metrics, the eigenvalue spectrum of the normalized Laplacian describes a network's structure directly at a systems level, without referring to individual nodes or connections. In this paper, the Laplacian spectra of the macroscopic anatomical neuronal networks of the macaque and cat, and the microscopic network of the Caenorhabditis elegans were examined. Consistent with conventional graph metrics, analysis of the Laplacian spectra revealed an integrative community structure in neural brain networks. Extending previous findings of overlap of network attributes across species, similarity of the Laplacian spectra across the cat, macaque and C. elegans neural networks suggests a certain level of consistency in the overall architecture of the anatomical neural networks of these species. Our results further suggest a specific network class for neural networks, distinct from conceptual small-world and scale-free models as well as several empirical networks. PMID:24454286
Temporal efficiency evaluation and small-worldness characterization in temporal networks
Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu
2016-01-01
Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks. PMID:27682314
Temporal efficiency evaluation and small-worldness characterization in temporal networks
NASA Astrophysics Data System (ADS)
Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu
2016-09-01
Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks.
Wu, Kai; Liu, Jing; Wang, Shuai
2016-01-01
Evolutionary games (EG) model a common type of interactions in various complex, networked, natural and social systems. Given such a system with only profit sequences being available, reconstructing the interacting structure of EG networks is fundamental to understand and control its collective dynamics. Existing approaches used to handle this problem, such as the lasso, a convex optimization method, need a user-defined constant to control the tradeoff between the natural sparsity of networks and measurement error (the difference between observed data and simulated data). However, a shortcoming of these approaches is that it is not easy to determine these key parameters which can maximize the performance. In contrast to these approaches, we first model the EG network reconstruction problem as a multiobjective optimization problem (MOP), and then develop a framework which involves multiobjective evolutionary algorithm (MOEA), followed by solution selection based on knee regions, termed as MOEANet, to solve this MOP. We also design an effective initialization operator based on the lasso for MOEA. We apply the proposed method to reconstruct various types of synthetic and real-world networks, and the results show that our approach is effective to avoid the above parameter selecting problem and can reconstruct EG networks with high accuracy. PMID:27886244
NASA Astrophysics Data System (ADS)
Wu, Kai; Liu, Jing; Wang, Shuai
2016-11-01
Evolutionary games (EG) model a common type of interactions in various complex, networked, natural and social systems. Given such a system with only profit sequences being available, reconstructing the interacting structure of EG networks is fundamental to understand and control its collective dynamics. Existing approaches used to handle this problem, such as the lasso, a convex optimization method, need a user-defined constant to control the tradeoff between the natural sparsity of networks and measurement error (the difference between observed data and simulated data). However, a shortcoming of these approaches is that it is not easy to determine these key parameters which can maximize the performance. In contrast to these approaches, we first model the EG network reconstruction problem as a multiobjective optimization problem (MOP), and then develop a framework which involves multiobjective evolutionary algorithm (MOEA), followed by solution selection based on knee regions, termed as MOEANet, to solve this MOP. We also design an effective initialization operator based on the lasso for MOEA. We apply the proposed method to reconstruct various types of synthetic and real-world networks, and the results show that our approach is effective to avoid the above parameter selecting problem and can reconstruct EG networks with high accuracy.
Leveraging percolation theory to single out influential spreaders in networks
NASA Astrophysics Data System (ADS)
Radicchi, Filippo; Castellano, Claudio
2016-06-01
Among the consequences of the disordered interaction topology underlying many social, technological, and biological systems, a particularly important one is that some nodes, just because of their position in the network, may have a disproportionate effect on dynamical processes mediated by the complex interaction pattern. For example, the early adoption of a commercial product by an opinion leader in a social network may change its fate or just a few superspreaders may determine the virality of a meme in social media. Despite many recent efforts, the formulation of an accurate method to optimally identify influential nodes in complex network topologies remains an unsolved challenge. Here, we present the exact solution of the problem for the specific, but highly relevant, case of the susceptible-infected-removed (SIR) model for epidemic spreading at criticality. By exploiting the mapping between bond percolation and the static properties of the SIR model, we prove that the recently introduced nonbacktracking centrality is the optimal criterion for the identification of influential spreaders in locally tree-like networks at criticality. By means of simulations on synthetic networks and on a very extensive set of real-world networks, we show that the nonbacktracking centrality is a highly reliable metric to identify top influential spreaders also in generic graphs not embedded in space and for noncritical spreading.
Epidemics in interconnected small-world networks.
Liu, Meng; Li, Daqing; Qin, Pengju; Liu, Chaoran; Wang, Huijuan; Wang, Feilong
2015-01-01
Networks can be used to describe the interconnections among individuals, which play an important role in the spread of disease. Although the small-world effect has been found to have a significant impact on epidemics in single networks, the small-world effect on epidemics in interconnected networks has rarely been considered. Here, we study the susceptible-infected-susceptible (SIS) model of epidemic spreading in a system comprising two interconnected small-world networks. We find that the epidemic threshold in such networks decreases when the rewiring probability of the component small-world networks increases. When the infection rate is low, the rewiring probability affects the global steady-state infection density, whereas when the infection rate is high, the infection density is insensitive to the rewiring probability. Moreover, epidemics in interconnected small-world networks are found to spread at different velocities that depend on the rewiring probability.
Influence of Choice of Null Network on Small-World Parameters of Structural Correlation Networks
Hosseini, S. M. Hadi; Kesler, Shelli R.
2013-01-01
In recent years, coordinated variations in brain morphology (e.g., volume, thickness) have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1) networks constructed by topology randomization (TOP), 2) networks matched to the distributional properties of the observed covariance matrix (HQS), and 3) networks generated from correlation of randomized input data (COR). The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures. PMID:23840672
Modeling the spreading of large-scale wildland fires
Mohamed Drissi
2015-01-01
The objective of the present study is twofold. First, the last developments and validation results of a hybrid model designed to simulate fire patterns in heterogeneous landscapes are presented. The model combines the features of a stochastic small-world network model with those of a deterministic semi-physical model of the interaction between burning and non-burning...
Possible Potential of Facebook to Enhance Learners' Motivation in Mobile Learning Environment
ERIC Educational Resources Information Center
Raza, Mehwish
2017-01-01
Facebook is world's leading social network, 29% of its active members represent Pakistan. This study utilized Facebook for teachers' in-service training. Thirty teachers from different parts of Pakistan took part in this training that lasted for ten weeks. The researcher tested the impact of three independent variables namely: social interactions,…
Using Web 2.0 Technology to Enhance, Scaffold and Assess Problem-Based Learning
ERIC Educational Resources Information Center
Hack, Catherine
2013-01-01
Web 2.0 technologies, such as social networks, wikis, blogs, and virtual worlds provide a platform for collaborative working, facilitating sharing of resources and joint document production. They can act as a stimulus to promote active learning and provide an engaging and interactive environment for students, and as such align with the philosophy…
The Acceptance of Microblogging in the Learning Process: The µBAM Model
ERIC Educational Resources Information Center
Rejón-Guardia, Francisco; Sánchez-Fernández, Juan; Muñoz-Leiva, Francisco
2013-01-01
Microblogging social networks (µBSNs) provide the opportunity to communicate worldwide while using a small number of characters; this is an apparent limitation that forces users to share only essential information when linking to the world with which they interact. These platforms can serve to motivate students by narrowing the physical and…
ERIC Educational Resources Information Center
Baird, Derek E.; Fisher, Mercedes
2006-01-01
Raised in the "always on" world of interactive media, the Internet, and digital messaging technologies, today's student has different expectations and learning styles than previous generations. This net-centric generation values their ability to use the Web to create a self-paced, customized, on-demand learning path that includes multiple forms of…
Modeling Data from Collaborative Assessments: Learning in Digital Interactive Social Networks
ERIC Educational Resources Information Center
Wilson, Mark; Gochyyev, Perman; Scalise, Kathleen
2017-01-01
This article summarizes assessment of cognitive skills through collaborative tasks, using field test results from the Assessment and Teaching of 21st Century Skills (ATC21S) project. This project, sponsored by Cisco, Intel, and Microsoft, aims to help educators around the world enable students with the skills to succeed in future career and…
ERIC Educational Resources Information Center
Juma, Magdallen N.
This booklet describes the African Virtual University (AVU), an interactive instructional telecommunications network established to provide distance education to the countries of sub-Saharan Africa. The AVU was piloted in 1997-1998, and in the 1998-1999 academic year, 27 institutions were slated to offer AVU courses. Supported by the World Bank,…
A Little Help from My Friends: Classroom 2.0 Educators Share Their Experiences
ERIC Educational Resources Information Center
Hargardon, Steve
2007-01-01
Blogs, wikis, podcasting, social networks... it seems the entire world has gone 2.0 crazy. Among the followers are educators, who, in ever increasing numbers, are integrating these online, interactive tools into their classrooms and even libraries. This article presents profiles of a few of educators who have taken the plunge, launching blogs,…
Hommes, J; Rienties, B; de Grave, W; Bos, G; Schuwirth, L; Scherpbier, A
2012-12-01
World-wide, universities in health sciences have transformed their curriculum to include collaborative learning and facilitate the students' learning process. Interaction has been acknowledged to be the synergistic element in this learning context. However, students spend the majority of their time outside their classroom and interaction does not stop outside the classroom. Therefore we studied how informal social interaction influences student learning. Moreover, to explore what really matters in the students learning process, a model was tested how the generally known important constructs-prior performance, motivation and social integration-relate to informal social interaction and student learning. 301 undergraduate medical students participated in this cross-sectional quantitative study. Informal social interaction was assessed using self-reported surveys following the network approach. Students' individual motivation, social integration and prior performance were assessed by the Academic Motivation Scale, the College Adaption Questionnaire and students' GPA respectively. A factual knowledge test represented student' learning. All social networks were positively associated with student learning significantly: friendships (β = 0.11), providing information to other students (β = 0.16), receiving information from other students (β = 0.25). Structural equation modelling revealed a model in which social networks increased student learning (r = 0.43), followed by prior performance (r = 0.31). In contrast to prior literature, students' academic motivation and social integration were not associated with students' learning. Students' informal social interaction is strongly associated with students' learning. These findings underline the need to change our focus from the formal context (classroom) to the informal context to optimize student learning and deliver modern medics.
Socio-inspired ICT. Towards a socially grounded society-ICT symbiosis
NASA Astrophysics Data System (ADS)
Ferscha, A.; Farrahi, K.; van den Hoven, J.; Hales, D.; Nowak, A.; Lukowicz, P.; Helbing, D.
2012-11-01
Modern ICT (Information and Communication Technology) has developed a vision where the "computer" is no longer associated with the concept of a single device or a network of devices, but rather the entirety of situated services originating in a digital world, which are perceived through the physical world. It is observed that services with explicit user input and output are becoming to be replaced by a computing landscape sensing the physical world via a huge variety of sensors, and controlling it via a plethora of actuators. The nature and appearance of computing devices is changing to be hidden in the fabric of everyday life, invisibly networked, and omnipresent, with applications greatly being based on the notions of context and knowledge. Interaction with such globe spanning, modern ICT systems will presumably be more implicit, at the periphery of human attention, rather than explicit, i.e. at the focus of human attention.Socio-inspired ICT assumes that future, globe scale ICT systems should be viewed as social systems. Such a view challenges research to identify and formalize the principles of interaction and adaptation in social systems, so as to be able to ground future ICT systems on those principles. This position paper therefore is concerned with the intersection of social behaviour and modern ICT, creating or recreating social conventions and social contexts through the use of pervasive, globe-spanning, omnipresent and participative ICT.
Social interaction recruits mentalizing and reward systems in middle childhood.
Alkire, Diana; Levitas, Daniel; Warnell, Katherine Rice; Redcay, Elizabeth
2018-06-08
Social cognition develops in the context of reciprocal social interaction. However, most neuroimaging studies of mentalizing have used noninteractive tasks that may fail to capture important aspects of real-world mentalizing. In adults, social-interactive context modulates activity in regions linked to social cognition and reward, but few interactive studies have been done with children. The current fMRI study examines children aged 8-12 using a novel paradigm in which children believed they were interacting online with a peer. We compared mental and non-mental state reasoning about a live partner (Peer) versus a story character (Character), testing the effects of mentalizing and social interaction in a 2 × 2 design. Mental versus Non-Mental reasoning engaged regions identified in prior mentalizing studies, including the temporoparietal junction, superior temporal sulcus, and dorsomedial prefrontal cortex. Moreover, peer interaction, even in conditions without explicit mentalizing demands, activated many of the same mentalizing regions. Peer interaction also activated areas outside the traditional mentalizing network, including the reward system. Our results demonstrate that social interaction engages multiple neural systems during middle childhood and contribute further evidence that social-interactive paradigms are needed to fully capture how the brain supports social processing in the real world. © 2018 Wiley Periodicals, Inc.
Identifying and characterizing key nodes among communities based on electrical-circuit networks.
Zhu, Fenghui; Wang, Wenxu; Di, Zengru; Fan, Ying
2014-01-01
Complex networks with community structures are ubiquitous in the real world. Despite many approaches developed for detecting communities, we continue to lack tools for identifying overlapping and bridging nodes that play crucial roles in the interactions and communications among communities in complex networks. Here we develop an algorithm based on the local flow conservation to effectively and efficiently identify and distinguish the two types of nodes. Our method is applicable in both undirected and directed networks without a priori knowledge of the community structure. Our method bypasses the extremely challenging problem of partitioning communities in the presence of overlapping nodes that may belong to multiple communities. Due to the fact that overlapping and bridging nodes are of paramount importance in maintaining the function of many social and biological networks, our tools open new avenues towards understanding and controlling real complex networks with communities accompanied with the key nodes.
Liang, Geng; Wang, Hong; Li, Wen; Li, Dazhong
2010-10-01
Data exchange patterns between nodes in WorldFIP fieldbus network are quite important and meaningful in improving the communication performance of WorldFIP network. Based on the basic communication ways supported in WorldFIP protocol, we propose two patterns for implementation of data exchange between peer nodes over WorldFIP network. Effects on communication performance of WorldFIP network in terms of some network parameters, such as number of bytes in user's data and turn-around time, in both the proposed patterns, are analyzed at length when different network speeds are applied. Such effects with the patterns of periodic message transmission using acknowledged and non-acknowledged messages, are also studied. Communication performance in both the proposed patterns are analyzed and compared. Practical applications of the research are presented. Through the study, it can be seen that different data exchange patterns make a great difference in improving communication efficiency with different network parameters, which is quite useful and helpful in the practical design of distributed systems based on WorldFIP network. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.
Low-rank network decomposition reveals structural characteristics of small-world networks
NASA Astrophysics Data System (ADS)
Barranca, Victor J.; Zhou, Douglas; Cai, David
2015-12-01
Small-world networks occur naturally throughout biological, technological, and social systems. With their prevalence, it is particularly important to prudently identify small-world networks and further characterize their unique connection structure with respect to network function. In this work we develop a formalism for classifying networks and identifying small-world structure using a decomposition of network connectivity matrices into low-rank and sparse components, corresponding to connections within clusters of highly connected nodes and sparse interconnections between clusters, respectively. We show that the network decomposition is independent of node indexing and define associated bounded measures of connectivity structure, which provide insight into the clustering and regularity of network connections. While many existing network characterizations rely on constructing benchmark networks for comparison or fail to describe the structural properties of relatively densely connected networks, our classification relies only on the intrinsic network structure and is quite robust with respect to changes in connection density, producing stable results across network realizations. Using this framework, we analyze several real-world networks and reveal new structural properties, which are often indiscernible by previously established characterizations of network connectivity.
FUSE: a profit maximization approach for functional summarization of biological networks.
Seah, Boon-Siew; Bhowmick, Sourav S; Dewey, C Forbes; Yu, Hanry
2012-03-21
The availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein interaction network (PPI) using graph theoretic analysis. Despite the recent progress, systems level analysis of PPIS remains a daunting task as it is challenging to make sense out of the deluge of high-dimensional interaction data. Specifically, techniques that automatically abstract and summarize PPIS at multiple resolutions to provide high level views of its functional landscape are still lacking. We present a novel data-driven and generic algorithm called FUSE (Functional Summary Generator) that generates functional maps of a PPI at different levels of organization, from broad process-process level interactions to in-depth complex-complex level interactions, through a pro t maximization approach that exploits Minimum Description Length (MDL) principle to maximize information gain of the summary graph while satisfying the level of detail constraint. We evaluate the performance of FUSE on several real-world PPIS. We also compare FUSE to state-of-the-art graph clustering methods with GO term enrichment by constructing the biological process landscape of the PPIS. Using AD network as our case study, we further demonstrate the ability of FUSE to quickly summarize the network and identify many different processes and complexes that regulate it. Finally, we study the higher-order connectivity of the human PPI. By simultaneously evaluating interaction and annotation data, FUSE abstracts higher-order interaction maps by reducing the details of the underlying PPI to form a functional summary graph of interconnected functional clusters. Our results demonstrate its effectiveness and superiority over state-of-the-art graph clustering methods with GO term enrichment.
Collective dynamics of 'small-world' networks.
Watts, D J; Strogatz, S H
1998-06-04
Networks of coupled dynamical systems have been used to model biological oscillators, Josephson junction arrays, excitable media, neural networks, spatial games, genetic control networks and many other self-organizing systems. Ordinarily, the connection topology is assumed to be either completely regular or completely random. But many biological, technological and social networks lie somewhere between these two extremes. Here we explore simple models of networks that can be tuned through this middle ground: regular networks 'rewired' to introduce increasing amounts of disorder. We find that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. We call them 'small-world' networks, by analogy with the small-world phenomenon (popularly known as six degrees of separation. The neural network of the worm Caenorhabditis elegans, the power grid of the western United States, and the collaboration graph of film actors are shown to be small-world networks. Models of dynamical systems with small-world coupling display enhanced signal-propagation speed, computational power, and synchronizability. In particular, infectious diseases spread more easily in small-world networks than in regular lattices.
Pathway Tools version 13.0: integrated software for pathway/genome informatics and systems biology
Paley, Suzanne M.; Krummenacker, Markus; Latendresse, Mario; Dale, Joseph M.; Lee, Thomas J.; Kaipa, Pallavi; Gilham, Fred; Spaulding, Aaron; Popescu, Liviu; Altman, Tomer; Paulsen, Ian; Keseler, Ingrid M.; Caspi, Ron
2010-01-01
Pathway Tools is a production-quality software environment for creating a type of model-organism database called a Pathway/Genome Database (PGDB). A PGDB such as EcoCyc integrates the evolving understanding of the genes, proteins, metabolic network and regulatory network of an organism. This article provides an overview of Pathway Tools capabilities. The software performs multiple computational inferences including prediction of metabolic pathways, prediction of metabolic pathway hole fillers and prediction of operons. It enables interactive editing of PGDBs by DB curators. It supports web publishing of PGDBs, and provides a large number of query and visualization tools. The software also supports comparative analyses of PGDBs, and provides several systems biology analyses of PGDBs including reachability analysis of metabolic networks, and interactive tracing of metabolites through a metabolic network. More than 800 PGDBs have been created using Pathway Tools by scientists around the world, many of which are curated DBs for important model organisms. Those PGDBs can be exchanged using a peer-to-peer DB sharing system called the PGDB Registry. PMID:19955237
Overlapping community detection based on link graph using distance dynamics
NASA Astrophysics Data System (ADS)
Chen, Lei; Zhang, Jing; Cai, Li-Jun
2018-01-01
The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.
A cooperative game framework for detecting overlapping communities in social networks
NASA Astrophysics Data System (ADS)
Jonnalagadda, Annapurna; Kuppusamy, Lakshmanan
2018-02-01
Community detection in social networks is a challenging and complex task, which received much attention from researchers of multiple domains in recent years. The evolution of communities in social networks happens merely due to the self-interest of the nodes. The interesting feature of community structure in social networks is the multi membership of the nodes resulting in overlapping communities. Assuming the nodes of the social network as self-interested players, the dynamics of community formation can be captured in the form of a game. In this paper, we propose a greedy algorithm, namely, Weighted Graph Community Game (WGCG), in order to model the interactions among the self-interested nodes of the social network. The proposed algorithm employs the Shapley value mechanism to discover the inherent communities of the underlying social network. The experimental evaluation on the real-world and synthetic benchmark networks demonstrates that the performance of the proposed algorithm is superior to the state-of-the-art overlapping community detection algorithms.
Autoplan: A self-processing network model for an extended blocks world planning environment
NASA Technical Reports Server (NTRS)
Dautrechy, C. Lynne; Reggia, James A.; Mcfadden, Frank
1990-01-01
Self-processing network models (neural/connectionist models, marker passing/message passing networks, etc.) are currently undergoing intense investigation for a variety of information processing applications. These models are potentially very powerful in that they support a large amount of explicit parallel processing, and they cleanly integrate high level and low level information processing. However they are currently limited by a lack of understanding of how to apply them effectively in many application areas. The formulation of self-processing network methods for dynamic, reactive planning is studied. The long-term goal is to formulate robust, computationally effective information processing methods for the distributed control of semiautonomous exploration systems, e.g., the Mars Rover. The current research effort is focusing on hierarchical plan generation, execution and revision through local operations in an extended blocks world environment. This scenario involves many challenging features that would be encountered in a real planning and control environment: multiple simultaneous goals, parallel as well as sequential action execution, action sequencing determined not only by goals and their interactions but also by limited resources (e.g., three tasks, two acting agents), need to interpret unanticipated events and react appropriately through replanning, etc.
Centralities in simplicial complexes. Applications to protein interaction networks.
Estrada, Ernesto; Ross, Grant J
2018-02-07
Complex networks can be used to represent complex systems which originate in the real world. Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplices of the complex. We extend the concept of node centrality to that of simplicial centrality and study several mathematical properties of degree, closeness, betweenness, eigenvector, Katz, and subgraph centrality for simplicial complexes. We study the degree distributions of these centralities at the different levels. We also compare and describe the differences between the centralities at the different levels. Using these centralities we study a method for detecting essential proteins in PPI networks of cells and explain the varying abilities of the centrality measures at the different levels in identifying these essential proteins. Copyright © 2017 Elsevier Ltd. All rights reserved.
Naming Game with Multiple Hearers
NASA Astrophysics Data System (ADS)
Li, Bing; Chen, Guanrong; Chow, Tommy W. S.
2013-05-01
A new model called Naming Game with Multiple Hearers (NGMH) is proposed in this paper. A naming game over a population of individuals aims to reach consensus on the name of an object through pair-wise local interactions among all the individuals. The proposed NGMH model describes the learning process of a new word, in a population with one speaker and multiple hearers, at each interaction towards convergence. The characteristics of NGMH are examined on three types of network topologies, namely ER random-graph network, WS small-world network, and BA scale-free network. Comparative analysis on the convergence time is performed, revealing that the topology with a larger average (node) degree can reach consensus faster than the others over the same population. It is found that, for a homogeneous network, the average degree is the limiting value of the number of hearers, which reduces the individual ability of learning new words, consequently decreasing the convergence time; for a scale-free network, this limiting value is the deviation of the average degree. It is also found that a network with a larger clustering coefficient takes longer time to converge; especially a small-word network with smallest rewiring possibility takes longest time to reach convergence. As more new nodes are being added to scale-free networks with different degree distributions, their convergence time appears to be robust against the network-size variation. Most new findings reported in this paper are different from that of the single-speaker/single-hearer naming games documented in the literature.
ERIC Educational Resources Information Center
Koole, Marguerite L.; Parchoma, Gale
2012-01-01
Through relational dialogue, learners shape their identities by sharing information about the world and how they see themselves in it. As learners interact, they receive feedback from both the environment and other learners which, in turn, helps them assess and adjust their self-presentations. Although learners retain choice and personal agency,…
Moral Spaces in MySpace: Preservice Teachers' Perspectives about Ethical Issues in Social Networking
ERIC Educational Resources Information Center
Foulger, Teresa S.; Ewbank, Ann Dutton; Kay, Adam; Popp, Sharon Osborn; Carter, Heather Lynn
2009-01-01
MySpace and Facebook are innovative digital communication tools that surpass traditional means of social interaction. However, in some instances in which educators have used these tools, public reactions to them have resulted in sanctions. With the notion that traditional ideas of privacy and teacher conduct are not yet defined in online worlds,…
Network Update: Plug-Ins, Forms and All That Java.
ERIC Educational Resources Information Center
Higgins, Chris
1997-01-01
Notes that the desire to make World Wide Web (WWW) pages more interactive and laden with animation, sound, and video brings us to the threshold of the deeper levels of Web page creation. Lists and discusses resources available on the WWW that will aid in learning and using these dynamic functions for Web page development to assist in interactive…
Facilitating and Learning at the Edge of Chaos: Expanding the Context of Experiential Education.
ERIC Educational Resources Information Center
Oekerman, Carl
Significant recent discoveries within a number of scientific disciplines, collectively referred to as the science of complexity, are creating a major shift in how human beings understand the complex, adaptive systems that make up the world. A complex adaptive system consists of networks of large numbers of agents that interact with each other and…
Technology Needs for Teachers Web Development and Curriculum Adaptations
NASA Technical Reports Server (NTRS)
Carroll, Christy J.
1999-01-01
Computer-based mathematics and science curricula focusing on NASA inventions and technologies will enhance current teacher knowledge and skills. Materials and interactive software developed by educators will allow students to integrate their various courses, to work cooperatively, and to collaborate with both NASA scientists and students at other locations by using computer networks, email and the World Wide Web.
Communication and cooperation in networked environments: an experimental analysis.
Galimberti, C; Ignazi, S; Vercesi, P; Riva, G
2001-02-01
Interpersonal communication and cooperation do not happen exclusively face to face. In work contexts, as in private life, there are more and more situations of mediated communication and cooperation in which new online tools are used. However, understanding how to use the Internet to support collaborative interaction presents a substantial challenge for the designers and users of this emerging technology. First, collaborative Internet environments are designed to serve a purpose, so must be designed with intended users' tasks and goals explicitly considered. Second, in cooperative activities the key content of communication is the interpretation of the situations in which actors are involved. So, the most effective way of clarifying the meaning of messages is to connect them to a shared context of meaning. However, this is more difficult in the Internet than in other computer-based activities. This paper tries to understand the characteristics of cooperative activities in networked environments--shared 3D virtual worlds--through two different studies. The first used the analysis of conversations to explore the characteristics of the interaction during the cooperative task; the second analyzed whether and how the level of immersion in the networked environments influenced the performance and the interactional process. The results are analyzed to identify the psychosocial roots used to support cooperation in a digital interactive communication.
Modeling infectious diseases dissemination through online role-playing games.
Balicer, Ran D
2007-03-01
As mathematical modeling of infectious diseases becomes increasingly important for developing public health policies, a novel platform for such studies might be considered. Millions of people worldwide play interactive online role-playing games, forming complex and rich networks among their virtual characters. An unexpected outbreak of an infective communicable disease (unplanned by the game creators) recently occurred in this virtual world. This outbreak holds surprising similarities to real-world epidemics. It is possible that these virtual environments could serve as a platform for studying the dissemination of infectious diseases, and as a testing ground for novel interventions to control emerging communicable diseases.
The ground truth about metadata and community detection in networks.
Peel, Leto; Larremore, Daniel B; Clauset, Aaron
2017-05-01
Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system's components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate the performance of community detection algorithms by their ability to find so-called ground truth communities. This works well in synthetic networks with planted communities because these networks' links are formed explicitly based on those known communities. However, there are no planted communities in real-world networks. Instead, it is standard practice to treat some observed discrete-valued node attributes, or metadata, as ground truth. We show that metadata are not the same as ground truth and that treating them as such induces severe theoretical and practical problems. We prove that no algorithm can uniquely solve community detection, and we prove a general No Free Lunch theorem for community detection, which implies that there can be no algorithm that is optimal for all possible community detection tasks. However, community detection remains a powerful tool and node metadata still have value, so a careful exploration of their relationship with network structure can yield insights of genuine worth. We illustrate this point by introducing two statistical techniques that can quantify the relationship between metadata and community structure for a broad class of models. We demonstrate these techniques using both synthetic and real-world networks, and for multiple types of metadata and community structures.
Modular networks with delayed coupling: Synchronization and frequency control
NASA Astrophysics Data System (ADS)
Maslennikov, Oleg V.; Nekorkin, Vladimir I.
2014-07-01
We study the collective dynamics of modular networks consisting of map-based neurons which generate irregular spike sequences. Three types of intramodule topology are considered: a random Erdös-Rényi network, a small-world Watts-Strogatz network, and a scale-free Barabási-Albert network. The interaction between the neurons of different modules is organized by relatively sparse connections with time delay. For all the types of the network topology considered, we found that with increasing delay two regimes of module synchronization alternate with each other: inphase and antiphase. At the same time, the average rate of collective oscillations decreases within each of the time-delay intervals corresponding to a particular synchronization regime. A dual role of the time delay is thus established: controlling a synchronization mode and degree and controlling an average network frequency. Furthermore, we investigate the influence on the modular synchronization by other parameters: the strength of intermodule coupling and the individual firing rate.
Navigability of multiplex temporal network
NASA Astrophysics Data System (ADS)
Wang, Yan; Song, Qiao-Zhen
2017-01-01
Real world complex systems have multiple levels of relationships and in many cases, they need to be modeled as multiplex networks where the same nodes can interact with each other in different layers, such as social networks. However, social relationships only appear at prescribed times so the temporal structures of edge activations can also affect the dynamical processes located above them. To consider both factors are simultaneously, we introduce multiplex temporal networks and propose three different walk strategies to investigate the concurrent dynamics of random walks and the temporal structure of multiplex networks. Thus, we derive analytical results for the multiplex centrality and coverage function in multiplex temporal networks. By comparing them with the numerical results, we show how the underlying topology of the layers and the walk strategy affect the efficiency when exploring the networks. In particular, the most interesting result is the emergence of a super-diffusion process, where the time scale of the multiplex is faster than that of both layers acting separately.
NASA Astrophysics Data System (ADS)
Caetano, Marco Antonio Leonel; Yoneyama, Takashi
2015-07-01
This work concerns the study of the effects felt by a network as a whole when a specific node is perturbed. Many real world systems can be described by network models in which the interactions of the various agents can be represented as an edge of a graph. With a graph model in hand, it is possible to evaluate the effect of deleting some of its edges on the architecture and values of nodes of the network. Eventually a node may end up isolated from the rest of the network and an interesting problem is to have a quantitative measure of the impact of such an event. For instance, in the field of finance, the network models are very popular and the proposed methodology allows to carry out "what if" tests in terms of weakening the links between the economic agents, represented as nodes. The two main concepts employed in the proposed methodology are (i) the vibrational IC-Information Centrality, which can provide a measure of the relative importance of a particular node in a network and (ii) autocatalytic networks that can indicate the evolutionary trends of the network. Although these concepts were originally proposed in the context of other fields of knowledge, they were also found to be useful in analyzing financial networks. In order to illustrate the applicability of the proposed methodology, a case of study using the actual data comprising stock market indices of 12 countries is presented.
NPSNET: Aural cues for virtual world immersion
NASA Astrophysics Data System (ADS)
Dahl, Leif A.
1992-09-01
NPSNET is a low-cost visual and aural simulation system designed and implemented at the Naval Postgraduate School. NPSNET is an example of a virtual world simulation environment that incorporates real-time aural cues through software-hardware interaction. In the current implementation of NPSNET, a graphics workstation functions in the sound server role which involves sending and receiving networked sound message packets across a Local Area Network, composed of multiple graphics workstations. The network messages contain sound file identification information that is transmitted from the sound server across an RS-422 protocol communication line to a serial to Musical Instrument Digital Interface (MIDI) converter. The MIDI converter, in turn relays the sound byte to a sampler, an electronic recording and playback device. The sampler correlates the hexadecimal input to a specific note or stored sound and sends it as an audio signal to speakers via an amplifier. The realism of a simulation is improved by involving multiple participant senses and removing external distractions. This thesis describes the incorporation of sound as aural cues, and the enhancement they provide in the virtual simulation environment of NPSNET.
Interdependent networks: the fragility of control
Morris, Richard G.; Barthelemy, Marc
2013-01-01
Recent work in the area of interdependent networks has focused on interactions between two systems of the same type. However, an important and ubiquitous class of systems are those involving monitoring and control, an example of interdependence between processes that are very different. In this Article, we introduce a framework for modelling ‘distributed supervisory control' in the guise of an electrical network supervised by a distributed system of control devices. The system is characterised by degrees of freedom salient to real-world systems— namely, the number of control devices, their inherent reliability, and the topology of the control network. Surprisingly, the behavior of the system depends crucially on the reliability of control devices. When devices are completely reliable, cascade sizes are percolation controlled; the number of devices being the relevant parameter. For unreliable devices, the topology of the control network is important and can dramatically reduce the resilience of the system. PMID:24067404
The Structural Underpinnings of Policy Learning: A Classroom Policy Simulation
NASA Astrophysics Data System (ADS)
Bird, Stephen
This paper investigates the relationship between the centrality of individual actors in a social network structure and their policy learning performance. In a dynamic comparable to real-world policy networks, results from a classroom simulation demonstrate a strong relationship between centrality in social learning networks and grade performance. Previous research indicates that social network centrality should have a positive effect on learning in other contexts and this link is tested in a policy learning context. Second, the distinction between collaborative learning versus information diffusion processes in policy learning is examined. Third, frequency of interaction is analyzed to determine whether consistent, frequent tics have a greater impact on the learning process. Finally, the data arc analyzed to determine if the benefits of centrality have limitations or thresholds when benefits no longer accrue. These results demonstrate the importance of network structure, and support a collaborative conceptualization of the policy learning process.
ClueNet: Clustering a temporal network based on topological similarity rather than denseness
Milenković, Tijana
2018-01-01
Network clustering is a very popular topic in the network science field. Its goal is to divide (partition) the network into groups (clusters or communities) of “topologically related” nodes, where the resulting topology-based clusters are expected to “correlate” well with node label information, i.e., metadata, such as cellular functions of genes/proteins in biological networks, or age or gender of people in social networks. Even for static data, the problem of network clustering is complex. For dynamic data, the problem is even more complex, due to an additional dimension of the data—their temporal (evolving) nature. Since the problem is computationally intractable, heuristic approaches need to be sought. Existing approaches for dynamic network clustering (DNC) have drawbacks. First, they assume that nodes should be in the same cluster if they are densely interconnected within the network. We hypothesize that in some applications, it might be of interest to cluster nodes that are topologically similar to each other instead of or in addition to requiring the nodes to be densely interconnected. Second, they ignore temporal information in their early steps, and when they do consider this information later on, they do so implicitly. We hypothesize that capturing temporal information earlier in the clustering process and doing so explicitly will improve results. We test these two hypotheses via our new approach called ClueNet. We evaluate ClueNet against six existing DNC methods on both social networks capturing evolving interactions between individuals (such as interactions between students in a high school) and biological networks capturing interactions between biomolecules in the cell at different ages. We find that ClueNet is superior in over 83% of all evaluation tests. As more real-world dynamic data are becoming available, DNC and thus ClueNet will only continue to gain importance. PMID:29738568
Vulnerability of complex networks
NASA Astrophysics Data System (ADS)
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.
Damage spreading in spatial and small-world random Boolean networks
NASA Astrophysics Data System (ADS)
Lu, Qiming; Teuscher, Christof
2014-02-01
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 as 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 nonrandom 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 Hamming distance at very low connectivities (K¯≪1) and that the critical connectivity of stability Ks changes compared to random networks. At higher K¯, this scaling remains unchanged. We also show that the Hamming distance 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 arguments for small-world networks are obtained with respect to the system sizes and strength of spatially local connections. 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.
Anomalous contagion and renormalization in networks with nodal mobility
NASA Astrophysics Data System (ADS)
Manrique, Pedro D.; Qi, Hong; Zheng, Minzhang; Xu, Chen; Hui, Pak Ming; Johnson, Neil F.
2016-07-01
A common occurrence in everyday human activity is where people join, leave and possibly rejoin clusters of other individuals —whether this be online (e.g. social media communities) or in real space (e.g. popular meeting places such as cafes). In the steady state, the resulting interaction network would appear static over time if the identities of the nodes are ignored. Here we show that even in this static steady-state limit, a non-zero nodal mobility leads to a diverse set of outbreak profiles that is dramatically different from known forms, and yet matches well with recent real-world social outbreaks. We show how this complication of nodal mobility can be renormalized away for a particular class of networks.
Scale-free networks which are highly assortative but not small world
NASA Astrophysics Data System (ADS)
Small, Michael; Xu, Xiaoke; Zhou, Jin; Zhang, Jie; Sun, Junfeng; Lu, Jun-An
2008-06-01
Uncorrelated scale-free networks are necessarily small world (and, in fact, smaller than small world). Nonetheless, for scale-free networks with correlated degree distribution this may not be the case. We describe a mechanism to generate highly assortative scale-free networks which are not small world. We show that it is possible to generate scale-free networks, with arbitrary degree exponent γ>1 , such that the average distance between nodes in the network is large. To achieve this, nodes are not added to the network with preferential attachment. Instead, we greedily optimize the assortativity of the network. The network generation scheme is physically motivated, and we show that the recently observed global network of Avian Influenza outbreaks arises through a mechanism similar to what we present here. Simulations show that this network exhibits very similar physical characteristics (very high assortativity, clustering, and path length).
Neurocognitive systems related to real-world prospective memory.
Kalpouzos, Grégoria; Eriksson, Johan; Sjölie, Daniel; Molin, Jonas; Nyberg, Lars
2010-10-08
Prospective memory (PM) denotes the ability to remember to perform actions in the future. It has been argued that standard laboratory paradigms fail to capture core aspects of PM. We combined functional MRI, virtual reality, eye-tracking and verbal reports to explore the dynamic allocation of neurocognitive processes during a naturalistic PM task where individuals performed errands in a realistic model of their residential town. Based on eye movement data and verbal reports, we modeled PM as an iterative loop of five sustained and transient phases: intention maintenance before target detection (TD), TD, intention maintenance after TD, action, and switching, the latter representing the activation of a new intention in mind. The fMRI analyses revealed continuous engagement of a top-down fronto-parietal network throughout the entire task, likely subserving goal maintenance in mind. In addition, a shift was observed from a perceptual (occipital) system while searching for places to go, to a mnemonic (temporo-parietal, fronto-hippocampal) system for remembering what actions to perform after TD. Updating of the top-down fronto-parietal network occurred at both TD and switching, the latter likely also being characterized by frontopolar activity. Taken together, these findings show how brain systems complementary interact during real-world PM, and support a more complete model of PM that can be applied to naturalistic PM tasks and that we named PROspective MEmory DYnamic (PROMEDY) model because of its dynamics on both multi-phase iteration and the interactions of distinct neurocognitive networks.
Emergence of synchronization and regularity in firing patterns in time-varying neural hypernetworks
NASA Astrophysics Data System (ADS)
Rakshit, Sarbendu; Bera, Bidesh K.; Ghosh, Dibakar; Sinha, Sudeshna
2018-05-01
We study synchronization of dynamical systems coupled in time-varying network architectures, composed of two or more network topologies, corresponding to different interaction schemes. As a representative example of this class of time-varying hypernetworks, we consider coupled Hindmarsh-Rose neurons, involving two distinct types of networks, mimicking interactions that occur through the electrical gap junctions and the chemical synapses. Specifically, we consider the connections corresponding to the electrical gap junctions to form a small-world network, while the chemical synaptic interactions form a unidirectional random network. Further, all the connections in the hypernetwork are allowed to change in time, modeling a more realistic neurobiological scenario. We model this time variation by rewiring the links stochastically with a characteristic rewiring frequency f . We find that the coupling strength necessary to achieve complete neuronal synchrony is lower when the links are switched rapidly. Further, the average time required to reach the synchronized state decreases as synaptic coupling strength and/or rewiring frequency increases. To quantify the local stability of complete synchronous state we use the Master Stability Function approach, and for global stability we employ the concept of basin stability. The analytically derived necessary condition for synchrony is in excellent agreement with numerical results. Further we investigate the resilience of the synchronous states with respect to increasing network size, and we find that synchrony can be maintained up to larger network sizes by increasing either synaptic strength or rewiring frequency. Last, we find that time-varying links not only promote complete synchronization, but also have the capacity to change the local dynamics of each single neuron. Specifically, in a window of rewiring frequency and synaptic coupling strength, we observe that the spiking behavior becomes more regular.
The Examination of Listening Anxiety Level of the Students Who Learn Turkish as a Foreign Language
ERIC Educational Resources Information Center
Halat, Sercan; Özbay, Murat
2018-01-01
In 21st century which witnesses a range of extraordinary technological improvements; along with the world's turning into global-village-like place, it is a vital need that a common communication network being built up as a result of the interaction among the people whose nation, culture, language and beliefs differ drastically. With the aim of…
ERIC Educational Resources Information Center
Al-Sanaa, Bashaiar
2009-01-01
Information and communication technologies (ICT) have revolutionized how people experience spatial proximity, reality, and connectivity. These technologies provide inexpensive access to anything and anyone in the world. They also replicate face-to-face interaction in cyber-space and allow for participation in numerous modes of social exchange. …
[Social media, children and pediatricians].
Le Heuzey, M-F
2012-01-01
Using social media web sites is a common activity for children, and any site that allows social interaction (social network, games, virtual worlds...) is a social media site. Pediatricians are in a position to help families understand the benefits and the risks of these sites, and to diagnose problems in children and adolescents as cyberbullying, depression, and post traumatic disorder. Copyright © 2011 Elsevier Masson SAS. All rights reserved.
Dynamic motifs in socio-economic networks
NASA Astrophysics Data System (ADS)
Zhang, Xin; Shao, Shuai; Stanley, H. Eugene; Havlin, Shlomo
2014-12-01
Socio-economic networks are of central importance in economic life. We develop a method of identifying and studying motifs in socio-economic networks by focusing on “dynamic motifs,” i.e., evolutionary connection patterns that, because of “node acquaintances” in the network, occur much more frequently than random patterns. We examine two evolving bi-partite networks: i) the world-wide commercial ship chartering market and ii) the ship build-to-order market. We find similar dynamic motifs in both bipartite networks, even though they describe different economic activities. We also find that “influence” and “persistence” are strong factors in the interaction behavior of organizations. When two companies are doing business with the same customer, it is highly probable that another customer who currently only has business relationship with one of these two companies, will become customer of the second in the future. This is the effect of influence. Persistence means that companies with close business ties to customers tend to maintain their relationships over a long period of time.
Extraordinary variability and sharp transitions in a maximally frustrated dynamic network
NASA Astrophysics Data System (ADS)
Liu, Wenjia; Schmittmann, Beate; Zia, R. K. P.
2013-03-01
Most previous studies of complex networks have focused on single, static networks. However, in the real world, networks are dynamic and interconnected. Inspired by the presence of extroverts and introverts in the general population, we investigate a highly simplified model of a social network, involving two types of nodes: one preferring the highest degree possible, and one preferring no connections whatsoever. There are only two control parameters in the model: the number of ``introvert'' and ``extrovert'' nodes, NI and NE. Our key findings are as follows: As a function of NI and NE, the system exhibits a highly unusual transition, displaying extraordinary fluctuations (as in 2nd order transitions) and discontinuous jumps (characteristic of 1st order transitions). Most remarkably, the system can be described by an Ising-like Hamiltonian with long-range multi-spin interactions and some of its properties can be obtained analytically. This is in stark contrast with other dynamic network models which rely almost exclusively on simulations. NSF-DMR-1005417/1244666 and and ICTAS Virginia Tech
Global Change Network: Combine Nutrient Network and Drought Net in China
NASA Astrophysics Data System (ADS)
Yu, Q.; Wang, C.; Zhu, J.; Xu, X.; Yang, H.; Wei, C.; Cong, N.; Wu, H.; Li, H.; Tian, D.; An, H.; Yu, G.
2017-12-01
Globally, all ecosystems will be impacted to some extent by changes in climate means and more frequent and severe periods of climatic extremes. Although there have been numerous studies examining the effects of changes in climatic means on ecological processes and ecosystems, research on climate extremes is far less common and is only now emerging as a distinct research field in ecology. Furthermore, although we have learned much in the past 20 years about how individual ecosystems are likely to respond to climate change, extending this knowledge to regional and continental scales has been a far greater challenge because of the inconsistent design of experiments and ecological complexity. In order to better forecast how entire regions will respond to eutrophication and extreme drought, two key network has been set up, i.e. Nutrient Network, Drought Net. However, there were few sites in China in the network studies, where locates Eurasian Steppe (the biggest grassland in the world) and Tibetan Plateau grassland (the world's highest and largest plateau grassland). To fill the great gap, we have set up ten sites in China (including 5 sites in Eurasia Steppe and 5 site in Tibetan Plateau), combing Nutrient Network and Drought Net treatments and also increased precipitation, called Global Change Network. There are 16 treatments with 6 repeats, and thus 96 plots in the global change network. The nutrient addition treatments are the same with Nutrient Network, i.e. 10 treatments. Precipitation change treatments include an extreme drought (the same with Drought Net) and a water addition (the amount is the same with drought treatment) treatment. The interactive treatments were only conducted in control N and NPK.
Approximating frustration scores in complex networks via perturbed Laplacian spectra
NASA Astrophysics Data System (ADS)
Savol, Andrej J.; Chennubhotla, Chakra S.
2015-12-01
Systems of many interacting components, as found in physics, biology, infrastructure, and the social sciences, are often modeled by simple networks of nodes and edges. The real-world systems frequently confront outside intervention or internal damage whose impact must be predicted or minimized, and such perturbations are then mimicked in the models by altering nodes or edges. This leads to the broad issue of how to best quantify changes in a model network after some type of perturbation. In the case of node removal there are many centrality metrics which associate a scalar quantity with the removed node, but it can be difficult to associate the quantities with some intuitive aspect of physical behavior in the network. This presents a serious hurdle to the application of network theory: real-world utility networks are rarely altered according to theoretic principles unless the kinetic impact on the network's users are fully appreciated beforehand. In pursuit of a kinetically interpretable centrality score, we discuss the f-score, or frustration score. Each f-score quantifies whether a selected node accelerates or inhibits global mean first passage times to a second, independently selected target node. We show that this is a natural way of revealing the dynamical importance of a node in some networks. After discussing merits of the f-score metric, we combine spectral and Laplacian matrix theory in order to quickly approximate the exact f-score values, which can otherwise be expensive to compute. Following tests on both synthetic and real medium-sized networks, we report f-score runtime improvements over exact brute force approaches in the range of 0 to 400 % with low error (<3 % ).
The Social Neuroscience of Interpersonal Emotions.
Müller-Pinzler, Laura; Krach, Sören; Krämer, Ulrike M; Paulus, Frieder M
In our daily lives, we constantly engage in reciprocal interactions with other individuals and represent ourselves in the context of our surrounding social world. Within social interactions, humans often experience interpersonal emotions such as embarrassment, shame, guilt, or pride. How interpersonal emotions are processed on the neural systems level is of major interest for social neuroscience research. While the configuration of laboratory settings in general is constraining for emotion research, recent neuroimaging investigations came up with new approaches to implement socially interactive and immersive scenarios for the real-life investigation of interpersonal emotions. These studies could show that among other brain regions the so-called mentalizing network, which is typically involved when we represent and make sense of others' states of mind, is associated with interpersonal emotions. The anterior insula/anterior cingulate cortex network at the same time processes one's own bodily arousal during such interpersonal emotional experiences. Current research aimed to explore how we make sense of others' emotional states during social interactions and investigates the modulating factors of our emotional experiences during social interactions. Understanding how interpersonal emotions are processed on the neural systems level may yield significant implications for neuropsychiatric disorders that affect social behavior such as social anxiety disorders or autism.
Propagation, cascades, and agreement dynamics in complex communication and social networks
NASA Astrophysics Data System (ADS)
Lu, Qiming
Many modern and important technological, social, information and infrastructure systems can be viewed as complex systems with a large number of interacting components. Models of complex networks and dynamical interactions, as well as their applications are of fundamental interests in many aspects. Here, several stylized models of multiplex propagation and opinion dynamics are investigated on complex and empirical social networks. We first investigate cascade dynamics in threshold-controlled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, robust, and reliable prototypical activation protocol in sensor networks in responding to various alarm scenarios. We also consider the same dynamics on a modified network by adding a few long-range communication links, resulting in a small-world network. We find that such construction can further enhance and optimize the speed of the network's response, while keeping energy consumption at a manageable level. We also investigate a prototypical agent-based model, the Naming Game, on two-dimensional random geometric networks. The Naming Game [A. Baronchelli et al., J. Stat. Mech.: Theory Exp. (2006) P06014.] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case. When applying the model of Naming Game on empirical social networks, this stylized agent-based model captures essential features of agreement dynamics in a network of autonomous agents, corresponding to the development of shared classification schemes in a network of artificial agents or opinion spreading and social dynamics in social networks. Our study focuses on the impact that communities in the underlying social graphs have on the outcome of the agreement process. We find that networks with strong community structure hinder the system from reaching global agreement; the evolution of the Naming Game in these networks maintains clusters of coexisting opinions indefinitely. Further, we investigate agent-based network strategies to facilitate convergence to global consensus.
The role of the interaction network in the emergence of diversity of behavior
Tabacof, Pedro; Von Zuben, Fernando J.
2017-01-01
How can systems in which individuals’ inner workings are very similar to each other, as neural networks or ant colonies, produce so many qualitatively different behaviors, giving rise to roles and specialization? In this work, we bring new perspectives to this question by focusing on the underlying network that defines how individuals in these systems interact. We applied a genetic algorithm to optimize rules and connections of cellular automata in order to solve the density classification task, a classical problem used to study emergent behaviors in decentralized computational systems. The networks used were all generated by the introduction of shortcuts in an originally regular topology, following the small-world model. Even though all cells follow the exact same rules, we observed the existence of different classes of cells’ behaviors in the best cellular automata found—most cells were responsible for memory and others for integration of information. Through the analysis of structural measures and patterns of connections (motifs) in successful cellular automata, we observed that the distribution of shortcuts between distant regions and the speed in which a cell can gather information from different parts of the system seem to be the main factors for the specialization we observed, demonstrating how heterogeneity in a network can create heterogeneity of behavior. PMID:28234962
Communicability across evolving networks.
Grindrod, Peter; Parsons, Mark C; Higham, Desmond J; Estrada, Ernesto
2011-04-01
Many natural and technological applications generate time-ordered sequences of networks, defined over a fixed set of nodes; for example, time-stamped information about "who phoned who" or "who came into contact with who" arise naturally in studies of communication and the spread of disease. Concepts and algorithms for static networks do not immediately carry through to this dynamic setting. For example, suppose A and B interact in the morning, and then B and C interact in the afternoon. Information, or disease, may then pass from A to C, but not vice versa. This subtlety is lost if we simply summarize using the daily aggregate network given by the chain A-B-C. However, using a natural definition of a walk on an evolving network, we show that classic centrality measures from the static setting can be extended in a computationally convenient manner. In particular, communicability indices can be computed to summarize the ability of each node to broadcast and receive information. The computations involve basic operations in linear algebra, and the asymmetry caused by time's arrow is captured naturally through the noncommutativity of matrix-matrix multiplication. Illustrative examples are given for both synthetic and real-world communication data sets. We also discuss the use of the new centrality measures for real-time monitoring and prediction.
NASA Astrophysics Data System (ADS)
Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo
2015-11-01
Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug-target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively implement neighbourhood-based link prediction entirely in the bipartite domain.
Experimental evidence of massive-scale emotional contagion through social networks
Kramer, Adam D. I.; Guillory, Jamie E.; Hancock, Jeffrey T.
2014-01-01
Emotional states can be transferred to others via emotional contagion, leading people to experience the same emotions without their awareness. Emotional contagion is well established in laboratory experiments, with people transferring positive and negative emotions to others. Data from a large real-world social network, collected over a 20-y period suggests that longer-lasting moods (e.g., depression, happiness) can be transferred through networks [Fowler JH, Christakis NA (2008) BMJ 337:a2338], although the results are controversial. In an experiment with people who use Facebook, we test whether emotional contagion occurs outside of in-person interaction between individuals by reducing the amount of emotional content in the News Feed. When positive expressions were reduced, people produced fewer positive posts and more negative posts; when negative expressions were reduced, the opposite pattern occurred. These results indicate that emotions expressed by others on Facebook influence our own emotions, constituting experimental evidence for massive-scale contagion via social networks. This work also suggests that, in contrast to prevailing assumptions, in-person interaction and nonverbal cues are not strictly necessary for emotional contagion, and that the observation of others’ positive experiences constitutes a positive experience for people. PMID:24889601
Experimental evidence of massive-scale emotional contagion through social networks.
Kramer, Adam D I; Guillory, Jamie E; Hancock, Jeffrey T
2014-06-17
Emotional states can be transferred to others via emotional contagion, leading people to experience the same emotions without their awareness. Emotional contagion is well established in laboratory experiments, with people transferring positive and negative emotions to others. Data from a large real-world social network, collected over a 20-y period suggests that longer-lasting moods (e.g., depression, happiness) can be transferred through networks [Fowler JH, Christakis NA (2008) BMJ 337:a2338], although the results are controversial. In an experiment with people who use Facebook, we test whether emotional contagion occurs outside of in-person interaction between individuals by reducing the amount of emotional content in the News Feed. When positive expressions were reduced, people produced fewer positive posts and more negative posts; when negative expressions were reduced, the opposite pattern occurred. These results indicate that emotions expressed by others on Facebook influence our own emotions, constituting experimental evidence for massive-scale contagion via social networks. This work also suggests that, in contrast to prevailing assumptions, in-person interaction and nonverbal cues are not strictly necessary for emotional contagion, and that the observation of others' positive experiences constitutes a positive experience for people.
Network topology of an experimental futures exchange
NASA Astrophysics Data System (ADS)
Wang, S. C.; Tseng, J. J.; Tai, C. C.; Lai, K. H.; Wu, W. S.; Chen, S. H.; Li, S. P.
2008-03-01
Many systems of different nature exhibit scale free behaviors. Economic systems with power law distribution in the wealth are one of the examples. To better understand the working behind the complexity, we undertook an experiment recording the interactions between market participants. A Web server was setup to administer the exchange of futures contracts whose liquidation prices were coupled to event outcomes. After free registration, participants started trading to compete for the money prizes upon maturity of the futures contracts at the end of the experiment. The evolving `cash' flow network was reconstructed from the transactions between players. We show that the network topology is hierarchical, disassortative and small-world with a power law exponent of 1.02±0.09 in the degree distribution after an exponential decay correction. The small-world property emerged early in the experiment while the number of participants was still small. We also show power law-like distributions of the net incomes and inter-transaction time intervals. Big winners and losers are associated with high degree, high betweenness centrality, low clustering coefficient and low degree-correlation. We identify communities in the network as groups of the like-minded. The distribution of the community sizes is shown to be power-law distributed with an exponent of 1.19±0.16.
Origin of Peer Influence in Social Networks
NASA Astrophysics Data System (ADS)
Pinheiro, Flávio L.; Santos, Marta D.; Santos, Francisco C.; Pacheco, Jorge M.
2014-03-01
Social networks pervade our everyday lives: we interact, influence, and are influenced by our friends and acquaintances. With the advent of the World Wide Web, large amounts of data on social networks have become available, allowing the quantitative analysis of the distribution of information on them, including behavioral traits and fads. Recent studies of correlations among members of a social network, who exhibit the same trait, have shown that individuals influence not only their direct contacts but also friends' friends, up to a network distance extending beyond their closest peers. Here, we show how such patterns of correlations between peers emerge in networked populations. We use standard models (yet reflecting intrinsically different mechanisms) of information spreading to argue that empirically observed patterns of correlation among peers emerge naturally from a wide range of dynamics, being essentially independent of the type of information, on how it spreads, and even on the class of underlying network that interconnects individuals. Finally, we show that the sparser and clustered the network, the more far reaching the influence of each individual will be.
Information spreading in complex networks with participation of independent spreaders
NASA Astrophysics Data System (ADS)
Ma, Kun; Li, Weihua; Guo, Quantong; Zheng, Xiaoqi; Zheng, Zhiming; Gao, Chao; Tang, Shaoting
2018-02-01
Information diffusion dynamics in complex networks is often modeled as a contagion process among neighbors which is analogous to epidemic diffusion. The attention of previous literature is mainly focused on epidemic diffusion within one network, which, however neglects the possible interactions between nodes beyond the underlying network. The disease can be transmitted to other nodes by other means without following the links in the focal network. Here we account for this phenomenon by introducing the independent spreaders in a susceptible-infectious-recovered contagion process. We derive the critical epidemic thresholds on Erdős-Rényi and scale-free networks as a function of infectious rate, recovery rate and the activeness of independent spreaders. We also present simulation results on ER and SF networks, as well as on a real-world email network. The result shows that the extent to which a disease can infect might be more far-reaching, than we can explain in terms of link contagion only. Besides, these results also help to explain how activeness of independent spreaders can affect the diffusion process, which can be used to explore many other dynamical processes.
NASA Astrophysics Data System (ADS)
Toroczkai, Zoltan; Anghel, Marian; Bassler, Kevin; Korniss, Gyorgy
2003-03-01
The dynamics of human, and most biological populations is characterized by competition for resources. By its own nature, this dynamics creates the group of "elites", formed by those agents who have strategies that are the most successful in the given situation, and therefore the rest of the agents will tend to follow, imitate, or interact with them, creating a social structure of leadership in the agent society. These inter-agent communications generate a complex social network with small-world character which itself forms the substrate for a second network, the action network. The latter is a highly dynamic, adaptive, directed network, defined by those inter-agent communication links on the substrate along which the passed information /prediction is acted upon by the other agents. By using the minority game for competition dynamics, here we show that when the substrate network is highly connected, the action network spontaneously develops hubs with a broad distribution of out-degrees, defining a robust leadership structure that is scale-free. Furthermore, in certain, realistic parameter ranges, facilitated by information passing on the action network, agents can spontaneously generate a high degree of cooperation making the collective almost maximally efficient.
Differentially Coexpressed Disease Gene Identification Based on Gene Coexpression Network.
Jiang, Xue; Zhang, Han; Quan, Xiongwen
2016-01-01
Screening disease-related genes by analyzing gene expression data has become a popular theme. Traditional disease-related gene selection methods always focus on identifying differentially expressed gene between case samples and a control group. These traditional methods may not fully consider the changes of interactions between genes at different cell states and the dynamic processes of gene expression levels during the disease progression. However, in order to understand the mechanism of disease, it is important to explore the dynamic changes of interactions between genes in biological networks at different cell states. In this study, we designed a novel framework to identify disease-related genes and developed a differentially coexpressed disease-related gene identification method based on gene coexpression network (DCGN) to screen differentially coexpressed genes. We firstly constructed phase-specific gene coexpression network using time-series gene expression data and defined the conception of differential coexpression of genes in coexpression network. Then, we designed two metrics to measure the value of gene differential coexpression according to the change of local topological structures between different phase-specific networks. Finally, we conducted meta-analysis of gene differential coexpression based on the rank-product method. Experimental results demonstrated the feasibility and effectiveness of DCGN and the superior performance of DCGN over other popular disease-related gene selection methods through real-world gene expression data sets.
a Weighted Local-World Evolving Network Model Based on the Edge Weights Preferential Selection
NASA Astrophysics Data System (ADS)
Li, Ping; Zhao, Qingzhen; Wang, Haitang
2013-05-01
In this paper, we use the edge weights preferential attachment mechanism to build a new local-world evolutionary model for weighted networks. It is different from previous papers that the local-world of our model consists of edges instead of nodes. Each time step, we connect a new node to two existing nodes in the local-world through the edge weights preferential selection. Theoretical analysis and numerical simulations show that the scale of the local-world affect on the weight distribution, the strength distribution and the degree distribution. We give the simulations about the clustering coefficient and the dynamics of infectious diseases spreading. The weight dynamics of our network model can portray the structure of realistic networks such as neural network of the nematode C. elegans and Online Social Network.
Towards an Archaeology of Early Islamic Ports on the Western Red Sea Coast
NASA Astrophysics Data System (ADS)
Breen, Colin
2013-12-01
Against a background of developing research on Red Sea ports, a hypothetical model of the morphology of port towns during the early Islamic period is presented here. These places went through constant cycles of change as economic and political frameworks fluctuated. While their physical shape and form was strongly influenced by architectural features of the Islamic world their functionality was more aligned to commercial interaction. These were dynamic spaces where the daily life of their inhabitants was guided by trade, religion, weather and politics. The ports were intrinsically tied to the trade networks that connected Africa with Arabia and the broader Indian Ocean world.
van Overbeek, Leonard S.; Berg, Gabriele; Pirttilä, Anna Maria; Compant, Stéphane; Campisano, Andrea; Döring, Matthias; Sessitsch, Angela
2015-01-01
SUMMARY All plants are inhabited internally by diverse microbial communities comprising bacterial, archaeal, fungal, and protistic taxa. These microorganisms showing endophytic lifestyles play crucial roles in plant development, growth, fitness, and diversification. The increasing awareness of and information on endophytes provide insight into the complexity of the plant microbiome. The nature of plant-endophyte interactions ranges from mutualism to pathogenicity. This depends on a set of abiotic and biotic factors, including the genotypes of plants and microbes, environmental conditions, and the dynamic network of interactions within the plant biome. In this review, we address the concept of endophytism, considering the latest insights into evolution, plant ecosystem functioning, and multipartite interactions. PMID:26136581
Exploring the story, science, and adventure of small worlds
NASA Astrophysics Data System (ADS)
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-existing experiences, but as the visualization library expands and educators learn more about exploration-learning design, they may modify existing experiences and even build entirely new experiences to meet specific needs. In parallel, we are also developing a professional development program that builds understanding of the principles of ETX design.
A journey from reductionist to systemic cell biology aboard the schooner Tara.
Karsenti, Eric
2012-07-01
In this essay I describe my personal journey from reductionist to systems cell biology and describe how this in turn led to a 3-year sea voyage to explore complex ocean communities. In describing this journey, I hope to convey some important principles that I gleaned along the way. I realized that cellular functions emerge from multiple molecular interactions and that new approaches borrowed from statistical physics are required to understand the emergence of such complex systems. Then I wondered how such interaction networks developed during evolution. Because life first evolved in the oceans, it became a natural thing to start looking at the small organisms that compose the plankton in the world's oceans, of which 98% are … individual cells-hence the Tara Oceans voyage, which finished on 31 March 2012 in Lorient, France, after a 60,000-mile around-the-world journey that collected more than 30,000 samples from 153 sampling stations.
NASA Astrophysics Data System (ADS)
Simmons, Mike
2011-06-01
``Astronomers Without Borders'' is a new global organisational dedicated to furthering understanding and goodwill across national and cultural boundaries using the universal appeal of astronomy and space science. A growing network of affiliate organisations brings together clubs, magazines and other organizations involved in astronomy and space science. Forums, galleries, video conferences and other interactive technologies are used to connect participants around the world. Sharing of resources and direct connections through travel programs are also planned. One project, ``The World at Night'' (TWAN), has become an Special Project of IYA2009. TWAN creates wide-angle images of the night sky in important natural and historic settings around the world, dramatically demonstrating the universal nature and appeal of the night sky. ``Astronomers Without Borders'' is also a leader of the 100 Hours of Astronomy IYA2009 Global Cornerstone Project.
Fuxe, Kjell; Marcellino, Daniel; Borroto-Escuela, Dasiel Oscar; Frankowska, Malgorzata; Ferraro, Luca; Guidolin, Diego; Ciruela, Francisco; Agnati, Luigi F
2010-10-01
Based on indications of direct physical interactions between neuropeptide and monoamine receptors in the early 1980s, the term receptor-receptor interactions was introduced and later on the term receptor heteromerization in the early 1990s. Allosteric mechanisms allow an integrative activity to emerge either intramolecularly in G protein-coupled receptor (GPCR) monomers or intermolecularly via receptor-receptor interactions in GPCR homodimers, heterodimers, and receptor mosaics. Stable heteromers of Class A receptors may be formed that involve strong high energy arginine-phosphate electrostatic interactions. These receptor-receptor interactions markedly increase the repertoire of GPCR recognition, signaling and trafficking in which the minimal signaling unit in the GPCR homomers appears to be one receptor and one G protein. GPCR homomers and GPCR assemblies are not isolated but also directly interact with other proteins to form horizontal molecular networks at the plasma membrane.
ERIC Educational Resources Information Center
Hamada, Mayumi
2013-01-01
Facebook is, in most countries, a very popular Social Network Service (SNS). Since the launch of its service in Japan in 2008, it has been growing rapidly. As a platform for a link to the world, Facebook can also be used effectively for language learning in English as a foreign language (EFL) environments. The purpose of this project was to…
Can You Lead Me Now? Leading in the Complex World of Homeland Security
2007-09-01
Theories of Formal Social Systems (Thousand Oaks, California: Sage Publications, 1999), 5. 3 Richard N. Osborn, James G. Hunt, and Lawrence Jauch...midst of an organizational crisis, or when executives and employees use social networks to gather information and initiate solutions for survival...GROUNDED THEORY Grounded theory offers a different way of knowing and understanding social interactions and patterns. The positivistic and deductive
The brain's default network: anatomy, function, and relevance to disease.
Buckner, Randy L; Andrews-Hanna, Jessica R; Schacter, Daniel L
2008-03-01
Thirty years of brain imaging research has converged to define the brain's default network-a novel and only recently appreciated brain system that participates in internal modes of cognition. Here we synthesize past observations to provide strong evidence that the default network is a specific, anatomically defined brain system preferentially active when individuals are not focused on the external environment. Analysis of connectional anatomy in the monkey supports the presence of an interconnected brain system. Providing insight into function, the default network is active when individuals are engaged in internally focused tasks including autobiographical memory retrieval, envisioning the future, and conceiving the perspectives of others. Probing the functional anatomy of the network in detail reveals that it is best understood as multiple interacting subsystems. The medial temporal lobe subsystem provides information from prior experiences in the form of memories and associations that are the building blocks of mental simulation. The medial prefrontal subsystem facilitates the flexible use of this information during the construction of self-relevant mental simulations. These two subsystems converge on important nodes of integration including the posterior cingulate cortex. The implications of these functional and anatomical observations are discussed in relation to possible adaptive roles of the default network for using past experiences to plan for the future, navigate social interactions, and maximize the utility of moments when we are not otherwise engaged by the external world. We conclude by discussing the relevance of the default network for understanding mental disorders including autism, schizophrenia, and Alzheimer's disease.
An interactive web-based system using cloud for large-scale visual analytics
NASA Astrophysics Data System (ADS)
Kaseb, Ahmed S.; Berry, Everett; Rozolis, Erik; McNulty, Kyle; Bontrager, Seth; Koh, Youngsol; Lu, Yung-Hsiang; Delp, Edward J.
2015-03-01
Network cameras have been growing rapidly in recent years. Thousands of public network cameras provide tremendous amount of visual information about the environment. There is a need to analyze this valuable information for a better understanding of the world around us. This paper presents an interactive web-based system that enables users to execute image analysis and computer vision techniques on a large scale to analyze the data from more than 65,000 worldwide cameras. This paper focuses on how to use both the system's website and Application Programming Interface (API). Given a computer program that analyzes a single frame, the user needs to make only slight changes to the existing program and choose the cameras to analyze. The system handles the heterogeneity of the geographically distributed cameras, e.g. different brands, resolutions. The system allocates and manages Amazon EC2 and Windows Azure cloud resources to meet the analysis requirements.
Homophyly/Kinship Model: Naturally Evolving Networks
NASA Astrophysics Data System (ADS)
Li, Angsheng; Li, Jiankou; Pan, Yicheng; Yin, Xianchen; Yong, Xi
2015-10-01
It has been a challenge to understand the formation and roles of social groups or natural communities in the evolution of species, societies and real world networks. Here, we propose the hypothesis that homophyly/kinship is the intrinsic mechanism of natural communities, introduce the notion of the affinity exponent and propose the homophyly/kinship model of networks. We demonstrate that the networks of our model satisfy a number of topological, probabilistic and combinatorial properties and, in particular, that the robustness and stability of natural communities increase as the affinity exponent increases and that the reciprocity of the networks in our model decreases as the affinity exponent increases. We show that both homophyly/kinship and reciprocity are essential to the emergence of cooperation in evolutionary games and that the homophyly/kinship and reciprocity determined by the appropriate affinity exponent guarantee the emergence of cooperation in evolutionary games, verifying Darwin’s proposal that kinship and reciprocity are the means of individual fitness. We propose the new principle of structure entropy minimisation for detecting natural communities of networks and verify the functional module property and characteristic properties by a healthy tissue cell network, a citation network, some metabolic networks and a protein interaction network.
Homophyly/Kinship Model: Naturally Evolving Networks
Li, Angsheng; Li, Jiankou; Pan, Yicheng; Yin, Xianchen; Yong, Xi
2015-01-01
It has been a challenge to understand the formation and roles of social groups or natural communities in the evolution of species, societies and real world networks. Here, we propose the hypothesis that homophyly/kinship is the intrinsic mechanism of natural communities, introduce the notion of the affinity exponent and propose the homophyly/kinship model of networks. We demonstrate that the networks of our model satisfy a number of topological, probabilistic and combinatorial properties and, in particular, that the robustness and stability of natural communities increase as the affinity exponent increases and that the reciprocity of the networks in our model decreases as the affinity exponent increases. We show that both homophyly/kinship and reciprocity are essential to the emergence of cooperation in evolutionary games and that the homophyly/kinship and reciprocity determined by the appropriate affinity exponent guarantee the emergence of cooperation in evolutionary games, verifying Darwin’s proposal that kinship and reciprocity are the means of individual fitness. We propose the new principle of structure entropy minimisation for detecting natural communities of networks and verify the functional module property and characteristic properties by a healthy tissue cell network, a citation network, some metabolic networks and a protein interaction network. PMID:26478264
Multiscale unfolding of real networks by geometric renormalization
NASA Astrophysics Data System (ADS)
García-Pérez, Guillermo; Boguñá, Marián; Serrano, M. Ángeles
2018-06-01
Symmetries in physical theories denote invariance under some transformation, such as self-similarity under a change of scale. The renormalization group provides a powerful framework to study these symmetries, leading to a better understanding of the universal properties of phase transitions. However, the small-world property of complex networks complicates application of the renormalization group by introducing correlations between coexisting scales. Here, we provide a framework for the investigation of complex networks at different resolutions. The approach is based on geometric representations, which have been shown to sustain network navigability and to reveal the mechanisms that govern network structure and evolution. We define a geometric renormalization group for networks by embedding them into an underlying hidden metric space. We find that real scale-free networks show geometric scaling under this renormalization group transformation. We unfold the networks in a self-similar multilayer shell that distinguishes the coexisting scales and their interactions. This in turn offers a basis for exploring critical phenomena and universality in complex networks. It also affords us immediate practical applications, including high-fidelity smaller-scale replicas of large networks and a multiscale navigation protocol in hyperbolic space, which betters those on single layers.
Topology Analysis of Social Networks Extracted from Literature
2015-01-01
In a world where complex networks are an increasingly important part of science, it is interesting to question how the new reading of social realities they provide applies to our cultural background and in particular, popular culture. Are authors of successful novels able to reproduce social networks faithful to the ones found in reality? Is there any common trend connecting an author’s oeuvre, or a genre of fiction? Such an analysis could provide new insight on how we, as a culture, perceive human interactions and consume media. The purpose of the work presented in this paper is to define the signature of a novel’s story based on the topological analysis of its social network of characters. For this purpose, an automated tool was built that analyses the dialogs in novels, identifies characters and computes their relationships in a time-dependent manner in order to assess the network’s evolution over the course of the story. PMID:26039072
Dynamic Infinite Mixed-Membership Stochastic Blockmodel.
Fan, Xuhui; Cao, Longbing; Xu, Richard Yi Da
2015-09-01
Directional and pairwise measurements are often used to model interactions in a social network setting. The mixed-membership stochastic blockmodel (MMSB) was a seminal work in this area, and its ability has been extended. However, models such as MMSB face particular challenges in modeling dynamic networks, for example, with the unknown number of communities. Accordingly, this paper proposes a dynamic infinite mixed-membership stochastic blockmodel, a generalized framework that extends the existing work to potentially infinite communities inside a network in dynamic settings (i.e., networks are observed over time). Additional model parameters are introduced to reflect the degree of persistence among one's memberships at consecutive time stamps. Under this framework, two specific models, namely mixture time variant and mixture time invariant models, are proposed to depict two different time correlation structures. Two effective posterior sampling strategies and their results are presented, respectively, using synthetic and real-world data.
ePlant and the 3D data display initiative: integrative systems biology on the world wide web.
Fucile, Geoffrey; Di Biase, David; Nahal, Hardeep; La, Garon; Khodabandeh, Shokoufeh; Chen, Yani; Easley, Kante; Christendat, Dinesh; Kelley, Lawrence; Provart, Nicholas J
2011-01-10
Visualization tools for biological data are often limited in their ability to interactively integrate data at multiple scales. These computational tools are also typically limited by two-dimensional displays and programmatic implementations that require separate configurations for each of the user's computing devices and recompilation for functional expansion. Towards overcoming these limitations we have developed "ePlant" (http://bar.utoronto.ca/eplant) - a suite of open-source world wide web-based tools for the visualization of large-scale data sets from the model organism Arabidopsis thaliana. These tools display data spanning multiple biological scales on interactive three-dimensional models. Currently, ePlant consists of the following modules: a sequence conservation explorer that includes homology relationships and single nucleotide polymorphism data, a protein structure model explorer, a molecular interaction network explorer, a gene product subcellular localization explorer, and a gene expression pattern explorer. The ePlant's protein structure explorer module represents experimentally determined and theoretical structures covering >70% of the Arabidopsis proteome. The ePlant framework is accessed entirely through a web browser, and is therefore platform-independent. It can be applied to any model organism. To facilitate the development of three-dimensional displays of biological data on the world wide web we have established the "3D Data Display Initiative" (http://3ddi.org).
Network analysis of the Íslendinga sögur - the Sagas of Icelanders
NASA Astrophysics Data System (ADS)
Mac Carron, P.; Kenna, R.
2013-10-01
The Íslendinga sögur - or Sagas of Icelanders - constitute a collection of medieval literature set in Iceland around the late 9th to early 11th centuries, the so-called Saga Age. They purport to describe events during the period around the settlement of Iceland and the generations immediately following and constitute an important element of world literature thanks to their unique narrative style. Although their historicity is a matter of scholarly debate, the narratives contain interwoven and overlapping plots involving thousands of characters and interactions between them. Here we perform a network analysis of the Íslendinga sögur in an attempt to gather quantitative information on interrelationships between characters and to compare saga society to other social networks.
Constructing a Watts-Strogatz network from a small-world network with symmetric degree distribution.
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.
NASA Astrophysics Data System (ADS)
Loucif, Hemza; Boubetra, Abdelhak; Akrouf, Samir
2016-10-01
This paper aims to describe a new simplistic model dedicated to gauge the online influence of Twitter users based on a mixture of structural and interactional features. The model is an additive mathematical formulation which involves two main parts. The first part serves to measure the influence of the Twitter user on just his neighbourhood covering his followers. However, the second part evaluates the potential influence of the Twitter user beyond the circle of his followers. Particularly, it measures the likelihood that the tweets of the Twitter user will spread further within the social graph through the retweeting process. The model is tested on a data set involving four kinds of real-world egocentric networks. The empirical results reveal that an active ordinary user is more prominent than a non-active celebrity one. A simple comparison is conducted between the proposed model and two existing simplistic approaches. The results show that our model generates the most realistic influence scores due to its dealing with both explicit (structural and interactional) and implicit features.
General and craniofacial development are complex adaptive processes influenced by diversity.
Brook, A H; O'Donnell, M Brook; Hone, A; Hart, E; Hughes, T E; Smith, R N; Townsend, G C
2014-06-01
Complex systems are present in such diverse areas as social systems, economies, ecosystems and biology and, therefore, are highly relevant to dental research, education and practice. A Complex Adaptive System in biological development is a dynamic process in which, from interacting components at a lower level, higher level phenomena and structures emerge. Diversity makes substantial contributions to the performance of complex adaptive systems. It enhances the robustness of the process, allowing multiple responses to external stimuli as well as internal changes. From diversity comes variation in outcome and the possibility of major change; outliers in the distribution enhance the tipping points. The development of the dentition is a valuable, accessible model with extensive and reliable databases for investigating the role of complex adaptive systems in craniofacial and general development. The general characteristics of such systems are seen during tooth development: self-organization; bottom-up emergence; multitasking; self-adaptation; variation; tipping points; critical phases; and robustness. Dental findings are compatible with the Random Network Model, the Threshold Model and also with the Scale Free Network Model which has a Power Law distribution. In addition, dental development shows the characteristics of Modularity and Clustering to form Hierarchical Networks. The interactions between the genes (nodes) demonstrate Small World phenomena, Subgraph Motifs and Gene Regulatory Networks. Genetic mechanisms are involved in the creation and evolution of variation during development. The genetic factors interact with epigenetic and environmental factors at the molecular level and form complex networks within the cells. From these interactions emerge the higher level tissues, tooth germs and mineralized teeth. Approaching development in this way allows investigation of why there can be variations in phenotypes from identical genotypes; the phenotype is the outcome of perturbations in the cellular systems and networks, as well as of the genotype. Understanding and applying complexity theory will bring about substantial advances not only in dental research and education but also in the organization and delivery of oral health care. © 2014 Australian Dental Association.
Translocality, Network Structure, and Music Worlds: Underground Metal in the United Kingdom.
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.
Hodge Decomposition of Information Flow on Small-World Networks.
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.
Neural mechanisms tracking popularity in real-world social networks.
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.
Clique size and network characteristics in hyperlink cinema. Constraints of evolved psychology.
Krems, Jaimie Arona; Dunbar, R I M
2013-12-01
Hyperlink cinema is an emergent film genre that seeks to push the boundaries of the medium in order to mirror contemporary life in the globalized community. Films in the genre thus create an interacting network across space and time in such a way as to suggest that people's lives can intersect on scales that would not have been possible without modern technologies of travel and communication. This allows us to test the hypothesis that new kinds of media might permit us to break through the natural cognitive constraints that limit the number and quality of social relationships we can manage in the conventional face-to-face world. We used network analysis to test this hypothesis with data from 12 hyperlink films, using 10 motion pictures from a more conventional film genre as a control. We found few differences between hyperlink cinema films and the control genre, and few differences between hyperlink cinema films and either the real world or classical drama (e.g., Shakespeare's plays). Conversation group size seems to be especially resilient to alteration. It seems that, despite many efficiency advantages, modern media are unable to circumvent the constraints imposed by our evolved psychology.
Interactions of cultures and top people of Wikipedia from ranking of 24 language editions.
Eom, Young-Ho; Aragón, Pablo; Laniado, David; Kaltenbrunner, Andreas; Vigna, Sebastiano; Shepelyansky, Dima L
2015-01-01
Wikipedia is a huge global repository of human knowledge that can be leveraged to investigate interwinements between cultures. With this aim, we apply methods of Markov chains and Google matrix for the analysis of the hyperlink networks of 24 Wikipedia language editions, and rank all their articles by PageRank, 2DRank and CheiRank algorithms. Using automatic extraction of people names, we obtain the top 100 historical figures, for each edition and for each algorithm. We investigate their spatial, temporal, and gender distributions in dependence of their cultural origins. Our study demonstrates not only the existence of skewness with local figures, mainly recognized only in their own cultures, but also the existence of global historical figures appearing in a large number of editions. By determining the birth time and place of these persons, we perform an analysis of the evolution of such figures through 35 centuries of human history for each language, thus recovering interactions and entanglement of cultures over time. We also obtain the distributions of historical figures over world countries, highlighting geographical aspects of cross-cultural links. Considering historical figures who appear in multiple editions as interactions between cultures, we construct a network of cultures and identify the most influential cultures according to this network.
Interactions of Cultures and Top People of Wikipedia from Ranking of 24 Language Editions
Eom, Young-Ho; Aragón, Pablo; Laniado, David; Kaltenbrunner, Andreas; Vigna, Sebastiano; Shepelyansky, Dima L.
2015-01-01
Wikipedia is a huge global repository of human knowledge that can be leveraged to investigate interwinements between cultures. With this aim, we apply methods of Markov chains and Google matrix for the analysis of the hyperlink networks of 24 Wikipedia language editions, and rank all their articles by PageRank, 2DRank and CheiRank algorithms. Using automatic extraction of people names, we obtain the top 100 historical figures, for each edition and for each algorithm. We investigate their spatial, temporal, and gender distributions in dependence of their cultural origins. Our study demonstrates not only the existence of skewness with local figures, mainly recognized only in their own cultures, but also the existence of global historical figures appearing in a large number of editions. By determining the birth time and place of these persons, we perform an analysis of the evolution of such figures through 35 centuries of human history for each language, thus recovering interactions and entanglement of cultures over time. We also obtain the distributions of historical figures over world countries, highlighting geographical aspects of cross-cultural links. Considering historical figures who appear in multiple editions as interactions between cultures, we construct a network of cultures and identify the most influential cultures according to this network. PMID:25738291
Competitive intransitivity, population interaction structure, and strategy coexistence.
Laird, Robert A; Schamp, Brandon S
2015-01-21
Intransitive competition occurs when competing strategies cannot be listed in a hierarchy, but rather form loops-as in the game rock-paper-scissors. Due to its cyclic competitive replacement, competitive intransitivity promotes strategy coexistence, both in rock-paper-scissors and in higher-richness communities. Previous work has shown that this intransitivity-mediated coexistence is strongly influenced by spatially explicit interactions, compared to when populations are well mixed. Here, we extend and broaden this line of research and examine the impact on coexistence of intransitive competition taking place on a continuum of small-world networks linking spatial lattices and regular random graphs. We use simulations to show that the positive effect of competitive intransitivity on strategy coexistence holds when competition occurs on networks toward the spatial end of the continuum. However, in networks that are sufficiently disordered, increasingly violent fluctuations in strategy frequencies can lead to extinctions and the prevalence of monocultures. We further show that the degree of disorder that leads to the transition between these two regimes is positively dependent on population size; indeed for very large populations, intransitivity-mediated strategy coexistence may even be possible in regular graphs with completely random connections. Our results emphasize the importance of interaction structure in determining strategy dynamics and diversity. Copyright © 2014 Elsevier Ltd. All rights reserved.
Macroscopic description of complex adaptive networks coevolving with dynamic node states
NASA Astrophysics Data System (ADS)
Wiedermann, Marc; Donges, Jonathan F.; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen
2015-05-01
In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.
Scientific networking in disciplines
NASA Astrophysics Data System (ADS)
Chang, Ching-Ray; Marks, Ann; Dawson, Silvina Ponce
2013-03-01
Scientific networking occurs at various levels. There are regional and worldwide professional organizations that link together national physical societies (IUPAP, EPS, AAPPS, FeLaSoFi), providing a platform to exchange ideas and advance common agendas. National and international agencies have special lines of funding for scientific collaboration between groups of various countries. Some of these lines are targeted at improving science education at all levels. There are then personal networks that link people with common interests or who know each other for any reason. The International Conferences on Women in Physics have provided a unique opportunity for female physicists from all over the world to start a network of interactions that can involve all sorts of collaborative efforts. In the three-session workshop organized at ICWIP11, we discussed these various issues that the worldwide scientific community faces. In this paper we summarize the main ideas that surged during the meeting and provide the list of recommendations that were to start and keep an active network of female physicists and to foster scientific collaboration regionally and internationally.
LCOGT: A World-Wide Network of Robotic Telescopes
NASA Astrophysics Data System (ADS)
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).
Macroscopic description of complex adaptive networks coevolving with dynamic node states.
Wiedermann, Marc; Donges, Jonathan F; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen
2015-05-01
In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.
Transforming GIS data into functional road models for large-scale traffic simulation.
Wilkie, David; Sewall, Jason; Lin, Ming C
2012-06-01
There exists a vast amount of geographic information system (GIS) data that model road networks around the world as polylines with attributes. In this form, the data are insufficient for applications such as simulation and 3D visualization-tools which will grow in power and demand as sensor data become more pervasive and as governments try to optimize their existing physical infrastructure. In this paper, we propose an efficient method for enhancing a road map from a GIS database to create a geometrically and topologically consistent 3D model to be used in real-time traffic simulation, interactive visualization of virtual worlds, and autonomous vehicle navigation. The resulting representation provides important road features for traffic simulations, including ramps, highways, overpasses, legal merge zones, and intersections with arbitrary states, and it is independent of the simulation methodologies. We test the 3D models of road networks generated by our algorithm on real-time traffic simulation using both macroscopic and microscopic techniques.
NASA Astrophysics Data System (ADS)
Tost, Jordi; Olen, Stephanie M.; Bookhagen, Bodo; Heidmann, Frank
2017-04-01
The DIGENTI project ("DIGitaler ENtscheiderTIsch für das Naturgefahrenmanagement auf Basis von Satellitendaten und Volunteered Geographic Information") has the goal of quantifying and communicating the threat of natural hazards in the Cesar and La Guajira departments of northeast Colombia. The end-goal of the project is to provide an interactive guide for policy and decision makers, and for disaster relief coordination. Over the last years, abundant research has been done in order to analyze risk and to provide relevant information that improves effectiveness in disaster management. The communication of natural hazards risk has traditionally been built upon the estimation of hazard maps. In the context of landslides, hazard maps are used to depict potential danger from landslides and visualize the possibility of future landsliding throughout a given area. Such hazard maps provide a static snapshot of the local estimated threat in a region. However, in mountainous regions, a sufficiently large landslide in remote mountainous areas may represent a potential threat to settlements located downstream of a landslide event. The research presented here proposes an approach to visualize and interactively explore landslide risk by combining static hazard maps, hydrologic networks, and OpenStreetMap data. We estimated the potential for hillslope instabilities scenarios in the region of interest by using the TanDEM-X World DEM to calculate a suite Factor of Safety (FOS) maps. The FOS estimates the ratio of total resisting and driving forces to hillslope mass movements. By combining the World DEM with other environmental data (e.g., the Harmonized World Soil Database), we were able to create a suite of high-resolution landslide potential maps for the region of interest. The suite of FOS maps are calculated based on user-selectable parameters (e.g, total mass sliding thickness) that are not well constrained by field observations. We additionally use the TanDEM-X World DEM to calculate the hydrologic network for our study area. This allows not only to delineate the stream network, but also to calculate the area upstream of settlements located near rivers or streams that may be impacted by distal landsliding. By integrating the potential landslide hazard in the upstream area, we create a more robust threat estimate for vulnerable settlements. Disaster relief is not only affected by the physical consequences of a hazardous event, but also by the area's accessibility and mobility capability for internal displacements. We therefore also estimate the threat along roads and to other infrastructure (e.g. bridges). Decisions based on the area's road network have to be constantly taken, for instance, to send rescue teams or to coordinate humanitarian logistics. With our approach, we are able to identify critical spots along roads with high likelihood of getting damaged. Furthermore, given a particular potential landslide location and the calculation of its downstream hydrologic network, it is possible to estimate which settlements, roads or bridges may be at risk. This approach could be integrated into flooding early warning systems and into the disaster management response phase to foresee dangers and losses and plan evacuations on time.
A fault-tolerant small world topology control model in ad hoc networks for search and rescue
NASA Astrophysics Data System (ADS)
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.
Tracking the Evolution of Infrastructure Systems and Mass Responses Using Publically Available Data
Guan, Xiangyang; Chen, Cynthia; Work, Dan
2016-01-01
Networks can evolve even on a short-term basis. This phenomenon is well understood by network scientists, but receive little attention in empirical literature involving real-world networks. On one hand, this is due to the deceitfully fixed topology of some networks such as many physical infrastructures, whose evolution is often deemed unlikely to occur in short term; on the other hand, the lack of data prohibits scientists from studying subjects such as social networks that seem likely to evolve on a short-term basis. We show that both networks—the infrastructure network and social network—are able to demonstrate evolutionary dynamics at the system level even in the short-term, characterized by shifting between different phases as predicted in network science. We develop a methodology of tracking the evolutionary dynamics of the two networks by incorporating flows and the microstructure of networks such as motifs. This approach is applied to the human interaction network and two transportation networks (subway and taxi) in the context of Hurricane Sandy, using publically available Twitter data and transportation data. Our result shows that significant changes in the system-level structure of networks can be detected on a continuous basis. This result provides a promising channel for real-time tracking in the future. PMID:27907061
On the relation between the small world structure and scientific activities.
Ebadi, Ashkan; Schiffauerova, Andrea
2015-01-01
The modern science has become more complex and interdisciplinary in its nature which might encourage researchers to be more collaborative and get engaged in larger collaboration networks. Various aspects of collaboration networks have been examined so far to detect the most determinant factors in knowledge creation and scientific production. One of the network structures that recently attracted much theoretical attention is called small world. It has been suggested that small world can improve the information transmission among the network actors. In this paper, using the data on 12 periods of journal publications of Canadian researchers in natural sciences and engineering, the co-authorship networks of the researchers are created. Through measuring small world indicators, the small worldiness of the mentioned network and its relation with researchers' productivity, quality of their publications, and scientific team size are assessed. Our results show that the examined co-authorship network strictly exhibits the small world properties. In addition, it is suggested that in a small world network researchers expand their team size through getting connected to other experts of the field. This team size expansion may result in higher productivity of the whole team as a result of getting access to new resources, benefitting from the internal referring, and exchanging ideas among the team members. Moreover, although small world network is positively correlated with the quality of the articles in terms of both citation count and journal impact factor, it is negatively related with the average productivity of researchers in terms of the number of their publications.
On the Relation between the Small World Structure and Scientific Activities
Ebadi, Ashkan; Schiffauerova, Andrea
2015-01-01
The modern science has become more complex and interdisciplinary in its nature which might encourage researchers to be more collaborative and get engaged in larger collaboration networks. Various aspects of collaboration networks have been examined so far to detect the most determinant factors in knowledge creation and scientific production. One of the network structures that recently attracted much theoretical attention is called small world. It has been suggested that small world can improve the information transmission among the network actors. In this paper, using the data on 12 periods of journal publications of Canadian researchers in natural sciences and engineering, the co-authorship networks of the researchers are created. Through measuring small world indicators, the small worldiness of the mentioned network and its relation with researchers’ productivity, quality of their publications, and scientific team size are assessed. Our results show that the examined co-authorship network strictly exhibits the small world properties. In addition, it is suggested that in a small world network researchers expand their team size through getting connected to other experts of the field. This team size expansion may result in higher productivity of the whole team as a result of getting access to new resources, benefitting from the internal referring, and exchanging ideas among the team members. Moreover, although small world network is positively correlated with the quality of the articles in terms of both citation count and journal impact factor, it is negatively related with the average productivity of researchers in terms of the number of their publications. PMID:25780922
The ground truth about metadata and community detection in networks
Peel, Leto; Larremore, Daniel B.; Clauset, Aaron
2017-01-01
Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system’s components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate the performance of community detection algorithms by their ability to find so-called ground truth communities. This works well in synthetic networks with planted communities because these networks’ links are formed explicitly based on those known communities. However, there are no planted communities in real-world networks. Instead, it is standard practice to treat some observed discrete-valued node attributes, or metadata, as ground truth. We show that metadata are not the same as ground truth and that treating them as such induces severe theoretical and practical problems. We prove that no algorithm can uniquely solve community detection, and we prove a general No Free Lunch theorem for community detection, which implies that there can be no algorithm that is optimal for all possible community detection tasks. However, community detection remains a powerful tool and node metadata still have value, so a careful exploration of their relationship with network structure can yield insights of genuine worth. We illustrate this point by introducing two statistical techniques that can quantify the relationship between metadata and community structure for a broad class of models. We demonstrate these techniques using both synthetic and real-world networks, and for multiple types of metadata and community structures. PMID:28508065
Small-world bias of correlation networks: From brain to climate
NASA Astrophysics Data System (ADS)
Hlinka, Jaroslav; Hartman, David; Jajcay, Nikola; Tomeček, David; Tintěra, Jaroslav; Paluš, Milan
2017-03-01
Complex systems are commonly characterized by the properties of their graph representation. Dynamical complex systems are then typically represented by a graph of temporal dependencies between time series of state variables of their subunits. It has been shown recently that graphs constructed in this way tend to have relatively clustered structure, potentially leading to spurious detection of small-world properties even in the case of systems with no or randomly distributed true interactions. However, the strength of this bias depends heavily on a range of parameters and its relevance for real-world data has not yet been established. In this work, we assess the relevance of the bias using two examples of multivariate time series recorded in natural complex systems. The first is the time series of local brain activity as measured by functional magnetic resonance imaging in resting healthy human subjects, and the second is the time series of average monthly surface air temperature coming from a large reanalysis of climatological data over the period 1948-2012. In both cases, the clustering in the thresholded correlation graph is substantially higher compared with a realization of a density-matched random graph, while the shortest paths are relatively short, showing thus distinguishing features of small-world structure. However, comparable or even stronger small-world properties were reproduced in correlation graphs of model processes with randomly scrambled interconnections. This suggests that the small-world properties of the correlation matrices of these real-world systems indeed do not reflect genuinely the properties of the underlying interaction structure, but rather result from the inherent properties of correlation matrix.
Small-world bias of correlation networks: From brain to climate.
Hlinka, Jaroslav; Hartman, David; Jajcay, Nikola; Tomeček, David; Tintěra, Jaroslav; Paluš, Milan
2017-03-01
Complex systems are commonly characterized by the properties of their graph representation. Dynamical complex systems are then typically represented by a graph of temporal dependencies between time series of state variables of their subunits. It has been shown recently that graphs constructed in this way tend to have relatively clustered structure, potentially leading to spurious detection of small-world properties even in the case of systems with no or randomly distributed true interactions. However, the strength of this bias depends heavily on a range of parameters and its relevance for real-world data has not yet been established. In this work, we assess the relevance of the bias using two examples of multivariate time series recorded in natural complex systems. The first is the time series of local brain activity as measured by functional magnetic resonance imaging in resting healthy human subjects, and the second is the time series of average monthly surface air temperature coming from a large reanalysis of climatological data over the period 1948-2012. In both cases, the clustering in the thresholded correlation graph is substantially higher compared with a realization of a density-matched random graph, while the shortest paths are relatively short, showing thus distinguishing features of small-world structure. However, comparable or even stronger small-world properties were reproduced in correlation graphs of model processes with randomly scrambled interconnections. This suggests that the small-world properties of the correlation matrices of these real-world systems indeed do not reflect genuinely the properties of the underlying interaction structure, but rather result from the inherent properties of correlation matrix.
Small-World Network Spectra in Mean-Field Theory
NASA Astrophysics Data System (ADS)
Grabow, Carsten; Grosskinsky, Stefan; Timme, Marc
2012-05-01
Collective dynamics on small-world networks emerge in a broad range of systems with their spectra characterizing fundamental asymptotic features. Here we derive analytic mean-field predictions for the spectra of small-world models that systematically interpolate between regular and random topologies by varying their randomness. These theoretical predictions agree well with the actual spectra (obtained by numerical diagonalization) for undirected and directed networks and from fully regular to strongly random topologies. These results may provide analytical insights to empirically found features of dynamics on small-world networks from various research fields, including biology, physics, engineering, and social science.
Zullo, Letizia; Chiappalone, Michela; Martinoia, Sergio; Benfenati, Fabio
2012-01-01
Developed biological systems are endowed with the ability of interacting with the environment; they sense the external state and react to it by changing their own internal state. Many attempts have been made to build ‘hybrids’ with the ability of perceiving, modifying and reacting to external modifications. Investigation of the rules that govern network changes in a hybrid system may lead to finding effective methods for ‘programming’ the neural tissue toward a desired task. Here we show a new perspective in the use of cortical neuronal cultures from embryonic mouse as a working platform to study targeted synaptic modifications. Differently from the common timing-based methods applied in bio-hybrids robotics, here we evaluated the importance of endogenous spike timing in the information processing. We characterized the influence of a spike-patterned stimulus in determining changes in neuronal synchronization (connectivity strength and precision) of the evoked spiking and bursting activity in the network. We show that tailoring the stimulation pattern upon a neuronal spike timing induces the network to respond stronger and more precisely to the stimulation. Interestingly, the induced modifications are conveyed more consistently in the burst timing. This increase in strength and precision may be a key in the interaction of the network with the external world and may be used to induce directional changes in bio-hybrid systems. PMID:23145147
Toward a formalized account of attitudes: The Causal Attitude Network (CAN) model.
Dalege, Jonas; Borsboom, Denny; van Harreveld, Frenk; van den Berg, Helma; Conner, Mark; van der Maas, Han L J
2016-01-01
This article introduces the Causal Attitude Network (CAN) model, which conceptualizes attitudes as networks consisting of evaluative reactions and interactions between these reactions. Relevant evaluative reactions include beliefs, feelings, and behaviors toward the attitude object. Interactions between these reactions arise through direct causal influences (e.g., the belief that snakes are dangerous causes fear of snakes) and mechanisms that support evaluative consistency between related contents of evaluative reactions (e.g., people tend to align their belief that snakes are useful with their belief that snakes help maintain ecological balance). In the CAN model, the structure of attitude networks conforms to a small-world structure: evaluative reactions that are similar to each other form tight clusters, which are connected by a sparser set of "shortcuts" between them. We argue that the CAN model provides a realistic formalized measurement model of attitudes and therefore fills a crucial gap in the attitude literature. Furthermore, the CAN model provides testable predictions for the structure of attitudes and how they develop, remain stable, and change over time. Attitude strength is conceptualized in terms of the connectivity of attitude networks and we show that this provides a parsimonious account of the differences between strong and weak attitudes. We discuss the CAN model in relation to possible extensions, implication for the assessment of attitudes, and possibilities for further study. (c) 2015 APA, all rights reserved).
Technical Considerations in Remote LIMS Access via the World Wide Web
Schlabach, David M.
2005-01-01
The increased dependency on the World Wide Web by both laboratories and their customers has led LIMS developers to take advantage of thin-client web applications that provide both remote data entry and manipulation, along with remote reporting functionality. Use of an LIMS through a web browser allows a person to interact with a distant application, providing both remote administration and real-time analytical result delivery from virtually anywhere in the world. While there are many benefits of web-based LIMS applications, some concern must be given to these new methods of system architecture before justifying them as a suitable replacement for their traditional client-server systems. Developers and consumers alike must consider the security aspects of introducing a wide area network capable system into a production environment, as well as the concerns of data integrity and usability. PMID:18924736
NASA Astrophysics Data System (ADS)
Straka, Mika J.; Caldarelli, Guido; Squartini, Tiziano; Saracco, Fabio
2018-04-01
Bipartite networks provide an insightful representation of many systems, ranging from mutualistic networks of species interactions to investment networks in finance. The analyses of their topological structures have revealed the ubiquitous presence of properties which seem to characterize many—apparently different—systems. Nestedness, for example, has been observed in biological plant-pollinator as well as in country-product exportation networks. Due to the interdisciplinary character of complex networks, tools developed in one field, for example ecology, can greatly enrich other areas of research, such as economy and finance, and vice versa. With this in mind, we briefly review several entropy-based bipartite null models that have been recently proposed and discuss their application to real-world systems. The focus on these models is motivated by the fact that they show three very desirable features: analytical character, general applicability, and versatility. In this respect, entropy-based methods have been proven to perform satisfactorily both in providing benchmarks for testing evidence-based null hypotheses and in reconstructing unknown network configurations from partial information. Furthermore, entropy-based models have been successfully employed to analyze ecological as well as economic systems. As an example, the application of entropy-based null models has detected early-warning signals, both in economic and financial systems, of the 2007-2008 world crisis. Moreover, they have revealed a statistically-significant export specialization phenomenon of country export baskets in international trade, a result that seems to reconcile Ricardo's hypothesis in classical economics with recent findings on the (empirical) diversification industrial production at the national level. Finally, these null models have shown that the information contained in the nestedness is already accounted for by the degree sequence of the corresponding graphs.
Theoretical microbial ecology without species
NASA Astrophysics Data System (ADS)
Tikhonov, Mikhail
2017-09-01
Ecosystems are commonly conceptualized as networks of interacting species. However, partitioning natural diversity of organisms into discrete units is notoriously problematic and mounting experimental evidence raises the intriguing question whether this perspective is appropriate for the microbial world. Here an alternative formalism is proposed that does not require postulating the existence of species as fundamental ecological variables and provides a naturally hierarchical description of community dynamics. This formalism allows approaching the species problem from the opposite direction. While the classical models treat a world of imperfectly clustered organism types as a perturbation around well-clustered species, the presented approach allows gradually adding structure to a fully disordered background. The relevance of this theoretical construct for describing highly diverse natural ecosystems is discussed.
Brain Network Analysis from High-Resolution EEG Signals
NASA Astrophysics Data System (ADS)
de Vico Fallani, Fabrizio; Babiloni, Fabio
Over the last decade, there has been a growing interest in the detection of the functional connectivity in the brain from different neuroelectromagnetic and hemodynamic signals recorded by several neuro-imaging devices such as the functional Magnetic Resonance Imaging (fMRI) scanner, electroencephalography (EEG) and magnetoencephalography (MEG) apparatus. Many methods have been proposed and discussed in the literature with the aim of estimating the functional relationships among different cerebral structures. However, the necessity of an objective comprehension of the network composed by the functional links of different brain regions is assuming an essential role in the Neuroscience. Consequently, there is a wide interest in the development and validation of mathematical tools that are appropriate to spot significant features that could describe concisely the structure of the estimated cerebral networks. The extraction of salient characteristics from brain connectivity patterns is an open challenging topic, since often the estimated cerebral networks have a relative large size and complex structure. Recently, it was realized that the functional connectivity networks estimated from actual brain-imaging technologies (MEG, fMRI and EEG) can be analyzed by means of the graph theory. Since a graph is a mathematical representation of a network, which is essentially reduced to nodes and connections between them, the use of a theoretical graph approach seems relevant and useful as firstly demonstrated on a set of anatomical brain networks. In those studies, the authors have employed two characteristic measures, the average shortest path L and the clustering index C, to extract respectively the global and local properties of the network structure. They have found that anatomical brain networks exhibit many local connections (i.e. a high C) and few random long distance connections (i.e. a low L). These values identify a particular model that interpolate between a regular lattice and a random structure. Such a model has been designated as "small-world" network in analogy with the concept of the small-world phenomenon observed more than 30 years ago in social systems. In a similar way, many types of functional brain networks have been analyzed according to this mathematical approach. In particular, several studies based on different imaging techniques (fMRI, MEG and EEG) have found that the estimated functional networks showed small-world characteristics. In the functional brain connectivity context, these properties have been demonstrated to reflect an optimal architecture for the information processing and propagation among the involved cerebral structures. However, the performance of cognitive and motor tasks as well as the presence of neural diseases has been demonstrated to affect such a small-world topology, as revealed by the significant changes of L and C. Moreover, some functional brain networks have been mostly found to be very unlike the random graphs in their degree-distribution, which gives information about the allocation of the functional links within the connectivity pattern. It was demonstrated that the degree distributions of these networks follow a power-law trend. For this reason those networks are called "scale-free". They still exhibit the small-world phenomenon but tend to contain few nodes that act as highly connected "hubs". Scale-free networks are known to show resistance to failure, facility of synchronization and fast signal processing. Hence, it would be important to see whether the scaling properties of the functional brain networks are altered under various pathologies or experimental tasks. The present Chapter proposes a theoretical graph approach in order to evaluate the functional connectivity patterns obtained from high-resolution EEG signals. In this way, the "Brain Network Analysis" (in analogy with the Social Network Analysis that has emerged as a key technique in modern sociology) represents an effective methodology improving the comprehension of the complex interactions in the brain.
Effect of resource constraints on intersimilar coupled networks.
Shai, S; Dobson, S
2012-12-01
Most real-world networks do not live in isolation but are often coupled together within a larger system. Recent studies have shown that intersimilarity between coupled networks increases the connectivity of the overall system. However, unlike connected nodes in a single network, coupled nodes often share resources, like time, energy, and memory, which can impede flow processes through contention when intersimilarly coupled. We study a model of a constrained susceptible-infected-recovered (SIR) process on a system consisting of two random networks sharing the same set of nodes, where nodes are limited to interact with (and therefore infect) a maximum number of neighbors at each epidemic time step. We obtain that, in agreement with previous studies, when no limit exists (regular SIR model), positively correlated (intersimilar) coupling results in a lower epidemic threshold than negatively correlated (interdissimilar) coupling. However, in the case of the constrained SIR model, the obtained epidemic threshold is lower with negatively correlated coupling. The latter finding differentiates our work from previous studies and provides another step towards revealing the qualitative differences between single and coupled networks.
Effect of resource constraints on intersimilar coupled networks
NASA Astrophysics Data System (ADS)
Shai, S.; Dobson, S.
2012-12-01
Most real-world networks do not live in isolation but are often coupled together within a larger system. Recent studies have shown that intersimilarity between coupled networks increases the connectivity of the overall system. However, unlike connected nodes in a single network, coupled nodes often share resources, like time, energy, and memory, which can impede flow processes through contention when intersimilarly coupled. We study a model of a constrained susceptible-infected-recovered (SIR) process on a system consisting of two random networks sharing the same set of nodes, where nodes are limited to interact with (and therefore infect) a maximum number of neighbors at each epidemic time step. We obtain that, in agreement with previous studies, when no limit exists (regular SIR model), positively correlated (intersimilar) coupling results in a lower epidemic threshold than negatively correlated (interdissimilar) coupling. However, in the case of the constrained SIR model, the obtained epidemic threshold is lower with negatively correlated coupling. The latter finding differentiates our work from previous studies and provides another step towards revealing the qualitative differences between single and coupled networks.
Threshold cascades with response heterogeneity in multiplex networks
NASA Astrophysics Data System (ADS)
Lee, Kyu-Min; Brummitt, Charles D.; Goh, K.-I.
2014-12-01
Threshold cascade models have been used to describe the spread of behavior in social networks and cascades of default in financial networks. In some cases, these networks may have multiple kinds of interactions, such as distinct types of social ties or distinct types of financial liabilities; furthermore, nodes may respond in different ways to influence from their neighbors of multiple types. To start to capture such settings in a stylized way, we generalize a threshold cascade model to a multiplex network in which nodes follow one of two response rules: some nodes activate when, in at least one layer, a large enough fraction of neighbors is active, while the other nodes activate when, in all layers, a large enough fraction of neighbors is active. Varying the fractions of nodes following either rule facilitates or inhibits cascades. Near the inhibition regime, global cascades appear discontinuously as the network density increases; however, the cascade grows more slowly over time. This behavior suggests a way in which various collective phenomena in the real world could appear abruptly yet slowly.
Invited Commentary: Evolution of Social Networks, Health, and the Role of Epidemiology.
Aiello, Allison E
2017-06-01
Almost 40 years ago, Berkman and Syme demonstrated that social networks were related to the risk of early mortality (Am J Epidemiol. 1979;109(2):186-204). Their study was highly innovative because they directly measured and quantified social networks in a large prospective population-based survey with mortality follow-up. The results of the study showed robust network gradients, whereby those with fewer networks and weaker social ties had significantly higher mortality rates. The important influence of social networks that Berkman and Syme noted many years ago is likely to heighten in the future, as demographic characteristics shift and individuals become more inclined to socialize through online platforms instead of real-world interactions. Berkman and Syme's research in 1979 continues to play a key role in shaping recent efforts to uncover the influence of social networks on health. Looking back on their findings may help epidemiologists better understand the importance of both online and offline networks for population health today. © The Author 2017. Published by Oxford University Press on behalf of the Johns Hopkins Bloomberg School of Public Health. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.
Rowe, James H; Topping, Jennifer F; Liu, Junli; Lindsey, Keith
2016-07-01
Understanding the mechanisms regulating root development under drought conditions is an important question for plant biology and world agriculture. We examine the effect of osmotic stress on abscisic acid (ABA), cytokinin and ethylene responses and how they mediate auxin transport, distribution and root growth through effects on PIN proteins. We integrate experimental data to construct hormonal crosstalk networks to formulate a systems view of root growth regulation by multiple hormones. Experimental analysis shows: that ABA-dependent and ABA-independent stress responses increase under osmotic stress, but cytokinin responses are only slightly reduced; inhibition of root growth under osmotic stress does not require ethylene signalling, but auxin can rescue root growth and meristem size; osmotic stress modulates auxin transporter levels and localization, reducing root auxin concentrations; PIN1 levels are reduced under stress in an ABA-dependent manner, overriding ethylene effects; and the interplay among ABA, ethylene, cytokinin and auxin is tissue-specific, as evidenced by differential responses of PIN1 and PIN2 to osmotic stress. Combining experimental analysis with network construction reveals that ABA regulates root growth under osmotic stress conditions via an interacting hormonal network with cytokinin, ethylene and auxin. © 2016 The Authors. New Phytologist © 2016 New Phytologist Trust.
Trade-offs between robustness and small-world effect in complex networks
Peng, Guan-Sheng; Tan, Suo-Yi; Wu, Jun; Holme, Petter
2016-01-01
Robustness and small-world effect are two crucial structural features of complex networks and have attracted increasing attention. However, little is known about the relation between them. Here we demonstrate that, there is a conflicting relation between robustness and small-world effect for a given degree sequence. We suggest that the robustness-oriented optimization will weaken the small-world effect and vice versa. Then, we propose a multi-objective trade-off optimization model and develop a heuristic algorithm to obtain the optimal trade-off topology for robustness and small-world effect. We show that the optimal network topology exhibits a pronounced core-periphery structure and investigate the structural properties of the optimized networks in detail. PMID:27853301
Generalized synchronization between chimera states
NASA Astrophysics Data System (ADS)
Andrzejak, Ralph G.; Ruzzene, Giulia; Malvestio, Irene
2017-05-01
Networks of coupled oscillators in chimera states are characterized by an intriguing interplay of synchronous and asynchronous motion. While chimera states were initially discovered in mathematical model systems, there is growing experimental and conceptual evidence that they manifest themselves also in natural and man-made networks. In real-world systems, however, synchronization and desynchronization are not only important within individual networks but also across different interacting networks. It is therefore essential to investigate if chimera states can be synchronized across networks. To address this open problem, we use the classical setting of ring networks of non-locally coupled identical phase oscillators. We apply diffusive drive-response couplings between pairs of such networks that individually show chimera states when there is no coupling between them. The drive and response networks are either identical or they differ by a variable mismatch in their phase lag parameters. In both cases, already for weak couplings, the coherent domain of the response network aligns its position to the one of the driver networks. For identical networks, a sufficiently strong coupling leads to identical synchronization between the drive and response. For non-identical networks, we use the auxiliary system approach to demonstrate that generalized synchronization is established instead. In this case, the response network continues to show a chimera dynamics which however remains distinct from the one of the driver. Hence, segregated synchronized and desynchronized domains in individual networks congregate in generalized synchronization across networks.
NASA Astrophysics Data System (ADS)
She, Qi; Chen, Guanrong; Chan, Rosa H. M.
2016-02-01
The amount of publicly accessible experimental data has gradually increased in recent years, which makes it possible to reconsider many longstanding questions in neuroscience. In this paper, an efficient framework is presented for reconstructing functional connectivity using experimental spike-train data. A modified generalized linear model (GLM) with L1-norm penalty was used to investigate 10 datasets. These datasets contain spike-train data collected from the entorhinal-hippocampal region in the brains of rats performing different tasks. The analysis shows that entorhinal-hippocampal network of well-trained rats demonstrated significant small-world features. It is found that the connectivity structure generated by distance-dependent models is responsible for the observed small-world features of the reconstructed networks. The models are utilized to simulate a subset of units recorded from a large biological neural network using multiple electrodes. Two metrics for quantifying the small-world-ness both suggest that the reconstructed network from the sampled nodes estimates a more prominent small-world-ness feature than that of the original unknown network when the number of recorded neurons is small. Finally, this study shows that it is feasible to adjust the estimated small-world-ness results based on the number of neurons recorded to provide a more accurate reference of the network property.
Fashion, Cooperation, and Social Interactions
Cao, Zhigang; Gao, Haoyu; Qu, Xinglong; Yang, Mingmin; Yang, Xiaoguang
2013-01-01
Fashion plays such a crucial rule in the evolution of culture and society that it is regarded as a second nature to the human being. Also, its impact on economy is quite nontrivial. On what is fashionable, interestingly, there are two viewpoints that are both extremely widespread but almost opposite: conformists think that what is popular is fashionable, while rebels believe that being different is the essence. Fashion color is fashionable in the first sense, and Lady Gaga in the second. We investigate a model where the population consists of the afore-mentioned two groups of people that are located on social networks (a spatial cellular automata network and small-world networks). This model captures two fundamental kinds of social interactions (coordination and anti-coordination) simultaneously, and also has its own interest to game theory: it is a hybrid model of pure competition and pure cooperation. This is true because when a conformist meets a rebel, they play the zero sum matching pennies game, which is pure competition. When two conformists (rebels) meet, they play the (anti-) coordination game, which is pure cooperation. Simulation shows that simple social interactions greatly promote cooperation: in most cases people can reach an extraordinarily high level of cooperation, through a selfish, myopic, naive, and local interacting dynamic (the best response dynamic). We find that degree of synchronization also plays a critical role, but mostly on the negative side. Four indices, namely cooperation degree, average satisfaction degree, equilibrium ratio and complete ratio, are defined and applied to measure people’s cooperation levels from various angles. Phase transition, as well as emergence of many interesting geographic patterns in the cellular automata network, is also observed. PMID:23382799
Organization of complex networks
NASA Astrophysics Data System (ADS)
Kitsak, Maksim
Many large complex systems can be successfully analyzed using the language of graphs and networks. Interactions between the objects in a network are treated as links connecting nodes. This approach to understanding the structure of networks is an important step toward understanding the way corresponding complex systems function. Using the tools of statistical physics, we analyze the structure of networks as they are found in complex systems such as the Internet, the World Wide Web, and numerous industrial and social networks. In the first chapter we apply the concept of self-similarity to the study of transport properties in complex networks. Self-similar or fractal networks, unlike non-fractal networks, exhibit similarity on a range of scales. We find that these fractal networks have transport properties that differ from those of non-fractal networks. In non-fractal networks, transport flows primarily through the hubs. In fractal networks, the self-similar structure requires any transport to also flow through nodes that have only a few connections. We also study, in models and in real networks, the crossover from fractal to non-fractal networks that occurs when a small number of random interactions are added by means of scaling techniques. In the second chapter we use k-core techniques to study dynamic processes in networks. The k-core of a network is the network's largest component that, within itself, exhibits all nodes with at least k connections. We use this k-core analysis to estimate the relative leadership positions of firms in the Life Science (LS) and Information and Communication Technology (ICT) sectors of industry. We study the differences in the k-core structure between the LS and the ICT sectors. We find that the lead segment (highest k-core) of the LS sector, unlike that of the ICT sector, is remarkably stable over time: once a particular firm enters the lead segment, it is likely to remain there for many years. In the third chapter we study how epidemics spread though networks. Our results indicate that a virus is more likely to infect a large area of a network if it originates at a node contained within k-core of high index k.
Analysis and logical modeling of biological signaling transduction networks
NASA Astrophysics Data System (ADS)
Sun, Zhongyao
The study of network theory and its application span across a multitude of seemingly disparate fields of science and technology: computer science, biology, social science, linguistics, etc. It is the intrinsic similarities embedded in the entities and the way they interact with one another in these systems that link them together. In this dissertation, I present from both the aspect of theoretical analysis and the aspect of application three projects, which primarily focus on signal transduction networks in biology. In these projects, I assembled a network model through extensively perusing literature, performed model-based simulations and validation, analyzed network topology, and proposed a novel network measure. The application of network modeling to the system of stomatal opening in plants revealed a fundamental question about the process that has been left unanswered in decades. The novel measure of the redundancy of signal transduction networks with Boolean dynamics by calculating its maximum node-independent elementary signaling mode set accurately predicts the effect of single node knockout in such signaling processes. The three projects as an organic whole advance the understanding of a real system as well as the behavior of such network models, giving me an opportunity to take a glimpse at the dazzling facets of the immense world of network science.
Hello! Kids Network around the World.
ERIC Educational Resources Information Center
Lynes, Kristine
1996-01-01
Describes Kids Network, an educational network available from the National Geographic Society that allows students in grades four through six to become part of research teams that include students from around the world. Computer hardware requirements and a list of Kids Network research questions are listed in a sidebar. (JMV)
A simple model clarifies the complicated relationships of complex networks
Zheng, Bojin; Wu, Hongrun; Kuang, Li; Qin, Jun; Du, Wenhua; Wang, Jianmin; Li, Deyi
2014-01-01
Real-world networks such as the Internet and WWW have many common traits. Until now, hundreds of models were proposed to characterize these traits for understanding the networks. Because different models used very different mechanisms, it is widely believed that these traits origin from different causes. However, we find that a simple model based on optimisation can produce many traits, including scale-free, small-world, ultra small-world, Delta-distribution, compact, fractal, regular and random networks. Moreover, by revising the proposed model, the community-structure networks are generated. By this model and the revised versions, the complicated relationships of complex networks are illustrated. The model brings a new universal perspective to the understanding of complex networks and provide a universal method to model complex networks from the viewpoint of optimisation. PMID:25160506
Small worlds in space: Synchronization, spatial and relational modularity
NASA Astrophysics Data System (ADS)
Brede, M.
2010-06-01
In this letter we investigate networks that have been optimized to realize a trade-off between enhanced synchronization and cost of wire to connect the nodes in space. Analyzing the evolved arrangement of nodes in space and their corresponding network topology, a class of small-world networks characterized by spatial and network modularity is found. More precisely, for low cost of wire optimal configurations are characterized by a division of nodes into two spatial groups with maximum distance from each other, whereas network modularity is low. For high cost of wire, the nodes organize into several distinct groups in space that correspond to network modules connected on a ring. In between, spatially and relationally modular small-world networks are found.
Google matrix analysis of directed networks
NASA Astrophysics Data System (ADS)
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.
Technology-based suicide prevention: current applications and future directions.
Luxton, David D; June, Jennifer D; Kinn, Julie T
2011-01-01
This review reports on current and emerging technologies for suicide prevention. Technology-based programs discussed include interactive educational and social networking Web sites, e-mail outreach, and programs that use mobile devices and texting. We describe innovative applications such as virtual worlds, gaming, and text analysis that are currently being developed and applied to suicide prevention and outreach programs. We also discuss the benefits and limitations of technology-based applications and discuss future directions for their use.
Technogeopologistics: Supply Networks and Military Power in the Industrial Age
2012-06-01
communication ( LOCs ) to the battlefield in ever more complex ways. Thus, logistics exhibit sensitivity to technological change. Logistics also have...War will serve as a lens for sea versus land LOCs . With the addition of the air LOC under the inter-war airpower thinkers Giulio Douhet and Billy...Mitchell, the Second World War will be a testing ground for all three domains. The interaction among sea, land, and air LOCs with both the industrial
Classification of complex networks based on similarity of topological network features
NASA Astrophysics Data System (ADS)
Attar, Niousha; Aliakbary, Sadegh
2017-09-01
Over the past few decades, networks have been widely used to model real-world phenomena. Real-world networks exhibit nontrivial topological characteristics and therefore, many network models are proposed in the literature for generating graphs that are similar to real networks. Network models reproduce nontrivial properties such as long-tail degree distributions or high clustering coefficients. In this context, we encounter the problem of selecting the network model that best fits a given real-world network. The need for a model selection method reveals the network classification problem, in which a target-network is classified into one of the candidate network models. In this paper, we propose a novel network classification method which is independent of the network size and employs an alignment-free metric of network comparison. The proposed method is based on supervised machine learning algorithms and utilizes the topological similarities of networks for the classification task. The experiments show that the proposed method outperforms state-of-the-art methods with respect to classification accuracy, time efficiency, and robustness to noise.
Power and Relation in the World Polity: The INGO Network Country Score, 1978-1998
ERIC Educational Resources Information Center
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…
Do the rich get richer? An empirical analysis of the Bitcoin transaction network.
Kondor, Dániel; Pósfai, Márton; Csabai, István; Vattay, Gábor
2014-01-01
The possibility to analyze everyday monetary transactions is limited by the scarcity of available data, as this kind of information is usually considered highly sensitive. Present econophysics models are usually employed on presumed random networks of interacting agents, and only some macroscopic properties (e.g. the resulting wealth distribution) are compared to real-world data. In this paper, we analyze Bitcoin, which is a novel digital currency system, where the complete list of transactions is publicly available. Using this dataset, we reconstruct the network of transactions and extract the time and amount of each payment. We analyze the structure of the transaction network by measuring network characteristics over time, such as the degree distribution, degree correlations and clustering. We find that linear preferential attachment drives the growth of the network. We also study the dynamics taking place on the transaction network, i.e. the flow of money. We measure temporal patterns and the wealth accumulation. Investigating the microscopic statistics of money movement, we find that sublinear preferential attachment governs the evolution of the wealth distribution. We report a scaling law between the degree and wealth associated to individual nodes.
Do the Rich Get Richer? An Empirical Analysis of the Bitcoin Transaction Network
Kondor, Dániel; Pósfai, Márton; Csabai, István; Vattay, Gábor
2014-01-01
The possibility to analyze everyday monetary transactions is limited by the scarcity of available data, as this kind of information is usually considered highly sensitive. Present econophysics models are usually employed on presumed random networks of interacting agents, and only some macroscopic properties (e.g. the resulting wealth distribution) are compared to real-world data. In this paper, we analyze Bitcoin, which is a novel digital currency system, where the complete list of transactions is publicly available. Using this dataset, we reconstruct the network of transactions and extract the time and amount of each payment. We analyze the structure of the transaction network by measuring network characteristics over time, such as the degree distribution, degree correlations and clustering. We find that linear preferential attachment drives the growth of the network. We also study the dynamics taking place on the transaction network, i.e. the flow of money. We measure temporal patterns and the wealth accumulation. Investigating the microscopic statistics of money movement, we find that sublinear preferential attachment governs the evolution of the wealth distribution. We report a scaling law between the degree and wealth associated to individual nodes. PMID:24505257
NASA Astrophysics Data System (ADS)
Vespignani, A.
2004-09-01
Networks have been recently recognized as playing a central role in understanding a wide range of systems spanning diverse scientific domains such as physics and biology, economics, computer science and information technology. Specific examples run from the structure of the Internet and the World Wide Web to the interconnections of finance agents and ecological food webs. These networked systems are generally made by many components whose microscopic interactions give rise to global structures characterized by emergent collective behaviour and complex topological properties. In this context the statistical physics approach finds a natural application since it attempts to explain the various large-scale statistical properties of networks in terms of local interactions governing the dynamical evolution of the constituent elements of the system. It is not by chance then that many of the seminal papers in the field have been published in the physics literature, and have nevertheless made a considerable impact on other disciplines. Indeed, a truly interdisciplinary approach is required in order to understand each specific system of interest, leading to a very interesting cross-fertilization between different scientific areas defining the emergence of a new research field sometimes called network science. The book of Dorogovtsev and Mendes is the first comprehensive monograph on this new scientific field. It provides a thorough presentation of the forefront research activities in the area of complex networks, with an extensive sampling of the disciplines involved and the kinds of problems that form the subject of inquiry. The book starts with a short introduction to graphs and network theory that introduces the tools and mathematical background needed for the rest of the book. The following part is devoted to an extensive presentation of the empirical analysis of real-world networks. While for obvious reasons of space the authors cannot analyse in every detail all the various examples, they provide the reader with a general vista that makes clear the relevance of network science to a wide range of natural and man-made systems. Two chapters are then committed to the detailed exposition of the statistical physics approach to equilibrium and non-equilibrium networks. The authors are two leading players in the area of network theory and offer a very careful and complete presentation of the statistical physics theory of evolving networks. Finally, in the last two chapters, the authors focus on various consequences of network topology for dynamical and physical phenomena occurring in these kinds of structures. The book is completed by a very extensive bibliography and some useful appendices containing some technical points arising in the mathematical discussion and data analysis. The book's mathematical level is fairly advanced and allows a coherent and unified framework for the study of networked structure. The book is targeted at mathematicians, physicists and social scientists alike. It will be appreciated by everybody working in the network area, and especially by any researcher or student entering the field that would like to have a reference text on the latest developments in network science.
Current-flow efficiency of networks
NASA Astrophysics Data System (ADS)
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.
Efficient discovery of overlapping communities in massive networks
Gopalan, Prem K.; Blei, David M.
2013-01-01
Detecting overlapping communities is essential to analyzing and exploring natural networks such as social networks, biological networks, and citation networks. However, most existing approaches do not scale to the size of networks that we regularly observe in the real world. In this paper, we develop a scalable approach to community detection that discovers overlapping communities in massive real-world networks. Our approach is based on a Bayesian model of networks that allows nodes to participate in multiple communities, and a corresponding algorithm that naturally interleaves subsampling from the network and updating an estimate of its communities. We demonstrate how we can discover the hidden community structure of several real-world networks, including 3.7 million US patents, 575,000 physics articles from the arXiv preprint server, and 875,000 connected Web pages from the Internet. Furthermore, we demonstrate on large simulated networks that our algorithm accurately discovers the true community structure. This paper opens the door to using sophisticated statistical models to analyze massive networks. PMID:23950224
Realistic terrain visualization based on 3D virtual world technology
NASA Astrophysics Data System (ADS)
Huang, Fengru; Lin, Hui; Chen, Bin; Xiao, Cai
2009-09-01
The rapid advances in information technologies, e.g., network, graphics processing, and virtual world, have provided challenges and opportunities for new capabilities in information systems, Internet applications, and virtual geographic environments, especially geographic visualization and collaboration. In order to achieve meaningful geographic capabilities, we need to explore and understand how these technologies can be used to construct virtual geographic environments to help to engage geographic research. The generation of three-dimensional (3D) terrain plays an important part in geographical visualization, computer simulation, and virtual geographic environment applications. The paper introduces concepts and technologies of virtual worlds and virtual geographic environments, explores integration of realistic terrain and other geographic objects and phenomena of natural geographic environment based on SL/OpenSim virtual world technologies. Realistic 3D terrain visualization is a foundation of construction of a mirror world or a sand box model of the earth landscape and geographic environment. The capabilities of interaction and collaboration on geographic information are discussed as well. Further virtual geographic applications can be developed based on the foundation work of realistic terrain visualization in virtual environments.
Realistic terrain visualization based on 3D virtual world technology
NASA Astrophysics Data System (ADS)
Huang, Fengru; Lin, Hui; Chen, Bin; Xiao, Cai
2010-11-01
The rapid advances in information technologies, e.g., network, graphics processing, and virtual world, have provided challenges and opportunities for new capabilities in information systems, Internet applications, and virtual geographic environments, especially geographic visualization and collaboration. In order to achieve meaningful geographic capabilities, we need to explore and understand how these technologies can be used to construct virtual geographic environments to help to engage geographic research. The generation of three-dimensional (3D) terrain plays an important part in geographical visualization, computer simulation, and virtual geographic environment applications. The paper introduces concepts and technologies of virtual worlds and virtual geographic environments, explores integration of realistic terrain and other geographic objects and phenomena of natural geographic environment based on SL/OpenSim virtual world technologies. Realistic 3D terrain visualization is a foundation of construction of a mirror world or a sand box model of the earth landscape and geographic environment. The capabilities of interaction and collaboration on geographic information are discussed as well. Further virtual geographic applications can be developed based on the foundation work of realistic terrain visualization in virtual environments.
Collective relaxation dynamics of small-world networks
NASA Astrophysics Data System (ADS)
Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc
2015-05-01
Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N , average degree k , and topological randomness q . We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q , including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.
Collective relaxation dynamics of small-world networks.
Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc
2015-05-01
Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N, average degree k, and topological randomness q. We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q, including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.
Suppressing disease spreading by using information diffusion on multiplex networks.
Wang, Wei; Liu, Quan-Hui; Cai, Shi-Min; Tang, Ming; Braunstein, Lidia A; Stanley, H Eugene
2016-07-06
Although there is always an interplay between the dynamics of information diffusion and disease spreading, the empirical research on the systemic coevolution mechanisms connecting these two spreading dynamics is still lacking. Here we investigate the coevolution mechanisms and dynamics between information and disease spreading by utilizing real data and a proposed spreading model on multiplex network. Our empirical analysis finds asymmetrical interactions between the information and disease spreading dynamics. Our results obtained from both the theoretical framework and extensive stochastic numerical simulations suggest that an information outbreak can be triggered in a communication network by its own spreading dynamics or by a disease outbreak on a contact network, but that the disease threshold is not affected by information spreading. Our key finding is that there is an optimal information transmission rate that markedly suppresses the disease spreading. We find that the time evolution of the dynamics in the proposed model qualitatively agrees with the real-world spreading processes at the optimal information transmission rate.
Tracing the Attention of Moving Citizens
NASA Astrophysics Data System (ADS)
Wu, Lingfei; Wang, Cheng-Jun
2016-09-01
With the widespread use of mobile computing devices in contemporary society, our trajectories in the physical space and virtual world are increasingly closely connected. Using the anonymous smartphone data of 1 × 105 users in a major city of China, we study the interplay between online and offline human behaviors by constructing the mobility network (offline) and the attention network (online). Using the network renormalization technique, we find that they belong to two different classes: the mobility network is small-world, whereas the attention network is fractal. We then divide the city into different areas based on the features of the mobility network discovered under renormalization. Interestingly, this spatial division manifests the location-based online behaviors, for example shopping, dating, and taxi-requesting. Finally, we offer a geometric network model to help us understand the relationship between small-world and fractal networks.
Neural mechanisms tracking popularity in real-world social networks
Zerubavel, Noam; Bearman, Peter S.; Weber, Jochen; Ochsner, Kevin N.
2015-01-01
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. PMID:26598684
Geometric Assortative Growth Model for Small-World Networks
2014-01-01
It has been shown that both humanly constructed and natural networks are often characterized by small-world phenomenon and assortative mixing. In this paper, we propose a geometrically growing model for small-world networks. The model displays both tunable small-world phenomenon and tunable assortativity. We obtain analytical solutions of relevant topological properties such as order, size, degree distribution, degree correlation, clustering, transitivity, and diameter. It is also worth noting that the model can be viewed as a generalization for an iterative construction of Farey graphs. PMID:24578661
Association of Facebook Use With Compromised Well-Being: A Longitudinal Study.
Shakya, Holly B; Christakis, Nicholas A
2017-02-01
Face-to-face social interactions enhance well-being. With the ubiquity of social media, important questions have arisen about the impact of online social interactions. In the present study, we assessed the associations of both online and offline social networks with several subjective measures of well-being. We used 3 waves (2013, 2014, and 2015) of data from 5,208 subjects in the nationally representative Gallup Panel Social Network Study survey, including social network measures, in combination with objective measures of Facebook use. We investigated the associations of Facebook activity and real-world social network activity with self-reported physical health, self-reported mental health, self-reported life satisfaction, and body mass index. Our results showed that overall, the use of Facebook was negatively associated with well-being. For example, a 1-standard-deviation increase in "likes clicked" (clicking "like" on someone else's content), "links clicked" (clicking a link to another site or article), or "status updates" (updating one's own Facebook status) was associated with a decrease of 5%-8% of a standard deviation in self-reported mental health. These associations were robust to multivariate cross-sectional analyses, as well as to 2-wave prospective analyses. The negative associations of Facebook use were comparable to or greater in magnitude than the positive impact of offline interactions, which suggests a possible tradeoff between offline and online relationships. © The Author 2017. Published by Oxford University Press on behalf of the Johns Hopkins Bloomberg School of Public Health. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.
When People See News from a Non-Western Perspective: Cable News Network's "World Report."
ERIC Educational Resources Information Center
Stewart, Robert K.
Much of what Americans "see" of the world is focused through the prism of the American news media. Broadcast journalists, in particular, provide the images that help shape viewers' ideas of the world. The recent introduction on U.S. television of Cable News Network's (CNN) "World Report" now provides the opportunity for…
Protecting posted genes: social networking and the limits of GINA.
Soo-Jin Lee, Sandra; Borgelt, Emily
2014-01-01
The combination of decreased genotyping costs and prolific social media use is fueling a personal genetic testing industry in which consumers purchase and interact with genetic risk information online. Consumers and their genetic risk profiles are protected in some respects by the 2008 federal Genetic Information Nondiscrimination Act (GINA), which forbids the discriminatory use of genetic information by employers and health insurers; however, practical and technical limitations undermine its enforceability, given the everyday practices of online social networking and its impact on the workplace. In the Web 2.0 era, employers in most states can legally search about job candidates and employees online, probing social networking sites for personal information that might bear on hiring and employment decisions. We examine GINA's protections for online sharing of genetic information as well as its limitations, and propose policy recommendations to address current gaps that leave employees' genetic information vulnerable in a Web-based world.
Economic and Social Factors in Designing Disease Control Strategies for Epidemics on Networks
NASA Astrophysics Data System (ADS)
Kleczkowski, A.; Dybiec, B.; Gilligan, C. A.
2006-11-01
Models for control of epidemics on local, global and small-world networks are considered, with only partial information accessible about the status of individuals and their connections. The main goal of an effective control measure is to stop the epidemic at a lowest possible cost, including treatment and cost necessary to track the disease spread. We show that delay in detection of infectious individuals and presence of long-range links are the most important factors determining the cost. However, the details of long-range links are usually the least-known element of the social interactions due to their occasional character and potentially short life-span. We show that under some conditions on the probability of disease spread, it is advisable to attempt to track those links, even if this involves additional costs. Thus, collecting some additional knowledge about the network structure might be beneficial to ensure a successful and cost-effective control.
Network formation in a multi-asset artificial stock market
NASA Astrophysics Data System (ADS)
Wu, Songtao; He, Jianmin; Li, Shouwei; Wang, Chao
2018-04-01
A multi-asset artificial stock market is developed. In the market, stocks are assigned to a number of sectors and traded by heterogeneous investors. The mechanism of continuous double auction is employed to clear order book and form daily closed prices. Simulation results of prices at the sector level show an intra-sector similarity and inter-sector distinctiveness, and returns of individual stocks have stylized facts that are ubiquitous in the real-world stock market. We find that the market risk factor has critical impact on both network topology transition and connection formation, and that sector risk factors account for the formation of intra-sector links and sector-based local interaction. In addition, the number of community in threshold-based networks is correlated negatively and positively with the value of correlation coefficients and the ratio of intra-sector links, which are respectively determined by intensity of sector risk factors and the number of sectors.
Optimal deployment of resources for maximizing impact in spreading processes
2017-01-01
The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of “influential spreaders” for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings, the problem is often characterized by heterogeneous interactions and requires interventions in a dynamic fashion over a finite time window via a restricted set of controllable nodes. The optimal distribution of available resources hence results from an interplay between network topology and spreading dynamics. We show how these problems can be addressed as particular instances of a universal analytical framework based on a scalable dynamic message-passing approach and demonstrate the efficacy of the method on a variety of real-world examples. PMID:28900013
Forced disappearance in an era of globalization: biopolitics, shadow networks, and imagined worlds.
Rozema, Ralph
2011-01-01
In this article, I argue that the practice of forced disappearance of persons on the part of paramilitary groups has become linked to specific processes of globalization. Global flows related to biopolitics, global crime networks, and dehumanizing imaginations reproduced by mass media together constitute a driving force behind forced disappearances. Drawing on ethnographic fieldwork in the Colombian city of Medellín, I analyze how these global flows interact with local armed actors, helping create a climate conducive to forced disappearance. These mechanisms in Colombia show similarities to those in some African and Asian countries. Gaining insight into the mechanisms behind forced disappearance may help prevent it from occurring in the future. Enhancing social inclusion of residents, unraveling the transnational crime networks in which perpetrators are involved, and disseminating rehumanizing images of victims all contribute to curbing the practice of forced disappearance.
NASA Astrophysics Data System (ADS)
Wen, Shaobo; An, Haizhong; Chen, Zhihua; Liu, Xueyong
2017-08-01
In traditional econometrics, a time series must be in a stationary sequence. However, it usually shows time-varying fluctuations, and it remains a challenge to execute a multiscale analysis of the data and discover the topological characteristics of conduction in different scales. Wavelet analysis and complex networks in physical statistics have special advantages in solving these problems. We select the exchange rate variable from the Chinese market and the commodity price index variable from the world market as the time series of our study. We explore the driving factors behind the behavior of the two markets and their topological characteristics in three steps. First, we use the Kalman filter to find the optimal estimation of the relationship between the two markets. Second, wavelet analysis is used to extract the scales of the relationship that are driven by different frequency wavelets. Meanwhile, we search for the actual economic variables corresponding to different frequency wavelets. Finally, a complex network is used to search for the transfer characteristics of the combination of states driven by different frequency wavelets. The results show that statistical physics have a unique advantage over traditional econometrics. The Chinese market has time-varying impacts on the world market: it has greater influence when the world economy is stable and less influence in times of turmoil. The process of forming the state combination is random. Transitions between state combinations have a clustering feature. Based on these characteristics, we can effectively reduce the information burden on investors and correctly respond to the government's policy mix.
A microbased shared virtual world prototype
NASA Technical Reports Server (NTRS)
Pitts, Gerald; Robinson, Mark; Strange, Steve
1993-01-01
Virtual reality (VR) allows sensory immersion and interaction with a computer-generated environment. The user adopts a physical interface with the computer, through Input/Output devices such as a head-mounted display, data glove, mouse, keyboard, or monitor, to experience an alternate universe. What this means is that the computer generates an environment which, in its ultimate extension, becomes indistinguishable from the real world. 'Imagine a wraparound television with three-dimensional programs, including three-dimensional sound, and solid objects that you can pick up and manipulate, even feel with your fingers and hands.... 'Imagine that you are the creator as well as the consumer of your artificial experience, with the power to use a gesture or word to remold the world you see and hear and feel. That part is not fiction... three-dimensional computer graphics, input/output devices, computer models that constitute a VR system make it possible, today, to immerse yourself in an artificial world and to reach in and reshape it.' Our research's goal was to propose a feasibility experiment in the construction of a networked virtual reality system, making use of current personal computer (PC) technology. The prototype was built using Borland C compiler, running on an IBM 486 33 MHz and a 386 33 MHz. Each game currently is represented as an IPX client on a non-dedicated Novell server. We initially posed the two questions: (1) Is there a need for networked virtual reality? (2) In what ways can the technology be made available to the most people possible?
An Adaptive Complex Network Model for Brain Functional Networks
Gomez Portillo, Ignacio J.; Gleiser, Pablo M.
2009-01-01
Brain functional networks are graph representations of activity in the brain, where the vertices represent anatomical regions and the edges their functional connectivity. These networks present a robust small world topological structure, characterized by highly integrated modules connected sparsely by long range links. Recent studies showed that other topological properties such as the degree distribution and the presence (or absence) of a hierarchical structure are not robust, and show different intriguing behaviors. In order to understand the basic ingredients necessary for the emergence of these complex network structures we present an adaptive complex network model for human brain functional networks. The microscopic units of the model are dynamical nodes that represent active regions of the brain, whose interaction gives rise to complex network structures. The links between the nodes are chosen following an adaptive algorithm that establishes connections between dynamical elements with similar internal states. We show that the model is able to describe topological characteristics of human brain networks obtained from functional magnetic resonance imaging studies. In particular, when the dynamical rules of the model allow for integrated processing over the entire network scale-free non-hierarchical networks with well defined communities emerge. On the other hand, when the dynamical rules restrict the information to a local neighborhood, communities cluster together into larger ones, giving rise to a hierarchical structure, with a truncated power law degree distribution. PMID:19738902
Coevolutionary dynamics of opinion propagation and social balance: The key role of small-worldness
NASA Astrophysics Data System (ADS)
Chen, Yan; Chen, Lixue; Sun, Xian; Zhang, Kai; Zhang, Jie; Li, Ping
2014-03-01
The propagation of various opinions in social networks, which influences human inter-relationships and even social structure, and hence is a most important part of social life. We have incorporated social balance into opinion propagation in social networks are influenced by social balance. The edges in networks can represent both friendly or hostile relations, and change with the opinions of individual nodes. We introduce a model to characterize the coevolutionary dynamics of these two dynamical processes on Watts-Strogatz (WS) small-world network. We employ two distinct evolution rules (i) opinion renewal; and (ii) relation adjustment. By changing the rewiring probability, and thus the small-worldness of the WS network, we found that the time for the system to reach balanced states depends critically on both the average path length and clustering coefficient of the network, which is different than other networked process like epidemic spreading. In particular, the system equilibrates most quickly when the underlying network demonstrates strong small-worldness, i.e., small average path lengths and large clustering coefficient. We also find that opinion clusters emerge in the process of the network approaching the global equilibrium, and a measure of global contrariety is proposed to quantify the balanced state of a social network.
NASA Astrophysics Data System (ADS)
Dong, Lin-Rong
2010-09-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.
Tracing the Attention of Moving Citizens
Wu, Lingfei; Wang, Cheng-Jun
2016-01-01
With the widespread use of mobile computing devices in contemporary society, our trajectories in the physical space and virtual world are increasingly closely connected. Using the anonymous smartphone data of 1 × 105 users in a major city of China, we study the interplay between online and offline human behaviors by constructing the mobility network (offline) and the attention network (online). Using the network renormalization technique, we find that they belong to two different classes: the mobility network is small-world, whereas the attention network is fractal. We then divide the city into different areas based on the features of the mobility network discovered under renormalization. Interestingly, this spatial division manifests the location-based online behaviors, for example shopping, dating, and taxi-requesting. Finally, we offer a geometric network model to help us understand the relationship between small-world and fractal networks. PMID:27608929
A fractal growth model: Exploring the connection pattern of hubs in complex networks
NASA Astrophysics Data System (ADS)
Li, Dongyan; Wang, Xingyuan; Huang, Penghe
2017-04-01
Fractal is ubiquitous in many real-world networks. Previous researches showed that the strong disassortativity between the hub-nodes on all length scales was the key principle that gave rise to the fractal architecture of networks. Although fractal property emerged in some models, there were few researches about the fractal growth model and quantitative analyses about the strength of the disassortativity for fractal model. In this paper, we proposed a novel inverse renormalization method, named Box-based Preferential Attachment (BPA), to build the fractal growth models in which the Preferential Attachment was performed at box level. The proposed models provided a new framework that demonstrated small-world-fractal transition. Also, we firstly demonstrated the statistical characteristic of connection patterns of the hubs in fractal networks. The experimental results showed that, given proper growing scale and added edges, the proposed models could clearly show pure small-world or pure fractal or both of them. It also showed that the hub connection ratio showed normal distribution in many real-world networks. At last, the comparisons of connection pattern between the proposed models and the biological and technical networks were performed. The results gave useful reference for exploring the growth principle and for modeling the connection patterns for real-world networks.
Controllability of multiplex, multi-time-scale networks
NASA Astrophysics Data System (ADS)
Pósfai, Márton; Gao, Jianxi; Cornelius, Sean P.; Barabási, Albert-László; D'Souza, Raissa M.
2016-09-01
The paradigm of layered networks is used to describe many real-world systems, from biological networks to social organizations and transportation systems. While recently there has been much progress in understanding the general properties of multilayer networks, our understanding of how to control such systems remains limited. One fundamental aspect that makes this endeavor challenging is that each layer can operate at a different time scale; thus, we cannot directly apply standard ideas from structural control theory of individual networks. Here we address the problem of controlling multilayer and multi-time-scale networks focusing on two-layer multiplex networks with one-to-one interlayer coupling. We investigate the practically relevant case when the control signal is applied to the nodes of one layer. We develop a theory based on disjoint path covers to determine the minimum number of inputs (Ni) necessary for full control. We show that if both layers operate on the same time scale, then the network structure of both layers equally affect controllability. In the presence of time-scale separation, controllability is enhanced if the controller interacts with the faster layer: Ni decreases as the time-scale difference increases up to a critical time-scale difference, above which Ni remains constant and is completely determined by the faster layer. We show that the critical time-scale difference is large if layer I is easy and layer II is hard to control in isolation. In contrast, control becomes increasingly difficult if the controller interacts with the layer operating on the slower time scale and increasing time-scale separation leads to increased Ni, again up to a critical value, above which Ni still depends on the structure of both layers. This critical value is largely determined by the longest path in the faster layer that does not involve cycles. By identifying the underlying mechanisms that connect time-scale difference and controllability for a simplified model, we provide crucial insight into disentangling how our ability to control real interacting complex systems is affected by a variety of sources of complexity.
Brain anatomical networks in early human brain development.
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.
Cerina, Federica; Zhu, Zhen; Chessa, Alessandro; Riccaboni, Massimo
2015-01-01
Production systems, traditionally analyzed as almost independent national systems, are increasingly connected on a global scale. Only recently becoming available, the World Input-Output Database (WIOD) is one of the first efforts to construct the global multi-regional input-output (GMRIO) tables. By viewing the world input-output system as an interdependent network where the nodes are the individual industries in different economies and the edges are the monetary goods flows between industries, we analyze respectively the global, regional, and local network properties of the so-called world input-output network (WION) and document its evolution over time. At global level, we find that the industries are highly but asymmetrically connected, which implies that micro shocks can lead to macro fluctuations. At regional level, we find that the world production is still operated nationally or at most regionally as the communities detected are either individual economies or geographically well defined regions. Finally, at local level, for each industry we compare the network-based measures with the traditional methods of backward linkages. We find that the network-based measures such as PageRank centrality and community coreness measure can give valuable insights into identifying the key industries. PMID:26222389
Social Networks Use, Loneliness and Academic Performance among University Students
ERIC Educational Resources Information Center
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…
Theory for the Emergence of Modularity in Complex Systems
NASA Astrophysics Data System (ADS)
Deem, Michael; Park, Jeong-Man
2013-03-01
Biological systems are modular, and this modularity evolves over time and in different environments. A number of observations have been made of increased modularity in biological systems under increased environmental pressure. We here develop a theory for the dynamics of modularity in these systems. We find a principle of least action for the evolved modularity at long times. In addition, we find a fluctuation dissipation relation for the rate of change of modularity at short times. We discuss a number of biological and social systems that can be understood with this framework. The modularity of the protein-protein interaction network increases when yeast are exposed to heat shock, and the modularity of the protein-protein networks in both yeast and E. coli appears to have increased over evolutionary time. Food webs in low-energy, stressful environments are more modular than those in plentiful environments, arid ecologies are more modular during droughts, and foraging of sea otters is more modular when food is limiting. The modularity of social networks changes over time: stock brokers instant messaging networks are more modular under stressful market conditions, criminal networks are more modular under increased police pressure, and world trade network modularity has decreased
Game among interdependent networks: The impact of rationality on system robustness
NASA Astrophysics Data System (ADS)
Fan, Yuhang; Cao, Gongze; He, Shibo; Chen, Jiming; Sun, Youxian
2016-12-01
Many real-world systems are composed of interdependent networks that rely on one another. Such networks are typically designed and operated by different entities, who aim at maximizing their own payoffs. There exists a game among these entities when designing their own networks. In this paper, we study the game investigating how the rational behaviors of entities impact the system robustness. We first introduce a mathematical model to quantify the interacting payoffs among varying entities. Then we study the Nash equilibrium of the game and compare it with the optimal social welfare. We reveal that the cooperation among different entities can be reached to maximize the social welfare in continuous game only when the average degree of each network is constant. Therefore, the huge gap between Nash equilibrium and optimal social welfare generally exists. The rationality of entities makes the system inherently deficient and even renders it extremely vulnerable in some cases. We analyze our model for two concrete systems with continuous strategy space and discrete strategy space, respectively. Furthermore, we uncover some factors (such as weakening coupled strength of interdependent networks, designing a suitable topology dependence of the system) that help reduce the gap and the system vulnerability.
The evolution of cooperation on geographical networks
NASA Astrophysics Data System (ADS)
Li, Yixiao; Wang, Yi; Sheng, Jichuan
2017-11-01
We study evolutionary public goods game on geographical networks, i.e., complex networks which are located on a geographical plane. The geographical feature effects in two ways: In one way, the geographically-induced network structure influences the overall evolutionary dynamics, and, in the other way, the geographical length of an edge influences the cost when the two players at the two ends interact. For the latter effect, we design a new cost function of cooperators, which simply assumes that the longer the distance between two players, the higher cost the cooperator(s) of them have to pay. In this study, network substrates are generated by a previous spatial network model with a cost-benefit parameter controlling the network topology. Our simulations show that the greatest promotion of cooperation is achieved in the intermediate regime of the parameter, in which empirical estimates of various railway networks fall. Further, we investigate how the distribution of edges' geographical costs influences the evolutionary dynamics and consider three patterns of the distribution: an approximately-equal distribution, a diverse distribution, and a polarized distribution. For normal geographical networks which are generated using intermediate values of the cost-benefit parameter, a diverse distribution hinders the evolution of cooperation, whereas a polarized distribution lowers the threshold value of the amplification factor for cooperation in public goods game. These results are helpful for understanding the evolution of cooperation on real-world geographical networks.
Vaccination intervention on epidemic dynamics in networks
NASA Astrophysics Data System (ADS)
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.
NASA Astrophysics Data System (ADS)
Chorozoglou, D.; Kugiumtzis, D.; Papadimitriou, E.
2018-06-01
The seismic hazard assessment in the area of Greece is attempted by studying the earthquake network structure, such as small-world and random. In this network, a node represents a seismic zone in the study area and a connection between two nodes is given by the correlation of the seismic activity of two zones. To investigate the network structure, and particularly the small-world property, the earthquake correlation network is compared with randomized ones. Simulations on multivariate time series of different length and number of variables show that for the construction of randomized networks the method randomizing the time series performs better than methods randomizing directly the original network connections. Based on the appropriate randomization method, the network approach is applied to time series of earthquakes that occurred between main shocks in the territory of Greece spanning the period 1999-2015. The characterization of networks on sliding time windows revealed that small-world structure emerges in the last time interval, shortly before the main shock.
Exploring network operations for data and information networks
NASA Astrophysics Data System (ADS)
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.
Network marketing on a small-world network
NASA Astrophysics Data System (ADS)
Kim, Beom Jun; Jun, Tackseung; Kim, Jeong-Yoo; Choi, M. Y.
2006-02-01
We investigate a dynamic model of network marketing in a small-world network structure artificially constructed similarly to the Watts-Strogatz network model. Different from the traditional marketing, consumers can also play the role of the manufacturer's selling agents in network marketing, which is stimulated by the referral fee the manufacturer offers. As the wiring probability α is increased from zero to unity, the network changes from the one-dimensional regular directed network to the star network where all but one player are connected to one consumer. The price p of the product and the referral fee r are used as free parameters to maximize the profit of the manufacturer. It is observed that at α=0 the maximized profit is constant independent of the network size N while at α≠0, it increases linearly with N. This is in parallel to the small-world transition. It is also revealed that while the optimal value of p stays at an almost constant level in a broad range of α, that of r is sensitive to a change in the network structure. The consumer surplus is also studied and discussed.
Guidelines for a Changing World
ERIC Educational Resources Information Center
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…
Graph theoretical analysis of complex networks in the brain
Stam, Cornelis J; Reijneveld, Jaap C
2007-01-01
Since the discovery of small-world and scale-free networks the study of complex systems from a network perspective has taken an enormous flight. In recent years many important properties of complex networks have been delineated. In particular, significant progress has been made in understanding the relationship between the structural properties of networks and the nature of dynamics taking place on these networks. For instance, the 'synchronizability' of complex networks of coupled oscillators can be determined by graph spectral analysis. These developments in the theory of complex networks have inspired new applications in the field of neuroscience. Graph analysis has been used in the study of models of neural networks, anatomical connectivity, and functional connectivity based upon fMRI, EEG and MEG. These studies suggest that the human brain can be modelled as a complex network, and may have a small-world structure both at the level of anatomical as well as functional connectivity. This small-world structure is hypothesized to reflect an optimal situation associated with rapid synchronization and information transfer, minimal wiring costs, as well as a balance between local processing and global integration. The topological structure of functional networks is probably restrained by genetic and anatomical factors, but can be modified during tasks. There is also increasing evidence that various types of brain disease such as Alzheimer's disease, schizophrenia, brain tumours and epilepsy may be associated with deviations of the functional network topology from the optimal small-world pattern. PMID:17908336
The architecture of dynamic reservoir in the echo state network
NASA Astrophysics Data System (ADS)
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.
Behm-Morawitz, Elizabeth; Lewallen, Jennifer; Choi, Grace
2016-02-01
Health self-efficacy, or the beliefs in one's capabilities to perform health behaviors, is a significant factor in eliciting health behavior change, such as weight loss. Research has demonstrated that virtual embodiment has the potential to alter one's psychology and physicality, particularly in health contexts; however, little is known about the impacts embodiment in a virtual world has on health self-efficacy. The present research is a randomized controlled trial (N = 90) examining the effectiveness of virtual embodiment and play in a social virtual world (Second Life [SL]) for increasing health self-efficacy (exercise and nutrition efficacy) among overweight adults. Participants were randomly assigned to a 3D social virtual world (avatar virtual interaction experimental condition), 2D social networking site (no avatar virtual interaction control condition), or no intervention (no virtual interaction control condition). The findings of this study provide initial evidence for the use of SL to improve exercise efficacy and to support weight loss. Results also suggest that individuals who have higher self-presence with their avatar reap more benefits. Finally, quantitative findings are triangulated with qualitative data to increase confidence in the results and provide richer insight into the perceived effectiveness and limitations of SL for meeting weight loss goals. Themes resulting from the qualitative analysis indicate that participation in SL can improve motivation and efficacy to try new physical activities; however, individuals who have a dislike for video games may not be benefitted by avatar-based virtual interventions. Implications for research on the transformative potential of virtual embodiment and self-presence in general are discussed.
The Conundrum of Functional Brain Networks: Small-World Efficiency or Fractal Modularity
Gallos, Lazaros K.; Sigman, Mariano; Makse, Hernán A.
2012-01-01
The human brain has been studied at multiple scales, from neurons, circuits, areas with well-defined anatomical and functional boundaries, to large-scale functional networks which mediate coherent cognition. In a recent work, we addressed the problem of the hierarchical organization in the brain through network analysis. Our analysis identified functional brain modules of fractal structure that were inter-connected in a small-world topology. Here, we provide more details on the use of network science tools to elaborate on this behavior. We indicate the importance of using percolation theory to highlight the modular character of the functional brain network. These modules present a fractal, self-similar topology, identified through fractal network methods. When we lower the threshold of correlations to include weaker ties, the network as a whole assumes a small-world character. These weak ties are organized precisely as predicted by theory maximizing information transfer with minimal wiring costs. PMID:22586406
Critical behavior of the contact process on small-world networks
NASA Astrophysics Data System (ADS)
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.
Ubiquitousness of link-density and link-pattern communities in real-world networks
NASA Astrophysics Data System (ADS)
Šubelj, L.; Bajec, M.
2012-01-01
Community structure appears to be an intrinsic property of many complex real-world networks. However, recent work shows that real-world networks reveal even more sophisticated modules than classical cohesive (link-density) communities. In particular, networks can also be naturally partitioned according to similar patterns of connectedness among the nodes, revealing link-pattern communities. We here propose a propagation based algorithm that can extract both link-density and link-pattern communities, without any prior knowledge of the true structure. The algorithm was first validated on different classes of synthetic benchmark networks with community structure, and also on random networks. We have further applied the algorithm to different social, information, technological and biological networks, where it indeed reveals meaningful (composites of) link-density and link-pattern communities. The results thus seem to imply that, similarly as link-density counterparts, link-pattern communities appear ubiquitous in nature and design.
Learning Without Boundaries: A NASA - National Guard Bureau Distance Learning Partnership
NASA Technical Reports Server (NTRS)
Anderson, Susan H.; Chilelli, Christopher J.; Picard, Stephan
2003-01-01
With a variety of high-quality live interactive educational programs originating at the Johnson Space Center in Houston, Texas and other space and research centers, the US space agency NASA (National Aeronautics and Space Administration) has a proud track record of connecting with students throughout the world and stimulating their creativity and collaborative skills by teaching them underlying scientific and technological underpinnings of space exploration. However, NASA desires to expand its outreach capability for this type of interactive instruction. In early 2002, NASA and the National Guard Bureau -- using the Guard's nationwide system of state-ofthe-art classrooms and high bandwidth network -- began a collaboration to extend the reach of NASA content and educational programs to more of America's young people. Already, hundreds of elementary, middle, and high school students have visited Guard e-Learning facilities and participated in interactive NASA learning events. Topics have included experimental flight, satellite imagery-interpretation, and Mars exploration. Through this partnership, NASA and the National Guard are enabling local school systems throughout the United States (and, increasingly, the world) to use the excitement of space flight to encourage their students to become passionate about the possibility of one day serving as scientists, mathematicians, technologists, and engineers. At the 54th International Astronautical Conference MAJ Stephan Picard, the guiding visionary behind the Guard's partnership with NASA, and Chris Chilelli, an educator and senior instructional designer at NASA, will share with attendees background on NASA's educational products and the National Guard's distributed learning network; will discuss the unique opportunity this partnership already has provided students and teachers throughout the United States; will offer insights into the formation by government entities of e-Learning partnerships with one another; and will suggest a possible future for the NASA - National Guard Bureau partnership, one potentially to include live multi-party interaction of hundreds of students in several countries with astronauts, scientists, engineers and designers. To inspire the next generation of explorers as only NASA can!
On the topology of the world exchange arrangements web
NASA Astrophysics Data System (ADS)
Li, Xiang; Jin, Yu Ying; Chen, Guanrong
2004-11-01
Exchange arrangements among different countries over the world are foundations of the world economy, which generally stand behind the daily economic evolution. As the first study of the world exchange arrangements web (WEAW), we built a bipartite network with countries as one type of nodes and currencies as the other, and found it to have a prominent scale-free feature with a power-law degree distribution. In a further empirical study of the currency section of the WEAW, we calculated the clustering coefficients, average nearest-neighbors degree, and average shortest distance. As an essential economic network, the WEAW is found to be a correlated disassortative network with a hierarchical structure, possessing a more prominent scale-free feature than the world trade web (WTW).
Mechanisms and dynamics of cooperation and competition emergence in complex networked systems
NASA Astrophysics Data System (ADS)
Gianetto, David A.
Cooperative behavior is a pervasive phenomenon in human interactions and yet how it can evolve and become established, through the selfish process of natural selection, is an enduring puzzle. These behaviors emerge when agents interact in a structured manner; even so, the key structural factors that affect cooperation are not well understood. Moreover, the literature often considers cooperation a single attribute of primitive agents who do not react to environmental changes but real-world actors are more perceptive. The present work moves beyond these assumptions by evolving more realistic game participants, with memories of the past, on complex networks. Agents play repeated games with a three-part Markovian strategy that allows us to separate the cooperation phenomenon into trust, reciprocity, and forgiveness characteristics. Our results show that networks matter most when agents gain the most by acting in a selfish manner, irrespective of how much they may lose by cooperating; since the context provided by neighborhoods inhibits greedy impulses that agents otherwise succumb to in isolation. Network modularity is the most important driver of cooperation emergence in these high-stakes games. However, modularity fails to tell the complete story. Modular scale-free graphs impede cooperation when close coordination is required, partially due to the acyclic nature of scale-free network models. To achieve the highest cooperation in diverse social conditions, both high modularity, low connectivity within modules, and a rich network of long cycles become important. With these findings in hand, we study the influence of networks on coordination and competition within the federal health care insurance exchange. In this applied study, we show that systemic health care coordination is encouraged by the emergent insurance network. The network helps underpin the viability of the exchange and provides an environment of stronger competition once a critical-mass of insurers have entered the market.
Marocco, Davide; Cangelosi, Angelo; Fischer, Kerstin; Belpaeme, Tony
2010-01-01
This paper presents a cognitive robotics model for the study of the embodied representation of action words. The present research will present how an iCub humanoid robot can learn the meaning of action words (i.e. words that represent dynamical events that happen in time) by physically interacting with the environment and linking the effects of its own actions with the behavior observed on the objects before and after the action. The control system of the robot is an artificial neural network trained to manipulate an object through a Back-Propagation-Through-Time algorithm. We will show that in the presented model the grounding of action words relies directly to the way in which an agent interacts with the environment and manipulates it. PMID:20725503
Lenters, Lindsey M; Cole, Donald C; Godoy-Ruiz, Paula
2014-01-25
Networks are increasingly regarded as essential in health research aimed at influencing practice and policies. Less research has focused on the role networking can play in researchers' careers and its broader impacts on capacity strengthening in health research. We used the Canadian Coalition for Global Health Research (CCGHR) annual Summer Institute for New Global Health Researchers (SIs) as an opportunity to explore networking among new global health researchers. A mixed-methods exploratory study was conducted among SI alumni and facilitators who had participated in at least one SI between 2004 and 2010. Alumni and facilitators completed an online short questionnaire, and a subset participated in an in-depth interview. Thematic analysis of the qualitative data was triangulated with quantitative results and CCGHR reports on SIs. Synthesis occurred through the development of a process model relevant to networking through the SIs. Through networking at the SIs, participants experienced decreased isolation and strengthened working relationships. Participants accessed new knowledge, opportunities, and resources through networking during the SI. Post-SI, participants reported ongoing contact and collaboration, although most participants desired more opportunities for interaction. They made suggestions for structural supports to networking among new global health researchers. Networking at the SI contributed positively to opportunities for individuals, and contributed to the formation of a network of global health researchers. Intentional inclusion of networking in health research capacity strengthening initiatives, with supportive resources and infrastructure could create dynamic, sustainable networks accessible to global health researchers around the world.
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.
Impact of the topology of global macroeconomic network on the spreading of economic crises.
Lee, Kyu-Min; Yang, Jae-Suk; Kim, Gunn; Lee, Jaesung; Goh, Kwang-Il; Kim, In-mook
2011-03-31
Throughout economic history, the global economy has experienced recurring crises. The persistent recurrence of such economic crises calls for an understanding of their generic features rather than treating them as singular events. The global economic system is a highly complex system and can best be viewed in terms of a network of interacting macroeconomic agents. In this regard, from the perspective of collective network dynamics, here we explore how the topology of the global macroeconomic network affects the patterns of spreading of economic crises. Using a simple toy model of crisis spreading, we demonstrate that an individual country's role in crisis spreading is not only dependent on its gross macroeconomic capacities, but also on its local and global connectivity profile in the context of the world economic network. We find that on one hand clustering of weak links at the regional scale can significantly aggravate the spread of crises, but on the other hand the current network structure at the global scale harbors higher tolerance of extreme crises compared to more "globalized" random networks. These results suggest that there can be a potential hidden cost in the ongoing globalization movement towards establishing less-constrained, trans-regional economic links between countries, by increasing vulnerability of the global economic system to extreme crises.
Impact of the Topology of Global Macroeconomic Network on the Spreading of Economic Crises
Lee, Kyu-Min; Yang, Jae-Suk; Kim, Gunn; Lee, Jaesung; Goh, Kwang-Il; Kim, In-mook
2011-01-01
Throughout economic history, the global economy has experienced recurring crises. The persistent recurrence of such economic crises calls for an understanding of their generic features rather than treating them as singular events. The global economic system is a highly complex system and can best be viewed in terms of a network of interacting macroeconomic agents. In this regard, from the perspective of collective network dynamics, here we explore how the topology of the global macroeconomic network affects the patterns of spreading of economic crises. Using a simple toy model of crisis spreading, we demonstrate that an individual country's role in crisis spreading is not only dependent on its gross macroeconomic capacities, but also on its local and global connectivity profile in the context of the world economic network. We find that on one hand clustering of weak links at the regional scale can significantly aggravate the spread of crises, but on the other hand the current network structure at the global scale harbors higher tolerance of extreme crises compared to more “globalized” random networks. These results suggest that there can be a potential hidden cost in the ongoing globalization movement towards establishing less-constrained, trans-regional economic links between countries, by increasing vulnerability of the global economic system to extreme crises. PMID:21483794
Li, Dandan; Li, Ting; Niu, Yan; Xiang, Jie; Cao, Rui; Liu, Bo; Zhang, Hui; Wang, Bin
2018-05-11
Despite many studies reporting a variety of alterations in brain networks in patients with attention deficit hyperactivity disorder (ADHD), alterations in hemispheric anatomical networks are still unclear. In this study, we investigated topology alterations in hemispheric white matter in patients with ADHD and the relationship between these alterations and clinical features of the illness. Weighted hemispheric brain anatomical networks were first constructed for each of 40 right-handed patients with ADHD and 53 matched normal controls. Then, graph theoretical approaches were utilized to compute hemispheric topological properties. The small-world property was preserved in the hemispheric network. Furthermore, a significant group-by-hemisphere interaction was revealed in global efficiency, local efficiency and characteristic path length, attributed to the significantly reduced hemispheric asymmetry of global and local integration in patients with ADHD compared with normal controls. Specifically, reduced asymmetric regional efficiency was found in three regions. Finally, we found that the abnormal asymmetry of hemispheric brain anatomical network topology and regional efficiency were both associated with clinical features (the Adult ADHD Self-Report Scale and Wechsler Adult Intelligence Scale) in patients. Our findings provide new insights into the lateralized nature of hemispheric dysconnectivity and highlight the potential for using brain network measures of hemispheric asymmetry as neural biomarkers for ADHD and its clinical features.
Weiss, Michael; Hultsch, Henrike; Adam, Iris; Scharff, Constance; Kipper, Silke
2014-06-22
The singing of song birds can form complex signal systems comprised of numerous subunits sung with distinct combinatorial properties that have been described as syntax-like. This complexity has inspired inquiries into similarities of bird song to human language; but the quantitative analysis and description of song sequences is a challenging task. In this study, we analysed song sequences of common nightingales (Luscinia megarhynchos) by means of a network analysis. We translated long nocturnal song sequences into networks of song types with song transitions as connectors. As network measures, we calculated shortest path length and transitivity and identified the 'small-world' character of nightingale song networks. Besides comparing network measures with conventional measures of song complexity, we also found a correlation between network measures and age of birds. Furthermore, we determined the numbers of in-coming and out-going edges of each song type, characterizing transition patterns. These transition patterns were shared across males for certain song types. Playbacks with different transition patterns provided first evidence that these patterns are responded to differently and thus play a role in singing interactions. We discuss potential functions of the network properties of song sequences in the framework of vocal leadership. Network approaches provide biologically meaningful parameters to describe the song structure of species with extremely large repertoires and complex rules of song retrieval.
Altered Brain Network Segregation in Fragile X Syndrome Revealed by Structural Connectomics.
Bruno, Jennifer Lynn; Hosseini, S M Hadi; Saggar, Manish; Quintin, Eve-Marie; Raman, Mira Michelle; Reiss, Allan L
2017-03-01
Fragile X syndrome (FXS), the most common inherited cause of intellectual disability and autism spectrum disorder, is associated with significant behavioral, social, and neurocognitive deficits. Understanding structural brain network topology in FXS provides an important link between neurobiological and behavioral/cognitive symptoms of this disorder. We investigated the connectome via whole-brain structural networks created from group-level morphological correlations. Participants included 100 individuals: 50 with FXS and 50 with typical development, age 11-23 years. Results indicated alterations in topological properties of structural brain networks in individuals with FXS. Significantly reduced small-world index indicates a shift in the balance between network segregation and integration and significantly reduced clustering coefficient suggests that reduced local segregation shifted this balance. Caudate and amygdala were less interactive in the FXS network further highlighting the importance of subcortical region alterations in the neurobiological signature of FXS. Modularity analysis indicates that FXS and typically developing groups' networks decompose into different sets of interconnected sub networks, potentially indicative of aberrant local interconnectivity in individuals with FXS. These findings advance our understanding of the effects of fragile X mental retardation protein on large-scale brain networks and could be used to develop a connectome-level biological signature for FXS. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
Mapping dynamic social networks in real life using participants' own smartphones.
Boonstra, Tjeerd W; E Larsen, Mark; Christensen, Helen
2015-11-01
Interpersonal relationships are vital for our daily functioning and wellbeing. Social networks may form the primary means by which environmental influences determine individual traits. Several studies have shown the influence of social networks on decision-making, behaviors and wellbeing. Smartphones have great potential for measuring social networks in a real world setting. Here we tested the feasibility of using people's own smartphones as a data collection platform for face-to-face interactions. We developed an application for iOS and Android to collect Bluetooth data and acquired one week of data from 14 participants in our organization. The Bluetooth scanning statistics were used to quantify the time-resolved connection strength between participants and define the weights of a dynamic social network. We used network metrics to quantify changes in network topology over time and non-negative matrix factorization to identify cliques or subgroups that reoccurred during the week. The scanning rate varied considerably between smartphones running Android and iOS and egocentric networks metrics were correlated with the scanning rate. The time courses of two identified subgroups matched with two meetings that took place that week. These findings demonstrate the feasibility of using participants' own smartphones to map social network, whilst identifying current limitations of using generic smartphones. The bias introduced by variations in scanning rate and missing data is an important limitation that needs to be addressed in future studies.
Samothrakis, S; Arvanitis, T N; Plataniotis, A; McNeill, M D; Lister, P F
1997-11-01
Virtual Reality Modelling Language (VRML) is the start of a new era for medicine and the World Wide Web (WWW). Scientists can use VRML across the Internet to explore new three-dimensional (3D) worlds, share concepts and collaborate together in a virtual environment. VRML enables the generation of virtual environments through the use of geometric, spatial and colour data structures to represent 3D objects and scenes. In medicine, researchers often want to interact with scientific data, which in several instances may also be dynamic (e.g. MRI data). This data is often very large and is difficult to visualise. A 3D graphical representation can make the information contained in such large data sets more understandable and easier to interpret. Fast networks and satellites can reliably transfer large data sets from computer to computer. This has led to the adoption of remote tale-working in many applications including medical applications. Radiology experts, for example, can view and inspect in near real-time a 3D data set acquired from a patient who is in another part of the world. Such technology is destined to improve the quality of life for many people. This paper introduces VRML (including some technical details) and discusses the advantages of VRML in application developing.
Fast 3D Net Expeditions: Tools for Effective Scientific Collaboration on the World Wide Web
NASA Technical Reports Server (NTRS)
Watson, Val; Chancellor, Marisa K. (Technical Monitor)
1996-01-01
Two new technologies, the FASTexpedition and Remote FAST, have been developed that provide remote, 3D (three dimensional), high resolution, dynamic, interactive viewing of scientific data. The FASTexpedition permits one to access scientific data from the World Wide Web, take guided expeditions through the data, and continue with self controlled expeditions through the data. Remote FAST permits collaborators at remote sites to simultaneously view an analysis of scientific data being controlled by one of the collaborators. Control can be transferred between sites. These technologies are now being used for remote collaboration in joint university, industry, and NASA projects. Also, NASA Ames Research Center has initiated a project to make scientific data and guided expeditions through the data available as FASTexpeditions on the World Wide Web for educational purposes. Previously, remote visualization of dynamic data was done using video format (transmitting pixel information) such as video conferencing or MPEG (Motion Picture Expert Group) movies on the Internet. The concept for this new technology is to send the raw data (e.g., grids, vectors, and scalars) along with viewing scripts over the Internet and have the pixels generated by a visualization tool running on the viewers local workstation. The visualization tool that is currently used is FAST (Flow Analysis Software Toolkit). The advantages of this new technology over using video format are: (1) The visual is much higher in resolution (1280x1024 pixels with 24 bits of color) than typical video format transmitted over the network. (2) The form of the visualization can be controlled interactively (because the viewer is interactively controlling the visualization tool running on his workstation). (3) A rich variety of guided expeditions through the data can be included easily. (4) A capability is provided for other sites to see a visual analysis of one site as the analysis is interactively performed. Control of the analysis can be passed from site to site. (5) The scenes can be viewed in 3D using stereo vision. (6) The network bandwidth for the visualization using this new technology is much smaller than when using video format. (The measured peak bandwidth used was 1 Kbit/sec whereas the measured bandwidth for a small video picture was 500 Kbits/sec.) This talk will illustrate the use of these new technologies and present a proposal for using these technologies to improve science education.
Emergence of small-world structure in networks of spiking neurons through STDP plasticity.
Basalyga, Gleb; Gleiser, Pablo M; Wennekers, Thomas
2011-01-01
In this work, we use a complex network approach to investigate how a neural network structure changes under synaptic plasticity. In particular, we consider a network of conductance-based, single-compartment integrate-and-fire excitatory and inhibitory neurons. Initially the neurons are connected randomly with uniformly distributed synaptic weights. The weights of excitatory connections can be strengthened or weakened during spiking activity by the mechanism known as spike-timing-dependent plasticity (STDP). We extract a binary directed connection matrix by thresholding the weights of the excitatory connections at every simulation step and calculate its major topological characteristics such as the network clustering coefficient, characteristic path length and small-world index. We numerically demonstrate that, under certain conditions, a nontrivial small-world structure can emerge from a random initial network subject to STDP learning.
Accuracy of Wearable Cameras to Track Social Interactions in Stroke Survivors.
Dhand, Amar; Dalton, Alexandra E; Luke, Douglas A; Gage, Brian F; Lee, Jin-Moo
2016-12-01
Social isolation after a stroke is related to poor outcomes. However, a full study of social networks on stroke outcomes is limited by the current metrics available. Typical measures of social networks rely on self-report, which is vulnerable to response bias and measurement error. We aimed to test the accuracy of an objective measure-wearable cameras-to capture face-to-face social interactions in stroke survivors. If accurate and usable in real-world settings, this technology would allow improved examination of social factors on stroke outcomes. In this prospective study, 10 stroke survivors each wore 2 wearable cameras: Autographer (OMG Life Limited, Oxford, United Kingdom) and Narrative Clip (Narrative, Linköping, Sweden). Each camera automatically took a picture every 20-30 seconds. Patients mingled with healthy controls for 5 minutes of 1-on-1 interactions followed by 5 minutes of no interaction for 2 hours. After the event, 2 blinded judges assessed whether photograph sequences identified interactions or noninteractions. Diagnostic accuracy statistics were calculated. A total of 8776 photographs were taken and adjudicated. In distinguishing interactions, the Autographer's sensitivity was 1.00 and specificity was .98. The Narrative Clip's sensitivity was .58 and specificity was 1.00. The receiver operating characteristic curves of the 2 devices were statistically different (Z = 8.26, P < .001). Wearable cameras can accurately detect social interactions of stroke survivors. Likely because of its large field of view, the Autographer was more sensitive than the Narrative Clip for this purpose. Copyright © 2016 National Stroke Association. Published by Elsevier Inc. All rights reserved.
Characterization and control of small-world networks.
Pandit, S A; Amritkar, R E
1999-08-01
Recently, Watts and Strogatz [Nature (London) 393, 440 (1998)] offered an interesting model of small-world networks. Here we concretize the concept of a "faraway" connection in a network by defining a far edge. Our definition is algorithmic and independent of any external parameters such as topology of the underlying space of the network. We show that it is possible to control the spread of an epidemic by using the knowledge of far edges. We also suggest a model for better product advertisement using the far edges. Our findings indicate that the number of far edges can be a good intrinsic parameter to characterize small-world phenomena.
Characterization and control of small-world networks
NASA Astrophysics Data System (ADS)
Pandit, S. A.; Amritkar, R. E.
1999-08-01
Recently, Watts and Strogatz [Nature (London) 393, 440 (1998)] offered an interesting model of small-world networks. Here we concretize the concept of a ``faraway'' connection in a network by defining a far edge. Our definition is algorithmic and independent of any external parameters such as topology of the underlying space of the network. We show that it is possible to control the spread of an epidemic by using the knowledge of far edges. We also suggest a model for better product advertisement using the far edges. Our findings indicate that the number of far edges can be a good intrinsic parameter to characterize small-world phenomena.
Acconcia, Christopher; Leung, Ben Y C; Manjunath, Anoop; Goertz, David E
2015-10-01
In previous work, we examined microscale interactions between microbubbles and fibrin clots under exposure to 1 ms ultrasound pulses. This provided direct evidence that microbubbles were capable of deforming clot boundaries and penetrating into clots, while also affecting fluid uptake and inducing fibrin network damage. Here, we investigate the effect of short duration (15 μs) pulses on microscale bubble-clot interactions as function of bubble diameter (3-9 μm) and pressure. Individual microbubbles (n = 45) were placed at the clot boundary with optical tweezers and exposed to 1 MHz ultrasound. High-speed (10 kfps) imaging and 2-photon microscopy were performed during and after exposure, respectively. While broadly similar phenomena were observed as in the 1 ms pulse case (i.e., bubble penetration, network damage and fluid uptake), substantial quantitative differences were present. The pressure threshold for bubble penetration was increased from 0.39 MPa to 0.6 MPa, and those bubbles that did enter clots had reduced penetration depths and were associated with less fibrin network damage and nanobead uptake. This appeared to be due in large part to increased bubble shrinkage relative to the 1 ms pulse case. Stroboscopic imaging was performed on a subset of bubbles (n = 11) and indicated that complex bubble oscillations can occur during this process. Copyright © 2015 World Federation for Ultrasound in Medicine & Biology. Published by Elsevier Inc. All rights reserved.
A dataset on human navigation strategies in foreign networked systems.
Kőrösi, Attila; Csoma, Attila; Rétvári, Gábor; Heszberger, Zalán; Bíró, József; Tapolcai, János; Pelle, István; Klajbár, Dávid; Novák, Márton; Halasi, Valentina; Gulyás, András
2018-03-13
Humans are involved in various real-life networked systems. The most obvious examples are social and collaboration networks but the language and the related mental lexicon they use, or the physical map of their territory can also be interpreted as networks. How do they find paths between endpoints in these networks? How do they obtain information about a foreign networked world they find themselves in, how they build mental model for it and how well they succeed in using it? Large, open datasets allowing the exploration of such questions are hard to find. Here we report a dataset collected by a smartphone application, in which players navigate between fixed length source and destination English words step-by-step by changing only one letter at a time. The paths reflect how the players master their navigation skills in such a foreign networked world. The dataset can be used in the study of human mental models for the world around us, or in a broader scope to investigate the navigation strategies in complex networked systems.
NASA Astrophysics Data System (ADS)
Marchiori, Massimo; Latora, Vito
2000-10-01
The small-world phenomenon, popularly known as six degrees of separation, has been mathematically formalized by Watts and Strogatz in a study of the topological properties of a network. Small-world networks are defined in terms of two quantities: they have a high clustering coefficient C like regular lattices and a short characteristic path length L typical of random networks. Physical distances are of fundamental importance in applications to real cases; nevertheless, this basic ingredient is missing in the original formulation. Here, we introduce a new concept, the connectivity length D, that gives harmony to the whole theory. D can be evaluated on a global and on a local scale and plays in turn the role of L and 1/ C. Moreover, it can be computed for any metrical network and not only for the topological cases. D has a precise meaning in terms of information propagation and describes in a unified way, both the structural and the dynamical aspects of a network: small-worlds are defined by a small global and local D, i.e., by a high efficiency in propagating information both on a local and global scale. The neural system of the nematode C. elegans, the collaboration graph of film actors, and the oldest US subway system, can now be studied also as metrical networks and are shown to be small-worlds.
NASA Astrophysics Data System (ADS)
Siettos, Constantinos I.; Anastassopoulou, Cleo; Russo, Lucia; Grigoras, Christos; Mylonakis, Eleftherios
2016-06-01
Based on multiscale agent-based computations we estimated the per-contact probability of transmission by age of the Ebola virus disease (EVD) that swept through Liberia from May 2014 to March 2015. For the approximation of the epidemic dynamics we have developed a detailed agent-based model with small-world interactions between individuals categorized by age. For the estimation of the structure of the evolving contact network as well as the per-contact transmission probabilities by age group we exploited the so called Equation-Free framework. Model parameters were fitted to official case counts reported by the World Health Organization (WHO) as well as to recently published data of key epidemiological variables, such as the mean time to death, recovery and the case fatality rate.
Watson, Alice J.; Grant, Richard W.; Bello, Heather; Hoch, Daniel B.
2008-01-01
New technologies, such as online networking tools, offer innovative ways to engage patients in their diabetes care. Second Life (SL) is one such virtual world that allows patients to interact in a 3D environment with peers and healthcare providers. This article presents a framework that demonstrates how applications within SL can be constructed to meet the needs of patients with diabetes, allowing them to attend group visits, learn more about lifestyle changes, and foster a sense of support and emotional well-being. This experiential approach to education may prove more engaging, and therefore successful, than existing strategies. Addressing concerns relating to privacy and liability is a necessary first step to engage providers in this new approach to patient care. PMID:19885247
Dancing with Swarms: Utilizing Swarm Intelligence to Build, Investigate, and Control Complex Systems
NASA Astrophysics Data System (ADS)
Jacob, Christian
We are surrounded by a natural world of massively parallel, decentralized biological "information processing" systems, a world that exhibits fascinating emergent properties in many ways. In fact, our very own bodies are the result of emergent patterns, as the development of any multi-cellular organism is determined by localized interactions among an enormous number of cells, carefully orchestrated by enzymes, signalling proteins and other molecular "agents". What is particularly striking about these highly distributed developmental processes is that a centralized control agency is completely absent. This is also the case for many other biological systems, such as termites which build their nests—without an architect that draws a plan, or brain cells evolving into a complex `mind machine'—without an explicit blueprint of a network layout.
Fractal Inequality: A Social Network Analysis of Global and Regional International Student Mobility
ERIC Educational Resources Information Center
Macrander, Ashley
2017-01-01
Literature on global international student mobility (ISM) highlights the uneven nature of student flows--from the developing to the developed world--however, studies have yet to address whether this pattern is replicated within expanding regional networks. Utilizing social network analysis, UNESCO ISM data, and World Bank income classifications,…
DOE Office of Scientific and Technical Information (OSTI.GOV)
Yu, Haitao; Guo, Xinmeng; Wang, Jiang, E-mail: jiangwang@tju.edu.cn
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 formore » 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.« less
An experimental test of a fundamental food web motif.
Rip, Jason M K; McCann, Kevin S; Lynn, Denis H; Fawcett, Sonia
2010-06-07
Large-scale changes to the world's ecosystem are resulting in the deterioration of biostructure-the complex web of species interactions that make up ecological communities. A difficult, yet crucial task is to identify food web structures, or food web motifs, that are the building blocks of this baroque network of interactions. Once identified, these food web motifs can then be examined through experiments and theory to provide mechanistic explanations for how structure governs ecosystem stability. Here, we synthesize recent ecological research to show that generalist consumers coupling resources with different interaction strengths, is one such motif. This motif amazingly occurs across an enormous range of spatial scales, and so acts to distribute coupled weak and strong interactions throughout food webs. We then perform an experiment that illustrates the importance of this motif to ecological stability. We find that weak interactions coupled to strong interactions by generalist consumers dampen strong interaction strengths and increase community stability. This study takes a critical step by isolating a common food web motif and through clear, experimental manipulation, identifies the fundamental stabilizing consequences of this structure for ecological communities.
Mapping the Structure of Directed Networks: Beyond the Bow-Tie Diagram
NASA Astrophysics Data System (ADS)
Timár, G.; Goltsev, A. V.; Dorogovtsev, S. N.; Mendes, J. F. F.
2017-02-01
We reveal a hierarchical, multilayer organization of finite components—i.e., tendrils and tubes—around the giant connected components in directed networks and propose efficient algorithms allowing one to uncover the entire organization of key real-world directed networks, such as the World Wide Web, the neural network of Caenorhabditis elegans, and others. With increasing damage, the giant components decrease in size while the number and size of tendril layers increase, enhancing the susceptibility of the networks to damage.
NASA Astrophysics Data System (ADS)
Benda, L. E.
2009-12-01
Stochastic geomorphology refers to the interaction of the stochastic field of sediment supply with hierarchically branching river networks where erosion, sediment flux and sediment storage are described by their probability densities. There are a number of general principles (hypotheses) that stem from this conceptual and numerical framework that may inform the science of erosion and sedimentation in river basins. Rainstorms and other perturbations, characterized by probability distributions of event frequency and magnitude, stochastically drive sediment influx to channel networks. The frequency-magnitude distribution of sediment supply that is typically skewed reflects strong interactions among climate, topography, vegetation, and geotechnical controls that vary between regions; the distribution varies systematically with basin area and the spatial pattern of erosion sources. Probability densities of sediment flux and storage evolve from more to less skewed forms downstream in river networks due to the convolution of the population of sediment sources in a watershed that should vary with climate, network patterns, topography, spatial scale, and degree of erosion asynchrony. The sediment flux and storage distributions are also transformed downstream due to diffusion, storage, interference, and attrition. In stochastic systems, the characteristically pulsed sediment supply and transport can create translational or stationary-diffusive valley and channel depositional landforms, the geometries of which are governed by sediment flux-network interactions. Episodic releases of sediment to the network can also drive a system memory reflected in a Hurst Effect in sediment yields and thus in sedimentological records. Similarly, discreet events of punctuated erosion on hillslopes can lead to altered surface and subsurface properties of a population of erosion source areas that can echo through time and affect subsequent erosion and sediment flux rates. Spatial patterns of probability densities have implications for the frequency and magnitude of sediment transport and storage and thus for the formation of alluvial and colluvial landforms throughout watersheds. For instance, the combination and interference of probability densities of sediment flux at confluences creates patterns of riverine heterogeneity, including standing waves of sediment with associated age distributions of deposits that can vary from younger to older depending on network geometry and position. Although the watershed world of probability densities is rarified and typically confined to research endeavors, it has real world implications for the day-to-day work on hillslopes and in fluvial systems, including measuring erosion, sediment transport, mapping channel morphology and aquatic habitats, interpreting deposit stratigraphy, conducting channel restoration, and applying environmental regulations. A question for the geomorphology community is whether the stochastic framework is useful for advancing our understanding of erosion and sedimentation and whether it should stimulate research to further develop, refine and test these and other principles. For example, a changing climate should lead to shifts in probability densities of erosion, sediment flux, storage, and associated habitats and thus provide a useful index of climate change in earth science forecast models.
The National Network of Libraries of Medicine
... New England Region: University of Massachusetts Bringing the World of Medical Information to Your Neighborhood By Angela ... D., Head, NN/LM National Network Office The world's largest medical library is the National Library of ...
DWTP: a basis for networked VR on the Internet
NASA Astrophysics Data System (ADS)
Broll, Wolfgang; Schick, Daniel
1998-04-01
Shared virtual worlds are one of today's major research topics. While limited to particular application areas and high speed networks in the past, they become more and more available to a large number of users. One reason for this development was the introduction of VRML (the Virtual Reality Modeling Language), which has been established as a standard of the exchange of 3D worlds on the Internet. Although a number of prototype systems have been developed to realize shared multi-user worlds based on VRML, no suitable network protocol to support the demands of such environments has yet been established. In this paper we will introduce our approach of a network protocol for shared virtual environments: DWTP--the Distributed Worlds Transfer and communication Protocol. We will show how DWTP meets the demands of shared virtual environments on the Internet. We will further present SmallView, our prototype of a distributed multi-user VR system, to show how DWTP can be used to realize shared worlds.
Water Diplomacy: A Synthesis of Explicit and Tacit Water Information to Create Actionable Knowledge
NASA Astrophysics Data System (ADS)
Islam, S.; Moomaw, W.; Portney, K.; Reed, M.; Vogel, R. M.; Water Diplomacy
2011-12-01
Water issues are complex because they cross multiple boundaries and involve various stakeholders with competing needs. The origin of many water issues is a dynamic consequence of competition and feedback among variables in the natural, societal and political domains. Together, these interactions generate what we call water networks. As population growth, economic development and climate change impose pressures on finite water resources, management of these water networks becomes crucial. Science alone is not sufficient; nor can policy-making that does not take science into account yield sustainable management solutions. Rather, sustainable solutions may only be found through a diplomatic or negotiated approach that simultaneously takes science, policy, and politics into account. Water issues need to be understood as the product of competition, interconnection, and feedback among variables in the Natural and Societal Domains (NSDs). Within the natural domain: water quantity (Q), water quality (P), and ecosystem (E) constrain and define network dynamics. While in the societal domain, interactions among culture and values (V), assets (C), and governance and institutions (G) create complex contextual differences in the network. These six NSD variables constitute the nodes of a water network while interactions and feedback among natural, societal and political forces define the complexity of a network. The knowledge needed to resolve water conflicts and to manage water networks effectively must extend beyond scientific assessment that ignore societal variables (C, G, and V) or treat them as exogenous, and beyond policy analysis that does not consider the impact of natural variables (E, P, and Q) and the couplings among them. Many water conflicts arise when NSD variables, and the networks they define, are mismanaged. These networks are open-ended systems that cross boundaries (physical, disciplinary, and jurisdictional ) and change continuously; thus, efforts to manage them assuming that they have fixed boundaries , or can be optimized with scientific objectivity without properly accounting for contextual differences, are likely to fail. Once water conflicts are framed properly, the tools of joint fact-finding and collaborative problem-solving can be used to negotiate solutions that are both adaptive and enforceable. We will use AquaPedia - a growing knowledge base of water issues from across the world - to demonstrate the utility of this synthesis of explicit and tacit knowledge in addressing water problems and creating actionable knowledge.
Distributed medical services within the ATM-based Berlin regional test bed
NASA Astrophysics Data System (ADS)
Thiel, Andreas; Bernarding, Johannes; Krauss, Manfred; Schulz, Sandra; Tolxdorff, Thomas
1996-05-01
The ATM-based Metropolitan Area Network (MAN) of Berlin connects two university hospitals (Benjamin Franklin University Hospital and Charite) with the computer resources of the Technical University of Berlin (TUB). Distributed new medical services have been implemented and will be evaluated within the highspeed MAN of Berlin. The network with its data transmission rates of up to 155 Mbit/s renders these medical services externally available to practicing physicians. Resource and application sharing is demonstrated by the use of two software systems. The first software system is an interactive 3D reconstruction tool (3D- Medbild), based on a client-server mechanism. This structure allows the use of high- performance computers at the TUB from the low-level workstations in the hospitals. A second software system, RAMSES, utilizes a tissue database of Magnetic Resonance Images. For the remote control of the software, the developed applications use standards such as DICOM 3.0 and features of the World Wide Web. Data security concepts are being tested and integrated for the needs of the sensitive medical data. The highspeed network is the necessary prerequisite for the clinical evaluation of data in a joint teleconference. The transmission of digitized real-time sequences such as video and ultrasound and the interactive manipulation of data are made possible by Multi Media tools.
Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks.
Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez
2016-11-22
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.
Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks
Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez
2016-01-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. PMID:27874024
Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks
NASA Astrophysics Data System (ADS)
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.
Workflow Agents vs. Expert Systems: Problem Solving Methods in Work Systems Design
NASA Technical Reports Server (NTRS)
Clancey, William J.; Sierhuis, Maarten; Seah, Chin
2009-01-01
During the 1980s, a community of artificial intelligence researchers became interested in formalizing problem solving methods as part of an effort called "second generation expert systems" (2nd GES). How do the motivations and results of this research relate to building tools for the workplace today? We provide an historical review of how the theory of expertise has developed, a progress report on a tool for designing and implementing model-based automation (Brahms), and a concrete example how we apply 2nd GES concepts today in an agent-based system for space flight operations (OCAMS). Brahms incorporates an ontology for modeling work practices, what people are doing in the course of a day, characterized as "activities." OCAMS was developed using a simulation-to-implementation methodology, in which a prototype tool was embedded in a simulation of future work practices. OCAMS uses model-based methods to interactively plan its actions and keep track of the work to be done. The problem solving methods of practice are interactive, employing reasoning for and through action in the real world. Analogously, it is as if a medical expert system were charged not just with interpreting culture results, but actually interacting with a patient. Our perspective shifts from building a "problem solving" (expert) system to building an actor in the world. The reusable components in work system designs include entire "problem solvers" (e.g., a planning subsystem), interoperability frameworks, and workflow agents that use and revise models dynamically in a network of people and tools. Consequently, the research focus shifts so "problem solving methods" include ways of knowing that models do not fit the world, and ways of interacting with other agents and people to gain or verify information and (ultimately) adapt rules and procedures to resolve problematic situations.
Food-web structure and network theory: The role of connectance and size
Dunne, Jennifer A.; Williams, Richard J.; Martinez, Neo D.
2002-01-01
Networks from a wide range of physical, biological, and social systems have been recently described as “small-world” and “scale-free.” However, studies disagree whether ecological networks called food webs possess the characteristic path lengths, clustering coefficients, and degree distributions required for membership in these classes of networks. Our analysis suggests that the disagreements are based on selective use of relatively few food webs, as well as analytical decisions that obscure important variability in the data. We analyze a broad range of 16 high-quality food webs, with 25–172 nodes, from a variety of aquatic and terrestrial ecosystems. Food webs generally have much higher complexity, measured as connectance (the fraction of all possible links that are realized in a network), and much smaller size than other networks studied, which have important implications for network topology. Our results resolve prior conflicts by demonstrating that although some food webs have small-world and scale-free structure, most do not if they exceed a relatively low level of connectance. Although food-web degree distributions do not display a universal functional form, observed distributions are systematically related to network connectance and size. Also, although food webs often lack small-world structure because of low clustering, we identify a continuum of real-world networks including food webs whose ratios of observed to random clustering coefficients increase as a power–law function of network size over 7 orders of magnitude. Although food webs are generally not small-world, scale-free networks, food-web topology is consistent with patterns found within those classes of networks. PMID:12235364
Tools for the Microbiome: Nano and Beyond.
Biteen, Julie S; Blainey, Paul C; Cardon, Zoe G; Chun, Miyoung; Church, George M; Dorrestein, Pieter C; Fraser, Scott E; Gilbert, Jack A; Jansson, Janet K; Knight, Rob; Miller, Jeff F; Ozcan, Aydogan; Prather, Kimberly A; Quake, Stephen R; Ruby, Edward G; Silver, Pamela A; Taha, Sharif; van den Engh, Ger; Weiss, Paul S; Wong, Gerard C L; Wright, Aaron T; Young, Thomas D
2016-01-26
The microbiome presents great opportunities for understanding and improving the world around us and elucidating the interactions that compose it. The microbiome also poses tremendous challenges for mapping and manipulating the entangled networks of interactions among myriad diverse organisms. Here, we describe the opportunities, technical needs, and potential approaches to address these challenges, based on recent and upcoming advances in measurement and control at the nanoscale and beyond. These technical needs will provide the basis for advancing the largely descriptive studies of the microbiome to the theoretical and mechanistic understandings that will underpin the discipline of microbiome engineering. We anticipate that the new tools and methods developed will also be more broadly useful in environmental monitoring, medicine, forensics, and other areas.
NASA Astrophysics Data System (ADS)
Wu, Huijun; Wang, Hao; Lü, Linyuan
Applying network science to investigate the complex systems has become a hot topic. In neuroscience, understanding the architectures of complex brain networks was a vital issue. An enormous amount of evidence had supported the brain was cost/efficiency trade-off with small-worldness, hubness and modular organization through the functional MRI and structural MRI investigations. However, the T1-weighted/T2-weighted (T1w/T2w) ratio brain networks were mostly unexplored. Here, we utilized a KL divergence-based method to construct large-scale individual T1w/T2w ratio brain networks and investigated the underlying topological attributes of these networks. Our results supported that the T1w/T2w ratio brain networks were comprised of small-worldness, an exponentially truncated power-law degree distribution, frontal-parietal hubs and modular organization. Besides, there were significant positive correlations between the network metrics and fluid intelligence. Thus, the T1w/T2w ratio brain networks open a new avenue to understand the human brain and are a necessary supplement for future MRI studies.
Injectable nano-network for glucose-mediated insulin delivery.
Gu, Zhen; Aimetti, Alex A; Wang, Qun; Dang, Tram T; Zhang, Yunlong; Veiseh, Omid; Cheng, Hao; Langer, Robert S; Anderson, Daniel G
2013-05-28
Diabetes mellitus, a disorder of glucose regulation, is a global burden affecting 366 million people across the world. An artificial "closed-loop" system able to mimic pancreas activity and release insulin in response to glucose level changes has the potential to improve patient compliance and health. Herein we develop a glucose-mediated release strategy for the self-regulated delivery of insulin using an injectable and acid-degradable polymeric network. Formed by electrostatic interaction between oppositely charged dextran nanoparticles loaded with insulin and glucose-specific enzymes, the nanocomposite-based porous architecture can be dissociated and subsequently release insulin in a hyperglycemic state through the catalytic conversion of glucose into gluconic acid. In vitro insulin release can be modulated in a pulsatile profile in response to glucose concentrations. In vivo studies validated that these formulations provided improved glucose control in type 1 diabetic mice subcutaneously administered with a degradable nano-network. A single injection of the developed nano-network facilitated stabilization of the blood glucose levels in the normoglycemic state (<200 mg/dL) for up to 10 days.
Probabilistic inference in discrete spaces can be implemented into networks of LIF neurons.
Probst, Dimitri; Petrovici, Mihai A; Bytschok, Ilja; Bill, Johannes; Pecevski, Dejan; Schemmel, Johannes; Meier, Karlheinz
2015-01-01
The means by which cortical neural networks are able to efficiently solve inference problems remains an open question in computational neuroscience. Recently, abstract models of Bayesian computation in neural circuits have been proposed, but they lack a mechanistic interpretation at the single-cell level. In this article, we describe a complete theoretical framework for building networks of leaky integrate-and-fire neurons that can sample from arbitrary probability distributions over binary random variables. We test our framework for a model inference task based on a psychophysical phenomenon (the Knill-Kersten optical illusion) and further assess its performance when applied to randomly generated distributions. As the local computations performed by the network strongly depend on the interaction between neurons, we compare several types of couplings mediated by either single synapses or interneuron chains. Due to its robustness to substrate imperfections such as parameter noise and background noise correlations, our model is particularly interesting for implementation on novel, neuro-inspired computing architectures, which can thereby serve as a fast, low-power substrate for solving real-world inference problems.
The internet of things and the development of network technology in China
NASA Astrophysics Data System (ADS)
Wang, Ruxin; Zhao, Jianzhen; Ma, Hangtong
2018-04-01
The English name of the Internet of Things the Internet of Things, referred to as: the IOT. Internet of Things through the pass, radio frequency identification technology, global positioning system technology, real-time acquisition of any monitoring, connectivity, interactive objects or processes, collecting their sound, light, heat, electricity, mechanics, chemistry, biology, the location of a variety of the information you need network access through a variety of possible things and things, objects and people in the Pan-link intelligent perception of items and processes, identification and management. The Internet of Things IntelliSense recognition technology and pervasive computing, ubiquitous network integration application, known as the third wave of the world's information industry development following the computer, the Internet. Not so much the Internet of Things is a network, as Internet of Things services and applications, Internet of Things is also seen as Internet application development. Therefore, the application of innovation is the core of the development of Internet of Things, and 2.0 of the user experience as the core innovation is the soul of Things.
Properties of on-line social systems
NASA Astrophysics Data System (ADS)
Grabowski, A.; Kruszewska, N.; Kosiński, R. A.
2008-11-01
We study properties of five different social systems: (i) internet society of friends consisting of over 106 people, (ii) social network consisting of 3 × 104 individuals, who interact in a large virtual world of Massive Multiplayer Online Role Playing Games (MMORPGs), (iii) over 106 users of music community website, (iv) over 5 × 106 users of gamers community server and (v) over 0.25 × 106 users of books admirer website. Individuals included in large social network form an Internet community and organize themselves in groups of different sizes. The destiny of those systems, as well as the method of creating of new connections, are different, however we found that the properties of these networks are very similar. We have found that the network components size distribution follow the power-law scaling form. In all five systems we have found interesting scaling laws concerning human dynamics. Our research has shown how long people are interested in a single task, how much time they devote to it and how fast they are making friends. It is surprising that the time evolution of an individual connectivity is very similar in each system.
Bootstrapping under constraint for the assessment of group behavior in human contact networks
NASA Astrophysics Data System (ADS)
Tremblay, Nicolas; Barrat, Alain; Forest, Cary; Nornberg, Mark; Pinton, Jean-François; Borgnat, Pierre
2013-11-01
The increasing availability of time- and space-resolved data describing human activities and interactions gives insights into both static and dynamic properties of human behavior. In practice, nevertheless, real-world data sets can often be considered as only one realization of a particular event. This highlights a key issue in social network analysis: the statistical significance of estimated properties. In this context, we focus here on the assessment of quantitative features of specific subset of nodes in empirical networks. We present a method of statistical resampling based on bootstrapping groups of nodes under constraints within the empirical network. The method enables us to define acceptance intervals for various null hypotheses concerning relevant properties of the subset of nodes under consideration in order to characterize by a statistical test its behavior as “normal” or not. We apply this method to a high-resolution data set describing the face-to-face proximity of individuals during two colocated scientific conferences. As a case study, we show how to probe whether colocating the two conferences succeeded in bringing together the two corresponding groups of scientists.
Probabilistic inference in discrete spaces can be implemented into networks of LIF neurons
Probst, Dimitri; Petrovici, Mihai A.; Bytschok, Ilja; Bill, Johannes; Pecevski, Dejan; Schemmel, Johannes; Meier, Karlheinz
2015-01-01
The means by which cortical neural networks are able to efficiently solve inference problems remains an open question in computational neuroscience. Recently, abstract models of Bayesian computation in neural circuits have been proposed, but they lack a mechanistic interpretation at the single-cell level. In this article, we describe a complete theoretical framework for building networks of leaky integrate-and-fire neurons that can sample from arbitrary probability distributions over binary random variables. We test our framework for a model inference task based on a psychophysical phenomenon (the Knill-Kersten optical illusion) and further assess its performance when applied to randomly generated distributions. As the local computations performed by the network strongly depend on the interaction between neurons, we compare several types of couplings mediated by either single synapses or interneuron chains. Due to its robustness to substrate imperfections such as parameter noise and background noise correlations, our model is particularly interesting for implementation on novel, neuro-inspired computing architectures, which can thereby serve as a fast, low-power substrate for solving real-world inference problems. PMID:25729361
The NUONCE engine for LEO networks
NASA Technical Reports Server (NTRS)
Lo, Martin W.; Estabrook, Polly
1995-01-01
Typical LEO networks use constellations which provide a uniform coverage. However, the demand for telecom service is dynamic and unevenly distributed around the world. We examine a more efficient and cost effective design by matching the satellite coverage with the cyclical demand for service around the world. Our approach is to use a non-uniform satellite distribution for the network. We have named this constellation design NUONCE for Non Uniform Optimal Network Communications Engine.
A network of experimental forests and ranges: Providing soil solutions for a changing world
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...
Knowledge Diffusion on Networks through the Game Strategy
NASA Astrophysics Data System (ADS)
Sun, Shu; Wu, Jiangning; Xuan, Zhaoguo
In this paper, we develop a knowledge diffusion model in which agents determine to give their knowledge to others according to some exchange strategies. The typical network namely small-world network is used for modeling, on which agents with knowledge are viewed as the nodes of the network and the edges are viewed as the social relationships for knowledge transmission. Such agents are permitted to interact with their neighbors repeatedly who have direct connections with them and accordingly change their strategies by choosing the most beneficial neighbors to diffuse knowledge. Two kinds of knowledge transmission strategies are proposed for the theoretical model based on the game theory and thereafter used in different simulations to examine the effect of the network structure on the knowledge diffusion effect. By analyses, two main observations can be found: One is that the simulation results are contrary to our intuition which agents would like to only accept but not share, thus they will maximize their benefit; another one is that the number of the agents acquired knowledge and the corresponding knowledge stock turn out to be independent of the percentage of those agents who choose to contribute their knowledge.
Sun, Yu; Lee, Renick; Chen, Yu; Collinson, Simon; Thakor, Nitish; Bezerianos, Anastasios; Sim, Kang
2015-01-01
Sexual dimorphism in the brain maturation during childhood and adolescence has been repeatedly documented, which may underlie the differences in behaviors and cognitive performance. However, our understanding of how gender modulates the development of structural connectome in healthy adults is still not entirely clear. Here we utilized graph theoretical analysis of longitudinal diffusion tensor imaging data over a five-year period to investigate the progressive gender differences of brain network topology. The brain networks of both genders showed prominent economical "small-world" architecture (high local clustering and short paths between nodes). Additional analysis revealed a more economical "small-world" architecture in females as well as a greater global efficiency in males regardless of scan time point. At the regional level, both increased and decreased efficiency were found across the cerebral cortex for both males and females, indicating a compensation mechanism of cortical network reorganization over time. Furthermore, we found that weighted clustering coefficient exhibited significant gender-time interactions, implying different development trends between males and females. Moreover, several specific brain regions (e.g., insula, superior temporal gyrus, cuneus, putamen, and parahippocampal gyrus) exhibited different development trajectories between males and females. Our findings further prove the presence of sexual dimorphism in brain structures that may underlie gender differences in behavioral and cognitive functioning. The sex-specific progress trajectories in brain connectome revealed in this work provide an important foundation to delineate the gender related pathophysiological mechanisms in various neuropsychiatric disorders, which may potentially guide the development of sex-specific treatments for these devastating brain disorders.
Spitters, Hilde P E M; Lau, Cathrine J; Sandu, Petru; Quanjel, Marcel; Dulf, Diana; Glümer, Charlotte; van Oers, Hans A M; van de Goor, Ien A M
2017-02-03
Facilitating and enhancing interaction between stakeholders involved in the policymaking process to stimulate collaboration and use of evidence, is important to foster the development of effective Health Enhancing Physical Activity (HEPA) policies. Performing an analysis of real-world policymaking processes will help reveal the complexity of a network of stakeholders. Therefore, the main objectives were to unravel the stakeholder network in the policy process by conducting three systems analyses, and to increase insight into the similarities and differences in the policy processes of these European country cases. A systems analysis of the local HEPA policymaking process was performed in three European countries involved in the 'REsearch into POlicy to enhance Physical Activity' (REPOPA) project, resulting in three schematic models showing the main stakeholders and their relationships. The models were used to compare the systems, focusing on implications with respect to collaboration and use of evidence in local HEPA policymaking. Policy documents and relevant webpages were examined and main stakeholders were interviewed. The systems analysis in each country identified the main stakeholders involved and their position and relations in the policymaking process. The Netherlands and Denmark were the most similar and both differed most from Romania, especially at the level of accountability of the local public authorities for local HEPA policymaking. The categories of driving forces underlying the relations between stakeholders were formal relations, informal interaction and knowledge exchange. A systems analysis providing detailed descriptions of positions and relations in the stakeholder network in local level HEPA policymaking is rather unique in this area. The analyses are useful when a need arises for increased interaction, collaboration and use of knowledge between stakeholders in the local HEPA network, as they provide an overview of the stakeholders involved and their mutual relations. This information can be an important starting point to enhance the uptake of evidence and build more effective public health policies.
Research & Technology Report Goddard Space Flight Center
NASA Technical Reports Server (NTRS)
Soffen, Gerald A. (Editor); Truszkowski, Walter (Editor); Ottenstein, Howard (Editor); Frost, Kenneth (Editor); Maran, Stephen (Editor); Walter, Lou (Editor); Brown, Mitch (Editor)
1995-01-01
The main theme of this edition of the annual Research and Technology Report is Mission Operations and Data Systems. Shifting from centralized to distributed mission operations, and from human interactive operations to highly automated operations is reported. The following aspects are addressed: Mission planning and operations; TDRSS, Positioning Systems, and orbit determination; hardware and software associated with Ground System and Networks; data processing and analysis; and World Wide Web. Flight projects are described along with the achievements in space sciences and earth sciences. Spacecraft subsystems, cryogenic developments, and new tools and capabilities are also discussed.
Blood hero: An application for encouraging the blood donation by applying gamification.
Domingos, Daniela C L; Lima, Luis F S G; Messias, Thiago F; Feijo, Jose V L; Diniz, Anthony A R; Soares, Heliana B
2016-08-01
There is a strong need for actions to supply the blood demand in the World. Based on this fact, it was designed an application, named `Blood Hero', by applying the `gamification' concept, which allows users to be rewarded by social acts related to the blood donation. It takes advantage of the application of mobile devices, implementing a specific social network, to attract and retain blood donators. This application makes possible an interaction between users and blood centers, and is being tested aiming at evaluating its acceptance and impact in bloodstocks.
Statistical properties of world investment networks
NASA Astrophysics Data System (ADS)
Song, Dong-Ming; Jiang, Zhi-Qiang; Zhou, Wei-Xing
2009-06-01
We have performed a detailed investigation on the world investment networks constructed from the Coordinated Portfolio Investment Survey (CPIS) data of the International Monetary Fund, ranging from 2001 to 2006. The distributions of degrees and node strengths are scale-free. The weight distributions can be well modeled by the Weibull distribution. The maximum flow spanning trees of the world investment networks possess two universal allometric scaling relations, independent of time and the investment type. The topological scaling exponent is 1.17±0.02 and the flow scaling exponent is 1.03±0.01.
Potts Model in One-Dimension on Directed Small-World Networks
NASA Astrophysics Data System (ADS)
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.
NASA Astrophysics Data System (ADS)
Nunes Amaral, Luis A.
2002-03-01
We study the statistical properties of a variety of diverse real-world networks including the neural network of C. Elegans, food webs for seven distinct environments, transportation and technological networks, and a number of distinct social networks [1-5]. We present evidence of the occurrence of three classes of small-world networks [2]: (a) scale-free networks, characterized by a vertex connectivity distribution that decays as a power law; (b) broad-scale networks, characterized by a connectivity distribution that has a power-law regime followed by a sharp cut-off; (c) single-scale networks, characterized by a connectivity distribution with a fast decaying tail. Moreover, we note for the classes of broad-scale and single-scale networks that there are constraints limiting the addition of new links. Our results suggest that the nature of such constraints may be the controlling factor for the emergence of different classes of networks. [See http://polymer.bu.edu/ amaral/Networks.html for details and htpp://polymer.bu.edu/ amaral/Professional.html for access to PDF files of articles.] 1. M. Barthélémy, L. A. N. Amaral, Phys. Rev. Lett. 82, 3180-3183 (1999). 2. L. A. N. Amaral, A. Scala, M. Barthélémy, H. E. Stanley, Proc. Nat. Acad. Sci. USA 97, 11149-11152 (2000). 3. F. Liljeros, C. R. Edling, L. A. N. Amaral, H. E. Stanley, and Y. Åberg, Nature 411, 907-908 (2001). 4. J. Camacho, R. Guimera, L.A.N. Amaral, Phys. Rev. E RC (to appear). 5. S. Mossa, M. Barthelemy, H.E. Stanley, L.A.N. Amaral (submitted).
A nonparametric significance test for sampled networks.
Elliott, Andrew; Leicht, Elizabeth; Whitmore, Alan; Reinert, Gesine; Reed-Tsochas, Felix
2018-01-01
Our work is motivated by an interest in constructing a protein-protein interaction network that captures key features associated with Parkinson's disease. While there is an abundance of subnetwork construction methods available, it is often far from obvious which subnetwork is the most suitable starting point for further investigation. We provide a method to assess whether a subnetwork constructed from a seed list (a list of nodes known to be important in the area of interest) differs significantly from a randomly generated subnetwork. The proposed method uses a Monte Carlo approach. As different seed lists can give rise to the same subnetwork, we control for redundancy by constructing a minimal seed list as the starting point for the significance test. The null model is based on random seed lists of the same length as a minimum seed list that generates the subnetwork; in this random seed list the nodes have (approximately) the same degree distribution as the nodes in the minimum seed list. We use this null model to select subnetworks which deviate significantly from random on an appropriate set of statistics and might capture useful information for a real world protein-protein interaction network. The software used in this paper are available for download at https://sites.google.com/site/elliottande/. The software is written in Python and uses the NetworkX library. ande.elliott@gmail.com or felix.reed-tsochas@sbs.ox.ac.uk. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press.
High-speed network for delivery of education-on-demand
NASA Astrophysics Data System (ADS)
Cordero, Carlos; Harris, Dale; Hsieh, Jeff
1996-03-01
A project to investigate the feasibility of delivering on-demand distance education to the desktop, known as the Asynchronous Distance Education ProjecT (ADEPT), is presently being carried out. A set of Stanford engineering classes is digitized on PC, Macintosh, and UNIX platforms, and is made available on servers. Students on campus and in industry may then access class material on these servers via local and metropolitan area networks. Students can download class video and audio, encoded in QuickTimeTM and Show-Me TVTM formats, via file-transfer protocol or the World Wide Web. Alternatively, they may stream a vector-quantized version of the class directly from a server for real-time playback. Students may also download PostscriptTM and Adobe AcrobatTM versions of class notes. Off-campus students may connect to ADEPT servers via the internet, the Silicon Valley Test Track (SVTT), or the Bay-Area Gigabit Network (BAGNet). The SVTT and BAGNet are high-speed metropolitan-area networks, spanning the Bay Area, which provide IP access over asynchronous transfer mode (ATM). Student interaction is encouraged through news groups, electronic mailing lists, and an ADEPT home page. Issues related to having multiple platforms and interoperability are examined in this paper. The ramifications of providing a reliable service are discussed. System performance and the parameters that affect it are then described. Finally, future work on expanding ATM access, real-time delivery of classes, and enhanced student interaction is described.
A nonparametric significance test for sampled networks
Leicht, Elizabeth; Whitmore, Alan; Reinert, Gesine; Reed-Tsochas, Felix
2018-01-01
Abstract Motivation Our work is motivated by an interest in constructing a protein–protein interaction network that captures key features associated with Parkinson’s disease. While there is an abundance of subnetwork construction methods available, it is often far from obvious which subnetwork is the most suitable starting point for further investigation. Results We provide a method to assess whether a subnetwork constructed from a seed list (a list of nodes known to be important in the area of interest) differs significantly from a randomly generated subnetwork. The proposed method uses a Monte Carlo approach. As different seed lists can give rise to the same subnetwork, we control for redundancy by constructing a minimal seed list as the starting point for the significance test. The null model is based on random seed lists of the same length as a minimum seed list that generates the subnetwork; in this random seed list the nodes have (approximately) the same degree distribution as the nodes in the minimum seed list. We use this null model to select subnetworks which deviate significantly from random on an appropriate set of statistics and might capture useful information for a real world protein–protein interaction network. Availability and implementation The software used in this paper are available for download at https://sites.google.com/site/elliottande/. The software is written in Python and uses the NetworkX library. Contact ande.elliott@gmail.com or felix.reed-tsochas@sbs.ox.ac.uk Supplementary information Supplementary data are available at Bioinformatics online. PMID:29036452
Predicting the evolution of complex networks via similarity dynamics
NASA Astrophysics Data System (ADS)
Wu, Tao; Chen, Leiting; Zhong, Linfeng; Xian, Xingping
2017-01-01
Almost all real-world networks are subject to constant evolution, and plenty of them have been investigated empirically to uncover the underlying evolution mechanism. However, the evolution prediction of dynamic networks still remains a challenging problem. The crux of this matter is to estimate the future network links of dynamic networks. This paper studies the evolution prediction of dynamic networks with link prediction paradigm. To estimate the likelihood of the existence of links more accurate, an effective and robust similarity index is presented by exploiting network structure adaptively. Moreover, most of the existing link prediction methods do not make a clear distinction between future links and missing links. In order to predict the future links, the networks are regarded as dynamic systems in this paper, and a similarity updating method, spatial-temporal position drift model, is developed to simulate the evolutionary dynamics of node similarity. Then the updated similarities are used as input information for the future links' likelihood estimation. Extensive experiments on real-world networks suggest that the proposed similarity index performs better than baseline methods and the position drift model performs well for evolution prediction in real-world evolving networks.
Small-worldness characteristics and its gender relation in specific hemispheric networks.
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.
Efficient weighting strategy for enhancing synchronizability of complex networks
NASA Astrophysics Data System (ADS)
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.
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.
Wiki use in mental health practice: recognizing potential use of collaborative technology.
Bastida, Richard; McGrath, Ian; Maude, Phil
2010-04-01
Web 2.0, the second-generation of the World Wide Web, differs to earlier versions of Web development and design in that it facilitates more user-friendly, interactive information sharing and mechanisms for greater collaboration between users. Examples of Web 2.0 include Web-based communities, hosted services, social networking sites, video sharing sites, blogs, mashups, and wikis. Users are able to interact with others across the world or to add to or change website content. This paper examines examples of wiki use in the Australian mental health sector. A wiki can be described as an online collaborative and interactive database that can be easily edited by users. They are accessed via a standard Web browser which has an interface similar to traditional Web pages, thus do not require special application or software for the user. Although there is a paucity of literature describing wiki use in mental health, other industries have developed uses, including a repository of knowledge, a platform for collaborative writing, a project management tool, and an alternative to traditional Web pages or Intranets. This paper discusses the application of wikis in other industries and offers suggestions by way of examples of how this technology could be used in the mental health sector.
Interconnecting astronomical networks: evolving from single networks to meta-networks
NASA Astrophysics Data System (ADS)
White, R. R.; Allan, A.; Evans, S.; Vestrand, W. T.; Wren, J.; Wozniak, P.
2006-06-01
Over the past four years we have seen continued advancement in network technology and how those technologies are beginning to enable astronomical science. Even though some sociological aspects are hindering full cooperation between most observatories and telescopes outside of their academic or institutional connections, an unprecedented step during the summer of 2005 was taken towards creating a world-wide interconnection of astronomical assets. The Telescope Alert Operations Network System (TALONS), a centralized server/client bi-directional network developed and operated by Los Alamos National Laboratory, integrated one of its network nodes with a node from the eScience Telescopes for Astronomical Research (eSTAR), a peer-to-peer agent based network developed and operated by The University of Exeter. Each network can act independently, providing support for their direct clients, and by interconnection provide local clients with access to; outside telescope systems, software tools unavailable locally, and the ability to utilize assets far more efficiently, thereby enabling science on a world-wide scale. In this paper we will look at the evolution of these independent networks into the worlds first heterogeneous telescope network and where this may take astronomy in the future. We will also examine those key elements necessary to providing universal communication between diverse astronomical networks.
Protein interaction networks from literature mining
NASA Astrophysics Data System (ADS)
Ihara, Sigeo
2005-03-01
The ability to accurately predict and understand physiological changes in the biological network system in response to disease or drug therapeutics is of crucial importance in life science. The extensive amount of gene expression data generated from even a single microarray experiment often proves difficult to fully interpret and comprehend the biological significance. An increasing knowledge of protein interactions stored in the PubMed database, as well as the advancement of natural language processing, however, makes it possible to construct protein interaction networks from the gene expression information that are essential for understanding the biological meaning. From the in house literature mining system we have developed, the protein interaction network for humans was constructed. By analysis based on the graph-theoretical characterization of the total interaction network in literature, we found that the network is scale-free and semantic long-ranged interactions (i.e. inhibit, induce) between proteins dominate in the total interaction network, reducing the degree exponent. Interaction networks generated based on scientific text in which the interaction event is ambiguously described result in disconnected networks. In contrast interaction networks based on text in which the interaction events are clearly stated result in strongly connected networks. The results of protein-protein interaction networks obtained in real applications from microarray experiments are discussed: For example, comparisons of the gene expression data indicative of either a good or a poor prognosis for acute lymphoblastic leukemia with MLL rearrangements, using our system, showed newly discovered signaling cross-talk.
Martínez-Romero, Marcos; Vázquez-Naya, José M; Rabuñal, Juan R; Pita-Fernández, Salvador; Macenlle, Ramiro; Castro-Alvariño, Javier; López-Roses, Leopoldo; Ulla, José L; Martínez-Calvo, Antonio V; Vázquez, Santiago; Pereira, Javier; Porto-Pazos, Ana B; Dorado, Julián; Pazos, Alejandro; Munteanu, Cristian R
2010-05-01
Colorectal cancer is one of the most frequent types of cancer in the world and generates important social impact. The understanding of the specific metabolism of this disease and the transformations of the specific drugs will allow finding effective prevention, diagnosis and treatment of the colorectal cancer. All the terms that describe the drug metabolism contribute to the construction of ontology in order to help scientists to link the correlated information and to find the most useful data about this topic. The molecular components involved in this metabolism are included in complex network such as metabolic pathways in order to describe all the molecular interactions in the colorectal cancer. The graphical method of processing biological information such as graphs and complex networks leads to the numerical characterization of the colorectal cancer drug metabolic network by using invariant values named topological indices. Thus, this method can help scientists to study the most important elements in the metabolic pathways and the dynamics of the networks during mutations, denaturation or evolution for any type of disease. This review presents the last studies regarding ontology and complex networks of the colorectal cancer drug metabolism and a basic topology characterization of the drug metabolic process sub-ontology from the Gene Ontology.
Apparatus and method for interaction phenomena with world modules in data-flow-based simulation
Xavier, Patrick G [Albuquerque, NM; Gottlieb, Eric J [Corrales, NM; McDonald, Michael J [Albuquerque, NM; Oppel, III, Fred J.
2006-08-01
A method and apparatus accommodate interaction phenomenon in a data-flow-based simulation of a system of elements, by establishing meta-modules to simulate system elements and by establishing world modules associated with interaction phenomena. World modules are associated with proxy modules from a group of meta-modules associated with one of the interaction phenomenon. The world modules include a communication world, a sensor world, a mobility world, and a contact world. World modules can be further associated with other world modules if necessary. Interaction phenomenon are simulated in corresponding world modules by accessing member functions in the associated group of proxy modules. Proxy modules can be dynamically allocated at a desired point in the simulation to accommodate the addition of elements in the system of elements such as a system of robots, a system of communication terminals, or a system of vehicles, being simulated.
Virtual water trade and country vulnerability: A network perspective
NASA Astrophysics Data System (ADS)
Sartori, Martina; Schiavo, Stefano
2015-04-01
This work investigates the relationship between countries' participation in virtual water trade and their vulnerability to external shocks from a network perspective. In particular, we investigate whether (i) possible sources of local national crises may interact with the system, propagating through the network and affecting the other countries involved; (ii) the topological characteristics of the international agricultural trade network, translated into virtual water-equivalent flows, may favor countries' vulnerability to external crises. Our work contributes to the debate on the potential merits and risks associated with openness to trade in agricultural and food products. On the one hand, trade helps to ensure that even countries with limited water (and other relevant) resources have access to sufficient food and contribute to the global saving of water. On the other hand, there are fears that openness may increase the vulnerability to external shocks and thus make countries worse off. Here we abstract from political considerations about food sovereignty and independence from imports and focus instead on investigating whether the increased participation in global trade that the world has witnessed in the last 30 years has made the system more susceptible to large shocks. Our analysis reveals that: (i) the probability of larger supply shocks has not increased over time; (ii) the topological characteristics of the VW network are not such as to favor the systemic risk associated with shock propagation; and (iii) higher-order interconnections may reveal further important information about the structure of a network. Regarding the first result, fluctuations in output volumes, among the sources of shock analyzed here, are more likely to generate some instability. The first implication is that, on one side, past national or regional economic crises were not necessarily brought about or strengthened by global trade. The second, more remarkable, implication is that, on the other side, supporting a national policy of self-sufficiency in food production while progressively reducing the participation in international agricultural trade does not necessarily protect a country from economic instability. Moreover, it is well established in the literature that, over time, international food trade has favored more efficient use of water resources, at the global level. This fact, together with our conclusions, highlights the important role of international trade in driving the efficient allocation of water resources. To sum up, our evidence reveals that the increased globalization witnessed in the last 30 years is not associated with an increased frequency of adverse shocks (in either precipitation or food production). Furthermore, building on recent advances in network analysis that connect the stability of a complex system to the interaction between the distribution of shocks and the network topology, we find that the world is more interconnected, but not necessarily less stable.
Optimal deployment of resources for maximizing impact in spreading processes
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lokhov, Andrey Y.; Saad, David
The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of “influential spreaders” for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings, the problem is often characterized by heterogeneous interactions and requires interventions in a dynamic fashion over a finite time window via a restricted set of controllable nodes. The optimal distributionmore » of available resources hence results from an interplay between network topology and spreading dynamics. Here, we show how these problems can be addressed as particular instances of a universal analytical framework based on a scalable dynamic message-passing approach and demonstrate the efficacy of the method on a variety of real-world examples.« less
Optimal deployment of resources for maximizing impact in spreading processes
Lokhov, Andrey Y.; Saad, David
2017-09-12
The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of “influential spreaders” for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings, the problem is often characterized by heterogeneous interactions and requires interventions in a dynamic fashion over a finite time window via a restricted set of controllable nodes. The optimal distributionmore » of available resources hence results from an interplay between network topology and spreading dynamics. Here, we show how these problems can be addressed as particular instances of a universal analytical framework based on a scalable dynamic message-passing approach and demonstrate the efficacy of the method on a variety of real-world examples.« less
NASA Astrophysics Data System (ADS)
Bourriez, F.; Sauvaud, J.-A.; Pinçon, J.-L.; Berthelier, J.-J.; Parrot, M.
2016-02-01
The DEMETER (Detection of Electro-Magnetic Emissions Transmitted from Earthquake Regions) spacecraft detects short bursts of lightning-induced electron precipitation (LEP) simultaneously with newly injected upgoing whistlers. The LEP occurs within < 1 s of the causative lightning discharge. First in situ observations of the size and location of the region affected by the LEP precipitation are presented on the basis of a statistical study made over Europe using the DEMETER energetic particle detector, wave electric field experiment, and networks of lightning detection (Météorage, the UK Met Office Arrival Time Difference network (ATDnet), and the World Wide Lightning Location Network (WWLLN)). The LEP is shown to occur significantly north of the initial lightning and extends over some 1000 km on each side of the longitude of the lightning. In agreement with models of electron interaction with obliquely propagating lightning-generated whistlers, the distance from the LEP to the lightning decreases as lightning proceed to higher latitudes.
Report on the 9th EONS Congress, Istanbul, Turkey, 18-19 September 2014: nursing highlights.
Lichosik, D; Caruso, R
2014-01-01
The European Oncology Nursing Society (EONS), in partnership with the Oncology Nursing Association of Turkey (TONA), organised the 9th EONS Congress in Istanbul, Turkey, 18-19 September 2014. The Congress venue was in Harbiye Cultural Centre and Istanbul Military Museum and offered two days of unprecedented scientific, educational, and networking opportunities for all stakeholders active in the field of oncology nursing around the world. EONS is a pan-European organisation dedicated to the support and development of cancer nurses. Through individual members and national societies EONS engages in projects to help nurses develop their skills, network with each other, and raise the profile of cancer nursing across Europe. This biennial Congress brings together cancer nurses across the globe from many fields of expertise to 'Celebrate Excellence in Cancer Nursing' through interactive sessions, lectures, and collegial networking. The format was specifically designed to meet the needs of nurses working in the field of cancer care, education, and research.
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs
NASA Astrophysics Data System (ADS)
Dorn, Britta; Hüffner, Falk; Krüger, Dominikus; Niedermeier, Rolf; Uhlmann, Johannes
We consider the following problem: Given an undirected network and a set of sender-receiver pairs, direct all edges such that the maximum number of "signal flows" defined by the pairs can be routed respecting edge directions. This problem has applications in communication networks and in understanding protein interaction based cell regulation mechanisms. Since this problem is NP-hard, research so far concentrated on polynomial-time approximation algorithms and tractable special cases. We take the viewpoint of parameterized algorithmics and examine several parameters related to the maximum signal flow over vertices or edges. We provide several fixed-parameter tractability results, and in one case a sharp complexity dichotomy between a linear-time solvable case and a slightly more general NP-hard case. We examine the value of these parameters for several real-world network instances. For many relevant cases, the NP-hard problem can be solved to optimality. In this way, parameterized analysis yields both deeper insight into the computational complexity and practical solving strategies.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Murray, B.L.; Hallenbeck, R.A.; Gill, J.M.
This seminar provided an overview on the proliferation of nuclear, chemical and biological weapons as well as missiles and missile technology, and set the stage for subsequent seminar meetings of the 1993 program. A multiplicity of factors -- different nations, regions, and capabilities -- is making dealing with proliferation increasingly complicated. Additionally, recent or upcoming world events introduce further uncertainty into proliferation calculations. These proliferation accelerators and decelerators, will greatly shape and define the overall proliferation picture. These factors combine to raise a whole new series of stability issues which require new analyses and approaches for managing proliferation in themore » post-Cold War era. While technology cannot alone solve the proliferation problem, a particularly promising application is in new information technologies and interactive information management systems. A proliferation information network could be used to fuse large amounts of information and data on exports; license; treaty reporting, notifications, and other obligations; dual use technologies and related scientific advances; and others information of proliferation relevance. This type of network could use readily available technologies, would be simple to use and relatively inexpensive to create and maintain, and could be made available to almost of all of the nations of the world.« less
NASA Astrophysics Data System (ADS)
Atila, U.; Karas, I. R.; Turan, M. K.; Rahman, A. A.
2013-09-01
One of the most dangerous disaster threatening the high rise and complex buildings of today's world including thousands of occupants inside is fire with no doubt. When we consider high population and the complexity of such buildings it is clear to see that performing a rapid and safe evacuation seems hard and human being does not have good memories in case of such disasters like world trade center 9/11. Therefore, it is very important to design knowledge based realtime interactive evacuation methods instead of classical strategies which lack of flexibility. This paper presents a 3D-GIS implementation which simulates the behaviour of an intelligent indoor pedestrian navigation model proposed for a self -evacuation of a person in case of fire. The model is based on Multilayer Perceptron (MLP) which is one of the most preferred artificial neural network architecture in classification and prediction problems. A sample fire scenario following through predefined instructions has been performed on 3D model of the Corporation Complex in Putrajaya (Malaysia) and the intelligent evacuation process has been realized within a proposed 3D-GIS based simulation.
Effect of self-interaction on the evolution of cooperation in complex topologies
NASA Astrophysics Data System (ADS)
Wu, Yu'e.; Zhang, Zhipeng; Chang, Shuhua
2017-09-01
Self-interaction, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this text, we consider a new self-interaction mechanism in the two typical pairwise models including the prisoner's dilemma and the snowdrift games, where the cooperative agents will gain extra bonus for their selfless behavior. We find that under the mechanism the collective cooperation is elevated to a very high level especially after adopting the finite population analogue of replicator dynamics for evolution. The robustness of the new mechanism is tested for different complex topologies for the prisoner's dilemma game. All the presented results demonstrate that the enhancement effects are independent of the structure of the applied spatial networks and the potential evolutionary games, and thus showing a high degree of universality. Our conclusions might shed light on the understanding of the evolution of cooperation in the real world.
Rao, Jinmeng; Qiao, Yanjun; Ren, Fu; Wang, Junxing; Du, Qingyun
2017-01-01
The purpose of this study was to develop a robust, fast and markerless mobile augmented reality method for registration, geovisualization and interaction in uncontrolled outdoor environments. We propose a lightweight deep-learning-based object detection approach for mobile or embedded devices; the vision-based detection results of this approach are combined with spatial relationships by means of the host device’s built-in Global Positioning System receiver, Inertial Measurement Unit and magnetometer. Virtual objects generated based on geospatial information are precisely registered in the real world, and an interaction method based on touch gestures is implemented. The entire method is independent of the network to ensure robustness to poor signal conditions. A prototype system was developed and tested on the Wuhan University campus to evaluate the method and validate its results. The findings demonstrate that our method achieves a high detection accuracy, stable geovisualization results and interaction. PMID:28837096
Rao, Jinmeng; Qiao, Yanjun; Ren, Fu; Wang, Junxing; Du, Qingyun
2017-08-24
The purpose of this study was to develop a robust, fast and markerless mobile augmented reality method for registration, geovisualization and interaction in uncontrolled outdoor environments. We propose a lightweight deep-learning-based object detection approach for mobile or embedded devices; the vision-based detection results of this approach are combined with spatial relationships by means of the host device's built-in Global Positioning System receiver, Inertial Measurement Unit and magnetometer. Virtual objects generated based on geospatial information are precisely registered in the real world, and an interaction method based on touch gestures is implemented. The entire method is independent of the network to ensure robustness to poor signal conditions. A prototype system was developed and tested on the Wuhan University campus to evaluate the method and validate its results. The findings demonstrate that our method achieves a high detection accuracy, stable geovisualization results and interaction.
2012-08-16
threshold of 18% strain, 161 edges were removed. Watts and Strogatz [66] define the small-world network based on the clustering coefficient of the network and...NeuroImage 52: 1059–1069. 65. Latora V, Marchiori M (2001) Efficient behavior of small-world networks. Phys Rev Lett 87: 198701. 66. Watts DJ, Strogatz SH
A dataset on human navigation strategies in foreign networked systems
Kőrösi, Attila; Csoma, Attila; Rétvári, Gábor; Heszberger, Zalán; Bíró, József; Tapolcai, János; Pelle, István; Klajbár, Dávid; Novák, Márton; Halasi, Valentina; Gulyás, András
2018-01-01
Humans are involved in various real-life networked systems. The most obvious examples are social and collaboration networks but the language and the related mental lexicon they use, or the physical map of their territory can also be interpreted as networks. How do they find paths between endpoints in these networks? How do they obtain information about a foreign networked world they find themselves in, how they build mental model for it and how well they succeed in using it? Large, open datasets allowing the exploration of such questions are hard to find. Here we report a dataset collected by a smartphone application, in which players navigate between fixed length source and destination English words step-by-step by changing only one letter at a time. The paths reflect how the players master their navigation skills in such a foreign networked world. The dataset can be used in the study of human mental models for the world around us, or in a broader scope to investigate the navigation strategies in complex networked systems. PMID:29533391
The role of gender in social network organization.
Psylla, Ioanna; Sapiezynski, Piotr; Mones, Enys; Lehmann, Sune
2017-01-01
The digital traces we leave behind when engaging with the modern world offer an interesting lens through which we study behavioral patterns as expression of gender. Although gender differentiation has been observed in a number of settings, the majority of studies focus on a single data stream in isolation. Here we use a dataset of high resolution data collected using mobile phones, as well as detailed questionnaires, to study gender differences in a large cohort. We consider mobility behavior and individual personality traits among a group of more than 800 university students. We also investigate interactions among them expressed via person-to-person contacts, interactions on online social networks, and telecommunication. Thus, we are able to study the differences between male and female behavior captured through a multitude of channels for a single cohort. We find that while the two genders are similar in a number of aspects, there are robust deviations that include multiple facets of social interactions, suggesting the existence of inherent behavioral differences. Finally, we quantify how aspects of an individual's characteristics and social behavior reveals their gender by posing it as a classification problem. We ask: How well can we distinguish between male and female study participants based on behavior alone? Which behavioral features are most predictive?
The role of gender in social network organization
Psylla, Ioanna; Mones, Enys; Lehmann, Sune
2017-01-01
The digital traces we leave behind when engaging with the modern world offer an interesting lens through which we study behavioral patterns as expression of gender. Although gender differentiation has been observed in a number of settings, the majority of studies focus on a single data stream in isolation. Here we use a dataset of high resolution data collected using mobile phones, as well as detailed questionnaires, to study gender differences in a large cohort. We consider mobility behavior and individual personality traits among a group of more than 800 university students. We also investigate interactions among them expressed via person-to-person contacts, interactions on online social networks, and telecommunication. Thus, we are able to study the differences between male and female behavior captured through a multitude of channels for a single cohort. We find that while the two genders are similar in a number of aspects, there are robust deviations that include multiple facets of social interactions, suggesting the existence of inherent behavioral differences. Finally, we quantify how aspects of an individual’s characteristics and social behavior reveals their gender by posing it as a classification problem. We ask: How well can we distinguish between male and female study participants based on behavior alone? Which behavioral features are most predictive? PMID:29261767
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.
2014-01-01
Background Networks are increasingly regarded as essential in health research aimed at influencing practice and policies. Less research has focused on the role networking can play in researchers’ careers and its broader impacts on capacity strengthening in health research. We used the Canadian Coalition for Global Health Research (CCGHR) annual Summer Institute for New Global Health Researchers (SIs) as an opportunity to explore networking among new global health researchers. Methods A mixed-methods exploratory study was conducted among SI alumni and facilitators who had participated in at least one SI between 2004 and 2010. Alumni and facilitators completed an online short questionnaire, and a subset participated in an in-depth interview. Thematic analysis of the qualitative data was triangulated with quantitative results and CCGHR reports on SIs. Synthesis occurred through the development of a process model relevant to networking through the SIs. Results Through networking at the SIs, participants experienced decreased isolation and strengthened working relationships. Participants accessed new knowledge, opportunities, and resources through networking during the SI. Post-SI, participants reported ongoing contact and collaboration, although most participants desired more opportunities for interaction. They made suggestions for structural supports to networking among new global health researchers. Conclusions Networking at the SI contributed positively to opportunities for individuals, and contributed to the formation of a network of global health researchers. Intentional inclusion of networking in health research capacity strengthening initiatives, with supportive resources and infrastructure could create dynamic, sustainable networks accessible to global health researchers around the world. PMID:24460819
He, Jieyue; Wang, Chunyan; Qiu, Kunpu; Zhong, Wei
2014-01-01
Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. The algorithm of probability graph isomorphism evaluation based on circuit simulation method excludes most of subgraphs which are not probability isomorphism and reduces the search space of the probability isomorphism subgraphs using the mismatch values in the node voltage set. It is an innovative way to find the frequent probability patterns, which can be efficiently applied to probability motif discovery problems in the further studies.
2014-01-01
Background Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. Methods In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. Results The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. Conclusions The algorithm of probability graph isomorphism evaluation based on circuit simulation method excludes most of subgraphs which are not probability isomorphism and reduces the search space of the probability isomorphism subgraphs using the mismatch values in the node voltage set. It is an innovative way to find the frequent probability patterns, which can be efficiently applied to probability motif discovery problems in the further studies. PMID:25350277
Community detection for networks with unipartite and bipartite structure
NASA Astrophysics Data System (ADS)
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.
Towards Gesture-Based Multi-User Interactions in Collaborative Virtual Environments
NASA Astrophysics Data System (ADS)
Pretto, N.; Poiesi, F.
2017-11-01
We present a virtual reality (VR) setup that enables multiple users to participate in collaborative virtual environments and interact via gestures. A collaborative VR session is established through a network of users that is composed of a server and a set of clients. The server manages the communication amongst clients and is created by one of the users. Each user's VR setup consists of a Head Mounted Display (HMD) for immersive visualisation, a hand tracking system to interact with virtual objects and a single-hand joypad to move in the virtual environment. We use Google Cardboard as a HMD for the VR experience and a Leap Motion for hand tracking, thus making our solution low cost. We evaluate our VR setup though a forensics use case, where real-world objects pertaining to a simulated crime scene are included in a VR environment, acquired using a smartphone-based 3D reconstruction pipeline. Users can interact using virtual gesture-based tools such as pointers and rulers.
Empirical analysis of online social networks in the age of Web 2.0
NASA Astrophysics Data System (ADS)
Fu, Feng; Liu, Lianghuan; Wang, Long
2008-01-01
Today the World Wide Web is undergoing a subtle but profound shift to Web 2.0, to become more of a social web. The use of collaborative technologies such as blogs and social networking site (SNS) leads to instant online community in which people communicate rapidly and conveniently with each other. Moreover, there are growing interest and concern regarding the topological structure of these new online social networks. In this paper, we present empirical analysis of statistical properties of two important Chinese online social networks-a blogging network and an SNS open to college students. They are both emerging in the age of Web 2.0. We demonstrate that both networks possess small-world and scale-free features already observed in real-world and artificial networks. In addition, we investigate the distribution of topological distance. Furthermore, we study the correlations between degree (in/out) and degree (in/out), clustering coefficient and degree, popularity (in terms of number of page views) and in-degree (for the blogging network), respectively. We find that the blogging network shows disassortative mixing pattern, whereas the SNS network is an assortative one. Our research may help us to elucidate the self-organizing structural characteristics of these online social networks embedded in technical forms.
Plasmodial vein networks of the slime mold Physarum polycephalum form regular graphs
NASA Astrophysics Data System (ADS)
Baumgarten, Werner; Ueda, Tetsuo; Hauser, Marcus J. B.
2010-10-01
The morphology of a typical developing biological transportation network, the vein network of the plasmodium of the myxomycete Physarum polycephalum is analyzed during its free extension. The network forms a classical, regular graph, and has exclusively nodes of degree 3. This contrasts to most real-world transportation networks which show small-world or scale-free properties. The complexity of the vein network arises from the weighting of the lengths, widths, and areas of the vein segments. The lengths and areas follow exponential distributions, while the widths are distributed log-normally. These functional dependencies are robust during the entire evolution of the network, even though the exponents change with time due to the coarsening of the vein network.
Plasmodial vein networks of the slime mold Physarum polycephalum form regular graphs.
Baumgarten, Werner; Ueda, Tetsuo; Hauser, Marcus J B
2010-10-01
The morphology of a typical developing biological transportation network, the vein network of the plasmodium of the myxomycete Physarum polycephalum is analyzed during its free extension. The network forms a classical, regular graph, and has exclusively nodes of degree 3. This contrasts to most real-world transportation networks which show small-world or scale-free properties. The complexity of the vein network arises from the weighting of the lengths, widths, and areas of the vein segments. The lengths and areas follow exponential distributions, while the widths are distributed log-normally. These functional dependencies are robust during the entire evolution of the network, even though the exponents change with time due to the coarsening of the vein network.
Network rewiring dynamics with convergence towards a star network
Dick, G.; Parry, M.
2016-01-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. PMID:27843396
Network rewiring dynamics with convergence towards a star network.
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.
Small-world human brain networks: Perspectives and challenges.
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.
Identifying key nodes in multilayer networks based on tensor decomposition.
Wang, Dingjie; Wang, Haitao; Zou, Xiufen
2017-06-01
The identification of essential agents in multilayer networks characterized by different types of interactions is a crucial and challenging topic, one that is essential for understanding the topological structure and dynamic processes of multilayer networks. In this paper, we use the fourth-order tensor to represent multilayer networks and propose a novel method to identify essential nodes based on CANDECOMP/PARAFAC (CP) tensor decomposition, referred to as the EDCPTD centrality. This method is based on the perspective of multilayer networked structures, which integrate the information of edges among nodes and links between different layers to quantify the importance of nodes in multilayer networks. Three real-world multilayer biological networks are used to evaluate the performance of the EDCPTD centrality. The bar chart and ROC curves of these multilayer networks indicate that the proposed approach is a good alternative index to identify real important nodes. Meanwhile, by comparing the behavior of both the proposed method and the aggregated single-layer methods, we demonstrate that neglecting the multiple relationships between nodes may lead to incorrect identification of the most versatile nodes. Furthermore, the Gene Ontology functional annotation demonstrates that the identified top nodes based on the proposed approach play a significant role in many vital biological processes. Finally, we have implemented many centrality methods of multilayer networks (including our method and the published methods) and created a visual software based on the MATLAB GUI, called ENMNFinder, which can be used by other researchers.
A decentralized mechanism for improving the functional robustness of distribution networks.
Shi, Benyun; Liu, Jiming
2012-10-01
Most real-world distribution systems can be modeled as distribution networks, where a commodity can flow from source nodes to sink nodes through junction nodes. One of the fundamental characteristics of distribution networks is the functional robustness, which reflects the ability of maintaining its function in the face of internal or external disruptions. In view of the fact that most distribution networks do not have any centralized control mechanisms, we consider the problem of how to improve the functional robustness in a decentralized way. To achieve this goal, we study two important problems: 1) how to formally measure the functional robustness, and 2) how to improve the functional robustness of a network based on the local interaction of its nodes. First, we derive a utility function in terms of network entropy to characterize the functional robustness of a distribution network. Second, we propose a decentralized network pricing mechanism, where each node need only communicate with its distribution neighbors by sending a "price" signal to its upstream neighbors and receiving "price" signals from its downstream neighbors. By doing so, each node can determine its outflows by maximizing its own payoff function. Our mathematical analysis shows that the decentralized pricing mechanism can produce results equivalent to those of an ideal centralized maximization with complete information. Finally, to demonstrate the properties of our mechanism, we carry out a case study on the U.S. natural gas distribution network. The results validate the convergence and effectiveness of our mechanism when comparing it with an existing algorithm.
Identifying key nodes in multilayer networks based on tensor decomposition
NASA Astrophysics Data System (ADS)
Wang, Dingjie; Wang, Haitao; Zou, Xiufen
2017-06-01
The identification of essential agents in multilayer networks characterized by different types of interactions is a crucial and challenging topic, one that is essential for understanding the topological structure and dynamic processes of multilayer networks. In this paper, we use the fourth-order tensor to represent multilayer networks and propose a novel method to identify essential nodes based on CANDECOMP/PARAFAC (CP) tensor decomposition, referred to as the EDCPTD centrality. This method is based on the perspective of multilayer networked structures, which integrate the information of edges among nodes and links between different layers to quantify the importance of nodes in multilayer networks. Three real-world multilayer biological networks are used to evaluate the performance of the EDCPTD centrality. The bar chart and ROC curves of these multilayer networks indicate that the proposed approach is a good alternative index to identify real important nodes. Meanwhile, by comparing the behavior of both the proposed method and the aggregated single-layer methods, we demonstrate that neglecting the multiple relationships between nodes may lead to incorrect identification of the most versatile nodes. Furthermore, the Gene Ontology functional annotation demonstrates that the identified top nodes based on the proposed approach play a significant role in many vital biological processes. Finally, we have implemented many centrality methods of multilayer networks (including our method and the published methods) and created a visual software based on the MATLAB GUI, called ENMNFinder, which can be used by other researchers.
Randomizing bipartite networks: the case of the World Trade Web.
Saracco, Fabio; Di Clemente, Riccardo; Gabrielli, Andrea; Squartini, Tiziano
2015-06-01
Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful representation of many systems, ranging from mutualistic networks in ecology to trade networks in economy, whence the need of a pattern detection-oriented analysis in order to identify statistically-significant structural properties. Such an analysis rests upon the definition of suitable null models, i.e. upon the choice of the portion of network structure to be preserved while randomizing everything else. However, quite surprisingly, little work has been done so far to define null models for real bipartite networks. The aim of the present work is to fill this gap, extending a recently-proposed method to randomize monopartite networks to bipartite networks. While the proposed formalism is perfectly general, we apply our method to the binary, undirected, bipartite representation of the World Trade Web, comparing the observed values of a number of structural quantities of interest with the expected ones, calculated via our randomization procedure. Interestingly, the behavior of the World Trade Web in this new representation is strongly different from the monopartite analogue, showing highly non-trivial patterns of self-organization.
Phase synchronization of bursting neurons in clustered small-world networks
NASA Astrophysics Data System (ADS)
Batista, C. A. S.; Lameu, E. L.; Batista, A. M.; Lopes, S. R.; Pereira, T.; Zamora-López, G.; Kurths, J.; Viana, R. L.
2012-07-01
We investigate the collective dynamics of bursting neurons on clustered networks. The clustered network model is composed of subnetworks, each of them presenting the so-called small-world property. This model can also be regarded as a network of networks. In each subnetwork a neuron is connected to other ones with regular as well as random connections, the latter with a given intracluster probability. Moreover, in a given subnetwork each neuron has an intercluster probability to be connected to the other subnetworks. The local neuron dynamics has two time scales (fast and slow) and is modeled by a two-dimensional map. In such small-world network the neuron parameters are chosen to be slightly different such that, if the coupling strength is large enough, there may be synchronization of the bursting (slow) activity. We give bounds for the critical coupling strength to obtain global burst synchronization in terms of the network structure, that is, the probabilities of intracluster and intercluster connections. We find that, as the heterogeneity in the network is reduced, the network global synchronizability is improved. We show that the transitions to global synchrony may be abrupt or smooth depending on the intercluster probability.
[Doctors and the benefits and dangers of social networks].
Tisseron, Serge
2015-05-13
Social networks have many different uses. Most young people use them for experimentation and innovation. Social networks help young people get familiar with the digital world, and develop themselves in interrelation with their peers. But social networks can also be used to avoid relationships in the real world, or to practice different forms of harassment. A specific danger lies in forgetting that a great number of people can have access to personal information posted online. Doctors should be particularly aware of this issue.
Global Mapping of the Yeast Genetic Interaction Network
NASA Astrophysics Data System (ADS)
Tong, Amy Hin Yan; Lesage, Guillaume; Bader, Gary D.; Ding, Huiming; Xu, Hong; Xin, Xiaofeng; Young, James; Berriz, Gabriel F.; Brost, Renee L.; Chang, Michael; Chen, YiQun; Cheng, Xin; Chua, Gordon; Friesen, Helena; Goldberg, Debra S.; Haynes, Jennifer; Humphries, Christine; He, Grace; Hussein, Shamiza; Ke, Lizhu; Krogan, Nevan; Li, Zhijian; Levinson, Joshua N.; Lu, Hong; Ménard, Patrice; Munyana, Christella; Parsons, Ainslie B.; Ryan, Owen; Tonikian, Raffi; Roberts, Tania; Sdicu, Anne-Marie; Shapiro, Jesse; Sheikh, Bilal; Suter, Bernhard; Wong, Sharyl L.; Zhang, Lan V.; Zhu, Hongwei; Burd, Christopher G.; Munro, Sean; Sander, Chris; Rine, Jasper; Greenblatt, Jack; Peter, Matthias; Bretscher, Anthony; Bell, Graham; Roth, Frederick P.; Brown, Grant W.; Andrews, Brenda; Bussey, Howard; Boone, Charles
2004-02-01
A genetic interaction network containing ~1000 genes and ~4000 interactions was mapped by crossing mutations in 132 different query genes into a set of ~4700 viable gene yeast deletion mutants and scoring the double mutant progeny for fitness defects. Network connectivity was predictive of function because interactions often occurred among functionally related genes, and similar patterns of interactions tended to identify components of the same pathway. The genetic network exhibited dense local neighborhoods; therefore, the position of a gene on a partially mapped network is predictive of other genetic interactions. Because digenic interactions are common in yeast, similar networks may underlie the complex genetics associated with inherited phenotypes in other organisms.