WorldWideScience

Sample records for networks network structure

  1. Social Networks and Network Structures

    Science.gov (United States)

    2006-11-01

    Research in Command & Control • Latent Semantic Analysis – Team communication – Emergent team dynamics – Shared situation awareness • Dynamic Network...requirements – Information technology requirements 28 LSA Essentials of Latent Semantic Analysis 29 Communication Analysis • Goal: Automatically monitor and

  2. Evolving production network structures

    DEFF Research Database (Denmark)

    Grunow, Martin; Gunther, H.O.; Burdenik, H.

    2007-01-01

    When deciding about future production network configurations, the current structures have to be taken into account. Further, core issues such as the maturity of the products and the capacity requirements for test runs and ramp-ups must be incorporated. Our approach is based on optimization...... modelling and assigns products and capacity expansions to production sites under the above constraints. It also considers the production complexity at the individual sites and the flexibility of the network. Our implementation results for a large manufacturing network reveal substantial possible cost...... reductions compared to the traditional manual planning results of our industrial partner....

  3. Network structure of production

    Science.gov (United States)

    Atalay, Enghin; Hortaçsu, Ali; Roberts, James; Syverson, Chad

    2011-01-01

    Complex social networks have received increasing attention from researchers. Recent work has focused on mechanisms that produce scale-free networks. We theoretically and empirically characterize the buyer–supplier network of the US economy and find that purely scale-free models have trouble matching key attributes of the network. We construct an alternative model that incorporates realistic features of firms’ buyer–supplier relationships and estimate the model’s parameters using microdata on firms’ self-reported customers. This alternative framework is better able to match the attributes of the actual economic network and aids in further understanding several important economic phenomena. PMID:21402924

  4. [Network structures in biological systems].

    Science.gov (United States)

    Oleskin, A V

    2013-01-01

    Network structures (networks) that have been extensively studied in the humanities are characterized by cohesion, a lack of a central control unit, and predominantly fractal properties. They are contrasted with structures that contain a single centre (hierarchies) as well as with those whose elements predominantly compete with one another (market-type structures). As far as biological systems are concerned, their network structures can be subdivided into a number of types involving different organizational mechanisms. Network organization is characteristic of various structural levels of biological systems ranging from single cells to integrated societies. These networks can be classified into two main subgroups: (i) flat (leaderless) network structures typical of systems that are composed of uniform elements and represent modular organisms or at least possess manifest integral properties and (ii) three-dimensional, partly hierarchical structures characterized by significant individual and/or intergroup (intercaste) differences between their elements. All network structures include an element that performs structural, protective, and communication-promoting functions. By analogy to cell structures, this element is denoted as the matrix of a network structure. The matrix includes a material and an immaterial component. The material component comprises various structures that belong to the whole structure and not to any of its elements per se. The immaterial (ideal) component of the matrix includes social norms and rules regulating network elements' behavior. These behavioral rules can be described in terms of algorithms. Algorithmization enables modeling the behavior of various network structures, particularly of neuron networks and their artificial analogs.

  5. Advanced Polymer Network Structures

    Science.gov (United States)

    2016-02-01

    characteristic time 02 /UmaLJ =τ . Topologically bound monomers interact through the sum of the purely repulsive LJ potential ( arc 6/12= ) or so-called Weeks...3 Content of the simulated polymer double network. Self- attraction coefficient between particles within a network (first or second) is fixed at 1...technique to the study the microscopic topology and dynamics of a wide variety of polymer networks and gels.5–8 The pair interaction between

  6. Stability from Structure : Metabolic Networks Are Unlike Other Biological Networks

    NARCIS (Netherlands)

    Van Nes, P.; Bellomo, D.; Reinders, M.J.T.; De Ridder, D.

    2009-01-01

    In recent work, attempts have been made to link the structure of biochemical networks to their complex dynamics. It was shown that structurally stable network motifs are enriched in such networks. In this work, we investigate to what extent these findings apply to metabolic networks. To this end, we

  7. Discovering network structure beyond communities.

    Science.gov (United States)

    Nishikawa, Takashi; Motter, Adilson E

    2011-01-01

    To understand the formation, evolution, and function of complex systems, it is crucial to understand the internal organization of their interaction networks. Partly due to the impossibility of visualizing large complex networks, resolving network structure remains a challenging problem. Here we overcome this difficulty by combining the visual pattern recognition ability of humans with the high processing speed of computers to develop an exploratory method for discovering groups of nodes characterized by common network properties, including but not limited to communities of densely connected nodes. Without any prior information about the nature of the groups, the method simultaneously identifies the number of groups, the group assignment, and the properties that define these groups. The results of applying our method to real networks suggest the possibility that most group structures lurk undiscovered in the fast-growing inventory of social, biological, and technological networks of scientific interest.

  8. Discovering Network Structure Beyond Communities

    OpenAIRE

    Nishikawa, Takashi; Motter, Adilson E.

    2011-01-01

    To understand the formation, evolution, and function of complex systems, it is crucial to understand the internal organization of their interaction networks. Partly due to the impossibility of visualizing large complex networks, resolving network structure remains a challenging problem. Here we overcome this difficulty by combining the visual pattern recognition ability of humans with the high processing speed of computers to develop an exploratory method for discovering groups of nodes chara...

  9. From network structure to network reorganization: implications for adult neurogenesis

    Science.gov (United States)

    Schneider-Mizell, Casey M.; Parent, Jack M.; Ben-Jacob, Eshel; Zochowski, Michal R.; Sander, Leonard M.

    2010-12-01

    Networks can be dynamical systems that undergo functional and structural reorganization. One example of such a process is adult hippocampal neurogenesis, in which new cells are continuously born and incorporate into the existing network of the dentate gyrus region of the hippocampus. Many of these introduced cells mature and become indistinguishable from established neurons, joining the existing network. Activity in the network environment is known to promote birth, survival and incorporation of new cells. However, after epileptogenic injury, changes to the connectivity structure around the neurogenic niche are known to correlate with aberrant neurogenesis. The possible role of network-level changes in the development of epilepsy is not well understood. In this paper, we use a computational model to investigate how the structural and functional outcomes of network reorganization, driven by addition of new cells during neurogenesis, depend on the original network structure. We find that there is a stable network topology that allows the network to incorporate new neurons in a manner that enhances activity of the persistently active region, but maintains global network properties. In networks having other connectivity structures, new cells can greatly alter the distribution of firing activity and destroy the initial activity patterns. We thus find that new cells are able to provide focused enhancement of network only for small-world networks with sufficient inhibition. Network-level deviations from this topology, such as those caused by epileptogenic injury, can set the network down a path that develops toward pathological dynamics and aberrant structural integration of new cells.

  10. Inferring network structure from cascades

    Science.gov (United States)

    Ghonge, Sushrut; Vural, Dervis Can

    2017-07-01

    Many physical, biological, and social phenomena can be described by cascades taking place on a network. Often, the activity can be empirically observed, but not the underlying network of interactions. In this paper we offer three topological methods to infer the structure of any directed network given a set of cascade arrival times. Our formulas hold for a very general class of models where the activation probability of a node is a generic function of its degree and the number of its active neighbors. We report high success rates for synthetic and real networks, for several different cascade models.

  11. Collective network for computer structures

    Energy Technology Data Exchange (ETDEWEB)

    Blumrich, Matthias A [Ridgefield, CT; Coteus, Paul W [Yorktown Heights, NY; Chen, Dong [Croton On Hudson, NY; Gara, Alan [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Hoenicke, Dirk [Ossining, NY; Takken, Todd E [Brewster, NY; Steinmacher-Burow, Burkhard D [Wernau, DE; Vranas, Pavlos M [Bedford Hills, NY

    2011-08-16

    A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices ate included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

  12. Detecting Hierarchical Structure in Networks

    DEFF Research Database (Denmark)

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

    2012-01-01

    a generative Bayesian model that is able to infer whether hierarchies are present or not from a hypothesis space encompassing all types of hierarchical tree structures. For efficient inference we propose a collapsed Gibbs sampling procedure that jointly infers a partition and its hierarchical structure......Many real-world networks exhibit hierarchical organization. Previous models of hierarchies within relational data has focused on binary trees; however, for many networks it is unknown whether there is hierarchical structure, and if there is, a binary tree might not account well for it. We propose....... On synthetic and real data we demonstrate that our model can detect hierarchical structure leading to better link-prediction than competing models. Our model can be used to detect if a network exhibits hierarchical structure, thereby leading to a better comprehension and statistical account the network....

  13. Community structure of complex networks based on continuous neural network

    Science.gov (United States)

    Dai, Ting-ting; Shan, Chang-ji; Dong, Yan-shou

    2017-09-01

    As a new subject, the research of complex networks has attracted the attention of researchers from different disciplines. Community structure is one of the key structures of complex networks, so it is a very important task to analyze the community structure of complex networks accurately. In this paper, we study the problem of extracting the community structure of complex networks, and propose a continuous neural network (CNN) algorithm. It is proved that for any given initial value, the continuous neural network algorithm converges to the eigenvector of the maximum eigenvalue of the network modularity matrix. Therefore, according to the stability of the evolution of the network symbol will be able to get two community structure.

  14. Structurally Dynamic Spin Market Networks

    Science.gov (United States)

    Horváth, Denis; Kuscsik, Zoltán

    The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent "brain" is modeled by a recursive neural network with local and global inputs and feedback connections. For specific parametric combination the complex network displays small-world phenomenon combined with scale-free behavior. The identification of a local leader (network hub, agent whose strategies are frequently adapted by its neighbors) is carried out by repeated random walk process through network. The simulations show empirically relevant dynamics of price returns and volatility clustering. The additional emerging aspects of stylized market statistics are Zipfian distributions of fitness.

  15. Confidence sets for network structure

    CERN Document Server

    Airoldi, Edoardo M; Wolfe, Patrick J

    2011-01-01

    Latent variable models are frequently used to identify structure in dichotomous network data, in part because they give rise to a Bernoulli product likelihood that is both well understood and consistent with the notion of exchangeable random graphs. In this article we propose conservative confidence sets that hold with respect to these underlying Bernoulli parameters as a function of any given partition of network nodes, enabling us to assess estimates of 'residual' network structure, that is, structure that cannot be explained by known covariates and thus cannot be easily verified by manual inspection. We demonstrate the proposed methodology by analyzing student friendship networks from the National Longitudinal Survey of Adolescent Health that include race, gender, and school year as covariates. We employ a stochastic expectation-maximization algorithm to fit a logistic regression model that includes these explanatory variables as well as a latent stochastic blockmodel component and additional node-specific...

  16. Predictive structural dynamic network analysis.

    Science.gov (United States)

    Chen, Rong; Herskovits, Edward H

    2015-04-30

    Classifying individuals based on magnetic resonance data is an important task in neuroscience. Existing brain network-based methods to classify subjects analyze data from a cross-sectional study and these methods cannot classify subjects based on longitudinal data. We propose a network-based predictive modeling method to classify subjects based on longitudinal magnetic resonance data. Our method generates a dynamic Bayesian network model for each group which represents complex spatiotemporal interactions among brain regions, and then calculates a score representing that subject's deviation from expected network patterns. This network-derived score, along with other candidate predictors, are used to construct predictive models. We validated the proposed method based on simulated data and the Alzheimer's Disease Neuroimaging Initiative study. For the Alzheimer's Disease Neuroimaging Initiative study, we built a predictive model based on the baseline biomarker characterizing the baseline state and the network-based score which was constructed based on the state transition probability matrix. We found that this combined model achieved 0.86 accuracy, 0.85 sensitivity, and 0.87 specificity. For the Alzheimer's Disease Neuroimaging Initiative study, the model based on the baseline biomarkers achieved 0.77 accuracy. The accuracy of our model is significantly better than the model based on the baseline biomarkers (p-value=0.002). We have presented a method to classify subjects based on structural dynamic network model based scores. This method is of great importance to distinguish subjects based on structural network dynamics and the understanding of the network architecture of brain processes and disorders. Copyright © 2015 Elsevier B.V. All rights reserved.

  17. On the topological structure of multinationals network

    Science.gov (United States)

    Joyez, Charlie

    2017-05-01

    This paper uses a weighted network analysis to examine the structure of multinationals' implantation countries network. Based on French firm-level dataset of multinational enterprises (MNEs) the network analysis provides information on each country position in the network and in internationalization strategies of French MNEs through connectivity preferences among the nodes. The paper also details network-wide features and their recent evolution toward a more decentralized structure. While much has been said on international trade network, this paper shows that multinational firms' studies would also benefit from network analysis, notably by investigating the sensitivity of the network construction to firm heterogeneity.

  18. Sensitive Dependence of Optimal Network Dynamics on Network Structure

    Directory of Open Access Journals (Sweden)

    Takashi Nishikawa

    2017-11-01

    Full Text Available The relation between network structure and dynamics is determinant for the behavior of complex systems in numerous domains. An important long-standing problem concerns the properties of the networks that optimize the dynamics with respect to a given performance measure. Here, we show that such optimization can lead to sensitive dependence of the dynamics on the structure of the network. Specifically, using diffusively coupled systems as examples, we demonstrate that the stability of a dynamical state can exhibit sensitivity to unweighted structural perturbations (i.e., link removals and node additions for undirected optimal networks and to weighted perturbations (i.e., small changes in link weights for directed optimal networks. As mechanisms underlying this sensitivity, we identify discontinuous transitions occurring in the complement of undirected optimal networks and the prevalence of eigenvector degeneracy in directed optimal networks. These findings establish a unified characterization of networks optimized for dynamical stability, which we illustrate using Turing instability in activator-inhibitor systems, synchronization in power-grid networks, network diffusion, and several other network processes. Our results suggest that the network structure of a complex system operating near an optimum can potentially be fine-tuned for a significantly enhanced stability compared to what one might expect from simple extrapolation. On the other hand, they also suggest constraints on how close to the optimum the system can be in practice. Finally, the results have potential implications for biophysical networks, which have evolved under the competing pressures of optimizing fitness while remaining robust against perturbations.

  19. Exploring biological network structure with clustered random networks

    Directory of Open Access Journals (Sweden)

    Bansal Shweta

    2009-12-01

    Full Text Available Abstract Background Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions and the extent of clustering (the tendency for a set of three nodes to be interconnected are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Results Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics. Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. Conclusion ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in

  20. Exploring biological network structure with clustered random networks.

    Science.gov (United States)

    Bansal, Shweta; Khandelwal, Shashank; Meyers, Lauren Ancel

    2009-12-09

    Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions) and the extent of clustering (the tendency for a set of three nodes to be interconnected) are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks) provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics.Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in unraveling the functional consequences of the structural

  1. Exploring the Community Structure of Complex Networks

    OpenAIRE

    Drago, Carlo

    2016-01-01

    Regarding complex networks, one of the most relevant problems is to understand and to explore community structure. In particular it is important to define the network organization and the functions associated to the different network partitions. In this context, the idea is to consider some new approaches based on interval data in order to represent the different relevant network components as communities. The method is also useful to represent the network community structure, especially the ...

  2. Global Electricity Trade Network: Structures and Implications

    Science.gov (United States)

    Ji, Ling; Jia, Xiaoping; Chiu, Anthony S. F.; Xu, Ming

    2016-01-01

    Nations increasingly trade electricity, and understanding the structure of the global power grid can help identify nations that are critical for its reliability. This study examines the global grid as a network with nations as nodes and international electricity trade as links. We analyze the structure of the global electricity trade network and find that the network consists of four sub-networks, and provide a detailed analysis of the largest network, Eurasia. Russia, China, Ukraine, and Azerbaijan have high betweenness measures in the Eurasian sub-network, indicating the degrees of centrality of the positions they hold. The analysis reveals that the Eurasian sub-network consists of seven communities based on the network structure. We find that the communities do not fully align with geographical proximity, and that the present international electricity trade in the Eurasian sub-network causes an approximately 11 million additional tons of CO2 emissions. PMID:27504825

  3. Global Electricity Trade Network: Structures and Implications.

    Science.gov (United States)

    Ji, Ling; Jia, Xiaoping; Chiu, Anthony S F; Xu, Ming

    2016-01-01

    Nations increasingly trade electricity, and understanding the structure of the global power grid can help identify nations that are critical for its reliability. This study examines the global grid as a network with nations as nodes and international electricity trade as links. We analyze the structure of the global electricity trade network and find that the network consists of four sub-networks, and provide a detailed analysis of the largest network, Eurasia. Russia, China, Ukraine, and Azerbaijan have high betweenness measures in the Eurasian sub-network, indicating the degrees of centrality of the positions they hold. The analysis reveals that the Eurasian sub-network consists of seven communities based on the network structure. We find that the communities do not fully align with geographical proximity, and that the present international electricity trade in the Eurasian sub-network causes an approximately 11 million additional tons of CO2 emissions.

  4. Social structure of Facebook networks

    Science.gov (United States)

    Traud, Amanda L.; Mucha, Peter J.; Porter, Mason A.

    2012-08-01

    We study the social structure of Facebook “friendship” networks at one hundred American colleges and universities at a single point in time, and we examine the roles of user attributes-gender, class year, major, high school, and residence-at these institutions. We investigate the influence of common attributes at the dyad level in terms of assortativity coefficients and regression models. We then examine larger-scale groupings by detecting communities algorithmically and comparing them to network partitions based on user characteristics. We thereby examine the relative importance of different characteristics at different institutions, finding for example that common high school is more important to the social organization of large institutions and that the importance of common major varies significantly between institutions. Our calculations illustrate how microscopic and macroscopic perspectives give complementary insights on the social organization at universities and suggest future studies to investigate such phenomena further.

  5. Structural Analysis of Complex Networks

    CERN Document Server

    Dehmer, Matthias

    2011-01-01

    Filling a gap in literature, this self-contained book presents theoretical and application-oriented results that allow for a structural exploration of complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Applications to biology, chemistry, linguistics, and data analysis are emphasized. The book is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science,

  6. Robustness and structure of complex networks

    Science.gov (United States)

    Shao, Shuai

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

  7. Structure of triadic relations in multiplex networks

    Science.gov (United States)

    Cozzo, Emanuele; Kivelä, Mikko; De Domenico, Manlio; Solé-Ribalta, Albert; Arenas, Alex; Gómez, Sergio; Porter, Mason A.; Moreno, Yamir

    2015-07-01

    Recent advances in the study of networked systems have highlighted that our interconnected world is composed of networks that are coupled to each other through different ‘layers’ that each represent one of many possible subsystems or types of interactions. Nevertheless, it is traditional to aggregate multilayer networks into a single weighted network in order to take advantage of existing tools. This is admittedly convenient, but it is also extremely problematic, as important information can be lost as a result. It is therefore important to develop multilayer generalizations of network concepts. In this paper, we analyze triadic relations and generalize the idea of transitivity to multiplex networks. By focusing on triadic relations, which yield the simplest type of transitivity, we generalize the concept and computation of clustering coefficients to multiplex networks. We show how the layered structure of such networks introduces a new degree of freedom that has a fundamental effect on transitivity. We compute multiplex clustering coefficients for several real multiplex networks and illustrate why one must take great care when generalizing standard network concepts to multiplex networks. We also derive analytical expressions for our clustering coefficients for ensemble averages of networks in a family of random multiplex networks. Our analysis illustrates that social networks have a strong tendency to promote redundancy by closing triads at every layer and that they thereby have a different type of multiplex transitivity from transportation networks, which do not exhibit such a tendency. These insights are invisible if one only studies aggregated networks.

  8. Communication on the structure of biological networks

    Indian Academy of Sciences (India)

    Abstract. Networks are widely used to represent interaction pattern among the components in complex systems. Structures of real networks from different domains may vary quite significantly. As there is an interplay between network architecture and dynamics, structure plays an impor- tant role in communication and ...

  9. Immunization of networks with community structure

    Energy Technology Data Exchange (ETDEWEB)

    Masuda, Naoki [Graduate School of Information Science and Technology, University of Tokyo, 7-3-1 Hongo, Bunkyo, Tokyo 113-8656 (Japan); PRESTO, Japan Science and Technology Agency, 4-1-8 Honcho, Kawaguchi, Saitama 332-0012 (Japan)], E-mail: masuda@mist.i.u-tokyo.ac.jp

    2009-12-15

    In this study, an efficient method to immunize modular networks (i.e. networks with community structure) is proposed. The immunization of networks aims at fragmenting networks into small parts with a small number of removed nodes. Its applications include prevention of epidemic spreading, protection against intentional attacks on networks, and conservation of ecosystems. Although preferential immunization of hubs is efficient, good immunization strategies for modular networks have not been established. On the basis of an immunization strategy based on eigenvector centrality, we develop an analytical framework for immunizing modular networks. To this end, we quantify the contribution of each node to the connectivity in a coarse-grained network among modules. We verify the effectiveness of the proposed method by applying it to model and real networks with modular structure.

  10. Taxonomies of networks from community structure

    Science.gov (United States)

    Onnela, Jukka-Pekka; Fenn, Daniel J.; Reid, Stephen; Porter, Mason A.; Mucha, Peter J.; Fricker, Mark D.; Jones, Nick S.

    2012-09-01

    The study of networks has become a substantial interdisciplinary endeavor that encompasses myriad disciplines in the natural, social, and information sciences. Here we introduce a framework for constructing taxonomies of networks based on their structural similarities. These networks can arise from any of numerous sources: They can be empirical or synthetic, they can arise from multiple realizations of a single process (either empirical or synthetic), they can represent entirely different systems in different disciplines, etc. Because mesoscopic properties of networks are hypothesized to be important for network function, we base our comparisons on summaries of network community structures. Although we use a specific method for uncovering network communities, much of the introduced framework is independent of that choice. After introducing the framework, we apply it to construct a taxonomy for 746 networks and demonstrate that our approach usefully identifies similar networks. We also construct taxonomies within individual categories of networks, and we thereby expose nontrivial structure. For example, we create taxonomies for similarity networks constructed from both political voting data and financial data. We also construct network taxonomies to compare the social structures of 100 Facebook networks and the growth structures produced by different types of fungi.

  11. Distributed Structure-Searchable Toxicity Database Network

    Data.gov (United States)

    U.S. Environmental Protection Agency — The Distributed Structure-Searchable Toxicity (DSSTox) Database Network provides a public forum for search and publishing downloadable, structure-searchable,...

  12. True Nature of Supply Network Communication Structure

    Directory of Open Access Journals (Sweden)

    Lokhman Hakim bin Osman

    2016-04-01

    Full Text Available Globalization of world economy has altered the definition of organizational structure. Global supply chain can no longer be viewed as an arm-length structure. It has become more complex. The complexity demands deeper research and understanding. This research analyzed a structure of supply network in an attempt to elucidate the true structure of the supply network. Using the quantitative Social Network Analysis methodology, findings of this study indicated that, the structure of the supply network differs depending on the types of network relations. An important implication of these findings would be a more focus resource management upon network relationship development that is based on firms’ positions in the different network structure. This research also contributes to the various strategies of effective and efficient supply chain management.

  13. Network repair based on community structure

    Science.gov (United States)

    Wang, Tianyu; Zhang, Jun; Sun, Xiaoqian; Wandelt, Sebastian

    2017-06-01

    Real-world complex systems are often fragile under disruptions. Accordingly, research on network repair has been studied intensively. Recently proposed efficient strategies for network disruption, based on collective influence, call for more research on efficient network repair strategies. Existing strategies are often designed to repair networks with local information only. However, the absence of global information impedes the creation of efficient repairs. Motivated by this limitation, we propose a concept of community-level repair, which leverages the community structure of the network during the repair process. Moreover, we devise a general framework of network repair, with in total six instances. Evaluations on real-world and random networks show the effectiveness and efficiency of the community-level repair approaches, compared to local and random repairs. Our study contributes to a better understanding of repair processes, and reveals that exploitation of the community structure improves the repair process on a disrupted network significantly.

  14. Communication on the structure of biological networks

    Indian Academy of Sciences (India)

    Among all biological networks studied here, the undirected structure of neuronal networks not only possesses the small-world property but the same is also expressed remarkably to a higher degree compared to any randomly generated network which possesses the same degree sequence. A relatively high percentage of ...

  15. Network quotients: structural skeletons of complex systems.

    Science.gov (United States)

    Xiao, Yanghua; MacArthur, Ben D; Wang, Hui; Xiong, Momiao; Wang, Wei

    2008-10-01

    A defining feature of many large empirical networks is their intrinsic complexity. However, many networks also contain a large degree of structural repetition. An immediate question then arises: can we characterize essential network complexity while excluding structural redundancy? In this article we utilize inherent network symmetry to collapse all redundant information from a network, resulting in a coarse graining which we show to carry the essential structural information of the "parent" network. In the context of algebraic combinatorics, this coarse-graining is known as the "quotient." We systematically explore the theoretical properties of network quotients and summarize key statistics of a variety of "real-world" quotients with respect to those of their parent networks. In particular, we find that quotients can be substantially smaller than their parent networks yet typically preserve various key functional properties such as complexity (heterogeneity and hub vertices) and communication (diameter and mean geodesic distance), suggesting that quotients constitute the essential structural skeletons of their parent networks. We summarize with a discussion of potential uses of quotients in analysis of biological regulatory networks and ways in which using quotients can reduce the computational complexity of network algorithms.

  16. Controlling congestion on complex networks: fairness, efficiency and network structure.

    Science.gov (United States)

    Buzna, Ľuboš; Carvalho, Rui

    2017-08-22

    We consider two elementary (max-flow and uniform-flow) and two realistic (max-min fairness and proportional fairness) congestion control schemes, and analyse how the algorithms and network structure affect throughput, the fairness of flow allocation, and the location of bottleneck edges. The more realistic proportional fairness and max-min fairness algorithms have similar throughput, but path flow allocations are more unequal in scale-free than in random regular networks. Scale-free networks have lower throughput than their random regular counterparts in the uniform-flow algorithm, which is favoured in the complex networks literature. We show, however, that this relation is reversed on all other congestion control algorithms for a region of the parameter space given by the degree exponent γ and average degree 〈k〉. Moreover, the uniform-flow algorithm severely underestimates the network throughput of congested networks, and a rich phenomenology of path flow allocations is only present in the more realistic α-fair family of algorithms. Finally, we show that the number of paths passing through an edge characterises the location of a wide range of bottleneck edges in these algorithms. Such identification of bottlenecks could provide a bridge between the two fields of complex networks and congestion control.

  17. Airline network structure in competitive market

    Directory of Open Access Journals (Sweden)

    Babić Danica D.

    2014-01-01

    Full Text Available Airline's network is the key element of its business strategy and selected network structure will not have influence only on the airline's costs but could gain some advantage in revenues, too. Network designing implies that an airline has to make decisions about markets that it will serve and how to serve those markets. Network choice raises the following questions for an airline: a what markets to serve, b how to serve selected markets, c what level of service to offer, d what are the benefits/cost of the that decisions and e what is the influence of the competition. We analyzed the existing airline business models and corresponding network structure. The paper highlights the relationship between the network structures and the airline business strategies. Using a simple model we examine the relationship between the network structure and service quality in deregulated market.

  18. Network Structure, Collaborative Context, and Individual Creativity

    DEFF Research Database (Denmark)

    Stea, Diego; Soda, Giuseppe; Pedersen, Torben

    2016-01-01

    outcomes often assumes that different network structures embody specific individual behaviors. This paper challenges the widespread assumption that dense, heavily bonded network structures imply a collaborative attitude on the part of network actors. We propose that collaboration can also be contextual......Network research has yet to determine whether bonding ties or bridging ties are more beneficial for individual creativity, but the debate has mostly overlooked the organizational context in which such ties are formed. In particular, the causal chain connecting network structures and individual...... and exogenous to a network’s structural characteristics, such that it moderates the effects of both dense and brokered networks on individual creativity. Specifically, we argue that knowledge acquisition and, in turn, individual creativity are more likely when an individual’s network position has a good fit...

  19. Core-Periphery Structure in Networks

    OpenAIRE

    Rombach, M. Puck; Porter, Mason A.; Fowler, James H.; Mucha, Peter J

    2012-01-01

    Intermediate-scale (or `meso-scale') structures in networks have received considerable attention, as the algorithmic detection of such structures makes it possible to discover network features that are not apparent either at the local scale of nodes and edges or at the global scale of summary statistics. Numerous types of meso-scale structures can occur in networks, but investigations of such features have focused predominantly on the identification and study of community structure. In this p...

  20. PARALLEL ALGORITHM FOR BAYESIAN NETWORK STRUCTURE LEARNING

    Directory of Open Access Journals (Sweden)

    S. A. Arustamov

    2013-03-01

    Full Text Available The article deals with implementation of a scalable parallel algorithm for structure learning of Bayesian network. Comparative analysis of sequential and parallel algorithms is done.

  1. Learning Latent Structure in Complex Networks

    DEFF Research Database (Denmark)

    Mørup, Morten; Hansen, Lars Kai

    Latent structure in complex networks, e.g., in the form of community structure, can help understand network dynamics, identify heterogeneities in network properties, and predict ‘missing’ links. While most community detection algorithms are based on optimizing heuristic clustering objectives...... prediction performance of the learning based approaches and other widely used link prediction approaches in 14 networks ranging from medium size to large networks with more than a million nodes. While link prediction is typically well above chance for all networks, we find that the learning based mixed...... membership stochastic block model of Airoldi et al., performs well and often best in our experiments. The added complexity of the LD model improves link predictions for four of the 14 networks....

  2. STRUCTURE AND COOPTATION IN ORGANIZATION NETWORK

    Directory of Open Access Journals (Sweden)

    Valéria Riscarolli

    2007-10-01

    Full Text Available Business executive are rethinking business concept, based on horizontalization principles. As so, most organizational functions are outsourced, leading the enterprise to build business through a network of organizations. Here we study the case of Cia Hering’s network of organizations, a leader in knit apparel segment in Latin America (IEMI, 2004, looking at the network’s structure and levels of cooptation. A theoretical model was used using Quinn et al. (2001 “sun ray” network structure as basis to analyze the case study. Main results indicate higher degree of structural conformity, but incipient degree of coopetation in the network.

  3. Network structure and travel time perception.

    Science.gov (United States)

    Parthasarathi, Pavithra; Levinson, David; Hochmair, Hartwig

    2013-01-01

    The purpose of this research is to test the systematic variation in the perception of travel time among travelers and relate the variation to the underlying street network structure. Travel survey data from the Twin Cities metropolitan area (which includes the cities of Minneapolis and St. Paul) is used for the analysis. Travelers are classified into two groups based on the ratio of perceived and estimated commute travel time. The measures of network structure are estimated using the street network along the identified commute route. T-test comparisons are conducted to identify statistically significant differences in estimated network measures between the two traveler groups. The combined effect of these estimated network measures on travel time is then analyzed using regression models. The results from the t-test and regression analyses confirm the influence of the underlying network structure on the perception of travel time.

  4. Network Structure of Inter-Industry Flows

    NARCIS (Netherlands)

    McNerney, J.; Fath, B.D.; Silverberg, G.P.

    2015-01-01

    We study the structure of inter-industry relationships using networks of money flows between industries in 45 national economies. We find these networks vary around a typical structure characterized by a Weibull link weight distribution, exponential industry size distribution, and a common community

  5. Network Structure, Collaborative Context, and Individual Creativity

    DEFF Research Database (Denmark)

    Stea, Diego; Soda, Giuseppe; Pedersen, Torben

    2016-01-01

    and exogenous to a network’s structural characteristics, such that it moderates the effects of both dense and brokered networks on individual creativity. Specifically, we argue that knowledge acquisition and, in turn, individual creativity are more likely when an individual’s network position has a good fit...... with the network’s organizational context. Thus, actors in dense network structures acquire more knowledge and eventually become more creative in organizational contexts where collaboration is high. Conversely, brokers who arbitrage information across disconnected network contacts acquire more valuable knowledge...

  6. Optimized null model for protein structure networks.

    Science.gov (United States)

    Milenković, Tijana; Filippis, Ioannis; Lappe, Michael; Przulj, Natasa

    2009-06-26

    Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs) as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model for RIGs, by

  7. Optimized null model for protein structure networks.

    Directory of Open Access Journals (Sweden)

    Tijana Milenković

    Full Text Available Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model

  8. Information transfer in community structured multiplex networks

    CERN Document Server

    Solé-Ribalta, Albert; Gómez, Sergio; Arenas, Alex

    2015-01-01

    The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.). The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer ...

  9. Exploring the structural regularities in networks

    CERN Document Server

    Shen, Hua-Wei; Guo, Jia-Feng

    2011-01-01

    In this paper, we consider the problem of exploring structural regularities of networks by dividing the nodes of a network into groups such that the members of each group have similar patterns of connections to other groups. Specifically, we propose a general statistical model to describe network structure. In this model, group is viewed as hidden or unobserved quantity and it is learned by fitting the observed network data using the expectation-maximization algorithm. Compared with existing models, the most prominent strength of our model is the high flexibility. This strength enables it to possess the advantages of existing models and overcomes their shortcomings in a unified way. As a result, not only broad types of structure can be detected without prior knowledge of what type of intrinsic regularities exist in the network, but also the type of identified structure can be directly learned from data. Moreover, by differentiating outgoing edges from incoming edges, our model can detect several types of stru...

  10. Industrial entrepreneurial network: Structural and functional analysis

    Science.gov (United States)

    Medvedeva, M. A.; Davletbaev, R. H.; Berg, D. B.; Nazarova, J. J.; Parusheva, S. S.

    2016-12-01

    Structure and functioning of two model industrial entrepreneurial networks are investigated in the present paper. One of these networks is forming when implementing an integrated project and consists of eight agents, which interact with each other and external environment. The other one is obtained from the municipal economy and is based on the set of the 12 real business entities. Analysis of the networks is carried out on the basis of the matrix of mutual payments aggregated over the certain time period. The matrix is created by the methods of experimental economics. Social Network Analysis (SNA) methods and instruments were used in the present research. The set of basic structural characteristics was investigated: set of quantitative parameters such as density, diameter, clustering coefficient, different kinds of centrality, and etc. They were compared with the random Bernoulli graphs of the corresponding size and density. Discovered variations of random and entrepreneurial networks structure are explained by the peculiarities of agents functioning in production network. Separately, were identified the closed exchange circuits (cyclically closed contours of graph) forming an autopoietic (self-replicating) network pattern. The purpose of the functional analysis was to identify the contribution of the autopoietic network pattern in its gross product. It was found that the magnitude of this contribution is more than 20%. Such value allows using of the complementary currency in order to stimulate economic activity of network agents.

  11. Information transfer in community structured multiplex networks

    Science.gov (United States)

    Solé Ribalta, Albert; Granell, Clara; Gómez, Sergio; Arenas, Alex

    2015-08-01

    The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.). The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer networks with community structure. The final goal is to understand and quantify, if the existence of well-defined community structure at the level of individual layers, together with the multilayer structure of the whole network, enhances or deteriorates the diffusion of packets of information.

  12. Information transfer in community structured multiplex networks

    Directory of Open Access Journals (Sweden)

    Albert eSolé Ribalta

    2015-08-01

    Full Text Available The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.. The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer networks with community structure. The final goal is to understand and quantify, if the existence of well-defined community structure at the level of individual layers, together with the multilayer structure of the whole network, enhances or deteriorates the diffusion of packets of information.

  13. Network structure of inter-industry flows

    Science.gov (United States)

    McNerney, James; Fath, Brian D.; Silverberg, Gerald

    2013-12-01

    We study the structure of inter-industry relationships using networks of money flows between industries in 45 national economies. We find these networks vary around a typical structure characterized by a Weibull link weight distribution, exponential industry size distribution, and a common community structure. The community structure is hierarchical, with the top level of the hierarchy comprising five industry communities: food industries, chemical industries, manufacturing industries, service industries, and extraction industries.

  14. Network structure of inter-industry flows

    CERN Document Server

    McNerney, James; Silverberg, Gerald

    2012-01-01

    We study the structure of inter-industry relationships using networks of money flows between industries in 20 national economies. We find these networks vary around a typical structure characterized by a Weibull link weight distribution, exponential industry size distribution, and a common community structure. The community structure is hierarchical, with the top level of the hierarchy comprising five industry communities: food industries, chemical industries, manufacturing industries, service industries, and extraction industries.

  15. Network structure of inter-industry flows

    OpenAIRE

    McNerney, J.; Fath, B.D.; G. Silverberg

    2012-01-01

    We study the structure of inter-industry relationships using networks of money flows between industries in 20 national economies. We find these networks vary around a typical structure characterized by a Weibull link weight distribution, exponential industry size distribution, and a common community structure. The community structure is hierarchical, with the top level of the hierarchy comprising five industry communities: food industries, chemical industries, manufacturing industries, servic...

  16. Network Structure, Collaborative Context, and Individual Creativity

    DEFF Research Database (Denmark)

    Soda, Giuseppe; Stea, Diego; Pedersen, Torben

    2017-01-01

    attitude on the part of the embedded actors and propose that the level of collaboration in a network can be independent from that network’s structural characteristics, such that it moderates the effects of closed and brokering network positions on the acquisition of knowledge that supports creativity....... Individuals embedded in closed networks acquire more knowledge and become more creative when the level of collaboration in their network is high. Brokers who arbitrage information across disconnected contacts acquire more knowledge and become more creative when collaboration is low. An analysis of employee...

  17. The Deep Structure of Organizational Online Networking

    DEFF Research Database (Denmark)

    Trier, Matthias; Richter, Alexander

    2015-01-01

    While research on organizational online networking recently increased significantly, most studies adopt quantitative research designs with a focus on the consequences of social network configurations. Very limited attention is paid to comprehensive theoretical conceptions of the complex phenomenon...... of organizational online networking. We address this gap by adopting a theoretical framework of the deep structure of organizational online networking with a focus on their emerging meaning for the employees. We apply and assess the framework in a qualitative case study of a large-scale implementation...... of a corporate social network site (SNS) in a global organization. We reveal organizational online networking as a multi-dimensional phenomenon with multiplex relationships that are unbalanced, primarily consist of weak ties and are subject to temporal change. Further, we identify discourse drivers...

  18. Modelling the structure of complex networks

    DEFF Research Database (Denmark)

    Herlau, Tue

    networks has been independently studied as mathematical objects in their own right. As such, there has been both an increased demand for statistical methods for complex networks as well as a quickly growing mathematical literature on the subject. In this dissertation we explore aspects of modelling complex......A complex network is a systems in which a discrete set of units interact in a quantifiable manner. Representing systems as complex networks have become increasingly popular in a variety of scientific fields including biology, social sciences and economics. Parallel to this development complex....... The next chapters will treat some of the various symmetries, representer theorems and probabilistic structures often deployed in the modelling complex networks, the construction of sampling methods and various network models. The introductory chapters will serve to provide context for the included written...

  19. Fundamental structures of dynamic social networks

    DEFF Research Database (Denmark)

    Sekara, Vedran; Stopczynski, Arkadiusz; Jørgensen, Sune Lehmann

    2016-01-01

    , and the productivity of teams. Although there has been much progress on understanding complex networks over the past decade, little is known about the regularities governing the microdynamics of social networks. Here, we explore the dynamic social network of a densely-connected population of ∼1,000 individuals...... and their interactions in the network of real-world person-to-person proximity measured via Bluetooth, as well as their telecommunication networks, online social media contacts, geolocation, and demographic data. These high-resolution data allow us to observe social groups directly, rendering community detection...... a pattern of recurring meetings across weeks and months, each with varying degrees of regularity. Taken together, these findings provide a powerful simplification of the social network, where cores represent fundamental structures expressed with strong temporal and spatial regularity. Using this framework...

  20. THE COMMERCIAL BANK AS NETWORK STRUCTURE

    Directory of Open Access Journals (Sweden)

    D. O. Dyl

    2010-05-01

    Full Text Available The article examines the problems of the modern enterprise as a network structure that meets the increasing processes of globalization and the rise of postmodern trends. The definition of the term «a network of commercial bank» and the main characteristics of such a definition are given.

  1. Structural measures for multiplex networks.

    Science.gov (United States)

    Battiston, Federico; Nicosia, Vincenzo; Latora, Vito

    2014-03-01

    Many real-world complex systems consist of a set of elementary units connected by relationships of different kinds. All such systems are better described in terms of multiplex networks, where the links at each layer represent a different type of interaction between the same set of nodes rather than in terms of (single-layer) networks. In this paper we present a general framework to describe and study multiplex networks, whose links are either unweighted or weighted. In particular, we propose a series of measures to characterize the multiplexicity of the systems in terms of (i) basic node and link properties such as the node degree, and the edge overlap and reinforcement, (ii) local properties such as the clustering coefficient and the transitivity, and (iii) global properties related to the navigability of the multiplex across the different layers. The measures we introduce are validated on a genuinely multiplex data set of Indonesian terrorists, where information among 78 individuals are recorded with respect to mutual trust, common operations, exchanged communications, and business relationships.

  2. Nonparametric inference of network structure and dynamics

    Science.gov (United States)

    Peixoto, Tiago P.

    The network structure of complex systems determine their function and serve as evidence for the evolutionary mechanisms that lie behind them. Despite considerable effort in recent years, it remains an open challenge to formulate general descriptions of the large-scale structure of network systems, and how to reliably extract such information from data. Although many approaches have been proposed, few methods attempt to gauge the statistical significance of the uncovered structures, and hence the majority cannot reliably separate actual structure from stochastic fluctuations. Due to the sheer size and high-dimensionality of many networks, this represents a major limitation that prevents meaningful interpretations of the results obtained with such nonstatistical methods. In this talk, I will show how these issues can be tackled in a principled and efficient fashion by formulating appropriate generative models of network structure that can have their parameters inferred from data. By employing a Bayesian description of such models, the inference can be performed in a nonparametric fashion, that does not require any a priori knowledge or ad hoc assumptions about the data. I will show how this approach can be used to perform model comparison, and how hierarchical models yield the most appropriate trade-off between model complexity and quality of fit based on the statistical evidence present in the data. I will also show how this general approach can be elegantly extended to networks with edge attributes, that are embedded in latent spaces, and that change in time. The latter is obtained via a fully dynamic generative network model, based on arbitrary-order Markov chains, that can also be inferred in a nonparametric fashion. Throughout the talk I will illustrate the application of the methods with many empirical networks such as the internet at the autonomous systems level, the global airport network, the network of actors and films, social networks, citations among

  3. How structure determines correlations in neuronal networks.

    Directory of Open Access Journals (Sweden)

    Volker Pernice

    2011-05-01

    Full Text Available Networks are becoming a ubiquitous metaphor for the understanding of complex biological systems, spanning the range between molecular signalling pathways, neural networks in the brain, and interacting species in a food web. In many models, we face an intricate interplay between the topology of the network and the dynamics of the system, which is generally very hard to disentangle. A dynamical feature that has been subject of intense research in various fields are correlations between the noisy activity of nodes in a network. We consider a class of systems, where discrete signals are sent along the links of the network. Such systems are of particular relevance in neuroscience, because they provide models for networks of neurons that use action potentials for communication. We study correlations in dynamic networks with arbitrary topology, assuming linear pulse coupling. With our novel approach, we are able to understand in detail how specific structural motifs affect pairwise correlations. Based on a power series decomposition of the covariance matrix, we describe the conditions under which very indirect interactions will have a pronounced effect on correlations and population dynamics. In random networks, we find that indirect interactions may lead to a broad distribution of activation levels with low average but highly variable correlations. This phenomenon is even more pronounced in networks with distance dependent connectivity. In contrast, networks with highly connected hubs or patchy connections often exhibit strong average correlations. Our results are particularly relevant in view of new experimental techniques that enable the parallel recording of spiking activity from a large number of neurons, an appropriate interpretation of which is hampered by the currently limited understanding of structure-dynamics relations in complex networks.

  4. Structure and function of complex brain networks

    Science.gov (United States)

    Sporns, Olaf

    2013-01-01

    An increasing number of theoretical and empirical studies approach the function of the human brain from a network perspective. The analysis of brain networks is made feasible by the development of new imaging acquisition methods as well as new tools from graph theory and dynamical systems. This review surveys some of these methodological advances and summarizes recent findings on the architecture of structural and functional brain networks. Studies of the structural connectome reveal several modules or network communities that are interlinked by hub regions mediating communication processes between modules. Recent network analyses have shown that network hubs form a densely linked collective called a “rich club,” centrally positioned for attracting and dispersing signal traffic. In parallel, recordings of resting and task-evoked neural activity have revealed distinct resting-state networks that contribute to functions in distinct cognitive domains. Network methods are increasingly applied in a clinical context, and their promise for elucidating neural substrates of brain and mental disorders is discussed. PMID:24174898

  5. Tensegrity II. How structural networks influence cellular information processing networks

    Science.gov (United States)

    Ingber, Donald E.

    2003-01-01

    The major challenge in biology today is biocomplexity: the need to explain how cell and tissue behaviors emerge from collective interactions within complex molecular networks. Part I of this two-part article, described a mechanical model of cell structure based on tensegrity architecture that explains how the mechanical behavior of the cell emerges from physical interactions among the different molecular filament systems that form the cytoskeleton. Recent work shows that the cytoskeleton also orients much of the cell's metabolic and signal transduction machinery and that mechanical distortion of cells and the cytoskeleton through cell surface integrin receptors can profoundly affect cell behavior. In particular, gradual variations in this single physical control parameter (cell shape distortion) can switch cells between distinct gene programs (e.g. growth, differentiation and apoptosis), and this process can be viewed as a biological phase transition. Part II of this article covers how combined use of tensegrity and solid-state mechanochemistry by cells may mediate mechanotransduction and facilitate integration of chemical and physical signals that are responsible for control of cell behavior. In addition, it examines how cell structural networks affect gene and protein signaling networks to produce characteristic phenotypes and cell fate transitions during tissue development.

  6. Learning Bayesian Network Model Structure from Data

    National Research Council Canada - National Science Library

    Margaritis, Dimitris

    2003-01-01

    In this thesis I address the important problem of the determination of the structure of directed statistical models, with the widely used class of Bayesian network models as a concrete vehicle of my ideas...

  7. Identifying community structure in complex networks

    Science.gov (United States)

    Shao, Chenxi; Duan, Yubing

    2015-07-01

    A wide variety of applications could be formulated to resolve the problem of finding all communities from a given network, ranging from social and biological network analysis to web mining and searching. In this study, we propose the concept of virtual attractive strength between each pair of node in networks, and then give the definition of community structure based on the proposed attractive strength. Furthermore, we present a community detection method by moving vertices to the clusters that produce the largest attractive strengths to them until the division of network reaches unchanged. Experimental results on synthetic and real networks indicate that the proposed approach has favorite effectiveness and fast convergence speed, which provides an efficient method for exploring and analyzing complex systems.

  8. Analysis of Ego Network Structure in Online Social Networks

    OpenAIRE

    Arnaboldi, Valerio; Conti, Marco; Passarella, Andrea; Pezzoni, Fabio

    2012-01-01

    Results about offline social networks demonstrated that the social relationships that an individual (ego) maintains with other people (alters) can be organised into different groups according to the ego network model. In this model the ego can be seen as the centre of a series of layers of increasing size. Social relationships between ego and alters in layers close to ego are stronger than those belonging to more external layers. Online Social Networks are becoming a fundamental medium for hu...

  9. Community Structure in Online Collegiate Social Networks

    Science.gov (United States)

    Traud, Amanda; Kelsic, Eric; Mucha, Peter; Porter, Mason

    2009-03-01

    Online social networking sites have become increasingly popular with college students. The networks we studied are defined through ``friendships'' indicated by Facebook users from UNC, Oklahoma, Caltech, Georgetown, and Princeton. We apply the tools of network science to study the Facebook networks from these five different universities at a single point in time. We investigate each single-institution network's community structure, which we obtain through partitioning the graph using an eigenvector method. We use both graphical and quantitative tools, including pair-counting methods, which we interpret through statistical analysis and permutation tests to measure the correlations between the network communities and a set of characteristics given by each user (residence, class year, major, and high school). We also analyze the single gender subsets of these networks, and the impact of missing demographical data. Our study allows us to compare the online social networks for the five schools as well as infer differences in offline social interactions. At the schools studied, we were able to define which characteristics of the Facebook users correlate best with friendships.

  10. Neural Networks for protein Structure Prediction

    DEFF Research Database (Denmark)

    Bohr, Henrik

    1998-01-01

    This is a review about neural network applications in bioinformatics. Especially the applications to protein structure prediction, e.g. prediction of secondary structures, prediction of surface structure, fold class recognition and prediction of the 3-dimensional structure of protein backbones...

  11. An Evaluation Framework for Large-Scale Network Structures

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun

    2004-01-01

    An evaluation framework for large-scale network structures is presented, which facilitates evaluations and comparisons of different physical network structures. A number of quantitative and qualitative parameters are presented, and their importance to networks discussed. Choosing a network...... is closed by an example of how the framework can be used. The framework supports network planners in decision-making and researchers in evaluation and development of network structures....

  12. A Topological Perspective of Neural Network Structure

    Science.gov (United States)

    Sizemore, Ann; Giusti, Chad; Cieslak, Matthew; Grafton, Scott; Bassett, Danielle

    The wiring patterns of white matter tracts between brain regions inform functional capabilities of the neural network. Indeed, densely connected and cyclically arranged cognitive systems may communicate and thus perform distinctly. However, previously employed graph theoretical statistics are local in nature and thus insensitive to such global structure. Here we present an investigation of the structural neural network in eight healthy individuals using persistent homology. An extension of homology to weighted networks, persistent homology records both circuits and cliques (all-to-all connected subgraphs) through a repetitive thresholding process, thus perceiving structural motifs. We report structural features found across patients and discuss brain regions responsible for these patterns, finally considering the implications of such motifs in relation to cognitive function.

  13. How structure determines correlations in neuronal networks

    National Research Council Canada - National Science Library

    Pernice, Volker; Staude, Benjamin; Cardanobile, Stefano; Rotter, Stefan

    2011-01-01

    Networks are becoming a ubiquitous metaphor for the understanding of complex biological systems, spanning the range between molecular signalling pathways, neural networks in the brain, and interacting...

  14. Rumor propagation on networks with community structure

    Science.gov (United States)

    Zhang, Ruixia; Li, Deyu

    2017-10-01

    In this paper, based on growth and preferential attachment mechanism, we give a network generation model aiming at generating networks with community structure. There are three characteristics for the networks generated by the generation model. The first is that the community sizes can be nonuniform. The second is that there are bridge hubs in each community. The third is that the strength of community structure is adjustable. Next, we investigate rumor propagation behavior on the generated networks by performing Monte Carlo simulations to reveal the influence of bridge hubs, nonuniformity of community sizes and the strength of community structure on the dynamic behavior of the rumor propagation. We find that bridge hubs have outstanding performance in propagation speed and propagation size, and larger modularity can reduce rumor propagation. Furthermore, when the decay rate of rumor spreading β is large, the final density of the stiflers is larger if the rumor originates in larger community. Additionally, when on networks with different strengths of community structure, rumor propagation exhibits greater difference in the density of stiflers and in the peak prevalence if the decay rate β is larger.

  15. Structural systems identification of genetic regulatory networks.

    Science.gov (United States)

    Xiong, Hao; Choe, Yoonsuck

    2008-02-15

    Reverse engineering of genetic regulatory networks from experimental data is the first step toward the modeling of genetic networks. Linear state-space models, also known as linear dynamical models, have been applied to model genetic networks from gene expression time series data, but existing works have not taken into account available structural information. Without structural constraints, estimated models may contradict biological knowledge and estimation methods may over-fit. In this report, we extended expectation-maximization (EM) algorithms to incorporate prior network structure and to estimate genetic regulatory networks that can track and predict gene expression profiles. We applied our method to synthetic data and to SOS data and showed that our method significantly outperforms the regular EM without structural constraints. The Matlab code is available upon request and the SOS data can be downloaded from http://www.weizmann.ac.il/mcb/UriAlon/Papers/SOSData/, courtesy of Uri Alon. Zak's data is available from his website, http://www.che.udel.edu/systems/people/zak.

  16. Structural Connectivity Networks of Transgender People

    NARCIS (Netherlands)

    Hahn, Andreas; Kranz, Georg S; Küblböck, Martin; Kaufmann, Ulrike; Ganger, Sebastian; Hummer, Allan; Seiger, Rene; Spies, Marie; Winkler, Dietmar; Kasper, Siegfried; Windischberger, Christian; Swaab, Dick F; Lanzenberger, Rupert

    2015-01-01

    Although previous investigations of transsexual people have focused on regional brain alterations, evaluations on a network level, especially those structural in nature, are largely missing. Therefore, we investigated the structural connectome of 23 female-to-male (FtM) and 21 male-to-female (MtF)

  17. Improving the Robustness of Complex Networks with Preserving Community Structure

    Science.gov (United States)

    Yang, Yang; Li, Zhoujun; Chen, Yan; Zhang, Xiaoming; Wang, Senzhang

    2015-01-01

    Complex networks are everywhere, such as the power grid network, the airline network, the protein-protein interaction network, and the road network. The networks are ‘robust yet fragile’, which means that the networks are robust against random failures but fragile under malicious attacks. The cascading failures, system-wide disasters and intentional attacks on these networks are deserving of in-depth study. Researchers have proposed many solutions to improve the robustness of these networks. However whilst many solutions preserve the degree distribution of the networks, little attention is paid to the community structure of these networks. We argue that the community structure of a network is a defining characteristic of a network which identifies its functionality and thus should be preserved. In this paper, we discuss the relationship between robustness and the community structure. Then we propose a 3-step strategy to improve the robustness of a network, while retaining its community structure, and also its degree distribution. With extensive experimentation on representative real-world networks, we demonstrate that our method is effective and can greatly improve the robustness of networks, while preserving community structure and degree distribution. Finally, we give a description of a robust network, which is useful not only for improving robustness, but also for designing robust networks and integrating networks. PMID:25674786

  18. Information diffusion in structured online social networks

    Science.gov (United States)

    Li, Pei; Zhang, Yini; Qiao, Fengcai; Wang, Hui

    2015-05-01

    Nowadays, due to the word-of-mouth effect, online social networks have been considered to be efficient approaches to conduct viral marketing, which makes it of great importance to understand the diffusion dynamics in online social networks. However, most research on diffusion dynamics in epidemiology and existing social networks cannot be applied directly to characterize online social networks. In this paper, we propose models to characterize the information diffusion in structured online social networks with push-based forwarding mechanism. We introduce the term user influence to characterize the average number of times that messages are browsed which is incurred by a given type user generating a message, and study the diffusion threshold, above which the user influence of generating a message will approach infinity. We conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of use in understanding the diffusion dynamics in online social networks and also critical for advertisers in viral marketing who want to estimate the user influence before posting an advertisement.

  19. Robustness in Weighted Networks with Cluster Structure

    Directory of Open Access Journals (Sweden)

    Yi Zheng

    2014-01-01

    Full Text Available The vulnerability of complex systems induced by cascade failures revealed the comprehensive interaction of dynamics with network structure. The effect on cascade failures induced by cluster structure was investigated on three networks, small-world, scale-free, and module networks, of which the clustering coefficient is controllable by the random walk method. After analyzing the shifting process of load, we found that the betweenness centrality and the cluster structure play an important role in cascading model. Focusing on this point, properties of cascading failures were studied on model networks with adjustable clustering coefficient and fixed degree distribution. In the proposed weighting strategy, the path length of an edge is designed as the product of the clustering coefficient of its end nodes, and then the modified betweenness centrality of the edge is calculated and applied in cascade model as its weights. The optimal region of the weighting scheme and the size of the survival components were investigated by simulating the edge removing attack, under the rule of local redistribution based on edge weights. We found that the weighting scheme based on the modified betweenness centrality makes all three networks have better robustness against edge attack than the one based on the original betweenness centrality.

  20. Methods and applications for detecting structure in complex networks

    Science.gov (United States)

    Leicht, Elizabeth A.

    The use of networks to represent systems of interacting components is now common in many fields including the biological, physical, and social sciences. Network models are widely applicable due to their relatively simple framework of vertices and edges. Network structure, patterns of connection between vertices, impacts both the functioning of networks and processes occurring on networks. However, many aspects of network structure are still poorly understood. This dissertation presents a set of network analysis methods and applications to real-world as well as simulated networks. The methods are divided into two main types: linear algebra formulations and probabilistic mixture model techniques. Network models lend themselves to compact mathematical representation as matrices, making linear algebra techniques useful probes of network structure. We present methods for the detection of two distinct, but related, network structural forms. First, we derive a measure of vertex similarity based upon network structure. The method builds on existing ideas concerning calculation of vertex similarity, but generalizes and extends the scope to large networks. Second, we address the detection of communities or modules in a specific class of networks, directed networks. We propose a method for detecting community structure in directed networks, which is an extension of a community detection method previously only known for undirected networks. Moving away from linear algebra formulations, we propose two methods for network structure detection based on probabilistic techniques. In the first method, we use the machinery of the expectation-maximization (EM) algorithm to probe patterns of connection among vertices in static networks. The technique allows for the detection of a broad range of types of structure in networks. The second method focuses on time evolving networks. We propose an application of the EM algorithm to evolving networks that can reveal significant structural

  1. Phenology drives mutualistic network structure and diversity

    NARCIS (Netherlands)

    Encinas Viso, Francisco; Revilla, Tomas A; Etienne, Rampal S.

    Several network properties have been identified as determinants of the stability and complexity of mutualistic networks. However, it is unclear which mechanisms give rise to these network properties. Phenology seems important, because it shapes the topology of mutualistic networks, but its effects

  2. Distance metric learning for complex networks: Towards size-independent comparison of network structures

    Science.gov (United States)

    Aliakbary, Sadegh; Motallebi, Sadegh; Rashidian, Sina; Habibi, Jafar; Movaghar, Ali

    2015-02-01

    Real networks show nontrivial topological properties such as community structure and long-tail degree distribution. Moreover, many network analysis applications are based on topological comparison of complex networks. Classification and clustering of networks, model selection, and anomaly detection are just some applications of network comparison. In these applications, an effective similarity metric is needed which, given two complex networks of possibly different sizes, evaluates the amount of similarity between the structural features of the two networks. Traditional graph comparison approaches, such as isomorphism-based methods, are not only too time consuming but also inappropriate to compare networks with different sizes. In this paper, we propose an intelligent method based on the genetic algorithms for integrating, selecting, and weighting the network features in order to develop an effective similarity measure for complex networks. The proposed similarity metric outperforms state of the art methods with respect to different evaluation criteria.

  3. THE GOVERNANCE STRUCTURE OF COOPERATIVE NETWORKS

    National Research Council Canada - National Science Library

    Rosileia Milagres

    2014-01-01

    .... The analysis shows that the governance structure is influenced by the objectives established, the partners' experience, the types of knowledge and the context where network is inserted. The case highlights the importance of learning during the process, but, although present, it can be negatively influenced by the context and the possibility of future partnerships.

  4. Social Network Structures among Groundnut Farmers

    Science.gov (United States)

    Thuo, Mary; Bell, Alexandra A.; Bravo-Ureta, Boris E.; Okello, David K.; Okoko, Evelyn Nasambu; Kidula, Nelson L.; Deom, C. Michael; Puppala, Naveen

    2013-01-01

    Purpose: Groundnut farmers in East Africa have experienced declines in production despite research and extension efforts to increase productivity. This study examined how social network structures related to acquisition of information about new seed varieties and productivity among groundnut farmers in Uganda and Kenya.…

  5. Structural network efficiency predicts conversion to dementia

    NARCIS (Netherlands)

    Tuladhar, A.; van Uden, I.W.M.; Rutten-Jacobs, L.C.A.; van der Holst, H.; van Norden, A.; de Laat, K.; Dijk, E.; Claassen, J.A.H.R.; Kessels, R.P.C.; Markus, H.S.; Norris, David Gordon; de Leeuw, F.E.

    2016-01-01

    Objective: To examine whether structural network connectivity at baseline predicts incident all-cause dementia in a prospective hospital-based cohort of elderly participants with MRI evidence of small vessel disease (SVD). Methods: A total of 436 participants from the Radboud University Nijmegen

  6. Structures and Statistics of Citation Networks

    Science.gov (United States)

    2011-05-01

    assignment procedure ( QAP ) (14) and its regression counterpart MRQAP (15) have been used to detect structural significance and compare networks in...Correcting Codes. Hamming, R.W. 2, s.l. : Bell System Technical Journal, 1950, Vol. 29, pp. 147--160. 14. QAP Partialling as a Test of Spuriousness* 1

  7. Structural health monitoring using wireless sensor networks

    Science.gov (United States)

    Sreevallabhan, K.; Nikhil Chand, B.; Ramasamy, Sudha

    2017-11-01

    Monitoring and analysing health of large structures like bridges, dams, buildings and heavy machinery is important for safety, economical, operational, making prior protective measures, and repair and maintenance point of view. In recent years there is growing demand for such larger structures which in turn make people focus more on safety. By using Microelectromechanical Systems (MEMS) Accelerometer we can perform Structural Health Monitoring by studying the dynamic response through measure of ambient vibrations and strong motion of such structures. By using Wireless Sensor Networks (WSN) we can embed these sensors in wireless networks which helps us to transmit data wirelessly thus we can measure the data wirelessly at any remote location. This in turn reduces heavy wiring which is a cost effective as well as time consuming process to lay those wires. In this paper we developed WSN based MEMS-accelerometer for Structural to test the results in the railway bridge near VIT University, Vellore campus.

  8. Structural determinants of criticality in biological networks.

    Science.gov (United States)

    Valverde, Sergi; Ohse, Sebastian; Turalska, Malgorzata; West, Bruce J; Garcia-Ojalvo, Jordi

    2015-01-01

    Many adaptive evolutionary systems display spatial and temporal features, such as long-range correlations, typically associated with the critical point of a phase transition in statistical physics. Empirical and theoretical studies suggest that operating near criticality enhances the functionality of biological networks, such as brain and gene networks, in terms for instance of information processing, robustness, and evolvability. While previous studies have explained criticality with specific system features, we still lack a general theory of critical behavior in biological systems. Here we look at this problem from the complex systems perspective, since in principle all critical biological circuits have in common the fact that their internal organization can be described as a complex network. An important question is how self-similar structure influences self-similar dynamics. Modularity and heterogeneity, for instance, affect the location of critical points and can be used to tune the system toward criticality. We review and discuss recent studies on the criticality of neuronal and genetic networks, and discuss the implications of network theory when assessing the evolutionary features of criticality.

  9. Structural Determinants of Criticality in Biological Networks

    Directory of Open Access Journals (Sweden)

    Sergi eValverde

    2015-05-01

    Full Text Available Many adaptive evolutionary systems display spatial and temporal features, such as long-range correlations, typically associated with the critical point of a phase transition in statistical physics. Empirical and theoretical studies suggest that operating near criticality enhances the functionality of biological networks, such as brain and gene networks, in terms for instance of information processing, robustness and evolvability. While previous studies have explained criticality with specific system features, we still lack a general theory of critical behaviour in biological systems. Here we look at this problem from the complex systems perspective, since in principle all critical biological circuits have in common the fact that their internal organisation can be described as a complex network. An important question is how self-similar structure influences self-similar dynamics. Modularity and heterogeneity, for instance, affect the location of critical points and can be used to tune the system towards criticality. We review and discuss recent studies on the criticality of neuronal and genetic networks, and discuss the implications of network theory when assessing the evolutionary features of criticality.

  10. Community structure in the phonological network

    Directory of Open Access Journals (Sweden)

    Cynthia S. Q. Siew

    2013-08-01

    Full Text Available Community structure, which refers to the presence of densely connected groups within a larger network, is a common feature of several real-world networks from a variety of domains such as the human brain, social networks of hunter-gatherers and business organizations, and the World Wide Web (Porter et al., 2009. Using a community detection technique known as the Louvain optimization method, 17 communities were extracted from the giant component of the phonological network described in Vitevitch (2008. Additional analyses comparing the lexical and phonological characteristics of words in these communities against words in randomly generated communities revealed several novel discoveries. Larger communities tend to consist of short, frequent words of high degree and low age of acquisition ratings, and smaller communities tend to consist of longer, less frequent words of low degree and high age of acquisition ratings. Real communities also contained fewer different phonological segments compared to random communities, although the number of occurrences of phonological segments found in real communities was much higher than that of the same phonological segments in random communities. Interestingly, the observation that relatively few biphones occur very frequently and a large number of biphones occur rarely within communities mirrors the pattern of the overall frequency of words in a language (Zipf, 1935. The present findings have important implications for understanding the dynamics of activation spread among words in the phonological network that are relevant to lexical processing, as well as understanding the mechanisms that underlie language acquisition and the evolution of language.

  11. Structure and dynamics of core-periphery networks

    CERN Document Server

    Csermely, Peter; Wu, Ling-Yun; Uzzi, Brian

    2013-01-01

    Recent studies uncovered important core/periphery network structures characterizing complex sets of cooperative and competitive interactions between network nodes, be they proteins, cells, species or humans. Better characterization of the structure, dynamics and function of core/periphery networks is a key step of our understanding cellular functions, species adaptation, social and market changes. Here we summarize the current knowledge of the structure and dynamics of "traditional" core/periphery networks, rich-clubs, nested, bow-tie and onion networks. Comparing core/periphery structures with network modules, we discriminate between global and local cores. The core/periphery network organization lies in the middle of several extreme properties, such as random/condensed structures, clique/star configurations, network symmetry/asymmetry, network assortativity/disassortativity, as well as network hierarchy/anti-hierarchy. These properties of high complexity together with the large degeneracy of core pathways e...

  12. Network structure of multivariate time series

    Science.gov (United States)

    Lacasa, Lucas; Nicosia, Vincenzo; Latora, Vito

    2015-10-01

    Our understanding of a variety of phenomena in physics, biology and economics crucially depends on the analysis of multivariate time series. While a wide range tools and techniques for time series analysis already exist, the increasing availability of massive data structures calls for new approaches for multidimensional signal processing. We present here a non-parametric method to analyse multivariate time series, based on the mapping of a multidimensional time series into a multilayer network, which allows to extract information on a high dimensional dynamical system through the analysis of the structure of the associated multiplex network. The method is simple to implement, general, scalable, does not require ad hoc phase space partitioning, and is thus suitable for the analysis of large, heterogeneous and non-stationary time series. We show that simple structural descriptors of the associated multiplex networks allow to extract and quantify nontrivial properties of coupled chaotic maps, including the transition between different dynamical phases and the onset of various types of synchronization. As a concrete example we then study financial time series, showing that a multiplex network analysis can efficiently discriminate crises from periods of financial stability, where standard methods based on time-series symbolization often fail.

  13. The fundamental structures of dynamic social networks

    CERN Document Server

    Sekara, Vedran; Lehmann, Sune

    2015-01-01

    Networks provide a powerful mathematical framework for analyzing the structure and dynamics of complex systems (1-3). The study of group behavior has deep roots in the social science literature (4,5) and community detection is a central part of modern network science. Network communities have been found to be highly overlapping and organized in a hierarchical structure (6-9). Recent technological advances have provided a toolset for measuring the detailed social dynamics at scale (10,11). In spite of great progress, a quantitative description of the complex temporal behavior of social groups-with dynamics spanning from minute-by-minute changes to patterns expressed on the timescale of years-is still absent. Here we uncover a class of fundamental structures embedded within highly dynamic social networks. On the shortest time-scale, we find that social gatherings are fluid, with members coming and going, but organized via a stable core of individuals. We show that cores represent social contexts (9), with recur...

  14. Structure formation in active networks

    CERN Document Server

    Köhler, Simone; Bausch, Andreas R

    2011-01-01

    Structure formation and constant reorganization of the actin cytoskeleton are key requirements for the function of living cells. Here we show that a minimal reconstituted system consisting of actin filaments, crosslinking molecules and molecular-motor filaments exhibits a generic mechanism of structure formation, characterized by a broad distribution of cluster sizes. We demonstrate that the growth of the structures depends on the intricate balance between crosslinker-induced stabilization and simultaneous destabilization by molecular motors, a mechanism analogous to nucleation and growth in passive systems. We also show that the intricate interplay between force generation, coarsening and connectivity is responsible for the highly dynamic process of structure formation in this heterogeneous active gel, and that these competing mechanisms result in anomalous transport, reminiscent of intracellular dynamics.

  15. Structural Behavioral Study on the General Aviation Network Based on Complex Network

    Science.gov (United States)

    Zhang, Liang; Lu, Na

    2017-12-01

    The general aviation system is an open and dissipative system with complex structures and behavioral features. This paper has established the system model and network model for general aviation. We have analyzed integral attributes and individual attributes by applying the complex network theory and concluded that the general aviation network has influential enterprise factors and node relations. We have checked whether the network has small world effect, scale-free property and network centrality property which a complex network should have by applying degree distribution of functions and proved that the general aviation network system is a complex network. Therefore, we propose to achieve the evolution process of the general aviation industrial chain to collaborative innovation cluster of advanced-form industries by strengthening network multiplication effect, stimulating innovation performance and spanning the structural hole path.

  16. Influence of Choice of Null Network on Small-World Parameters of Structural Correlation Networks

    Science.gov (United States)

    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

  17. Structure and mechanics of aegagropilae fiber network.

    Science.gov (United States)

    Verhille, Gautier; Moulinet, Sébastien; Vandenberghe, Nicolas; Adda-Bedia, Mokhtar; Le Gal, Patrice

    2017-05-02

    Fiber networks encompass a wide range of natural and manmade materials. The threads or filaments from which they are formed span a wide range of length scales: from nanometers, as in biological tissues and bundles of carbon nanotubes, to millimeters, as in paper and insulation materials. The mechanical and thermal behavior of these complex structures depends on both the individual response of the constituent fibers and the density and degree of entanglement of the network. A question of paramount importance is how to control the formation of a given fiber network to optimize a desired function. The study of fiber clustering of natural flocs could be useful for improving fabrication processes, such as in the paper and textile industries. Here, we use the example of aegagropilae that are the remains of a seagrass (Posidonia oceanica) found on Mediterranean beaches. First, we characterize different aspects of their structure and mechanical response, and second, we draw conclusions on their formation process. We show that these natural aggregates are formed in open sea by random aggregation and compaction of fibers held together by friction forces. Although formed in a natural environment, thus under relatively unconstrained conditions, the geometrical and mechanical properties of the resulting fiber aggregates are quite robust. This study opens perspectives for manufacturing complex fiber network materials.

  18. Structure of the human chromosome interaction network.

    Directory of Open Access Journals (Sweden)

    Sergio Sarnataro

    Full Text Available New Hi-C technologies have revealed that chromosomes have a complex network of spatial contacts in the cell nucleus of higher organisms, whose organisation is only partially understood. Here, we investigate the structure of such a network in human GM12878 cells, to derive a large scale picture of nuclear architecture. We find that the intensity of intra-chromosomal interactions is power-law distributed. Inter-chromosomal interactions are two orders of magnitude weaker and exponentially distributed, yet they are not randomly arranged along the genomic sequence. Intra-chromosomal contacts broadly occur between epigenomically homologous regions, whereas inter-chromosomal contacts are especially associated with regions rich in highly expressed genes. Overall, genomic contacts in the nucleus appear to be structured as a network of networks where a set of strongly individual chromosomal units, as envisaged in the 'chromosomal territory' scenario derived from microscopy, interact with each other via on average weaker, yet far from random and functionally important interactions.

  19. Higher-order structure and epidemic dynamics in clustered networks.

    Science.gov (United States)

    Ritchie, Martin; Berthouze, Luc; House, Thomas; Kiss, Istvan Z

    2014-05-07

    Clustering is typically measured by the ratio of triangles to all triples regardless of whether open or closed. Generating clustered networks, and how clustering affects dynamics on networks, is reasonably well understood for certain classes of networks (Volz et al., 2011; Karrer and Newman, 2010), e.g. networks composed of lines and non-overlapping triangles. In this paper we show that it is possible to generate networks which, despite having the same degree distribution and equal clustering, exhibit different higher-order structure, specifically, overlapping triangles and other order-four (a closed network motif composed of four nodes) structures. To distinguish and quantify these additional structural features, we develop a new network metric capable of measuring order-four structure which, when used alongside traditional network metrics, allows us to more accurately describe a network׳s topology. Three network generation algorithms are considered: a modified configuration model and two rewiring algorithms. By generating homogeneous networks with equal clustering we study and quantify their structural differences, and using SIS (Susceptible-Infected-Susceptible) and SIR (Susceptible-Infected-Recovered) dynamics we investigate computationally how differences in higher-order structure impact on epidemic threshold, final epidemic or prevalence levels and time evolution of epidemics. Our results suggest that characterising and measuring higher-order network structure is needed to advance our understanding of the impact of network topology on dynamics unfolding on the networks. Copyright © 2014 The Authors. Published by Elsevier Ltd.. All rights reserved.

  20. Reverse Logistics Network Structures and Design

    NARCIS (Netherlands)

    M. Fleischmann (Moritz)

    2001-01-01

    textabstractLogistics network design is commonly recognized as a strategic supply chain issue of prime importance. The location of production facilities, storage concepts, and transportation strategies are major determinants of supply chain performance. This chapter considers logistics network

  1. A Robust Method for Inferring Network Structures.

    Science.gov (United States)

    Yang, Yang; Luo, Tingjin; Li, Zhoujun; Zhang, Xiaoming; Yu, Philip S

    2017-07-12

    Inferring the network structure from limited observable data is significant in molecular biology, communication and many other areas. It is challenging, primarily because the observable data are sparse, finite and noisy. The development of machine learning and network structure study provides a great chance to solve the problem. In this paper, we propose an iterative smoothing algorithm with structure sparsity (ISSS) method. The elastic penalty in the model is introduced for the sparse solution, identifying group features and avoiding over-fitting, and the total variation (TV) penalty in the model can effectively utilize the structure information to identify the neighborhood of the vertices. Due to the non-smoothness of the elastic and structural TV penalties, an efficient algorithm with the Nesterov's smoothing optimization technique is proposed to solve the non-smooth problem. The experimental results on both synthetic and real-world networks show that the proposed model is robust against insufficient data and high noise. In addition, we investigate many factors that play important roles in identifying the performance of ISSS.

  2. The structure of replicating kinetoplast DNA networks

    OpenAIRE

    1993-01-01

    Kinetoplast DNA (kDNA), the mitochondrial DNA of Crithidia fasciculata and related trypanosomatids, is a network containing approximately 5,000 covalently closed minicircles which are topologically interlocked. kDNA synthesis involves release of covalently closed minicircles from the network, and, after replication of the free minicircles, reattachment of the nicked or gapped progeny minicircles to the network periphery. We have investigated this process by electron microscopy of networks at ...

  3. Structural Antecedents of Corporate Network Evolution

    NARCIS (Netherlands)

    F.H. Wijen (Frank); N. Noorderhaven (Niels); W. Vanhaverbeke (Wim)

    2011-01-01

    textabstractAbstract: While most network studies adopt a static view, we argue that corporate social networks are subject to endogenous dynamics of cognitive path dependence and self-reinforcing power relations. Over time, these dynamics drive corporate networks to become increasingly focused (i.e.,

  4. A network of networks.

    Science.gov (United States)

    Iedema, Rick; Verma, Raj; Wutzke, Sonia; Lyons, Nigel; McCaughan, Brian

    2017-04-10

    Purpose To further our insight into the role of networks in health system reform, the purpose of this paper is to investigate how one agency, the NSW Agency for Clinical Innovation (ACI), and the multiple networks and enabling resources that it encompasses, govern, manage and extend the potential of networks for healthcare practice improvement. Design/methodology/approach This is a case study investigation which took place over ten months through the first author's participation in network activities and discussions with the agency's staff about their main objectives, challenges and achievements, and with selected services around the state of New South Wales to understand the agency's implementation and large system transformation activities. Findings The paper demonstrates that ACI accommodates multiple networks whose oversight structures, self-organisation and systems change approaches combined in dynamic ways, effectively yield a diversity of network governances. Further, ACI bears out a paradox of "centralised decentralisation", co-locating agents of innovation with networks of implementation and evaluation expertise. This arrangement strengthens and legitimates the role of the strategic hybrid - the healthcare professional in pursuit of change and improvement, and enhances their influence and impact on the wider system. Research limitations/implications While focussing the case study on one agency only, this study is unique as it highlights inter-network connections. Contributing to the literature on network governance, this paper identifies ACI as a "network of networks" through which resources, expectations and stakeholder dynamics are dynamically and flexibly mediated and enhanced. Practical implications The co-location of and dynamic interaction among clinical networks may create synergies among networks, nurture "strategic hybrids", and enhance the impact of network activities on health system reform. Social implications Network governance requires more

  5. Complex network perspective on structure and function of ...

    Indian Academy of Sciences (India)

    , uncovering complex network structure and function from these networks is becoming one of the most important topics in system biology. This work aims at studying the structure and function of Staphylococcus aureus (S. aureus) metabolic ...

  6. Information diversity in structure and dynamics of simulated neuronal networks.

    Science.gov (United States)

    Mäki-Marttunen, Tuomo; Aćimović, Jugoslava; Nykter, Matti; Kesseli, Juha; Ruohonen, Keijo; Yli-Harja, Olli; Linne, Marja-Leena

    2011-01-01

    Neuronal networks exhibit a wide diversity of structures, which contributes to the diversity of the dynamics therein. The presented work applies an information theoretic framework to simultaneously analyze structure and dynamics in neuronal networks. Information diversity within the structure and dynamics of a neuronal network is studied using the normalized compression distance. To describe the structure, a scheme for generating distance-dependent networks with identical in-degree distribution but variable strength of dependence on distance is presented. The resulting network structure classes possess differing path length and clustering coefficient distributions. In parallel, comparable realistic neuronal networks are generated with NETMORPH simulator and similar analysis is done on them. To describe the dynamics, network spike trains are simulated using different network structures and their bursting behaviors are analyzed. For the simulation of the network activity the Izhikevich model of spiking neurons is used together with the Tsodyks model of dynamical synapses. We show that the structure of the simulated neuronal networks affects the spontaneous bursting activity when measured with bursting frequency and a set of intraburst measures: the more locally connected networks produce more and longer bursts than the more random networks. The information diversity of the structure of a network is greatest in the most locally connected networks, smallest in random networks, and somewhere in between in the networks between order and disorder. As for the dynamics, the most locally connected networks and some of the in-between networks produce the most complex intraburst spike trains. The same result also holds for sparser of the two considered network densities in the case of full spike trains.

  7. Information Diversity in Structure and Dynamics of Simulated Neuronal Networks

    Directory of Open Access Journals (Sweden)

    Tuomo eMäki-Marttunen

    2011-06-01

    Full Text Available Neuronal networks exhibit a wide diversity of structures, which contributes to the diversity of the dynamics therein. The presented work applies an information theoretic framework to simultaneously analyze structure and dynamics in neuronal networks. Information diversity within the structure and dynamics of a neuronal network is studied using the normalized compression distance (NCD. To describe the structure, a scheme for generating distance-dependent networks with identical in-degree distribution but variable strength of dependence on distance is presented. The resulting network structure classes possess differing path length and clustering coefficient distributions. In parallel, comparable realistic neuronal networks are generated with NETMORPH simulator and similar analysis is done on them. To describe the dynamics, network spike trains are simulated using different network structures and their bursting behaviours are analyzed. For the simulation of the network activity the Izhikevich model of spiking neurons is used together with the Tsodyks model of dynamical synapses.We show that the structure of the simulated neuronal networks affects the spontaneous bursting activity when measured with bursting frequency and a set of intraburst measures: the more locally connected networks produce more and longer bursts than the more random networks. The information diversity of the structure of a network is greatest in the most locally connected networks, smallest in random networks, and somewhere in between in the networks between order and disorder. As for the dynamics, the most locally connected networks and some of the in-between networks produce the most complex intraburst spike trains. The same result also holds for sparser of the two considered network densities in the case of full spike trains.

  8. Community structure in introductory physics course networks

    CERN Document Server

    Traxler, Adrienne L

    2015-01-01

    Student-to-student interactions are foundational to many active learning environments, but are most often studied using qualitative methods. Network analysis tools provide a quantitative complement to this picture, allowing researchers to describe the social interactions of whole classrooms as systems. Past results from introductory physics courses have suggested a sharp division in the formation of social structure between large lecture sections and small studio classroom environments. Extending those results, this study focuses on calculus-based introductory physics courses at a large public university with a heavily commuter and nontraditional student population. Community detection network methods are used to characterize pre- and post-course collaborative structure in several sections, and differences are considered between small and large classes. These results are compared with expectations from earlier findings, and comment on implications for instruction and further study.

  9. Finding local community structure in networks

    Science.gov (United States)

    Clauset, Aaron

    2005-08-01

    Although the inference of global community structure in networks has recently become a topic of great interest in the physics community, all such algorithms require that the graph be completely known. Here, we define both a measure of local community structure and an algorithm that infers the hierarchy of communities that enclose a given vertex by exploring the graph one vertex at a time. This algorithm runs in time O(k2d) for general graphs when d is the mean degree and k is the number of vertices to be explored. For graphs where exploring a new vertex is time consuming, the running time is linear, O(k) . We show that on computer-generated graphs the average behavior of this technique approximates that of algorithms that require global knowledge. As an application, we use this algorithm to extract meaningful local clustering information in the large recommender network of an online retailer.

  10. Hierarchical Neural Network Structures for Phoneme Recognition

    CERN Document Server

    Vasquez, Daniel; Minker, Wolfgang

    2013-01-01

    In this book, hierarchical structures based on neural networks are investigated for automatic speech recognition. These structures are evaluated on the phoneme recognition task where a  Hybrid Hidden Markov Model/Artificial Neural Network paradigm is used. The baseline hierarchical scheme consists of two levels each which is based on a Multilayered Perceptron. Additionally, the output of the first level serves as a second level input. The computational speed of the phoneme recognizer can be substantially increased by removing redundant information still contained at the first level output. Several techniques based on temporal and phonetic criteria have been investigated to remove this redundant information. The computational time could be reduced by 57% whilst keeping the system accuracy comparable to the baseline hierarchical approach.

  11. Walk modularity and community structure in networks

    OpenAIRE

    Mehrle, David; Strosser, Amy; Harkin, Anthony

    2014-01-01

    Modularity maximization has been one of the most widely used approaches in the last decade for discovering community structure in networks of practical interest in biology, computing, social science, statistical mechanics, and more. Modularity is a quality function that measures the difference between the number of edges found within clusters minus the number of edges one would statistically expect to find based on random chance. We present a natural generalization of modularity based on the ...

  12. Structural factoring approach for analyzing stochastic networks

    Science.gov (United States)

    Hayhurst, Kelly J.; Shier, Douglas R.

    1991-01-01

    The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

  13. Community Structure in Time-Dependent, Multiscale, and Multiplex Networks

    OpenAIRE

    Mucha, Peter J; Richardson, Thomas; Macon, Kevin; Porter, Mason A.; Onnela, Jukka-Pekka

    2009-01-01

    Network science is an interdisciplinary endeavor, with methods and applications drawn from across the natural, social, and information sciences. A prominent problem in network science is the algorithmic detection of tightly-connected groups of nodes known as communities. We developed a generalized framework of network quality functions that allowed us to study the community structure of arbitrary multislice networks, which are combinations of individual networks coupled through links that con...

  14. Structural host-microbiota interaction networks.

    Science.gov (United States)

    Guven-Maiorov, Emine; Tsai, Chung-Jung; Nussinov, Ruth

    2017-10-01

    Hundreds of different species colonize multicellular organisms making them "metaorganisms". A growing body of data supports the role of microbiota in health and in disease. Grasping the principles of host-microbiota interactions (HMIs) at the molecular level is important since it may provide insights into the mechanisms of infections. The crosstalk between the host and the microbiota may help resolve puzzling questions such as how a microorganism can contribute to both health and disease. Integrated superorganism networks that consider host and microbiota as a whole-may uncover their code, clarifying perhaps the most fundamental question: how they modulate immune surveillance. Within this framework, structural HMI networks can uniquely identify potential microbial effectors that target distinct host nodes or interfere with endogenous host interactions, as well as how mutations on either host or microbial proteins affect the interaction. Furthermore, structural HMIs can help identify master host cell regulator nodes and modules whose tweaking by the microbes promote aberrant activity. Collectively, these data can delineate pathogenic mechanisms and thereby help maximize beneficial therapeutics. To date, challenges in experimental techniques limit large-scale characterization of HMIs. Here we highlight an area in its infancy which we believe will increasingly engage the computational community: predicting interactions across kingdoms, and mapping these on the host cellular networks to figure out how commensal and pathogenic microbiota modulate the host signaling and broadly cross-species consequences.

  15. Stable Matching with Incomplete Information in Structured Networks

    OpenAIRE

    Ling, Ying; Wan, Tao; Qin, Zengchang

    2015-01-01

    In this paper, we investigate stable matching in structured networks. Consider case of matching in social networks where candidates are not fully connected. A candidate on one side of the market gets acquaintance with which one on the heterogeneous side depends on the structured network. We explore four well-used structures of networks and define the social circle by the distance between each candidate. When matching within social circle, we have equilibrium distinguishes from each other sinc...

  16. Topological effects of network structure on long-term social network dynamics in a wild mammal.

    Science.gov (United States)

    Ilany, Amiyaal; Booms, Andrew S; Holekamp, Kay E

    2015-07-01

    Social structure influences ecological processes such as dispersal and invasion, and affects survival and reproductive success. Recent studies have used static snapshots of social networks, thus neglecting their temporal dynamics, and focused primarily on a limited number of variables that might be affecting social structure. Here, instead we modelled effects of multiple predictors of social network dynamics in the spotted hyena, using observational data collected during 20 years of continuous field research in Kenya. We tested the hypothesis that the current state of the social network affects its long-term dynamics. We employed stochastic agent-based models that allowed us to estimate the contribution of multiple factors to network changes. After controlling for environmental and individual effects, we found that network density and individual centrality affected network dynamics, but that social bond transitivity consistently had the strongest effects. Our results emphasise the significance of structural properties of networks in shaping social dynamics. © 2015 John Wiley & Sons Ltd/CNRS.

  17. Structure Learning in Power Distribution Networks

    Energy Technology Data Exchange (ETDEWEB)

    Deka, Deepjyoti [Univ. of Texas, Austin, TX (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Backhaus, Scott N. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-01-13

    Traditionally power distribution networks are either not observable or only partially observable. This complicates development and implementation of new smart grid technologies, such as these related to demand response, outage detection and management, and improved load-monitoring. Here, inspired by proliferation of the metering technology, we discuss statistical estimation problems in structurally loopy but operationally radial distribution grids consisting in learning operational layout of the network from measurements, e.g. voltage data, which are either already available or can be made available with a relatively minor investment. Our newly suggested algorithms apply to a wide range of realistic scenarios. The algorithms are also computationally efficient – polynomial in time – which is proven theoretically and illustrated computationally on a number of test cases. The technique developed can be applied to detect line failures in real time as well as to understand the scope of possible adversarial attacks on the grid.

  18. The complex channel networks of bone structure

    CERN Document Server

    Costa, Luciano da Fontoura; Beletti, Marcelo E

    2006-01-01

    Bone structure in mammals involves a complex network of channels (Havers and Volkmann channels) required to nourish the bone marrow cells. This work describes how three-dimensional reconstructions of such systems can be obtained and represented in terms of complex networks. Three important findings are reported: (i) the fact that the channel branching density resembles a power law implies the existence of distribution hubs; (ii) the conditional node degree density indicates a clear tendency of connection between nodes with degrees 2 and 4; and (iii) the application of the recently introduced concept of hierarchical clustering coefficient allows the identification of typical scales of channel redistribution. A series of important biological insights is drawn and discussed

  19. Network cosmology.

    Science.gov (United States)

    Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S; Rideout, David; Meyer, David; Boguñá, Marián

    2012-01-01

    Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology.

  20. Network Cosmology

    Science.gov (United States)

    Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S.; Rideout, David; Meyer, David; Boguñá, Marián

    2012-01-01

    Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology. PMID:23162688

  1. Towards structural controllability of local-world networks

    Energy Technology Data Exchange (ETDEWEB)

    Sun, Shiwen, E-mail: sunsw80@126.com [Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384 (China); Key Laboratory of Computer Vision and System (Tianjin University of Technology), Ministry of Education, Tianjin 300384 (China); Ma, Yilin; Wu, Yafang; Wang, Li; Xia, Chengyi [Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384 (China); Key Laboratory of Computer Vision and System (Tianjin University of Technology), Ministry of Education, Tianjin 300384 (China)

    2016-05-20

    Controlling complex networks is of vital importance in science and engineering. Meanwhile, local-world effect is an important ingredient which should be taken into consideration in the complete description of real-world complex systems. In this letter, structural controllability of a class of local-world networks is investigated. Through extensive numerical simulations, firstly, effects of local world size M and network size N on structural controllability are examined. For local-world networks with sparse topological configuration, compared to network size, local-world size can induce stronger influence on controllability, however, for dense networks, controllability is greatly affected by network size and local-world effect can be neglected. Secondly, relationships between controllability and topological properties are analyzed. Lastly, the robustness of local-world networks under targeted attacks regarding structural controllability is discussed. These results can help to deepen the understanding of structural complexity and connectivity patterns of complex systems. - Highlights: • Structural controllability of a class of local-world networks is investigated. • For sparse local-world networks, compared to network size, local-world size can bring stronger influence on controllability. • For dense networks, controllability is greatly affected by network size and the effect of local-world size can be neglected. • Structural controllability against targeted node attacks is discussed.

  2. Robustness and modular structure in networks

    DEFF Research Database (Denmark)

    Bagrow, James P.; Lehmann, Sune; Ahn, Yong-Yeol

    2015-01-01

    Complex networks have recently attracted much interest due to their prevalence in nature and our daily lives [1, 2]. A critical property of a network is its resilience to random breakdown and failure [3-6], typically studied as a percolation problem [7-9] or by modeling cascading failures[10....... If overlapping modular organization plays a role in overall functionality, networks may be far more vulnerable than predicted by conventional percolation theory....

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

    Directory of Open Access Journals (Sweden)

    Stavros I. Dimitriadis

    2017-12-01

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

  4. Social inheritance can explain the structure of animal social networks

    Science.gov (United States)

    Ilany, Amiyaal; Akçay, Erol

    2016-01-01

    The social network structure of animal populations has major implications for survival, reproductive success, sexual selection and pathogen transmission of individuals. But as of yet, no general theory of social network structure exists that can explain the diversity of social networks observed in nature, and serve as a null model for detecting species and population-specific factors. Here we propose a simple and generally applicable model of social network structure. We consider the emergence of network structure as a result of social inheritance, in which newborns are likely to bond with maternal contacts, and via forming bonds randomly. We compare model output with data from several species, showing that it can generate networks with properties such as those observed in real social systems. Our model demonstrates that important observed properties of social networks, including heritability of network position or assortative associations, can be understood as consequences of social inheritance. PMID:27352101

  5. Social inheritance can explain the structure of animal social networks.

    Science.gov (United States)

    Ilany, Amiyaal; Akçay, Erol

    2016-06-28

    The social network structure of animal populations has major implications for survival, reproductive success, sexual selection and pathogen transmission of individuals. But as of yet, no general theory of social network structure exists that can explain the diversity of social networks observed in nature, and serve as a null model for detecting species and population-specific factors. Here we propose a simple and generally applicable model of social network structure. We consider the emergence of network structure as a result of social inheritance, in which newborns are likely to bond with maternal contacts, and via forming bonds randomly. We compare model output with data from several species, showing that it can generate networks with properties such as those observed in real social systems. Our model demonstrates that important observed properties of social networks, including heritability of network position or assortative associations, can be understood as consequences of social inheritance.

  6. PROSPECTS OF REGIONAL NETWORK STRUCTURES IN THE SOUTHERN FEDERAL DISTRICT

    Directory of Open Access Journals (Sweden)

    I. V. Morozov

    2014-01-01

    Full Text Available The article reveals the possibility of the Southern Federal District to form regional network structures. The prospects for the formation of networks in the region in relation to the Olympic Winter Games Sochi 2014.

  7. Dynamics and control of diseases in networks with community structure.

    Directory of Open Access Journals (Sweden)

    Marcel Salathé

    2010-04-01

    Full Text Available The dynamics of infectious diseases spread via direct person-to-person transmission (such as influenza, smallpox, HIV/AIDS, etc. depends on the underlying host contact network. Human contact networks exhibit strong community structure. Understanding how such community structure affects epidemics may provide insights for preventing the spread of disease between communities by changing the structure of the contact network through pharmaceutical or non-pharmaceutical interventions. We use empirical and simulated networks to investigate the spread of disease in networks with community structure. We find that community structure has a major impact on disease dynamics, and we show that in networks with strong community structure, immunization interventions targeted at individuals bridging communities are more effective than those simply targeting highly connected individuals. Because the structure of relevant contact networks is generally not known, and vaccine supply is often limited, there is great need for efficient vaccination algorithms that do not require full knowledge of the network. We developed an algorithm that acts only on locally available network information and is able to quickly identify targets for successful immunization intervention. The algorithm generally outperforms existing algorithms when vaccine supply is limited, particularly in networks with strong community structure. Understanding the spread of infectious diseases and designing optimal control strategies is a major goal of public health. Social networks show marked patterns of community structure, and our results, based on empirical and simulated data, demonstrate that community structure strongly affects disease dynamics. These results have implications for the design of control strategies.

  8. A Decomposition Algorithm for Learning Bayesian Network Structures from Data

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Cordero Hernandez, Jorge

    2008-01-01

    It is a challenging task of learning a large Bayesian network from a small data set. Most conventional structural learning approaches run into the computational as well as the statistical problems. We propose a decomposition algorithm for the structure construction without having to learn...... the complete network. The new learning algorithm firstly finds local components from the data, and then recover the complete network by joining the learned components. We show the empirical performance of the decomposition algorithm in several benchmark networks....

  9. The network structure of human personality according to the NEO-PI-R: matching network community structure to factor structure.

    Directory of Open Access Journals (Sweden)

    Rutger Goekoop

    Full Text Available INTRODUCTION: Human personality is described preferentially in terms of factors (dimensions found using factor analysis. An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. AIM: To directly compare the ability of network community detection (NCD and principal component factor analysis (PCA to examine modularity in multidimensional datasets such as the neuroticism-extraversion-openness personality inventory revised (NEO-PI-R. METHODS: 434 healthy subjects were tested on the NEO-PI-R. PCA was performed to extract factor structures (FS of the current dataset using both item scores and facet scores. Correlational network graphs were constructed from univariate correlation matrices of interactions between both items and facets. These networks were pruned in a link-by-link fashion while calculating the network community structure (NCS of each resulting network using the Wakita Tsurumi clustering algorithm. NCSs were matched against FS and networks of best matches were kept for further analysis. RESULTS: At facet level, NCS showed a best match (96.2% with a 'confirmatory' 5-FS. At item level, NCS showed a best match (80% with the standard 5-FS and involved a total of 6 network clusters. Lesser matches were found with 'confirmatory' 5-FS and 'exploratory' 6-FS of the current dataset. Network analysis did not identify facets as a separate level of organization in between items and clusters. A small-world network structure was found in both item- and facet level networks. CONCLUSION: We present the first optimized network graph of personality traits according to the NEO-PI-R: a 'Personality Web'. Such a web may represent the possible routes that subjects can take during personality development. NCD outperforms PCA by producing plausible modularity at item level in non-standard datasets, and can identify the key roles of individual items and clusters in the network.

  10. The Network Structure of Human Personality According to the NEO-PI-R: Matching Network Community Structure to Factor Structure

    Science.gov (United States)

    Goekoop, Rutger; Goekoop, Jaap G.; Scholte, H. Steven

    2012-01-01

    Introduction Human personality is described preferentially in terms of factors (dimensions) found using factor analysis. An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. Aim To directly compare the ability of network community detection (NCD) and principal component factor analysis (PCA) to examine modularity in multidimensional datasets such as the neuroticism-extraversion-openness personality inventory revised (NEO-PI-R). Methods 434 healthy subjects were tested on the NEO-PI-R. PCA was performed to extract factor structures (FS) of the current dataset using both item scores and facet scores. Correlational network graphs were constructed from univariate correlation matrices of interactions between both items and facets. These networks were pruned in a link-by-link fashion while calculating the network community structure (NCS) of each resulting network using the Wakita Tsurumi clustering algorithm. NCSs were matched against FS and networks of best matches were kept for further analysis. Results At facet level, NCS showed a best match (96.2%) with a ‘confirmatory’ 5-FS. At item level, NCS showed a best match (80%) with the standard 5-FS and involved a total of 6 network clusters. Lesser matches were found with ‘confirmatory’ 5-FS and ‘exploratory’ 6-FS of the current dataset. Network analysis did not identify facets as a separate level of organization in between items and clusters. A small-world network structure was found in both item- and facet level networks. Conclusion We present the first optimized network graph of personality traits according to the NEO-PI-R: a ‘Personality Web’. Such a web may represent the possible routes that subjects can take during personality development. NCD outperforms PCA by producing plausible modularity at item level in non-standard datasets, and can identify the key roles of individual items and clusters in the network. PMID:23284713

  11. The network structure of human personality according to the NEO-PI-R: matching network community structure to factor structure.

    Science.gov (United States)

    Goekoop, Rutger; Goekoop, Jaap G; Scholte, H Steven

    2012-01-01

    Human personality is described preferentially in terms of factors (dimensions) found using factor analysis. An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. To directly compare the ability of network community detection (NCD) and principal component factor analysis (PCA) to examine modularity in multidimensional datasets such as the neuroticism-extraversion-openness personality inventory revised (NEO-PI-R). 434 healthy subjects were tested on the NEO-PI-R. PCA was performed to extract factor structures (FS) of the current dataset using both item scores and facet scores. Correlational network graphs were constructed from univariate correlation matrices of interactions between both items and facets. These networks were pruned in a link-by-link fashion while calculating the network community structure (NCS) of each resulting network using the Wakita Tsurumi clustering algorithm. NCSs were matched against FS and networks of best matches were kept for further analysis. At facet level, NCS showed a best match (96.2%) with a 'confirmatory' 5-FS. At item level, NCS showed a best match (80%) with the standard 5-FS and involved a total of 6 network clusters. Lesser matches were found with 'confirmatory' 5-FS and 'exploratory' 6-FS of the current dataset. Network analysis did not identify facets as a separate level of organization in between items and clusters. A small-world network structure was found in both item- and facet level networks. We present the first optimized network graph of personality traits according to the NEO-PI-R: a 'Personality Web'. Such a web may represent the possible routes that subjects can take during personality development. NCD outperforms PCA by producing plausible modularity at item level in non-standard datasets, and can identify the key roles of individual items and clusters in the network.

  12. Evolving networks-Using past structure to predict the future

    Science.gov (United States)

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

    2016-08-01

    Many previous studies on link prediction have focused on using common neighbors to predict the existence of links between pairs of nodes. More broadly, research into the structural properties of evolving temporal networks and temporal link prediction methods have recently attracted increasing attention. In this study, for the first time, we examine the use of links between a pair of nodes to predict their common neighbors and analyze the relationship between the weight and the structure in static networks, evolving networks, and in the corresponding randomized networks. We propose both new unweighted and weighted prediction methods and use six kinds of real networks to test our algorithms. In unweighted networks, we find that if a pair of nodes connect to each other in the current network, they will have a higher probability to connect common nodes both in the current and the future networks-and the probability will decrease with the increase of the number of neighbors. Furthermore, we find that the original networks have their particular structure and statistical characteristics which benefit link prediction. In weighted networks, the prediction algorithm performance of networks which are dominated by human factors decrease with the decrease of weight and are in general better in static networks. Furthermore, we find that geographical position and link weight both have significant influence on the transport network. Moreover, the evolving financial network has the lowest predictability. In addition, we find that the structure of non-social networks has more robustness than social networks. The structure of engineering networks has both best predictability and also robustness.

  13. Social Network Analysis of a Supply Network Structural Investigation of the South Korean Automotive Industry

    OpenAIRE

    Kim, Jin-Baek

    2015-01-01

    Part 3: Knowledge Based Production Management; International audience; In this paper, we analyzed the structure of the South Korean automotive industry using social network analysis (SNA) metrics. Based on the data collected from 275 companies, a social network model of the supply network was constructed. Centrality measures in the SNA field were used to interpret the result and identify key companies. The results show that SNA metrics can be useful to understand the structure of a supply net...

  14. Learning and structure of neuronal networks

    Indian Academy of Sciences (India)

    We study the effect of learning dynamics on network topology. Firstly, a network of discrete dynamical systems is considered for this purpose and the coupling strengths are made to evolve according to a temporal learning rule that is based on the paradigm of spike-time-dependent plasticity (STDP). This incorporates ...

  15. Learning and structure of neuronal networks

    Indian Academy of Sciences (India)

    Corresponding author. E-mail: Kiran.Kolwankar@gmail.com. Abstract. We study the effect of learning dynamics on network topology. Firstly, a network of dis- crete dynamical systems is considered for this purpose and the coupling strengths are made to evolve according to a temporal learning rule that is based on the ...

  16. Wireless Sensor Networks : Structure and Algorithms

    NARCIS (Netherlands)

    van Dijk, T.C.|info:eu-repo/dai/nl/304841293

    2014-01-01

    In this thesis we look at various problems in wireless networking. First we consider two problems in physical-model networks. We introduce a new model for localisation. The model is based on a range-free model of radio transmissions. The first scheme is randomised and we analyse its expected

  17. Spatial Structure and Scaling of Agricultural Networks

    CERN Document Server

    Sousa, Daniel

    2016-01-01

    Considering agricultural landscapes as networks can provide information about spatial connectivity relevant for a wide range of applications including pollination, pest management, and ecology. Global agricultural networks are well-described by power law rank-size distributions. However, regional analyses capture only a subset of the total global network. Most analyses are regional. In this paper, we seek to address the following questions: Does the globally observed scale-free property of agricultural networks hold over smaller spatial domains? Can similar properties be observed at kilometer to meter scales? We analyze 9 intensively cultivated Landsat scenes on 5 continents with a wide range of vegetation distributions. We find that networks of vegetation fraction within the domain of each of these Landsat scenes exhibit substantial variability - but still possess similar scaling properties to the global distribution of agriculture. We also find similar results using a 39 km2 IKONOS image. To illustrate an a...

  18. Health and the Structure of Adolescent Social Networks

    Science.gov (United States)

    Haas, Steven A.; Schaefer, David R.; Kornienko, Olga

    2010-01-01

    Much research has explored the role of social networks in promoting health through the provision of social support. However, little work has examined how social networks themselves may be structured by health. This article investigates the link between individuals' health and the characteristics of their social network positions.We first develop…

  19. Stable and emergent network topologies : A structural approach

    NARCIS (Netherlands)

    Herman Monsuur

    2007-01-01

    Economic, social and military networks have at least one thing in common: they change over time. For various reasons, nodes form and terminate links, thereby rearranging the network. In this paper, we present a structural network mechanism that formalizes a possible incentive that guides nodes in

  20. Network nestedness as generalized core-periphery structures

    CERN Document Server

    Lee, Sang Hoon

    2016-01-01

    The concept of nestedness, in particular for ecological and economical networks, has been introduced as a structural characteristic of real interacting systems. We suggest that the nestedness is in fact another way to express a mesoscale network property called the core-periphery structure. With real ecological mutualistic networks and synthetic model networks, we reveal the strong correlation between the nestedness and core-peripheriness, by defining the network-level measures for nestedness and core-peripheriness in case of weighted and bipartite networks. However, at the same time, via more sophisticated null-model analysis, we also discover that the degree (the number of connected neighbors of a node) distribution poses quite severe restrictions on the possible nestedness and core-peripheriness parameter space. Therefore, there must exist structurally interwoven properties in more fundamental levels of network formation, behind this seemingly obvious relation between nestedness and core-periphery structur...

  1. Network-level structural covariance in the developing brain.

    Science.gov (United States)

    Zielinski, Brandon A; Gennatas, Efstathios D; Zhou, Juan; Seeley, William W

    2010-10-19

    Intrinsic or resting state functional connectivity MRI and structural covariance MRI have begun to reveal the adult human brain's multiple network architectures. How and when these networks emerge during development remains unclear, but understanding ontogeny could shed light on network function and dysfunction. In this study, we applied structural covariance MRI techniques to 300 children in four age categories (early childhood, 5-8 y; late childhood, 8.5-11 y; early adolescence, 12-14 y; late adolescence, 16-18 y) to characterize gray matter structural relationships between cortical nodes that make up large-scale functional networks. Network nodes identified from eight widely replicated functional intrinsic connectivity networks served as seed regions to map whole-brain structural covariance patterns in each age group. In general, structural covariance in the youngest age group was limited to seed and contralateral homologous regions. Networks derived using primary sensory and motor cortex seeds were already well-developed in early childhood but expanded in early adolescence before pruning to a more restricted topology resembling adult intrinsic connectivity network patterns. In contrast, language, social-emotional, and other cognitive networks were relatively undeveloped in younger age groups and showed increasingly distributed topology in older children. The so-called default-mode network provided a notable exception, following a developmental trajectory more similar to the primary sensorimotor systems. Relationships between functional maturation and structural covariance networks topology warrant future exploration.

  2. Fundamental structures of dynamic social networks

    DEFF Research Database (Denmark)

    Sekara, Vedran; Stopczynski, Arkadiusz; Jørgensen, Sune Lehmann

    2016-01-01

    unnecessary. Starting from 5-min time slices, we uncover dynamic social structures expressed on multiple timescales. On the hourly timescale, we find that gatherings are fluid, with members coming and going, but organized via a stable core of individuals. Each core represents a social context. Cores exhibit...... a pattern of recurring meetings across weeks and months, each with varying degrees of regularity. Taken together, these findings provide a powerful simplification of the social network, where cores represent fundamental structures expressed with strong temporal and spatial regularity. Using this framework......Social systems are in a constant state of flux, with dynamics spanning from minute-by-minute changes to patterns present on the timescale of years. Accurate models of social dynamics are important for understanding the spreading of influence or diseases, formation of friendships...

  3. Improving link prediction in complex networks by adaptively exploiting multiple structural features of networks

    Science.gov (United States)

    Ma, Chuang; Bao, Zhong-Kui; Zhang, Hai-Feng

    2017-10-01

    So far, many network-structure-based link prediction methods have been proposed. However, these methods only highlight one or two structural features of networks, and then use the methods to predict missing links in different networks. The performances of these existing methods are not always satisfied in all cases since each network has its unique underlying structural features. In this paper, by analyzing different real networks, we find that the structural features of different networks are remarkably different. In particular, even in the same network, their inner structural features are utterly different. Therefore, more structural features should be considered. However, owing to the remarkably different structural features, the contributions of different features are hard to be given in advance. Inspired by these facts, an adaptive fusion model regarding link prediction is proposed to incorporate multiple structural features. In the model, a logistic function combing multiple structural features is defined, then the weight of each feature in the logistic function is adaptively determined by exploiting the known structure information. Last, we use the "learnt" logistic function to predict the connection probabilities of missing links. According to our experimental results, we find that the performance of our adaptive fusion model is better than many similarity indices.

  4. Exploring network structure, dynamics, and function using networkx

    Energy Technology Data Exchange (ETDEWEB)

    Hagberg, Aric [Los Alamos National Laboratory; Swart, Pieter [Los Alamos National Laboratory; S Chult, Daniel [COLGATE UNIV

    2008-01-01

    NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.

  5. Identification of Non-Linear Structures using Recurrent Neural Networks

    DEFF Research Database (Denmark)

    Kirkegaard, Poul Henning; Nielsen, Søren R. K.; Hansen, H. I.

    1995-01-01

    Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure.......Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure....

  6. Identification of Non-Linear Structures using Recurrent Neural Networks

    DEFF Research Database (Denmark)

    Kirkegaard, Poul Henning; Nielsen, Søren R. K.; Hansen, H. I.

    Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure.......Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure....

  7. Epidemic spreading on complex networks with community structures

    CERN Document Server

    Stegehuis, Clara; van Leeuwaarden, Johan S H

    2016-01-01

    Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities and the vertex degrees. These models show that community structure is an important determinant of the behavior of percolation processes on networks, such as information diffusion or virus spreading: the community structure can both \\textit{enforce} as well as \\textit{inhibit} diffusion processes. Our models further show that it is the mesoscopic set of communities that matters. The exact internal structures of communities barely influence the behavior of percolation processes across networks. This insensitivity is likely due to the relative denseness of the communities.

  8. The National Biomedical Communications Network as a Developing Structure *

    Science.gov (United States)

    Davis, Ruth M.

    1971-01-01

    The National Biomedical Communications Network has evolved both from a set of conceptual recommendations over the last twelve years and an accumulation of needs manifesting themselves in the requests of members of the medical community. With a short history of three years this network and its developing structure have exhibited most of the stresses of technology interfacing with customer groups, and of a structure attempting to build itself upon many existing fragmentary unconnected segments of a potentially viable resourcesharing capability. In addition to addressing these topics, the paper treats a design appropriate to any network devoted to information transfer in a special interest user community. It discusses fundamentals of network design, highlighting that network structure most appropriate to a national information network. Examples are given of cost analyses of information services and certain conjectures are offered concerning the roles of national networks. PMID:5542912

  9. Random field Ising model and community structure in complex networks

    Science.gov (United States)

    Son, S.-W.; Jeong, H.; Noh, J. D.

    2006-04-01

    We propose a method to determine the community structure of a complex network. In this method the ground state problem of a ferromagnetic random field Ising model is considered on the network with the magnetic field Bs = +∞, Bt = -∞, and Bi≠s,t=0 for a node pair s and t. The ground state problem is equivalent to the so-called maximum flow problem, which can be solved exactly numerically with the help of a combinatorial optimization algorithm. The community structure is then identified from the ground state Ising spin domains for all pairs of s and t. Our method provides a criterion for the existence of the community structure, and is applicable equally well to unweighted and weighted networks. We demonstrate the performance of the method by applying it to the Barabási-Albert network, Zachary karate club network, the scientific collaboration network, and the stock price correlation network. (Ising, Potts, etc.)

  10. Measuring the robustness of network community structure using assortativity

    Science.gov (United States)

    Shizuka, Daizaburo; Farine, Damien R.

    2016-01-01

    The existence of discrete social clusters, or ‘communities’, is a common feature of social networks in human and nonhuman animals. The level of such community structure in networks is typically measured using an index of modularity, Q. While modularity quantifies the degree to which individuals associate within versus between social communities and provides a useful measure of structure in the social network, it assumes that the network has been well sampled. However, animal social network data is typically subject to sampling errors. In particular, the associations among individuals are often not sampled equally, and animal social network studies are often based on a relatively small set of observations. Here, we extend an existing framework for bootstrapping network metrics to provide a method for assessing the robustness of community assignment in social networks using a metric we call community assortativity (rcom). We use simulations to demonstrate that modularity can reliably detect the transition from random to structured associations in networks that differ in size and number of communities, while community assortativity accurately measures the level of confidence based on the detectability of associations. We then demonstrate the use of these metrics using three publicly available data sets of avian social networks. We suggest that by explicitly addressing the known limitations in sampling animal social network, this approach will facilitate more rigorous analyses of population-level structural patterns across social systems. PMID:26949266

  11. Optimizing and Understanding Network Structure for Diffusion

    OpenAIRE

    Zhang, Yao

    2017-01-01

    Given a population contact network and electronic medical records of patients, how to distribute vaccines to individuals to effectively control a flu epidemic? Similarly, given the Twitter following network and tweets, how to choose the best communities/groups to stop rumors from spreading? How to find the best accounts that bridge celebrities and ordinary users? These questions are related to diffusion (aka propagation) phenomena. Diffusion can be treated as a behavior of spreading contagion...

  12. Reverse Logistics Network Structures and Design

    OpenAIRE

    Fleischmann, Moritz

    2001-01-01

    textabstractLogistics network design is commonly recognized as a strategic supply chain issue of prime importance. The location of production facilities, storage concepts, and transportation strategies are major determinants of supply chain performance. This chapter considers logistics network design for the particular case of closed-loop supply chains. We highlight key issues that companies are facing when deciding upon the logistics implementation of a product recovery initiative. In partic...

  13. A mathematical model for networks with structures in the mesoscale

    OpenAIRE

    Criado, Regino; Flores, Julio; Gacia Del Amo, Alejandro Jose; Gómez, Jesus; Romance, Miguel

    2011-01-01

    Abstract The new concept of multilevel network is introduced in order to embody some topological properties of complex systems with structures in the mesoscale which are not completely captured by the classical models. This new model, which generalizes the hyper-network and hyper-structure models, fits perfectly with several real-life complex systems, including social and public transportation networks. We present an analysis of the structural properties of the mu...

  14. Combining neural networks for protein secondary structure prediction

    DEFF Research Database (Denmark)

    Riis, Søren Kamaric

    1995-01-01

    In this paper structured neural networks are applied to the problem of predicting the secondary structure of proteins. A hierarchical approach is used where specialized neural networks are designed for each structural class and then combined using another neural network. The submodels are designed...... by using a priori knowledge of the mapping between protein building blocks and the secondary structure and by using weight sharing. Since none of the individual networks have more than 600 adjustable weights over-fitting is avoided. When ensembles of specialized experts are combined the performance...

  15. Structural equation models from paths to networks

    CERN Document Server

    Westland, J Christopher

    2015-01-01

    This compact reference surveys the full range of available structural equation modeling (SEM) methodologies.  It reviews applications in a broad range of disciplines, particularly in the social sciences where many key concepts are not directly observable.  This is the first book to present SEM’s development in its proper historical context–essential to understanding the application, strengths and weaknesses of each particular method.  This book also surveys the emerging path and network approaches that complement and enhance SEM, and that will grow in importance in the near future.  SEM’s ability to accommodate unobservable theory constructs through latent variables is of significant importance to social scientists.  Latent variable theory and application are comprehensively explained, and methods are presented for extending their power, including guidelines for data preparation, sample size calculation, and the special treatment of Likert scale data.  Tables of software, methodologies and fit st...

  16. The relevance of network micro-structure for neural dynamics

    Directory of Open Access Journals (Sweden)

    Volker ePernice

    2013-06-01

    Full Text Available The activity of cortical neurons is determined by the input they receive from presynaptic neurons. Many previousstudies have investigated how specific aspects of the statistics of the input affect the spike trains of single neurons and neuronsin recurrent networks. However, typically very simple random network models are considered in such studies. Here weuse a recently developed algorithm to construct networks based on a quasi-fractal probability measure which are much morevariable than commonly used network models, and which therefore promise to sample the space of recurrent networks ina more exhaustive fashion than previously possible. We use the generated graphs as the underlying network topology insimulations of networks of integrate-and-fire neurons in an asynchronous and irregular state. Based on an extensive datasetof networks and neuronal simulations we assess statistical relations between features of the network structure and the spikingactivity. Our results highlight the strong influence that some details of the network structure have on the activity dynamics ofboth single neurons and populations, even if some global network parameters are kept fixed. We observe specific and consistentrelations between activity characteristics like spike-train irregularity or correlations and network properties, for example thedistributions of the numbers of in- and outgoing connections or clustering. Exploiting these relations, we demonstrate that itis possible to estimate structural characteristics of the network from activity data. We also assess higher order correlationsof spiking activity in the various networks considered here, and find that their occurrence strongly depends on the networkstructure. These results provide directions for further theoretical studies on recurrent networks, as well as new ways to interpretspike train recordings from neural circuits.

  17. Tensor Spectral Clustering for Partitioning Higher-order Network Structures.

    Science.gov (United States)

    Benson, Austin R; Gleich, David F; Leskovec, Jure

    2015-01-01

    Spectral graph theory-based methods represent an important class of tools for studying the structure of networks. Spectral methods are based on a first-order Markov chain derived from a random walk on the graph and thus they cannot take advantage of important higher-order network substructures such as triangles, cycles, and feed-forward loops. Here we propose a Tensor Spectral Clustering (TSC) algorithm that allows for modeling higher-order network structures in a graph partitioning framework. Our TSC algorithm allows the user to specify which higher-order network structures (cycles, feed-forward loops, etc.) should be preserved by the network clustering. Higher-order network structures of interest are represented using a tensor, which we then partition by developing a multilinear spectral method. Our framework can be applied to discovering layered flows in networks as well as graph anomaly detection, which we illustrate on synthetic networks. In directed networks, a higher-order structure of particular interest is the directed 3-cycle, which captures feedback loops in networks. We demonstrate that our TSC algorithm produces large partitions that cut fewer directed 3-cycles than standard spectral clustering algorithms.

  18. Topological properties of four networks in protein structures

    Science.gov (United States)

    Min, Seungsik; Kim, Kyungsik; Chang, Ki-Ho; Ha, Deok-Ho; Lee, Jun-Ho

    2017-11-01

    In this paper, we investigate the complex networks of interacting amino acids in protein structures. The cellular networks and their random controls are treated for the four threshold distances between atoms. The numerical simulation and analysis are relevant to the topological properties of the complex networks in the structural classification of proteins, and we mainly estimate the network's metrics from the resultant network. The cellular network is shown to exhibit a small-world feature regardless of their structural class. The protein structure presents the positive assortative coefficients, when the topological property is described as a tendency for connectivity of high-degree nodes. We particularly show that both the modularity and the small-wordness are significantly followed the increasing function against nodes.

  19. Comparing Community Structure to Characteristics in Online Collegiate Social Networks

    OpenAIRE

    Traud, Amanda L.; Kelsic, Eric D.; Mucha, Peter J; Porter, Mason A.

    2008-01-01

    We study the structure of social networks of students by examining the graphs of Facebook "friendships" at five American universities at a single point in time. We investigate each single-institution network's community structure and employ graphical and quantitative tools, including standardized pair-counting methods, to measure the correlations between the network communities and a set of self-identified user characteristics (residence, class year, major, and high school). We review the bas...

  20. Exploring community structure in biological networks with random graphs.

    Science.gov (United States)

    Sah, Pratha; Singh, Lisa O; Clauset, Aaron; Bansal, Shweta

    2014-06-25

    Community structure is ubiquitous in biological networks. There has been an increased interest in unraveling the community structure of biological systems as it may provide important insights into a system's functional components and the impact of local structures on dynamics at a global scale. Choosing an appropriate community detection algorithm to identify the community structure in an empirical network can be difficult, however, as the many algorithms available are based on a variety of cost functions and are difficult to validate. Even when community structure is identified in an empirical system, disentangling the effect of community structure from other network properties such as clustering coefficient and assortativity can be a challenge. Here, we develop a generative model to produce undirected, simple, connected graphs with a specified degrees and pattern of communities, while maintaining a graph structure that is as random as possible. Additionally, we demonstrate two important applications of our model: (a) to generate networks that can be used to benchmark existing and new algorithms for detecting communities in biological networks; and (b) to generate null models to serve as random controls when investigating the impact of complex network features beyond the byproduct of degree and modularity in empirical biological networks. Our model allows for the systematic study of the presence of community structure and its impact on network function and dynamics. This process is a crucial step in unraveling the functional consequences of the structural properties of biological systems and uncovering the mechanisms that drive these systems.

  1. Interconnected networks

    CERN Document Server

    2016-01-01

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

  2. Kinematic Structural Modelling in Bayesian Networks

    Science.gov (United States)

    Schaaf, Alexander; de la Varga, Miguel; Florian Wellmann, J.

    2017-04-01

    We commonly capture our knowledge about the spatial distribution of distinct geological lithologies in the form of 3-D geological models. Several methods exist to create these models, each with its own strengths and limitations. We present here an approach to combine the functionalities of two modeling approaches - implicit interpolation and kinematic modelling methods - into one framework, while explicitly considering parameter uncertainties and thus model uncertainty. In recent work, we proposed an approach to implement implicit modelling algorithms into Bayesian networks. This was done to address the issues of input data uncertainty and integration of geological information from varying sources in the form of geological likelihood functions. However, one general shortcoming of implicit methods is that they usually do not take any physical constraints into consideration, which can result in unrealistic model outcomes and artifacts. On the other hand, kinematic structural modelling intends to reconstruct the history of a geological system based on physically driven kinematic events. This type of modelling incorporates simplified, physical laws into the model, at the cost of a substantial increment of usable uncertain parameters. In the work presented here, we show an integration of these two different modelling methodologies, taking advantage of the strengths of both of them. First, we treat the two types of models separately, capturing the information contained in the kinematic models and their specific parameters in the form of likelihood functions, in order to use them in the implicit modelling scheme. We then go further and combine the two modelling approaches into one single Bayesian network. This enables the direct flow of information between the parameters of the kinematic modelling step and the implicit modelling step and links the exclusive input data and likelihoods of the two different modelling algorithms into one probabilistic inference framework. In

  3. Structure and properties of triolein-based polyurethane networks.

    Science.gov (United States)

    Zlatanić, Alisa; Petrović, Zoran S; Dusek, Karel

    2002-01-01

    Polyurethane networks based on vegetable oils have very heterogeneous composition, and it is difficult to find a close correlation between their structure and properties. To establish benchmark structure-properties relationships, we have prepared model polyurethane networks based on triolein and 4,4'-diphenylmethane diisocyanate (MDI). Cross-linking in the middle of fatty acid chains leaves significant parts of the triglyceride as dangling chains. To examine their effect on properties, we have synthesized another polyurethane network using triolein without dangling chains (removed by metathesis). The structure of polyols was studied in detail since it affects the structure of polyurethane networks. The network structure was analyzed from swelling and mechanical measurements and by applying network and rubber elasticity theories. The cross-linking density in both networks was found to be close to theoretical. The triolein-based model network displayed modulus (around 6 MPa), tensile strength (8.7 MPa), and elongation at break (136%), characteristic of hard rubbers. Glass transition temperatures of the networks from triolein and its metathesis analogue were 25 and 31.5 degrees C, respectively.

  4. Online Social Networks: Essays on Membership, Privacy, and Structure

    NARCIS (Netherlands)

    Hofstra, B.

    2017-01-01

    The structure of social networks is crucial for obtaining social support, for meaningful connections to unknown social groups, and to overcome prejudice. Yet, we know little about the structure of social networks beyond those contacts that stand closest to us. This lack of knowledge results from a

  5. Stochastic margin-based structure learning of Bayesian network classifiers.

    Science.gov (United States)

    Pernkopf, Franz; Wohlmayr, Michael

    2013-02-01

    The margin criterion for parameter learning in graphical models gained significant impact over the last years. We use the maximum margin score for discriminatively optimizing the structure of Bayesian network classifiers. Furthermore, greedy hill-climbing and simulated annealing search heuristics are applied to determine the classifier structures. In the experiments, we demonstrate the advantages of maximum margin optimized Bayesian network structures in terms of classification performance compared to traditionally used discriminative structure learning methods. Stochastic simulated annealing requires less score evaluations than greedy heuristics. Additionally, we compare generative and discriminative parameter learning on both generatively and discriminatively structured Bayesian network classifiers. Margin-optimized Bayesian network classifiers achieve similar classification performance as support vector machines. Moreover, missing feature values during classification can be handled by discriminatively optimized Bayesian network classifiers, a case where purely discriminative classifiers usually require mechanisms to complete unknown feature values in the data first.

  6. Structural Changes in Online Discussion Networks

    DEFF Research Database (Denmark)

    Yang, Yang; Medaglia, Rony

    2014-01-01

    Social networking platforms in China provide a hugely interesting and relevant source for understanding dynamics of online discussions in a unique socio-cultural and institutional environment. This paper investigates the evolution of patterns of similar-minded and different-minded interactions over...

  7. Structure of Retail Services in the Brazilian Hosting Network

    Directory of Open Access Journals (Sweden)

    Claudio Zancan

    2015-08-01

    Full Text Available this research has identified Brazilian hosting networks through infrastructure services indicators that it was sold to tourists in organizations that form these networks. The theory consulted the discussion of structural techniques present in Social Network Analysis. The study has three stages: documental research, creation of Tourism database and interviews. The results identified three networks with the highest expression in Brazil formed by hotels, lodges, and resorts. Different char-acteristics of infrastructure and services were observed between hosting networks. Future studies suggest a comparative analysis of structural indicators present in other segments of tourism services, as well as the existing international influ-ence on the development of the Brazilian hosting networks.

  8. Network versus portfolio structure in financial systems

    Science.gov (United States)

    Kobayashi, Teruyoshi

    2013-10-01

    The question of how to stabilize financial systems has attracted considerable attention since the global financial crisis of 2007-2009. Recently, Beale et al. [Proc. Natl. Acad. Sci. USA 108, 12647 (2011)] demonstrated that higher portfolio diversity among banks would reduce systemic risk by decreasing the risk of simultaneous defaults at the expense of a higher likelihood of individual defaults. In practice, however, a bank default has an externality in that it undermines other banks’ balance sheets. This paper explores how each of these different sources of risk, simultaneity risk and externality, contributes to systemic risk. The results show that the allocation of external assets that minimizes systemic risk varies with the topology of the financial network as long as asset returns have negative correlations. In the model, a well-known centrality measure, PageRank, reflects an appropriately defined “infectiveness” of a bank. An important result is that the most infective bank needs not always to be the safest bank. Under certain circumstances, the most infective node should act as a firewall to prevent large-scale collective defaults. The introduction of a counteractive portfolio structure will significantly reduce systemic risk.

  9. Wireless sensor networks for structural health monitoring

    CERN Document Server

    Cao, Jiannong

    2016-01-01

    This brief covers the emerging area of wireless sensor network (WSN)-based structural health monitoring (SHM) systems, and introduces the authors’ WSN-based platform called SenetSHM. It helps the reader differentiate specific requirements of SHM applications from other traditional WSN applications, and demonstrates how these requirements are addressed by using a series of systematic approaches. The brief serves as a practical guide, explaining both the state-of-the-art technologies in domain-specific applications of WSNs, as well as the methodologies used to address the specific requirements for a WSN application. In particular, the brief offers instruction for problem formulation and problem solving based on the authors’ own experiences implementing SenetSHM. Seven concise chapters cover the development of hardware and software design of SenetSHM, as well as in-field experiments conducted while testing the platform. The brief’s exploration of the SenetSHM platform is a valuable feature for civil engine...

  10. Resistance and Security Index of Networks: Structural Information Perspective of Network Security.

    Science.gov (United States)

    Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

    2016-06-03

    Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.

  11. Completely random measures for modelling block-structured sparse networks

    DEFF Research Database (Denmark)

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

    2016-01-01

    Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical studies of networks indicate that many real-world networks...... [2014] proposed the use of a different notion of exchangeability due to Kallenberg [2006] and obtained a network model which admits power-law behaviour while retaining desirable statistical properties, however this model does not capture latent vertex traits such as block-structure. In this work we re......-introduce the use of block-structure for network models obeying allenberg’s notion of exchangeability and thereby obtain a model which admits the inference of block-structure and edge inhomogeneity. We derive a simple expression for the likelihood and an efficient sampling method. The obtained model...

  12. SAGA: a hybrid search algorithm for Bayesian Network structure learning of transcriptional regulatory networks.

    Science.gov (United States)

    Adabor, Emmanuel S; Acquaah-Mensah, George K; Oduro, Francis T

    2015-02-01

    Bayesian Networks have been used for the inference of transcriptional regulatory relationships among genes, and are valuable for obtaining biological insights. However, finding optimal Bayesian Network (BN) is NP-hard. Thus, heuristic approaches have sought to effectively solve this problem. In this work, we develop a hybrid search method combining Simulated Annealing with a Greedy Algorithm (SAGA). SAGA explores most of the search space by undergoing a two-phase search: first with a Simulated Annealing search and then with a Greedy search. Three sets of background-corrected and normalized microarray datasets were used to test the algorithm. BN structure learning was also conducted using the datasets, and other established search methods as implemented in BANJO (Bayesian Network Inference with Java Objects). The Bayesian Dirichlet Equivalence (BDe) metric was used to score the networks produced with SAGA. SAGA predicted transcriptional regulatory relationships among genes in networks that evaluated to higher BDe scores with high sensitivities and specificities. Thus, the proposed method competes well with existing search algorithms for Bayesian Network structure learning of transcriptional regulatory networks. Copyright © 2014 Elsevier Inc. All rights reserved.

  13. Leveraging Structure to Improve Classification Performance in Sparsely Labeled Networks

    Energy Technology Data Exchange (ETDEWEB)

    Gallagher, B; Eliassi-Rad, T

    2007-10-22

    We address the problem of classification in a partially labeled network (a.k.a. within-network classification), with an emphasis on tasks in which we have very few labeled instances to start with. Recent work has demonstrated the utility of collective classification (i.e., simultaneous inferences over class labels of related instances) in this general problem setting. However, the performance of collective classification algorithms can be adversely affected by the sparseness of labels in real-world networks. We show that on several real-world data sets, collective classification appears to offer little advantage in general and hurts performance in the worst cases. In this paper, we explore a complimentary approach to within-network classification that takes advantage of network structure. Our approach is motivated by the observation that real-world networks often provide a great deal more structural information than attribute information (e.g., class labels). Through experiments on supervised and semi-supervised classifiers of network data, we demonstrate that a small number of structural features can lead to consistent and sometimes dramatic improvements in classification performance. We also examine the relative utility of individual structural features and show that, in many cases, it is a combination of both local and global network structure that is most informative.

  14. Supervised neural networks for the classification of structures.

    Science.gov (United States)

    Sperduti, A; Starita, A

    1997-01-01

    Standard neural networks and statistical methods are usually believed to be inadequate when dealing with complex structures because of their feature-based approach. In fact, feature-based approaches usually fail to give satisfactory solutions because of the sensitivity of the approach to the a priori selection of the features, and the incapacity to represent any specific information on the relationships among the components of the structures. However, we show that neural networks can, in fact, represent and classify structured patterns. The key idea underpinning our approach is the use of the so called "generalized recursive neuron", which is essentially a generalization to structures of a recurrent neuron. By using generalized recursive neurons, all the supervised networks developed for the classification of sequences, such as backpropagation through time networks, real-time recurrent networks, simple recurrent networks, recurrent cascade correlation networks, and neural trees can, on the whole, be generalized to structures. The results obtained by some of the above networks (with generalized recursive neurons) on the classification of logic terms are presented.

  15. Network structure impacts global commodity trade growth and resilience

    Science.gov (United States)

    Rovenskaya, Elena; Fath, Brian D.

    2017-01-01

    Global commodity trade networks are critical to our collective sustainable development. Their increasing interconnectedness pose two practical questions: (i) Do the current network configurations support their further growth? (ii) How resilient are these networks to economic shocks? We analyze the data of global commodity trade flows from 1996 to 2012 to evaluate the relationship between structural properties of the global commodity trade networks and (a) their dynamic growth, as well as (b) the resilience of their growth with respect to the 2009 global economic shock. Specifically, we explore the role of network efficiency and redundancy using the information theory-based network flow analysis. We find that, while network efficiency is positively correlated with growth, highly efficient systems appear to be less resilient, losing more and gaining less growth following an economic shock. While all examined networks are rather redundant, we find that network redundancy does not hinder their growth. Moreover, systems exhibiting higher levels of redundancy lose less and gain more growth following an economic shock. We suggest that a strategy to support making global trade networks more efficient via, e.g., preferential trade agreements and higher specialization, can promote their further growth; while a strategy to increase the global trade networks’ redundancy via e.g., more abundant free-trade agreements, can improve their resilience to global economic shocks. PMID:28207790

  16. Network Ambivalence

    Directory of Open Access Journals (Sweden)

    Patrick Jagoda

    2015-08-01

    Full Text Available The language of networks now describes everything from the Internet to the economy to terrorist organizations. In distinction to a common view of networks as a universal, originary, or necessary form that promises to explain everything from neural structures to online traffic, this essay emphasizes the contingency of the network imaginary. Network form, in its role as our current cultural dominant, makes scarcely imaginable the possibility of an alternative or an outside uninflected by networks. If so many things and relationships are figured as networks, however, then what is not a network? If a network points towards particular logics and qualities of relation in our historical present, what others might we envision in the future? In  many ways, these questions are unanswerable from within the contemporary moment. Instead of seeking an avant-garde approach (to move beyond networks or opting out of networks (in some cases, to recover elements of pre-networked existence, this essay proposes a third orientation: one of ambivalence that operates as a mode of extreme presence. I propose the concept of "network aesthetics," which can be tracked across artistic media and cultural forms, as a model, style, and pedagogy for approaching interconnection in the twenty-first century. The following essay is excerpted from Network Ambivalence (Forthcoming from University of Chicago Press. 

  17. Network neuroscience.

    Science.gov (United States)

    Bassett, Danielle S; Sporns, Olaf

    2017-02-23

    Despite substantial recent progress, our understanding of the principles and mechanisms underlying complex brain function and cognition remains incomplete. Network neuroscience proposes to tackle these enduring challenges. Approaching brain structure and function from an explicitly integrative perspective, network neuroscience pursues new ways to map, record, analyze and model the elements and interactions of neurobiological systems. Two parallel trends drive the approach: the availability of new empirical tools to create comprehensive maps and record dynamic patterns among molecules, neurons, brain areas and social systems; and the theoretical framework and computational tools of modern network science. The convergence of empirical and computational advances opens new frontiers of scientific inquiry, including network dynamics, manipulation and control of brain networks, and integration of network processes across spatiotemporal domains. We review emerging trends in network neuroscience and attempt to chart a path toward a better understanding of the brain as a multiscale networked system.

  18. The effects of traffic structure on application and network performance

    CERN Document Server

    Aikat, Jay; Smith, F Donelson

    2012-01-01

    Over the past three decades, the Internet's rapid growth has spurred the development of new applications in mobile computing, digital music, online video, gaming and social networks. These applications rely heavily upon various underlying network protocols and mechanisms to enable, maintain and enhance their Internet functionalityThe Effects of Traffic Structure on Application and Network Performance provides the necessary tools for maximizing the network efficiency of any Internet application, and presents ground-breaking research that will influence how these applications are built in the fu

  19. Structure and Evolution of the Foreign Exchange Networks

    Science.gov (United States)

    Kwapień, J.; Gworek, S.; Drożdż, S.

    2009-01-01

    We investigate topology and temporal evolution of the foreign currency exchange market viewed from a weighted network perspective. Based on exchange rates for a set of 46 currencies (including precious metals), we construct different representations of the FX network depending on a choice of the base currency. Our results show that the network structure is not stable in time, but there are main clusters of currencies, which persist for a long period of time despite the fact that their size and content are variable. We find a long-term trend in the network's evolution which affects the USD and EUR nodes. In all the network representations, the USD node gradually loses its centrality, while, on contrary, the EUR node has become slightly more central than it used to be in its early years. Despite this directional trend, the overall evolution of the network is noisy.

  20. Neural network structure for navigation using potential fields

    Science.gov (United States)

    Plumer, Edward S.

    1992-01-01

    A hybrid-network method for obstacle avoidance in the truck-backing system of D. Nguyen and B. Widrow (1989) is presented. A neural network technique for vehicle navigation and control in the presence of obstacles has been developed. A potential function which peaks at the surface of obstacles and has its minimum at the proper vehicle destination is computed using a network structure. The field is guaranteed not to have spurious local minima and does not have the property of flattening-out far from the goal. A feedforward neural network is used to control the steering of the vehicle using local field information. The network is trained in an obstacle-free space to follow the negative gradient of the field, after which the network is able to control and navigate the truck to its target destination in a space of obstacles which may be stationary or movable.

  1. Conversation practices and network structure in Twitter

    DEFF Research Database (Denmark)

    Rossi, Luca; Magnani, Matteo

    2012-01-01

    the participation in the same hashtag based conversation change the follower list of the participants? Is it possible to point out specific social behaviors that would produce a major gain of followers? Our conclusions are based on real data concerning the popular TV show Xfactor, that largely used Twitter......The public by default nature of Twitter messages, together with the adoption of the #hashtag convention led, in few years, to the creation of a digital space able to host worldwide conversation on almost every kind of topic. From major TV shows to Natural disasters there is no contemporary event...... that does not have its own #hashtag to gather together the ongoing Twitter conversation. These topical discussions take place outside of the Twitter network made of followers and friends. Nevertheless this topical network is where many of the most studied phenomena take place. Therefore Twitter based...

  2. Self-organization in neural networks - Applications in structural optimization

    Science.gov (United States)

    Hajela, Prabhat; Fu, B.; Berke, Laszlo

    1993-01-01

    The present paper discusses the applicability of ART (Adaptive Resonance Theory) networks, and the Hopfield and Elastic networks, in problems of structural analysis and design. A characteristic of these network architectures is the ability to classify patterns presented as inputs into specific categories. The categories may themselves represent distinct procedural solution strategies. The paper shows how this property can be adapted in the structural analysis and design problem. A second application is the use of Hopfield and Elastic networks in optimization problems. Of particular interest are problems characterized by the presence of discrete and integer design variables. The parallel computing architecture that is typical of neural networks is shown to be effective in such problems. Results of preliminary implementations in structural design problems are also included in the paper.

  3. Predicting network structure using unlabeled interaction information

    OpenAIRE

    Nasim, Mehwish; Brandes, Ulrik

    2014-01-01

    We are interested in the question whether interactions in online social networks (OSNs) can serve as a proxy for more persistent social relation. With Facebook as the context of our analysis, we look at commenting on wall posts as a form of interaction, and friendship ties as social relations. Findings from a pretest suggest that others’ joint commenting patterns on someone’s status posts are indeed indicative of friendship ties between them, independent of the contents. This would have impli...

  4. Structural dimensions of knowledge-action networks for sustainability

    Science.gov (United States)

    Tischa A. Munoz; B.B. Cutts

    2016-01-01

    Research on the influence of social network structure over flows of knowledge in support of sustainability governance and action has recently flourished. These studies highlight three challenges to evaluating knowledge-action networks: first, defining boundaries; second, characterizing power distributions; and third, identifying obstacles to knowledge sharing and...

  5. Structural and Infrastructural Underpinnings of International R&D Networks

    DEFF Research Database (Denmark)

    Niang, Mohamed; Sørensen, Brian Vejrum

    2009-01-01

    This paper explores the process of globally distributing R&D activities with an emphasis on the effects of network maturity. It discusses emerging configurations by asking how the structure and infrastructure of international R&D networks evolve along with the move from a strong R&D center...

  6. The National Biomedical Communications Network as a Developing Structure.

    Science.gov (United States)

    Davis, Ruth M.

    The National Biomedical Communications Network has evolved both from a set of conceptual recommendations over the last twelve years and an accumulation of needs manifesting themselves in the requests of members of the medical community. With a short history of three years this Network and its developing structure have exhibited most of the…

  7. Information Propagation in Complex Networks : Structures and Dynamics

    NARCIS (Netherlands)

    Märtens, M.

    2018-01-01

    This thesis is a contribution to a deeper understanding of how information propagates and what this process entails. At its very core is the concept of the network: a collection of nodes and links, which describes the structure of the systems under investigation. The network is a mathematical model

  8. Chinese lexical networks: The structure, function and formation

    Science.gov (United States)

    Li, Jianyu; Zhou, Jie; Luo, Xiaoyue; Yang, Zhanxin

    2012-11-01

    In this paper Chinese phrases are modeled using complex networks theory. We analyze statistical properties of the networks and find that phrase networks display some important features: not only small world and the power-law distribution, but also hierarchical structure and disassortative mixing. These statistical traits display the global organization of Chinese phrases. The origin and formation of such traits are analyzed from a macroscopic Chinese culture and philosophy perspective. It is interesting to find that Chinese culture and philosophy may shape the formation and structure of Chinese phrases. To uncover the structural design principles of networks, network motif patterns are studied. It is shown that they serve as basic building blocks to form the whole phrase networks, especially triad 38 (feed forward loop) plays a more important role in forming most of the phrases and other motifs. The distinct structure may not only keep the networks stable and robust, but also be helpful for information processing. The results of the paper can give some insight into Chinese language learning and language acquisition. It strengthens the idea that learning the phrases helps to understand Chinese culture. On the other side, understanding Chinese culture and philosophy does help to learn Chinese phrases. The hub nodes in the networks show the close relationship with Chinese culture and philosophy. Learning or teaching the hub characters, hub-linking phrases and phrases which are meaning related based on motif feature should be very useful and important for Chinese learning and acquisition.

  9. Learning Networks, Networked Learning

    NARCIS (Netherlands)

    Sloep, Peter; Berlanga, Adriana

    2010-01-01

    Sloep, P. B., & Berlanga, A. J. (2011). Learning Networks, Networked Learning [Redes de Aprendizaje, Aprendizaje en Red]. Comunicar, XIX(37), 55-63. Retrieved from http://dx.doi.org/10.3916/C37-2011-02-05

  10. Community structure from spectral properties in complex networks

    Science.gov (United States)

    Servedio, V. D. P.; Colaiori, F.; Capocci, A.; Caldarelli, G.

    2005-06-01

    We analyze the spectral properties of complex networks focusing on their relation to the community structure, and develop an algorithm based on correlations among components of different eigenvectors. The algorithm applies to general weighted networks, and, in a suitably modified version, to the case of directed networks. Our method allows to correctly detect communities in sharply partitioned graphs, however it is useful to the analysis of more complex networks, without a well defined cluster structure, as social and information networks. As an example, we test the algorithm on a large scale data-set from a psychological experiment of free word association, where it proves to be successful both in clustering words, and in uncovering mental association patterns.

  11. Ranking influential nodes in complex networks with structural holes

    Science.gov (United States)

    Hu, Ping; Mei, Ting

    2018-01-01

    Ranking influential nodes in complex networks is of great theoretical and practical significance to ensure the safe operations of networks. In view of the important role structural hole nodes usually play in information spreading in complex networks, we propose a novel ranking method of influential nodes using structural holes called E-Burt method, which can be applied to weighted networks. This method fully takes into account the total connectivity strengths of the node in its local scope, the number of the connecting edges and the distributions of the total connectivity strengths on its connecting edges. The simulation results on the susceptible-infectious-recovered (SIR) dynamics suggest that the proposed E-Burt method can rank influential nodes more effectively and accurately in complex networks.

  12. Exponential random graph models for networks with community structure.

    Science.gov (United States)

    Fronczak, Piotr; Fronczak, Agata; Bujok, Maksymilian

    2013-09-01

    Although the community structure organization is an important characteristic of real-world networks, most of the traditional network models fail to reproduce the feature. Therefore, the models are useless as benchmark graphs for testing community detection algorithms. They are also inadequate to predict various properties of real networks. With this paper we intend to fill the gap. We develop an exponential random graph approach to networks with community structure. To this end we mainly built upon the idea of blockmodels. We consider both the classical blockmodel and its degree-corrected counterpart and study many of their properties analytically. We show that in the degree-corrected blockmodel, node degrees display an interesting scaling property, which is reminiscent of what is observed in real-world fractal networks. A short description of Monte Carlo simulations of the models is also given in the hope of being useful to others working in the field.

  13. Maps of random walks on complex networks reveal community structure.

    Science.gov (United States)

    Rosvall, Martin; Bergstrom, Carl T

    2008-01-29

    To comprehend the multipartite organization of large-scale biological and social systems, we introduce an information theoretic approach that reveals community structure in weighted and directed networks. We use the probability flow of random walks on a network as a proxy for information flows in the real system and decompose the network into modules by compressing a description of the probability flow. The result is a map that both simplifies and highlights the regularities in the structure and their relationships. We illustrate the method by making a map of scientific communication as captured in the citation patterns of >6,000 journals. We discover a multicentric organization with fields that vary dramatically in size and degree of integration into the network of science. Along the backbone of the network-including physics, chemistry, molecular biology, and medicine-information flows bidirectionally, but the map reveals a directional pattern of citation from the applied fields to the basic sciences.

  14. Realization of Broadband Matched Filter Structures Based on Dual Networks

    Directory of Open Access Journals (Sweden)

    M. Gerding

    2005-01-01

    Full Text Available This paper deals with the basic electrical properties of dual networks and with their application in broadband matched filter structures. Starting with the main characteristics and different realization methods of dual networks, a filter structure is presented, which is based on a combination of dual networks and which provides a broadband matched input and two decoupled output ports. This filter synthesis focuses on the design of high pass filters, which are suitable to be used as differentiating stages in electrical pulse generators as a part of the so-called pulse shaping network. In order to achieve a proper pulse shape and for the prevention of multiple reflections between the switching circuit and the differentiating network, a broadband matched filter is a basic requirement.

  15. Joint Modelling of Structural and Functional Brain Networks

    DEFF Research Database (Denmark)

    Andersen, Kasper Winther; Herlau, Tue; Mørup, Morten

    Functional and structural magnetic resonance imaging have become the most important noninvasive windows to the human brain. A major challenge in the analysis of brain networks is to establish the similarities and dissimilarities between functional and structural connectivity. We formulate a non......-parametric Bayesian network model which allows for joint modelling and integration of multiple networks. We demonstrate the model’s ability to detect vertices that share structure across networks jointly in functional MRI (fMRI) and diffusion MRI (dMRI) data. Using two fMRI and dMRI scans per subject, we establish...... significant structures that are consistently shared across subjects and data splits. This provides an unsupervised approach for modeling of structure-function relations in the brain and provides a general framework for multimodal integration....

  16. Mesoscopic structure conditions the emergence of cooperation on social networks

    Energy Technology Data Exchange (ETDEWEB)

    Lozano, S.; Arenas, A.; Sanchez, A.

    2008-12-01

    We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

  17. Some structural determinants of Pavlovian conditioning in artificial neural networks.

    Science.gov (United States)

    Sánchez, José M; Galeazzi, Juan M; Burgos, José E

    2010-05-01

    This paper investigates the possible role of neuroanatomical features in Pavlovian conditioning, via computer simulations with layered, feedforward artificial neural networks. The networks' structure and functioning are described by a strongly bottom-up model that takes into account the roles of hippocampal and dopaminergic systems in conditioning. Neuroanatomical features were simulated as generic structural or architectural features of neural networks. We focused on the number of units per hidden layer and connectivity. The effect of the number of units per hidden layer was investigated through simulations of resistance to extinction in fully connected networks. Large networks were more resistant to extinction than small networks, a stochastic effect of the asynchronous random procedure used in the simulator to update activations and weights. These networks did not simulate second-order conditioning because weight competition prevented conditioning to a stimulus after conditioning to another. Partially connected networks simulated second-order conditioning and devaluation of the second-order stimulus after extinction of a similar first-order stimulus. Similar stimuli were simulated as nonorthogonal input-vectors. Copyright (c) 2009 Elsevier B.V. All rights reserved.

  18. A local immunization strategy for networks with overlapping community structure

    Science.gov (United States)

    Taghavian, Fatemeh; Salehi, Mostafa; Teimouri, Mehdi

    2017-02-01

    Since full coverage treatment is not feasible due to limited resources, we need to utilize an immunization strategy to effectively distribute the available vaccines. On the other hand, the structure of contact network among people has a significant impact on epidemics of infectious diseases (such as SARS and influenza) in a population. Therefore, network-based immunization strategies aim to reduce the spreading rate by removing the vaccinated nodes from contact network. Such strategies try to identify more important nodes in epidemics spreading over a network. In this paper, we address the effect of overlapping nodes among communities on epidemics spreading. The proposed strategy is an optimized random-walk based selection of these nodes. The whole process is local, i.e. it requires contact network information in the level of nodes. Thus, it is applicable to large-scale and unknown networks in which the global methods usually are unrealizable. Our simulation results on different synthetic and real networks show that the proposed method outperforms the existing local methods in most cases. In particular, for networks with strong community structures, high overlapping membership of nodes or small size communities, the proposed method shows better performance.

  19. Structure of Small World Innovation Network and Learning Performance

    Directory of Open Access Journals (Sweden)

    Shuang Song

    2014-01-01

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

  20. Disentangling the co-structure of multilayer interaction networks: degree distribution and module composition in two-layer bipartite networks.

    Science.gov (United States)

    Astegiano, Julia; Altermatt, Florian; Massol, François

    2017-11-13

    Species establish different interactions (e.g. antagonistic, mutualistic) with multiple species, forming multilayer ecological networks. Disentangling network co-structure in multilayer networks is crucial to predict how biodiversity loss may affect the persistence of multispecies assemblages. Existing methods to analyse multilayer networks often fail to consider network co-structure. We present a new method to evaluate the modular co-structure of multilayer networks through the assessment of species degree co-distribution and network module composition. We focus on modular structure because of its high prevalence among ecological networks. We apply our method to two Lepidoptera-plant networks, one describing caterpillar-plant herbivory interactions and one representing adult Lepidoptera nectaring on flowers, thereby possibly pollinating them. More than 50% of the species established either herbivory or visitation interactions, but not both. These species were over-represented among plants and lepidopterans, and were present in most modules in both networks. Similarity in module composition between networks was high but not different from random expectations. Our method clearly delineates the importance of interpreting multilayer module composition similarity in the light of the constraints imposed by network structure to predict the potential indirect effects of species loss through interconnected modular networks.

  1. Fragmented Romanian Sociology: Growth and Structure of the Collaboration Network

    Science.gov (United States)

    Hâncean, Marian-Gabriel; Perc, Matjaž; Vlăsceanu, Lazăr

    2014-01-01

    Structural patterns in collaboration networks are essential for understanding how new ideas, research practices, innovation or cooperation circulate and develop within academic communities and between and within university departments. In our research, we explore and investigate the structure of the collaboration network formed by the academics working full-time within all the 17 sociology departments across Romania. We show that the collaboration network is sparse and fragmented, and that it constitutes an environment that does not promote the circulation of new ideas and innovation within the field. Although recent years have witnessed an increase in the productivity of Romanian sociologists, there is still ample room for improvement in terms of the interaction infrastructure that ought to link individuals together so that they could maximize their potentials. We also fail to discern evidence in favor of the Matthew effect governing the growth of the network, which suggests scientific success and productivity are not rewarded. Instead, the structural properties of the collaboration network are partly those of a core-periphery network, where the spread of innovation and change can be explained by structural equivalence rather than by interpersonal influence models. We also provide support for the idea that, within the observed network, collaboration is the product of homophily rather than prestige effects. Further research on the subject based on data from other countries in the region is needed to place our results in a comparative framework, in particular to discern whether the behavior of the Romanian sociologist community is unique or rather common. PMID:25409180

  2. Fragmented Romanian sociology: growth and structure of the collaboration network.

    Directory of Open Access Journals (Sweden)

    Marian-Gabriel Hâncean

    Full Text Available Structural patterns in collaboration networks are essential for understanding how new ideas, research practices, innovation or cooperation circulate and develop within academic communities and between and within university departments. In our research, we explore and investigate the structure of the collaboration network formed by the academics working full-time within all the 17 sociology departments across Romania. We show that the collaboration network is sparse and fragmented, and that it constitutes an environment that does not promote the circulation of new ideas and innovation within the field. Although recent years have witnessed an increase in the productivity of Romanian sociologists, there is still ample room for improvement in terms of the interaction infrastructure that ought to link individuals together so that they could maximize their potentials. We also fail to discern evidence in favor of the Matthew effect governing the growth of the network, which suggests scientific success and productivity are not rewarded. Instead, the structural properties of the collaboration network are partly those of a core-periphery network, where the spread of innovation and change can be explained by structural equivalence rather than by interpersonal influence models. We also provide support for the idea that, within the observed network, collaboration is the product of homophily rather than prestige effects. Further research on the subject based on data from other countries in the region is needed to place our results in a comparative framework, in particular to discern whether the behavior of the Romanian sociologist community is unique or rather common.

  3. Network structure classification and features of water distribution systems

    Science.gov (United States)

    Giustolisi, Orazio; Simone, Antonietta; Ridolfi, Luca

    2017-04-01

    The network connectivity structure of water distribution systems (WDSs) represents the domain where hydraulic processes occur, driving the emerging behavior of such systems, for example with respect to robustness and vulnerability. In complex network theory (CNT), a common way of classifying the network structure and connectivity is the association of the nodal degree distribution to specific probability distribution models, and during the last decades, researchers classified many real networks using the Poisson or Pareto distributions. In spite of the fact that degree-based network classification could play a crucial role to assess WDS vulnerability, this task is not easy because the network structure of WDSs is strongly constrained by spatial characteristics of the environment where they are constructed. The consequence of these spatial constraints is that the nodal degree spans very small ranges in WDSs hindering a reliable classification by the standard approach based on the nodal degree distribution. This work investigates the classification of the network structure of 22 real WDSs, built in different environments, demonstrating that the Poisson distribution generally models the degree distributions very well. In order to overcome the problem of the reliable classification based on the standard nodal degree, we define the "neighborhood" degree, equal to the sum of the nodal degrees of the nearest topological neighbors (i.e., the adjacent nodes). This definition of "neighborhood" degree is consistent with the fact that the degree of a single node is not significant for analysis of WDSs.

  4. Fragmented Romanian sociology: growth and structure of the collaboration network.

    Science.gov (United States)

    Hâncean, Marian-Gabriel; Perc, Matjaž; Vlăsceanu, Lazăr

    2014-01-01

    Structural patterns in collaboration networks are essential for understanding how new ideas, research practices, innovation or cooperation circulate and develop within academic communities and between and within university departments. In our research, we explore and investigate the structure of the collaboration network formed by the academics working full-time within all the 17 sociology departments across Romania. We show that the collaboration network is sparse and fragmented, and that it constitutes an environment that does not promote the circulation of new ideas and innovation within the field. Although recent years have witnessed an increase in the productivity of Romanian sociologists, there is still ample room for improvement in terms of the interaction infrastructure that ought to link individuals together so that they could maximize their potentials. We also fail to discern evidence in favor of the Matthew effect governing the growth of the network, which suggests scientific success and productivity are not rewarded. Instead, the structural properties of the collaboration network are partly those of a core-periphery network, where the spread of innovation and change can be explained by structural equivalence rather than by interpersonal influence models. We also provide support for the idea that, within the observed network, collaboration is the product of homophily rather than prestige effects. Further research on the subject based on data from other countries in the region is needed to place our results in a comparative framework, in particular to discern whether the behavior of the Romanian sociologist community is unique or rather common.

  5. Imaging structural and functional brain networks in temporal lobe epilepsy

    Science.gov (United States)

    Bernhardt, Boris C.; Hong, SeokJun; Bernasconi, Andrea; Bernasconi, Neda

    2013-01-01

    Early imaging studies in temporal lobe epilepsy (TLE) focused on the search for mesial temporal sclerosis, as its surgical removal results in clinically meaningful improvement in about 70% of patients. Nevertheless, a considerable subgroup of patients continues to suffer from post-operative seizures. Although the reasons for surgical failure are not fully understood, electrophysiological and imaging data suggest that anomalies extending beyond the temporal lobe may have negative impact on outcome. This hypothesis has revived the concept of human epilepsy as a disorder of distributed brain networks. Recent methodological advances in non-invasive neuroimaging have led to quantify structural and functional networks in vivo. While structural networks can be inferred from diffusion MRI tractography and inter-regional covariance patterns of structural measures such as cortical thickness, functional connectivity is generally computed based on statistical dependencies of neurophysiological time-series, measured through functional MRI or electroencephalographic techniques. This review considers the application of advanced analytical methods in structural and functional connectivity analyses in TLE. We will specifically highlight findings from graph-theoretical analysis that allow assessing the topological organization of brain networks. These studies have provided compelling evidence that TLE is a system disorder with profound alterations in local and distributed networks. In addition, there is emerging evidence for the utility of network properties as clinical diagnostic markers. Nowadays, a network perspective is considered to be essential to the understanding of the development, progression, and management of epilepsy. PMID:24098281

  6. Neural Network Algorithm for Prediction of Secondary Protein Structure

    National Research Council Canada - National Science Library

    Zikrija Avdagic; Elvir Purisevic; Emir Buza; Zlatan Coralic

    2009-01-01

    .... In this paper we describe the method and results of using CB513 as a dataset suitable for development of artificial neural network algorithms for prediction of secondary protein structure with MATLAB...

  7. The structure of complex networks theory and applications

    CERN Document Server

    Estrada, Ernesto

    2012-01-01

    This book deals with the analysis of the structure of complex networks by combining results from graph theory, physics, and pattern recognition. The book is divided into two parts. 11 chapters are dedicated to the development of theoretical tools for the structural analysis of networks, and 7 chapters are illustrating, in a critical way, applications of these tools to real-world scenarios. The first chapters provide detailed coverage of adjacency and metric and topologicalproperties of networks, followed by chapters devoted to the analysis of individual fragments and fragment-based global inva

  8. Modeling Temporal Evolution and Multiscale Structure in Networks

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  9. Daily temporal structure in African savanna flower visitation networks and consequences for network sampling.

    Science.gov (United States)

    Baldock, Katherine C R; Memmott, Jane; Ruiz-Guajardo, Juan Carlos; Roze, Denis; Stone, Graham N

    2011-03-01

    Ecological interaction networks are a valuable approach to understanding plant-pollinator interactions at the community level. Highly structured daily activity patterns are a feature of the biology of many flower visitors, particularly provisioning female bees, which often visit different floral sources at different times. Such temporal structure implies that presence/absence and relative abundance of specific flower-visitor interactions (links) in interaction networks may be highly sensitive to the daily timing of data collection. Further, relative timing of interactions is central to their possible role in competition or facilitation of seed set among coflowering plants sharing pollinators. To date, however, no study has examined the network impacts of daily temporal variation in visitor activity at a community scale. Here we use temporally structured sampling to examine the consequences of daily activity patterns upon network properties using fully quantified flower-visitor interaction data for a Kenyan savanna habitat. Interactions were sampled at four sequential three-hour time intervals between 06:00 and 18:00, across multiple seasonal time points for two sampling sites. In all data sets the richness and relative abundance of links depended critically on when during the day visitation was observed. Permutation-based null modeling revealed significant temporal structure across daily time intervals at three of the four seasonal time points, driven primarily by patterns in bee activity. This sensitivity of network structure shows the need to consider daily time in network sampling design, both to maximize the probability of sampling links relevant to plant reproductive success and to facilitate appropriate interpretation of interspecific relationships. Our data also suggest that daily structuring at a community level could reduce indirect competitive interactions when coflowering plants share pollinators, as is commonly observed during flowering in highly

  10. Structured learning via convolutional neural networks for vehicle detection

    Science.gov (United States)

    Maqueda, Ana I.; del Blanco, Carlos R.; Jaureguizar, Fernando; García, Narciso

    2017-05-01

    One of the main tasks in a vision-based traffic monitoring system is the detection of vehicles. Recently, deep neural networks have been successfully applied to this end, outperforming previous approaches. However, most of these works generally rely on complex and high-computational region proposal networks. Others employ deep neural networks as a segmentation strategy to achieve a semantic representation of the object of interest, which has to be up-sampled later. In this paper, a new design for a convolutional neural network is applied to vehicle detection in highways for traffic monitoring. This network generates a spatially structured output that encodes the vehicle locations. Promising results have been obtained in the GRAM-RTM dataset.

  11. Impact of constrained rewiring on network structure and node dynamics.

    Science.gov (United States)

    Rattana, P; Berthouze, L; Kiss, I Z

    2014-11-01

    In this paper, we study an adaptive spatial network. We consider a susceptible-infected-susceptible (SIS) epidemic on the network, with a link or contact rewiring process constrained by spatial proximity. In particular, we assume that susceptible nodes break links with infected nodes independently of distance and reconnect at random to susceptible nodes available within a given radius. By systematically manipulating this radius we investigate the impact of rewiring on the structure of the network and characteristics of the epidemic. We adopt a step-by-step approach whereby we first study the impact of rewiring on the network structure in the absence of an epidemic, then with nodes assigned a disease status but without disease dynamics, and finally running network and epidemic dynamics simultaneously. In the case of no labeling and no epidemic dynamics, we provide both analytic and semianalytic formulas for the value of clustering achieved in the network. Our results also show that the rewiring radius and the network's initial structure have a pronounced effect on the endemic equilibrium, with increasingly large rewiring radiuses yielding smaller disease prevalence.

  12. Comparison and validation of community structures in complex networks

    Science.gov (United States)

    Gustafsson, Mika; Hörnquist, Michael; Lombardi, Anna

    2006-07-01

    The issue of partitioning a network into communities has attracted a great deal of attention recently. Most authors seem to equate this issue with the one of finding the maximum value of the modularity, as defined by Newman. Since the problem formulated this way is believed to be NP-hard, most effort has gone into the construction of search algorithms, and less to the question of other measures of community structures, similarities between various partitionings and the validation with respect to external information. Here we concentrate on a class of computer generated networks and on three well-studied real networks which constitute a bench-mark for network studies; the karate club, the US college football teams and a gene network of yeast. We utilize some standard ways of clustering data (originally not designed for finding community structures in networks) and show that these classical methods sometimes outperform the newer ones. We discuss various measures of the strength of the modular structure, and show by examples features and drawbacks. Further, we compare different partitions by applying some graph-theoretic concepts of distance, which indicate that one of the quality measures of the degree of modularity corresponds quite well with the distance from the true partition. Finally, we introduce a way to validate the partitionings with respect to external data when the nodes are classified but the network structure is unknown. This is here possible since we know everything of the computer generated networks, as well as the historical answer to how the karate club and the football teams are partitioned in reality. The partitioning of the gene network is validated by use of the Gene Ontology database, where we show that a community in general corresponds to a biological process.

  13. Correlations between community structure and link formation in complex networks.

    Directory of Open Access Journals (Sweden)

    Zhen Liu

    Full Text Available BACKGROUND: Links in complex networks commonly represent specific ties between pairs of nodes, such as protein-protein interactions in biological networks or friendships in social networks. However, understanding the mechanism of link formation in complex networks is a long standing challenge for network analysis and data mining. METHODOLOGY/PRINCIPAL FINDINGS: Links in complex networks have a tendency to cluster locally and form so-called communities. This widely existed phenomenon reflects some underlying mechanism of link formation. To study the correlations between community structure and link formation, we present a general computational framework including a theory for network partitioning and link probability estimation. Our approach enables us to accurately identify missing links in partially observed networks in an efficient way. The links having high connection likelihoods in the communities reveal that links are formed preferentially to create cliques and accordingly promote the clustering level of the communities. The experimental results verify that such a mechanism can be well captured by our approach. CONCLUSIONS/SIGNIFICANCE: Our findings provide a new insight into understanding how links are created in the communities. The computational framework opens a wide range of possibilities to develop new approaches and applications, such as community detection and missing link prediction.

  14. Brain connectivity dynamics during social interaction reflect social network structure.

    Science.gov (United States)

    Schmälzle, Ralf; Brook O'Donnell, Matthew; Garcia, Javier O; Cascio, Christopher N; Bayer, Joseph; Bassett, Danielle S; Vettel, Jean M; Falk, Emily B

    2017-05-16

    Social ties are crucial for humans. Disruption of ties through social exclusion has a marked effect on our thoughts and feelings; however, such effects can be tempered by broader social network resources. Here, we use fMRI data acquired from 80 male adolescents to investigate how social exclusion modulates functional connectivity within and across brain networks involved in social pain and understanding the mental states of others (i.e., mentalizing). Furthermore, using objectively logged friendship network data, we examine how individual variability in brain reactivity to social exclusion relates to the density of participants' friendship networks, an important aspect of social network structure. We find increased connectivity within a set of regions previously identified as a mentalizing system during exclusion relative to inclusion. These results are consistent across the regions of interest as well as a whole-brain analysis. Next, examining how social network characteristics are associated with task-based connectivity dynamics, we find that participants who showed greater changes in connectivity within the mentalizing system when socially excluded by peers had less dense friendship networks. This work provides insight to understand how distributed brain systems respond to social and emotional challenges and how such brain dynamics might vary based on broader social network characteristics.

  15. Correlations between community structure and link formation in complex networks.

    Science.gov (United States)

    Liu, Zhen; He, Jia-Lin; Kapoor, Komal; Srivastava, Jaideep

    2013-01-01

    Links in complex networks commonly represent specific ties between pairs of nodes, such as protein-protein interactions in biological networks or friendships in social networks. However, understanding the mechanism of link formation in complex networks is a long standing challenge for network analysis and data mining. Links in complex networks have a tendency to cluster locally and form so-called communities. This widely existed phenomenon reflects some underlying mechanism of link formation. To study the correlations between community structure and link formation, we present a general computational framework including a theory for network partitioning and link probability estimation. Our approach enables us to accurately identify missing links in partially observed networks in an efficient way. The links having high connection likelihoods in the communities reveal that links are formed preferentially to create cliques and accordingly promote the clustering level of the communities. The experimental results verify that such a mechanism can be well captured by our approach. Our findings provide a new insight into understanding how links are created in the communities. The computational framework opens a wide range of possibilities to develop new approaches and applications, such as community detection and missing link prediction.

  16. Adapting Bayes Network Structures to Non-stationary Domains

    DEFF Research Database (Denmark)

    Nielsen, Søren Holbech; Nielsen, Thomas Dyhre

    2006-01-01

    When an incremental structural learning method gradually modifies a Bayesian network (BN) structure to fit observations, as they are read from a database, we call the process structural adaptation. Structural adaptation is useful when the learner is set to work in an unknown environment, where a BN...

  17. Adapting Bayes Network Structures to Non-stationary Domains

    DEFF Research Database (Denmark)

    Nielsen, Søren Holbech; Nielsen, Thomas Dyhre

    2008-01-01

    When an incremental structural learning method gradually modifies a Bayesian network (BN) structure to fit a sequential stream of observations, we call the process structural adaptation. Structural adaptation is useful when the learner is set to work in an unknown environment, where a BN...

  18. Structural Quality of Service in Large-Scale Networks

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup

    , telephony and data. To meet the requirements of the different applications, and to handle the increased vulnerability to failures, the ability to design robust networks providing good Quality of Service is crucial. However, most planning of large-scale networks today is ad-hoc based, leading to highly......Digitalization has created the base for co-existence and convergence in communications, leading to an increasing use of multi service networks. This is for example seen in the Fiber To The Home implementations, where a single fiber is used for virtually all means of communication, including TV...... complex networks lacking predictability and global structural properties. The thesis applies the concept of Structural Quality of Service to formulate desirable global properties, and it shows how regular graph structures can be used to obtain such properties....

  19. From Microactions to Macrostructure and Back : A Structurational Approach to the Evolution of Organizational Networks

    NARCIS (Netherlands)

    Whitbred, Robert; Fonti, Fabio; Steglich, Christian; Contractor, Noshir

    Structuration theory (ST) and network analysis are promising approaches for studying the emergence of communication networks. We offer a model that integrates the conceptual richness of structuration with the precision of relevant concepts and mechanisms offered from communication network research.

  20. Brain networks that track musical structure.

    Science.gov (United States)

    Janata, Petr

    2005-12-01

    As the functional neuroimaging literature grows, it becomes increasingly apparent that music and musical activities engage diverse regions of the brain. In this paper I discuss two studies to illustrate that exactly which brain areas are observed to be responsive to musical stimuli and tasks depends on the tasks and the methods used to describe the tasks and the stimuli. In one study, subjects listened to polyphonic music and were asked to either orient their attention selectively to individual instruments or in a divided or holistic manner across multiple instruments. The network of brain areas that was recruited changed subtly with changes in the task instructions. The focus of the second study was to identify brain regions that follow the pattern of movement of a continuous melody through the tonal space defined by the major and minor keys of Western tonal music. Such an area was identified in the rostral medial prefrontal cortex. This observation is discussed in the context of other neuroimaging studies that implicate this region in inwardly directed mental states involving decisions about the self, autobiographical memory, the cognitive regulation of emotion, affective responses to musical stimuli, and familiarity judgments about musical stimuli. Together with observations that these regions are among the last to atrophy in Alzheimer disease, and that these patients appear to remain responsive to autobiographically salient musical stimuli, very early evidence is emerging from the literature for the hypothesis that the rostral medial prefrontal cortex is a node that is important for binding music with memories within a broader music-responsive network.

  1. Motif structure and cooperation in real-world complex networks

    Science.gov (United States)

    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.

  2. Overlay networks toward information networking

    CERN Document Server

    Tarkoma, Sasu

    2010-01-01

    With their ability to solve problems in massive information distribution and processing, while keeping scaling costs low, overlay systems represent a rapidly growing area of R&D with important implications for the evolution of Internet architecture. Inspired by the author's articles on content based routing, Overlay Networks: Toward Information Networking provides a complete introduction to overlay networks. Examining what they are and what kind of structures they require, the text covers the key structures, protocols, and algorithms used in overlay networks. It reviews the current state of th

  3. Mapping human whole-brain structural networks with diffusion MRI.

    Directory of Open Access Journals (Sweden)

    Patric Hagmann

    Full Text Available Understanding the large-scale structural network formed by neurons is a major challenge in system neuroscience. A detailed connectivity map covering the entire brain would therefore be of great value. Based on diffusion MRI, we propose an efficient methodology to generate large, comprehensive and individual white matter connectional datasets of the living or dead, human or animal brain. This non-invasive tool enables us to study the basic and potentially complex network properties of the entire brain. For two human subjects we find that their individual brain networks have an exponential node degree distribution and that their global organization is in the form of a small world.

  4. Sampling from complex networks with high community structures.

    Science.gov (United States)

    Salehi, Mostafa; Rabiee, Hamid R; Rajabi, Arezo

    2012-06-01

    In this paper, we propose a novel link-tracing sampling algorithm, based on the concepts from PageRank vectors, to sample from networks with high community structures. Our method has two phases; (1) Sampling the closest nodes to the initial nodes by approximating personalized PageRank vectors and (2) Jumping to a new community by using PageRank vectors and unknown neighbors. Empirical studies on several synthetic and real-world networks show that the proposed method improves the performance of network sampling compared to the popular link-based sampling methods in terms of accuracy and visited communities.

  5. Neural network definitions of highly predictable protein secondary structure classes

    Energy Technology Data Exchange (ETDEWEB)

    Lapedes, A. [Los Alamos National Lab., NM (United States)]|[Santa Fe Inst., NM (United States); Steeg, E. [Toronto Univ., ON (Canada). Dept. of Computer Science; Farber, R. [Los Alamos National Lab., NM (United States)

    1994-02-01

    We use two co-evolving neural networks to determine new classes of protein secondary structure which are significantly more predictable from local amino sequence than the conventional secondary structure classification. Accurate prediction of the conventional secondary structure classes: alpha helix, beta strand, and coil, from primary sequence has long been an important problem in computational molecular biology. Neural networks have been a popular method to attempt to predict these conventional secondary structure classes. Accuracy has been disappointingly low. The algorithm presented here uses neural networks to similtaneously examine both sequence and structure data, and to evolve new classes of secondary structure that can be predicted from sequence with significantly higher accuracy than the conventional classes. These new classes have both similarities to, and differences with the conventional alpha helix, beta strand and coil.

  6. Modeling structure and resilience of the dark network.

    Science.gov (United States)

    De Domenico, Manlio; Arenas, Alex

    2017-02-01

    While the statistical and resilience properties of the Internet are no longer changing significantly across time, the Darknet, a network devoted to keep anonymous its traffic, still experiences rapid changes to improve the security of its users. Here we study the structure of the Darknet and find that its topology is rather peculiar, being characterized by a nonhomogeneous distribution of connections, typical of scale-free networks; very short path lengths and high clustering, typical of small-world networks; and lack of a core of highly connected nodes. We propose a model to reproduce such features, demonstrating that the mechanisms used to improve cybersecurity are responsible for the observed topology. Unexpectedly, we reveal that its peculiar structure makes the Darknet much more resilient than the Internet (used as a benchmark for comparison at a descriptive level) to random failures, targeted attacks, and cascade failures, as a result of adaptive changes in response to the attempts of dismantling the network across time.

  7. Modeling structure and resilience of the dark network

    Science.gov (United States)

    De Domenico, Manlio; Arenas, Alex

    2017-02-01

    While the statistical and resilience properties of the Internet are no longer changing significantly across time, the Darknet, a network devoted to keep anonymous its traffic, still experiences rapid changes to improve the security of its users. Here we study the structure of the Darknet and find that its topology is rather peculiar, being characterized by a nonhomogeneous distribution of connections, typical of scale-free networks; very short path lengths and high clustering, typical of small-world networks; and lack of a core of highly connected nodes. We propose a model to reproduce such features, demonstrating that the mechanisms used to improve cybersecurity are responsible for the observed topology. Unexpectedly, we reveal that its peculiar structure makes the Darknet much more resilient than the Internet (used as a benchmark for comparison at a descriptive level) to random failures, targeted attacks, and cascade failures, as a result of adaptive changes in response to the attempts of dismantling the network across time.

  8. Finding community structure in networks using the eigenvectors of matrices.

    Science.gov (United States)

    Newman, M E J

    2006-09-01

    We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as "modularity" over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.

  9. Aging influence on grey matter structural associations within the default mode network utilizing Bayesian network modeling

    Directory of Open Access Journals (Sweden)

    Yan eWang

    2014-05-01

    Full Text Available Recent neuroimaging studies have revealed normal aging-related alterations in functional and structural brain networks such as the default mode network (DMN. However, less is understood about specific brain structural dependencies or interactions between brain regions within the DMN in the normal aging process. In this study, using Bayesian network (BN modeling, we analyzed grey matter volume data from 109 young and 82 old subjects to characterize the influence of aging on associations between core brain regions within the DMN. Furthermore, we investigated the discriminability of the aging-associated BN models for the young and old groups. Compared to their young counterparts, the old subjects showed significant reductions in connections from right inferior temporal cortex (ITC to medial prefrontal cortex (mPFC, right hippocampus (HP to right ITC, and mPFC to posterior cingulate cortex (PCC and increases in connections from left HP to mPFC and right inferior parietal cortex (IPC to right ITC. Moreover, the classification results showed that the aging-related BN models could predict group membership with 88.48% accuracy, 88.07% sensitivity and 89.02% specificity. Our findings suggest that structural associations within the DMN may be affected by normal aging and provide crucial information about aging effects on brain structural networks.

  10. Dependency structure matrix modelling for stakeholder value networks

    OpenAIRE

    Feng, Wen; Crawley, Edward F.; de Weck, Olivier L.; Keller, Rene; Robinson, Bob

    2010-01-01

    This paper develops a qualitative/quantitative network approach, namely a “Stakeholder Value Network”, to understand the impacts of both direct and indirect relationships between stakeholders on the success of large engineering projects. Specifically, this paper explores the feasibility and benefit of applying the Dependency Structure Matrix (DSM) as the modelling platform for Stakeholder Value Networks. Further, an efficient algorithm is designed for computing indirect stakeholder influence ...

  11. The trade-off between wiring cost and network topology in white matter structural networks in health and migraine.

    Science.gov (United States)

    Liu, Jixin; Zhao, Ling; Nan, Jiaofen; Li, Guoying; Xiong, Shiwei; von Deneen, Karen M; Gong, Qiyong; Liang, Fanrong; Qin, Wei; Tian, Jie

    2013-10-01

    The human brain organization of cortical networks has optimized trade-off architecture for the economical minimization of connection distance and maximizing valuable topological properties; however, whether this network configuration is disrupted in chronic migraine remains unknown. Here, employing the diffusion tensor imaging and graph theory approaches to construct white matter networks in 26 patients with migraine (PM) and 26 gender-matched healthy controls (HC), we investigated relationships between structural connectivity, cortical network architecture and anatomical distance in the two groups separately. Compared with the HC group, the patients showed longer global distance connection in PM, with proportionally less short-distance and more medium-distance; correspondingly, the patients showed abnormal global topology in their structural networks, mainly presented as a higher clustering coefficient. Moreover, the abnormal association between these two network features was also found. Intriguingly, the network measure that combined the nodal anatomical distance and network topology could distinguish PM from HC with high accuracy of 90.4%. We also demonstrated a high reproducibility of our findings across different parcellation schemes. Our results demonstrated that long-term migraine may result in a abnormal optimization of a trade-off between wiring cost and network topology in white matter structural networks and highlights the potential for combining spatial and topological aspects as a network marker, which may provide valuable insights into the understanding of brain network reorganization that could be attributed to the underlying pathophysiology resulting from migraine. Crown Copyright © 2013. Published by Elsevier Inc. All rights reserved.

  12. Emergence of Slow-Switching Assemblies in Structured Neuronal Networks.

    Directory of Open Access Journals (Sweden)

    Michael T Schaub

    2015-07-01

    Full Text Available Unraveling the interplay between connectivity and spatio-temporal dynamics in neuronal networks is a key step to advance our understanding of neuronal information processing. Here we investigate how particular features of network connectivity underpin the propensity of neural networks to generate slow-switching assembly (SSA dynamics, i.e., sustained epochs of increased firing within assemblies of neurons which transition slowly between different assemblies throughout the network. We show that the emergence of SSA activity is linked to spectral properties of the asymmetric synaptic weight matrix. In particular, the leading eigenvalues that dictate the slow dynamics exhibit a gap with respect to the bulk of the spectrum, and the associated Schur vectors exhibit a measure of block-localization on groups of neurons, thus resulting in coherent dynamical activity on those groups. Through simple rate models, we gain analytical understanding of the origin and importance of the spectral gap, and use these insights to develop new network topologies with alternative connectivity paradigms which also display SSA activity. Specifically, SSA dynamics involving excitatory and inhibitory neurons can be achieved by modifying the connectivity patterns between both types of neurons. We also show that SSA activity can occur at multiple timescales reflecting a hierarchy in the connectivity, and demonstrate the emergence of SSA in small-world like networks. Our work provides a step towards understanding how network structure (uncovered through advancements in neuroanatomy and connectomics can impact on spatio-temporal neural activity and constrain the resulting dynamics.

  13. The structure and resilience of financial market networks.

    Science.gov (United States)

    Peron, Thomas Kaue Dal'Maso; Costa, Luciano da Fontoura; Rodrigues, Francisco A

    2012-03-01

    Financial markets can be viewed as a highly complex evolving system that is very sensitive to economic instabilities. The complex organization of the market can be represented in a suitable fashion in terms of complex networks, which can be constructed from stock prices such that each pair of stocks is connected by a weighted edge that encodes the distance between them. In this work, we propose an approach to analyze the topological and dynamic evolution of financial networks based on the stock correlation matrices. An entropy-related measurement is adopted to quantify the robustness of the evolving financial market organization. It is verified that the network topological organization suffers strong variation during financial instabilities and the networks in such periods become less robust. A statistical robust regression model is proposed to quantity the relationship between the network structure and resilience. The obtained coefficients of such model indicate that the average shortest path length is the measurement most related to network resilience coefficient. This result indicates that a collective behavior is observed between stocks during financial crisis. More specifically, stocks tend to synchronize their price evolution, leading to a high correlation between pair of stock prices, which contributes to the increase in distance between them and, consequently, decrease the network resilience.

  14. Emergence of Slow-Switching Assemblies in Structured Neuronal Networks.

    Science.gov (United States)

    Schaub, Michael T; Billeh, Yazan N; Anastassiou, Costas A; Koch, Christof; Barahona, Mauricio

    2015-07-01

    Unraveling the interplay between connectivity and spatio-temporal dynamics in neuronal networks is a key step to advance our understanding of neuronal information processing. Here we investigate how particular features of network connectivity underpin the propensity of neural networks to generate slow-switching assembly (SSA) dynamics, i.e., sustained epochs of increased firing within assemblies of neurons which transition slowly between different assemblies throughout the network. We show that the emergence of SSA activity is linked to spectral properties of the asymmetric synaptic weight matrix. In particular, the leading eigenvalues that dictate the slow dynamics exhibit a gap with respect to the bulk of the spectrum, and the associated Schur vectors exhibit a measure of block-localization on groups of neurons, thus resulting in coherent dynamical activity on those groups. Through simple rate models, we gain analytical understanding of the origin and importance of the spectral gap, and use these insights to develop new network topologies with alternative connectivity paradigms which also display SSA activity. Specifically, SSA dynamics involving excitatory and inhibitory neurons can be achieved by modifying the connectivity patterns between both types of neurons. We also show that SSA activity can occur at multiple timescales reflecting a hierarchy in the connectivity, and demonstrate the emergence of SSA in small-world like networks. Our work provides a step towards understanding how network structure (uncovered through advancements in neuroanatomy and connectomics) can impact on spatio-temporal neural activity and constrain the resulting dynamics.

  15. Online social network size is reflected in human brain structure.

    Science.gov (United States)

    Kanai, R; Bahrami, B; Roylance, R; Rees, G

    2012-04-07

    The increasing ubiquity of web-based social networking services is a striking feature of modern human society. The degree to which individuals participate in these networks varies substantially for reasons that are unclear. Here, we show a biological basis for such variability by demonstrating that quantitative variation in the number of friends an individual declares on a web-based social networking service reliably predicted grey matter density in the right superior temporal sulcus, left middle temporal gyrus and entorhinal cortex. Such regions have been previously implicated in social perception and associative memory, respectively. We further show that variability in the size of such online friendship networks was significantly correlated with the size of more intimate real-world social groups. However, the brain regions we identified were specifically associated with online social network size, whereas the grey matter density of the amygdala was correlated both with online and real-world social network sizes. Taken together, our findings demonstrate that the size of an individual's online social network is closely linked to focal brain structure implicated in social cognition.

  16. Unifying Inference of Meso-Scale Structures in Networks.

    Directory of Open Access Journals (Sweden)

    Birkan Tunç

    Full Text Available Networks are among the most prevalent formal representations in scientific studies, employed to depict interactions between objects such as molecules, neuronal clusters, or social groups. Studies performed at meso-scale that involve grouping of objects based on their distinctive interaction patterns form one of the main lines of investigation in network science. In a social network, for instance, meso-scale structures can correspond to isolated social groupings or groups of individuals that serve as a communication core. Currently, the research on different meso-scale structures such as community and core-periphery structures has been conducted via independent approaches, which precludes the possibility of an algorithmic design that can handle multiple meso-scale structures and deciding which structure explains the observed data better. In this study, we propose a unified formulation for the algorithmic detection and analysis of different meso-scale structures. This facilitates the investigation of hybrid structures that capture the interplay between multiple meso-scale structures and statistical comparison of competing structures, all of which have been hitherto unavailable. We demonstrate the applicability of the methodology in analyzing the human brain network, by determining the dominant organizational structure (communities of the brain, as well as its auxiliary characteristics (core-periphery.

  17. Unifying Inference of Meso-Scale Structures in Networks.

    Science.gov (United States)

    Tunç, Birkan; Verma, Ragini

    2015-01-01

    Networks are among the most prevalent formal representations in scientific studies, employed to depict interactions between objects such as molecules, neuronal clusters, or social groups. Studies performed at meso-scale that involve grouping of objects based on their distinctive interaction patterns form one of the main lines of investigation in network science. In a social network, for instance, meso-scale structures can correspond to isolated social groupings or groups of individuals that serve as a communication core. Currently, the research on different meso-scale structures such as community and core-periphery structures has been conducted via independent approaches, which precludes the possibility of an algorithmic design that can handle multiple meso-scale structures and deciding which structure explains the observed data better. In this study, we propose a unified formulation for the algorithmic detection and analysis of different meso-scale structures. This facilitates the investigation of hybrid structures that capture the interplay between multiple meso-scale structures and statistical comparison of competing structures, all of which have been hitherto unavailable. We demonstrate the applicability of the methodology in analyzing the human brain network, by determining the dominant organizational structure (communities) of the brain, as well as its auxiliary characteristics (core-periphery).

  18. Network Frontier Workshop 2013

    Science.gov (United States)

    2014-11-11

    networks, biological networks, cognitive and semantic networks and social networks. This field has received a major boost caused by the availability of huge...networks, which require new ways of thinking about the world. Part of the new cognition is provided by the fractional calculus description of temporal...structures in a wide range of examples—including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network

  19. Bayesian network structure learning using chaos hybrid genetic algorithm

    Science.gov (United States)

    Shen, Jiajie; Lin, Feng; Sun, Wei; Chang, KC

    2012-06-01

    A new Bayesian network (BN) learning method using a hybrid algorithm and chaos theory is proposed. The principles of mutation and crossover in genetic algorithm and the cloud-based adaptive inertia weight were incorporated into the proposed simple particle swarm optimization (sPSO) algorithm to achieve better diversity, and improve the convergence speed. By means of ergodicity and randomicity of chaos algorithm, the initial network structure population is generated by using chaotic mapping with uniform search under structure constraints. When the algorithm converges to a local minimal, a chaotic searching is started to skip the local minima and to identify a potentially better network structure. The experiment results show that this algorithm can be effectively used for BN structure learning.

  20. Structural parameter identifiability analysis for dynamic reaction networks

    DEFF Research Database (Denmark)

    Davidescu, Florin Paul; Jørgensen, Sten Bay

    2008-01-01

    where for a given set of measured variables it is desirable to investigate which parameters may be estimated prior to spending computational effort on the actual estimation. This contribution addresses the structural parameter identifiability problem for the typical case of reaction network models....... The proposed analysis is performed in two phases. The first phase determines the structurally identifiable reaction rates based on reaction network stoichiometry. The second phase assesses the structural parameter identifiability of the specific kinetic rate expressions using a generating series expansion...... method based on Lie derivatives. The proposed systematic two phase methodology is illustrated on a mass action based model for an enzymatically catalyzed reaction pathway network where only a limited set of variables is measured. The methodology clearly pinpoints the structurally identifiable parameters...

  1. Offspring social network structure predicts fitness in families.

    Science.gov (United States)

    Royle, Nick J; Pike, Thomas W; Heeb, Philipp; Richner, Heinz; Kölliker, Mathias

    2012-12-22

    Social structures such as families emerge as outcomes of behavioural interactions among individuals, and can evolve over time if families with particular types of social structures tend to leave more individuals in subsequent generations. The social behaviour of interacting individuals is typically analysed as a series of multiple dyadic (pair-wise) interactions, rather than a network of interactions among multiple individuals. However, in species where parents feed dependant young, interactions within families nearly always involve more than two individuals simultaneously. Such social networks of interactions at least partly reflect conflicts of interest over the provision of costly parental investment. Consequently, variation in family network structure reflects variation in how conflicts of interest are resolved among family members. Despite its importance in understanding the evolution of emergent properties of social organization such as family life and cooperation, nothing is currently known about how selection acts on the structure of social networks. Here, we show that the social network structure of broods of begging nestling great tits Parus major predicts fitness in families. Although selection at the level of the individual favours large nestlings, selection at the level of the kin-group primarily favours families that resolve conflicts most effectively.

  2. Anthropogenic impacts on tropical forest biodiversity: a network structure and ecosystem functioning perspective

    National Research Council Canada - National Science Library

    Rebecca J. Morris

    2010-01-01

    ... are organized in networks, and the function that those species perform. I discuss our current knowledge of network structure and ecosystem functioning, highlighting empirical examples of their response...

  3. Graph kernels, hierarchical clustering, and network community structure: experiments and comparative analysis

    Science.gov (United States)

    Zhang, S.; Ning, X.-M.; Zhang, X.-S.

    2007-05-01

    There has been a quickly growing interest in properties of complex networks, such as the small world property, power-law degree distribution, network transitivity, and community structure, which seem to be common to many real world networks. In this study, we consider the community property which is also found in many real networks. Based on the diffusion kernels of networks, a hierarchical clustering approach is proposed to uncover the community structure of different extent of complex networks. We test the method on some networks with known community structures and find that it can detect significant community structure in these networks. Comparison with related methods shows the effectiveness of the method.

  4. Direct Adaptive Aircraft Control Using Dynamic Cell Structure Neural Networks

    Science.gov (United States)

    Jorgensen, Charles C.

    1997-01-01

    A Dynamic Cell Structure (DCS) Neural Network was developed which learns topology representing networks (TRNS) of F-15 aircraft aerodynamic stability and control derivatives. The network is integrated into a direct adaptive tracking controller. The combination produces a robust adaptive architecture capable of handling multiple accident and off- nominal flight scenarios. This paper describes the DCS network and modifications to the parameter estimation procedure. The work represents one step towards an integrated real-time reconfiguration control architecture for rapid prototyping of new aircraft designs. Performance was evaluated using three off-line benchmarks and on-line nonlinear Virtual Reality simulation. Flight control was evaluated under scenarios including differential stabilator lock, soft sensor failure, control and stability derivative variations, and air turbulence.

  5. A Simplified Mobile Ad Hoc Network Structure for Helicopter Communication

    Directory of Open Access Journals (Sweden)

    Abdeldime Mohamed Salih Abdelgader

    2016-01-01

    Full Text Available There are a number of volunteer and statutory organizations who are capable of conducting an emergency response using helicopters. Rescue operations require a rapidly deployable high bandwidth network to coordinate necessary relief efforts between rescue teams on the ground and helicopters. Due to massive destruction and loss of services, ordinary communication infrastructures may collapse in these situations. Consequently, information exchange becomes one of the major challenges in these circumstances. Helicopters can be also employed for providing many services in rugged environments, military applications, and aerial photography. Ad hoc network can be used to provide alternative communication link between a set of helicopters, particularly in case of significant amount of data required to be shared. This paper addresses the ability of using ad hoc networks to support the communication between a set of helicopters. A simplified network structure model is presented and extensively discussed. Furthermore, a streamlined routing algorithm is proposed. Comprehensive simulations are conducted to evaluate the proposed routing algorithm.

  6. Structure and Controls of the Global Virtual Water Trade Network

    Science.gov (United States)

    Suweis, S. S.

    2011-12-01

    Recurrent or ephemeral water shortages are a crucial global challenge, in particular because of their impacts on food production. The global character of this challenge is reflected in the trade among nations of virtual water, i.e. the amount of water used to produce a given commodity. We build, analyze and model the network describing the transfer of virtual water between world nations for staple food products. We find that all the key features of the network are well described by a model, the fitness model, that reproduces both the topological and weighted properties of the global virtual water trade network, by assuming as sole controls each country's gross domestic product and yearly rainfall on agricultural areas. We capture and quantitatively describe the high degree of globalization of water trade and show that a small group of nations play a key role in the connectivity of the network and in the global redistribution of virtual water. Finally, we illustrate examples of prediction of the structure of the network under future political, economic and climatic scenarios, suggesting that the crucial importance of the countries that trade large volumes of water will be strengthened. Our results show the importance of incorporating a network framework in the study of virtual water trades and provide a model to study the structure and resilience of the GVWTN under future scenarios for social, economic and climate change.

  7. A clustering algorithm for determining community structure in complex networks

    Science.gov (United States)

    Jin, Hong; Yu, Wei; Li, ShiJun

    2018-02-01

    Clustering algorithms are attractive for the task of community detection in complex networks. DENCLUE is a representative density based clustering algorithm which has a firm mathematical basis and good clustering properties allowing for arbitrarily shaped clusters in high dimensional datasets. However, this method cannot be directly applied to community discovering due to its inability to deal with network data. Moreover, it requires a careful selection of the density parameter and the noise threshold. To solve these issues, a new community detection method is proposed in this paper. First, we use a spectral analysis technique to map the network data into a low dimensional Euclidean Space which can preserve node structural characteristics. Then, DENCLUE is applied to detect the communities in the network. A mathematical method named Sheather-Jones plug-in is chosen to select the density parameter which can describe the intrinsic clustering structure accurately. Moreover, every node on the network is meaningful so there were no noise nodes as a result the noise threshold can be ignored. We test our algorithm on both benchmark and real-life networks, and the results demonstrate the effectiveness of our algorithm over other popularity density based clustering algorithms adopted to community detection.

  8. Comparing and Selecting Generalized Double Ring Network Structures

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun

    2004-01-01

    N2R(p;q) network structures were introduced recently as a generalization of double rings, and they were shown to be superior compared to double rings in terms of average distance and diameter. For a given number of nodes, there is only one double ring, but often more different N2R(p;q) structures...

  9. Scalable, ultra-resistant structural colors based on network metamaterials

    CERN Document Server

    Galinski, Henning; Dong, Hao; Gongora, Juan S Totero; Favaro, Grégory; Döbeli, Max; Spolenak, Ralph; Fratalocchi, Andrea; Capasso, Federico

    2016-01-01

    Structural colours have drawn wide attention for their potential as a future printing technology for various applications, ranging from biomimetic tissues to adaptive camouflage materials. However, an efficient approach to realise robust colours with a scalable fabrication technique is still lacking, hampering the realisation of practical applications with this platform. Here we develop a new approach based on large scale network metamaterials, which combine dealloyed subwavelength structures at the nanoscale with loss-less, ultra-thin dielectrics coatings. By using theory and experiments, we show how sub-wavelength dielectric coatings control a mechanism of resonant light coupling with epsilon-near-zero (ENZ) regions generated in the metallic network, manifesting the formation of highly saturated structural colours that cover a wide portion of the spectrum. Ellipsometry measurements report the efficient observation of these colours even at angles of $70$ degrees. The network-like architecture of these nanoma...

  10. Structure analysis of growing network based on partial differential equations

    Directory of Open Access Journals (Sweden)

    Junbo JIA

    2016-04-01

    Full Text Available The topological structure is one of the most important contents in the complex network research. Therein the node degree and the degree distribution are the most basic characteristic quantities to describe topological structure. In order to calculate the degree distribution, first of all, the node degree is considered as a continuous variable. Then, according to the Markov Property of growing network, the cumulative distribution function's evolution equation with time can be obtained. Finally, the partial differential equation (PDE model can be established through distortion processing. Taking the growing network with preferential and random attachment mechanism as an example, the PDE model is obtained. The analytic expression of degree distribution is obtained when this model is solved. Besides, the degree function over time is the same as the characteristic line of PDE. At last, the model is simulated. This PDE method of changing the degree distribution calculation into problem of solving PDE makes the structure analysis more accurate.

  11. The interplay between microscopic and mesoscopic structures in complex networks.

    Directory of Open Access Journals (Sweden)

    Jörg Reichardt

    Full Text Available Understanding a complex network's structure holds the key to understanding its function. The physics community has contributed a multitude of methods and analyses to this cross-disciplinary endeavor. Structural features exist on both the microscopic level, resulting from differences between single node properties, and the mesoscopic level resulting from properties shared by groups of nodes. Disentangling the determinants of network structure on these different scales has remained a major, and so far unsolved, challenge. Here we show how multiscale generative probabilistic exponential random graph models combined with efficient, distributive message-passing inference techniques can be used to achieve this separation of scales, leading to improved detection accuracy of latent classes as demonstrated on benchmark problems. It sheds new light on the statistical significance of motif-distributions in neural networks and improves the link-prediction accuracy as exemplified for gene-disease associations in the highly consequential Online Mendelian Inheritance in Man database.

  12. Netter: re-ranking gene network inference predictions using structural network properties.

    Science.gov (United States)

    Ruyssinck, Joeri; Demeester, Piet; Dhaene, Tom; Saeys, Yvan

    2016-02-09

    Many algorithms have been developed to infer the topology of gene regulatory networks from gene expression data. These methods typically produce a ranking of links between genes with associated confidence scores, after which a certain threshold is chosen to produce the inferred topology. However, the structural properties of the predicted network do not resemble those typical for a gene regulatory network, as most algorithms only take into account connections found in the data and do not include known graph properties in their inference process. This lowers the prediction accuracy of these methods, limiting their usability in practice. We propose a post-processing algorithm which is applicable to any confidence ranking of regulatory interactions obtained from a network inference method which can use, inter alia, graphlets and several graph-invariant properties to re-rank the links into a more accurate prediction. To demonstrate the potential of our approach, we re-rank predictions of six different state-of-the-art algorithms using three simple network properties as optimization criteria and show that Netter can improve the predictions made on both artificially generated data as well as the DREAM4 and DREAM5 benchmarks. Additionally, the DREAM5 E.coli. community prediction inferred from real expression data is further improved. Furthermore, Netter compares favorably to other post-processing algorithms and is not restricted to correlation-like predictions. Lastly, we demonstrate that the performance increase is robust for a wide range of parameter settings. Netter is available at http://bioinformatics.intec.ugent.be. Network inference from high-throughput data is a long-standing challenge. In this work, we present Netter, which can further refine network predictions based on a set of user-defined graph properties. Netter is a flexible system which can be applied in unison with any method producing a ranking from omics data. It can be tailored to specific prior

  13. The Relation Between Structure and Function in Brain Networks : A network science perspective

    NARCIS (Netherlands)

    Meier, J.M.

    2017-01-01

    Over the last two decades the field of network science has been evolving fast. Many useful applications in a wide variety of disciplines have been found. The application of network science to the brain initiated the interdisciplinary field of complex brain networks. On a macroscopic level, brain

  14. Changing the network structure: leaving the past behind

    Science.gov (United States)

    Herber, Ralf

    2010-01-01

    The infrastructure of the existing network is determined by the old copper access technology. Not only the copper access itself, also the number of central offices and their geographical distribution are results of the copper network and its physical limitations. Today, in Germany, several thousand active locations cater for the delivery of plain old telephony services, as well as for the delivery of new fiber-based broadband services. Due to the fact that the attenuation of optical fibers is relatively low, new concepts for the design of the network structure become possible and are discussed in this paper. A reach of 40 km, for example, on an optical transport system is no problem. Longer possible link lengths can result in a reduced number of central offices, leading to reduced expenditures for the building, power supply and air conditioning. In the case of Germany a number of some hundred central offices is envisaged. However, a significant drawback of today's existing optical access technologies is the very limited number of customers on a single fiber. For instance, GPON (Gigabit Passive Optical Network) provides typically a 32-way split and a distance of 20 km. This paper discusses some new ideas to introduce higher splitting ratios and longer access lengths into the network. With WDM (Wavelength Division Multiplexing) and/or coherent optical receivers new options for a future proof access network are available.

  15. Probabilistic diffusion tractography reveals improvement of structural network in musicians.

    Science.gov (United States)

    Li, Jianfu; Luo, Cheng; Peng, Yueheng; Xie, Qiankun; Gong, Jinnan; Dong, Li; Lai, Yongxiu; Li, Hong; Yao, Dezhong

    2014-01-01

    Musicians experience a large amount of information transfer and integration of complex sensory, motor, and auditory processes when training and playing musical instruments. Therefore, musicians are a useful model in which to investigate neural adaptations in the brain. Here, based on diffusion-weighted imaging, probabilistic tractography was used to determine the architecture of white matter anatomical networks in musicians and non-musicians. Furthermore, the features of the white matter networks were analyzed using graph theory. Small-world properties of the white matter network were observed in both groups. Compared with non-musicians, the musicians exhibited significantly increased connectivity strength in the left and right supplementary motor areas, the left calcarine fissure and surrounding cortex and the right caudate nucleus, as well as a significantly larger weighted clustering coefficient in the right olfactory cortex, the left medial superior frontal gyrus, the right gyrus rectus, the left lingual gyrus, the left supramarginal gyrus, and the right pallidum. Furthermore, there were differences in the node betweenness centrality in several regions. However, no significant differences in topological properties were observed at a global level. We illustrated preliminary findings to extend the network level understanding of white matter plasticity in musicians who have had long-term musical training. These structural, network-based findings may indicate that musicians have enhanced information transmission efficiencies in local white matter networks that are related to musical training.

  16. Probabilistic diffusion tractography reveals improvement of structural network in musicians.

    Directory of Open Access Journals (Sweden)

    Jianfu Li

    Full Text Available PURPOSE: Musicians experience a large amount of information transfer and integration of complex sensory, motor, and auditory processes when training and playing musical instruments. Therefore, musicians are a useful model in which to investigate neural adaptations in the brain. METHODS: Here, based on diffusion-weighted imaging, probabilistic tractography was used to determine the architecture of white matter anatomical networks in musicians and non-musicians. Furthermore, the features of the white matter networks were analyzed using graph theory. RESULTS: Small-world properties of the white matter network were observed in both groups. Compared with non-musicians, the musicians exhibited significantly increased connectivity strength in the left and right supplementary motor areas, the left calcarine fissure and surrounding cortex and the right caudate nucleus, as well as a significantly larger weighted clustering coefficient in the right olfactory cortex, the left medial superior frontal gyrus, the right gyrus rectus, the left lingual gyrus, the left supramarginal gyrus, and the right pallidum. Furthermore, there were differences in the node betweenness centrality in several regions. However, no significant differences in topological properties were observed at a global level. CONCLUSIONS: We illustrated preliminary findings to extend the network level understanding of white matter plasticity in musicians who have had long-term musical training. These structural, network-based findings may indicate that musicians have enhanced information transmission efficiencies in local white matter networks that are related to musical training.

  17. Learning Orthographic Structure With Sequential Generative Neural Networks.

    Science.gov (United States)

    Testolin, Alberto; Stoianov, Ivilin; Sperduti, Alessandro; Zorzi, Marco

    2016-04-01

    Learning the structure of event sequences is a ubiquitous problem in cognition and particularly in language. One possible solution is to learn a probabilistic generative model of sequences that allows making predictions about upcoming events. Though appealing from a neurobiological standpoint, this approach is typically not pursued in connectionist modeling. Here, we investigated a sequential version of the restricted Boltzmann machine (RBM), a stochastic recurrent neural network that extracts high-order structure from sensory data through unsupervised generative learning and can encode contextual information in the form of internal, distributed representations. We assessed whether this type of network can extract the orthographic structure of English monosyllables by learning a generative model of the letter sequences forming a word training corpus. We show that the network learned an accurate probabilistic model of English graphotactics, which can be used to make predictions about the letter following a given context as well as to autonomously generate high-quality pseudowords. The model was compared to an extended version of simple recurrent networks, augmented with a stochastic process that allows autonomous generation of sequences, and to non-connectionist probabilistic models (n-grams and hidden Markov models). We conclude that sequential RBMs and stochastic simple recurrent networks are promising candidates for modeling cognition in the temporal domain. Copyright © 2015 Cognitive Science Society, Inc.

  18. Modelling sequences and temporal networks with dynamic community structures.

    Science.gov (United States)

    Peixoto, Tiago P; Rosvall, Martin

    2017-09-19

    In evolving complex systems such as air traffic and social organisations, collective effects emerge from their many components' dynamic interactions. While the dynamic interactions can be represented by temporal networks with nodes and links that change over time, they remain highly complex. It is therefore often necessary to use methods that extract the temporal networks' large-scale dynamic community structure. However, such methods are subject to overfitting or suffer from effects of arbitrary, a priori-imposed timescales, which should instead be extracted from data. Here we simultaneously address both problems and develop a principled data-driven method that determines relevant timescales and identifies patterns of dynamics that take place on networks, as well as shape the networks themselves. We base our method on an arbitrary-order Markov chain model with community structure, and develop a nonparametric Bayesian inference framework that identifies the simplest such model that can explain temporal interaction data.The description of temporal networks is usually simplified in terms of their dynamic community structures, whose identification however relies on a priori assumptions. Here the authors present a data-driven method that determines relevant timescales for the dynamics and uses it to identify communities.

  19. Age structure and cooperation in coevolutionary games on dynamic network

    Science.gov (United States)

    Qin, Zilong; Hu, Zhenhua; Zhou, Xiaoping; Yi, Jingzhang

    2015-04-01

    Our proposed model imitates the growth of a population and describes the age structure and the level of cooperation in games on dynamic network with continuous changes of structure and topology. The removal of nodes and links caused by age-dependent attack, together with the nodes addition standing for the newborns of population, badly ruins Matthew effect in this coevolutionary process. Though the network is generated by growth and preferential attachment, it degenerates into random network and it is no longer heterogeneous. When the removal of nodes and links is equal to the addition of nodes and links, the size of dynamic network is maintained in steady-state, so is the low level of cooperation. Severe structure variation, homogeneous topology and continuous invasion of new defection jointly make dynamic network unsuitable for the survival of cooperator even when the probability with which the newborn players initially adopt the strategy cooperation is high, while things change slightly when the connections of newborn players are restricted. Fortunately, moderate interactions in a generation trigger an optimal recovering process to encourage cooperation. The model developed in this paper outlines an explanation of the cohesion changes in the development process of an organization. Some suggestions for cooperative behavior improvement are given in the end.

  20. Jury-Contestant Bipartite Competition Network: Identifying Biased Scores and Their Impact on Network Structure Inference

    CERN Document Server

    Jeon, Gyuhyeon

    2016-01-01

    A common form of competition is one where judges grade contestants' performances which are then compiled to determine the final ranking of the contestants. Unlike in another common form of competition where two contestants play a head-to-head match to produce a winner as in football or basketball, the objectivity of judges are prone to be questioned, potentially undermining the public's trust in the fairness of the competition. In this work we show, by modeling the judge--contestant competition as a weighted bipartite network, how we can identify biased scores and measure their impact on our inference of the network structure. Analyzing the prestigious International Chopin Piano Competition of 2015 with a well-publicized scoring controversy as an example, we show that even a single statistically uncharacteristic score can be enough to gravely distort our inference of the community structure, demonstrating the importance of detecting and eliminating biases. In the process we also find that there does not exist...

  1. Structure and evolution of the global seafood trade network

    Science.gov (United States)

    Gephart, Jessica A.; Pace, Michael L.

    2015-12-01

    The food production system is increasingly global and seafood is among the most highly traded commodities. Global trade can improve food security by providing access to a greater variety of foods, increasing wealth, buffering against local supply shocks, and benefit the environment by increasing overall use efficiency for some resources. However, global trade can also expose countries to external supply shocks and degrade the environment by increasing resource demand and loosening feedbacks between consumers and the impacts of food production. As a result, changes in global food trade can have important implications for both food security and the environmental impacts of production. Measurements of globalization and the environmental impacts of food production require data on both total trade and the origin and destination of traded goods (the network structure). While the global trade network of agricultural and livestock products has previously been studied, seafood products have been excluded. This study describes the structure and evolution of the global seafood trade network, including metrics quantifying the globalization of seafood, shifts in bilateral trade flows, changes in centrality and comparisons of seafood to agricultural and industrial trade networks. From 1994 to 2012 the number of countries trading in the network remained relatively constant, while the number of trade partnerships increased by over 65%. Over this same period, the total quantity of seafood traded increased by 58% and the value increased 85% in real terms. These changes signify the increasing globalization of seafood products. Additionally, the trade patterns in the network indicate: increased influence of Thailand and China, strengthened intraregional trade, and increased exports from South America and Asia. In addition to characterizing these network changes, this study identifies data needs in order to connect seafood trade with environmental impacts and food security outcomes.

  2. Analyzing the multilevel structure of the European airport network

    Directory of Open Access Journals (Sweden)

    Oriol Lordan

    2017-04-01

    Full Text Available The multilayered structure of the European airport network (EAN, composed of connections and flights between European cities, is analyzed through the k-core decomposition of the connections network. This decomposition allows to identify the core, bridge and periphery layers of the EAN. The core layer includes the best-connected cities, which include important business air traffic destinations. The periphery layer includes cities with lesser connections, which serve low populated areas where air travel is an economic alternative. The remaining cities form the bridge of the EAN, including important leisure travel origins and destinations. The multilayered structure of the EAN affects network robustness, as the EAN is more robust to isolation of nodes of the core, than to the isolation of a combination of core and bridge nodes.

  3. The network structure of city-firm relations

    CERN Document Server

    Garas, Antonios; Schweitzer, Frank

    2015-01-01

    How are economic activities linked to geographic locations? To answer this question, we use a data-driven approach that builds on the information about location, ownership and economic activities of the world's 3,000 largest firms and their almost one million subsidiaries. From this information we generate a bipartite network of cities linked to economic activities. Analysing the structure of this network, we find striking similarities with nested networks observed in ecology, where links represent mutualistic interactions between species. This motivates us to apply ecological indicators to identify the unbalanced deployment of economic activities. Such deployment can lead to an over-representation of specific economic sectors in a given city, and poses a significant thread for the city's future especially in times when the over-represented activities face economic uncertainties. If we compare our analysis with external rankings about the quality of life in a city, we find that the nested structure of the cit...

  4. Structure-based control of complex networks with nonlinear dynamics

    CERN Document Server

    Zañudo, Jorge G T; Albert, Réka

    2016-01-01

    Given the network of interactions underlying a complex system, what can we learn about controlling such a system solely from its structure? Over a century of research in control theory has given us tools to answer this question, which were widely applied in science and engineering. Yet the current tools do not always consider the inherently nonlinear dynamics of real systems and the naturally occurring system states in their definition of "control", a term whose interpretation varies across disciplines. Here we use a new mathematical framework for structure-based control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This framework provides realizable node overrides that steer a system towards any of its natural long term dynamic behaviors and which are guaranteed to be effective regardless of the dynamic details and parameters of the underlying system. We use this framework on several real networks, compar...

  5. Mass media influence spreading in social networks with community structure

    Science.gov (United States)

    Candia, Julián; Mazzitello, Karina I.

    2008-07-01

    We study an extension of Axelrod's model for social influence, in which cultural drift is represented as random perturbations, while mass media are introduced by means of an external field. In this scenario, we investigate how the modular structure of social networks affects the propagation of mass media messages across a society. The community structure of social networks is represented by coupled random networks, in which two random graphs are connected by intercommunity links. Considering inhomogeneous mass media fields, we study the conditions for successful message spreading and find a novel phase diagram in the multidimensional parameter space. These findings show that social modularity effects are of paramount importance for designing successful, cost-effective advertising campaigns.

  6. Declarative Networking

    CERN Document Server

    Loo, Boon Thau

    2012-01-01

    Declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. Declarative networking proposes the use of a declarative query language for specifying and implementing network protocols, and employs a dataflow framework at runtime for communication and maintenance of network state. The primary goal of declarative networking is to greatly simplify the process of specifying, implementing, deploying and evolving a network design. In addition, decla

  7. Structural Properties of the Brazilian Air Transportation Network

    Directory of Open Access Journals (Sweden)

    GUILHERME S. COUTO

    2015-09-01

    Full Text Available The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.

  8. Automated analysis of Physarum network structure and dynamics

    Science.gov (United States)

    Fricker, Mark D.; Akita, Dai; Heaton, Luke LM; Jones, Nick; Obara, Boguslaw; Nakagaki, Toshiyuki

    2017-06-01

    We evaluate different ridge-enhancement and segmentation methods to automatically extract the network architecture from time-series of Physarum plasmodia withdrawing from an arena via a single exit. Whilst all methods gave reasonable results, judged by precision-recall analysis against a ground-truth skeleton, the mean phase angle (Feature Type) from intensity-independent, phase-congruency edge enhancement and watershed segmentation was the most robust to variation in threshold parameters. The resultant single pixel-wide segmented skeleton was converted to a graph representation as a set of weighted adjacency matrices containing the physical dimensions of each vein, and the inter-vein regions. We encapsulate the complete image processing and network analysis pipeline in a downloadable software package, and provide an extensive set of metrics that characterise the network structure, including hierarchical loop decomposition to analyse the nested structure of the developing network. In addition, the change in volume for each vein and intervening plasmodial sheet was used to predict the net flow across the network. The scaling relationships between predicted current, speed and shear force with vein radius were consistent with predictions from Murray’s law. This work was presented at PhysNet 2015.

  9. Topological Analysis of Network Structures in Three Dimensions

    Science.gov (United States)

    Glicksman, Martin E.

    2004-03-01

    Kinetics, topology, integral and differential geometry are combined to impose space-filling requirements on network structures. The theory centers on representing network cells as "average N-hedra," with curvatures and dihedral angles that satisfy thermodynamic equilibria at contact faces, triple lines and quadrajunctions. Exact kinetic relations are derived for average N-hedra that accurately predict the volumetric and areal time-rates of change for irregular polyhedral cells that comprise constructible network microstructures. The new results extend to three dimensions the von Neumann-Mullins law, which provides the well-known topologically-based kinetic relation valid for tessellations in 2-d Kinetic laws derived for here for 3-d may prove useful for constructing more accurate models of grain growth and foam coarsening, and for clarifying several long-standing general issues on space-filling criteria required for three-dimensional network structures. Comparisons will be shown between foams and isolated N-hedra, modeled recently using Surface Evolver simulations, and predictions from the new analytical results and other theoretical estimates. The availability of an exact analytic kinetic law provides benchmarks for testing simulations and for guiding quantitative experiments on network dynamics in three-dimensional microstructures. * The Author gives his special thanks for the financial assistance obtained from the Alexander von Humboldt Stiftung, as a Forschungs Preissträger, and for scientific support so generously provided at the Institut für Metallkunde und Metallphysik, RWTH-Aachen.

  10. Effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons

    Energy Technology Data Exchange (ETDEWEB)

    Li, Chun-Hsien, E-mail: chli@nknucc.nknu.edu.tw [Department of Mathematics, National Kaohsiung Normal University, Yanchao District, Kaohsiung City 82444, Taiwan (China); Yang, Suh-Yuh, E-mail: syyang@math.ncu.edu.tw [Department of Mathematics, National Central University, Jhongli District, Taoyuan City 32001, Taiwan (China)

    2015-10-23

    This work is devoted to investigate the effects of network structure on the synchronizability of nonlinearly coupled dynamical network of Hindmarsh–Rose neurons with a sigmoidal coupling function. We mainly focus on the networks that exhibit the small-world character or scale-free property. By checking the first nonzero eigenvalue of the outer-coupling matrix, which is closely related to the synchronization threshold, the synchronizabilities of three specific network ensembles with prescribed network structures are compared. Interestingly, we find that networks with more connections will not necessarily result in better synchronizability. - Highlights: • We investigate the effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons. • We mainly consider the networks that exhibit the small-world character or scale-free property. • The synchronizability of three specific network ensembles with prescribed network structures are compared. • Networks with more connections will not necessarily result in better synchronizability.

  11. Structure Learning for Deep Neural Networks Based on Multiobjective Optimization.

    Science.gov (United States)

    Liu, Jia; Gong, Maoguo; Miao, Qiguang; Wang, Xiaogang; Li, Hao

    2017-05-05

    This paper focuses on the connecting structure of deep neural networks and proposes a layerwise structure learning method based on multiobjective optimization. A model with better generalization can be obtained by reducing the connecting parameters in deep networks. The aim is to find the optimal structure with high representation ability and better generalization for each layer. Then, the visible data are modeled with respect to structure based on the products of experts. In order to mitigate the difficulty of estimating the denominator in PoE, the denominator is simplified and taken as another objective, i.e., the connecting sparsity. Moreover, for the consideration of the contradictory nature between the representation ability and the network connecting sparsity, the multiobjective model is established. An improved multiobjective evolutionary algorithm is used to solve this model. Two tricks are designed to decrease the computational cost according to the properties of input data. The experiments on single-layer level, hierarchical level, and application level demonstrate the effectiveness of the proposed algorithm, and the learned structures can improve the performance of deep neural networks.

  12. Network structure detection and analysis of Shanghai stock market

    Directory of Open Access Journals (Sweden)

    Sen Wu

    2015-04-01

    Full Text Available Purpose: In order to investigate community structure of the component stocks of SSE (Shanghai Stock Exchange 180-index, a stock correlation network is built to find the intra-community and inter-community relationship. Design/methodology/approach: The stock correlation network is built taking the vertices as stocks and edges as correlation coefficients of logarithm returns of stock price. It is built as undirected weighted at first. GN algorithm is selected to detect community structure after transferring the network into un-weighted with different thresholds. Findings: The result of the network community structure analysis shows that the stock market has obvious industrial characteristics. Most of the stocks in the same industry or in the same supply chain are assigned to the same community. The correlation of the internal stock prices’ fluctuation is closer than in different communities. The result of community structure detection also reflects correlations among different industries. Originality/value: Based on the analysis of the community structure in Shanghai stock market, the result reflects some industrial characteristics, which has reference value to relationship among industries or sub-sectors of listed companies.

  13. Fundamentals of complex networks models, structures and dynamics

    CERN Document Server

    Chen, Guanrong; Li, Xiang

    2014-01-01

    Complex networks such as the Internet, WWW, transportationnetworks, power grids, biological neural networks, and scientificcooperation networks of all kinds provide challenges for futuretechnological development. In particular, advanced societies havebecome dependent on large infrastructural networks to an extentbeyond our capability to plan (modeling) and to operate (control).The recent spate of collapses in power grids and ongoing virusattacks on the Internet illustrate the need for knowledge aboutmodeling, analysis of behaviors, optimized planning and performancecontrol in such networks. F

  14. Neural networks for harmonic structure in music perception and action

    OpenAIRE

    Bianco, R.; Novembre, G.; Keller, P. E.; Kim, S G; Scharf, F.; Friederici, A. D.; Villringer, A; Sammler, D.

    2016-01-01

    The ability to predict upcoming structured events based on long-term knowledge and contextual priors is a fundamental principle of human cognition. Tonal music triggers predictive processes based on structural properties of harmony, i.e., regularities defining the arrangement of chords into well-formed musical sequences. While the neural architecture of structure-based predictions during music perception is well described, little is known about the neural networks for analogous predictions in...

  15. Reduction of Second-Order Network Systems with Structure Preservation

    NARCIS (Netherlands)

    Cheng, Xiaodong; Kawano, Yu; Scherpen, Jacquelien M.A.

    2017-01-01

    This paper proposes a general framework for structure-preserving model reduction of a second-order network system based on graph clustering. In this approach, vertex dynamics are captured by the transfer functions from inputs to individual states, and the dissimilarities of vertices are quantified

  16. Geometric and Network Model for Knowledge Structure and Mindspace

    OpenAIRE

    Chris Arney

    2012-01-01

    This paper describes an adaptive, complex network architecture for knowledge representation in virtual mindspace. Structures and processes for knowing, remembering, thinking, learning, deciding, and communicating describe a virtual geometric space (mathematical model) of a notional mind. This mindspace model can be visualized as a workspace and this paper provides a glimpse of a virtual model of the mind.

  17. Geometric and Network Model for Knowledge Structure and Mindspace

    Directory of Open Access Journals (Sweden)

    Chris Arney

    2012-02-01

    Full Text Available This paper describes an adaptive, complex network architecture for knowledge representation in virtual mindspace. Structures and processes for knowing, remembering, thinking, learning, deciding, and communicating describe a virtual geometric space (mathematical model of a notional mind. This mindspace model can be visualized as a workspace and this paper provides a glimpse of a virtual model of the mind.

  18. Refinement of Bayesian Network Structures upon New Data

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Xiang, Yanping; Pacekajus, Saulius

    2010-01-01

    Refinement of Bayesian network (BN) structures using new data becomes more and more relevant. Some work has been done there; however, one problem has not been considered yet – what to do when new data have fewer or more attributes than the existing model. In both cases, data contain important...

  19. Deep Convolutional Neural Networks: Structure, Feature Extraction and Training

    Directory of Open Access Journals (Sweden)

    Namatēvs Ivars

    2017-12-01

    Full Text Available Deep convolutional neural networks (CNNs are aimed at processing data that have a known network like topology. They are widely used to recognise objects in images and diagnose patterns in time series data as well as in sensor data classification. The aim of the paper is to present theoretical and practical aspects of deep CNNs in terms of convolution operation, typical layers and basic methods to be used for training and learning. Some practical applications are included for signal and image classification. Finally, the present paper describes the proposed block structure of CNN for classifying crucial features from 3D sensor data.

  20. Revealing the hidden structure of dynamic ecological networks.

    Science.gov (United States)

    Miele, Vincent; Matias, Catherine

    2017-06-01

    In ecology, recent technological advances and long-term data studies now provide longitudinal interaction data (e.g. between individuals or species). Most often, time is the parameter along which interactions evolve but any other one-dimensional gradient (temperature, altitude, depth, humidity, etc.) can be considered. These data can be modelled through a sequence of different snapshots of an evolving ecological network, i.e. a dynamic network. Here, we present how the dynamic stochastic block model approach developed by Matias & Miele (Matias & Miele In press J. R. Stat. Soc. B (doi:10.1111/rssb.12200)) can capture the complexity and dynamics of these networks. First, we analyse a dynamic contact network of ants and we observe a clear high-level assembly with some variations in time at the individual level. Second, we explore the structure of a food web evolving during a year and we detect a stable predator-prey organization but also seasonal differences in the prey assemblage. Our approach, based on a rigorous statistical method implemented in the R package dynsbm, can pave the way for exploration of evolving ecological networks.

  1. Product Cost Management Structures: a review and neural network modelling

    Directory of Open Access Journals (Sweden)

    P. Jha

    2003-11-01

    Full Text Available This paper reviews the growth of approaches in product costing and draws synergies with information management and resource planning systems, to investigate potential application of state of the art modelling techniques of neural networks. Increasing demands on costing systems to serve multiple decision-making objectives, have made it essential to use better techniques for analysis of available data. This need is highlighted in the paper. The approach of neural networks, which have several analogous facets to complement and aid the information demands of modern product costing, Enterprise Resource Planning (ERP structures and the dominant-computing environment (for information management in the object oriented paradigm form the domain for investigation. Simulated data is used in neural network applications across activities that consume resources and deliver products, to generate information for monitoring and control decisions. The results in application for feature extraction and variation detection and their implications are presented in the paper.

  2. Automated Modeling of Microwave Structures by Enhanced Neural Networks

    Directory of Open Access Journals (Sweden)

    Z. Raida

    2006-12-01

    Full Text Available The paper describes the methodology of the automated creation of neural models of microwave structures. During the creation process, artificial neural networks are trained using the combination of the particle swarm optimization and the quasi-Newton method to avoid critical training problems of the conventional neural nets. In the paper, neural networks are used to approximate the behavior of a planar microwave filter (moment method, Zeland IE3D. In order to evaluate the efficiency of neural modeling, global optimizations are performed using numerical models and neural ones. Both approaches are compared from the viewpoint of CPU-time demands and the accuracy. Considering conclusions, methodological recommendations for including neural networks to the microwave design are formulated.

  3. Realization of Negative Group Delay Network Using Defected Microstrip Structure

    Directory of Open Access Journals (Sweden)

    Girdhari Chaudhary

    2014-01-01

    Full Text Available A design of negative group delay (NGD networks using a U-shaped defected microstrip structure (DMS and lumped elements is presented in this paper. The signal attenuation characteristics of DMS were utilized to get NGD time. The group delay (GD time and signal attenuation of the proposed networks are controlled by an external resistor connected across the DMS slot. For experimental validation, a single-stage and cascaded two-stage NGD networks were designed and fabricated. From experimental results, the GD of -8.24±1.1 ns with the maximum insertion loss of 37.84 dB was obtained over bandwidth of 40 MHz.

  4. Linking structure and activity in nonlinear spiking networks.

    Directory of Open Access Journals (Sweden)

    Gabriel Koch Ocker

    2017-06-01

    Full Text Available Recent experimental advances are producing an avalanche of data on both neural connectivity and neural activity. To take full advantage of these two emerging datasets we need a framework that links them, revealing how collective neural activity arises from the structure of neural connectivity and intrinsic neural dynamics. This problem of structure-driven activity has drawn major interest in computational neuroscience. Existing methods for relating activity and architecture in spiking networks rely on linearizing activity around a central operating point and thus fail to capture the nonlinear responses of individual neurons that are the hallmark of neural information processing. Here, we overcome this limitation and present a new relationship between connectivity and activity in networks of nonlinear spiking neurons by developing a diagrammatic fluctuation expansion based on statistical field theory. We explicitly show how recurrent network structure produces pairwise and higher-order correlated activity, and how nonlinearities impact the networks' spiking activity. Our findings open new avenues to investigating how single-neuron nonlinearities-including those of different cell types-combine with connectivity to shape population activity and function.

  5. Structure constrained by metadata in networks of chess players.

    Science.gov (United States)

    Almeira, Nahuel; Schaigorodsky, Ana L; Perotti, Juan I; Billoni, Orlando V

    2017-11-09

    Chess is an emblematic sport that stands out because of its age, popularity and complexity. It has served to study human behavior from the perspective of a wide number of disciplines, from cognitive skills such as memory and learning, to aspects like innovation and decision-making. Given that an extensive documentation of chess games played throughout history is available, it is possible to perform detailed and statistically significant studies about this sport. Here we use one of the most extensive chess databases in the world to construct two networks of chess players. One of the networks includes games that were played over-the-board and the other contains games played on the Internet. We study the main topological characteristics of the networks, such as degree distribution and correlations, transitivity and community structure. We complement the structural analysis by incorporating players' level of play as node metadata. Although both networks are topologically different, we show that in both cases players gather in communities according to their expertise and that an emergent rich-club structure, composed by the top-rated players, is also present.

  6. Bayesian blind source separation for data with network structure.

    Science.gov (United States)

    Illner, Katrin; Fuchs, Christiane; Theis, Fabian J

    2014-11-01

    In biology, more and more information about the interactions in regulatory systems becomes accessible, and this often leads to prior knowledge for recent data interpretations. In this work we focus on multivariate signaling data, where the structure of the data is induced by a known regulatory network. To extract signals of interest we assume a blind source separation (BSS) model, and we capture the structure of the source signals in terms of a Bayesian network. To keep the parameter space small, we consider stationary signals, and we introduce the new algorithm emGrade, where model parameters and source signals are estimated using expectation maximization. For network data, we find an improved estimation performance compared to other BSS algorithms, and the flexible Bayesian modeling enables us to deal with repeated and missing observation values. The main advantage of our method is the statistically interpretable likelihood, and we can use model selection criteria to determine the (in general unknown) number of source signals or decide between different given networks. In simulations we demonstrate the recovery of the source signals dependent on the graph structure and the dimensionality of the data.

  7. Analysis of structure-function network decoupling in the brain systems of spastic diplegic cerebral palsy.

    Science.gov (United States)

    Lee, Dongha; Pae, Chongwon; Lee, Jong Doo; Park, Eun Sook; Cho, Sung-Rae; Um, Min-Hee; Lee, Seung-Koo; Oh, Maeng-Keun; Park, Hae-Jeong

    2017-10-01

    Manifestation of the functionalities from the structural brain network is becoming increasingly important to understand a brain disease. With the aim of investigating the differential structure-function couplings according to network systems, we investigated the structural and functional brain networks of patients with spastic diplegic cerebral palsy with periventricular leukomalacia compared to healthy controls. The structural and functional networks of the whole brain and motor system, constructed using deterministic and probabilistic tractography of diffusion tensor magnetic resonance images and Pearson and partial correlation analyses of resting-state functional magnetic resonance images, showed differential embedding of functional networks in the structural networks in patients. In the whole-brain network of patients, significantly reduced global network efficiency compared to healthy controls were found in the structural networks but not in the functional networks, resulting in reduced structural-functional coupling. On the contrary, the motor network of patients had a significantly lower functional network efficiency over the intact structural network and a lower structure-function coupling than the control group. This reduced coupling but reverse directionality in the whole-brain and motor networks of patients was prominent particularly between the probabilistic structural and partial correlation-based functional networks. Intact (or less deficient) functional network over impaired structural networks of the whole brain and highly impaired functional network topology over the intact structural motor network might subserve relatively preserved cognitions and impaired motor functions in cerebral palsy. This study suggests that the structure-function relationship, evaluated specifically using sparse functional connectivity, may reveal important clues to functional reorganization in cerebral palsy. Hum Brain Mapp 38:5292-5306, 2017. © 2017 Wiley Periodicals

  8. The Network Structure of Human Personality According to the NEO-PI-R: Matching Network Community Structure to Factor Structure

    NARCIS (Netherlands)

    Goekoop, R.; Goekoop, J.G.; Scholte, H.S.

    2012-01-01

    Introduction: Human personality is described preferentially in terms of factors (dimensions) found using factor analysis. An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. Aim: To directly compare the ability of network

  9. Composition and Structure of a Large Online Social Network in the Netherlands

    Science.gov (United States)

    Corten, Rense

    2012-01-01

    Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization). The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in the Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for the Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities. PMID:22523557

  10. Composition and structure of a large online social network in The Netherlands.

    Directory of Open Access Journals (Sweden)

    Rense Corten

    Full Text Available Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization. The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in The Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for The Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities.

  11. Social structures in Russia : cells and networks

    OpenAIRE

    Yefimov, Vladimir

    2001-01-01

    Russian companies heirs of Soviet enterprises are not Western-style companies, a significant difference is that they represent the basic structures of social life in the USSR : cells. The Soviet cellular system itself has deep roots in the history of Russia. The principal social structure of pre-revolutionary Russia was the rural community. In the late 1950s, Soviet society began to move away from the classic model. Cells gradually lose their exclusive role in the functioning of society. New ...

  12. Visualization of Social Networks

    NARCIS (Netherlands)

    Boertjes, E.M.; Kotterink, B.; Jager, E.J.

    2011-01-01

    Current visualizations of social networks are mostly some form of node-link diagram. Depending on the type of social network, this can be some treevisualization with a strict hierarchical structure or a more generic network visualization.

  13. Collaborative networks: Reference modeling

    NARCIS (Netherlands)

    Camarinha-Matos, L.M.; Afsarmanesh, H.

    2008-01-01

    Collaborative Networks: Reference Modeling works to establish a theoretical foundation for Collaborative Networks. Particular emphasis is put on modeling multiple facets of collaborative networks and establishing a comprehensive modeling framework that captures and structures diverse perspectives of

  14. Fire influences the structure of plant-bee networks.

    Science.gov (United States)

    Peralta, Guadalupe; Stevani, Erica L; Chacoff, Natacha P; Dorado, Jimena; Vázquez, Diego P

    2017-10-01

    Fire represents a frequent disturbance in many ecosystems, which can affect plant-pollinator assemblages and hence the services they provide. Furthermore, fire events could affect the architecture of plant-pollinator interaction networks, modifying the structure and function of communities. Some pollinators, such as wood-nesting bees, may be particularly affected by fire events due to damage to the nesting material and its long regeneration time. However, it remains unclear whether fire influences the structure of bee-plant interactions. Here, we used quantitative plant-wood-nesting bee interaction networks sampled across four different post-fire age categories (from freshly-burnt to unburnt sites) in an arid ecosystem to test whether the abundance of wood-nesting bees, the breadth of resource use and the plant-bee community structure change along a post-fire age gradient. We demonstrate that freshly-burnt sites present higher abundances of generalist than specialist wood-nesting bees and that this translates into lower network modularity than that of sites with greater post-fire ages. Bees do not seem to change their feeding behaviour across the post-fire age gradient despite changes in floral resource availability. Despite the effects of fire on plant-bee interaction network structure, these mutualistic networks seem to be able to recover a few years after the fire event. This result suggests that these interactions might be highly resilient to this type of disturbance. © 2017 The Authors. Journal of Animal Ecology © 2017 British Ecological Society.

  15. Network Catastrophe: Self-Organized Patterns Reveal both the Instability and the Structure of Complex Networks

    Science.gov (United States)

    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.

  16. Acoustical properties of nonwoven fiber network structures

    Science.gov (United States)

    Tascan, Mevlut

    Sound insulation is one of the most important issues for the automotive and building industries. Because they are porous fibrous structures, textile materials can be used as sound insulating and sound absorbing materials. Very high-density materials such as steel can insulate sound very effectively but these rigid materials reflect most of the sound back to the environment, causing sound pollution. Additionally, because high-density, rigid materials are also heavy and high cost, they cannot be used for sound insulation for the automotive and building industries. Nonwoven materials are more suitable for these industries, and they can also absorb sound in order to decrease sound pollution in the environment. Therefore, nonwoven materials are one of the most important materials for sound insulation and absorption applications materials. Insulation and absorption properties of nonwoven fabrics depend on fiber geometry and fiber arrangement within the fabric structure. Because of their complex structure, it is very difficult to define the microstructure of nonwovens. The structure of nonwovens only has fibers and voids that are filled by air. Because of the complexity of fiber-void geometry, there is still not a very accurate theory or model that defines the structural arrangement. A considerable amount of modeling has been reported in literature [1--19], but most models are not accurate due to the assumptions made. Voids that are covered by fibers are called pores in nonwoven structures and their geometry is very important, especially for the absorption properties of nonwovens. In order to define the sound absorption properties of nonwoven fabrics, individual pore structure and the number of pores per unit thickness of the fabric should be determined. In this research, instead of trying to define pores, the properties of the fibers are investigated and the number of fibers per volume of fabric is taken as a parameter in the theory. Then the effect of the nonwoven

  17. Common neighbour structure and similarity intensity in complex networks

    Science.gov (United States)

    Hou, Lei; Liu, Kecheng

    2017-10-01

    Complex systems as networks always exhibit strong regularities, implying underlying mechanisms governing their evolution. In addition to the degree preference, the similarity has been argued to be another driver for networks. Assuming a network is randomly organised without similarity preference, the present paper studies the expected number of common neighbours between vertices. A symmetrical similarity index is accordingly developed by removing such expected number from the observed common neighbours. The developed index can not only describe the similarities between vertices, but also the dissimilarities. We further apply the proposed index to measure of the influence of similarity on the wring patterns of networks. Fifteen empirical networks as well as artificial networks are examined in terms of similarity intensity and degree heterogeneity. Results on real networks indicate that, social networks are strongly governed by the similarity as well as the degree preference, while the biological networks and infrastructure networks show no apparent similarity governance. Particularly, classical network models, such as the Barabási-Albert model, the Erdös-Rényi model and the Ring Lattice, cannot well describe the social networks in terms of the degree heterogeneity and similarity intensity. The findings may shed some light on the modelling and link prediction of different classes of networks.

  18. Influence and structural balance in social networks

    Science.gov (United States)

    Singh, P.; Sreenivasan, S.; Szymanski, B.; Korniss, G.

    2012-02-01

    Models on structural balance have been studied in the past with links being categorized as friendly or antagonistic [Ref- T. Antal et al., Phys. Rev. E 72, 036121 (2005)]. However no connection between the nature of the links and states of the nodes they connect has been made. We introduce a model which combines the dynamics of the structural balance with spread of social influence. In this model, every node is in one of the three possible states (e.g. leftist, centrist and rightist) [Ref- F. Vazquez, S. Redner, J. Phys A, 37 (2004) 8479-8494] where links between leftists and rightists are antagonistic while all other links are friendly. The evolution of the system is governed by the rules of structural balance and opinion spread takes place as a result of structural balance process. The dynamics can lead the system to a number of fixed points (absorbing states). We study how the initial density of centrists nc affects the dynamics and probabilities of ending up in different absorbing states. We also study the scaling behavior of the expected time to converge to one of the absorbing states as a function of the initial density of centrists and under some variations of our basic model.

  19. Networks and Models with Heterogeneous Population Structure in Epidemiology

    Science.gov (United States)

    Kao, R. R.

    Heterogeneous population structure can have a profound effect on infectious disease dynamics, and is particularly important when investigating “tactical” disease control questions. At times, the nature of the network involved in the transmission of the pathogen (bacteria, virus, macro-parasite, etc.) appears to be clear; however, the nature of the network involved is dependent on the scale (e.g. within-host, between-host, or between-population), the nature of the contact, which ranges from the highly specific (e.g. sexual acts or needle sharing at the person-to-person level) to almost completely non-specific (e.g. aerosol transmission, often over long distances as can occur with the highly infectious livestock pathogen foot-and-mouth disease virus—FMDv—at the farm-to-farm level, e.g. Schley et al. in J. R. Soc. Interface 6:455-462, 2008), and the timescale of interest (e.g. at the scale of the individual, the typical infectious period of the host). Theoretical approaches to examining the implications of particular network structures on disease transmission have provided critical insight; however, a greater challenge is the integration of network approaches with data on real population structures. In this chapter, some concepts in disease modelling will be introduced, the relevance of selected network phenomena discussed, and then results from real data and their relationship to network analyses summarised. These include examinations of the patterns of air traffic and its relation to the spread of SARS in 2003 (Colizza et al. in BMC Med., 2007; Hufnagel et al. in Proc. Natl. Acad. Sci. USA 101:15124-15129, 2004), the use of the extensively documented Great Britain livestock movements network (Green et al. in J. Theor. Biol. 239:289-297, 2008; Robinson et al. in J. R. Soc. Interface 4:669-674, 2007; Vernon and Keeling in Proc. R. Soc. Lond. B, Biol. Sci. 276:469-476, 2009) and the growing interest in combining contact structure data with phylogenetics to

  20. Managing Networks

    DEFF Research Database (Denmark)

    Jørgensen, Heidi; Vintergaard, Christian

    Logically it seems that companies pursuing different business strategies wouldalso manage their relationships with other firms accordingly. Nevertheless, due tothe lack of research in the field of network strategies, this link still remainsinadequately examined. Based on the well-known framework...... isprovided, that the relation between a company's strategy, structure and processesin fact have a considerable influence on its pattern of network behaviour. Threecase studies from the Danish biotech industry exemplify and illustrate how acompany's strategy is directly correlated with how it manages its...... of organisationalbehaviour developed by Miles and Snow (1978), this paper argues that thepatterns of network behaviour practiced by firms greatly depend on the businesstypology of the company. That is, a company's business typology will to a certaindegree dictate the network identity of the company. In this paper evidence...

  1. Electrical network method for the thermal or structural characterization of a conducting material sample or structure

    Science.gov (United States)

    Ortiz, Marco G.

    1993-01-01

    A method for modeling a conducting material sample or structure system, as an electrical network of resistances in which each resistance of the network is representative of a specific physical region of the system. The method encompasses measuring a resistance between two external leads and using this measurement in a series of equations describing the network to solve for the network resistances for a specified region and temperature. A calibration system is then developed using the calculated resistances at specified temperatures. This allows for the translation of the calculated resistances to a region temperature. The method can also be used to detect and quantify structural defects in the system.

  2. The network researchers' network

    DEFF Research Database (Denmark)

    Henneberg, Stephan C.; Jiang, Zhizhong; Naudé, Peter

    2009-01-01

    The Industrial Marketing and Purchasing (IMP) Group is a network of academic researchers working in the area of business-to-business marketing. The group meets every year to discuss and exchange ideas, with a conference having been held every year since 1984 (there was no meeting in 1987). In thi......The Industrial Marketing and Purchasing (IMP) Group is a network of academic researchers working in the area of business-to-business marketing. The group meets every year to discuss and exchange ideas, with a conference having been held every year since 1984 (there was no meeting in 1987......). In this paper, based upon the papers presented at the 22 conferences held to date, we undertake a Social Network Analysis in order to examine the degree of co-publishing that has taken place between this group of researchers. We identify the different components in this database, and examine the large main...

  3. Software structure for broadband wireless sensor network system

    Science.gov (United States)

    Kwon, Hyeokjun; Oh, Sechang; Yoon, Hargsoon; Varadan, Vijay K.

    2010-04-01

    Zigbee Sensor Network system has been investigating for monitoring and analyzing the data measured from a lot of sensors because the Zigbee Sensor Network has several advantages of low power consumption, compact size, and multi-node connection. However, it has a disadvantage not to be able to monitor the data measured from sensors at the remote area such as other room that is located at other city. This paper describes the software structure to compensate the defect with combining the Zigbee Sensor Network and wireless LAN technology for remote monitoring of measured sensor data. The software structure has both benefits of Zigbee Sensor Network and the advantage of wireless LAN. The software structure has three main software structures. The first software structure consists of the function in order to acquire the data from sensors and the second software structure is to gather the sensor data through wireless Zigbee and to send the data to Monitoring system by using wireless LAN. The second part consists of Linux packages software based on 2440 CPU (Samsung corp.), which has ARM9 core. The Linux packages include bootloader, device drivers, kernel, and applications, and the applications are TCP/IP server program, the program interfacing with Zigbee RF module, and wireless LAN program. The last part of software structure is to receive the sensor data through TCP/IP client program from Wireless Gate Unit and to display graphically measured data by using MATLAB program; the sensor data is measured on 100Hz sampling rate and the measured data has 10bit data resolution. The wireless data transmission rate per each channel is 1.6kbps.

  4. Validation of protein structure models using network similarity score.

    Science.gov (United States)

    Ghosh, Sambit; Gadiyaram, Vasundhara; Vishveshwara, Saraswathi

    2017-09-01

    Accurate structural validation of proteins is of extreme importance in studies like protein structure prediction, analysis of molecular dynamic simulation trajectories and finding subtle changes in very similar structures. The benchmarks for today's structure validation are scoring methods like global distance test-total structure (GDT-TS), TM-score and root mean square deviations (RMSD). However, there is a lack of methods that look at both the protein backbone and side-chain structures at the global connectivity level and provide information about the differences in connectivity. To address this gap, a graph spectral based method (NSS-network similarity score) which has been recently developed to rigorously compare networks in diverse fields, is adopted to compare protein structures both at the backbone and at the side-chain noncovalent connectivity levels. In this study, we validate the performance of NSS by investigating protein structures from X-ray structures, modeling (including CASP models), and molecular dynamics simulations. Further, we systematically identify the local and the global regions of the structures contributing to the difference in NSS, through the components of the score, a feature unique to this spectral based scoring scheme. It is demonstrated that the method can quantify subtle differences in connectivity compared to a reference protein structure and can form a robust basis for protein structure comparison. Additionally, we have also introduced a network-based method to analyze fluctuations in side chain interactions (edge-weights) in an ensemble of structures, which can be an useful tool for the analysis of MD trajectories. © 2017 Wiley Periodicals, Inc.

  5. On the relationship between the structural and socioacademic communities of an interdisciplinary coauthorship network

    OpenAIRE

    Rodriguez, Marko A; Pepe, Alberto

    2008-01-01

    This article presents a study that compares detected structural communities in a coauthorship network to the socioacademic characteristics of the scholars that compose the network. The coauthorship network was created from the bibliographic record of an overt interdisciplinary research group focused on sensor networks and wireless communication. The popular leading eigenvector community detection algorithm was employed to assign a structural community to each scholar in the network. Socioacad...

  6. Algorithmic Complexity and Reprogrammability of Chemical Structure Networks

    KAUST Repository

    Zenil, Hector

    2018-02-16

    Here we address the challenge of profiling causal properties and tracking the transformation of chemical compounds from an algorithmic perspective. We explore the potential of applying a computational interventional calculus based on the principles of algorithmic probability to chemical structure networks. We profile the sensitivity of the elements and covalent bonds in a chemical structure network algorithmically, asking whether reprogrammability affords information about thermodynamic and chemical processes involved in the transformation of different compound classes. We arrive at numerical results suggesting a correspondence between some physical, structural and functional properties. Our methods are capable of separating chemical classes that reflect functional and natural differences without considering any information about atomic and molecular properties. We conclude that these methods, with their links to chemoinformatics via algorithmic, probability hold promise for future research.

  7. Mapping Language Networks Using the Structural and Dynamic Brain Connectomes.

    Science.gov (United States)

    Del Gaizo, John; Fridriksson, Julius; Yourganov, Grigori; Hillis, Argye E; Hickok, Gregory; Misic, Bratislav; Rorden, Chris; Bonilha, Leonardo

    2017-01-01

    Lesion-symptom mapping is often employed to define brain structures that are crucial for human behavior. Even though poststroke deficits result from gray matter damage as well as secondary white matter loss, the impact of structural disconnection is overlooked by conventional lesion-symptom mapping because it does not measure loss of connectivity beyond the stroke lesion. This study describes how traditional lesion mapping can be combined with structural connectome lesion symptom mapping (CLSM) and connectome dynamics lesion symptom mapping (CDLSM) to relate residual white matter networks to behavior. Using data from a large cohort of stroke survivors with aphasia, we observed improved prediction of aphasia severity when traditional lesion symptom mapping was combined with CLSM and CDLSM. Moreover, only CLSM and CDLSM disclosed the importance of temporal-parietal junction connections in aphasia severity. In summary, connectome measures can uniquely reveal brain networks that are necessary for function, improving the traditional lesion symptom mapping approach.

  8. Structural Approaches to Sequence Evolution Molecules, Networks, Populations

    CERN Document Server

    Bastolla, Ugo; Roman, H. Eduardo; Vendruscolo, Michele

    2007-01-01

    Structural requirements constrain the evolution of biological entities at all levels, from macromolecules to their networks, right up to populations of biological organisms. Classical models of molecular evolution, however, are focused at the level of the symbols - the biological sequence - rather than that of their resulting structure. Now recent advances in understanding the thermodynamics of macromolecules, the topological properties of gene networks, the organization and mutation capabilities of genomes, and the structure of populations make it possible to incorporate these key elements into a broader and deeply interdisciplinary view of molecular evolution. This book gives an account of such a new approach, through clear tutorial contributions by leading scientists specializing in the different fields involved.

  9. Graph spectra and the detectability of community structure in networks.

    Science.gov (United States)

    Nadakuditi, Raj Rao; Newman, M E J

    2012-05-04

    We study networks that display community structure--groups of nodes within which connections are unusually dense. Using methods from random matrix theory, we calculate the spectra of such networks in the limit of large size, and hence demonstrate the presence of a phase transition in matrix methods for community detection, such as the popular modularity maximization method. The transition separates a regime in which such methods successfully detect the community structure from one in which the structure is present but is not detected. By comparing these results with recent analyses of maximum-likelihood methods, we are able to show that spectral modularity maximization is an optimal detection method in the sense that no other method will succeed in the regime where the modularity method fails.

  10. Growing networks of overlapping communities with internal structure

    Science.gov (United States)

    Young, Jean-Gabriel; Hébert-Dufresne, Laurent; Allard, Antoine; Dubé, Louis J.

    2016-08-01

    We introduce an intuitive model that describes both the emergence of community structure and the evolution of the internal structure of communities in growing social networks. The model comprises two complementary mechanisms: One mechanism accounts for the evolution of the internal link structure of a single community, and the second mechanism coordinates the growth of multiple overlapping communities. The first mechanism is based on the assumption that each node establishes links with its neighbors and introduces new nodes to the community at different rates. We demonstrate that this simple mechanism gives rise to an effective maximal degree within communities. This observation is related to the anthropological theory known as Dunbar's number, i.e., the empirical observation of a maximal number of ties which an average individual can sustain within its social groups. The second mechanism is based on a recently proposed generalization of preferential attachment to community structure, appropriately called structural preferential attachment (SPA). The combination of these two mechanisms into a single model (SPA+) allows us to reproduce a number of the global statistics of real networks: The distribution of community sizes, of node memberships, and of degrees. The SPA+ model also predicts (a) three qualitative regimes for the degree distribution within overlapping communities and (b) strong correlations between the number of communities to which a node belongs and its number of connections within each community. We present empirical evidence that support our findings in real complex networks.

  11. Fracture network topology and characterization of structural permeability

    Science.gov (United States)

    Hansberry, Rowan; King, Rosalind; Holford, Simon

    2017-04-01

    There are two fundamental requirements for successful geothermal development: elevated temperatures at accessible depths, and a reservoir from which fluids can be extracted. The Australian geothermal sector has successfully targeted shallow heat, however, due in part to the inherent complexity of targeting permeability, obtaining adequate flow rates for commercial production has been problematic. Deep sedimentary aquifers are unlikely to be viable geothermal resources due to the effects of diagenetic mineral growth on rock permeability. Therefore, it is likely structural permeability targets, exploiting natural or induced fracture networks will provide the primary means for fluid flow in geothermal, as well as unconventional gas, reservoirs. Recent research has focused on the pattern and generation of crustal stresses across Australia, while less is known about the resultant networks of faults, joints, and veins that can constitute interconnected sub-surface permeability pathways. The ability of a fracture to transmit fluid is controlled by the orientation and magnitude of the in-situ stress field that acts on the fracture walls, rock strength, and pore pressure, as well as fracture properties such as aperture, orientation, and roughness. Understanding the distribution, orientation and character of fractures is key to predicting structural permeability. This project focuses on extensive mapping of fractures over various scales in four key Australian basins (Cooper, Otway, Surat and Perth) with the potential to host geothermal resources. Seismic attribute analysis is used in concert with image logs from petroleum wells, and field mapping to identify fracture networks that are usually not resolved in traditional seismic interpretation. We use fracture network topology to provide scale-invariant characterisation of fracture networks from multiple data sources to assess similarity between data sources, and fracture network connectivity. These results are compared with

  12. Teaching Structured Design of Network Algorithms in Enhanced Versions of SQL

    Science.gov (United States)

    de Brock, Bert

    2004-01-01

    From time to time developers of (database) applications will encounter, explicitly or implicitly, structures such as trees, graphs, and networks. Such applications can, for instance, relate to bills of material, organization charts, networks of (rail)roads, networks of conduit pipes (e.g., plumbing, electricity), telecom networks, and data…

  13. Introducing network Gramians to undirected network systems for structure-preserving model reduction

    NARCIS (Netherlands)

    Cheng, Xiaodong; Scherpen, Jacquelien M.A.

    2016-01-01

    In this paper, we propose the notion of controllability Gramian for linear network systems. In contrast to the conventional Gramians defined for asymptotically stable systems, the new Gramian is generalized to semi-stable systems and can be computed for network systems with imaginary axis poles. We

  14. A Hybrid Structure for Data Aggregation in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Hedieh Sajedi

    2014-01-01

    Full Text Available In recent years, wireless sensor networks have been used for various applications such as environmental monitoring, military and medical applications. A wireless sensor network uses a large number of sensor nodes that continuously collect and send data from a specific region to a base station. Data from sensors are collected from the study area in the common scenario of sensor networks. Afterward, sensed data is sent to the base station. However, neighboring sensors often lead to redundancy of data. Transmission of redundant data to the base station consumes energy and produces traffic, because process is run in a large network. Data aggregation was proposed in order to reduce redundancy in data transformation and traffic. The most popular communication protocol in this field is cluster based data aggregation. Clustering causes energy balance, but sometimes energy consumption is not efficient due to the long distance between cluster heads and base station. In another communication protocol, which is based on a tree construction, because of the short distance between the sensors, energy consumption is low. In this data aggregation approach, since each sensor node is considered as one of the vertices of a tree, the depth of tree is usually high. In this paper, an efficient hierarchical hybrid approach for data aggregation is presented. It reduces energy consumption based on clustering and minimum spanning tree. The benefit of combining clustering and tree structure is reducing the disadvantages of previous structures. The proposed method firstly employs clustering algorithm and then a minimum spanning tree is constructed based on cluster heads. Our proposed method was compared to LEACH which is a well-known data aggregation method in terms of energy consumption and the amount of energy remaining in each sensor network lifetime. Simulation results indicate that our proposed method is more efficient than LEACH algorithm considering energy

  15. Sexual networks: measuring sexual selection in structured, polyandrous populations.

    Science.gov (United States)

    McDonald, Grant C; James, Richard; Krause, Jens; Pizzari, Tommaso

    2013-03-05

    Sexual selection is traditionally measured at the population level, assuming that populations lack structure. However, increasing evidence undermines this approach, indicating that intrasexual competition in natural populations often displays complex patterns of spatial and temporal structure. This complexity is due in part to the degree and mechanisms of polyandry within a population, which can influence the intensity and scale of both pre- and post-copulatory sexual competition. Attempts to measure selection at the local and global scale have been made through multi-level selection approaches. However, definitions of local scale are often based on physical proximity, providing a rather coarse measure of local competition, particularly in polyandrous populations where the local scale of pre- and post-copulatory competition may differ drastically from each other. These limitations can be solved by social network analysis, which allows us to define a unique sexual environment for each member of a population: 'local scale' competition, therefore, becomes an emergent property of a sexual network. Here, we first propose a novel quantitative approach to measure pre- and post-copulatory sexual selection, which integrates multi-level selection with information on local scale competition derived as an emergent property of networks of sexual interactions. We then use simple simulations to illustrate the ways in which polyandry can impact estimates of sexual selection. We show that for intermediate levels of polyandry, the proposed network-based approach provides substantially more accurate measures of sexual selection than the more traditional population-level approach. We argue that the increasing availability of fine-grained behavioural datasets provides exciting new opportunities to develop network approaches to study sexual selection in complex societies.

  16. [Challenges of implementing a geriatric trauma network : A regional structure].

    Science.gov (United States)

    Schoeneberg, Carsten; Hussmann, Bjoern; Wesemann, Thomas; Pientka, Ludger; Vollmar, Marie-Christin; Bienek, Christine; Steinmann, Markus; Buecking, Benjamin; Lendemans, Sven

    2017-07-17

    At present, there is a high percentage and increasing tendency of patients presenting with orthogeriatric injuries. Moreover, significant comorbidities often exist, requiring increased interdisciplinary treatment. These developments have led the German Society of Trauma Surgery, in cooperation with the German Society of Geriatrics, to establish geriatric trauma centers. As a conglomerate hospital at two locations, we are cooperating with two external geriatric clinics. In 2015, a geriatric trauma center certification in the form of a conglomerate network structure was agreed upon for the first time in Germany. For this purpose, the requirements for certification were observed. Both structure and organization were defined in a manual according to DIN EN ISO 9001:2015. Between 2008 and 2016, an increase of 70% was seen in geriatric trauma cases in our hospital, with a rise of up to 360% in specific diagnoses. The necessary standards and regulations were compiled and evaluated from our hospitals. After successful certification, improvements were necessary, followed by a planned re-audit. These were prepared by multiprofessional interdisciplinary teams and implemented at all locations. A network structure can be an alternative to classical cooperation between trauma and geriatric units in one clinic and help reduce possible staffing shortage. Due to the lack of scientific evidence, future evaluations of the geriatric trauma register should reveal whether network structures in geriatric trauma surgery lead to a valid improvement in medical care.

  17. Complex Networks

    CERN Document Server

    Evsukoff, Alexandre; González, Marta

    2013-01-01

    In the last decade we have seen the emergence of a new inter-disciplinary field focusing on the understanding of networks which are dynamic, large, open, and have a structure sometimes called random-biased. The field of Complex Networks is helping us better understand many complex phenomena such as the spread of  deseases, protein interactions, social relationships, to name but a few. Studies in Complex Networks are gaining attention due to some major scientific breakthroughs proposed by network scientists helping us understand and model interactions contained in large datasets. In fact, if we could point to one event leading to the widespread use of complex network analysis is the availability of online databases. Theories of Random Graphs from Erdös and Rényi from the late 1950s led us to believe that most networks had random characteristics. The work on large online datasets told us otherwise. Starting with the work of Barabási and Albert as well as Watts and Strogatz in the late 1990s, we now know th...

  18. Predicting and validating protein interactions using network structure.

    Directory of Open Access Journals (Sweden)

    Pao-Yang Chen

    2008-07-01

    Full Text Available Protein interactions play a vital part in the function of a cell. As experimental techniques for detection and validation of protein interactions are time consuming, there is a need for computational methods for this task. Protein interactions appear to form a network with a relatively high degree of local clustering. In this paper we exploit this clustering by suggesting a score based on triplets of observed protein interactions. The score utilises both protein characteristics and network properties. Our score based on triplets is shown to complement existing techniques for predicting protein interactions, outperforming them on data sets which display a high degree of clustering. The predicted interactions score highly against test measures for accuracy. Compared to a similar score derived from pairwise interactions only, the triplet score displays higher sensitivity and specificity. By looking at specific examples, we show how an experimental set of interactions can be enriched and validated. As part of this work we also examine the effect of different prior databases upon the accuracy of prediction and find that the interactions from the same kingdom give better results than from across kingdoms, suggesting that there may be fundamental differences between the networks. These results all emphasize that network structure is important and helps in the accurate prediction of protein interactions. The protein interaction data set and the program used in our analysis, and a list of predictions and validations, are available at http://www.stats.ox.ac.uk/bioinfo/resources/PredictingInteractions.

  19. LHCb: Time structure analysis of the LHCb Online network

    CERN Multimedia

    Antichi, G; Campora Perez, D H; Liu, G; Neufeld, N; Giordano, S; Owezarski, P; Moore, A

    2013-01-01

    The LHCb Online Network is a real time high performance network, in which 350 data sources send data over a Gigabit Ethernet LAN to more than 1500 receiving nodes. The aggregated throughput of the application, called Event Building, is more than 60 GB/s. The protocol employed by LHCb makes the sending nodes transmit simultaneously portions of events to one receiving node at a time, which is selected using a credit-token scheme. The resulting traffic is very bursty and sensitive to irregularities in the temporal distribution of packet-bursts to the same destination or region of the network. In order to study the relevant properties of such a dataflow, a non-disruptive monitoring setup based on a networking capable FPGA (NetFPGA) has been deployed. The NetFPGA allows order of hundred nano-second precise time-stamping of packets. We study in detail the timing structure of the Event Building communication, and we identify potential effects of micro-bursts like buffer packet drops or jitter.

  20. CONCEPTUAL GENERALIZATION OF STRUCTURAL ORGANIZATION OF COMPUTER NETWORKS MEDICAL SCHOOL

    Directory of Open Access Journals (Sweden)

    O. P. Mintser

    2014-01-01

    Full Text Available The basic principles of the structural organization of computer networks in schools are presented. The questions of universities integration’s in the modern infrastructure of the information society are justified. Details the structural organizations of computer networks are presented. The effectiveness of implementing automated library information systems is shown. The big dynamical growths of technical and personal readiness of students to use virtual educational space are presented. In this regard, universities are required to provide advance information on filling the educational environment of modern virtual university, including multimedia resources for industry professional education programs. Based on information and educational environments virtual representations of universities should be formed distributed resource centers that will avoid duplication of effort on the development of innovative educational technologies, will provide a mutual exchange of results and further development of an open continuous professional education, providing accessibility, modularity and mobility training and retraining specialists.

  1. Density-Based and Transport-Based Core-Periphery Structures in Networks

    CERN Document Server

    Lee, Sang Hoon; Porter, Mason A

    2013-01-01

    Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transportation. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks---including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that this new diagnostic i...

  2. Identifying the Critical Links in Road Transportation Networks: Centrality-based approach utilizing structural properties

    Energy Technology Data Exchange (ETDEWEB)

    Chinthavali, Supriya [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2016-04-01

    Surface transportation road networks share structural properties similar to other complex networks (e.g., social networks, information networks, biological networks, and so on). This research investigates the structural properties of road networks for any possible correlation with the traffic characteristics such as link flows those determined independently. Additionally, we define a criticality index for the links of the road network that identifies the relative importance in the network. We tested our hypotheses with two sample road networks. Results show that, correlation exists between the link flows and centrality measures of a link of the road (dual graph approach is followed) and the criticality index is found to be effective for one test network to identify the vulnerable nodes.

  3. Network Representation of Multi-Cell Accelerating Structures

    CERN Document Server

    Raguin, J Y

    2001-01-01

    The analysis of the electrodynamic properties of a complete multi-cell accelerating structure using electromagnetic numerical simulation codes is presently at the edge of existing computer capabilities. To overcome this limitation, a network representation is proposed which derives the overall scattering transfer matrix of such multi-cell structures from single-cell data calculated using the commercial finite-element code HFSS. For a constant-impedance structure, computation of the eigenvalues of this matrix allows dispersion diagrams to be obtained. In the more general case, this formalism leads to a representation of the coupled-chain of cavities as a set of cascaded non identical multipoles.

  4. Spectral properties of the temporal evolution of brain network structure

    Science.gov (United States)

    Wang, Rong; Zhang, Zhen-Zhen; Ma, Jun; Yang, Yong; Lin, Pan; Wu, Ying

    2015-12-01

    The temporal evolution properties of the brain network are crucial for complex brain processes. In this paper, we investigate the differences in the dynamic brain network during resting and visual stimulation states in a task-positive subnetwork, task-negative subnetwork, and whole-brain network. The dynamic brain network is first constructed from human functional magnetic resonance imaging data based on the sliding window method, and then the eigenvalues corresponding to the network are calculated. We use eigenvalue analysis to analyze the global properties of eigenvalues and the random matrix theory (RMT) method to measure the local properties. For global properties, the shifting of the eigenvalue distribution and the decrease in the largest eigenvalue are linked to visual stimulation in all networks. For local properties, the short-range correlation in eigenvalues as measured by the nearest neighbor spacing distribution is not always sensitive to visual stimulation. However, the long-range correlation in eigenvalues as evaluated by spectral rigidity and number variance not only predicts the universal behavior of the dynamic brain network but also suggests non-consistent changes in different networks. These results demonstrate that the dynamic brain network is more random for the task-positive subnetwork and whole-brain network under visual stimulation but is more regular for the task-negative subnetwork. Our findings provide deeper insight into the importance of spectral properties in the functional brain network, especially the incomparable role of RMT in revealing the intrinsic properties of complex systems.

  5. Scalable, ultra-resistant structural colors based on network metamaterials

    KAUST Repository

    Galinski, Henning

    2017-05-05

    Structural colors have drawn wide attention for their potential as a future printing technology for various applications, ranging from biomimetic tissues to adaptive camouflage materials. However, an efficient approach to realize robust colors with a scalable fabrication technique is still lacking, hampering the realization of practical applications with this platform. Here, we develop a new approach based on large-scale network metamaterials that combine dealloyed subwavelength structures at the nanoscale with lossless, ultra-thin dielectric coatings. By using theory and experiments, we show how subwavelength dielectric coatings control a mechanism of resonant light coupling with epsilon-near-zero regions generated in the metallic network, generating the formation of saturated structural colors that cover a wide portion of the spectrum. Ellipsometry measurements support the efficient observation of these colors, even at angles of 70°. The network-like architecture of these nanomaterials allows for high mechanical resistance, which is quantified in a series of nano-scratch tests. With such remarkable properties, these metastructures represent a robust design technology for real-world, large-scale commercial applications.

  6. Nuclear networking.

    Science.gov (United States)

    Xie, Wei; Burke, Brian

    2017-07-04

    Nuclear lamins are intermediate filament proteins that represent important structural components of metazoan nuclear envelopes (NEs). By combining proteomics and superresolution microscopy, we recently reported that both A- and B-type nuclear lamins form spatially distinct filament networks at the nuclear periphery of mouse fibroblasts. In particular, A-type lamins exhibit differential association with nuclear pore complexes (NPCs). Our studies reveal that the nuclear lamina network in mammalian somatic cells is less ordered and more complex than that of amphibian oocytes, the only other system in which the lamina has been visualized at high resolution. In addition, the NPC component Tpr likely links NPCs to the A-type lamin network, an association that appears to be regulated by C-terminal modification of various A-type lamin isoforms. Many questions remain, however, concerning the structure and assembly of lamin filaments, as well as with their mode of association with other nuclear components such as peripheral chromatin.

  7. Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties of their dynamical state space.

    Science.gov (United States)

    Ahnert, S E; Fink, T M A

    2016-07-01

    Network motifs have been studied extensively over the past decade, and certain motifs, such as the feed-forward loop, play an important role in regulatory networks. Recent studies have used Boolean network motifs to explore the link between form and function in gene regulatory networks and have found that the structure of a motif does not strongly determine its function, if this is defined in terms of the gene expression patterns the motif can produce. Here, we offer a different, higher-level definition of the 'function' of a motif, in terms of two fundamental properties of its dynamical state space as a Boolean network. One is the basin entropy, which is a complexity measure of the dynamics of Boolean networks. The other is the diversity of cyclic attractor lengths that a given motif can produce. Using these two measures, we examine all 104 topologically distinct three-node motifs and show that the structural properties of a motif, such as the presence of feedback loops and feed-forward loops, predict fundamental characteristics of its dynamical state space, which in turn determine aspects of its functional versatility. We also show that these higher-level properties have a direct bearing on real regulatory networks, as both basin entropy and cycle length diversity show a close correspondence with the prevalence, in neural and genetic regulatory networks, of the 13 connected motifs without self-interactions that have been studied extensively in the literature. © 2016 The Authors.

  8. Group composition and network structure in school classes : a multilevel application of the p* model

    NARCIS (Netherlands)

    Lubbers, Miranda J.

    2003-01-01

    This paper describes the structure of social networks of students within school classes and examines differences in network structure between classes. In order to examine the network structure within school classes, we focused in particular on the principle of homophily, i.e. the tendency that

  9. Structure and dynamics in network-forming materials.

    Science.gov (United States)

    Wilson, Mark

    2016-12-21

    The study of the structure and dynamics of network-forming materials is reviewed. Experimental techniques used to extract key structural information are briefly considered. Strategies for building simulation models, based on both targeting key (experimentally-accessible) materials and on systematically controlling key model parameters, are discussed. As an example of the first class of materials, a key target system, SiO2, is used to highlight how the changing structure with applied pressure can be effectively modelled (in three dimensions) and used to link to both experimental results and simple structural models. As an example of the second class the topology of networks of tetrahedra in the MX2 stoichiometry are controlled using a single model parameter linked to the M-X-M bond angles. The evolution of ordering on multiple length-scales is observed as are the links between the static structure and key dynamical properties. The isomorphous relationship between the structures of amorphous Si and SiO2 is discussed as are the similarities and differences in the phase diagrams, the latter linked to potential polyamorphic and 'anomalous' (e.g. density maxima) behaviour. Links to both two-dimensional structures for C, Si and Ge and near-two-dimensional bilayers of SiO2 are discussed. Emerging low-dimensional structures in low temperature molten carbonates are also uncovered.

  10. Human cancer protein-protein interaction network: a structural perspective.

    Directory of Open Access Journals (Sweden)

    Gozde Kar

    2009-12-01

    Full Text Available Protein-protein interaction networks provide a global picture of cellular function and biological processes. Some proteins act as hub proteins, highly connected to others, whereas some others have few interactions. The dysfunction of some interactions causes many diseases, including cancer. Proteins interact through their interfaces. Therefore, studying the interface properties of cancer-related proteins will help explain their role in the interaction networks. Similar or overlapping binding sites should be used repeatedly in single interface hub proteins, making them promiscuous. Alternatively, multi-interface hub proteins make use of several distinct binding sites to bind to different partners. We propose a methodology to integrate protein interfaces into cancer interaction networks (ciSPIN, cancer structural protein interface network. The interactions in the human protein interaction network are replaced by interfaces, coming from either known or predicted complexes. We provide a detailed analysis of cancer related human protein-protein interfaces and the topological properties of the cancer network. The results reveal that cancer-related proteins have smaller, more planar, more charged and less hydrophobic binding sites than non-cancer proteins, which may indicate low affinity and high specificity of the cancer-related interactions. We also classified the genes in ciSPIN according to phenotypes. Within phenotypes, for breast cancer, colorectal cancer and leukemia, interface properties were found to be discriminating from non-cancer interfaces with an accuracy of 71%, 67%, 61%, respectively. In addition, cancer-related proteins tend to interact with their partners through distinct interfaces, corresponding mostly to multi-interface hubs, which comprise 56% of cancer-related proteins, and constituting the nodes with higher essentiality in the network (76%. We illustrate the interface related affinity properties of two cancer-related hub

  11. Mesoscopic structures reveal the network between the layers of multiplex data sets

    Science.gov (United States)

    Iacovacci, Jacopo; Wu, Zhihao; Bianconi, Ginestra

    2015-10-01

    Multiplex networks describe a large variety of complex systems, whose elements (nodes) can be connected by different types of interactions forming different layers (networks) of the multiplex. Multiplex networks include social networks, transportation networks, or biological networks in the cell or in the brain. Extracting relevant information from these networks is of crucial importance for solving challenging inference problems and for characterizing the multiplex networks microscopic and mesoscopic structure. Here we propose an information theory method to extract the network between the layers of multiplex data sets, forming a "network of networks." We build an indicator function, based on the entropy of network ensembles, to characterize the mesoscopic similarities between the layers of a multiplex network, and we use clustering techniques to characterize the communities present in this network of networks. We apply the proposed method to study the Multiplex Collaboration Network formed by scientists collaborating on different subjects and publishing in the American Physical Society journals. The analysis of this data set reveals the interplay between the collaboration networks and the organization of knowledge in physics.

  12. Telecommunication networks

    CERN Document Server

    Iannone, Eugenio

    2011-01-01

    Many argue that telecommunications network infrastructure is the most impressive and important technology ever developed. Analyzing the telecom market's constantly evolving trends, research directions, infrastructure, and vital needs, Telecommunication Networks responds with revolutionized engineering strategies to optimize network construction. Omnipresent in society, telecom networks integrate a wide range of technologies. These include quantum field theory for the study of optical amplifiers, software architectures for network control, abstract algebra required to design error correction co

  13. True Nature of Supply Network Communication Structure (P.1-14

    Directory of Open Access Journals (Sweden)

    Lokhman Hakim bin Osman

    2017-02-01

    Full Text Available Globalization of world economy has altered the definition of organizational structure. Global supply chain can no longer be viewed as an arm-length structure. It has become more complex. The complexity demands deeper research and understanding. This research analyzed a structure of supply network in an attempt to elucidate the true structure of the supply network. Using the quantitative Social Network Analysis methodology, findings of this study indicated that, the structure of the supply network differs depending on the types of network relations. An important implication of these findings would be a more focus resource management upon network relationship development that is based on firms’ positions in the different network structure. This research also contributes to the various strategies of effective and efficient supply chain management.Keywords: Supply Chain Management, Network Studies, Inter-Organizational Relations, Social Capital

  14. Using structural equation modeling for network meta-analysis.

    Science.gov (United States)

    Tu, Yu-Kang; Wu, Yun-Chun

    2017-07-14

    Network meta-analysis overcomes the limitations of traditional pair-wise meta-analysis by incorporating all available evidence into a general statistical framework for simultaneous comparisons of several treatments. Currently, network meta-analyses are undertaken either within the Bayesian hierarchical linear models or frequentist generalized linear mixed models. Structural equation modeling (SEM) is a statistical method originally developed for modeling causal relations among observed and latent variables. As random effect is explicitly modeled as a latent variable in SEM, it is very flexible for analysts to specify complex random effect structure and to make linear and nonlinear constraints on parameters. The aim of this article is to show how to undertake a network meta-analysis within the statistical framework of SEM. We used an example dataset to demonstrate the standard fixed and random effect network meta-analysis models can be easily implemented in SEM. It contains results of 26 studies that directly compared three treatment groups A, B and C for prevention of first bleeding in patients with liver cirrhosis. We also showed that a new approach to network meta-analysis based on the technique of unrestricted weighted least squares (UWLS) method can also be undertaken using SEM. For both the fixed and random effect network meta-analysis, SEM yielded similar coefficients and confidence intervals to those reported in the previous literature. The point estimates of two UWLS models were identical to those in the fixed effect model but the confidence intervals were greater. This is consistent with results from the traditional pairwise meta-analyses. Comparing to UWLS model with common variance adjusted factor, UWLS model with unique variance adjusted factor has greater confidence intervals when the heterogeneity was larger in the pairwise comparison. The UWLS model with unique variance adjusted factor reflects the difference in heterogeneity within each comparison

  15. A study of structural properties of gene network graphs for mathematical modeling of integrated mosaic gene networks.

    Science.gov (United States)

    Petrovskaya, Olga V; Petrovskiy, Evgeny D; Lavrik, Inna N; Ivanisenko, Vladimir A

    2017-04-01

    Gene network modeling is one of the widely used approaches in systems biology. It allows for the study of complex genetic systems function, including so-called mosaic gene networks, which consist of functionally interacting subnetworks. We conducted a study of a mosaic gene networks modeling method based on integration of models of gene subnetworks by linear control functionals. An automatic modeling of 10,000 synthetic mosaic gene regulatory networks was carried out using computer experiments on gene knockdowns/knockouts. Structural analysis of graphs of generated mosaic gene regulatory networks has revealed that the most important factor for building accurate integrated mathematical models, among those analyzed in the study, is data on expression of genes corresponding to the vertices with high properties of centrality.

  16. Dynamical Structure of a Traditional Amazonian Social Network

    Directory of Open Access Journals (Sweden)

    Paul L. Hooper

    2013-11-01

    Full Text Available Reciprocity is a vital feature of social networks, but relatively little is known about its temporal structure or the mechanisms underlying its persistence in real world behavior. In pursuit of these two questions, we study the stationary and dynamical signals of reciprocity in a network of manioc beer (Spanish: chicha; Tsimane’: shocdye’ drinking events in a Tsimane’ village in lowland Bolivia. At the stationary level, our analysis reveals that social exchange within the community is heterogeneously patterned according to kinship and spatial proximity. A positive relationship between the frequencies at which two families host each other, controlling for kinship and proximity, provides evidence for stationary reciprocity. Our analysis of the dynamical structure of this network presents a novel method for the study of conditional, or non-stationary, reciprocity effects. We find evidence that short-timescale reciprocity (within three days is present among non- and distant-kin pairs; conversely, we find that levels of cooperation among close kin can be accounted for on the stationary hypothesis alone.

  17. Computational 3D imaging to quantify structural components and assembly of protein networks.

    Science.gov (United States)

    Asgharzadeh, Pouyan; Özdemir, Bugra; Reski, Ralf; Röhrle, Oliver; Birkhold, Annette I

    2018-03-15

    Traditionally, protein structures have been described by the secondary structure architecture and fold arrangement. However, the relatively novel method of 3D confocal microscopy of fluorescent-protein-tagged networks in living cells allows resolving the detailed spatial organization of these networks. This provides new possibilities to predict network functionality, as structure and function seem to be linked at various scales. Here, we propose a quantitative approach using 3D confocal microscopy image data to describe protein networks based on their nano-structural characteristics. This analysis is constructed in four steps: (i) Segmentation of the microscopic raw data into a volume model and extraction of a spatial graph representing the protein network. (ii) Quantifying protein network gross morphology using the volume model. (iii) Quantifying protein network components using the spatial graph. (iv) Linking these two scales to obtain insights into network assembly. Here, we quantitatively describe the filamentous temperature sensitive Z protein network of the moss Physcomitrella patens and elucidate relations between network size and assembly details. Future applications will link network structure and functionality by tracking dynamic structural changes over time and comparing different states or types of networks, possibly allowing more precise identification of (mal) functions or the design of protein-engineered biomaterials for applications in regenerative medicine. Protein networks are highly complex and dynamic structures that play various roles in biological environments. Analyzing the detailed spatial structure of these networks may lead to new insight into biological functions and malfunctions. Here, we propose a tool set that extracts structural information at two scales of the protein network and allows therefore to address questions such as "how is the network built?" or "how networks grow?". Copyright © 2018 Acta Materialia Inc. Published by

  18. Investigation of Wireless Sensor Networks for Structural Health Monitoring

    Directory of Open Access Journals (Sweden)

    Ping Wang

    2012-01-01

    Full Text Available Wireless sensor networks (WSNs are one of the most able technologies in the structural health monitoring (SHM field. Through intelligent, self-organising means, the contents of this paper will test a variety of different objects and different working principles of sensor nodes connected into a network and integrated with data processing functions. In this paper the key issues of WSN applied in SHM are discussed, including the integration of different types of sensors with different operational modalities, sampling frequencies, issues of transmission bandwidth, real-time ability, and wireless transmitter frequency. Furthermore, the topology, data fusion, integration, energy saving, and self-powering nature of different systems will be investigated. In the FP7 project “Health Monitoring of Offshore Wind Farms,” the above issues are explored.

  19. The macroecology of phylogenetically structured hummingbird-plant networks

    DEFF Research Database (Denmark)

    González, Ana M. Martín; Dalsgaard, Bo; Nogues, David Bravo

    2015-01-01

    Aim To investigate the association between hummingbird–plant network structure and species richness, phylogenetic signal on species' interaction pattern, insularity and historical and current climate. Location Fifty-four communities along a c. 10,000 km latitudinal gradient across the Americas (39......° N–32° S), ranging from sea level to c. 3700 m a.s.l., located on the mainland and on islands and covering a wide range of climate regimes. Methods We measured the level of specialization and modularity in mutualistic plant–hummingbird interaction networks. Using an ordinary least squares multimodel.......32–0.45, respectively). Specifically, higher levels of specialization and modularity were associated with species-rich communities and communities in which closely related hummingbirds visited distinct sets of flowering species. On the mainland, specialization was also associated with warmer temperatures and greater...

  20. Animal transportation networks

    Science.gov (United States)

    Perna, Andrea; Latty, Tanya

    2014-01-01

    Many group-living animals construct transportation networks of trails, galleries and burrows by modifying the environment to facilitate faster, safer or more efficient movement. Animal transportation networks can have direct influences on the fitness of individuals, whereas the shape and structure of transportation networks can influence community dynamics by facilitating contacts between different individuals and species. In this review, we discuss three key areas in the study of animal transportation networks: the topological properties of networks, network morphogenesis and growth, and the behaviour of network users. We present a brief primer on elements of network theory, and then discuss the different ways in which animal groups deal with the fundamental trade-off between the competing network properties of travel efficiency, robustness and infrastructure cost. We consider how the behaviour of network users can impact network efficiency, and call for studies that integrate both network topology and user behaviour. We finish with a prospectus for future research. PMID:25165598

  1. Revealing and exploiting hierarchical material structure through complex atomic networks

    Science.gov (United States)

    Ahnert, Sebastian E.; Grant, William P.; Pickard, Chris J.

    2017-08-01

    One of the great challenges of modern science is to faithfully model, and understand, matter at a wide range of scales. Starting with atoms, the vastness of the space of possible configurations poses a formidable challenge to any simulation of complex atomic and molecular systems. We introduce a computational method to reduce the complexity of atomic configuration space by systematically recognising hierarchical levels of atomic structure, and identifying the individual components. Given a list of atomic coordinates, a network is generated based on the distances between the atoms. Using the technique of modularity optimisation, the network is decomposed into modules. This procedure can be performed at different resolution levels, leading to a decomposition of the system at different scales, from which hierarchical structure can be identified. By considering the amount of information required to represent a given modular decomposition we can furthermore find the most succinct descriptions of a given atomic ensemble. Our straightforward, automatic and general approach is applied to complex crystal structures. We show that modular decomposition of these structures considerably simplifies configuration space, which in turn can be used in discovery of novel crystal structures, and opens up a pathway towards accelerated molecular dynamics of complex atomic ensembles. The power of this approach is demonstrated by the identification of a possible allotrope of boron containing 56 atoms in the primitive unit cell, which we uncover using an accelerated structure search, based on a modular decomposition of a known dense phase of boron, γ-B28.

  2. Epidemic spreading on dual-structure networks with mobile agents

    Science.gov (United States)

    Yao, Yiyang; Zhou, Yinzuo

    2017-02-01

    The rapid development of modern society continually transforms the social structure which leads to an increasingly distinct dual structure of higher population density in urban areas and lower density in rural areas. Such structure may induce distinctive spreading behavior of epidemics which does not happen in a single type structure. In this paper, we study the epidemic spreading of mobile agents on dual structure networks based on SIRS model. First, beyond the well known epidemic threshold for generic epidemic model that when the infection rate is below the threshold a pertinent infectious disease will die out, we find the other epidemic threshold which appears when the infection rate of a disease is relatively high. This feature of two thresholds for the SIRS model may lead to the elimination of infectious disease when social network has either high population density or low population density. Interestingly, however, we find that when a high density area is connected to a low density may cause persistent spreading of the infectious disease, even though the same disease will die out when it spreads in each single area. This phenomenon indicates the critical role of the connection between the two areas which could radically change the behavior of spreading dynamics. Our findings, therefore, provide new understanding of epidemiology pertinent to the characteristic modern social structure and have potential to develop controlling strategies accordingly.

  3. Structure Identification of Uncertain Complex Networks Based on Anticipatory Projective Synchronization.

    Directory of Open Access Journals (Sweden)

    Liu Heng

    Full Text Available This paper investigates a method to identify uncertain system parameters and unknown topological structure in general complex networks with or without time delay. A complex network, which has uncertain topology and unknown parameters, is designed as a drive network, and a known response complex network with an input controller is designed to identify the drive network. Under the proposed input controller, the drive network and the response network can achieve anticipatory projective synchronization when the system is steady. Lyapunov theorem and Barbǎlat's lemma guarantee the stability of synchronization manifold between two networks. When the synchronization is achieved, the system parameters and topology in response network can be changed to equal with the parameters and topology in drive network. A numerical example is given to show the effectiveness of the proposed method.

  4. From Microactions to Macrostructure and Back: A Structurational Approach to the Evolution of Organizational Networks

    Science.gov (United States)

    Whitbred, Robert; Fonti, Fabio; Steglich, Christian; Contractor, Noshir

    2011-01-01

    Structuration theory (ST) and network analysis are promising approaches for studying the emergence of communication networks. We offer a model that integrates the conceptual richness of structuration with the precision of relevant concepts and mechanisms offered from communication network research. We leverage methodological advancements (i.e.,…

  5. Complex Network Structure Influences Processing in Long-Term and Short-Term Memory

    Science.gov (United States)

    Vitevitch, Michael S.; Chan, Kit Ying; Roodenrys, Steven

    2012-01-01

    Complex networks describe how entities in systems interact; the structure of such networks is argued to influence processing. One measure of network structure, clustering coefficient, C, measures the extent to which neighbors of a node are also neighbors of each other. Previous psycholinguistic experiments found that the C of phonological…

  6. The structure of lay consultation networks: managing illness in community settings.

    Science.gov (United States)

    Stoller, Eleanor Palo; Wisniewski, Amy A

    2003-08-01

    We examined the structure of lay consultation networks among elderly people. Data were gathered through interviews with 548 elderly adults living in Florida retirement communities and in Cleveland. Respondents identified people they consulted about symptom or disease information, health worries, what the doctor said, and consulting health providers. Network size, composition, geographic dispersion, gender homogeneity, and division of labor were assessed. Eighty percent identified at least one network member (range = 1 to 7 consultants). Networks largely consisted of family members, particularly spouses and women. Older adults talked most frequently with network members about physician visits. Widowed individuals were more likely to rely on children and friends and have networks outside their neighborhoods than married elders. Women's networks included a broader range of relationships than men's networks. Results reaffirmed the importance of gender in structuring networks in late life. The low prevalence of friends supports Cartensen's Selectivity Theory.

  7. General asymmetric neutral networks and structure design by genetic algorithms: A learning rule for temporal patterns

    Energy Technology Data Exchange (ETDEWEB)

    Bornholdt, S. [Heidelberg Univ., (Germany). Inst., fuer Theoretische Physik; Graudenz, D. [Lawrence Berkeley Lab., CA (United States)

    1993-07-01

    A learning algorithm based on genetic algorithms for asymmetric neural networks with an arbitrary structure is presented. It is suited for the learning of temporal patterns and leads to stable neural networks with feedback.

  8. Data envelopment analysis a handbook of modeling internal structure and network

    CERN Document Server

    Cook, Wade D

    2014-01-01

    This comprehensive handbook on state-of-the-art topics in DEA modeling of internal structures and networks presents work by leading researchers who share their results on subjects including additive efficiency decomposition and slacks-based network DEA.

  9. Network maintenance

    CERN Multimedia

    IT Department

    2009-01-01

    A site wide network maintenance has been scheduled for Saturday 28 February. Most of the network devices of the General Purpose network will be upgraded to a newer software version, in order to improve our network monitoring capabilities. This will result in a series of short (2-5 minutes) random interruptions everywhere on the CERN sites along this day. This upgrade will not affect: the Computer centre itself, building 613, the Technical Network and the LHC experiments dedicated networks at the pits. Should you need more details on this intervention, please contact Netops by phone 74927 or email mailto:Netops@cern.ch. IT/CS Group

  10. Network maintenance

    CERN Multimedia

    GS Department

    2009-01-01

    A site-wide network maintenance operation has been scheduled for Saturday 28 February. Most of the network devices of the general purpose network will be upgraded to a newer software version, in order to improve our network monitoring capabilities. This will result in a series of short (2-5 minutes) random interruptions everywhere on the CERN sites throughout the day. This upgrade will not affect the Computer Centre itself, Building 613, the Technical Network and the LHC experiments, dedicated networks at the pits. For further details of this intervention, please contact Netops by phone 74927 or e-mail mailto:Netops@cern.ch. IT/CS Group

  11. Structural properties of the Caenorhabditis elegans neuronal network

    National Research Council Canada - National Science Library

    Varshney, Lav R; Chen, Beth L; Paniagua, Eric; Hall, David H; Chklovskii, Dmitri B

    2011-01-01

    .... Even for Caenorhabditis elegans, whose neuronal network is relatively small and stereotypical from animal to animal, published wiring diagrams are neither accurate nor complete and self-consistent...

  12. Structural properties of the Caenorhabditis elegans neuronal network

    National Research Council Canada - National Science Library

    Varshney, Lav R; Chen, Beth L; Paniagua, Eric; Hall, David H; Chklovskii, Dmitri B

    2011-01-01

    Despite recent interest in reconstructing neuronal networks, complete wiring diagrams on the level of individual synapses remain scarce and the insights into function they can provide remain unclear...

  13. Finding instabilities in the community structure of complex networks

    Science.gov (United States)

    Gfeller, David; Chappelier, Jean-Cédric; de Los Rios, Paolo

    2005-11-01

    The problem of finding clusters in complex networks has been studied by mathematicians, computer scientists, and, more recently, by physicists. Many of the existing algorithms partition a network into clear clusters without overlap. Here we introduce a method to identify the nodes lying “between clusters,” allowing for a general measure of the stability of the clusters. This is done by adding noise over the edge weights. Our method can in principle be used with almost any clustering algorithm able to deal with weighted networks. We present several applications on real-world networks using two different clustering algorithms.

  14. Industry Consolidation and Future Airline Network Structures in Europe

    Science.gov (United States)

    Dennis, Nigel

    2003-01-01

    In the current downturn in demand for air travel, major airlines are revising and rationalizing their networks in an attempt to improve financial performance and strengthen their defences against both new entrants and traditional rivals. Expansion of commercial agreements or alliances with other airlines has become a key reaction to the increasingly competitive marketplace. In the absence, for regulatory reasons, of cross-border mergers these are the principal means by which the industry can consolidate internationally. This paper analyzes the developments which have been taking place and attempts to itentify the implications for airline network structures and the function of different hub airports. The range of services available to passengers in long-haul markets to/from Europe is evaluated before and after recent industry reorganization. Hubs are crucial to interlink the route networks of parmers in an alliance. However, duplication between nearby hub airports that find themselves within the same airline alliance can lead to loss of service at the weaker locations. The extent to which the alliance hubs in Europe duplicate or complement each other in terms of network coverage is assessed and this methodology also enables the optimal partnerships for "unattached" airlines to be identified. The future role of the various European hubs is considered under different scenarios of global alliance development. The paper concludes by considering possible longer-term developments. In an environment where the low-cost carriers will provide a major element of customer choice, it is suggested that the traditional airlines will retrench around their hubs, surrendering many secondary cities to the low-cost sector. Further reduction in the number of alliances could threaten more of the European hubs. For both regulatory and commercial reasons, the end result may be just one airline alliance - so recreating in the deregulated market the historic rule of IATA.

  15. Structure identification and adaptive synchronization of uncertain general complex dynamical networks

    Energy Technology Data Exchange (ETDEWEB)

    Xu Yuhua, E-mail: yuhuaxu2004@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China) and Department of Maths, Yunyang Teacher' s College, Hubei 442000 (China); Zhou Wuneng, E-mail: wnzhou@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Fang Jian' an [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Lu Hongqian [Shandong Institute of Light Industry, Shandong Jinan 250353 (China)

    2009-12-28

    This Letter proposes an approach to identify the topological structure and unknown parameters for uncertain general complex networks simultaneously. By designing effective adaptive controllers, we achieve synchronization between two complex networks. The unknown network topological structure and system parameters of uncertain general complex dynamical networks are identified simultaneously in the process of synchronization. Several useful criteria for synchronization are given. Finally, an illustrative example is presented to demonstrate the application of the theoretical results.

  16. Structural properties of the Caenorhabditis elegans neuronal network.

    Directory of Open Access Journals (Sweden)

    Lav R Varshney

    2011-02-01

    Full Text Available Despite recent interest in reconstructing neuronal networks, complete wiring diagrams on the level of individual synapses remain scarce and the insights into function they can provide remain unclear. Even for Caenorhabditis elegans, whose neuronal network is relatively small and stereotypical from animal to animal, published wiring diagrams are neither accurate nor complete and self-consistent. Using materials from White et al. and new electron micrographs we assemble whole, self-consistent gap junction and chemical synapse networks of hermaphrodite C. elegans. We propose a method to visualize the wiring diagram, which reflects network signal flow. We calculate statistical and topological properties of the network, such as degree distributions, synaptic multiplicities, and small-world properties, that help in understanding network signal propagation. We identify neurons that may play central roles in information processing, and network motifs that could serve as functional modules of the network. We explore propagation of neuronal activity in response to sensory or artificial stimulation using linear systems theory and find several activity patterns that could serve as substrates of previously described behaviors. Finally, we analyze the interaction between the gap junction and the chemical synapse networks. Since several statistical properties of the C. elegans network, such as multiplicity and motif distributions are similar to those found in mammalian neocortex, they likely point to general principles of neuronal networks. The wiring diagram reported here can help in understanding the mechanistic basis of behavior by generating predictions about future experiments involving genetic perturbations, laser ablations, or monitoring propagation of neuronal activity in response to stimulation.

  17. Environmental complexity influences association network structure and network-based diffusion of foraging information in fish shoals.

    Science.gov (United States)

    Webster, Mike M; Atton, Nicola; Hoppitt, William J E; Laland, Kevin N

    2013-02-01

    Socially transmitted information can significantly affect the ways in which animals interact with their environments. We used network-based diffusion analysis, a novel and powerful tool for exploring information transmission, to model the rate at which sticklebacks (Gasterosteus aculeatus) discovered prey patches, comparing shoals foraging in open and structured environments. We found that for groups in the open environment, individuals tended to recruit to both the prey patch and empty comparison patches at similar times, suggesting that patch discovery was not greatly affected by direct social transmission. In contrast, in structured environments we found strong evidence that information about prey patch location was socially transmitted and moreover that the pathway of information transmission followed the shoals' association network structures. Our findings highlight the importance of considering habitat structure when investigating the diffusion of information through populations and imply that association networks take on greater ecological significance in structured than open environments.

  18. Effect of synapse dilution on the memory retrieval in structured attractor neural networks

    Science.gov (United States)

    Brunel, N.

    1993-08-01

    We investigate a simple model of structured attractor neural network (ANN). In this network a module codes for the category of the stored information, while another group of neurons codes for the remaining information. The probability distribution of stabilities of the patterns and the prototypes of the categories are calculated, for two different synaptic structures. The stability of the prototypes is shown to increase when the fraction of neurons coding for the category goes down. Then the effect of synapse destruction on the retrieval is studied in two opposite situations : first analytically in sparsely connected networks, then numerically in completely connected ones. In both cases the behaviour of the structured network and that of the usual homogeneous networks are compared. When lesions increase, two transitions are shown to appear in the behaviour of the structured network when one of the patterns is presented to the network. After the first transition the network recognizes the category of the pattern but not the individual pattern. After the second transition the network recognizes nothing. These effects are similar to syndromes caused by lesions in the central visual system, namely prosopagnosia and agnosia. In both types of networks (structured or homogeneous) the stability of the prototype is greater than the stability of individual patterns, however the first transition, for completely connected networks, occurs only when the network is structured.

  19. Modeling Broadband Microwave Structures by Artificial Neural Networks

    Directory of Open Access Journals (Sweden)

    V. Otevrel

    2004-06-01

    Full Text Available The paper describes the exploitation of feed-forward neural networksand recurrent neural networks for replacing full-wave numerical modelsof microwave structures in complex microwave design tools. Building aneural model, attention is turned to the modeling accuracy and to theefficiency of building a model. Dealing with the accuracy, we describea method of increasing it by successive completing a training set.Neural models are mutually compared in order to highlight theiradvantages and disadvantages. As a reference model for comparisons,approximations based on standard cubic splines are used. Neural modelsare used to replace both the time-domain numeric models and thefrequency-domain ones.

  20. Organizational Networks

    DEFF Research Database (Denmark)

    Grande, Bård; Sørensen, Ole Henning

    1998-01-01

    The paper focuses on the concept of organizational networks. Four different uses of the concept of organizational network are identified and critically discussed. Special focus is placed on how information and communication technologies as communication mediators and cognitive pictures influence...

  1. Network workshop

    DEFF Research Database (Denmark)

    Bruun, Jesper; Evans, Robert Harry

    2014-01-01

    This paper describes the background for, realisation of and author reflections on a network workshop held at ESERA2013. As a new research area in science education, networks offer a unique opportunity to visualise and find patterns and relationships in complicated social or academic network data...... research community. With this workshop, participants were offered a way into network science based on authentic educational research data. The workshop was constructed as an inquiry lesson with emphasis on user autonomy. Learning activities had participants choose to work with one of two cases of networks...... network methodology in one’s research might supersede the perceived benefits of doing so. As a response to that problem, we argue that workshops can act as a road towards meaningful engagement with networks and highlight that network methodology promises new ways of interpreting data to answer questions...

  2. Graphs, Ideal Flow, and the Transportation Network

    OpenAIRE

    Teknomo, Kardi

    2016-01-01

    This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of agents in using the network graph. I show the similarity and relationship between the structural pattern of the network and network utilization.

  3. Social Networks

    OpenAIRE

    Martí, Joan; Zenou, Yves

    2009-01-01

    We survey the literature on social networks by putting together the economics, sociological and physics/applied mathematics approaches, showing their similarities and differences. We expose, in particular, the two main ways of modeling network formation. While the physics/applied mathematics approach is capable of reproducing most observed networks, it does not explain why they emerge. On the contrary, the economics approach is very precise in explaining why networks emerge but does a poor jo...

  4. An Analysis of the Structure and Evolution of Networks

    Science.gov (United States)

    Hua, Guangying

    2011-01-01

    As network research receives more and more attention from both academic researchers and practitioners, network analysis has become a fast growing field attracting many researchers from diverse fields such as physics, computer science, and sociology. This dissertation provides a review of theory and research on different real data sets from the…

  5. Neural bases of recommendations differ according to social network structure.

    Science.gov (United States)

    O'Donnell, Matthew Brook; Bayer, Joseph B; Cascio, Christopher N; Falk, Emily B

    2017-01-01

    Ideas spread across social networks, but not everyone is equally positioned to be a successful recommender. Do individuals with more opportunities to connect otherwise unconnected others-high information brokers-use their brains differently than low information brokers when making recommendations? We test the hypothesis that those with more opportunities for information brokerage may use brain systems implicated in considering the thoughts, perspectives, and mental states of others (i.e. 'mentalizing') more when spreading ideas. We used social network analysis to quantify individuals' opportunities for information brokerage. This served as a predictor of activity within meta-analytically defined neural regions associated with mentalizing (dorsomedial prefrontal cortex, temporal parietal junction, medial prefrontal cortex, /posterior cingulate cortex, middle temporal gyrus) as participants received feedback about peer opinions of mobile game apps. Higher information brokers exhibited more activity in this mentalizing network when receiving divergent peer feedback and updating their recommendation. These data support the idea that those in different network positions may use their brains differently to perform social tasks. Different social network positions might provide more opportunities to engage specific psychological processes. Or those who tend to engage such processes more may place themselves in systematically different network positions. These data highlight the value of integrating levels of analysis, from brain networks to social networks. © The Author (2017). Published by Oxford University Press. For Permissions, please email: journals.permissions@oup.com.

  6. Inventory theory, mode choice and network structure in freight transport

    NARCIS (Netherlands)

    Combes, F.; Tavasszy, L.A.

    2016-01-01

    In passenger transport, hub-and-spoke networks allow the transportation of small passenger flows with competitive frequencies, in a way that direct line networks cannot. Equivalently, in freight transport, it can be expected that small shipper-receiver flows of high added value commodities transit

  7. The structure and dynamics of knowledge networks: a proximity approach

    NARCIS (Netherlands)

    ter Wal, L.J.|info:eu-repo/dai/nl/304841102

    2009-01-01

    Local knowledge networks are often held responsible for the competitiveness and innovativeness of geographical clusters. However, the literature on spatial clustering tends to assume that firms in clusters have equal access to the knowledge that circulates in those networks and that this knowledge

  8. Measure the structure similarity of nodes in complex networks based on relative entropy

    Science.gov (United States)

    Zhang, Qi; Li, Meizhu; Deng, Yong

    2018-02-01

    Similarity of nodes is a basic structure quantification in complex networks. Lots of methods in research on complex networks are based on nodes' similarity such as node's classification, network's community structure detection, network's link prediction and so on. Therefore, how to measure nodes' similarity is an important problem in complex networks. In this paper, a new method is proposed to measure nodes' structure similarity based on relative entropy and each node's local structure. In the new method, each node's structure feature can be quantified as a special kind of information. The quantification of similarity between different pair of nodes can be replaced as the quantification of similarity in structural information. Then relative entropy is used to measure the difference between each pair of nodes' structural information. At last the value of relative entropy between each pair of nodes is used to measure nodes' structure similarity in complex networks. Comparing with existing methods the new method is more accuracy to measure nodes' structure similarity.

  9. Neuromodulatory connectivity defines the structure of a behavioral neural network.

    Science.gov (United States)

    Diao, Feici; Elliott, Amicia D; Diao, Fengqiu; Shah, Sarav; White, Benjamin H

    2017-11-22

    Neural networks are typically defined by their synaptic connectivity, yet synaptic wiring diagrams often provide limited insight into network function. This is due partly to the importance of non-synaptic communication by neuromodulators, which can dynamically reconfigure circuit activity to alter its output. Here, we systematically map the patterns of neuromodulatory connectivity in a network that governs a developmentally critical behavioral sequence in Drosophila. This sequence, which mediates pupal ecdysis, is governed by the serial release of several key factors, which act both somatically as hormones and within the brain as neuromodulators. By identifying and characterizing the functions of the neuronal targets of these factors, we find that they define hierarchically organized layers of the network controlling the pupal ecdysis sequence: a modular input layer, an intermediate central pattern generating layer, and a motor output layer. Mapping neuromodulatory connections in this system thus defines the functional architecture of the network.

  10. Network Coding

    Indian Academy of Sciences (India)

    Network coding is a technique to increase the amount of information °ow in a network by mak- ing the key observation that information °ow is fundamentally different from commodity °ow. Whereas, under traditional methods of opera- tion of data networks, intermediate nodes are restricted to simply forwarding their incoming.

  11. Structure-Dynamics Relationships in Bursting Neuronal Networks Revealed Using a Prediction Framework

    Science.gov (United States)

    Mäki-Marttunen, Tuomo; Aćimović, Jugoslava; Ruohonen, Keijo; Linne, Marja-Leena

    2013-01-01

    The question of how the structure of a neuronal network affects its functionality has gained a lot of attention in neuroscience. However, the vast majority of the studies on structure-dynamics relationships consider few types of network structures and assess limited numbers of structural measures. In this in silico study, we employ a wide diversity of network topologies and search among many possibilities the aspects of structure that have the greatest effect on the network excitability. The network activity is simulated using two point-neuron models, where the neurons are activated by noisy fluctuation of the membrane potential and their connections are described by chemical synapse models, and statistics on the number and quality of the emergent network bursts are collected for each network type. We apply a prediction framework to the obtained data in order to find out the most relevant aspects of network structure. In this framework, predictors that use different sets of graph-theoretic measures are trained to estimate the activity properties, such as burst count or burst length, of the networks. The performances of these predictors are compared with each other. We show that the best performance in prediction of activity properties for networks with sharp in-degree distribution is obtained when the prediction is based on clustering coefficient. By contrast, for networks with broad in-degree distribution, the maximum eigenvalue of the connectivity graph gives the most accurate prediction. The results shown for small () networks hold with few exceptions when different neuron models, different choices of neuron population and different average degrees are applied. We confirm our conclusions using larger () networks as well. Our findings reveal the relevance of different aspects of network structure from the viewpoint of network excitability, and our integrative method could serve as a general framework for structure-dynamics studies in biosciences. PMID:23935998

  12. Network gravity

    Science.gov (United States)

    Lombard, John

    2017-01-01

    We introduce the construction of a new framework for probing discrete emergent geometry and boundary-boundary observables based on a fundamentally a-dimensional underlying network structure. Using a gravitationally motivated action with Forman weighted combinatorial curvatures and simplicial volumes relying on a decomposition of an abstract simplicial complex into realized embeddings of proper skeletons, we demonstrate properties such as a minimal volume-scale cutoff, the necessity of a term playing the role of a positive definite cosmological constant as a regulator for nondegenerate geometries, and naturally emergent simplicial structures from Metropolis network evolution simulations with no restrictions on attachment rules or regular building blocks. We see emergent properties which echo results from both the spinfoam formalism and causal dynamical triangulations in quantum gravity, and provide analytical and numerical results to support the analogy. We conclude with a summary of open questions and intent for future work in developing the program.

  13. Insensitivity of synchronization to network structure in chaotic pendulum systems with time-delay coupling

    Science.gov (United States)

    Yao, Chenggui; Zhan, Meng; Shuai, Jianwei; Ma, Jun; Kurths, Jürgen

    2017-12-01

    It has been generally believed that both time delay and network structure could play a crucial role in determining collective dynamical behaviors in complex systems. In this work, we study the influence of coupling strength, time delay, and network topology on synchronization behavior in delay-coupled networks of chaotic pendulums. Interestingly, we find that the threshold value of the coupling strength for complete synchronization in such networks strongly depends on the time delay in the coupling, but appears to be insensitive to the network structure. This lack of sensitivity was numerically tested in several typical regular networks, such as different locally and globally coupled ones as well as in several complex networks, such as small-world and scale-free networks. Furthermore, we find that the emergence of a synchronous periodic state induced by time delay is of key importance for the complete synchronization.

  14. Entrepreneur online social networks: structure, diversity and impact on start-up survival

    NARCIS (Netherlands)

    Song, Y.; Vinig, T.

    2012-01-01

    In this paper, we discuss the results of a pilot study in which we use a novel approach to collect entrepreneur online social network data from LinkedIn, Facebook and Twitter. We studied the size and structure of entrepreneur social networks by analysing the online network industry and location

  15. Bayesian exponential random graph modeling of whole-brain structural networks across lifespan

    NARCIS (Netherlands)

    Sinke, Michel R T; Dijkhuizen, Rick M; Caimo, Alberto; Stam, Cornelis J; Otte, Wim

    2016-01-01

    Descriptive neural network analyses have provided important insights into the organization of structural and functional networks in the human brain. However, these analyses have limitations for inter-subject or between-group comparisons in which network sizes and edge densities may differ, such as

  16. Examining the Emergence of Large-Scale Structures in Collaboration Networks: Methods in Sociological Analysis

    Science.gov (United States)

    Ghosh, Jaideep; Kshitij, Avinash

    2017-01-01

    This article introduces a number of methods that can be useful for examining the emergence of large-scale structures in collaboration networks. The study contributes to sociological research by investigating how clusters of research collaborators evolve and sometimes percolate in a collaboration network. Typically, we find that in our networks,…

  17. Is Artificial Neural Network Suitable for Damage Level Determination of Rc- Structures?

    OpenAIRE

    Baltacıoğlu, A. K.; Öztürk, B.; Civalek, Ö.; Akgöz, B.

    2010-01-01

    In the present study, an artificial neural network (ANN) application is introduced for estimation of damage level of reinforced concrete structures. Back-propagation learning algorithm is adopted. A typical neural network architecture is proposed and some conclusions are presented. Applicability of artificial neural network (ANN) for the assessment of earthquake related damage is investigated

  18. On Line Segment Length and Mapping 4-regular Grid Structures in Network Infrastructures

    DEFF Research Database (Denmark)

    Riaz, Muhammad Tahir; Nielsen, Rasmus Hjorth; Pedersen, Jens Myrup

    2006-01-01

    The paper focuses on mapping the road network into 4-regular grid structures. A mapping algorithm is proposed. To model the road network GIS data have been used. The Geographic Information System (GIS) data for the road network are composed with different size of line segment lengths...

  19. Does where you stand depend on who you behave? Networking behavior as an alternative explanation for gender differences in network structure

    NARCIS (Netherlands)

    Gremmen, I.; Akkerman, A.; Benschop, Y.

    2013-01-01

    The purpose of this study is to gain insight into the relations between gender, networking behavior and network structure, in order to investigate the relevance of gender for organizational networks. Semi-structured interviews with 39 white, Dutch, women and men account managers were analyzed both

  20. Does where you stand depend on how you behave? Networking behavior as an alternative explanation for gender differences in network structure

    NARCIS (Netherlands)

    Gremmen, C.C.M.; Akkerman, A.; Benschop, Y.W.M.

    2013-01-01

    The purpose of this study is to gain insight into the relations between gender, networking behavior and network structure, in order to investigate the relevance of gender for organizational networks. Semi-structured interviews with 39 white, Dutch, women and men account managers were analyzed both

  1. Technical Network

    CERN Multimedia

    2007-01-01

    In order to optimise the management of the Technical Network (TN), to facilitate understanding of the purpose of devices connected to the TN and to improve security incident handling, the Technical Network Administrators and the CNIC WG have asked IT/CS to verify the "description" and "tag" fields of devices connected to the TN. Therefore, persons responsible for systems connected to the TN will receive e-mails from IT/CS asking them to add the corresponding information in the network database at "network-cern-ch". Thank you very much for your cooperation. The Technical Network Administrators & the CNIC WG

  2. A user exposure based approach for non-structural road network vulnerability analysis.

    Directory of Open Access Journals (Sweden)

    Lei Jin

    Full Text Available Aiming at the dense urban road network vulnerability without structural negative consequences, this paper proposes a novel non-structural road network vulnerability analysis framework. Three aspects of the framework are mainly described: (i the rationality of non-structural road network vulnerability, (ii the metrics for negative consequences accounting for variant road conditions, and (iii the introduction of a new vulnerability index based on user exposure. Based on the proposed methodology, a case study in the Sioux Falls network which was usually threatened by regular heavy snow during wintertime is detailedly discussed. The vulnerability ranking of links of Sioux Falls network with respect to heavy snow scenario is identified. As a result of non-structural consequences accompanied by conceivable degeneration of network, there are significant increases in generalized travel time costs which are measurements for "emotionally hurt" of topological road network.

  3. The human functional brain network demonstrates structural and dynamical resilience to targeted attack.

    Science.gov (United States)

    Joyce, Karen E; Hayasaka, Satoru; Laurienti, Paul J

    2013-01-01

    In recent years, the field of network science has enabled researchers to represent the highly complex interactions in the brain in an approachable yet quantitative manner. One exciting finding since the advent of brain network research was that the brain network can withstand extensive damage, even to highly connected regions. However, these highly connected nodes may not be the most critical regions of the brain network, and it is unclear how the network dynamics are impacted by removal of these key nodes. This work seeks to further investigate the resilience of the human functional brain network. Network attack experiments were conducted on voxel-wise functional brain networks and region-of-interest (ROI) networks of 5 healthy volunteers. Networks were attacked at key nodes using several criteria for assessing node importance, and the impact on network structure and dynamics was evaluated. The findings presented here echo previous findings that the functional human brain network is highly resilient to targeted attacks, both in terms of network structure and dynamics.

  4. The human functional brain network demonstrates structural and dynamical resilience to targeted attack.

    Directory of Open Access Journals (Sweden)

    Karen E Joyce

    Full Text Available In recent years, the field of network science has enabled researchers to represent the highly complex interactions in the brain in an approachable yet quantitative manner. One exciting finding since the advent of brain network research was that the brain network can withstand extensive damage, even to highly connected regions. However, these highly connected nodes may not be the most critical regions of the brain network, and it is unclear how the network dynamics are impacted by removal of these key nodes. This work seeks to further investigate the resilience of the human functional brain network. Network attack experiments were conducted on voxel-wise functional brain networks and region-of-interest (ROI networks of 5 healthy volunteers. Networks were attacked at key nodes using several criteria for assessing node importance, and the impact on network structure and dynamics was evaluated. The findings presented here echo previous findings that the functional human brain network is highly resilient to targeted attacks, both in terms of network structure and dynamics.

  5. On the topologic structure of economic complex networks: Empirical evidence from large scale payment network of Estonia

    Science.gov (United States)

    Rendón de la Torre, Stephanie; Kalda, Jaan; Kitt, Robert; Engelbrecht, Jüri

    2016-09-01

    This paper presents the first topological analysis of the economic structure of an entire country based on payments data obtained from Swedbank. This data set is exclusive in its kind because around 80% of Estonia's bank transactions are done through Swedbank, hence, the economic structure of the country can be reconstructed. Scale-free networks are commonly observed in a wide array of different contexts such as nature and society. In this paper, the nodes are comprised by customers of the bank (legal entities) and the links are established by payments between these nodes. We study the scaling-free and structural properties of this network. We also describe its topology, components and behaviors. We show that this network shares typical structural characteristics known in other complex networks: degree distributions follow a power law, low clustering coefficient and low average shortest path length. We identify the key nodes of the network and perform simulations of resiliency against random and targeted attacks of the nodes with two different approaches. With this, we find that by identifying and studying the links between the nodes is possible to perform vulnerability analysis of the Estonian economy with respect to economic shocks.

  6. Network science

    CERN Document Server

    Barabasi, Albert-Laszlo

    2016-01-01

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

  7. Vulnerability of network of networks

    Science.gov (United States)

    Havlin, S.; Kenett, D. Y.; Bashan, A.; Gao, J.; Stanley, H. E.

    2014-10-01

    Our dependence on networks - be they infrastructure, economic, social or others - leaves us prone to crises caused by the vulnerabilities of these networks. There is a great need to develop new methods to protect infrastructure networks and prevent cascade of failures (especially in cases of coupled networks). Terrorist attacks on transportation networks have traumatized modern societies. With a single blast, it has become possible to paralyze airline traffic, electric power supply, ground transportation or Internet communication. How, and at which cost can one restructure the network such that it will become more robust against malicious attacks? The gradual increase in attacks on the networks society depends on - Internet, mobile phone, transportation, air travel, banking, etc. - emphasize the need to develop new strategies to protect and defend these crucial networks of communication and infrastructure networks. One example is the threat of liquid explosives a few years ago, which completely shut down air travel for days, and has created extreme changes in regulations. Such threats and dangers warrant the need for new tools and strategies to defend critical infrastructure. In this paper we review recent advances in the theoretical understanding of the vulnerabilities of interdependent networks with and without spatial embedding, attack strategies and their affect on such networks of networks as well as recently developed strategies to optimize and repair failures caused by such attacks.

  8. Virality prediction and community structure in social networks.

    Science.gov (United States)

    Weng, Lilian; Menczer, Filippo; Ahn, Yong-Yeol

    2013-01-01

    How does network structure affect diffusion? Recent studies suggest that the answer depends on the type of contagion. Complex contagions, unlike infectious diseases (simple contagions), are affected by social reinforcement and homophily. Hence, the spread within highly clustered communities is enhanced, while diffusion across communities is hampered. A common hypothesis is that memes and behaviors are complex contagions. We show that, while most memes indeed spread like complex contagions, a few viral memes spread across many communities, like diseases. We demonstrate that the future popularity of a meme can be predicted by quantifying its early spreading pattern in terms of community concentration. The more communities a meme permeates, the more viral it is. We present a practical method to translate data about community structure into predictive knowledge about what information will spread widely. This connection contributes to our understanding in computational social science, social media analytics, and marketing applications.

  9. Passively Damped Laminated Piezoelectric Shell Structures with Integrated Electric Networks

    Science.gov (United States)

    Saravanos, Dimitris A.

    1999-01-01

    Multi-field mechanics are presented for curvilinear piezoelectric laminates interfaced with distributed passive electric components. The equations of motion for laminated piezoelectric shell structures with embedded passive electric networks are directly formulated and solved using a finite element methodology. The modal damping and frequencies of the piezoelectric shell are calculated from the poles of the system. Experimental and numerical results are presented for the modal damping and frequency of composite beams with a resistively shunted piezoceramic patch. The modal damping and frequency of plates, cylindrical shells and cylindrical composite blades with piezoelectric-resistor layers are predicted. Both analytical and experimental studies illustrate a unique dependence of modal damping and frequencies on the shunting resistance and show the effect of structural shape and curvature on piezoelectric damping.

  10. Crystal Structure Representation for Neural Networks using Topological Approach.

    Science.gov (United States)

    Fedorov, Aleksandr V; Shamanaev, Ivan V

    2017-08-01

    In the present work we describe a new approach, which uses topology of crystals for physicochemical properties prediction using artificial neural networks (ANN). The topologies of 268 crystal structures were determined using ToposPro software. Quotient graphs were used to identify topological centers and their neighbors. The topological approach was illustrated by training ANN to predict molar heat capacity, standard molar entropy and lattice energy of 268 crystals with different compositions and structures (metals, inorganic salts, oxides, etc.). ANN was trained using Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. Mean absolute percentage error of predicted properties was ≤8 %. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

  11. Virality Prediction and Community Structure in Social Networks

    Science.gov (United States)

    Weng, Lilian; Menczer, Filippo; Ahn, Yong-Yeol

    2013-08-01

    How does network structure affect diffusion? Recent studies suggest that the answer depends on the type of contagion. Complex contagions, unlike infectious diseases (simple contagions), are affected by social reinforcement and homophily. Hence, the spread within highly clustered communities is enhanced, while diffusion across communities is hampered. A common hypothesis is that memes and behaviors are complex contagions. We show that, while most memes indeed spread like complex contagions, a few viral memes spread across many communities, like diseases. We demonstrate that the future popularity of a meme can be predicted by quantifying its early spreading pattern in terms of community concentration. The more communities a meme permeates, the more viral it is. We present a practical method to translate data about community structure into predictive knowledge about what information will spread widely. This connection contributes to our understanding in computational social science, social media analytics, and marketing applications.

  12. Synconset waves and chains: spiking onsets in synchronous populations predict and are predicted by network structure.

    Directory of Open Access Journals (Sweden)

    Mohan Raghavan

    Full Text Available Synfire waves are propagating spike packets in synfire chains, which are feedforward chains embedded in random networks. Although synfire waves have proved to be effective quantification for network activity with clear relations to network structure, their utilities are largely limited to feedforward networks with low background activity. To overcome these shortcomings, we describe a novel generalisation of synfire waves, and define 'synconset wave' as a cascade of first spikes within a synchronisation event. Synconset waves would occur in 'synconset chains', which are feedforward chains embedded in possibly heavily recurrent networks with heavy background activity. We probed the utility of synconset waves using simulation of single compartment neuron network models with biophysically realistic conductances, and demonstrated that the spread of synconset waves directly follows from the network connectivity matrix and is modulated by top-down inputs and the resultant oscillations. Such synconset profiles lend intuitive insights into network organisation in terms of connection probabilities between various network regions rather than an adjacency matrix. To test this intuition, we develop a Bayesian likelihood function that quantifies the probability that an observed synfire wave was caused by a given network. Further, we demonstrate it's utility in the inverse problem of identifying the network that caused a given synfire wave. This method was effective even in highly subsampled networks where only a small subset of neurons were accessible, thus showing it's utility in experimental estimation of connectomes in real neuronal-networks. Together, we propose synconset chains/waves as an effective framework for understanding the impact of network structure on function, and as a step towards developing physiology-driven network identification methods. Finally, as synconset chains extend the utilities of synfire chains to arbitrary networks, we suggest

  13. Seasonal changes in the structure of rhesus macaque social networks.

    Science.gov (United States)

    Brent, Lauren J N; Maclarnon, Ann; Platt, Michael L; Semple, Stuart

    2013-03-01

    Social structure emerges from the patterning of interactions between individuals and plays a critical role in shaping some of the main characteristics of animal populations. The topological features of social structure, such as the extent to which individuals interact in clusters, can influence many biologically important factors, including the persistence of cooperation, and the rate of spread of disease. Yet the extent to which social structure topology fluctuates over relatively short periods of time in relation to social, demographic or environmental events remains unclear. Here, we use social network analysis to examine seasonal changes in the topology of social structures that emerge from socio-positive associations in adult female rhesus macaques ( Macaca mulatta ). Behavioral data for two different association types (grooming, spatial proximity) were collected for females in two free-ranging groups during two seasons: the mating and birth seasons. Stronger dyadic bonds resulted in social structures that were more tightly connected (i.e. of greater density) in the mating season compared to the birth season. Social structures were also more centralized around a subset of individuals, and were more clustered in the mating season than the birth season, although the latter differences were mostly driven by differences in density alone. Our results suggest a degree of temporal variation in the topological features of social structure in this population. Such variation may feed back on interactions, hence affecting the behaviors of individuals, and may therefore be important to take into account in studies of animal behavior.

  14. Integrated sensor network for monitoring steel corrosion in concrete structures

    Directory of Open Access Journals (Sweden)

    José Enrique Ramón

    2016-06-01

    Full Text Available Corrosion is one of the main triggering factors affecting the service life and durability of structures. Several methods are used for corrosion studies but electrochemical techniques are the most commonly applied. Corrosion processes monitoring and control by means of non-destructive techniques, such as the implementation of embedded sensors, has been the target of many works.  It is possible to obtain relevant information of structural corrosion processes in real time. This document describes a system including specific equipment and which allows obtaining relevant information about these corrosion processes. This system is formed by a sensor network. There are several types of electrodes, which are distributed throughout the structure under study and a specific equipment developed by the research group, which is used to determine pertinent parameters such as the corrosion potential (Ecorr and the corrosion density (icorr by applying sequences of potentiostatic pulses. The system allows to reliably determine the corrosion rate in different areas of the structure. The sensor, due to its configuration, provides information of a specific area of the structure, but on the other hand it is involved in the galvanic events that can occur along the structure by differential aeration, galvanic cells, etc. because the sensor is not isolated from the structure.  This system also procures information of buried and submerged elements. Besides, it is possible to obtain information related to temperature, concrete resistance. The system includes specific potentiometric sensors to monitor chloride access and carbonatation processes.

  15. Network motif identification and structure detection with exponential random graph models

    Directory of Open Access Journals (Sweden)

    Munni Begum

    2014-12-01

    Full Text Available Local regulatory motifs are identified in the transcription regulatory network of the most studied model organism Escherichia coli (E. coli through graphical models. Network motifs are small structures in a network that appear more frequently than expected by chance alone. We apply social network methodologies such as p* models, also known as Exponential Random Graph Models (ERGMs, to identify statistically significant network motifs. In particular, we generate directed graphical models that can be applied to study interaction networks in a broad range of databases. The Markov Chain Monte Carlo (MCMC computational algorithms are implemented to obtain the estimates of model parameters to the corresponding network statistics. A variety of ERGMs are fitted to identify statistically significant network motifs in transcription regulatory networks of E. coli. A total of nine ERGMs are fitted to study the transcription factor - transcription factor interactions and eleven ERGMs are fitted for the transcription factor-operon interactions. For both of these interaction networks, arc (a directed edge in a directed network and k-istar (or incoming star structures, for values of k between 2 and 10, are found to be statistically significant local structures or network motifs. The goodness of fit statistics are provided to determine the quality of these models.

  16. Neural networks for harmonic structure in music perception and action.

    Science.gov (United States)

    Bianco, R; Novembre, G; Keller, P E; Kim, Seung-Goo; Scharf, F; Friederici, A D; Villringer, A; Sammler, D

    2016-11-15

    The ability to predict upcoming structured events based on long-term knowledge and contextual priors is a fundamental principle of human cognition. Tonal music triggers predictive processes based on structural properties of harmony, i.e., regularities defining the arrangement of chords into well-formed musical sequences. While the neural architecture of structure-based predictions during music perception is well described, little is known about the neural networks for analogous predictions in musical actions and how they relate to auditory perception. To fill this gap, expert pianists were presented with harmonically congruent or incongruent chord progressions, either as musical actions (photos of a hand playing chords) that they were required to watch and imitate without sound, or in an auditory format that they listened to without playing. By combining task-based functional magnetic resonance imaging (fMRI) with functional connectivity at rest, we identified distinct sub-regions in right inferior frontal gyrus (rIFG) interconnected with parietal and temporal areas for processing action and audio sequences, respectively. We argue that the differential contribution of parietal and temporal areas is tied to motoric and auditory long-term representations of harmonic regularities that dynamically interact with computations in rIFG. Parsing of the structural dependencies in rIFG is co-determined by both stimulus- or task-demands. In line with contemporary models of prefrontal cortex organization and dual stream models of visual-spatial and auditory processing, we show that the processing of musical harmony is a network capacity with dissociated dorsal and ventral motor and auditory circuits, which both provide the infrastructure for predictive mechanisms optimising action and perception performance. Copyright © 2016 Elsevier Inc. All rights reserved.

  17. Modular structure of functional networks in olfactory memory.

    Science.gov (United States)

    Meunier, David; Fonlupt, Pierre; Saive, Anne-Lise; Plailly, Jane; Ravel, Nadine; Royet, Jean-Pierre

    2014-07-15

    Graph theory enables the study of systems by describing those systems as a set of nodes and edges. Graph theory has been widely applied to characterize the overall structure of data sets in the social, technological, and biological sciences, including neuroscience. Modular structure decomposition enables the definition of sub-networks whose components are gathered in the same module and work together closely, while working weakly with components from other modules. This processing is of interest for studying memory, a cognitive process that is widely distributed. We propose a new method to identify modular structure in task-related functional magnetic resonance imaging (fMRI) networks. The modular structure was obtained directly from correlation coefficients and thus retained information about both signs and weights. The method was applied to functional data acquired during a yes-no odor recognition memory task performed by young and elderly adults. Four response categories were explored: correct (Hit) and incorrect (False alarm, FA) recognition and correct and incorrect rejection. We extracted time series data for 36 areas as a function of response categories and age groups and calculated condition-based weighted correlation matrices. Overall, condition-based modular partitions were more homogeneous in young than elderly subjects. Using partition similarity-based statistics and a posteriori statistical analyses, we demonstrated that several areas, including the hippocampus, caudate nucleus, and anterior cingulate gyrus, belonged to the same module more frequently during Hit than during all other conditions. Modularity values were negatively correlated with memory scores in the Hit condition and positively correlated with bias scores (liberal/conservative attitude) in the Hit and FA conditions. We further demonstrated that the proportion of positive and negative links between areas of different modules (i.e., the proportion of correlated and anti-correlated areas

  18. Radiation-Induced Topological Disorder in Irradiated Network Structures

    Energy Technology Data Exchange (ETDEWEB)

    Hobbs, Linn W.

    2002-12-21

    This report summarizes results of a research program investigating the fundamental principles underlying the phenomenon of topological disordering in a radiation environment. This phenomenon is known popularly as amorphization, but is more formally described as a process of radiation-induced structural arrangement that leads in crystals to loss of long-range translational and orientational correlations and in glasses to analogous alteration of connectivity topologies. The program focus has been on a set compound ceramic solids with directed bonding exhibiting structures that can be described as networks. Such solids include SiO2, Si3N4, SiC, which are of interest to applications in fusion energy production, nuclear waste storage, and device manufacture involving ion implantation or use in radiation fields. The principal investigative tools comprise a combination of experimental diffraction-based techniques, topological modeling, and molecular-dynamics simulations that have proven a rich source of information in the preceding support period. The results from the present support period fall into three task areas. The first comprises enumeration of the rigidity constraints applying to (1) more complex ceramic structures (such as rutile, corundum, spinel and olivine structures) that exhibit multiply polytopic coordination units or multiple modes of connecting such units, (2) elemental solids (such as graphite, silicon and diamond) for which a correct choice of polytope is necessary to achieve correct representation of the constraints, and (3) compounds (such as spinel and silicon carbide) that exhibit chemical disorder on one or several sublattices. With correct identification of the topological constraints, a unique correlation is shown to exist between constraint and amorphizability which demonstrates that amorphization occurs at a critical constraint loss. The second task involves the application of molecular dynamics (MD) methods to topologically-generated models

  19. The structure and evolution of buyer-supplier networks.

    Science.gov (United States)

    Mizuno, Takayuki; Souma, Wataru; Watanabe, Tsutomu

    2014-01-01

    In this paper, we investigate the structure and evolution of customer-supplier networks in Japan using a unique dataset that contains information on customer and supplier linkages for more than 500,000 incorporated non-financial firms for the five years from 2008 to 2012. We find, first, that the number of customer links is unequal across firms; the customer link distribution has a power-law tail with an exponent of unity (i.e., it follows Zipf's law). We interpret this as implying that competition among firms to acquire new customers yields winners with a large number of customers, as well as losers with fewer customers. We also show that the shortest path length for any pair of firms is, on average, 4.3 links. Second, we find that link switching is relatively rare. Our estimates indicate that the survival rate per year for customer links is 92 percent and for supplier links 93 percent. Third and finally, we find that firm growth rates tend to be more highly correlated the closer two firms are to each other in a customer-supplier network (i.e., the smaller is the shortest path length for the two firms). This suggests that a non-negligible portion of fluctuations in firm growth stems from the propagation of microeconomic shocks - shocks affecting only a particular firm - through customer-supplier chains.

  20. Fuzzy stochastic neural network model for structural system identification

    Science.gov (United States)

    Jiang, Xiaomo; Mahadevan, Sankaran; Yuan, Yong

    2017-01-01

    This paper presents a dynamic fuzzy stochastic neural network model for nonparametric system identification using ambient vibration data. The model is developed to handle two types of imprecision in the sensed data: fuzzy information and measurement uncertainties. The dimension of the input vector is determined by using the false nearest neighbor approach. A Bayesian information criterion is applied to obtain the optimum number of stochastic neurons in the model. A fuzzy C-means clustering algorithm is employed as a data mining tool to divide the sensed data into clusters with common features. The fuzzy stochastic model is created by combining the fuzzy clusters of input vectors with the radial basis activation functions in the stochastic neural network. A natural gradient method is developed based on the Kullback-Leibler distance criterion for quick convergence of the model training. The model is validated using a power density pseudospectrum approach and a Bayesian hypothesis testing-based metric. The proposed methodology is investigated with numerically simulated data from a Markov Chain model and a two-story planar frame, and experimentally sensed data from ambient vibration data of a benchmark structure.

  1. Energy Harvesting for Structural Health Monitoring Sensor Networks

    Energy Technology Data Exchange (ETDEWEB)

    Park, G.; Farrar, C. R.; Todd, M. D.; Hodgkiss, T.; Rosing, T.

    2007-02-26

    This report has been developed based on information exchanges at a 2.5-day workshop on energy harvesting for embedded structural health monitoring (SHM) sensing systems that was held June 28-30, 2005, at Los Alamos National Laboratory. The workshop was hosted by the LANL/UCSD Engineering Institute (EI). This Institute is an education- and research-focused collaboration between Los Alamos National Laboratory (LANL) and the University of California, San Diego (UCSD), Jacobs School of Engineering. A Statistical Pattern Recognition paradigm for SHM is first presented and the concept of energy harvesting for embedded sensing systems is addressed with respect to the data acquisition portion of this paradigm. Next, various existing and emerging sensing modalities used for SHM and their respective power requirements are summarized, followed by a discussion of SHM sensor network paradigms, power requirements for these networks and power optimization strategies. Various approaches to energy harvesting and energy storage are discussed and limitations associated with the current technology are addressed. This discussion also addresses current energy harvesting applications and system integration issues. The report concludes by defining some future research directions and possible technology demonstrations that are aimed at transitioning the concept of energy harvesting for embedded SHM sensing systems from laboratory research to field-deployed engineering prototypes.

  2. Systems glycobiology: biochemical reaction networks regulating glycan structure and function.

    Science.gov (United States)

    Neelamegham, Sriram; Liu, Gang

    2011-12-01

    There is a growing use of bioinformatics based methods in the field of Glycobiology. These have been used largely to curate glycan structures, organize array-based experimental data and display existing knowledge of glycosylation-related pathways in silico. Although the cataloging of vast amounts of data is beneficial, it is often a challenge to gain meaningful mechanistic insight from this exercise alone. The development of specific analysis tools to query the database is necessary. If these queries can integrate existing knowledge of glycobiology, new insights may be gained. Such queries that couple biochemical knowledge and mathematics have been developed in the field of Systems Biology. The current review summarizes the current state of the art in the application of computational modeling in the field of Glycobiology. It provides (i) an overview of experimental and online resources that can be used to construct glycosylation reaction networks, (ii) mathematical methods to formulate the problem including a description of ordinary differential equation and logic-based reaction networks, (iii) optimization techniques that can be applied to fit experimental data for the purpose of model reconstruction and for evaluating unknown model parameters, (iv) post-simulation analysis methods that yield experimentally testable hypotheses and (v) a summary of available software tools that can be used by non-specialists to perform many of the above functions. © The Author 2011. Published by Oxford University Press. All rights reserved.

  3. Systems glycobiology: biochemical reaction networks regulating glycan structure and function

    Science.gov (United States)

    Neelamegham, Sriram; Liu, Gang

    2011-01-01

    There is a growing use of bioinformatics based methods in the field of Glycobiology. These have been used largely to curate glycan structures, organize array-based experimental data and display existing knowledge of glycosylation-related pathways in silico. Although the cataloging of vast amounts of data is beneficial, it is often a challenge to gain meaningful mechanistic insight from this exercise alone. The development of specific analysis tools to query the database is necessary. If these queries can integrate existing knowledge of glycobiology, new insights may be gained. Such queries that couple biochemical knowledge and mathematics have been developed in the field of Systems Biology. The current review summarizes the current state of the art in the application of computational modeling in the field of Glycobiology. It provides (i) an overview of experimental and online resources that can be used to construct glycosylation reaction networks, (ii) mathematical methods to formulate the problem including a description of ordinary differential equation and logic-based reaction networks, (iii) optimization techniques that can be applied to fit experimental data for the purpose of model reconstruction and for evaluating unknown model parameters, (iv) post-simulation analysis methods that yield experimentally testable hypotheses and (v) a summary of available software tools that can be used by non-specialists to perform many of the above functions. PMID:21436236

  4. The structure and evolution of buyer-supplier networks.

    Directory of Open Access Journals (Sweden)

    Takayuki Mizuno

    Full Text Available In this paper, we investigate the structure and evolution of customer-supplier networks in Japan using a unique dataset that contains information on customer and supplier linkages for more than 500,000 incorporated non-financial firms for the five years from 2008 to 2012. We find, first, that the number of customer links is unequal across firms; the customer link distribution has a power-law tail with an exponent of unity (i.e., it follows Zipf's law. We interpret this as implying that competition among firms to acquire new customers yields winners with a large number of customers, as well as losers with fewer customers. We also show that the shortest path length for any pair of firms is, on average, 4.3 links. Second, we find that link switching is relatively rare. Our estimates indicate that the survival rate per year for customer links is 92 percent and for supplier links 93 percent. Third and finally, we find that firm growth rates tend to be more highly correlated the closer two firms are to each other in a customer-supplier network (i.e., the smaller is the shortest path length for the two firms. This suggests that a non-negligible portion of fluctuations in firm growth stems from the propagation of microeconomic shocks - shocks affecting only a particular firm - through customer-supplier chains.

  5. Using multi-step proposal distribution for improved MCMC convergence in Bayesian network structure learning.

    Science.gov (United States)

    Larjo, Antti; Lähdesmäki, Harri

    2015-12-01

    Bayesian networks have become popular for modeling probabilistic relationships between entities. As their structure can also be given a causal interpretation about the studied system, they can be used to learn, for example, regulatory relationships of genes or proteins in biological networks and pathways. Inference of the Bayesian network structure is complicated by the size of the model structure space, necessitating the use of optimization methods or sampling techniques, such Markov Chain Monte Carlo (MCMC) methods. However, convergence of MCMC chains is in many cases slow and can become even a harder issue as the dataset size grows. We show here how to improve convergence in the Bayesian network structure space by using an adjustable proposal distribution with the possibility to propose a wide range of steps in the structure space, and demonstrate improved network structure inference by analyzing phosphoprotein data from the human primary T cell signaling network.

  6. Modeling network technology deployment rates with different network models

    OpenAIRE

    Chung, Yoo

    2011-01-01

    To understand the factors that encourage the deployment of a new networking technology, we must be able to model how such technology gets deployed. We investigate how network structure influences deployment with a simple deployment model and different network models through computer simulations. The results indicate that a realistic model of networking technology deployment should take network structure into account.

  7. Comparative study on the topological structure of China Education Network

    Science.gov (United States)

    Yu, Ming-Min; Zhang, Ning; Mao, Guo-Yong

    2017-07-01

    China Education Network (CEN) of year 2014 was studied as a complex network object. By searching the domain of “.edu.cn” and filtering some unexpected results, we finally get a network with 14,100,628 pages and 213,513,401 links. The topology of this network was studied to get the features such as out-degree distribution, in-degree distribution and average shortest path length. These features were compared with that of year 2007 and 2004 to observe the evolution mechanisms of CEN. According to the statistical results, it is found that some topology features of CEN such as out-degree distribution, in-degree distribution and average shortest path have changed a lot and the related reasons for these changes are given in this paper.

  8. Uncovering Gene Regulatory Networks from Time-Series Microarray Data with Variational Bayesian Structural Expectation Maximization

    Directory of Open Access Journals (Sweden)

    Huang Yufei

    2007-01-01

    Full Text Available We investigate in this paper reverse engineering of gene regulatory networks from time-series microarray data. We apply dynamic Bayesian networks (DBNs for modeling cell cycle regulations. In developing a network inference algorithm, we focus on soft solutions that can provide a posteriori probability (APP of network topology. In particular, we propose a variational Bayesian structural expectation maximization algorithm that can learn the posterior distribution of the network model parameters and topology jointly. We also show how the obtained APPs of the network topology can be used in a Bayesian data integration strategy to integrate two different microarray data sets. The proposed VBSEM algorithm has been tested on yeast cell cycle data sets. To evaluate the confidence of the inferred networks, we apply a moving block bootstrap method. The inferred network is validated by comparing it to the KEGG pathway map.

  9. Fragmentation alters stream fish community structure in dendritic ecological networks.

    Science.gov (United States)

    Perkin, Joshuah S; Gido, Keith B

    2012-12-01

    Effects of fragmentation on the ecology of organisms occupying dendritic ecological networks (DENs) have recently been described through both conceptual and mathematical models, but few hypotheses have been tested in complex, real-world ecosystems. Stream fishes provide a model system for assessing effects of fragmentation on the structure of communities occurring within DENs, including how fragmentation alters metacommunity dynamics and biodiversity. A recently developed habitat-availability measure, the "dendritic connectivity index" (DCI), allows for assigning quantitative measures of connectivity in DENs regardless of network extent or complexity, and might be used to predict fish community response to fragmentation. We characterized stream fish community structure in 12 DENs in the Great Plains, USA, during periods of dynamic (summer) and muted (fall) discharge regimes to test the DCI as a predictive model of fish community response to fragmentation imposed by road crossings. Results indicated that fish communities in stream segments isolated by road crossings had reduced species richness (alpha diversity) relative to communities that maintained connectivity with the surrounding DEN during summer and fall. Furthermore, isolated communities had greater dissimilarity (beta diversity) to downstream sites notisolated by road crossings during summer and fall. Finally, dissimilarity among communities within DENs decreased as a function of increased habitat connectivity (measured using the DCI) for summer and fall, suggesting that communities within highly connected DENs tend to be more homogeneous. Our results indicate that the DCI is sensitive to community effects of fragmentation in riverscapes and might be used by managers to predict ecological responses to changes in habitat connectivity. Moreover, our findings illustrate that relating structural connectivity of riverscapes to functional connectivity among communities might aid in maintaining metacommunity

  10. Ethnicity and population structure in personal naming networks.

    Directory of Open Access Journals (Sweden)

    Pablo Mateos

    Full Text Available Personal naming practices exist in all human groups and are far from random. Rather, they continue to reflect social norms and ethno-cultural customs that have developed over generations. As a consequence, contemporary name frequency distributions retain distinct geographic, social and ethno-cultural patterning that can be exploited to understand population structure in human biology, public health and social science. Previous attempts to detect and delineate such structure in large populations have entailed extensive empirical analysis of naming conventions in different parts of the world without seeking any general or automated methods of population classification by ethno-cultural origin. Here we show how 'naming networks', constructed from forename-surname pairs of a large sample of the contemporary human population in 17 countries, provide a valuable representation of cultural, ethnic and linguistic population structure around the world. This innovative approach enriches and adds value to automated population classification through conventional national data sources such as telephone directories and electoral registers. The method identifies clear social and ethno-cultural clusters in such naming networks that extend far beyond the geographic areas in which particular names originated, and that are preserved even after international migration. Moreover, one of the most striking findings of this approach is that these clusters simply 'emerge' from the aggregation of millions of individual decisions on parental naming practices for their children, without any prior knowledge introduced by the researcher. Our probabilistic approach to community assignment, both at city level as well as at a global scale, helps to reveal the degree of isolation, integration or overlap between human populations in our rapidly globalising world. As such, this work has important implications for research in population genetics, public health, and social science

  11. Ethnicity and population structure in personal naming networks.

    Science.gov (United States)

    Mateos, Pablo; Longley, Paul A; O'Sullivan, David

    2011-01-01

    Personal naming practices exist in all human groups and are far from random. Rather, they continue to reflect social norms and ethno-cultural customs that have developed over generations. As a consequence, contemporary name frequency distributions retain distinct geographic, social and ethno-cultural patterning that can be exploited to understand population structure in human biology, public health and social science. Previous attempts to detect and delineate such structure in large populations have entailed extensive empirical analysis of naming conventions in different parts of the world without seeking any general or automated methods of population classification by ethno-cultural origin. Here we show how 'naming networks', constructed from forename-surname pairs of a large sample of the contemporary human population in 17 countries, provide a valuable representation of cultural, ethnic and linguistic population structure around the world. This innovative approach enriches and adds value to automated population classification through conventional national data sources such as telephone directories and electoral registers. The method identifies clear social and ethno-cultural clusters in such naming networks that extend far beyond the geographic areas in which particular names originated, and that are preserved even after international migration. Moreover, one of the most striking findings of this approach is that these clusters simply 'emerge' from the aggregation of millions of individual decisions on parental naming practices for their children, without any prior knowledge introduced by the researcher. Our probabilistic approach to community assignment, both at city level as well as at a global scale, helps to reveal the degree of isolation, integration or overlap between human populations in our rapidly globalising world. As such, this work has important implications for research in population genetics, public health, and social science adding new

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

    Science.gov (United States)

    John, Majnu; Ikuta, Toshikazu; Ferbinteanu, Janina

    2017-03-01

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

  13. Network Coded Software Defined Networking

    DEFF Research Database (Denmark)

    Hansen, Jonas; Roetter, Daniel Enrique Lucani; Krigslund, Jeppe

    2015-01-01

    . The inherent flexibility of both SDN and NC provides fertile ground to envision more efficient, robust, and secure networking designs, which may also incorporate content caching and storage, all of which are key challenges of the upcoming 5G networks. This article not only proposes the fundamentals......Software defined networking has garnered large attention due to its potential to virtualize services in the Internet, introducing flexibility in the buffering, scheduling, processing, and routing of data in network routers. SDN breaks the deadlock that has kept Internet network protocols stagnant...... for decades, while applications and physical links have evolved. This article advocates for the use of SDN to bring about 5G network services by incorporating network coding (NC) functionalities. The latter constitutes a major leap forward compared to the state-of-the- art store and forward Internet paradigm...

  14. Network Coded Software Defined Networking

    DEFF Research Database (Denmark)

    Krigslund, Jeppe; Hansen, Jonas; Roetter, Daniel Enrique Lucani

    2015-01-01

    Software Defined Networking (SDN) and Network Coding (NC) are two key concepts in networking that have garnered a large attention in recent years. On the one hand, SDN's potential to virtualize services in the Internet allows a large flexibility not only for routing data, but also to manage....... This paper advocates for the use of SDN to bring about future Internet and 5G network services by incorporating network coding (NC) functionalities. The inherent flexibility of both SDN and NC provides a fertile ground to envision more efficient, robust, and secure networking designs, that may also...... incorporate content caching and storage, all of which are key challenges of the future Internet and the upcoming 5G networks. This paper proposes some of the keys behind this intersection and supports it with use cases as well as a an implementation that integrated the Kodo library (NC) into OpenFlow (SDN...

  15. An object recognition using structured light and neural networks

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Byeong Gab; Kim, Dong Gi; Kang, E Sok [Chungnam National Univ., Taejon (Korea, Republic of); Yoon, Ji Sup [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1997-12-31

    This paper presents a 3D image processing which uses neural networks to combine a 2D vision camera and a laser slit beam. A laser slit beam from laser source is slitted by a set of cylindrical lenses and the line image of the networks allow to get the 3D image parameters such as the size, the position and the orientation from the line image without knowing the camera intrinsic parameters. (author). 7 refs., 3 tabs., 5 figs.

  16. Network structure and dynamics of the mental workspace.

    Science.gov (United States)

    Schlegel, Alexander; Kohler, Peter J; Fogelson, Sergey V; Alexander, Prescott; Konuthula, Dedeepya; Tse, Peter Ulric

    2013-10-01

    The conscious manipulation of mental representations is central to many creative and uniquely human abilities. How does the human brain mediate such flexible mental operations? Here, multivariate pattern analysis of functional MRI data reveals a widespread neural network that performs specific mental manipulations on the contents of visual imagery. Evolving patterns of neural activity within this mental workspace track the sequence of informational transformations carried out by these manipulations. The network switches between distinct connectivity profiles as representations are maintained or manipulated.

  17. Unraveling the disease consequences and mechanisms of modular structure in animal social networks.

    Science.gov (United States)

    Sah, Pratha; Leu, Stephan T; Cross, Paul C; Hudson, Peter J; Bansal, Shweta

    2017-04-18

    Disease risk is a potential cost of group living. Although modular organization is thought to reduce this cost in animal societies, empirical evidence toward this hypothesis has been conflicting. We analyzed empirical social networks from 43 animal species to motivate our study of the epidemiological consequences of modular structure in animal societies. From these empirical studies, we identified the features of interaction patterns associated with network modularity and developed a theoretical network model to investigate when and how subdivisions in social networks influence disease dynamics. Contrary to prior work, we found that disease risk is largely unaffected by modular structure, although social networks beyond a modular threshold experience smaller disease burden and longer disease duration. Our results illustrate that the lowering of disease burden in highly modular social networks is driven by two mechanisms of modular organization: network fragmentation and subgroup cohesion. Highly fragmented social networks with cohesive subgroups are able to structurally trap infections within a few subgroups and also cause a structural delay to the spread of disease outbreaks. Finally, we show that network models incorporating modular structure are necessary only when prior knowledge suggests that interactions within the population are highly subdivided. Otherwise, null networks based on basic knowledge about group size and local contact heterogeneity may be sufficient when data-limited estimates of epidemic consequences are necessary. Overall, our work does not support the hypothesis that modular structure universally mitigates the disease impact of group living.

  18. Unraveling the disease consequences and mechanisms of modular structure in animal social networks

    Science.gov (United States)

    Sah, Pratha; Leu, Stephan T.; Cross, Paul C.; Hudson, Peter J.; Bansal, Shweta

    2017-01-01

    Disease risk is a potential cost of group living. Although modular organization is thought to reduce this cost in animal societies, empirical evidence toward this hypothesis has been conflicting. We analyzed empirical social networks from 43 animal species to motivate our study of the epidemiological consequences of modular structure in animal societies. From these empirical studies, we identified the features of interaction patterns associated with network modularity and developed a theoretical network model to investigate when and how subdivisions in social networks influence disease dynamics. Contrary to prior work, we found that disease risk is largely unaffected by modular structure, although social networks beyond a modular threshold experience smaller disease burden and longer disease duration. Our results illustrate that the lowering of disease burden in highly modular social networks is driven by two mechanisms of modular organization: network fragmentation and subgroup cohesion. Highly fragmented social networks with cohesive subgroups are able to structurally trap infections within a few subgroups and also cause a structural delay to the spread of disease outbreaks. Finally, we show that network models incorporating modular structure are necessary only when prior knowledge suggests that interactions within the population are highly subdivided. Otherwise, null networks based on basic knowledge about group size and local contact heterogeneity may be sufficient when data-limited estimates of epidemic consequences are necessary. Overall, our work does not support the hypothesis that modular structure universally mitigates the disease impact of group living.

  19. Neural Network Enhanced Structure Determination of Osteoporosis, Immune System, and Radiation Repair Proteins Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The proposed innovation will utilize self learning neural network technology to determine the structure of osteoporosis, immune system disease, and excess radiation...

  20. Fast determination of structurally cohesive subgroups in large networks.

    Science.gov (United States)

    Sinkovits, Robert S; Moody, James; Oztan, B Tolga; White, Douglas R

    2016-11-01

    Structurally cohesive subgroups are a powerful and mathematically rigorous way to characterize network robustness. Their strength lies in the ability to detect strong connections among vertices that not only have no neighbors in common, but that may be distantly separated in the graph. Unfortunately, identifying cohesive subgroups is a computationally intensive problem, which has limited empirical assessments of cohesion to relatively small graphs of at most a few thousand vertices. We describe here an approach that exploits the properties of cliques, k-cores and vertex separators to iteratively reduce the complexity of the graph to the point where standard algorithms can be used to complete the analysis. As a proof of principle, we apply our method to the cohesion analysis of a 29,462-vertex biconnected component extracted from a 128,151-vertex co-authorship data set.

  1. Trichomes: different regulatory networks lead to convergent structures.

    Science.gov (United States)

    Serna, Laura; Martin, Cathie

    2006-06-01

    Sometimes, proteins, biological structures or even organisms have similar functions and appearances but have evolved through widely divergent pathways. There is experimental evidence to suggest that different developmental pathways have converged to produce similar outgrowths of the aerial plant epidermis, referred to as trichomes. The emerging picture suggests that trichomes in Arabidopsis thaliana and, perhaps, in cotton develop through a transcriptional regulatory network that differs from those regulating trichome formation in Antirrhinum and Solanaceous species. Several lines of evidence suggest that the duplication of a gene controlling anthocyanin production and subsequent divergence might be the major force driving trichome formation in Arabidopsis, whereas the multicellular trichomes of Antirrhinum and Solanaceous species appear to have a different regulatory origin.

  2. NML Computation Algorithms for Tree-Structured Multinomial Bayesian Networks

    Directory of Open Access Journals (Sweden)

    Kontkanen Petri

    2007-01-01

    Full Text Available Typical problems in bioinformatics involve large discrete datasets. Therefore, in order to apply statistical methods in such domains, it is important to develop efficient algorithms suitable for discrete data. The minimum description length (MDL principle is a theoretically well-founded, general framework for performing statistical inference. The mathematical formalization of MDL is based on the normalized maximum likelihood (NML distribution, which has several desirable theoretical properties. In the case of discrete data, straightforward computation of the NML distribution requires exponential time with respect to the sample size, since the definition involves a sum over all the possible data samples of a fixed size. In this paper, we first review some existing algorithms for efficient NML computation in the case of multinomial and naive Bayes model families. Then we proceed by extending these algorithms to more complex, tree-structured Bayesian networks.

  3. Telecommunication Networks

    DEFF Research Database (Denmark)

    Olsen, Rasmus Løvenstein; Balachandran, Kartheepan; Hald, Sara Ligaard

    2014-01-01

    In this chapter, we look into the role of telecommunication networks and their capability of supporting critical infrastructure systems and applications. The focus is on smart grids as the key driving example, bearing in mind that other such systems do exist, e.g., water management, traffic control......, etc. First, the role of basic communication is examined with a focus on critical infrastructures. We look at heterogenic networks and standards for smart grids, to give some insight into what has been done to ensure inter-operability in this direction. We then go to the physical network, and look...... at the deployment of the physical layout of the communication network and the related costs. This is an important aspect as one option to use existing networks is to deploy dedicated networks. Following this, we look at some generic models that describe reliability for accessing dynamic information. This part...

  4. Networked Identities

    DEFF Research Database (Denmark)

    Ryberg, Thomas; Larsen, Malene Charlotte

    2008-01-01

    In this article we take up a critique of the concept of Communities of Practice (CoP) voiced by several authors, who suggest that networks may provide a better metaphor to understand social forms of organisation and learning. Through a discussion of the notion of networked learning and the critique...... of CoPs we shall argue that the metaphor or theory of networked learning is itself confronted with some central tensions and challenges that need to be addressed. We then explore these theoretical and analytic challenges to the network metaphor, through an analysis of a Danish social networking site. We...... argue that understanding meaning-making and ‘networked identities’ may be relevant analytic entry points in navigating the challenges....

  5. Structural optimisation of district heating networks; Strukturoptimierung von Fernwaermenetzen. Expansionsplaner

    Energy Technology Data Exchange (ETDEWEB)

    Hackner, J. [Energie-Versorgung Niederoesterreich AG (EVN), Maria Enzersdorf (Austria)

    2003-05-01

    More and more communities are opting for district heating supply. But many projects fail due to an apparent lack of feasibility - more precisely: due to a lack of planning quality. An initially optimal expansion strategy helps to save on investment costs and guarantees high profitability. If we look at a possible district heating area, it turns out that the most profitable - choice of consumers to supply, - location of the heating station and - choice of street-sections in which to lay pipes is a very complex combinatorial maximisation problem. Structural optimisation of district heating networks, in contrast to layout optimisation of one spatial solution, is not very well studied. Various problem formulations are available, but no program on the market is able to optimise network structures based on a micro model. Profit as a target function is defined as the cumulated discounted revenues minus the discounted costs for heat generation and transport. Transport costs comprise those costs of trenching, pipes, laying, reconditioning as well as costs for service, maintenance, heat loss and pump work. The overall transport cost function is concave with respect to heat flow (assuming constant system temperatures). Heating stations can be integrated using a similar function which represents discounted total costs. On this basis a consistent model can be formulated, either using the Prize Collecting Steiner Tree Problem or the Fixed Charge Transshipment Problem. Please refer to further work in [-]. These problems are NP-hard1 and thus common optimisation techniques rapidly run into difficulties. (orig.) [German] Durch Zeit- und Kostendruck werden bei vielen Fernwaermeprojekten oft nur wenig raeumliche Ausbauvarianten kalkuliert; die energiewirtschaftlich optimale Netzstruktur wird nicht gefunden. Der Autor entwickelte das entscheidungsunterstuetzende System 'exPLAN' zur raeumlichen Optimierung von Fernwaermenetzen. Die Suche nach der gewinnmaximierten

  6. Finding the Sweet Spot: Network Structures and Processes for Increased Knowledge Mobilization

    Directory of Open Access Journals (Sweden)

    Patricia Briscoe

    2016-06-01

    Full Text Available The use of networks in public education is one of a number of knowledge mobilization (KMb strategies utilized to promote evidence-based research into practice. However, challenges exist in the ability to effectively mobilizing knowledge through external partnership networks. The purpose of this paper is to further explore how networks work. Data was collected from virtual discussions for an interim report for a province-wide government initiative. A secondary analysis of the data was performed. The findings present network structures and processes that partners were engaged in when building a network within education. The implications of this study show that building a network for successful outcomes is complex and metaphorically similar to finding the “sweet spot.” It is challenging but networks that used strategies to align structures and processes proved to achieve more success in mobilizing research to practice.

  7. Wireless Networks

    OpenAIRE

    Samaka, Mohammed; Khan, Khaled M.D.

    2007-01-01

    Wireless communication is the fastest-growing field in the telecommunication industry. Wireless networks have grown significantly as an important segment of the communications industry. They have become popular networks with the potential to provide high-speed, high-quality information exchange between two or more portable devices without any wire or conductors. Wireless networks can simply be characterized as the technology that provides seamless access to information, anywhere, anyplace, an...

  8. Enterpreneurial network

    OpenAIRE

    Thoma, Antonela; Nguyen, Lien; Kupsyte, Valdone

    2014-01-01

    Network has become more and more indispensable in the entrepreneurial world. Especially in startup businesses, network is crucial for new entrepreneurs. This project looks at how entrepreneurs in different sectors use network to become successful. We chose to work with three entrepreneurs from three companies that have been operational for a few years and conducted face to face interviews with them. Through the data from the interviews, we analyzed firstly what type of entrepreneurs they are,...

  9. Adaptive dynamical networks

    Science.gov (United States)

    Maslennikov, O. V.; Nekorkin, V. I.

    2017-10-01

    Dynamical networks are systems of active elements (nodes) interacting with each other through links. Examples are power grids, neural structures, coupled chemical oscillators, and communications networks, all of which are characterized by a networked structure and intrinsic dynamics of their interacting components. If the coupling structure of a dynamical network can change over time due to nodal dynamics, then such a system is called an adaptive dynamical network. The term ‘adaptive’ implies that the coupling topology can be rewired; the term ‘dynamical’ implies the presence of internal node and link dynamics. The main results of research on adaptive dynamical networks are reviewed. Key notions and definitions of the theory of complex networks are given, and major collective effects that emerge in adaptive dynamical networks are described.

  10. Network security

    CERN Document Server

    Perez, André

    2014-01-01

    This book introduces the security mechanisms deployed in Ethernet, Wireless-Fidelity (Wi-Fi), Internet Protocol (IP) and MultiProtocol Label Switching (MPLS) networks. These mechanisms are grouped throughout the book according to the following four functions: data protection, access control, network isolation, and data monitoring. Data protection is supplied by data confidentiality and integrity control services. Access control is provided by a third-party authentication service. Network isolation is supplied by the Virtual Private Network (VPN) service. Data monitoring consists of applying

  11. Networking Japan

    DEFF Research Database (Denmark)

    Hansen, Annette Skovsted

    HIDA). Many of these alumni have and will in the future exchange ideas and keep contact not only to Japan, but also to fellow alumni around the globe and, thereby, practice south-south exchanges, which are made possible and traceable by their established alumni network and the World Network of Friends...... (WNF). Through the alumni network, Japan continues to infuse ideas to participants and alumni, who interpret and disseminate these ideas through alumni society networks and activities, but their discussions nationally and regionally also get reported back to Japan and affect future policies...

  12. Technical Network

    CERN Multimedia

    2007-01-01

    In order to optimize the management of the Technical Network (TN), to ease the understanding and purpose of devices connected to the TN, and to improve security incident handling, the Technical Network Administrators and the CNIC WG have asked IT/CS to verify the "description" and "tag" fields of devices connected to the TN. Therefore, persons responsible for systems connected to the TN will receive email notifications from IT/CS asking them to add the corresponding information in the network database. Thank you very much for your cooperation. The Technical Network Administrators & the CNIC WG

  13. Exploiting The Brain’s Network Structure in Identifying ADHD

    Directory of Open Access Journals (Sweden)

    Soumyabrata eDey

    2012-11-01

    Full Text Available Attention Deficit Hyperactive Disorder (ADHD is a common behavioral problem affecting children. In this work, we investigate the automatic classification of ADHD subjects using the resting state Functional Magnetic Resonance Imaging (fMRI sequences of the brain. We show that brain can be modeled as a functional network, and certain properties of the networks differ in ADHD subjects from control subjects. We compute the pairwise correlation of brain voxels' activity over the time frame of the experimental protocol which helps to model the function of a brain as a network. Different network features are computed for each of the voxels constructing the network. The concatenation of the network features of all the voxels in a brain serves as the feature vector. Feature vectors from a set of subjects are then used to train a PCA-LDA (principal component analysis-linear discriminant analysis based classifier. We hypothesized that ADHD related differences lie in some specific regions of brain and using features only from those regions are sufficient to discriminate ADHD and control subjects. We propose a method to create a brain mask which includes the useful regions only and demonstrate that using the feature from the masked regions improves classification accuracy on the test data set. We train our classifier with 776 subjects, and test on 171 subjects provided by The Neuro Bureau for the ADHD-200 challenge. We demonstrate the utility of graph-motif features, specifically the maps that represent the frequency of participation of voxels in network cycles of length 3. The best classification performance (69.59% is achieved using 3-cycle map features with masking. Our proposed approach holds promise in being able to diagnose and understand the disorder.

  14. How the dynamics and structure of sexual contact networks shape pathogen phylogenies.

    Directory of Open Access Journals (Sweden)

    Katy Robinson

    Full Text Available The characteristics of the host contact network over which a pathogen is transmitted affect both epidemic spread and the projected effectiveness of control strategies. Given the importance of understanding these contact networks, it is unfortunate that they are very difficult to measure directly. This challenge has led to an interest in methods to infer information about host contact networks from pathogen phylogenies, because in shaping a pathogen's opportunities for reproduction, contact networks also shape pathogen evolution. Host networks influence pathogen phylogenies both directly, through governing opportunities for evolution, and indirectly by changing the prevalence and incidence. Here, we aim to separate these two effects by comparing pathogen evolution on different host networks that share similar epidemic trajectories. This approach allows use to examine the direct effects of network structure on pathogen phylogenies, largely controlling for confounding differences arising from population dynamics. We find that networks with more heterogeneous degree distributions yield pathogen phylogenies with more variable cluster numbers, smaller mean cluster sizes, shorter mean branch lengths, and somewhat higher tree imbalance than networks with relatively homogeneous degree distributions. However, in particular for dynamic networks, we find that these direct effects are relatively modest. These findings suggest that the role of the epidemic trajectory, the dynamics of the network and the inherent variability of metrics such as cluster size must each be taken into account when trying to use pathogen phylogenies to understand characteristics about the underlying host contact network.

  15. Error and attack tolerance of synchronization in Hindmarsh–Rose neural networks with community structure

    Energy Technology Data Exchange (ETDEWEB)

    Li, Chun-Hsien, E-mail: chli@nknucc.nknu.edu.tw [Department of Mathematics, National Kaohsiung Normal University, Yanchao District, Kaohsiung City 82444, Taiwan (China); Yang, Suh-Yuh, E-mail: syyang@math.ncu.edu.tw [Department of Mathematics, National Central University, Jhongli City, Taoyuan County 32001, Taiwan (China)

    2014-03-01

    Synchronization is one of the most important features observed in large-scale complex networks of interacting dynamical systems. As is well known, there is a close relation between the network topology and the network synchronizability. Using the coupled Hindmarsh–Rose neurons with community structure as a model network, in this paper we explore how failures of the nodes due to random errors or intentional attacks affect the synchronizability of community networks. The intentional attacks are realized by removing a fraction of the nodes with high values in some centrality measure such as the centralities of degree, eigenvector, betweenness and closeness. According to the master stability function method, we employ the algebraic connectivity of the considered community network as an indicator to examine the network synchronizability. Numerical evidences show that the node failure strategy based on the betweenness centrality has the most influence on the synchronizability of community networks. With this node failure strategy for a given network with a fixed number of communities, we find that the larger the degree of communities, the worse the network synchronizability; however, for a given network with a fixed degree of communities, we observe that the more the number of communities, the better the network synchronizability.

  16. Error and attack tolerance of synchronization in Hindmarsh-Rose neural networks with community structure

    Science.gov (United States)

    Li, Chun-Hsien; Yang, Suh-Yuh

    2014-03-01

    Synchronization is one of the most important features observed in large-scale complex networks of interacting dynamical systems. As is well known, there is a close relation between the network topology and the network synchronizability. Using the coupled Hindmarsh-Rose neurons with community structure as a model network, in this paper we explore how failures of the nodes due to random errors or intentional attacks affect the synchronizability of community networks. The intentional attacks are realized by removing a fraction of the nodes with high values in some centrality measure such as the centralities of degree, eigenvector, betweenness and closeness. According to the master stability function method, we employ the algebraic connectivity of the considered community network as an indicator to examine the network synchronizability. Numerical evidences show that the node failure strategy based on the betweenness centrality has the most influence on the synchronizability of community networks. With this node failure strategy for a given network with a fixed number of communities, we find that the larger the degree of communities, the worse the network synchronizability; however, for a given network with a fixed degree of communities, we observe that the more the number of communities, the better the network synchronizability.

  17. Social network data analytics

    CERN Document Server

    Aggarwal, Charu C

    2011-01-01

    Social network analysis applications have experienced tremendous advances within the last few years due in part to increasing trends towards users interacting with each other on the internet. Social networks are organized as graphs, and the data on social networks takes on the form of massive streams, which are mined for a variety of purposes. Social Network Data Analytics covers an important niche in the social network analytics field. This edited volume, contributed by prominent researchers in this field, presents a wide selection of topics on social network data mining such as Structural Pr

  18. Network evaluation: principles, structures and outcomes of the German working group of Health Promoting Universities.

    Science.gov (United States)

    Stock, Christiane; Milz, Simone; Meier, Sabine

    2010-03-01

    With more than 60 participating universities, the German working group of Health Promoting Universities (German HPU network) is the largest and most active network of universities as healthy settings. This study aims at evaluating processes and effects of the German HPU network and at supporting the future development of the network. The evaluation was based on the multi faceted network assessment instrument developed by Broesskamp-Stone (7). We used a document analysis, two expert interviews and a survey among members (n = 33) to collect relevant data for the assessment. The analysis showed that the visions of the network can be regarded as fulfilled in most aspects. The members of the network received network support through trustful and mutual relationships. The network ranked high on general network principles like implementation of mutual relationships, sharing of information, risks and resources, equal access to resources, responsibility and consensus orientation. However, a high degree of centralization was found as a negative indicator. Other critical aspects of the network's structures and processes have been the regional predominance of universities from the northern and middle part of Germany, the low representation of students in the network, and the low proportion of members that could successfully implement health promotion into the guiding principles of their university. Overall, the evaluation has shown that the network has worked effectively, has developed meaningful processes and structures and has formulated practical guidelines. Since its 12 years of existence the German HPU network has been able to adapt and to adequately respond to changing contextual conditions regarding health promotion at universities in Germany. The network should develop strategies to counteract the critical aspects and detected imbalances in order to further increase its impact on universities as healthy settings.

  19. Effect of edge pruning on structural controllability and observability of complex networks

    Science.gov (United States)

    Mengiste, Simachew Abebe; Aertsen, Ad; Kumar, Arvind

    2015-12-01

    Controllability and observability of complex systems are vital concepts in many fields of science. The network structure of the system plays a crucial role in determining its controllability and observability. Because most naturally occurring complex systems show dynamic changes in their network connectivity, it is important to understand how perturbations in the connectivity affect the controllability of the system. To this end, we studied the control structure of different types of artificial, social and biological neuronal networks (BNN) as their connections were progressively pruned using four different pruning strategies. We show that the BNNs are more similar to scale-free networks than to small-world networks, when comparing the robustness of their control structure to structural perturbations. We introduce a new graph descriptor, ‘the cardinality curve’, to quantify the robustness of the control structure of a network to progressive edge pruning. Knowing the susceptibility of control structures to different pruning methods could help design strategies to destroy the control structures of dangerous networks such as epidemic networks. On the other hand, it could help make useful networks more resistant to edge attacks.

  20. A unified method of detecting core-periphery structure and community structure in networks.

    Science.gov (United States)

    Xiang, Bing-Bing; Bao, Zhong-Kui; Ma, Chuang; Zhang, Xingyi; Chen, Han-Shuang; Zhang, Hai-Feng

    2018-01-01

    The core-periphery structure and the community structure are two typical meso-scale structures in complex networks. Although community detection has been extensively investigated from different perspectives, the definition and the detection of the core-periphery structure have not received much attention. Furthermore, the detection problems of the core-periphery and community structure were separately investigated. In this paper, we develop a unified framework to simultaneously detect the core-periphery structure and community structure in complex networks. Moreover, there are several extra advantages of our algorithm: our method can detect not only single but also multiple pairs of core-periphery structures; the overlapping nodes belonging to different communities can be identified; different scales of core-periphery structures can be detected by adjusting the size of the core. The good performance of the method has been validated on synthetic and real complex networks. So, we provide a basic framework to detect the two typical meso-scale structures: the core-periphery structure and the community structure.

  1. Evaluating the spatio-temporal factors that structure network parameters of plant-herbivore interactions.

    Directory of Open Access Journals (Sweden)

    Antonio López-Carretero

    Full Text Available Despite the dynamic nature of ecological interactions, most studies on species networks offer static representations of their structure, constraining our understanding of the ecological mechanisms involved in their spatio-temporal stability. This is the first study to evaluate plant-herbivore interaction networks on a small spatio-temporal scale. Specifically, we simultaneously assessed the effect of host plant availability, habitat complexity and seasonality on the structure of plant-herbivore networks in a coastal tropical ecosystem. Our results revealed that changes in the host plant community resulting from seasonality and habitat structure are reflected not only in the herbivore community, but also in the emergent properties (network parameters of the plant-herbivore interaction network such as connectance, selectiveness and modularity. Habitat conditions and periods that are most stressful favored the presence of less selective and susceptible herbivore species, resulting in increased connectance within networks. In contrast, the high degree of selectivennes (i.e. interaction specialization and modularity of the networks under less stressful conditions was promoted by the diversification in resource use by herbivores. By analyzing networks at a small spatio-temporal scale we identified the ecological factors structuring this network such as habitat complexity and seasonality. Our research offers new evidence on the role of abiotic and biotic factors in the variation of the properties of species interaction networks.

  2. Impaired topological architecture of brain structural networks in idiopathic Parkinson's disease: a DTI study.

    Science.gov (United States)

    Li, Changhong; Huang, Biao; Zhang, Ruibin; Ma, Qing; Yang, Wanqun; Wang, Lijuan; Wang, Limin; Xu, Qin; Feng, Jieying; Liu, Liqing; Zhang, Yuhu; Huang, Ruiwang

    2017-02-01

    Parkinson's disease (PD) is considered as a neurodegenerative disorder of the brain central nervous system. But, to date, few studies adopted the network model to reveal topological changes in brain structural networks in PD patients. Additionally, although the concept of rich club organization has been widely used to study brain networks in various brain disorders, there is no study to report the changed rich club organization of brain networks in PD patients. Thus, we collected diffusion tensor imaging (DTI) data from 35 PD patients and 26 healthy controls and adopted deterministic tractography to construct brain structural networks. During the network analysis, we calculated their topological properties, and built the rich club organization of brain structural networks for both subject groups. By comparing the between-group differences in topological properties and rich club organizations, we found that the connectivity strength of the feeder and local connections are lower in PD patients compared to those of the healthy controls. Furthermore, using a network-based statistic (NBS) approach, we identified uniformly significantly decreased connections in two modules, the limbic/paralimbic/subcortical module and the cognitive control/attention module, in patients compared to controls. In addition, for the topological properties of brain network topology in the PD patients, we found statistically increased shortest path length and decreased global efficiency. Statistical comparisons of nodal properties were also widespread in the frontal and parietal regions for the PD patients. These findings may provide useful information to better understand the abnormalities of brain structural networks in PD patients.

  3. The Landscape of Evolution: Reconciling Structural and Dynamic Properties of Metabolic Networks in Adaptive Diversifications.

    Science.gov (United States)

    Morrison, Erin S; Badyaev, Alexander V

    2016-08-01

    The network of the interactions among genes, proteins, and metabolites delineates a range of potential phenotypic diversifications in a lineage, and realized phenotypic changes are the result of differences in the dynamics of the expression of the elements and interactions in this deterministic network. Regulatory mechanisms, such as hormones, mediate the relationship between the structural and dynamic properties of networks by determining how and when the elements are expressed and form a functional unit or state. Changes in regulatory mechanisms lead to variable expression of functional states of a network within and among generations. Functional properties of network elements, and the magnitude and direction of evolutionary change they determine, depend on their location within a network. Here, we examine the relationship between network structure and the dynamic mechanisms that regulate flux through a metabolic network. We review the mechanisms that control metabolic flux in enzymatic reactions and examine structural properties of the network locations that are targets of flux control. We aim to establish a predictive framework to test the contributions of structural and dynamic properties of deterministic networks to evolutionary diversifications. © The Author 2016. Published by Oxford University Press on behalf of the Society for Integrative and Comparative Biology. All rights reserved. For permissions please email: journals.permissions@oup.com.

  4. Inferring structural connectivity using Ising couplings in models of neuronal networks.

    Science.gov (United States)

    Kadirvelu, Balasundaram; Hayashi, Yoshikatsu; Nasuto, Slawomir J

    2017-08-15

    Functional connectivity metrics have been widely used to infer the underlying structural connectivity in neuronal networks. Maximum entropy based Ising models have been suggested to discount the effect of indirect interactions and give good results in inferring the true anatomical connections. However, no benchmarking is currently available to assess the performance of Ising couplings against other functional connectivity metrics in the microscopic scale of neuronal networks through a wide set of network conditions and network structures. In this paper, we study the performance of the Ising model couplings to infer the synaptic connectivity in in silico networks of neurons and compare its performance against partial and cross-correlations for different correlation levels, firing rates, network sizes, network densities, and topologies. Our results show that the relative performance amongst the three functional connectivity metrics depends primarily on the network correlation levels. Ising couplings detected the most structural links at very weak network correlation levels, and partial correlations outperformed Ising couplings and cross-correlations at strong correlation levels. The result was consistent across varying firing rates, network sizes, and topologies. The findings of this paper serve as a guide in choosing the right functional connectivity tool to reconstruct the structural connectivity.

  5. Complex network structure influences processing in long-term and short-term memory

    OpenAIRE

    Vitevitch, Michael S.; Chan, Kit Ying; Roodenrys, Steven

    2012-01-01

    Complex networks describe how entities in systems interact; the structure of such networks is argued to influence processing. One measure of network structure, clustering coefficient, C, measures the extent to which neighbors of a node are also neighbors of each other. Previous psycholinguistic experiments found that the C of phonological word-forms influenced retrieval from the mental lexicon (that portion of long-term memory dedicated to language) during the on-line recognition and producti...

  6. Network Structure and Biased Variance Estimation in Respondent Driven Sampling.

    Directory of Open Access Journals (Sweden)

    Ashton M Verdery

    Full Text Available This paper explores bias in the estimation of sampling variance in Respondent Driven Sampling (RDS. Prior methodological work on RDS has focused on its problematic assumptions and the biases and inefficiencies of its estimators of the population mean. Nonetheless, researchers have given only slight attention to the topic of estimating sampling variance in RDS, despite the importance of variance estimation for the construction of confidence intervals and hypothesis tests. In this paper, we show that the estimators of RDS sampling variance rely on a critical assumption that the network is First Order Markov (FOM with respect to the dependent variable of interest. We demonstrate, through intuitive examples, mathematical generalizations, and computational experiments that current RDS variance estimators will always underestimate the population sampling variance of RDS in empirical networks that do not conform to the FOM assumption. Analysis of 215 observed university and school networks from Facebook and Add Health indicates that the FOM assumption is violated in every empirical network we analyze, and that these violations lead to substantially biased RDS estimators of sampling variance. We propose and test two alternative variance estimators that show some promise for reducing biases, but which also illustrate the limits of estimating sampling variance with only partial information on the underlying population social network.

  7. Network Structure and Biased Variance Estimation in Respondent Driven Sampling.

    Science.gov (United States)

    Verdery, Ashton M; Mouw, Ted; Bauldry, Shawn; Mucha, Peter J

    2015-01-01

    This paper explores bias in the estimation of sampling variance in Respondent Driven Sampling (RDS). Prior methodological work on RDS has focused on its problematic assumptions and the biases and inefficiencies of its estimators of the population mean. Nonetheless, researchers have given only slight attention to the topic of estimating sampling variance in RDS, despite the importance of variance estimation for the construction of confidence intervals and hypothesis tests. In this paper, we show that the estimators of RDS sampling variance rely on a critical assumption that the network is First Order Markov (FOM) with respect to the dependent variable of interest. We demonstrate, through intuitive examples, mathematical generalizations, and computational experiments that current RDS variance estimators will always underestimate the population sampling variance of RDS in empirical networks that do not conform to the FOM assumption. Analysis of 215 observed university and school networks from Facebook and Add Health indicates that the FOM assumption is violated in every empirical network we analyze, and that these violations lead to substantially biased RDS estimators of sampling variance. We propose and test two alternative variance estimators that show some promise for reducing biases, but which also illustrate the limits of estimating sampling variance with only partial information on the underlying population social network.

  8. Estimating the stochastic bifurcation structure of cellular networks.

    Directory of Open Access Journals (Sweden)

    Carl Song

    2010-03-01

    Full Text Available High throughput measurement of gene expression at single-cell resolution, combined with systematic perturbation of environmental or cellular variables, provides information that can be used to generate novel insight into the properties of gene regulatory networks by linking cellular responses to external parameters. In dynamical systems theory, this information is the subject of bifurcation analysis, which establishes how system-level behaviour changes as a function of parameter values within a given deterministic mathematical model. Since cellular networks are inherently noisy, we generalize the traditional bifurcation diagram of deterministic systems theory to stochastic dynamical systems. We demonstrate how statistical methods for density estimation, in particular, mixture density and conditional mixture density estimators, can be employed to establish empirical bifurcation diagrams describing the bistable genetic switch network controlling galactose utilization in yeast Saccharomyces cerevisiae. These approaches allow us to make novel qualitative and quantitative observations about the switching behavior of the galactose network, and provide a framework that might be useful to extract information needed for the development of quantitative network models.

  9. Structure Learning and Statistical Estimation in Distribution Networks - Part I

    Energy Technology Data Exchange (ETDEWEB)

    Deka, Deepjyoti [Univ. of Texas, Austin, TX (United States); Backhaus, Scott N. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-02-13

    Traditionally power distribution networks are either not observable or only partially observable. This complicates development and implementation of new smart grid technologies, such as those related to demand response, outage detection and management, and improved load-monitoring. In this two part paper, inspired by proliferation of the metering technology, we discuss estimation problems in structurally loopy but operationally radial distribution grids from measurements, e.g. voltage data, which are either already available or can be made available with a relatively minor investment. In Part I, the objective is to learn the operational layout of the grid. Part II of this paper presents algorithms that estimate load statistics or line parameters in addition to learning the grid structure. Further, Part II discusses the problem of structure estimation for systems with incomplete measurement sets. Our newly suggested algorithms apply to a wide range of realistic scenarios. The algorithms are also computationally efficient – polynomial in time– which is proven theoretically and illustrated computationally on a number of test cases. The technique developed can be applied to detect line failures in real time as well as to understand the scope of possible adversarial attacks on the grid.

  10. Resolution of Singularities Introduced by Hierarchical Structure in Deep Neural Networks.

    Science.gov (United States)

    Nitta, Tohru

    2017-10-01

    We present a theoretical analysis of singular points of artificial deep neural networks, resulting in providing deep neural network models having no critical points introduced by a hierarchical structure. It is considered that such deep neural network models have good nature for gradient-based optimization. First, we show that there exist a large number of critical points introduced by a hierarchical structure in deep neural networks as straight lines, depending on the number of hidden layers and the number of hidden neurons. Second, we derive a sufficient condition for deep neural networks having no critical points introduced by a hierarchical structure, which can be applied to general deep neural networks. It is also shown that the existence of critical points introduced by a hierarchical structure is determined by the rank and the regularity of weight matrices for a specific class of deep neural networks. Finally, two kinds of implementation methods of the sufficient conditions to have no critical points are provided. One is a learning algorithm that can avoid critical points introduced by the hierarchical structure during learning (called avoidant learning algorithm). The other is a neural network that does not have some critical points introduced by the hierarchical structure as an inherent property (called avoidant neural network).

  11. Specificity, promiscuity, and the structure of complex information processing networks

    Science.gov (United States)

    Myers, Christopher

    2006-03-01

    Both the top-down designs of engineered systems and the bottom-up serendipities of biological evolution must negotiate tradeoffs between specificity and control: overly specific interactions between components can make systems brittle and unevolvable, while more generic interactions can require elaborate control in order to aggregate specificity from distributed pieces. Complex information processing systems reveal network organizations that navigate this landscape of constraints: regulatory and signaling networks in cells involve the coordination of molecular interactions that are surprisingly promiscuous, and object-oriented design in software systems emphasizes the polymorphic composition of objects of minimal necessary specificity [C.R. Myers, Phys Rev E 68, 046116 (2003)]. Models of information processing arising both in systems biology and engineered computation are explored to better understand how particular network organizations can coordinate the activity of promiscuous components to achieve robust and evolvable function.

  12. Heterodox networks

    DEFF Research Database (Denmark)

    Lala, Purnima; Kumar, Ambuj

    2016-01-01

    It is imperative for the service providers to bring innovation in the network design to meet the exponential growth of mobile subscribers for multi-technology future wireless networks. As a matter of research, studies on providing services to moving subscriber groups aka ‘Place Time Capacity (PTC...

  13. Sensor networks

    NARCIS (Netherlands)

    Chatterjea, Supriyo; Thurston, J.; Kininmonth, S.; Havinga, Paul J.M.

    2006-01-01

    This article describes the details of a sensor network that is currently being deployed at the Great Barrier Reef in Australia. The sensor network allows scientists to retrieve sensor data that has a high spatial and temporal resolution. We give an overview of the energy-efficient data aggregation

  14. Network Protocols

    NARCIS (Netherlands)

    Tanenbaum, A.S.

    1981-01-01

    Dunng the last ten years, many computer networks have been designed, implemented, and put into service in the United States, Canada, Europe, Japan, and elsewhere. From the experience obtamed with these networks, certain key design principles have begun to emerge, principles that can be used to

  15. Probabilistic Networks

    DEFF Research Database (Denmark)

    Jensen, Finn Verner; Lauritzen, Steffen Lilholt

    2001-01-01

    This article describes the basic ideas and algorithms behind specification and inference in probabilistic networks based on directed acyclic graphs, undirected graphs, and chain graphs.......This article describes the basic ideas and algorithms behind specification and inference in probabilistic networks based on directed acyclic graphs, undirected graphs, and chain graphs....

  16. Organizational Networks

    DEFF Research Database (Denmark)

    Sørensen, Ole Henning; Grande, Bård

    1996-01-01

    The paper focuses on the concept of organizational networks. Four different uses of the concept are identified and critically discussed.......The paper focuses on the concept of organizational networks. Four different uses of the concept are identified and critically discussed....

  17. Affective Networks

    OpenAIRE

    Jodi Dean

    2010-01-01

    This article sets out the idea of affective networks as a constitutive feature of communicative capitalism. It explores the circulation of intensities in contemporary information and communication networks, arguing that this circulation should be theorized in terms of the psychoanalytic notion of the drive. The article includes critical engagements with theorists such as Guy Debord, Jacques Lacan, Tiziana Terranova, and Slavoj Zizek.

  18. Network chemistry, network toxicology, network informatics, and network behavioristics: A scientific outline

    OpenAIRE

    WenJun Zhang

    2016-01-01

    In present study, I proposed some new sciences: network chemistry, network toxicology, network informatics, and network behavioristics. The aims, scope and scientific foundation of these sciences are outlined.

  19. Studies on the Structure and Dynamics of Urban Bus Networks in Indian Cities

    CERN Document Server

    Chatterjee, Atanu

    2015-01-01

    In recent times, the domain of network science has become extremely useful in understanding the underlying structure of various real-world networks and to answer non-trivial questions regarding them. In this study, we rigourously analyze the statistical properties of the bus networks of six major Indian cities as graphs in L- and P-space, using tools from network science. Although public transport networks, such as airline and railway networks have been extensively studied, a comprehensive study on the structure and growth of bus networks is lacking. In India, where bus networks play an important role in day-to-day commutation, it is of significant interest to analyze their topological structure, and answer some of the basic questions on their evolution, growth, robustness and resiliency. We start from an empirical analysis of these networks, and determine their principle characteristics in terms of the complex network theory. The common features of small-world property and heavy tails in degree-distribution ...

  20. Network Affordances

    DEFF Research Database (Denmark)

    Samson, Audrey; Soon, Winnie

    2015-01-01

    This paper examines the notion of network affordance within the context of network art. Building on Gibson's theory (Gibson, 1979) we understand affordance as the perceived and actual parameters of a thing. We expand on Gaver's affordance of predictability (Gaver, 1996) to include ecological...... and computational parameters of unpredictability. We illustrate the notion of unpredictability by considering four specific works that were included in a network art exhibiton, SPEED SHOW [2.0] Hong Kong. The paper discusses how the artworks are contingent upon the parameteric relations (Parisi, 2013......), of the network. We introduce network affordance as a dynamic framework that could articulate the experienced tension arising from the (visible) symbolic representation of computational processes and its hidden occurrences. We base our proposal on the experience of both organising the SPEED SHOW and participating...

  1. How transfer flights shape structure of the airline network

    CERN Document Server

    Ryczkowski, Tomasz; Fronczak, Piotr

    2016-01-01

    In this paper we analyze the gravity model in the world passenger air-transport network. We show that in the standard form the model is inadequate to correctly describe the relationship between passenger flows and typical geo-economic variables that characterize connected countries. We propose a model of transfer flights which allows to exploit these discrepancies to discover hidden subflows in the network. We illustrate its usefulness by retrieving the distance coefficient in the gravity model which is one of the determinants of the globalization process. Finally, we discuss the correctness of the presented approach by comparing the distance coefficient to several well known economical events.

  2. Global patterns in the structure and robustness of plant-herbivore networks

    Directory of Open Access Journals (Sweden)

    Walter Santos de Araújo

    2016-10-01

    Full Text Available My goal is to investigate global patterns in the structure of interaction networks of insect herbivores and their host plants. Specifically, I seek to determine whether intensification of land use and the dominance of exotic host plant species influence the structure and robustness (i.e., resistance to co-extinctions of interaction networks of insect herbivores and host plants. I also ask whether latitude has an influence on the structure and robustness of these interactions. I compiled 90 local plant-herbivore networks distributed worldwide, spanning different taxonomic groups of plants and insects and several herbivore guilds. My results showed that intensification of land use was associated with dominance of exotic plant species and can impoverish the species richness and taxonomic diversity of insect herbivores in the networks. Moreover, land use intensification surprisingly increases network specialization by decreasing connectance and nestedness, and increases modularity; while the increase in the proportion of exotic hosts had opposite effects. These changes in the network structure may be due to the proportionately greater loss of generalist herbivores relative to specialists. Land use intensification also decreases the robustness of plant-herbivore networks, while the proportion of exotic host plant species increases, which is an intriguing result that contradicts previous studies. Controlling for anthropic effects that can act on the networks, my results show that plant–herbivore networks are structured independently of latitude, suggesting that the factors that influence the interactions between host plants and insect herbivores are latitudinally invariant.

  3. Inferring the mesoscale structure of layered, edge-valued, and time-varying networks

    Science.gov (United States)

    Peixoto, Tiago P.

    2015-10-01

    Many network systems are composed of interdependent but distinct types of interactions, which cannot be fully understood in isolation. These different types of interactions are often represented as layers, attributes on the edges, or as a time dependence of the network structure. Although they are crucial for a more comprehensive scientific understanding, these representations offer substantial challenges. Namely, it is an open problem how to precisely characterize the large or mesoscale structure of network systems in relation to these additional aspects. Furthermore, the direct incorporation of these features invariably increases the effective dimension of the network description, and hence aggravates the problem of overfitting, i.e., the use of overly complex characterizations that mistake purely random fluctuations for actual structure. In this work, we propose a robust and principled method to tackle these problems, by constructing generative models of modular network structure, incorporating layered, attributed and time-varying properties, as well as a nonparametric Bayesian methodology to infer the parameters from data and select the most appropriate model according to statistical evidence. We show that the method is capable of revealing hidden structure in layered, edge-valued, and time-varying networks, and that the most appropriate level of granularity with respect to the additional dimensions can be reliably identified. We illustrate our approach on a variety of empirical systems, including a social network of physicians, the voting correlations of deputies in the Brazilian national congress, the global airport network, and a proximity network of high-school students.

  4. Scale-dependent genetic structure of the Idaho giant salamander (Dicamptodon aterrimus) in stream networks

    Science.gov (United States)

    Lindy B. Mullen; H. Arthur Woods; Michael K. Schwartz; Adam J. Sepulveda; Winsor H. Lowe

    2010-01-01

    The network architecture of streams and rivers constrains evolutionary, demographic and ecological processes of freshwater organisms. This consistent architecture also makes stream networks useful for testing general models of population genetic structure and the scaling of gene flow. We examined genetic structure and gene flow in the facultatively paedomorphic Idaho...

  5. The Structure and Quality of Social Network Support among Mental Health Consumers of Clubhouse Programs

    Science.gov (United States)

    Pernice-Duca, Francesca M.

    2008-01-01

    This study explored the structure and quality of social network support among a group of adult consumers of community-based mental health programs known as "clubhouses". The structure and quality of social network support was also examined by diagnosis, specifically between consumers living with and without schizophrenia. The study…

  6. Association between structural brain network efficiency and intelligence increases during adolescence

    NARCIS (Netherlands)

    Koenis, Marinka M G; Brouwer, Rachel M; Swagerman, Suzanne C; van Soelen, Inge L C; Boomsma, Dorret I; Hulshoff Pol, Hilleke E

    2017-01-01

    Adolescence represents an important period during which considerable changes in the brain take place, including increases in integrity of white matter bundles, and increasing efficiency of the structural brain network. A more efficient structural brain network has been associated with higher

  7. Multilabel user classification using the community structure of online networks.

    Science.gov (United States)

    Rizos, Georgios; Papadopoulos, Symeon; Kompatsiaris, Yiannis

    2017-01-01

    We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE), an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user's graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score.

  8. Z(2) gauge neural network and its phase structure

    Science.gov (United States)

    Takafuji, Yusuke; Nakano, Yuki; Matsui, Tetsuo

    2012-11-01

    We study general phase structures of neural-network models that have Z(2) local gauge symmetry. The Z(2) spin variable Si=±1 on the i-th site describes a neuron state as in the Hopfield model, and the Z(2) gauge variable J=±1 describes a state of the synaptic connection between j-th and i-th neurons. The gauge symmetry allows for a self-coupling energy among J’s such as JJJ, which describes reverberation of signals. Explicitly, we consider the three models; (I) an annealed model with full and partial connections of J, (II) a quenched model with full connections where J is treated as a slow quenched variable, and (III) a quenched three-dimensional lattice model with the nearest-neighbor connections. By numerical simulations, we examine their phase structures paying attention to the effect of the reverberation term, and compare them with each other and with the annealed 3D lattice model which has been studied beforehand. By noting the dependence of thermodynamic quantities upon the total number of sites and the connectivity among sites, we obtain a coherent interpretation to understand these results. Among other things, we find that the Higgs phase of the annealed model is separated into two stable spin-glass phases in the quenched models (II) and (III).

  9. Prediction of Alzheimer's disease using individual structural connectivity networks

    Science.gov (United States)

    Shao, Junming; Myers, Nicholas; Yang, Qinli; Feng, Jing; Plant, Claudia; Böhm, Christian; Förstl, Hans; Kurz, Alexander; Zimmer, Claus; Meng, Chun; Riedl, Valentin; Wohlschläger, Afra; Sorg, Christian

    2012-01-01

    Alzheimer's disease (AD) progressively degrades the brain's gray and white matter. Changes in white matter reflect changes in the brain's structural connectivity pattern. Here, we established individual structural connectivity networks (ISCNs) to distinguish predementia and dementia AD from healthy aging in individual scans. Diffusion tractography was used to construct ISCNs with a fully automated procedure for 21 healthy control subjects (HC), 23 patients with mild cognitive impairment and conversion to AD dementia within 3 years (AD-MCI), and 17 patients with mild AD dementia. Three typical pattern classifiers were used for AD prediction. Patients with AD and AD-MCI were separated from HC with accuracies greater than 95% and 90%, respectively, irrespective of prediction approach and specific fiber properties. Most informative connections involved medial prefrontal, posterior parietal, and insular cortex. Patients with mild AD were separated from those with AD-MCI with an accuracy of approximately 85%. Our finding provides evidence that ISCNs are sensitive to the impact of earliest stages of AD. ISCNs may be useful as a white matter-based imaging biomarker to distinguish healthy aging from AD. PMID:22405045

  10. Multilabel user classification using the community structure of online networks.

    Directory of Open Access Journals (Sweden)

    Georgios Rizos

    Full Text Available We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE, an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user's graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score.

  11. Decomposition of Network Communication Games

    NARCIS (Netherlands)

    Dietzenbacher, Bas; Borm, Peter; Hendrickx, Ruud

    2015-01-01

    Using network control structures this paper introduces network communication games as a generalization of vertex games and edge games corresponding to communication situations and studies their decomposition into unanimity games. We obtain a relation between the dividends of the network

  12. The Global Seismographic Network (GSN): Goals, Structure, Accomplishments and Challenges

    Science.gov (United States)

    Detrick, R. S.; Hafner, K.; Davis, J. P.; Wilson, D.; Woodward, R.

    2016-12-01

    The Global Seismographic Network (GSN) is a 152-station, globally-distributed, permanent network of state-of-the-art seismological and geophysical sensors. The GSN has been operating for over 20 years via an ongoing successful partnership between IRIS, the USGS, the University of California at San Diego, NSF and numerous host institutions worldwide. The GSN is designed to provide robust, uniform high-quality, very broadband, high-dynamic range recording of ground motion. The GSN delivers continuous data in real-time and these data, and their associated metadata, are freely and openly available to any interested investigator. The GSN is managed and operated using a unique model. IRIS, with funding from the NSF, contracts with the UCSD to operate 40 GSN stations. The USGS operates another 100 GSN stations through its Albuquerque Seismological Laboratory. The funding for the remaining 12 "affiliated" stations is provided by other sources. An external committee of community members, constituted by IRIS, provides advice to both IRIS and USGS regarding the operation of the GSN. This dual operator model allows GSN to pursue a variety of international partnerships, both with government and private organizations. Data from the GSN are used not only for basic research into earthquake and non-earthquake seismic sources and Earth structure, but these data also serve the operational missions of the USGS National Earthquake Information Center, NOAA's Tsunami Warning Centers, and the Comprehensive Nuclear-Test-Ban-Treaty Organization. The breadth of research enabled by the GSN is striking, ranging from investigations of inner and outer core structure and mantle dynamics to studies of earthquakes, tectonics, volcanology and glaciology. In the current period of flat and declining budgets, the primary challenges for the GSN include maintaining these operational capabilities while simultaneously developing and replacing aging sensors and equipment, repairing station infrastructure

  13. Spatial network surrogates for disentangling complex system structure from spatial embedding of nodes

    Science.gov (United States)

    Wiedermann, Marc; Donges, Jonathan F.; Kurths, Jürgen; Donner, Reik V.

    2016-04-01

    Networks with nodes embedded in a metric space have gained increasing interest in recent years. The effects of spatial embedding on the networks' structural characteristics, however, are rarely taken into account when studying their macroscopic properties. Here, we propose a hierarchy of null models to generate random surrogates from a given spatially embedded network that can preserve certain global and local statistics associated with the nodes' embedding in a metric space. Comparing the original network's and the resulting surrogates' global characteristics allows one to quantify to what extent these characteristics are already predetermined by the spatial embedding of the nodes and links. We apply our framework to various real-world spatial networks and show that the proposed models capture macroscopic properties of the networks under study much better than standard random network models that do not account for the nodes' spatial embedding. Depending on the actual performance of the proposed null models, the networks are categorized into different classes. Since many real-world complex networks are in fact spatial networks, the proposed approach is relevant for disentangling the underlying complex system structure from spatial embedding of nodes in many fields, ranging from social systems over infrastructure and neurophysiology to climatology.

  14. Complex network perspective on structure and function of ...

    Indian Academy of Sciences (India)

    Centrality analysis; metabolic network; modularity analysis; systems biology. PACS Nos 89.75.Hc; 02.50. ... meaningful for metabolism, disease and the design principle of biological robustness. [11,12]. Generally speaking ... some random updates are performed and accepted with probability P: p = ⎧. ⎪⎨. ⎪⎩. 1 if C2 ≤ C1.

  15. A structured approach to heat exchanger network retrofit design

    NARCIS (Netherlands)

    Van Reisen, J.L.B.

    2008-01-01

    Process plants have high energy consumption. Much energy can be saved by a proper design of the heat exchanger network, which contains the main heat transferring equipment of the plant. Existing plants can often be made more energy-efficient by a retrofit: the (physical) modification of the

  16. Predicting Hierarchical Structure in Small World Social Networks

    DEFF Research Database (Denmark)

    Hussain, Dil Muhammad Akbar

    2009-01-01

    Typisk analytisk foranstaltninger i grafteori gerne grad centralitet, betweenness og nærhed centralities er meget almindelige og har lang tradition for deres vellykkede brug. Men modellering af skjult, terrorister eller kriminelle netværk gennem sociale grafer ikke rigtig give den hierarkiske...... udnyttet til at forudsige den kommandostruktur af nettet. Nøgleord: Social Networks Analyse, Bayes Teorem, entropi, hierarkisk struktur....

  17. Strategic Management of Technology and the Structuring of Industrial Networks

    DEFF Research Database (Denmark)

    Sørensen, Ole H.

    The thesis explores the following question: 'How do actants in industrial companies partake in the enactment of locally embedded and globally reaching industrial networks through participation in technology development activities?' It draws on Actor Netwok Theories and analyses three case stories...

  18. A symptom network structure of the psychosis spectrum

    NARCIS (Netherlands)

    van Rooijen, Geeske; Isvoranu, Adela-Maria; Meijer, Carin J.; van Borkulo, Claudia D.; Ruhe, Henricus G.; de Haan, Lieuwe

    2017-01-01

    Current diagnostic systems mainly focus on symptoms needed to classify patients with a specific mental disorder and do not take into account the variation in co-occurring symptoms and the interaction between the symptoms themselves. The innovative network approach aims to further our understanding

  19. Structural Analysis of Existing Road Networks of Cooch Behar ...

    African Journals Online (AJOL)

    Road has been described as the life-blood of human civilisation. Social interaction and economic prosperity in space have been shaped by the road networks both at intra and inter regional levels. Consequently, it is regarded as one of the most important indices of economic, social and commercial progress of any region.

  20. On Backbone Structure for a Future Multipurpose Network

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Cuevas, Ruben; Riaz, M. Tahir

    2008-01-01

    Telecommunications are evolving towards the unification of services and infrastructures. This unification must be achieved at the highest hierarchical level for a complete synergy of services. Therefore, one of the requirements is a multipurpose backbone network capable of supporting all the curr...

  1. Network analysis: an integrative approach to the structure of psychopathology

    NARCIS (Netherlands)

    Borsboom, D.; Cramer, A.O.J.

    2013-01-01

    In network approaches to psychopathology, disorders result from the causal interplay between symptoms (e.g., worry → insomnia → fatigue), possibly involving feedback loops (e.g., a person may engage in substance abuse to forget the problems that arose due to substance abuse). The present review

  2. Structure and relationships within global manufacturing virtual networks

    Directory of Open Access Journals (Sweden)

    José Ramón Vilana

    2009-04-01

    Full Text Available Global Manufacturing Virtual Networks (GMVNs are dynamically changing organizations formed by Original Equipment Manufacturers (OEMs, Contract Manufacturers (CMs, turn-key and component suppliers, R+D centres and distributors. These networks establish a new type of vertical and horizontal relations between independent companies or even competitors where it is not needed to maintain internal manufacturing resources but to manage and share the network resources. The fluid relations that exist within the GMVNs allow them a very permeable organization easy to connect and disconnect from one to each other as well as to choose a set of partners with specific attributes. The result is a highly flexible system characterized by low barriers to entry and exit, geographic flexibility, low costs, rapid technological diffusion, high diversification through contract manufacturers and exceptional economies of scale. Anyhow, there are three major drawbacks in the GMVNs that should be considered at the beginning of this type of collaborations: 1 the risk of contract manufacturers to develop their own end-products in competition with their customers; 2 the technology transfer between competitors OEMs through other members of the GMVN and 3 the lose of process expertise by the OEMs the more they outsource manufacturing processes to the network.

  3. Identifying key nodes based on improved structural holes in complex networks

    Science.gov (United States)

    Yu, Hui; Cao, Xi; Liu, Zun; Li, Yongjun

    2017-11-01

    Identifying key nodes in complex networks is of theoretical and practical significance. Local metrics such as degree centrality is simplest but cannot effectively identify the important bridging nodes. Global metrics such as betweenness and closeness centrality can better identify important nodes, but they are often restricted by the unknown topology and cannot be conveniently applied in large-scale networks. In this paper, we propose an effective ranking method based on an Improved Structural Holes (ISH) to identify the important nodes. ISH method only uses the degree of nodes and the nearest neighborhood information rather than considering the global structure of a network. Our experimental results on five complex networks show that the proposed method can effectively identify the key nodes in complex networks and can also be applied in large-scale or unconnected networks.

  4. [Do the structure and functioning of the elderly's social network influence functional health: a preliminary study].

    Science.gov (United States)

    Masse, Marie; Swine, Christian

    2015-06-01

    We examined structural and functional characteristics of social networks related to health and well-being among community-dwelling older adults. A survey was performed in Brussels, using an original name-generating network inventory, to explore the structure and types of social ties (e.g. children, friends, neighbors) which forms the elderly's network. Different kinds of support (instrumental, emotional, social) were assessed due to the multiple contents of social exchanges between the elderly and their network's members. Our results highlighted some important social network resources. Especially, social participation, contacts with friends of the same age and reciprocity of social relationships are likely to promote functional health and well-being in later life. We discuss our findings in relation to major social network's typologies referring to older adults.

  5. Entropy-based generation of supervised neural networks for classification of structured patterns.

    Science.gov (United States)

    Tsai, Hsien-Leing; Lee, Shie-Jue

    2004-03-01

    Sperduti and Starita proposed a new type of neural network which consists of generalized recursive neurons for classification of structures. In this paper, we propose an entropy-based approach for constructing such neural networks for classification of acyclic structured patterns. Given a classification problem, the architecture, i.e., the number of hidden layers and the number of neurons in each hidden layer, and all the values of the link weights associated with the corresponding neural network are automatically determined. Experimental results have shown that the networks constructed by our method can have a better performance, with respect to network size, learning speed, or recognition accuracy, than the networks obtained by other methods.

  6. Modeling past and future structure of the global virtual water trade network

    Science.gov (United States)

    Dalin, C.; Suweis, S.; Konar, M.; Hanasaki, N.; Rodriguez-Iturbe, I.

    2012-12-01

    Climate change and socio-economic development place an increasing pressure on essential natural resources, such as arable land and freshwater. The international food trade can save water globally by redistributing commodities produced relatively more water-efficiently. We focus on the global virtual water trade network associated with international staple food trade from 1986-2008. This study aims to determine which variables control the network's structure and temporal evolution, and to estimate changes in the network under future scenarios. Our fitness model reproduces both the topological and weighted characteristics of the network for the whole period. Undirected and directed network properties are well reproduced in each year, assuming as sole controls each nation's GDP, mean annual rainfall, agricultural area and population. The future structure of the network is estimated using climate and socio-economic projections, showing that volumes of virtual water traded will become increasingly heterogeneous and the importance of dominant importing nations will further strengthen.

  7. Association of structural global brain network properties with intelligence in normal aging.

    Science.gov (United States)

    Fischer, Florian U; Wolf, Dominik; Scheurich, Armin; Fellgiebel, Andreas

    2014-01-01

    Higher general intelligence attenuates age-associated cognitive decline and the risk of dementia. Thus, intelligence has been associated with cognitive reserve or resilience in normal aging. Neurophysiologically, intelligence is considered as a complex capacity that is dependent on a global cognitive network rather than isolated brain areas. An association of structural as well as functional brain network characteristics with intelligence has already been reported in young adults. We investigated the relationship between global structural brain network properties, general intelligence and age in a group of 43 cognitively healthy elderly, age 60-85 years. Individuals were assessed cross-sectionally using Wechsler Adult Intelligence Scale-Revised (WAIS-R) and diffusion-tensor imaging. Structural brain networks were reconstructed individually using deterministic tractography, global network properties (global efficiency, mean shortest path length, and clustering coefficient) were determined by graph theory and correlated to intelligence scores within both age groups. Network properties were significantly correlated to age, whereas no significant correlation to WAIS-R was observed. However, in a subgroup of 15 individuals aged 75 and above, the network properties were significantly correlated to WAIS-R. Our findings suggest that general intelligence and global properties of structural brain networks may not be generally associated in cognitively healthy elderly. However, we provide first evidence of an association between global structural brain network properties and general intelligence in advanced elderly. Intelligence might be affected by age-associated network deterioration only if a certain threshold of structural degeneration is exceeded. Thus, age-associated brain structural changes seem to be partially compensated by the network and the range of this compensation might be a surrogate of cognitive reserve or brain resilience.

  8. Association of structural global brain network properties with intelligence in normal aging.

    Directory of Open Access Journals (Sweden)

    Florian U Fischer

    Full Text Available Higher general intelligence attenuates age-associated cognitive decline and the risk of dementia. Thus, intelligence has been associated with cognitive reserve or resilience in normal aging. Neurophysiologically, intelligence is considered as a complex capacity that is dependent on a global cognitive network rather than isolated brain areas. An association of structural as well as functional brain network characteristics with intelligence has already been reported in young adults. We investigated the relationship between global structural brain network properties, general intelligence and age in a group of 43 cognitively healthy elderly, age 60-85 years. Individuals were assessed cross-sectionally using Wechsler Adult Intelligence Scale-Revised (WAIS-R and diffusion-tensor imaging. Structural brain networks were reconstructed individually using deterministic tractography, global network properties (global efficiency, mean shortest path length, and clustering coefficient were determined by graph theory and correlated to intelligence scores within both age groups. Network properties were significantly correlated to age, whereas no significant correlation to WAIS-R was observed. However, in a subgroup of 15 individuals aged 75 and above, the network properties were significantly correlated to WAIS-R. Our findings suggest that general intelligence and global properties of structural brain networks may not be generally associated in cognitively healthy elderly. However, we provide first evidence of an association between global structural brain network properties and general intelligence in advanced elderly. Intelligence might be affected by age-associated network deterioration only if a certain threshold of structural degeneration is exceeded. Thus, age-associated brain structural changes seem to be partially compensated by the network and the range of this compensation might be a surrogate of cognitive reserve or brain resilience.

  9. Temporal network epidemiology

    CERN Document Server

    Holme, Petter

    2017-01-01

    This book covers recent developments in epidemic process models and related data on temporally varying networks. It is widely recognized that contact networks are indispensable for describing, understanding, and intervening to stop the spread of infectious diseases in human and animal populations; “network epidemiology” is an umbrella term to describe this research field. More recently, contact networks have been recognized as being highly dynamic. This observation, also supported by an increasing amount of new data, has led to research on temporal networks, a rapidly growing area. Changes in network structure are often informed by epidemic (or other) dynamics, in which case they are referred to as adaptive networks. This volume gathers contributions by prominent authors working in temporal and adaptive network epidemiology, a field essential to understanding infectious diseases in real society.

  10. Determinants of Network Outcomes

    DEFF Research Database (Denmark)

    Ysa, Tamyko; Sierra, Vicenta; Esteve, Marc

    2014-01-01

    The literature on network management is extensive. However, it generally explores network structures, neglecting the impact of management strategies. In this article we assess the effect of management strategies on network outcomes, providing empirical evidence from 119 urban revitalization...... networks. We go beyond current work by testing a path model for the determinants of network outcomes and considering the interactions between the constructs: management strategies, trust, complexity, and facilitative leadership. Our results suggest that management strategies have a strong effect on network...... outcomes and that they enhance the level of trust. We also found that facilitative leadership has a positive impact on network management as well as on trust in the network. Our findings also show that complexity has a negative impact on trust. A key finding of our research is that managers may wield more...

  11. Sexual network structure and the spread of HIV in Africa: evidence from Likoma Island, Malawi.

    Science.gov (United States)

    Helleringer, Stéphane; Kohler, Hans-Peter

    2007-11-12

    Whereas sexual relationships among low-risk individuals account for the majority of HIV infections in sub-Saharan Africa, limited knowledge exists about the structure and characteristics of sexual networks among the general population in sub-Saharan Africa. To investigate the population-level structure of sexual networks connecting the young adult population of several villages on Likoma Island (Malawi), and analyse the structural position of HIV-positive individuals within the sexual network. A cross-sectional sociocentric survey of sexual partnerships and biomarkers of prevalent HIV infections. The study documents the existence of a large and robust sexual network linking a substantial fraction of the island's young adult population: half of all sexually active respondents were connected in a giant network component, and more than a quarter were linked through multiple independent chains of sexual relationships. This high network connectivity emerges within short time frames. The prevalence of HIV also varied significantly across the network, with sparser regions having a higher HIV prevalence than densely connected components. Several risk factors related to sexual mixing patterns help explain differentials in HIV prevalence across network locations. Contrary to claims that sexual networks in rural sub-Saharan Africa are too sparse to sustain generalized HIV epidemics, the structure of the networks observed in Likoma appears compatible with a broad diffusion of HIV among lower-risk groups. The non-homogeneous distribution of HIV infection within the network suggests that network characteristics are an important determinant of the dynamics of HIV spread within a population.

  12. Bibliometrics/Citation networks

    OpenAIRE

    Leydesdorff, Loet

    2015-01-01

    In addition to shaping social networks, for example, in terms of co-authorship relations, scientific communications induce and reproduce cognitive structures. Scientific literature is intellectually organized in terms of disciplines and specialties; these structures are reproduced and networked reflexively by making references to the authors, concepts and texts embedded in these literatures. The concept of a cognitive structure was introduced in social network analysis (SNA) in 1987 by David ...

  13. Extracting information from multiplex networks.

    Science.gov (United States)

    Iacovacci, Jacopo; Bianconi, Ginestra

    2016-06-01

    Multiplex networks are generalized network structures that are able to describe networks in which the same set of nodes are connected by links that have different connotations. Multiplex networks are ubiquitous since they describe social, financial, engineering, and biological networks as well. Extending our ability to analyze complex networks to multiplex network structures increases greatly the level of information that is possible to extract from big data. For these reasons, characterizing the centrality of nodes in multiplex networks and finding new ways to solve challenging inference problems defined on multiplex networks are fundamental questions of network science. In this paper, we discuss the relevance of the Multiplex PageRank algorithm for measuring the centrality of nodes in multilayer networks and we characterize the utility of the recently introduced indicator function Θ̃(S) for describing their mesoscale organization and community structure. As working examples for studying these measures, we consider three multiplex network datasets coming for social science.

  14. Effect of node attributes on the temporal dynamics of network structure

    Science.gov (United States)

    Momeni, Naghmeh; Fotouhi, Babak

    2017-03-01

    Many natural and social networks evolve in time and their structures are dynamic. In most networks, nodes are heterogeneous, and their roles in the evolution of structure differ. This paper focuses on the role of individual attributes on the temporal dynamics of network structure. We focus on a basic model for growing networks that incorporates node attributes (which we call "quality"), and we focus on the problem of forecasting the structural properties of the network in arbitrary times for an arbitrary initial network. That is, we address the following question: If we are given a certain initial network with given arbitrary structure and known node attributes, then how does the structure change in time as new nodes with given distribution of attributes join the network? We solve the model analytically and obtain the quality-degree joint distribution and degree correlations. We characterize the role of individual attributes in the position of individual nodes in the hierarchy of connections. We confirm the theoretical findings with Monte Carlo simulations.

  15. Temporal variation in bat-fruit interactions: Foraging strategies influence network structure over time

    Science.gov (United States)

    Zapata-Mesa, Natalya; Montoya-Bustamante, Sebastián; Murillo-García, Oscar E.

    2017-11-01

    Mutualistic interactions, such as seed dispersal, are important for the maintenance of structure and stability of tropical communities. However, there is a lack of information about spatial and temporal variation in plant-animal interaction networks. Thus, our goal was to assess the effect of bat's foraging strategies on temporal variation in the structure and robustness of bat-fruit networks in both a dry and a rain tropical forest. We evaluated monthly variation in bat-fruit networks by using seven structure metrics: network size, average path length, nestedness, modularity, complementary specialization, normalized degree and betweenness centrality. Seed dispersal networks showed variations in size, species composition and modularity; did not present nested structures and their complementary specialization was high compared to other studies. Both networks presented short path lengths, and a constantly high robustness, despite their monthly variations. Sedentary bat species were recorded during all the study periods and occupied more central positions than nomadic species. We conclude that foraging strategies are important structuring factors that affect the dynamic of networks by determining the functional roles of frugivorous bats over time; thus sedentary bats are more important than nomadic species for the maintenance of the network structure, and their conservation is a must.

  16. The community seismic network and quake-catcher network: enabling structural health monitoring through instrumentation by community participants

    Science.gov (United States)

    Kohler, Monica D.; Heaton, Thomas H.; Cheng, Ming-Hei

    2013-04-01

    A new type of seismic network is in development that takes advantage of community volunteers to install low-cost accelerometers in houses and buildings. The Community Seismic Network and Quake-Catcher Network are examples of this, in which observational-based structural monitoring is carried out using records from one to tens of stations in a single building. We have deployed about one hundred accelerometers in a number of buildings ranging between five and 23 stories in the Los Angeles region. In addition to a USB-connected device which connects to the host's computer, we have developed a stand-alone sensor-plug-computer device that directly connects to the internet via Ethernet or wifi. In the case of the Community Seismic Network, the sensors report both continuous data and anomalies in local acceleration to a cloud computing service consisting of data centers geographically distributed across the continent. Visualization models of the instrumented buildings' dynamic linear response have been constructed using Google SketchUp and an associated plug-in to matlab with recorded shaking data. When data are available from only one to a very limited number of accelerometers in high rises, the buildings are represented as simple shear beam or prismatic Timoshenko beam models with soil-structure interaction. Small-magnitude earthquake records are used to identify the first set of horizontal vibrational frequencies. These frequencies are then used to compute the response on every floor of the building, constrained by the observed data. These tools are resulting in networking standards that will enable data sharing among entire communities, facility managers, and emergency response groups.

  17. Social networks

    CERN Document Server

    Etaner-Uyar, A Sima

    2014-01-01

    The present volume provides a comprehensive resource for practitioners and researchers alike-both those new to the field as well as those who already have some experience. The work covers Social Network Analysis theory and methods with a focus on current applications and case studies applied in various domains such as mobile networks, security, machine learning and health. With the increasing popularity of Web 2.0, social media has become a widely used communication platform. Parallel to this development, Social Network Analysis gained in importance as a research field, while opening up many

  18. Network Warrior

    CERN Document Server

    Donahue, Gary

    2011-01-01

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

  19. Nafion–clay hybrids with a network structure

    KAUST Repository

    Burgaz, Engin

    2009-05-01

    Nafion-clay hybrid membranes with a unique microstructure were synthesized using a fundamentally new approach. The new approach is based on depletion aggregation of suspended particles - a well-known phenomenon in colloids. For certain concentrations of clay and polymer, addition of Nafion solution to clay suspensions in water leads to a gel. Using Cryo-TEM we show that the clay particles in the hybrid gels form a network structure with an average cell size in the order of 500 nm. The hybrid gels are subsequently cast to produce hybrid Nafion-clay membranes. Compared to pure Nafion the swelling of the hybrid membranes in water and methanol is dramatically reduced while their selectivity (ratio of conductivity over permeability) increases. The small decrease of ionic conductivity for the hybrid membranes is more than compensated by the large decrease in methanol permeability. Lastly the hybrid membranes are much stiffer and can withstand higher temperatures compared to pure Nafion. Both of these characteristics are highly desirable for use in fuel cell applications, since a) they will allow the use of a thinner membrane circumventing problems associated with the membrane resistance and b) enable high temperature applications. © 2009 Elsevier Ltd. All rights reserved.

  20. SO2 Emissions in China - Their Network and Hierarchical Structures

    Science.gov (United States)

    Yan, Shaomin; Wu, Guang

    2017-04-01

    SO2 emissions lead to various harmful effects on environment and human health. The SO2 emission in China has significant contribution to the global SO2 emission, so it is necessary to employ various methods to study SO2 emissions in China with great details in order to lay the foundation for policymaking to improve environmental conditions in China. Network analysis is used to analyze the SO2 emissions from power generation, industrial, residential and transportation sectors in China for 2008 and 2010, which are recently available from 1744 ground surface monitoring stations. The results show that the SO2 emissions from power generation sector were highly individualized as small-sized clusters, the SO2 emissions from industrial sector underwent an integration process with a large cluster contained 1674 places covering all industrial areas in China, the SO2 emissions from residential sector was not impacted by time, and the SO2 emissions from transportation sector underwent significant integration. Hierarchical structure is obtained by further combining SO2 emissions from all four sectors and is potentially useful to find out similar patterns of SO2 emissions, which can provide information on understanding the mechanisms of SO2 pollution and on designing different environmental measure to combat SO2 emissions.