Tensor Spectral Clustering for Partitioning Higher-order Network Structures.

PubMed

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.

Tensor Spectral Clustering for Partitioning Higher-order Network Structures

PubMed Central

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

2016-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. PMID:27812399

Comparative analysis of quantitative efficiency evaluation methods for transportation networks

PubMed Central

He, Yuxin; Hong, Jian

2017-01-01

An effective evaluation of transportation network efficiency could offer guidance for the optimal control of urban traffic. Based on the introduction and related mathematical analysis of three quantitative evaluation methods for transportation network efficiency, this paper compares the information measured by them, including network structure, traffic demand, travel choice behavior and other factors which affect network efficiency. Accordingly, the applicability of various evaluation methods is discussed. Through analyzing different transportation network examples it is obtained that Q-H method could reflect the influence of network structure, traffic demand and user route choice behavior on transportation network efficiency well. In addition, the transportation network efficiency measured by this method and Braess’s Paradox can be explained with each other, which indicates a better evaluation of the real operation condition of transportation network. Through the analysis of the network efficiency calculated by Q-H method, it can also be drawn that a specific appropriate demand is existed to a given transportation network. Meanwhile, under the fixed demand, both the critical network structure that guarantees the stability and the basic operation of the network and a specific network structure contributing to the largest value of the transportation network efficiency can be identified. PMID:28399165

Comparative analysis of quantitative efficiency evaluation methods for transportation networks.

PubMed

He, Yuxin; Qin, Jin; Hong, Jian

2017-01-01

An effective evaluation of transportation network efficiency could offer guidance for the optimal control of urban traffic. Based on the introduction and related mathematical analysis of three quantitative evaluation methods for transportation network efficiency, this paper compares the information measured by them, including network structure, traffic demand, travel choice behavior and other factors which affect network efficiency. Accordingly, the applicability of various evaluation methods is discussed. Through analyzing different transportation network examples it is obtained that Q-H method could reflect the influence of network structure, traffic demand and user route choice behavior on transportation network efficiency well. In addition, the transportation network efficiency measured by this method and Braess's Paradox can be explained with each other, which indicates a better evaluation of the real operation condition of transportation network. Through the analysis of the network efficiency calculated by Q-H method, it can also be drawn that a specific appropriate demand is existed to a given transportation network. Meanwhile, under the fixed demand, both the critical network structure that guarantees the stability and the basic operation of the network and a specific network structure contributing to the largest value of the transportation network efficiency can be identified.

Structure-function clustering in multiplex brain networks

NASA Astrophysics Data System (ADS)

Crofts, J. J.; Forrester, M.; O'Dea, R. D.

2016-10-01

A key question in neuroscience is to understand how a rich functional repertoire of brain activity arises within relatively static networks of structurally connected neural populations: elucidating the subtle interactions between evoked “functional connectivity” and the underlying “structural connectivity” has the potential to address this. These structural-functional networks (and neural networks more generally) are more naturally described using a multilayer or multiplex network approach, in favour of standard single-layer network analyses that are more typically applied to such systems. In this letter, we address such issues by exploring important structure-function relations in the Macaque cortical network by modelling it as a duplex network that comprises an anatomical layer, describing the known (macro-scale) network topology of the Macaque monkey, and a functional layer derived from simulated neural activity. We investigate and characterize correlations between structural and functional layers, as system parameters controlling simulated neural activity are varied, by employing recently described multiplex network measures. Moreover, we propose a novel measure of multiplex structure-function clustering which allows us to investigate the emergence of functional connections that are distinct from the underlying cortical structure, and to highlight the dependence of multiplex structure on the neural dynamical regime.

Optimization of controllability and robustness of complex networks by edge directionality

NASA Astrophysics Data System (ADS)

Liang, Man; Jin, Suoqin; Wang, Dingjie; Zou, Xiufen

2016-09-01

Recently, controllability of complex networks has attracted enormous attention in various fields of science and engineering. How to optimize structural controllability has also become a significant issue. Previous studies have shown that an appropriate directional assignment can improve structural controllability; however, the evolution of the structural controllability of complex networks under attacks and cascading has always been ignored. To address this problem, this study proposes a new edge orientation method (NEOM) based on residual degree that changes the link direction while conserving topology and directionality. By comparing the results with those of previous methods in two random graph models and several realistic networks, our proposed approach is demonstrated to be an effective and competitive method for improving the structural controllability of complex networks. Moreover, numerical simulations show that our method is near-optimal in optimizing structural controllability. Strikingly, compared to the original network, our method maintains the structural controllability of the network under attacks and cascading, indicating that the NEOM can also enhance the robustness of controllability of networks. These results alter the view of the nature of controllability in complex networks, change the understanding of structural controllability and affect the design of network models to control such networks.

Co-extinction in a host-parasite network: identifying key hosts for network stability.

PubMed

Dallas, Tad; Cornelius, Emily

2015-08-17

Parasites comprise a substantial portion of total biodiversity. Ultimately, this means that host extinction could result in many secondary extinctions of obligate parasites and potentially alter host-parasite network structure. Here, we examined a highly resolved fish-parasite network to determine key hosts responsible for maintaining parasite diversity and network structure (quantified here as nestedness and modularity). We evaluated four possible host extinction orders and compared the resulting co-extinction dynamics to random extinction simulations; including host removal based on estimated extinction risk, parasite species richness and host level contributions to nestedness and modularity. We found that all extinction orders, except the one based on realistic extinction risk, resulted in faster declines in parasite diversity and network structure relative to random biodiversity loss. Further, we determined species-level contributions to network structure were best predicted by parasite species richness and host family. Taken together, we demonstrate that a small proportion of hosts contribute substantially to network structure and that removal of these hosts results in rapid declines in parasite diversity and network structure. As network stability can potentially be inferred through measures of network structure, our findings may provide insight into species traits that confer stability.

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

NASA Astrophysics Data System (ADS)

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.

Network cosmology.

PubMed

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.

Network Cosmology

PubMed Central

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

Revealing how network structure affects accuracy of link prediction

NASA Astrophysics Data System (ADS)

Yang, Jin-Xuan; Zhang, Xiao-Dong

2017-08-01

Link prediction plays an important role in network reconstruction and network evolution. The network structure affects the accuracy of link prediction, which is an interesting problem. In this paper we use common neighbors and the Gini coefficient to reveal the relation between them, which can provide a good reference for the choice of a suitable link prediction algorithm according to the network structure. Moreover, the statistical analysis reveals correlation between the common neighbors index, Gini coefficient index and other indices to describe the network structure, such as Laplacian eigenvalues, clustering coefficient, degree heterogeneity, and assortativity of network. Furthermore, a new method to predict missing links is proposed. The experimental results show that the proposed algorithm yields better prediction accuracy and robustness to the network structure than existing currently used methods for a variety of real-world networks.

Characterizing core-periphery structure of complex network by h-core and fingerprint curve

NASA Astrophysics Data System (ADS)

Li, Simon S.; Ye, Adam Y.; Qi, Eric P.; Stanley, H. Eugene; Ye, Fred Y.

2018-02-01

It is proposed that the core-periphery structure of complex networks can be simulated by h-cores and fingerprint curves. While the features of core structure are characterized by h-core, the features of periphery structure are visualized by rose or spiral curve as the fingerprint curve linking to entire-network parameters. It is suggested that a complex network can be approached by h-core and rose curves as the first-order Fourier-approach, where the core-periphery structure is characterized by five parameters: network h-index, network radius, degree power, network density and average clustering coefficient. The simulation looks Fourier-like analysis.

Effect of node attributes on the temporal dynamics of network structure

NASA Astrophysics Data System (ADS)

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.

Structural Covariance of the Default Network in Healthy and Pathological Aging

PubMed Central

Turner, Gary R.

2013-01-01

Significant progress has been made uncovering functional brain networks, yet little is known about the corresponding structural covariance networks. The default network's functional architecture has been shown to change over the course of healthy and pathological aging. We examined cross-sectional and longitudinal datasets to reveal the structural covariance of the human default network across the adult lifespan and through the progression of Alzheimer's disease (AD). We used a novel approach to identify the structural covariance of the default network and derive individual participant scores that reflect the covariance pattern in each brain image. A seed-based multivariate analysis was conducted on structural images in the cross-sectional OASIS (N = 414) and longitudinal Alzheimer's Disease Neuroimaging Initiative (N = 434) datasets. We reproduced the distributed topology of the default network, based on a posterior cingulate cortex seed, consistent with prior reports of this intrinsic connectivity network. Structural covariance of the default network scores declined in healthy and pathological aging. Decline was greatest in the AD cohort and in those who progressed from mild cognitive impairment to AD. Structural covariance of the default network scores were positively associated with general cognitive status, reduced in APOEε4 carriers versus noncarriers, and associated with CSF biomarkers of AD. These findings identify the structural covariance of the default network and characterize changes to the network's gray matter integrity across the lifespan and through the progression of AD. The findings provide evidence for the large-scale network model of neurodegenerative disease, in which neurodegeneration spreads through intrinsically connected brain networks in a disease specific manner. PMID:24048852

Modeling online social signed networks

NASA Astrophysics Data System (ADS)

Li, Le; Gu, Ke; Zeng, An; Fan, Ying; Di, Zengru

2018-04-01

People's online rating behavior can be modeled by user-object bipartite networks directly. However, few works have been devoted to reveal the hidden relations between users, especially from the perspective of signed networks. We analyze the signed monopartite networks projected by the signed user-object bipartite networks, finding that the networks are highly clustered with obvious community structure. Interestingly, the positive clustering coefficient is remarkably higher than the negative clustering coefficient. Then, a Signed Growing Network model (SGN) based on local preferential attachment is proposed to generate a user's signed network that has community structure and high positive clustering coefficient. Other structural properties of the modeled networks are also found to be similar to the empirical networks.

Managing Network Partitions in Structured P2P Networks

NASA Astrophysics Data System (ADS)

Shafaat, Tallat M.; Ghodsi, Ali; Haridi, Seif

Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Consequently, the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems. This makes it a crucial requirement for building any structured peer-to-peer systems to be resilient to network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. Structured overlays have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this chapter, we motivate the problem of network partitions and mergers in structured overlays. We discuss how a structured overlay can automatically detect a network partition and merger. We present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.

Impact of environmental inputs on reverse-engineering approach to network structures.

PubMed

Wu, Jianhua; Sinfield, James L; Buchanan-Wollaston, Vicky; Feng, Jianfeng

2009-12-04

Uncovering complex network structures from a biological system is one of the main topic in system biology. The network structures can be inferred by the dynamical Bayesian network or Granger causality, but neither techniques have seriously taken into account the impact of environmental inputs. With considerations of natural rhythmic dynamics of biological data, we propose a system biology approach to reveal the impact of environmental inputs on network structures. We first represent the environmental inputs by a harmonic oscillator and combine them with Granger causality to identify environmental inputs and then uncover the causal network structures. We also generalize it to multiple harmonic oscillators to represent various exogenous influences. This system approach is extensively tested with toy models and successfully applied to a real biological network of microarray data of the flowering genes of the model plant Arabidopsis Thaliana. The aim is to identify those genes that are directly affected by the presence of the sunlight and uncover the interactive network structures associating with flowering metabolism. We demonstrate that environmental inputs are crucial for correctly inferring network structures. Harmonic causal method is proved to be a powerful technique to detect environment inputs and uncover network structures, especially when the biological data exhibit periodic oscillations.

Extracting information from multiplex networks

NASA Astrophysics Data System (ADS)

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.

Evidence for novel age-dependent network structures as a putative primo vascular network in the dura mater of the rat brain

PubMed Central

Lee, Ho-Sung; Kang, Dai-In; Yoon, Seung Zhoo; Ryu, Yeon Hee; Lee, Inhyung; Kim, Hoon-Gi; Lee, Byung-Cheon; Lee, Ki Bog

2015-01-01

With chromium-hematoxylin staining, we found evidence for the existence of novel age-dependent network structures in the dura mater of rat brains. Under stereomicroscopy, we noticed that chromium-hematoxylin-stained threadlike structures, which were barely observable in 1-week-old rats, were networked in specific areas of the brain, for example, the lateral lobes and the cerebella, in 4-week-old rats. In 7-week-old rats, those structures were found to have become larger and better networked. With phase contrast microscopy, we found that in 1-week-old rats, chromium-hematoxylin-stained granules were scattered in the same areas of the brain in which the network structures would later be observed in the 4- and 7-week-old rats. Such age-dependent network structures were examined by using optical and transmission electron microscopy, and the following results were obtained. The scattered granules fused into networks with increasing age. Cross-sections of the age-dependent network structures demonstrated heavily-stained basophilic substructures. Transmission electron microscopy revealed the basophilic substructures to be clusters with high electron densities consisting of nanosized particles. We report these data as evidence for the existence of age-dependent network structures in the dura mater, we discuss their putative functions of age-dependent network structures beyond the general concept of the dura mater as a supporting matrix. PMID:26330833

Aberrant Global and Regional Topological Organization of the Fractional Anisotropy-weighted Brain Structural Networks in Major Depressive Disorder

PubMed Central

Chen, Jian-Huai; Yao, Zhi-Jian; Qin, Jiao-Long; Yan, Rui; Hua, Ling-Ling; Lu, Qing

2016-01-01

Background: Most previous neuroimaging studies have focused on the structural and functional abnormalities of local brain regions in major depressive disorder (MDD). Moreover, the exactly topological organization of networks underlying MDD remains unclear. This study examined the aberrant global and regional topological patterns of the brain white matter networks in MDD patients. Methods: The diffusion tensor imaging data were obtained from 27 patients with MDD and 40 healthy controls. The brain fractional anisotropy-weighted structural networks were constructed, and the global network and regional nodal metrics of the networks were explored by the complex network theory. Results: Compared with the healthy controls, the brain structural network of MDD patients showed an intact small-world topology, but significantly abnormal global network topological organization and regional nodal characteristic of the network in MDD were found. Our findings also indicated that the brain structural networks in MDD patients become a less strongly integrated network with a reduced central role of some key brain regions. Conclusions: All these resulted in a less optimal topological organization of networks underlying MDD patients, including an impaired capability of local information processing, reduced centrality of some brain regions and limited capacity to integrate information across different regions. Thus, these global network and regional node-level aberrations might contribute to understanding the pathogenesis of MDD from the view of the brain network. PMID:26960371

Social inheritance can explain the structure of animal social networks

PubMed Central

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

Epidemic spreading on complex networks with community structures

PubMed Central

Stegehuis, Clara; van der Hofstad, Remco; 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 enforce as well as 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. PMID:27440176

Structure Shapes Dynamics and Directionality in Diverse Brain Networks: Mathematical Principles and Empirical Confirmation in Three Species

NASA Astrophysics Data System (ADS)

Moon, Joon-Young; Kim, Junhyeok; Ko, Tae-Wook; Kim, Minkyung; Iturria-Medina, Yasser; Choi, Jee-Hyun; Lee, Joseph; Mashour, George A.; Lee, Uncheol

2017-04-01

Identifying how spatially distributed information becomes integrated in the brain is essential to understanding higher cognitive functions. Previous computational and empirical studies suggest a significant influence of brain network structure on brain network function. However, there have been few analytical approaches to explain the role of network structure in shaping regional activities and directionality patterns. In this study, analytical methods are applied to a coupled oscillator model implemented in inhomogeneous networks. We first derive a mathematical principle that explains the emergence of directionality from the underlying brain network structure. We then apply the analytical methods to the anatomical brain networks of human, macaque, and mouse, successfully predicting simulation and empirical electroencephalographic data. The results demonstrate that the global directionality patterns in resting state brain networks can be predicted solely by their unique network structures. This study forms a foundation for a more comprehensive understanding of how neural information is directed and integrated in complex brain networks.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chinthavali, Supriya

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) andmore » the criticality index is found to be effective for one test network to identify the vulnerable nodes.« less

Structural and Functional Characteristics of the Social Networks of People with Mild Intellectual Disabilities

ERIC Educational Resources Information Center

van Asselt-Goverts, A. E.; Embregts, P. J. C. M.; Hendriks, A. H. C.

2013-01-01

In the research on people with intellectual disabilities and their social networks, the functional characteristics of their networks have been examined less often than the structural characteristics. Research on the structural characteristics of their networks is also usually restricted to the size and composition of the networks, moreover, with…

Effects of substrate network topologies on competition dynamics

NASA Astrophysics Data System (ADS)

Lee, Sang Hoon; Jeong, Hawoong

2006-08-01

We study a competition dynamics, based on the minority game, endowed with various substrate network structures. We observe the effects of the network topologies by investigating the volatility of the system and the structure of follower networks. The topology of substrate structures significantly influences the system efficiency represented by the volatility and such substrate networks are shown to amplify the herding effect and cause inefficiency in most cases. The follower networks emerging from the leadership structure show a power-law incoming degree distribution. This study shows the emergence of scale-free structures of leadership in the minority game and the effects of the interaction among players on the networked version of the game.

Global Electricity Trade Network: Structures and Implications

PubMed Central

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

Global Electricity Trade Network: Structures and Implications.

PubMed

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.

Graph distance for complex networks

NASA Astrophysics Data System (ADS)

Shimada, Yutaka; Hirata, Yoshito; Ikeguchi, Tohru; Aihara, Kazuyuki

2016-10-01

Networks are widely used as a tool for describing diverse real complex systems and have been successfully applied to many fields. The distance between networks is one of the most fundamental concepts for properly classifying real networks, detecting temporal changes in network structures, and effectively predicting their temporal evolution. However, this distance has rarely been discussed in the theory of complex networks. Here, we propose a graph distance between networks based on a Laplacian matrix that reflects the structural and dynamical properties of networked dynamical systems. Our results indicate that the Laplacian-based graph distance effectively quantifies the structural difference between complex networks. We further show that our approach successfully elucidates the temporal properties underlying temporal networks observed in the context of face-to-face human interactions.

Universal partitioning of the hierarchical fold network of 50-residue segments in proteins

PubMed Central

Ito, Jun-ichi; Sonobe, Yuki; Ikeda, Kazuyoshi; Tomii, Kentaro; Higo, Junichi

2009-01-01

Background Several studies have demonstrated that protein fold space is structured hierarchically and that power-law statistics are satisfied in relation between the numbers of protein families and protein folds (or superfamilies). We examined the internal structure and statistics in the fold space of 50 amino-acid residue segments taken from various protein folds. We used inter-residue contact patterns to measure the tertiary structural similarity among segments. Using this similarity measure, the segments were classified into a number (Kc) of clusters. We examined various Kc values for the clustering. The special resolution to differentiate the segment tertiary structures increases with increasing Kc. Furthermore, we constructed networks by linking structurally similar clusters. Results The network was partitioned persistently into four regions for Kc ≥ 1000. This main partitioning is consistent with results of earlier studies, where similar partitioning was reported in classifying protein domain structures. Furthermore, the network was partitioned naturally into several dozens of sub-networks (i.e., communities). Therefore, intra-sub-network clusters were mutually connected with numerous links, although inter-sub-network ones were rarely done with few links. For Kc ≥ 1000, the major sub-networks were about 40; the contents of the major sub-networks were conserved. This sub-partitioning is a novel finding, suggesting that the network is structured hierarchically: Segments construct a cluster, clusters form a sub-network, and sub-networks constitute a region. Additionally, the network was characterized by non-power-law statistics, which is also a novel finding. Conclusion Main findings are: (1) The universe of 50 residue segments found here was characterized by non-power-law statistics. Therefore, the universe differs from those ever reported for the protein domains. (2) The 50-residue segments were partitioned persistently and universally into some dozens (ca. 40) of major sub-networks, irrespective of the number of clusters. (3) These major sub-networks encompassed 90% of all segments. Consequently, the protein tertiary structure is constructed using the dozens of elements (sub-networks). PMID:19454039

Asymmetry of Hemispheric Network Topology Reveals Dissociable Processes between Functional and Structural Brain Connectome in Community-Living Elders

PubMed Central

Sun, Yu; Li, Junhua; Suckling, John; Feng, Lei

2017-01-01

Human brain is structurally and functionally asymmetrical and the asymmetries of brain phenotypes have been shown to change in normal aging. Recent advances in graph theoretical analysis have showed topological lateralization between hemispheric networks in the human brain throughout the lifespan. Nevertheless, apparent discrepancies of hemispheric asymmetry were reported between the structural and functional brain networks, indicating the potentially complex asymmetry patterns between structural and functional networks in aging population. In this study, using multimodal neuroimaging (resting-state fMRI and structural diffusion tensor imaging), we investigated the characteristics of hemispheric network topology in 76 (male/female = 15/61, age = 70.08 ± 5.30 years) community-dwelling older adults. Hemispheric functional and structural brain networks were obtained for each participant. Graph theoretical approaches were then employed to estimate the hemispheric topological properties. We found that the optimal small-world properties were preserved in both structural and functional hemispheric networks in older adults. Moreover, a leftward asymmetry in both global and local levels were observed in structural brain networks in comparison with a symmetric pattern in functional brain network, suggesting a dissociable process of hemispheric asymmetry between structural and functional connectome in healthy older adults. Finally, the scores of hemispheric asymmetry in both structural and functional networks were associated with behavioral performance in various cognitive domains. Taken together, these findings provide new insights into the lateralized nature of multimodal brain connectivity, highlight the potentially complex relationship between structural and functional brain network alterations, and augment our understanding of asymmetric structural and functional specializations in normal aging. PMID:29209197

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

PubMed Central

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

Leaf Extraction and Analysis Framework Graphical User Interface: Segmenting and Analyzing the Structure of Leaf Veins and Areoles1[W][OA

PubMed Central

Price, Charles A.; Symonova, Olga; Mileyko, Yuriy; Hilley, Troy; Weitz, Joshua S.

2011-01-01

Interest in the structure and function of physical biological networks has spurred the development of a number of theoretical models that predict optimal network structures across a broad array of taxonomic groups, from mammals to plants. In many cases, direct tests of predicted network structure are impossible given the lack of suitable empirical methods to quantify physical network geometry with sufficient scope and resolution. There is a long history of empirical methods to quantify the network structure of plants, from roots, to xylem networks in shoots and within leaves. However, with few exceptions, current methods emphasize the analysis of portions of, rather than entire networks. Here, we introduce the Leaf Extraction and Analysis Framework Graphical User Interface (LEAF GUI), a user-assisted software tool that facilitates improved empirical understanding of leaf network structure. LEAF GUI takes images of leaves where veins have been enhanced relative to the background, and following a series of interactive thresholding and cleaning steps, returns a suite of statistics and information on the structure of leaf venation networks and areoles. Metrics include the dimensions, position, and connectivity of all network veins, and the dimensions, shape, and position of the areoles they surround. Available for free download, the LEAF GUI software promises to facilitate improved understanding of the adaptive and ecological significance of leaf vein network structure. PMID:21057114

Leaf extraction and analysis framework graphical user interface: segmenting and analyzing the structure of leaf veins and areoles.

PubMed

Price, Charles A; Symonova, Olga; Mileyko, Yuriy; Hilley, Troy; Weitz, Joshua S

2011-01-01

Interest in the structure and function of physical biological networks has spurred the development of a number of theoretical models that predict optimal network structures across a broad array of taxonomic groups, from mammals to plants. In many cases, direct tests of predicted network structure are impossible given the lack of suitable empirical methods to quantify physical network geometry with sufficient scope and resolution. There is a long history of empirical methods to quantify the network structure of plants, from roots, to xylem networks in shoots and within leaves. However, with few exceptions, current methods emphasize the analysis of portions of, rather than entire networks. Here, we introduce the Leaf Extraction and Analysis Framework Graphical User Interface (LEAF GUI), a user-assisted software tool that facilitates improved empirical understanding of leaf network structure. LEAF GUI takes images of leaves where veins have been enhanced relative to the background, and following a series of interactive thresholding and cleaning steps, returns a suite of statistics and information on the structure of leaf venation networks and areoles. Metrics include the dimensions, position, and connectivity of all network veins, and the dimensions, shape, and position of the areoles they surround. Available for free download, the LEAF GUI software promises to facilitate improved understanding of the adaptive and ecological significance of leaf vein network structure.

Quantifying randomness in real networks

NASA Astrophysics Data System (ADS)

Orsini, Chiara; Dankulov, Marija M.; Colomer-de-Simón, Pol; Jamakovic, Almerima; Mahadevan, Priya; Vahdat, Amin; Bassler, Kevin E.; Toroczkai, Zoltán; Boguñá, Marián; Caldarelli, Guido; Fortunato, Santo; Krioukov, Dmitri

2015-10-01

Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks--the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain--and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs.

Network structure, topology, and dynamics in generalized models of synchronization

NASA Astrophysics Data System (ADS)

Lerman, Kristina; Ghosh, Rumi

2012-08-01

Network structure is a product of both its topology and interactions between its nodes. We explore this claim using the paradigm of distributed synchronization in a network of coupled oscillators. As the network evolves to a global steady state, nodes synchronize in stages, revealing the network's underlying community structure. Traditional models of synchronization assume that interactions between nodes are mediated by a conservative process similar to diffusion. However, social and biological processes are often nonconservative. We propose a model of synchronization in a network of oscillators coupled via nonconservative processes. We study the dynamics of synchronization of a synthetic and real-world networks and show that the traditional and nonconservative models of synchronization reveal different structures within the same network.

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

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Interdisciplinary and physics challenges of network theory

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra

2015-09-01

Network theory has unveiled the underlying structure of complex systems such as the Internet or the biological networks in the cell. It has identified universal properties of complex networks, and the interplay between their structure and dynamics. After almost twenty years of the field, new challenges lie ahead. These challenges concern the multilayer structure of most of the networks, the formulation of a network geometry and topology, and the development of a quantum theory of networks. Making progress on these aspects of network theory can open new venues to address interdisciplinary and physics challenges including progress on brain dynamics, new insights into quantum technologies, and quantum gravity.

Robustness and structure of complex networks

NASA Astrophysics Data System (ADS)

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 are much more vulnerable to localized attack compared with random attack. In the second part, we extend the tree-like generating function method to incorporating clustering structure in complex networks. We study the robustness of a complex network system, especially a network of networks (NON) with clustering structure in each network. We find that the system becomes less robust as we increase the clustering coefficient of each network. For a partially dependent network system, we also find that the influence of the clustering coefficient on network robustness decreases as we decrease the coupling strength, and the critical coupling strength qc, at which the first-order phase transition changes to second-order, increases as we increase the clustering coefficient.

How does network structure affect partnerships for promoting physical activity? Evidence from Brazil and Colombia.

PubMed

Parra, Diana C; Dauti, Marsela; Harris, Jenine K; Reyes, Lissette; Malta, Deborah C; Brownson, Ross C; Quintero, Mario A; Pratt, Michael

2011-11-01

The objective of this study was to describe the network structure and factors associated with collaboration in two networks that promote physical activity (PA) in Brazil and Colombia. Organizations that focus on studying and promoting PA in Brazil (35) and Colombia (53) were identified using a modified one-step reputational snowball sampling process. Participants completed an on-line survey between December 2008 and March 2009 for the Brazil network, and between April and June 2009 for the Colombia network. Network stochastic modeling was used to investigate the likelihood of reported inter-organizational collaboration. While structural features of networks were significant predictors of collaboration within each network, the coefficients and other network characteristics differed. Brazil's PA network was decentralized with a larger number of shared partnerships. Colombia's PA network was centralized and collaboration was influenced by perceived importance of peer organizations. On average, organizations in the PA network of Colombia reported facing more barriers (1.5 vs. 2.5 barriers) for collaboration. Future studies should focus on how these different network structures affect the implementation and uptake of evidence-based PA interventions. Copyright © 2011 Elsevier Ltd. All rights reserved.

A Novel Characterization of Amalgamated Networks in Natural Systems

PubMed Central

Barranca, Victor J.; Zhou, Douglas; Cai, David

2015-01-01

Densely-connected networks are prominent among natural systems, exhibiting structural characteristics often optimized for biological function. To reveal such features in highly-connected networks, we introduce a new network characterization determined by a decomposition of network-connectivity into low-rank and sparse components. Based on these components, we discover a new class of networks we define as amalgamated networks, which exhibit large functional groups and dense connectivity. Analyzing recent experimental findings on cerebral cortex, food-web, and gene regulatory networks, we establish the unique importance of amalgamated networks in fostering biologically advantageous properties, including rapid communication among nodes, structural stability under attacks, and separation of network activity into distinct functional modules. We further observe that our network characterization is scalable with network size and connectivity, thereby identifying robust features significant to diverse physical systems, which are typically undetectable by conventional characterizations of connectivity. We expect that studying the amalgamation properties of biological networks may offer new insights into understanding their structure-function relationships. PMID:26035066

Characterization of Adaptation by Morphology in a Planar Biological Network of Plasmodial Slime Mold

NASA Astrophysics Data System (ADS)

Ito, Masateru; Okamoto, Riki; Takamatsu, Atsuko

2011-07-01

Growth processes of a planar biological network of plasmodium of a true slime mold, Physarum polycephalum, were analyzed quantitatively. The plasmodium forms a transportation network through which protoplasm conveys nutrients, oxygen, and cellular organelles similarly to blood in a mammalian vascular network. To analyze the network structure, vertices were defined at tube bifurcation points. Then edges were defined for the tubes connecting both end vertices. Morphological analysis was attempted along with conventional topological analysis, revealing that the growth process of the plasmodial network structure depends on environmental conditions. In an attractive condition, the network is a polygonal lattice with more than six edges per vertex at the early stage and the hexagonal lattice at a later stage. Through all growing stages, the tube structure was not highly developed but an unstructured protoplasmic thin sheet was dominantly formed. The network size is small. In contrast, in the repulsive condition, the network is a mixture of polygonal lattice and tree-graph. More specifically, the polygonal lattice has more than six edges per vertex in the early stage, then a tree-graph structure is added to the lattice network at a later stage. The thick tube structure was highly developed. The network size, in the meaning of Euclidean distance but not topological one, grows considerably. Finally, the biological meaning of the environment-dependent network structure in the plasmodium is discussed.

Multiple cortical thickness sub-networks and cognitive impairments in first episode, drug naïve patients with late life depression: A graph theory analysis.

PubMed

Shin, Jeong-Hyeon; Um, Yu Hyun; Lee, Chang Uk; Lim, Hyun Kook; Seong, Joon-Kyung

2018-03-15

Coordinated and pattern-wise changes in large scale gray matter structural networks reflect neural circuitry dysfunction in late life depression (LLD), which in turn is associated with emotional dysregulation and cognitive impairments. However, due to methodological limitations, there have been few attempts made to identify individual-level structural network properties or sub-networks that are involved in important brain functions in LLD. In this study, we sought to construct individual-level gray matter structural networks using average cortical thicknesses of several brain areas to investigate the characteristics of the gray matter structural networks in normal controls and LLD patients. Additionally, we investigated the structural sub-networks correlated with several clinical measurements including cognitive impairment and depression severity. We observed that small worldness, clustering coefficients, global and local efficiency, and hub structures in the brains of LLD patients were significantly different from healthy controls. We further found that a sub-network including the anterior cingulate, dorsolateral prefrontal cortex and superior prefrontal cortex is significantly associated with attention control and executive function. The severity of depression was associated with the sub-networks comprising the salience network, including the anterior cingulate and insula. We investigated cortico-cortical connectivity, but omitted the subcortical structures such as the striatum and thalamus. We report differences in patterns between several clinical measurements and sub-networks from large-scale and individual-level cortical thickness networks in LLD. Copyright © 2018 Elsevier B.V. All rights reserved.

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses.

PubMed

Ocker, Gabriel Koch; Litwin-Kumar, Ashok; Doiron, Brent

2015-08-01

The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure.

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses

PubMed Central

Ocker, Gabriel Koch; Litwin-Kumar, Ashok; Doiron, Brent

2015-01-01

The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure. PMID:26291697

Interorganizational relationships within state tobacco control networks: a social network analysis.

PubMed

Krauss, Melissa; Mueller, Nancy; Luke, Douglas

2004-10-01

State tobacco control programs are implemented by networks of public and private agencies with a common goal to reduce tobacco use. The degree of a program's comprehensiveness depends on the scope of its activities and the variety of agencies involved in the network. Structural aspects of these networks could help describe the process of implementing a state's tobacco control program, but have not yet been examined. Social network analysis was used to examine the structure of five state tobacco control networks. Semi-structured interviews with key agencies collected quantitative and qualitative data on frequency of contact among network partners, money flow, relationship productivity, level of network effectiveness, and methods for improvement. Most states had hierarchical communication structures in which partner agencies had frequent contact with one or two central agencies. Lead agencies had the highest control over network communication. Networks with denser communication structures had denser productivity structures. Lead agencies had the highest financial influence within the networks, while statewide coalitions were financially influenced by others. Lead agencies had highly productive relationships with others, while agencies with narrow roles had fewer productive relationships. Statewide coalitions that received Robert Wood Johnson Foundation funding had more highly productive relationships than coalitions that did not receive the funding. Results suggest that frequent communication among network partners is related to more highly productive relationships. Results also highlight the importance of lead agencies and statewide coalitions in implementing a comprehensive state tobacco control program. Network analysis could be useful in developing process indicators for state tobacco control programs.

Temporal changes in the structure of a plant-frugivore network are influenced by bird migration and fruit availability

PubMed Central

Andresen, Ellen; Díaz-Castelazo, Cecilia

2016-01-01

Background. Ecological communities are dynamic collections whose composition and structure change over time, making up complex interspecific interaction networks. Mutualistic plant–animal networks can be approached through complex network analysis; these networks are characterized by a nested structure consisting of a core of generalist species, which endows the network with stability and robustness against disturbance. Those mutualistic network structures can vary as a consequence of seasonal fluctuations and food availability, as well as the arrival of new species into the system that might disorder the mutualistic network structure (e.g., a decrease in nested pattern). However, there is no assessment on how the arrival of migratory species into seasonal tropical systems can modify such patterns. Emergent and fine structural temporal patterns are adressed here for the first time for plant-frugivorous bird networks in a highly seasonal tropical environment. Methods. In a plant-frugivorous bird community, we analyzed the temporal turnover of bird species comprising the network core and periphery of ten temporal interaction networks resulting from different bird migration periods. Additionally, we evaluated how fruit abundance and richness, as well as the arrival of migratory birds into the system, explained the temporal changes in network parameters such as network size, connectance, nestedness, specialization, interaction strength asymmetry and niche overlap. The analysis included data from 10 quantitative plant-frugivorous bird networks registered from November 2013 to November 2014. Results. We registered a total of 319 interactions between 42 plant species and 44 frugivorous bird species; only ten bird species were part of the network core. We witnessed a noteworthy turnover of the species comprising the network periphery during migration periods, as opposed to the network core, which did not show significant temporal changes in species composition. Our results revealed that migration and fruit richness explain the temporal variations in network size, connectance, nestedness and interaction strength asymmetry. On the other hand, fruit abundance only explained connectance and nestedness. Discussion. By means of a fine-resolution temporal analysis, we evidenced for the first time how temporal changes in the interaction network structure respond to the arrival of migratory species into the system and to fruit availability. Additionally, few migratory bird species are important links for structuring networks, while most of them were peripheral species. We showed the relevance of studying bird–plant interactions at fine temporal scales, considering changing scenarios of species composition with a quantitative network approach. PMID:27330852

Adaptive dynamical networks

NASA Astrophysics Data System (ADS)

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.

The relevance of network micro-structure for neural dynamics.

PubMed

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

2013-01-01

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

Wild cricket social networks show stability across generations.

PubMed

Fisher, David N; Rodríguez-Muñoz, Rolando; Tregenza, Tom

2016-07-27

A central part of an animal's environment is its interactions with conspecifics. There has been growing interest in the potential to capture these interactions in the form of a social network. Such networks can then be used to examine how relationships among individuals affect ecological and evolutionary processes. However, in the context of selection and evolution, the utility of this approach relies on social network structures persisting across generations. This is an assumption that has been difficult to test because networks spanning multiple generations have not been available. We constructed social networks for six annual generations over a period of eight years for a wild population of the cricket Gryllus campestris. Through the use of exponential random graph models (ERGMs), we found that the networks in any given year were able to predict the structure of networks in other years for some network characteristics. The capacity of a network model of any given year to predict the networks of other years did not depend on how far apart those other years were in time. Instead, the capacity of a network model to predict the structure of a network in another year depended on the similarity in population size between those years. Our results indicate that cricket social network structure resists the turnover of individuals and is stable across generations. This would allow evolutionary processes that rely on network structure to take place. The influence of network size may indicate that scaling up findings on social behaviour from small populations to larger ones will be difficult. Our study also illustrates the utility of ERGMs for comparing networks, a task for which an effective approach has been elusive.

Structural analysis of behavioral networks from the Internet

NASA Astrophysics Data System (ADS)

Meiss, M. R.; Menczer, F.; Vespignani, A.

2008-06-01

In spite of the Internet's phenomenal growth and social impact, many aspects of the collective communication behavior of its users are largely unknown. Understanding the structure and dynamics of the behavioral networks that connect users with each other and with services across the Internet is key to modeling the network and designing future applications. We present a characterization of the properties of the behavioral networks generated by several million users of the Abilene (Internet2) network. Structural features of these networks offer new insights into scaling properties of network activity and ways of distinguishing particular patterns of traffic. For example, we find that the structure of the behavioral network associated with Web activity is characterized by such extreme heterogeneity as to challenge any simple attempt to model Web server traffic.

Topological relationships between brain and social networks.

PubMed

Sakata, Shuzo; Yamamori, Tetsuo

2007-01-01

Brains are complex networks. Previously, we revealed that specific connected structures are either significantly abundant or rare in cortical networks. However, it remains unknown whether systems from other disciplines have similar architectures to brains. By applying network-theoretical methods, here we show topological similarities between brain and social networks. We found that the statistical relevance of specific tied structures differs between social "friendship" and "disliking" networks, suggesting relation-type-specific topology of social networks. Surprisingly, overrepresented connected structures in brain networks are more similar to those in the friendship networks than to those in other networks. We found that balanced and imbalanced reciprocal connections between nodes are significantly abundant and rare, respectively, whereas these results are unpredictable by simply counting mutual connections. We interpret these results as evidence of positive selection of balanced mutuality between nodes. These results also imply the existence of underlying common principles behind the organization of brain and social networks.

Robust Learning of High-dimensional Biological Networks with Bayesian Networks

NASA Astrophysics Data System (ADS)

Nägele, Andreas; Dejori, Mathäus; Stetter, Martin

Structure learning of Bayesian networks applied to gene expression data has become a potentially useful method to estimate interactions between genes. However, the NP-hardness of Bayesian network structure learning renders the reconstruction of the full genetic network with thousands of genes unfeasible. Consequently, the maximal network size is usually restricted dramatically to a small set of genes (corresponding with variables in the Bayesian network). Although this feature reduction step makes structure learning computationally tractable, on the downside, the learned structure might be adversely affected due to the introduction of missing genes. Additionally, gene expression data are usually very sparse with respect to the number of samples, i.e., the number of genes is much greater than the number of different observations. Given these problems, learning robust network features from microarray data is a challenging task. This chapter presents several approaches tackling the robustness issue in order to obtain a more reliable estimation of learned network features.

Network Structure and the Risk for HIV Transmission Among Rural Drug Users

PubMed Central

Young, A. M.; Jonas, A. B.; Mullins, U. L.; Halgin, D. S.

2012-01-01

Research suggests that structural properties of drug users’ social networks can have substantial effects on HIV risk. The purpose of this study was to investigate if the structural properties of Appalachian drug users’ risk networks could lend insight into the potential for HIV transmission in this population. Data from 503 drug users recruited through respondent-driven sampling were used to construct a sociometric risk network. Network ties represented relationships in which partners had engaged in unprotected sex and/or shared injection equipment. Compared to 1,000 randomly generated networks, the observed network was found to have a larger main component and exhibit more cohesiveness and centralization than would be expected at random. Thus, the risk network structure in this sample has many structural characteristics shown to be facilitative of HIV transmission. This underscores the importance of primary prevention in this population and prompts further investigation into the epidemiology of HIV in the region. PMID:23184464

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

PubMed Central

Jin, Lei; Wang, Haizhong; Yu, Le; Liu, Lin

2017-01-01

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. PMID:29176832

Bayesian Network Webserver: a comprehensive tool for biological network modeling.

PubMed

Ziebarth, Jesse D; Bhattacharya, Anindya; Cui, Yan

2013-11-01

The Bayesian Network Webserver (BNW) is a platform for comprehensive network modeling of systems genetics and other biological datasets. It allows users to quickly and seamlessly upload a dataset, learn the structure of the network model that best explains the data and use the model to understand relationships between network variables. Many datasets, including those used to create genetic network models, contain both discrete (e.g. genotype) and continuous (e.g. gene expression traits) variables, and BNW allows for modeling hybrid datasets. Users of BNW can incorporate prior knowledge during structure learning through an easy-to-use structural constraint interface. After structure learning, users are immediately presented with an interactive network model, which can be used to make testable hypotheses about network relationships. BNW, including a downloadable structure learning package, is available at http://compbio.uthsc.edu/BNW. (The BNW interface for adding structural constraints uses HTML5 features that are not supported by current version of Internet Explorer. We suggest using other browsers (e.g. Google Chrome or Mozilla Firefox) when accessing BNW). ycui2@uthsc.edu. Supplementary data are available at Bioinformatics online.

Resolution of Singularities Introduced by Hierarchical Structure in Deep Neural Networks.

PubMed

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

A novel community detection method in bipartite networks

NASA Astrophysics Data System (ADS)

Zhou, Cangqi; Feng, Liang; Zhao, Qianchuan

2018-02-01

Community structure is a common and important feature in many complex networks, including bipartite networks, which are used as a standard model for many empirical networks comprised of two types of nodes. In this paper, we propose a two-stage method for detecting community structure in bipartite networks. Firstly, we extend the widely-used Louvain algorithm to bipartite networks. The effectiveness and efficiency of the Louvain algorithm have been proved by many applications. However, there lacks a Louvain-like algorithm specially modified for bipartite networks. Based on bipartite modularity, a measure that extends unipartite modularity and that quantifies the strength of partitions in bipartite networks, we fill the gap by developing the Bi-Louvain algorithm that iteratively groups the nodes in each part by turns. This algorithm in bipartite networks often produces a balanced network structure with equal numbers of two types of nodes. Secondly, for the balanced network yielded by the first algorithm, we use an agglomerative clustering method to further cluster the network. We demonstrate that the calculation of the gain of modularity of each aggregation, and the operation of joining two communities can be compactly calculated by matrix operations for all pairs of communities simultaneously. At last, a complete hierarchical community structure is unfolded. We apply our method to two benchmark data sets and a large-scale data set from an e-commerce company, showing that it effectively identifies community structure in bipartite networks.

Hierarchical classification with a competitive evolutionary neural tree.

PubMed

Adams, R G.; Butchart, K; Davey, N

1999-04-01

A new, dynamic, tree structured network, the Competitive Evolutionary Neural Tree (CENT) is introduced. The network is able to provide a hierarchical classification of unlabelled data sets. The main advantage that the CENT offers over other hierarchical competitive networks is its ability to self determine the number, and structure, of the competitive nodes in the network, without the need for externally set parameters. The network produces stable classificatory structures by halting its growth using locally calculated heuristics. The results of network simulations are presented over a range of data sets, including Anderson's IRIS data set. The CENT network demonstrates its ability to produce a representative hierarchical structure to classify a broad range of data sets.

Disrupted Structural and Functional Networks and Their Correlation with Alertness in Right Temporal Lobe Epilepsy: A Graph Theory Study.

PubMed

Jiang, Wenyu; Li, Jianping; Chen, Xuemei; Ye, Wei; Zheng, Jinou

2017-01-01

Previous studies have shown that temporal lobe epilepsy (TLE) involves abnormal structural or functional connectivity in specific brain areas. However, limited comprehensive studies have been conducted on TLE associated changes in the topological organization of structural and functional networks. Additionally, epilepsy is associated with impairment in alertness, a fundamental component of attention. In this study, structural networks were constructed using diffusion tensor imaging tractography, and functional networks were obtained from resting-state functional MRI temporal series correlations in 20 right temporal lobe epilepsy (rTLE) patients and 19 healthy controls. Global network properties were computed by graph theoretical analysis, and correlations were assessed between global network properties and alertness. The results from these analyses showed that rTLE patients exhibit abnormal small-world attributes in structural and functional networks. Structural networks shifted toward more regular attributes, but functional networks trended toward more random attributes. After controlling for the influence of the disease duration, negative correlations were found between alertness, small-worldness, and the cluster coefficient. However, alertness did not correlate with either the characteristic path length or global efficiency in rTLE patients. Our findings show that disruptions of the topological construction of brain structural and functional networks as well as small-world property bias are associated with deficits in alertness in rTLE patients. These data suggest that reorganization of brain networks develops as a mechanism to compensate for altered structural and functional brain function during disease progression.

Reconstruction of network topology using status-time-series data

NASA Astrophysics Data System (ADS)

Pandey, Pradumn Kumar; Badarla, Venkataramana

2018-01-01

Uncovering the heterogeneous connection pattern of a networked system from the available status-time-series (STS) data of a dynamical process on the network is of great interest in network science and known as a reverse engineering problem. Dynamical processes on a network are affected by the structure of the network. The dependency between the diffusion dynamics and structure of the network can be utilized to retrieve the connection pattern from the diffusion data. Information of the network structure can help to devise the control of dynamics on the network. In this paper, we consider the problem of network reconstruction from the available status-time-series (STS) data using matrix analysis. The proposed method of network reconstruction from the STS data is tested successfully under susceptible-infected-susceptible (SIS) diffusion dynamics on real-world and computer-generated benchmark networks. High accuracy and efficiency of the proposed reconstruction procedure from the status-time-series data define the novelty of the method. Our proposed method outperforms compressed sensing theory (CST) based method of network reconstruction using STS data. Further, the same procedure of network reconstruction is applied to the weighted networks. The ordering of the edges in the weighted networks is identified with high accuracy.

A new method for constructing networks from binary data

NASA Astrophysics Data System (ADS)

van Borkulo, Claudia D.; Borsboom, Denny; Epskamp, Sacha; Blanken, Tessa F.; Boschloo, Lynn; Schoevers, Robert A.; Waldorp, Lourens J.

2014-08-01

Network analysis is entering fields where network structures are unknown, such as psychology and the educational sciences. A crucial step in the application of network models lies in the assessment of network structure. Current methods either have serious drawbacks or are only suitable for Gaussian data. In the present paper, we present a method for assessing network structures from binary data. Although models for binary data are infamous for their computational intractability, we present a computationally efficient model for estimating network structures. The approach, which is based on Ising models as used in physics, combines logistic regression with model selection based on a Goodness-of-Fit measure to identify relevant relationships between variables that define connections in a network. A validation study shows that this method succeeds in revealing the most relevant features of a network for realistic sample sizes. We apply our proposed method to estimate the network of depression and anxiety symptoms from symptom scores of 1108 subjects. Possible extensions of the model are discussed.

Comparison analysis on vulnerability of metro networks based on complex network

NASA Astrophysics Data System (ADS)

Zhang, Jianhua; Wang, Shuliang; Wang, Xiaoyuan

2018-04-01

This paper analyzes the networked characteristics of three metro networks, and two malicious attacks are employed to investigate the vulnerability of metro networks based on connectivity vulnerability and functionality vulnerability. Meanwhile, the networked characteristics and vulnerability of three metro networks are compared with each other. The results show that Shanghai metro network has the largest transport capacity, Beijing metro network has the best local connectivity and Guangzhou metro network has the best global connectivity, moreover Beijing metro network has the best homogeneous degree distribution. Furthermore, we find that metro networks are very vulnerable subjected to malicious attacks, and Guangzhou metro network has the best topological structure and reliability among three metro networks. The results indicate that the proposed methodology is feasible and effective to investigate the vulnerability and to explore better topological structure of metro networks.

Exact coupling threshold for structural transition reveals diversified behaviors in interconnected networks.

PubMed

Darabi Sahneh, Faryad; Scoglio, Caterina; Van Mieghem, Piet

2015-10-01

An interconnected network features a structural transition between two regimes [F. Radicchi and A. Arenas, Nat. Phys. 9, 717 (2013)]: one where the network components are structurally distinguishable and one where the interconnected network functions as a whole. Our exact solution for the coupling threshold uncovers network topologies with unexpected behaviors. Specifically, we show conditions that superdiffusion, introduced by Gómez et al. [Phys. Rev. Lett. 110, 028701 (2013)], can occur despite the network components functioning distinctly. Moreover, we find that components of certain interconnected network topologies are indistinguishable despite very weak coupling between them.

Temporal variation in bat-fruit interactions: Foraging strategies influence network structure over time

NASA Astrophysics Data System (ADS)

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.

Spatial networks

NASA Astrophysics Data System (ADS)

Barthélemy, Marc

2011-02-01

Complex systems are very often organized under the form of networks where nodes and edges are embedded in space. Transportation and mobility networks, Internet, mobile phone networks, power grids, social and contact networks, and neural networks, are all examples where space is relevant and where topology alone does not contain all the information. Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields, ranging from urbanism to epidemiology. An important consequence of space on networks is that there is a cost associated with the length of edges which in turn has dramatic effects on the topological structure of these networks. We will thoroughly explain the current state of our understanding of how the spatial constraints affect the structure and properties of these networks. We will review the most recent empirical observations and the most important models of spatial networks. We will also discuss various processes which take place on these spatial networks, such as phase transitions, random walks, synchronization, navigation, resilience, and disease spread.

Entropy of network ensembles

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra

2009-03-01

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

The effect of excluding juveniles on apparent adult olive baboons (Papio anubis) social networks

PubMed Central

Fedurek, Piotr; Lehmann, Julia

2017-01-01

In recent years there has been much interest in investigating the social structure of group living animals using social network analysis. Many studies so far have focused on the social networks of adults, often excluding younger, immature group members. This potentially may lead to a biased view of group social structure as multiple recent studies have shown that younger group members can significantly contribute to group structure. As proof of the concept, we address this issue by investigating social network structure with and without juveniles in wild olive baboons (Papio anubis) at Gashaka Gumti National Park, Nigeria. Two social networks including all independently moving individuals (i.e., excluding dependent juveniles) were created based on aggressive and grooming behaviour. We used knockout simulations based on the random removal of individuals from the network in order to investigate to what extent the exclusion of juveniles affects the resulting network structure and our interpretation of age-sex specific social roles. We found that juvenile social patterns differed from those of adults and that the exclusion of juveniles from the network significantly altered the resulting overall network structure. Moreover, the removal of juveniles from the network affected individuals in specific age-sex classes differently: for example, including juveniles in the grooming network increased network centrality of adult females while decreasing centrality of adult males. These results suggest that excluding juveniles from the analysis may not only result in a distorted picture of the overall social structure but also may mask some of the social roles of individuals belonging to different age-sex classes. PMID:28323851

The effect of excluding juveniles on apparent adult olive baboons (Papio anubis) social networks.

PubMed

Fedurek, Piotr; Lehmann, Julia

2017-01-01

In recent years there has been much interest in investigating the social structure of group living animals using social network analysis. Many studies so far have focused on the social networks of adults, often excluding younger, immature group members. This potentially may lead to a biased view of group social structure as multiple recent studies have shown that younger group members can significantly contribute to group structure. As proof of the concept, we address this issue by investigating social network structure with and without juveniles in wild olive baboons (Papio anubis) at Gashaka Gumti National Park, Nigeria. Two social networks including all independently moving individuals (i.e., excluding dependent juveniles) were created based on aggressive and grooming behaviour. We used knockout simulations based on the random removal of individuals from the network in order to investigate to what extent the exclusion of juveniles affects the resulting network structure and our interpretation of age-sex specific social roles. We found that juvenile social patterns differed from those of adults and that the exclusion of juveniles from the network significantly altered the resulting overall network structure. Moreover, the removal of juveniles from the network affected individuals in specific age-sex classes differently: for example, including juveniles in the grooming network increased network centrality of adult females while decreasing centrality of adult males. These results suggest that excluding juveniles from the analysis may not only result in a distorted picture of the overall social structure but also may mask some of the social roles of individuals belonging to different age-sex classes.

A new hierarchical method to find community structure in networks

NASA Astrophysics Data System (ADS)

Saoud, Bilal; Moussaoui, Abdelouahab

2018-04-01

Community structure is very important to understand a network which represents a context. Many community detection methods have been proposed like hierarchical methods. In our study, we propose a new hierarchical method for community detection in networks based on genetic algorithm. In this method we use genetic algorithm to split a network into two networks which maximize the modularity. Each new network represents a cluster (community). Then we repeat the splitting process until we get one node at each cluster. We use the modularity function to measure the strength of the community structure found by our method, which gives us an objective metric for choosing the number of communities into which a network should be divided. We demonstrate that our method are highly effective at discovering community structure in both computer-generated and real-world network data.

Teaching Structured Design of Network Algorithms in Enhanced Versions of SQL

ERIC Educational Resources Information Center

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…

Contagion processes on the static and activity-driven coupling networks

NASA Astrophysics Data System (ADS)

Lei, Yanjun; Jiang, Xin; Guo, Quantong; Ma, Yifang; Li, Meng; Zheng, Zhiming

2016-03-01

The evolution of network structure and the spreading of epidemic are common coexistent dynamical processes. In most cases, network structure is treated as either static or time-varying, supposing the whole network is observed in the same time window. In this paper, we consider the epidemics spreading on a network which has both static and time-varying structures. Meanwhile, the time-varying part and the epidemic spreading are supposed to be of the same time scale. We introduce a static and activity-driven coupling (SADC) network model to characterize the coupling between the static ("strong") structure and the dynamic ("weak") structure. Epidemic thresholds of the SIS and SIR models are studied using the SADC model both analytically and numerically under various coupling strategies, where the strong structure is of homogeneous or heterogeneous degree distribution. Theoretical thresholds obtained from the SADC model can both recover and generalize the classical results in static and time-varying networks. It is demonstrated that a weak structure might make the epidemic threshold low in homogeneous networks but high in heterogeneous cases. Furthermore, we show that the weak structure has a substantive effect on the outbreak of the epidemics. This result might be useful in designing some efficient control strategies for epidemics spreading in networks.

Network-Level Structure-Function Relationships in Human Neocortex

PubMed Central

Mišić, Bratislav; Betzel, Richard F.; de Reus, Marcel A.; van den Heuvel, Martijn P.; Berman, Marc G.; McIntosh, Anthony R.; Sporns, Olaf

2016-01-01

The dynamics of spontaneous fluctuations in neural activity are shaped by underlying patterns of anatomical connectivity. While numerous studies have demonstrated edge-wise correspondence between structural and functional connections, much less is known about how large-scale coherent functional network patterns emerge from the topology of structural networks. In the present study, we deploy a multivariate statistical technique, partial least squares, to investigate the association between spatially extended structural networks and functional networks. We find multiple statistically robust patterns, reflecting reliable combinations of structural and functional subnetworks that are optimally associated with one another. Importantly, these patterns generally do not show a one-to-one correspondence between structural and functional edges, but are instead distributed and heterogeneous, with many functional relationships arising from nonoverlapping sets of anatomical connections. We also find that structural connections between high-degree hubs are disproportionately represented, suggesting that these connections are particularly important in establishing coherent functional networks. Altogether, these results demonstrate that the network organization of the cerebral cortex supports the emergence of diverse functional network configurations that often diverge from the underlying anatomical substrate. PMID:27102654

Association of Structural Global Brain Network Properties with Intelligence in Normal Aging

PubMed Central

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. PMID:24465994

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

NASA Astrophysics Data System (ADS)

Franke, R.

2016-11-01

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

Multi-frequency complex network from time series for uncovering oil-water flow structure.

PubMed

Gao, Zhong-Ke; Yang, Yu-Xuan; Fang, Peng-Cheng; Jin, Ning-De; Xia, Cheng-Yi; Hu, Li-Dan

2015-02-04

Uncovering complex oil-water flow structure represents a challenge in diverse scientific disciplines. This challenge stimulates us to develop a new distributed conductance sensor for measuring local flow signals at different positions and then propose a novel approach based on multi-frequency complex network to uncover the flow structures from experimental multivariate measurements. In particular, based on the Fast Fourier transform, we demonstrate how to derive multi-frequency complex network from multivariate time series. We construct complex networks at different frequencies and then detect community structures. Our results indicate that the community structures faithfully represent the structural features of oil-water flow patterns. Furthermore, we investigate the network statistic at different frequencies for each derived network and find that the frequency clustering coefficient enables to uncover the evolution of flow patterns and yield deep insights into the formation of flow structures. Current results present a first step towards a network visualization of complex flow patterns from a community structure perspective.

Deformable complex network for refining low-resolution X-ray structures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Chong; Wang, Qinghua; Ma, Jianpeng, E-mail: jpma@bcm.edu

2015-10-27

A new refinement algorithm called the deformable complex network that combines a novel angular network-based restraint with a deformable elastic network model in the target function has been developed to aid in structural refinement in macromolecular X-ray crystallography. In macromolecular X-ray crystallography, building more accurate atomic models based on lower resolution experimental diffraction data remains a great challenge. Previous studies have used a deformable elastic network (DEN) model to aid in low-resolution structural refinement. In this study, the development of a new refinement algorithm called the deformable complex network (DCN) is reported that combines a novel angular network-based restraint withmore » the DEN model in the target function. Testing of DCN on a wide range of low-resolution structures demonstrated that it constantly leads to significantly improved structural models as judged by multiple refinement criteria, thus representing a new effective refinement tool for low-resolution structural determination.« less

Community detection for networks with unipartite and bipartite structure

NASA Astrophysics Data System (ADS)

Chang, Chang; Tang, Chao

2014-09-01

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

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

PubMed Central

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. PMID:28373567

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

USGS Publications Warehouse

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.

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

PubMed

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.

Bridging: Locating Critical Connectors in a Network

PubMed Central

Valente, Thomas W.; Fujimoto, Kayo

2010-01-01

This paper proposes several measures for bridging in networks derived from Granovetter's (1973) insight that links which reduce distances in a network are important structural bridges. Bridging is calculated by systematically deleting links and calculating the resultant changes in network cohesion (measured as the inverse average path length). The average change for each node's links provides an individual level measure of bridging. We also present a normalized version which controls for network size and a network level bridging index. Bridging properties are demonstrated on hypothetical networks, empirical networks, and a set of 100 randomly generated networks to show how the bridging measure correlates with existing network measures such as degree, personal network density, constraint, closeness centrality, betweenness centrality, and vitality. Bridging and the accompanying methodology provide a family of new network measures useful for studying network structure, network dynamics, and network effects on substantive behavioral phenomenon. PMID:20582157

Simulating synchronization in neuronal networks

NASA Astrophysics Data System (ADS)

Fink, Christian G.

2016-06-01

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

Neurodevelopmental alterations of large-scale structural networks in children with new-onset epilepsy

PubMed Central

Bonilha, Leonardo; Tabesh, Ali; Dabbs, Kevin; Hsu, David A.; Stafstrom, Carl E.; Hermann, Bruce P.; Lin, Jack J.

2014-01-01

Recent neuroimaging and behavioral studies have revealed that children with new onset epilepsy already exhibit brain structural abnormalities and cognitive impairment. How the organization of large-scale brain structural networks is altered near the time of seizure onset and whether network changes are related to cognitive performances remain unclear. Recent studies also suggest that regional brain volume covariance reflects synchronized brain developmental changes. Here, we test the hypothesis that epilepsy during early-life is associated with abnormalities in brain network organization and cognition. We used graph theory to study structural brain networks based on regional volume covariance in 39 children with new-onset seizures and 28 healthy controls. Children with new-onset epilepsy showed a suboptimal topological structural organization with enhanced network segregation and reduced global integration compared to controls. At the regional level, structural reorganization was evident with redistributed nodes from the posterior to more anterior head regions. The epileptic brain network was more vulnerable to targeted but not random attacks. Finally, a subgroup of children with epilepsy, namely those with lower IQ and poorer executive function, had a reduced balance between network segregation and integration. Taken together, the findings suggest that the neurodevelopmental impact of new onset childhood epilepsies alters large-scale brain networks, resulting in greater vulnerability to network failure and cognitive impairment. PMID:24453089

An artificial network model for estimating the network structure underlying partially observed neuronal signals.

PubMed

Komatsu, Misako; Namikawa, Jun; Chao, Zenas C; Nagasaka, Yasuo; Fujii, Naotaka; Nakamura, Kiyohiko; Tani, Jun

2014-01-01

Many previous studies have proposed methods for quantifying neuronal interactions. However, these methods evaluated the interactions between recorded signals in an isolated network. In this study, we present a novel approach for estimating interactions between observed neuronal signals by theorizing that those signals are observed from only a part of the network that also includes unobserved structures. We propose a variant of the recurrent network model that consists of both observable and unobservable units. The observable units represent recorded neuronal activity, and the unobservable units are introduced to represent activity from unobserved structures in the network. The network structures are characterized by connective weights, i.e., the interaction intensities between individual units, which are estimated from recorded signals. We applied this model to multi-channel brain signals recorded from monkeys, and obtained robust network structures with physiological relevance. Furthermore, the network exhibited common features that portrayed cortical dynamics as inversely correlated interactions between excitatory and inhibitory populations of neurons, which are consistent with the previous view of cortical local circuits. Our results suggest that the novel concept of incorporating an unobserved structure into network estimations has theoretical advantages and could provide insights into brain dynamics beyond what can be directly observed. Copyright © 2014 Elsevier Ireland Ltd and the Japan Neuroscience Society. All rights reserved.

Structure and inference in annotated networks

PubMed Central

Newman, M. E. J.; Clauset, Aaron

2016-01-01

For many networks of scientific interest we know both the connections of the network and information about the network nodes, such as the age or gender of individuals in a social network. Here we demonstrate how this ‘metadata' can be used to improve our understanding of network structure. We focus in particular on the problem of community detection in networks and develop a mathematically principled approach that combines a network and its metadata to detect communities more accurately than can be done with either alone. Crucially, the method does not assume that the metadata are correlated with the communities we are trying to find. Instead, the method learns whether a correlation exists and correctly uses or ignores the metadata depending on whether they contain useful information. We demonstrate our method on synthetic networks with known structure and on real-world networks, large and small, drawn from social, biological and technological domains. PMID:27306566

Structure and inference in annotated networks

NASA Astrophysics Data System (ADS)

Newman, M. E. J.; Clauset, Aaron

2016-06-01

For many networks of scientific interest we know both the connections of the network and information about the network nodes, such as the age or gender of individuals in a social network. Here we demonstrate how this `metadata' can be used to improve our understanding of network structure. We focus in particular on the problem of community detection in networks and develop a mathematically principled approach that combines a network and its metadata to detect communities more accurately than can be done with either alone. Crucially, the method does not assume that the metadata are correlated with the communities we are trying to find. Instead, the method learns whether a correlation exists and correctly uses or ignores the metadata depending on whether they contain useful information. We demonstrate our method on synthetic networks with known structure and on real-world networks, large and small, drawn from social, biological and technological domains.

Influence of cerebrovascular disease on brain networks in prodromal and clinical Alzheimer's disease.

PubMed

Chong, Joanna Su Xian; Liu, Siwei; Loke, Yng Miin; Hilal, Saima; Ikram, Mohammad Kamran; Xu, Xin; Tan, Boon Yeow; Venketasubramanian, Narayanaswamy; Chen, Christopher Li-Hsian; Zhou, Juan

2017-11-01

Network-sensitive neuroimaging methods have been used to characterize large-scale brain network degeneration in Alzheimer's disease and its prodrome. However, few studies have investigated the combined effect of Alzheimer's disease and cerebrovascular disease on brain network degeneration. Our study sought to examine the intrinsic functional connectivity and structural covariance network changes in 235 prodromal and clinical Alzheimer's disease patients with and without cerebrovascular disease. We focused particularly on two higher-order cognitive networks-the default mode network and the executive control network. We found divergent functional connectivity and structural covariance patterns in Alzheimer's disease patients with and without cerebrovascular disease. Alzheimer's disease patients without cerebrovascular disease, but not Alzheimer's disease patients with cerebrovascular disease, showed reductions in posterior default mode network functional connectivity. By comparison, while both groups exhibited parietal reductions in executive control network functional connectivity, only Alzheimer's disease patients with cerebrovascular disease showed increases in frontal executive control network connectivity. Importantly, these distinct executive control network changes were recapitulated in prodromal Alzheimer's disease patients with and without cerebrovascular disease. Across Alzheimer's disease patients with and without cerebrovascular disease, higher default mode network functional connectivity z-scores correlated with greater hippocampal volumes while higher executive control network functional connectivity z-scores correlated with greater white matter changes. In parallel, only Alzheimer's disease patients without cerebrovascular disease showed increased default mode network structural covariance, while only Alzheimer's disease patients with cerebrovascular disease showed increased executive control network structural covariance compared to controls. Our findings demonstrate the differential neural network structural and functional changes in Alzheimer's disease with and without cerebrovascular disease, suggesting that the underlying pathology of Alzheimer's disease patients with cerebrovascular disease might differ from those without cerebrovascular disease and reflect a combination of more severe cerebrovascular disease and less severe Alzheimer's disease network degeneration phenotype. © The Author (2017). Published by Oxford University Press on behalf of the Guarantors of Brain.

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule.

PubMed

Liu, Hui; Song, Yongduan; Xue, Fangzheng; Li, Xiumin

2015-11-01

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Hui; Song, Yongduan; Xue, Fangzheng

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than themore » SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.« less

Consensus between Pipelines in Structural Brain Networks

PubMed Central

Parker, Christopher S.; Deligianni, Fani; Cardoso, M. Jorge; Daga, Pankaj; Modat, Marc; Dayan, Michael; Clark, Chris A.

2014-01-01

Structural brain networks may be reconstructed from diffusion MRI tractography data and have great potential to further our understanding of the topological organisation of brain structure in health and disease. Network reconstruction is complex and involves a series of processesing methods including anatomical parcellation, registration, fiber orientation estimation and whole-brain fiber tractography. Methodological choices at each stage can affect the anatomical accuracy and graph theoretical properties of the reconstructed networks, meaning applying different combinations in a network reconstruction pipeline may produce substantially different networks. Furthermore, the choice of which connections are considered important is unclear. In this study, we assessed the similarity between structural networks obtained using two independent state-of-the-art reconstruction pipelines. We aimed to quantify network similarity and identify the core connections emerging most robustly in both pipelines. Similarity of network connections was compared between pipelines employing different atlases by merging parcels to a common and equivalent node scale. We found a high agreement between the networks across a range of fiber density thresholds. In addition, we identified a robust core of highly connected regions coinciding with a peak in similarity across network density thresholds, and replicated these results with atlases at different node scales. The binary network properties of these core connections were similar between pipelines but showed some differences in atlases across node scales. This study demonstrates the utility of applying multiple structural network reconstrution pipelines to diffusion data in order to identify the most important connections for further study. PMID:25356977

Control Centrality and Hierarchical Structure in Complex Networks

PubMed Central

Liu, Yang-Yu; Slotine, Jean-Jacques; Barabási, Albert-László

2012-01-01

We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly determined by the network’s degree distribution. We show that in a directed network without loops the control centrality of a node is uniquely determined by its layer index or topological position in the underlying hierarchical structure of the network. Inspired by the deep relation between control centrality and hierarchical structure in a general directed network, we design an efficient attack strategy against the controllability of malicious networks. PMID:23028542

Multisector Health Policy Networks in 15 Large US Cities.

PubMed

Harris, Jenine K; Leider, J P; Carothers, Bobbi J; Castrucci, Brian C; Hearne, Shelley

2016-01-01

Local health departments (LHDs) have historically not prioritized policy development, although it is one of the 3 core areas they address. One strategy that may influence policy in LHD jurisdictions is the formation of partnerships across sectors to work together on local public health policy. We used a network approach to examine LHD local health policy partnerships across 15 large cities from the Big Cities Health Coalition. We surveyed the health departments and their partners about their working relationships in 5 policy areas: core local funding, tobacco control, obesity and chronic disease, violence and injury prevention, and infant mortality. Drawing on prior literature linking network structures with performance, we examined network density, transitivity, centralization and centrality, member diversity, and assortativity of ties. Networks included an average of 21.8 organizations. Nonprofits and government agencies made up the largest proportions of the networks, with 28.8% and 21.7% of network members, whereas for-profits and foundations made up the smallest proportions in all of the networks, with just 1.2% and 2.4% on average. Mean values of density, transitivity, diversity, assortativity, centralization, and centrality showed similarity across policy areas and most LHDs. The tobacco control and obesity/chronic disease networks were densest and most diverse, whereas the infant mortality policy networks were the most centralized and had the highest assortativity. Core local funding policy networks had lower scores than other policy area networks by most network measures. Urban LHDs partner with organizations from diverse sectors to conduct local public health policy work. Network structures are similar across policy areas jurisdictions. Obesity and chronic disease, tobacco control, and infant mortality networks had structures consistent with higher performing networks, whereas core local funding networks had structures consistent with lower performing networks.

Synaptic Impairment and Robustness of Excitatory Neuronal Networks with Different Topologies

PubMed Central

Mirzakhalili, Ehsan; Gourgou, Eleni; Booth, Victoria; Epureanu, Bogdan

2017-01-01

Synaptic deficiencies are a known hallmark of neurodegenerative diseases, but the diagnosis of impaired synapses on the cellular level is not an easy task. Nonetheless, changes in the system-level dynamics of neuronal networks with damaged synapses can be detected using techniques that do not require high spatial resolution. This paper investigates how the structure/topology of neuronal networks influences their dynamics when they suffer from synaptic loss. We study different neuronal network structures/topologies by specifying their degree distributions. The modes of the degree distribution can be used to construct networks that consist of rich clubs and resemble small world networks, as well. We define two dynamical metrics to compare the activity of networks with different structures: persistent activity (namely, the self-sustained activity of the network upon removal of the initial stimulus) and quality of activity (namely, percentage of neurons that participate in the persistent activity of the network). Our results show that synaptic loss affects the persistent activity of networks with bimodal degree distributions less than it affects random networks. The robustness of neuronal networks enhances when the distance between the modes of the degree distribution increases, suggesting that the rich clubs of networks with distinct modes keep the whole network active. In addition, a tradeoff is observed between the quality of activity and the persistent activity. For a range of distributions, both of these dynamical metrics are considerably high for networks with bimodal degree distribution compared to random networks. We also propose three different scenarios of synaptic impairment, which may correspond to different pathological or biological conditions. Regardless of the network structure/topology, results demonstrate that synaptic loss has more severe effects on the activity of the network when impairments are correlated with the activity of the neurons. PMID:28659765

Multisector Health Policy Networks in 15 Large US Cities

PubMed Central

Leider, J. P.; Carothers, Bobbi J.; Castrucci, Brian C.; Hearne, Shelley

2016-01-01

Context: Local health departments (LHDs) have historically not prioritized policy development, although it is one of the 3 core areas they address. One strategy that may influence policy in LHD jurisdictions is the formation of partnerships across sectors to work together on local public health policy. Design: We used a network approach to examine LHD local health policy partnerships across 15 large cities from the Big Cities Health Coalition. Setting/Participants: We surveyed the health departments and their partners about their working relationships in 5 policy areas: core local funding, tobacco control, obesity and chronic disease, violence and injury prevention, and infant mortality. Outcome Measures: Drawing on prior literature linking network structures with performance, we examined network density, transitivity, centralization and centrality, member diversity, and assortativity of ties. Results: Networks included an average of 21.8 organizations. Nonprofits and government agencies made up the largest proportions of the networks, with 28.8% and 21.7% of network members, whereas for-profits and foundations made up the smallest proportions in all of the networks, with just 1.2% and 2.4% on average. Mean values of density, transitivity, diversity, assortativity, centralization, and centrality showed similarity across policy areas and most LHDs. The tobacco control and obesity/chronic disease networks were densest and most diverse, whereas the infant mortality policy networks were the most centralized and had the highest assortativity. Core local funding policy networks had lower scores than other policy area networks by most network measures. Conclusion: Urban LHDs partner with organizations from diverse sectors to conduct local public health policy work. Network structures are similar across policy areas jurisdictions. Obesity and chronic disease, tobacco control, and infant mortality networks had structures consistent with higher performing networks, whereas core local funding networks had structures consistent with lower performing networks. PMID:26910868

Information transfer in community structured multiplex networks

NASA Astrophysics Data System (ADS)

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.

Matching algorithm of missile tail flame based on back-propagation neural network

NASA Astrophysics Data System (ADS)

Huang, Da; Huang, Shucai; Tang, Yidong; Zhao, Wei; Cao, Wenhuan

2018-02-01

This work presents a spectral matching algorithm of missile plume detection that based on neural network. The radiation value of the characteristic spectrum of the missile tail flame is taken as the input of the network. The network's structure including the number of nodes and layers is determined according to the number of characteristic spectral bands and missile types. We can get the network weight matrixes and threshold vectors through training the network using training samples, and we can determine the performance of the network through testing the network using the test samples. A small amount of data cause the network has the advantages of simple structure and practicality. Network structure composed of weight matrix and threshold vector can complete task of spectrum matching without large database support. Network can achieve real-time requirements with a small quantity of data. Experiment results show that the algorithm has the ability to match the precise spectrum and strong robustness.

Implications of network structure on public health collaboratives.

PubMed

Retrum, Jessica H; Chapman, Carrie L; Varda, Danielle M

2013-10-01

Interorganizational collaboration is an essential function of public health agencies. These partnerships form social networks that involve diverse types of partners and varying levels of interaction. Such collaborations are widely accepted and encouraged, yet very little comparative research exists on how public health partnerships develop and evolve, specifically in terms of how subsequent network structures are linked to outcomes. A systems science approach, that is, one that considers the interdependencies and nested features of networks, provides the appropriate methods to examine the complex nature of these networks. Applying Mays and Scutchfields's categorization of "structural signatures" (breadth, density, and centralization), this research examines how network structure influences the outcomes of public health collaboratives. Secondary data from the Program to Analyze, Record, and Track Networks to Enhance Relationships (www.partnertool.net) data set are analyzed. This data set consists of dyadic (N = 12,355), organizational (N = 2,486), and whole network (N = 99) data from public health collaborations around the United States. Network data are used to calculate structural signatures and weighted least squares regression is used to examine how network structures can predict selected intermediary outcomes (resource contributions, overall value and trust rankings, and outcomes) in public health collaboratives. Our findings suggest that network structure may have an influence on collaborative-related outcomes. The structural signature that had the most significant relationship to outcomes was density, with higher density indicating more positive outcomes. Also significant was the finding that more breadth creates new challenges such as difficulty in reaching consensus and creating ties with other members. However, assumptions that these structural components lead to improved outcomes for public health collaboratives may be slightly premature. Implications of these findings for research and practice are discussed.

Structure-preserving model reduction of large-scale logistics networks. Applications for supply chains

NASA Astrophysics Data System (ADS)

Scholz-Reiter, B.; Wirth, F.; Dashkovskiy, S.; Makuschewitz, T.; Schönlein, M.; Kosmykov, M.

2011-12-01

We investigate the problem of model reduction with a view to large-scale logistics networks, specifically supply chains. Such networks are modeled by means of graphs, which describe the structure of material flow. An aim of the proposed model reduction procedure is to preserve important features within the network. As a new methodology we introduce the LogRank as a measure for the importance of locations, which is based on the structure of the flows within the network. We argue that these properties reflect relative importance of locations. Based on the LogRank we identify subgraphs of the network that can be neglected or aggregated. The effect of this is discussed for a few motifs. Using this approach we present a meta algorithm for structure-preserving model reduction that can be adapted to different mathematical modeling frameworks. The capabilities of the approach are demonstrated with a test case, where a logistics network is modeled as a Jackson network, i.e., a particular type of queueing network.

Testing the structure of earthquake networks from multivariate time series of successive main shocks in Greece

NASA Astrophysics Data System (ADS)

Chorozoglou, D.; Kugiumtzis, D.; Papadimitriou, E.

2018-06-01

The seismic hazard assessment in the area of Greece is attempted by studying the earthquake network structure, such as small-world and random. In this network, a node represents a seismic zone in the study area and a connection between two nodes is given by the correlation of the seismic activity of two zones. To investigate the network structure, and particularly the small-world property, the earthquake correlation network is compared with randomized ones. Simulations on multivariate time series of different length and number of variables show that for the construction of randomized networks the method randomizing the time series performs better than methods randomizing directly the original network connections. Based on the appropriate randomization method, the network approach is applied to time series of earthquakes that occurred between main shocks in the territory of Greece spanning the period 1999-2015. The characterization of networks on sliding time windows revealed that small-world structure emerges in the last time interval, shortly before the main shock.

Structure-function relationships during segregated and integrated network states of human brain functional connectivity.

PubMed

Fukushima, Makoto; Betzel, Richard F; He, Ye; van den Heuvel, Martijn P; Zuo, Xi-Nian; Sporns, Olaf

2018-04-01

Structural white matter connections are thought to facilitate integration of neural information across functionally segregated systems. Recent studies have demonstrated that changes in the balance between segregation and integration in brain networks can be tracked by time-resolved functional connectivity derived from resting-state functional magnetic resonance imaging (rs-fMRI) data and that fluctuations between segregated and integrated network states are related to human behavior. However, how these network states relate to structural connectivity is largely unknown. To obtain a better understanding of structural substrates for these network states, we investigated how the relationship between structural connectivity, derived from diffusion tractography, and functional connectivity, as measured by rs-fMRI, changes with fluctuations between segregated and integrated states in the human brain. We found that the similarity of edge weights between structural and functional connectivity was greater in the integrated state, especially at edges connecting the default mode and the dorsal attention networks. We also demonstrated that the similarity of network partitions, evaluated between structural and functional connectivity, increased and the density of direct structural connections within modules in functional networks was elevated during the integrated state. These results suggest that, when functional connectivity exhibited an integrated network topology, structural connectivity and functional connectivity were more closely linked to each other and direct structural connections mediated a larger proportion of neural communication within functional modules. Our findings point out the possibility of significant contributions of structural connections to integrative neural processes underlying human behavior.

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

PubMed

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

2015-03-01

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

Nonblocking Clos networks of multiple ROADM rings for mega data centers.

PubMed

Zhao, Li; Ye, Tong; Hu, Weisheng

2015-11-02

Optical networks have been introduced to meet the bandwidth requirement of mega data centers (DC). Most existing approaches are neither scalable to face the massive growth of DCs, nor contention-free enough to provide full bisection bandwidth. To solve this problem, we propose two symmetric network structures: ring-MEMS-ring (RMR) network and MEMS-ring-MEMS (MRM) network based on classical Clos theory. New strategies are introduced to overcome the additional wavelength constraints that did not exist in the traditional Clos network. Two structures that followed the strategies can enable high scalability and nonblocking property simultaneously. The one-to-one correspondence of the RMR and MRM structures to a Clos is verified and the nonblocking conditions are given along with the routing algorithms. Compared to a typical folded-Clos network, both structures are more readily scalable to future mega data centers with 51200 racks while reducing number of long cables significantly. We show that the MRM network is more cost-effective than the RMR network, since the MRM network does not need tunable lasers to achieve nonblocking routing.

Spontaneous scale-free structure in adaptive networks with synchronously dynamical linking

NASA Astrophysics Data System (ADS)

Yuan, Wu-Jie; Zhou, Jian-Fang; Li, Qun; Chen, De-Bao; Wang, Zhen

2013-08-01

Inspired by the anti-Hebbian learning rule in neural systems, we study how the feedback from dynamical synchronization shapes network structure by adding new links. Through extensive numerical simulations, we find that an adaptive network spontaneously forms scale-free structure, as confirmed in many real systems. Moreover, the adaptive process produces two nontrivial power-law behaviors of deviation strength from mean activity of the network and negative degree correlation, which exists widely in technological and biological networks. Importantly, these scalings are robust to variation of the adaptive network parameters, which may have meaningful implications in the scale-free formation and manipulation of dynamical networks. Our study thus suggests an alternative adaptive mechanism for the formation of scale-free structure with negative degree correlation, which means that nodes of high degree tend to connect, on average, with others of low degree and vice versa. The relevance of the results to structure formation and dynamical property in neural networks is briefly discussed as well.

Physics textbooks from the viewpoint of network structures

NASA Astrophysics Data System (ADS)

Králiková, Petra; Teleki, Aba

2017-01-01

We can observe self-organized networks all around us. These networks are, in general, scale invariant networks described by the Bianconi-Barabasi model. The self-organized networks (networks formed naturally when feedback acts on the system) show certain universality. These networks, in simplified models, have scale invariant distribution (Pareto distribution type I) and parameter α has value between 2 and 5. The textbooks are extremely important in the learning process and from this reason we studied physics textbook at the level of sentences and physics terms (bipartite network). The nodes represent physics terms, sentences, and pictures, tables, connected by links (by physics terms and transitional words and transitional phrases). We suppose that learning process are more robust and goes faster and easier if the physics textbook has a structure similar to structures of self-organized networks.

Surveying traffic congestion based on the concept of community structure of complex networks

NASA Astrophysics Data System (ADS)

Ma, Lili; Zhang, Zhanli; Li, Meng

2016-07-01

In this paper, taking the traffic of Beijing city as an instance, we study city traffic states, especially traffic congestion, based on the concept of network community structure. Concretely, using the floating car data (FCD) information of vehicles gained from the intelligent transport system (ITS) of the city, we construct a new traffic network model which is with floating cars as network nodes and time-varying. It shows that this traffic network has Gaussian degree distributions at different time points. Furthermore, compared with free traffic situations, our simulations show that the traffic network generally has more obvious community structures with larger values of network fitness for congested traffic situations, and through the GPSspg web page, we show that all of our results are consistent with the reality. Then, it indicates that network community structure should be an available way for investigating city traffic congestion problems.

Network structure from rich but noisy data

NASA Astrophysics Data System (ADS)

Newman, M. E. J.

2018-06-01

Driven by growing interest across the sciences, a large number of empirical studies have been conducted in recent years of the structure of networks ranging from the Internet and the World Wide Web to biological networks and social networks. The data produced by these experiments are often rich and multimodal, yet at the same time they may contain substantial measurement error1-7. Accurate analysis and understanding of networked systems requires a way of estimating the true structure of networks from such rich but noisy data8-15. Here we describe a technique that allows us to make optimal estimates of network structure from complex data in arbitrary formats, including cases where there may be measurements of many different types, repeated observations, contradictory observations, annotations or metadata, or missing data. We give example applications to two different social networks, one derived from face-to-face interactions and one from self-reported friendships.

The National Biomedical Communications Network as a Developing Structure *

PubMed Central

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

Exchanging Peers to Establish P2P Networks

NASA Astrophysics Data System (ADS)

Akon, Mursalin; Islam, Mohammad Towhidul; Shen, Xuemin(Sherman); Singh, Ajit

Structure-wise, P2P networks can be divided into two major categories: (1) structured and (2) unstructured. In this chapter, we survey a group of unstructured P2P networks. This group of networks employs a gossip or epidemic protocol to maintain the members of the network and during a gossip, peers exchange a subset of their neighbors with each other. It is reported that this kind of networks are scalable, robust and resilient to severe network failure, at the same time very inexpensive to operate.

Covariance, correlation matrix, and the multiscale community structure of networks.

PubMed

Shen, Hua-Wei; Cheng, Xue-Qi; Fang, Bin-Xing

2010-07-01

Empirical studies show that real world networks often exhibit multiple scales of topological descriptions. However, it is still an open problem how to identify the intrinsic multiple scales of networks. In this paper, we consider detecting the multiscale community structure of network from the perspective of dimension reduction. According to this perspective, a covariance matrix of network is defined to uncover the multiscale community structure through the translation and rotation transformations. It is proved that the covariance matrix is the unbiased version of the well-known modularity matrix. We then point out that the translation and rotation transformations fail to deal with the heterogeneous network, which is very common in nature and society. To address this problem, a correlation matrix is proposed through introducing the rescaling transformation into the covariance matrix. Extensive tests on real world and artificial networks demonstrate that the correlation matrix significantly outperforms the covariance matrix, identically the modularity matrix, as regards identifying the multiscale community structure of network. This work provides a novel perspective to the identification of community structure and thus various dimension reduction methods might be used for the identification of community structure. Through introducing the correlation matrix, we further conclude that the rescaling transformation is crucial to identify the multiscale community structure of network, as well as the translation and rotation transformations.

Community Detection Algorithm Combining Stochastic Block Model and Attribute Data Clustering

NASA Astrophysics Data System (ADS)

Kataoka, Shun; Kobayashi, Takuto; Yasuda, Muneki; Tanaka, Kazuyuki

2016-11-01

We propose a new algorithm to detect the community structure in a network that utilizes both the network structure and vertex attribute data. Suppose we have the network structure together with the vertex attribute data, that is, the information assigned to each vertex associated with the community to which it belongs. The problem addressed this paper is the detection of the community structure from the information of both the network structure and the vertex attribute data. Our approach is based on the Bayesian approach that models the posterior probability distribution of the community labels. The detection of the community structure in our method is achieved by using belief propagation and an EM algorithm. We numerically verified the performance of our method using computer-generated networks and real-world networks.

Biological network motif detection and evaluation

PubMed Central

2011-01-01

Background Molecular level of biological data can be constructed into system level of data as biological networks. Network motifs are defined as over-represented small connected subgraphs in networks and they have been used for many biological applications. Since network motif discovery involves computationally challenging processes, previous algorithms have focused on computational efficiency. However, we believe that the biological quality of network motifs is also very important. Results We define biological network motifs as biologically significant subgraphs and traditional network motifs are differentiated as structural network motifs in this paper. We develop five algorithms, namely, EDGEGO-BNM, EDGEBETWEENNESS-BNM, NMF-BNM, NMFGO-BNM and VOLTAGE-BNM, for efficient detection of biological network motifs, and introduce several evaluation measures including motifs included in complex, motifs included in functional module and GO term clustering score in this paper. Experimental results show that EDGEGO-BNM and EDGEBETWEENNESS-BNM perform better than existing algorithms and all of our algorithms are applicable to find structural network motifs as well. Conclusion We provide new approaches to finding network motifs in biological networks. Our algorithms efficiently detect biological network motifs and further improve existing algorithms to find high quality structural network motifs, which would be impossible using existing algorithms. The performances of the algorithms are compared based on our new evaluation measures in biological contexts. We believe that our work gives some guidelines of network motifs research for the biological networks. PMID:22784624

Influence of cerebrovascular disease on brain networks in prodromal and clinical Alzheimer’s disease

PubMed Central

Chong, Joanna Su Xian; Liu, Siwei; Loke, Yng Miin; Hilal, Saima; Ikram, Mohammad Kamran; Xu, Xin; Tan, Boon Yeow; Venketasubramanian, Narayanaswamy; Chen, Christopher Li-Hsian

2017-01-01

Abstract Network-sensitive neuroimaging methods have been used to characterize large-scale brain network degeneration in Alzheimer’s disease and its prodrome. However, few studies have investigated the combined effect of Alzheimer’s disease and cerebrovascular disease on brain network degeneration. Our study sought to examine the intrinsic functional connectivity and structural covariance network changes in 235 prodromal and clinical Alzheimer’s disease patients with and without cerebrovascular disease. We focused particularly on two higher-order cognitive networks—the default mode network and the executive control network. We found divergent functional connectivity and structural covariance patterns in Alzheimer’s disease patients with and without cerebrovascular disease. Alzheimer’s disease patients without cerebrovascular disease, but not Alzheimer’s disease patients with cerebrovascular disease, showed reductions in posterior default mode network functional connectivity. By comparison, while both groups exhibited parietal reductions in executive control network functional connectivity, only Alzheimer’s disease patients with cerebrovascular disease showed increases in frontal executive control network connectivity. Importantly, these distinct executive control network changes were recapitulated in prodromal Alzheimer’s disease patients with and without cerebrovascular disease. Across Alzheimer’s disease patients with and without cerebrovascular disease, higher default mode network functional connectivity z-scores correlated with greater hippocampal volumes while higher executive control network functional connectivity z-scores correlated with greater white matter changes. In parallel, only Alzheimer’s disease patients without cerebrovascular disease showed increased default mode network structural covariance, while only Alzheimer’s disease patients with cerebrovascular disease showed increased executive control network structural covariance compared to controls. Our findings demonstrate the differential neural network structural and functional changes in Alzheimer’s disease with and without cerebrovascular disease, suggesting that the underlying pathology of Alzheimer’s disease patients with cerebrovascular disease might differ from those without cerebrovascular disease and reflect a combination of more severe cerebrovascular disease and less severe Alzheimer’s disease network degeneration phenotype. PMID:29053778

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

PubMed Central

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

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

PubMed

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.

Spatial-Temporal Dynamics of High-Resolution Animal Networks: What Can We Learn from Domestic Animals?

PubMed

Chen, Shi; Ilany, Amiyaal; White, Brad J; Sanderson, Michael W; Lanzas, Cristina

2015-01-01

Animal social network is the key to understand many ecological and epidemiological processes. We used real-time location system (RTLS) to accurately track cattle position, analyze their proximity networks, and tested the hypothesis of temporal stationarity and spatial homogeneity in these networks during different daily time periods and in different areas of the pen. The network structure was analyzed using global network characteristics (network density), subgroup clustering (modularity), triadic property (transitivity), and dyadic interactions (correlation coefficient from a quadratic assignment procedure) at hourly level. We demonstrated substantial spatial-temporal heterogeneity in these networks and potential link between indirect animal-environment contact and direct animal-animal contact. But such heterogeneity diminished if data were collected at lower spatial (aggregated at entire pen level) or temporal (aggregated at daily level) resolution. The network structure (described by the characteristics such as density, modularity, transitivity, etc.) also changed substantially at different time and locations. There were certain time (feeding) and location (hay) that the proximity network structures were more consistent based on the dyadic interaction analysis. These results reveal new insights for animal network structure and spatial-temporal dynamics, provide more accurate descriptions of animal social networks, and allow more accurate modeling of multiple (both direct and indirect) disease transmission pathways.

Multilayer network of language: A unified framework for structural analysis of linguistic subsystems

NASA Astrophysics Data System (ADS)

Martinčić-Ipšić, Sanda; Margan, Domagoj; Meštrović, Ana

2016-09-01

Recently, the focus of complex networks' research has shifted from the analysis of isolated properties of a system toward a more realistic modeling of multiple phenomena - multilayer networks. Motivated by the prosperity of multilayer approach in social, transport or trade systems, we introduce the multilayer networks for language. The multilayer network of language is a unified framework for modeling linguistic subsystems and their structural properties enabling the exploration of their mutual interactions. Various aspects of natural language systems can be represented as complex networks, whose vertices depict linguistic units, while links model their relations. The multilayer network of language is defined by three aspects: the network construction principle, the linguistic subsystem and the language of interest. More precisely, we construct a word-level (syntax and co-occurrence) and a subword-level (syllables and graphemes) network layers, from four variations of original text (in the modeled language). The analysis and comparison of layers at the word and subword-levels are employed in order to determine the mechanism of the structural influences between linguistic units and subsystems. The obtained results suggest that there are substantial differences between the networks' structures of different language subsystems, which are hidden during the exploration of an isolated layer. The word-level layers share structural properties regardless of the language (e.g. Croatian or English), while the syllabic subword-level expresses more language dependent structural properties. The preserved weighted overlap quantifies the similarity of word-level layers in weighted and directed networks. Moreover, the analysis of motifs reveals a close topological structure of the syntactic and syllabic layers for both languages. The findings corroborate that the multilayer network framework is a powerful, consistent and systematic approach to model several linguistic subsystems simultaneously and hence to provide a more unified view on language.

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

ERIC Educational Resources Information Center

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…

Distributed network management in the flat structured mobile communities

NASA Astrophysics Data System (ADS)

Balandina, Elena

2005-10-01

Delivering proper management into the flat structured mobile communities is crucial for improving users experience and increase applications diversity in mobile networks. The available P2P applications do application-centric management, but it cannot replace network-wide management, especially when a number of different applications are used simultaneously in the network. The network-wide management is the key element required for a smooth transition from standalone P2P applications to the self-organizing mobile communities that maintain various services with quality and security guaranties. The classical centralized network management solutions are not applicable in the flat structured mobile communities due to the decentralized nature and high mobility of the underlying networks. Also the basic network management tasks have to be revised taking into account specialties of the flat structured mobile communities. The network performance management becomes more dependent on the current nodes' context, which also requires extension of the configuration management functionality. The fault management has to take into account high mobility of the network nodes. The performance and accounting managements are mainly targeted in maintain an efficient and fair access to the resources within the community, however they also allow unbalanced resource use of the nodes that explicitly permit it, e.g. as a voluntary donation to the community or due to the profession (commercial) reasons. The security management must implement the new trust models, which are based on the community feedback, professional authorization, and a mix of both. For fulfilling these and another specialties of the flat structured mobile communities, a new network management solution is demanded. The paper presents a distributed network management solution for flat structured mobile communities. Also the paper points out possible network management roles for the different parties (e.g. operators, service providing hubs/super nodes, etc.) involved in a service providing chain.

Mesoscopic structure conditions the emergence of cooperation on social networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

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

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 withmore » 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.« less

Networks model of the East Turkistan terrorism

NASA Astrophysics Data System (ADS)

Li, Ben-xian; Zhu, Jun-fang; Wang, Shun-guo

2015-02-01

The presence of the East Turkistan terrorist network in China can be traced back to the rebellions on the BAREN region in Xinjiang in April 1990. This article intends to research the East Turkistan networks in China and offer a panoramic view. The events, terrorists and their relationship are described using matrices. Then social network analysis is adopted to reveal the network type and the network structure characteristics. We also find the crucial terrorist leader. Ultimately, some results show that the East Turkistan network has big hub nodes and small shortest path, and that the network follows a pattern of small world network with hierarchical structure.

The evolutions of medical building network structure for emerging infectious disease protection and control.

PubMed

Liu, Nan; Zhang, Hongzhe; Zhang, Shanshan

2014-12-01

Emerging infectious disease is one of the most minatory threats in modern society. A perfect medical building network system need to be established to protect and control emerging infectious disease. Although in China a preliminary medical building network is already set up with disease control center, the infectious disease hospital, infectious diseases department in general hospital and basic medical institutions, there are still many defects in this system, such as simple structural model, weak interoperability among subsystems, and poor capability of the medical building to adapt to outbreaks of infectious disease. Based on the characteristics of infectious diseases, the whole process of its prevention and control and the comprehensive influence factors, three-dimensional medical architecture network system is proposed as an inevitable trend. In this conception of medical architecture network structure, the evolutions are mentioned, such as from simple network system to multilayer space network system, from static network to dynamic network, and from mechanical network to sustainable network. Ultimately, a more adaptable and corresponsive medical building network system will be established and argued in this paper.

GAT: a graph-theoretical analysis toolbox for analyzing between-group differences in large-scale structural and functional brain networks.

PubMed

Hosseini, S M Hadi; Hoeft, Fumiko; Kesler, Shelli R

2012-01-01

In recent years, graph theoretical analyses of neuroimaging data have increased our understanding of the organization of large-scale structural and functional brain networks. However, tools for pipeline application of graph theory for analyzing topology of brain networks is still lacking. In this report, we describe the development of a graph-analysis toolbox (GAT) that facilitates analysis and comparison of structural and functional network brain networks. GAT provides a graphical user interface (GUI) that facilitates construction and analysis of brain networks, comparison of regional and global topological properties between networks, analysis of network hub and modules, and analysis of resilience of the networks to random failure and targeted attacks. Area under a curve (AUC) and functional data analyses (FDA), in conjunction with permutation testing, is employed for testing the differences in network topologies; analyses that are less sensitive to the thresholding process. We demonstrated the capabilities of GAT by investigating the differences in the organization of regional gray-matter correlation networks in survivors of acute lymphoblastic leukemia (ALL) and healthy matched Controls (CON). The results revealed an alteration in small-world characteristics of the brain networks in the ALL survivors; an observation that confirm our hypothesis suggesting widespread neurobiological injury in ALL survivors. Along with demonstration of the capabilities of the GAT, this is the first report of altered large-scale structural brain networks in ALL survivors.

Characterizing structural association alterations within brain networks in normal aging using Gaussian Bayesian networks.

PubMed

Guo, Xiaojuan; Wang, Yan; Chen, Kewei; Wu, Xia; Zhang, Jiacai; Li, Ke; Jin, Zhen; Yao, Li

2014-01-01

Recent multivariate neuroimaging studies have revealed aging-related alterations in brain structural networks. However, the sensory/motor networks such as the auditory, visual and motor networks, have obtained much less attention in normal aging research. In this study, we used Gaussian Bayesian networks (BN), an approach investigating possible inter-regional directed relationship, to characterize aging effects on structural associations between core brain regions within each of these structural sensory/motor networks using volumetric MRI data. We then further examined the discriminability of BN models for the young (N = 109; mean age =22.73 years, range 20-28) and old (N = 82; mean age =74.37 years, range 60-90) groups. The results of the BN modeling demonstrated that structural associations exist between two homotopic brain regions from the left and right hemispheres in each of the three networks. In particular, compared with the young group, the old group had significant connection reductions in each of the three networks and lesser connection numbers in the visual network. Moreover, it was found that the aging-related BN models could distinguish the young and old individuals with 90.05, 73.82, and 88.48% accuracy for the auditory, visual, and motor networks, respectively. Our findings suggest that BN models can be used to investigate the normal aging process with reliable statistical power. Moreover, these differences in structural inter-regional interactions may help elucidate the neuronal mechanism of anatomical changes in normal aging.

Agonistic reciprocity is associated with reduced male reproductive success within haremic social networks

PubMed Central

Solomon-Lane, Tessa K.; Pradhan, Devaleena S.; Willis, Madelyne C.; Grober, Matthew S.

2015-01-01

While individual variation in social behaviour is ubiquitous and causes social groups to differ in structure, how these structural differences affect fitness remains largely unknown. We used social network analysis of replicate bluebanded goby (Lythrypnus dalli) harems to identify the reproductive correlates of social network structure. In stable groups, we quantified agonistic behaviour, reproduction and steroid hormones, which can both affect and respond to social/reproductive cues. We identified distinct, optimal social structures associated with different reproductive measures. Male hatching success (HS) was negatively associated with agonistic reciprocity, a network structure that describes whether subordinates ‘reciprocated’ agonism received from dominants. Egg laying was associated with the individual network positions of the male and dominant female. Thus, males face a trade-off between promoting structures that facilitate egg laying versus HS. Whether this reproductive conflict is avoidable remains to be determined. We also identified different social and/or reproductive roles for 11-ketotestosterone, 17β-oestradiol and cortisol, suggesting that specific neuroendocrine mechanisms may underlie connections between network structure and fitness. This is one of the first investigations of the reproductive and neuroendocrine correlates of social behaviour and network structure in replicate, naturalistic social groups and supports network structure as an important target for natural selection. PMID:26156769

Random graph models of social networks.

PubMed

Newman, M E J; Watts, D J; Strogatz, S H

2002-02-19

We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of real-world social networks and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

Community-level demographic consequences of urbanization: an ecological network approach.

PubMed

Rodewald, Amanda D; Rohr, Rudolf P; Fortuna, Miguel A; Bascompte, Jordi

2014-11-01

Ecological networks are known to influence ecosystem attributes, but we poorly understand how interspecific network structure affect population demography of multiple species, particularly for vertebrates. Establishing the link between network structure and demography is at the crux of being able to use networks to understand population dynamics and to inform conservation. We addressed the critical but unanswered question, does network structure explain demographic consequences of urbanization? We studied 141 ecological networks representing interactions between plants and nesting birds in forests across an urbanization gradient in Ohio, USA, from 2001 to 2011. Nest predators were identified by video-recording nests and surveyed from 2004 to 2011. As landscapes urbanized, bird-plant networks were more nested, less compartmentalized and dominated by strong interactions between a few species (i.e. low evenness). Evenness of interaction strengths promoted avian nest survival, and evenness explained demography better than urbanization, level of invasion, numbers of predators or other qualitative network metrics. Highly uneven networks had approximately half the nesting success as the most even networks. Thus, nest survival reflected how urbanization altered species interactions, particularly with respect to how nest placement affected search efficiency of predators. The demographic effects of urbanization were not direct, but were filtered through bird-plant networks. This study illustrates how network structure can influence demography at the community level and further, that knowledge of species interactions and a network approach may be requisite to understanding demographic responses to environmental change. © 2014 The Authors. Journal of Animal Ecology © 2014 British Ecological Society.

"Newbies" and "Celebrities": Detecting Social Roles in an Online Network of Teachers via Participation Patterns

ERIC Educational Resources Information Center

Smith Risser, H.; Bottoms, SueAnn

2014-01-01

The advent of social networking tools allows teachers to create online networks and share information. While some virtual networks have a formal structure and defined boundaries, many do not. These unstructured virtual networks are difficult to study because they lack defined boundaries and a formal structure governing leadership roles and the…

Summarisation of weighted networks

NASA Astrophysics Data System (ADS)

Zhou, Fang; Qu, Qiang; Toivonen, Hannu

2017-09-01

Networks often contain implicit structure. We introduce novel problems and methods that look for structure in networks, by grouping nodes into supernodes and edges to superedges, and then make this structure visible to the user in a smaller generalised network. This task of finding generalisations of nodes and edges is formulated as 'network Summarisation'. We propose models and algorithms for networks that have weights on edges, on nodes or on both, and study three new variants of the network summarisation problem. In edge-based weighted network summarisation, the summarised network should preserve edge weights as well as possible. A wider class of settings is considered in path-based weighted network summarisation, where the resulting summarised network should preserve longer range connectivities between nodes. Node-based weighted network summarisation in turn allows weights also on nodes and summarisation aims to preserve more information related to high weight nodes. We study theoretical properties of these problems and show them to be NP-hard. We propose a range of heuristic generalisation algorithms with different trade-offs between complexity and quality of the result. Comprehensive experiments on real data show that weighted networks can be summarised efficiently with relatively little error.

Navigable networks as Nash equilibria of navigation games.

PubMed

Gulyás, András; Bíró, József J; Kőrösi, Attila; Rétvári, Gábor; Krioukov, Dmitri

2015-07-03

Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges, by altering which one can efficiently improve or paralyse navigation in the network.

Structural network heterogeneities and network dynamics: a possible dynamical mechanism for hippocampal memory reactivation.

NASA Astrophysics Data System (ADS)

Jablonski, Piotr; Poe, Gina; Zochowski, Michal

2007-03-01

The hippocampus has the capacity for reactivating recently acquired memories and it is hypothesized that one of the functions of sleep reactivation is the facilitation of consolidation of novel memory traces. The dynamic and network processes underlying such a reactivation remain, however, unknown. We show that such a reactivation characterized by local, self-sustained activity of a network region may be an inherent property of the recurrent excitatory-inhibitory network with a heterogeneous structure. The entry into the reactivation phase is mediated through a physiologically feasible regulation of global excitability and external input sources, while the reactivated component of the network is formed through induced network heterogeneities during learning. We show that structural changes needed for robust reactivation of a given network region are well within known physiological parameters.

Structural network heterogeneities and network dynamics: A possible dynamical mechanism for hippocampal memory reactivation

NASA Astrophysics Data System (ADS)

Jablonski, Piotr; Poe, Gina R.; Zochowski, Michal

2007-01-01

The hippocampus has the capacity for reactivating recently acquired memories and it is hypothesized that one of the functions of sleep reactivation is the facilitation of consolidation of novel memory traces. The dynamic and network processes underlying such a reactivation remain, however, unknown. We show that such a reactivation characterized by local, self-sustained activity of a network region may be an inherent property of the recurrent excitatory-inhibitory network with a heterogeneous structure. The entry into the reactivation phase is mediated through a physiologically feasible regulation of global excitability and external input sources, while the reactivated component of the network is formed through induced network heterogeneities during learning. We show that structural changes needed for robust reactivation of a given network region are well within known physiological parameters.

An Adaptive Complex Network Model for Brain Functional Networks

PubMed Central

Gomez Portillo, Ignacio J.; Gleiser, Pablo M.

2009-01-01

Brain functional networks are graph representations of activity in the brain, where the vertices represent anatomical regions and the edges their functional connectivity. These networks present a robust small world topological structure, characterized by highly integrated modules connected sparsely by long range links. Recent studies showed that other topological properties such as the degree distribution and the presence (or absence) of a hierarchical structure are not robust, and show different intriguing behaviors. In order to understand the basic ingredients necessary for the emergence of these complex network structures we present an adaptive complex network model for human brain functional networks. The microscopic units of the model are dynamical nodes that represent active regions of the brain, whose interaction gives rise to complex network structures. The links between the nodes are chosen following an adaptive algorithm that establishes connections between dynamical elements with similar internal states. We show that the model is able to describe topological characteristics of human brain networks obtained from functional magnetic resonance imaging studies. In particular, when the dynamical rules of the model allow for integrated processing over the entire network scale-free non-hierarchical networks with well defined communities emerge. On the other hand, when the dynamical rules restrict the information to a local neighborhood, communities cluster together into larger ones, giving rise to a hierarchical structure, with a truncated power law degree distribution. PMID:19738902

Evaluating the Spatio-Temporal Factors that Structure Network Parameters of Plant-Herbivore Interactions

PubMed Central

López-Carretero, Antonio; Díaz-Castelazo, Cecilia; Boege, Karina; Rico-Gray, Víctor

2014-01-01

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. PMID:25340790

Neurodevelopmental alterations of large-scale structural networks in children with new-onset epilepsy.

PubMed

Bonilha, Leonardo; Tabesh, Ali; Dabbs, Kevin; Hsu, David A; Stafstrom, Carl E; Hermann, Bruce P; Lin, Jack J

2014-08-01

Recent neuroimaging and behavioral studies have revealed that children with new onset epilepsy already exhibit brain structural abnormalities and cognitive impairment. How the organization of large-scale brain structural networks is altered near the time of seizure onset and whether network changes are related to cognitive performances remain unclear. Recent studies also suggest that regional brain volume covariance reflects synchronized brain developmental changes. Here, we test the hypothesis that epilepsy during early-life is associated with abnormalities in brain network organization and cognition. We used graph theory to study structural brain networks based on regional volume covariance in 39 children with new-onset seizures and 28 healthy controls. Children with new-onset epilepsy showed a suboptimal topological structural organization with enhanced network segregation and reduced global integration compared with controls. At the regional level, structural reorganization was evident with redistributed nodes from the posterior to more anterior head regions. The epileptic brain network was more vulnerable to targeted but not random attacks. Finally, a subgroup of children with epilepsy, namely those with lower IQ and poorer executive function, had a reduced balance between network segregation and integration. Taken together, the findings suggest that the neurodevelopmental impact of new onset childhood epilepsies alters large-scale brain networks, resulting in greater vulnerability to network failure and cognitive impairment. Copyright © 2014 Wiley Periodicals, Inc.

Evolutionary method for finding communities in bipartite networks.

PubMed

Zhan, Weihua; Zhang, Zhongzhi; Guan, Jihong; Zhou, Shuigeng

2011-06-01

An important step in unveiling the relation between network structure and dynamics defined on networks is to detect communities, and numerous methods have been developed separately to identify community structure in different classes of networks, such as unipartite networks, bipartite networks, and directed networks. Here, we show that the finding of communities in such networks can be unified in a general framework-detection of community structure in bipartite networks. Moreover, we propose an evolutionary method for efficiently identifying communities in bipartite networks. To this end, we show that both unipartite and directed networks can be represented as bipartite networks, and their modularity is completely consistent with that for bipartite networks, the detection of modular structure on which can be reformulated as modularity maximization. To optimize the bipartite modularity, we develop a modified adaptive genetic algorithm (MAGA), which is shown to be especially efficient for community structure detection. The high efficiency of the MAGA is based on the following three improvements we make. First, we introduce a different measure for the informativeness of a locus instead of the standard deviation, which can exactly determine which loci mutate. This measure is the bias between the distribution of a locus over the current population and the uniform distribution of the locus, i.e., the Kullback-Leibler divergence between them. Second, we develop a reassignment technique for differentiating the informative state a locus has attained from the random state in the initial phase. Third, we present a modified mutation rule which by incorporating related operations can guarantee the convergence of the MAGA to the global optimum and can speed up the convergence process. Experimental results show that the MAGA outperforms existing methods in terms of modularity for both bipartite and unipartite networks.

Collective network for computer structures

DOEpatents

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.

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

PubMed

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.

Reinforced communication and social navigation: Remember your friends and remember yourself

NASA Astrophysics Data System (ADS)

Mirshahvalad, A.; Rosvall, M.

2011-09-01

In social systems, people communicate with each other and form groups based on their interests. The pattern of interactions, the network, and the ideas that flow on the network naturally evolve together. Researchers use simple models to capture the feedback between changing network patterns and ideas on the network, but little is understood about the role of past events in the feedback process. Here, we introduce a simple agent-based model to study the coupling between peoples’ ideas and social networks, and better understand the role of history in dynamic social networks. We measure how information about ideas can be recovered from information about network structure and, the other way around, how information about network structure can be recovered from information about ideas. We find that it is, in general, easier to recover ideas from the network structure than vice versa.

Analysing Health Professionals' Learning Interactions in an Online Social Network: A Longitudinal Study.

PubMed

Li, Xin; Verspoor, Karin; Gray, Kathleen; Barnett, Stephen

2016-01-01

This paper summarises a longitudinal analysis of learning interactions occurring over three years among health professionals in an online social network. The study employs the techniques of Social Network Analysis (SNA) and statistical modeling to identify the changes in patterns of interaction over time and test associated structural network effects. SNA results indicate overall low participation in the network, although some participants became active over time and even led discussions. In particular, the analysis has shown that a change of lead contributor results in a change in learning interaction and network structure. The analysis of structural network effects demonstrates that the interaction dynamics slow down over time, indicating that interactions in the network are more stable. The health professionals may be reluctant to share knowledge and collaborate in groups but were interested in building personal learning networks or simply seeking information.

Capacity Limit, Link Scheduling and Power Control in Wireless Networks

ERIC Educational Resources Information Center

Zhou, Shan

2013-01-01

The rapid advancement of wireless technology has instigated the broad deployment of wireless networks. Different types of networks have been developed, including wireless sensor networks, mobile ad hoc networks, wireless local area networks, and cellular networks. These networks have different structures and applications, and require different…

Controllability of Surface Water Networks

NASA Astrophysics Data System (ADS)

Riasi, M. Sadegh; Yeghiazarian, Lilit

2017-12-01

To sustainably manage water resources, we must understand how to control complex networked systems. In this paper, we study surface water networks from the perspective of structural controllability, a concept that integrates classical control theory with graph-theoretic formalism. We present structural controllability theory and compute four metrics: full and target controllability, control centrality and control profile (FTCP) that collectively determine the structural boundaries of the system's control space. We use these metrics to answer the following questions: How does the structure of a surface water network affect its controllability? How to efficiently control a preselected subset of the network? Which nodes have the highest control power? What types of topological structures dominate controllability? Finally, we demonstrate the structural controllability theory in the analysis of a wide range of surface water networks, such as tributary, deltaic, and braided river systems.

Multiple regimes of robust patterns between network structure and biodiversity

NASA Astrophysics Data System (ADS)

Jover, Luis F.; Flores, Cesar O.; Cortez, Michael H.; Weitz, Joshua S.

2015-12-01

Ecological networks such as plant-pollinator and host-parasite networks have structured interactions that define who interacts with whom. The structure of interactions also shapes ecological and evolutionary dynamics. Yet, there is significant ongoing debate as to whether certain structures, e.g., nestedness, contribute positively, negatively or not at all to biodiversity. We contend that examining variation in life history traits is key to disentangling the potential relationship between network structure and biodiversity. Here, we do so by analyzing a dynamic model of virus-bacteria interactions across a spectrum of network structures. Consistent with prior studies, we find plausible parameter domains exhibiting strong, positive relationships between nestedness and biodiversity. Yet, the same model can exhibit negative relationships between nestedness and biodiversity when examined in a distinct, plausible region of parameter space. We discuss steps towards identifying when network structure could, on its own, drive the resilience, sustainability, and even conservation of ecological communities.

Multiple regimes of robust patterns between network structure and biodiversity

PubMed Central

Jover, Luis F.; Flores, Cesar O.; Cortez, Michael H.; Weitz, Joshua S.

2015-01-01

Ecological networks such as plant-pollinator and host-parasite networks have structured interactions that define who interacts with whom. The structure of interactions also shapes ecological and evolutionary dynamics. Yet, there is significant ongoing debate as to whether certain structures, e.g., nestedness, contribute positively, negatively or not at all to biodiversity. We contend that examining variation in life history traits is key to disentangling the potential relationship between network structure and biodiversity. Here, we do so by analyzing a dynamic model of virus-bacteria interactions across a spectrum of network structures. Consistent with prior studies, we find plausible parameter domains exhibiting strong, positive relationships between nestedness and biodiversity. Yet, the same model can exhibit negative relationships between nestedness and biodiversity when examined in a distinct, plausible region of parameter space. We discuss steps towards identifying when network structure could, on its own, drive the resilience, sustainability, and even conservation of ecological communities. PMID:26632996

The assembly and disassembly of ecological networks.

PubMed

Bascompte, Jordi; Stouffer, Daniel B

2009-06-27

Global change has created a severe biodiversity crisis. Species are driven extinct at an increasing rate, and this has the potential to cause further coextinction cascades. The rate and shape of these coextinction cascades depend very much on the structure of the networks of interactions across species. Understanding network structure and how it relates to network disassembly, therefore, is a priority for system-level conservation biology. This process of network collapse may indeed be related to the process of network build-up, although very little is known about both processes and even less about their relationship. Here we review recent work that provides some preliminary answers to these questions. First, we focus on network assembly by emphasizing temporal processes at the species level, as well as the structural building blocks of complex ecological networks. Second, we focus on network disassembly as a consequence of species extinctions or habitat loss. We conclude by emphasizing some general rules of thumb that can help in building a comprehensive framework to understand the responses of ecological networks to global change.

Research on spatial economic structure for different economic sectors from a perspective of a complex network

NASA Astrophysics Data System (ADS)

Hu, Sen; Yang, Hualei; Cai, Boliang; Yang, Chunxia

2013-09-01

The economy system is a complex system, and the complex network is a powerful tool to study its complexity. Here we calculate the economic distance matrices based on annual GDP of nine economic sectors from 1995-2010 in 31 Chinese provinces and autonomous regions,1 then build several spatial economic networks through the threshold method and the Minimal Spanning Tree method. After the analysis on the structure of the networks and the influence of geographic distance, some conclusions are drawn. First, connectivity distribution of a spatial economic network does not follow the power law. Second, according to the network structure, nine economic sectors could be divided into two groups, and there is significant discrepancy of network structure between these two groups. Moreover, the influence of the geographic distance plays an important role on the structure of a spatial economic network, network parameters are changed with the influence of the geographic distance. At last, 2000 km is the critical value for geographic distance: for real estate and finance, the spearman’s rho with l<2000 is bigger than that with l>2000, and the case is opposite for other economic sectors.

Deep Neural Network for Structural Prediction and Lane Detection in Traffic Scene.

PubMed

Li, Jun; Mei, Xue; Prokhorov, Danil; Tao, Dacheng

2017-03-01

Hierarchical neural networks have been shown to be effective in learning representative image features and recognizing object classes. However, most existing networks combine the low/middle level cues for classification without accounting for any spatial structures. For applications such as understanding a scene, how the visual cues are spatially distributed in an image becomes essential for successful analysis. This paper extends the framework of deep neural networks by accounting for the structural cues in the visual signals. In particular, two kinds of neural networks have been proposed. First, we develop a multitask deep convolutional network, which simultaneously detects the presence of the target and the geometric attributes (location and orientation) of the target with respect to the region of interest. Second, a recurrent neuron layer is adopted for structured visual detection. The recurrent neurons can deal with the spatial distribution of visible cues belonging to an object whose shape or structure is difficult to explicitly define. Both the networks are demonstrated by the practical task of detecting lane boundaries in traffic scenes. The multitask convolutional neural network provides auxiliary geometric information to help the subsequent modeling of the given lane structures. The recurrent neural network automatically detects lane boundaries, including those areas containing no marks, without any explicit prior knowledge or secondary modeling.

Social Networks and Adaptation to Environmental Change: The Case of Central Oregon's Fire-Prone Forest Landscape

NASA Astrophysics Data System (ADS)

Fischer, A.

2012-12-01

Social networks are the patterned interactions among individuals and organizations through which people refine their beliefs and values, negotiate meanings for things and develop behavioral intentions. The structure of social networks has bearing on how people communicate information, generate and retain knowledge, make decisions and act collectively. Thus, social network structure is important for how people perceive, shape and adapt to the environment. We investigated the relationship between social network structure and human adaptation to wildfire risk in the fire-prone forested landscape of Central Oregon. We conducted descriptive and non-parametric social network analysis on data gathered through interviews to 1) characterize the structure of the network of organizations involved in forest and wildfire issues and 2) determine whether network structure is associated with organizations' beliefs, values and behaviors regarding fire and forest management. Preliminary findings indicate that fire protection and forest-related organizations do not frequently communicate or cooperate, suggesting that opportunities for joint problem-solving, innovation and collective action are limited. Preliminary findings also suggest that organizations with diverse partners are more likely to hold adaptive beliefs about wildfire and work cooperatively. We discuss the implications of social network structure for adaptation to changing environmental conditions such as wildfire risk.

Optimization of hierarchical structure and nanoscale-enabled plasmonic refraction for window electrodes in photovoltaics.

PubMed

Han, Bing; Peng, Qiang; Li, Ruopeng; Rong, Qikun; Ding, Yang; Akinoglu, Eser Metin; Wu, Xueyuan; Wang, Xin; Lu, Xubing; Wang, Qianming; Zhou, Guofu; Liu, Jun-Ming; Ren, Zhifeng; Giersig, Michael; Herczynski, Andrzej; Kempa, Krzysztof; Gao, Jinwei

2016-09-26

An ideal network window electrode for photovoltaic applications should provide an optimal surface coverage, a uniform current density into and/or from a substrate, and a minimum of the overall resistance for a given shading ratio. Here we show that metallic networks with quasi-fractal structure provides a near-perfect practical realization of such an ideal electrode. We find that a leaf venation network, which possesses key characteristics of the optimal structure, indeed outperforms other networks. We further show that elements of hierarchal topology, rather than details of the branching geometry, are of primary importance in optimizing the networks, and demonstrate this experimentally on five model artificial hierarchical networks of varied levels of complexity. In addition to these structural effects, networks containing nanowires are shown to acquire transparency exceeding the geometric constraint due to the plasmonic refraction.

Network structure and travel time perception.

PubMed

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.

Effects of network node consolidation in optical access and aggregation networks on costs and power consumption

NASA Astrophysics Data System (ADS)

Lange, Christoph; Hülsermann, Ralf; Kosiankowski, Dirk; Geilhardt, Frank; Gladisch, Andreas

2010-01-01

The increasing demand for higher bit rates in access networks requires fiber deployment closer to the subscriber resulting in fiber-to-the-home (FTTH) access networks. Besides higher access bit rates optical access network infrastructure and related technologies enable the network operator to establish larger service areas resulting in a simplified network structure with a lower number of network nodes. By changing the network structure network operators want to benefit from a changed network cost structure by decreasing in short and mid term the upfront investments for network equipment due to concentration effects as well as by reducing the energy costs due to a higher energy efficiency of large network sites housing a high amount of network equipment. In long term also savings in operational expenditures (OpEx) due to the closing of central office (CO) sites are expected. In this paper different architectures for optical access networks basing on state-of-the-art technology are analyzed with respect to network installation costs and power consumption in the context of access node consolidation. Network planning and dimensioning results are calculated for a realistic network scenario of Germany. All node consolidation scenarios are compared against a gigabit capable passive optical network (GPON) based FTTH access network operated from the conventional CO sites. The results show that a moderate reduction of the number of access nodes may be beneficial since in that case the capital expenditures (CapEx) do not rise extraordinarily and savings in OpEx related to the access nodes are expected. The total power consumption does not change significantly with decreasing number of access nodes but clustering effects enable a more energyefficient network operation and optimized power purchase order quantities leading to benefits in energy costs.

Developing a network-level structural capacity index for structural evaluation of pavements.

DOT National Transportation Integrated Search

2013-03-01

The objective of this project was to develop a structural index for use in network-level pavement evaluation to facilitate : the inclusion of the pavements structural condition in pavement management applications. The primary goal of network-level...

Optimal Network for Patients with Severe Mental Illness: A Social Network Analysis.

PubMed

Lorant, Vincent; Nazroo, James; Nicaise, Pablo

2017-11-01

It is still unclear what the optimal structure of mental health care networks should be. We examine whether certain types of network structure have been associated with improved continuity of care and greater social integration. A social network survey was carried out, covering 954 patients across 19 mental health networks in Belgium in 2014. We found continuity of care to be associated with large, centralized, and homophilous networks, whereas social integration was associated with smaller, centralized, and heterophilous networks. Two important goals of mental health service provision, continuity of care and social integration, are associated with different types of network. Further research is needed to ascertain the direction of this association.

Why are some plant-pollinator networks more nested than others?

PubMed

Song, Chuliang; Rohr, Rudolf P; Saavedra, Serguei

2017-10-01

Empirical studies have found that the mutualistic interactions forming the structure of plant-pollinator networks are typically more nested than expected by chance alone. Additionally, theoretical studies have shown a positive association between the nested structure of mutualistic networks and community persistence. Yet, it has been shown that some plant-pollinator networks may be more nested than others, raising the interesting question of which factors are responsible for such enhanced nested structure. It has been argued that ordered network structures may increase the persistence of ecological communities under less predictable environments. This suggests that nested structures of plant-pollinator networks could be more advantageous under highly seasonal environments. While several studies have investigated the link between nestedness and various environmental variables, unfortunately, there has been no unified answer to validate these predictions. Here, we move from the problem of describing network structures to the problem of comparing network structures. We develop comparative statistics, and apply them to investigate the association between the nested structure of 59 plant-pollinator networks and the temperature seasonality present in their locations. We demonstrate that higher levels of nestedness are associated with a higher temperature seasonality. We show that the previous lack of agreement came from an extended practice of using standardized measures of nestedness that cannot be compared across different networks. Importantly, our observations complement theory showing that more nested network structures can increase the range of environmental conditions compatible with species coexistence in mutualistic systems, also known as structural stability. This increase in nestedness should be more advantageous and occur more often in locations subject to random environmental perturbations, which could be driven by highly changing or seasonal environments. This synthesis of theory and observations could prove relevant for a better understanding of the ecological processes driving the assembly and persistence of ecological communities. © 2017 The Authors. Journal of Animal Ecology © 2017 British Ecological Society.

Functional approximation using artificial neural networks in structural mechanics

NASA Technical Reports Server (NTRS)

Alam, Javed; Berke, Laszlo

1993-01-01

The artificial neural networks (ANN) methodology is an outgrowth of research in artificial intelligence. In this study, the feed-forward network model that was proposed by Rumelhart, Hinton, and Williams was applied to the mapping of functions that are encountered in structural mechanics problems. Several different network configurations were chosen to train the available data for problems in materials characterization and structural analysis of plates and shells. By using the recall process, the accuracy of these trained networks was assessed.

Epidemic outbreaks in growing scale-free networks with local structure

NASA Astrophysics Data System (ADS)

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

2008-09-01

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

Structural reliability calculation method based on the dual neural network and direct integration method.

PubMed

Li, Haibin; He, Yun; Nie, Xiaobo

2018-01-01

Structural reliability analysis under uncertainty is paid wide attention by engineers and scholars due to reflecting the structural characteristics and the bearing actual situation. The direct integration method, started from the definition of reliability theory, is easy to be understood, but there are still mathematics difficulties in the calculation of multiple integrals. Therefore, a dual neural network method is proposed for calculating multiple integrals in this paper. Dual neural network consists of two neural networks. The neural network A is used to learn the integrand function, and the neural network B is used to simulate the original function. According to the derivative relationships between the network output and the network input, the neural network B is derived from the neural network A. On this basis, the performance function of normalization is employed in the proposed method to overcome the difficulty of multiple integrations and to improve the accuracy for reliability calculations. The comparisons between the proposed method and Monte Carlo simulation method, Hasofer-Lind method, the mean value first-order second moment method have demonstrated that the proposed method is an efficient and accurate reliability method for structural reliability problems.

Transitions from trees to cycles in adaptive flow networks

NASA Astrophysics Data System (ADS)

Martens, Erik A.; Klemm, Konstantin

2017-11-01

Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply. Theoretical and experimental studies have found that real-world transport networks exhibit both tree-like motifs and cycles. When the network is subject to load fluctuations, the presence of cyclic motifs may help to reduce flow fluctuations and, thus, render supply in the network more robust. While previous studies considered network topology via optimization principles, here, we take a dynamical systems approach and study a simple model of a flow network with dynamically adapting weights (conductances). We assume a spatially non-uniform distribution of rapidly fluctuating loads in the sinks and investigate what network configurations are dynamically stable. The network converges to a spatially non-uniform stable configuration composed of both cyclic and tree-like structures. Cyclic structures emerge locally in a transcritical bifurcation as the amplitude of the load fluctuations is increased. The resulting adaptive dynamics thus partitions the network into two distinct regions with cyclic and tree-like structures. The location of the boundary between these two regions is determined by the amplitude of the fluctuations. These findings may explain why natural transport networks display cyclic structures in the micro-vascular regions near terminal nodes, but tree-like features in the regions with larger veins.

Social network analysis of character interaction in the Stargate and Star Trek television series

NASA Astrophysics Data System (ADS)

Tan, Melody Shi Ai; Ujum, Ephrance Abu; Ratnavelu, Kuru

This paper undertakes a social network analysis of two science fiction television series, Stargate and Star Trek. Television series convey stories in the form of character interaction, which can be represented as “character networks”. We connect each pair of characters that exchanged spoken dialogue in any given scene demarcated in the television series transcripts. These networks are then used to characterize the overall structure and topology of each series. We find that the character networks of both series have similar structure and topology to that found in previous work on mythological and fictional networks. The character networks exhibit the small-world effects but found no significant support for power-law. Since the progression of an episode depends to a large extent on the interaction between each of its characters, the underlying network structure tells us something about the complexity of that episode’s storyline. We assessed the complexity using techniques from spectral graph theory. We found that the episode networks are structured either as (1) closed networks, (2) those containing bottlenecks that connect otherwise disconnected clusters or (3) a mixture of both.

Finding community structure in very large networks

NASA Astrophysics Data System (ADS)

Clauset, Aaron; Newman, M. E. J.; Moore, Cristopher

2004-12-01

The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their computational cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O(mdlogn) where d is the depth of the dendrogram describing the community structure. Many real-world networks are sparse and hierarchical, with mtilde n and dtilde logn , in which case our algorithm runs in essentially linear time, O(nlog2n) . As an example of the application of this algorithm we use it to analyze a network of items for sale on the web site of a large on-line retailer, items in the network being linked if they are frequently purchased by the same buyer. The network has more than 400 000 vertices and 2×106 edges. We show that our algorithm can extract meaningful communities from this network, revealing large-scale patterns present in the purchasing habits of customers.

Followers are not enough: a multifaceted approach to community detection in online social networks.

PubMed

Darmon, David; Omodei, Elisa; Garland, Joshua

2015-01-01

In online social media networks, individuals often have hundreds or even thousands of connections, which link these users not only to friends, associates, and colleagues, but also to news outlets, celebrities, and organizations. In these complex social networks, a 'community' as studied in the social network literature, can have very different meaning depending on the property of the network under study. Taking into account the multifaceted nature of these networks, we claim that community detection in online social networks should also be multifaceted in order to capture all of the different and valuable viewpoints of 'community.' In this paper we focus on three types of communities beyond follower-based structural communities: activity-based, topic-based, and interaction-based. We analyze a Twitter dataset using three different weightings of the structural network meant to highlight these three community types, and then infer the communities associated with these weightings. We show that interesting insights can be obtained about the complex community structure present in social networks by studying when and how these four community types give rise to similar as well as completely distinct community structure.

Reconstruction of financial networks for robust estimation of systemic risk

NASA Astrophysics Data System (ADS)

Mastromatteo, Iacopo; Zarinelli, Elia; Marsili, Matteo

2012-03-01

In this paper we estimate the propagation of liquidity shocks through interbank markets when the information about the underlying credit network is incomplete. We show that techniques such as maximum entropy currently used to reconstruct credit networks severely underestimate the risk of contagion by assuming a trivial (fully connected) topology, a type of network structure which can be very different from the one empirically observed. We propose an efficient message-passing algorithm to explore the space of possible network structures and show that a correct estimation of the network degree of connectedness leads to more reliable estimations for systemic risk. Such an algorithm is also able to produce maximally fragile structures, providing a practical upper bound for the risk of contagion when the actual network structure is unknown. We test our algorithm on ensembles of synthetic data encoding some features of real financial networks (sparsity and heterogeneity), finding that more accurate estimations of risk can be achieved. Finally we find that this algorithm can be used to control the amount of information that regulators need to require from banks in order to sufficiently constrain the reconstruction of financial networks.

Navigable networks as Nash equilibria of navigation games

PubMed Central

Gulyás, András; Bíró, József J.; Kőrösi, Attila; Rétvári, Gábor; Krioukov, Dmitri

2015-01-01

Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges, by altering which one can efficiently improve or paralyse navigation in the network. PMID:26138277

Allocation of spectral and spatial modes in multidimensional metro-access optical networks

NASA Astrophysics Data System (ADS)

Gao, Wenbo; Cvijetic, Milorad

2018-04-01

Introduction of spatial division multiplexing (SDM) has added a new dimension in an effort to increase optical fiber channel capacity. At the same time, it can also be explored as an advanced optical networking tool. In this paper, we have investigated the resource allocation to end-users in multidimensional networking structure with plurality of spectral and spatial modes actively deployed in different networking segments. This presents a more comprehensive method as compared to the common practice where the segments of optical network are analyzed independently since the interaction between network hierarchies is included into consideration. We explored the possible transparency from the metro/core network to the optical access network, analyzed the potential bottlenecks from the network architecture perspective, and identified an optimized network structure. In our considerations, the viability of optical grooming through the entire hierarchical all-optical network is investigated by evaluating the effective utilization and spectral efficiency of the network architecture.

The effect of the neural activity on topological properties of growing neural networks.

PubMed

Gafarov, F M; Gafarova, V R

2016-09-01

The connectivity structure in cortical networks defines how information is transmitted and processed, and it is a source of the complex spatiotemporal patterns of network's development, and the process of creation and deletion of connections is continuous in the whole life of the organism. In this paper, we study how neural activity influences the growth process in neural networks. By using a two-dimensional activity-dependent growth model we demonstrated the neural network growth process from disconnected neurons to fully connected networks. For making quantitative investigation of the network's activity influence on its topological properties we compared it with the random growth network not depending on network's activity. By using the random graphs theory methods for the analysis of the network's connections structure it is shown that the growth in neural networks results in the formation of a well-known "small-world" network.

Structural stability of interaction networks against negative external fields

NASA Astrophysics Data System (ADS)

Yoon, S.; Goltsev, A. V.; Mendes, J. F. F.

2018-04-01

We explore structural stability of weighted and unweighted networks of positively interacting agents against a negative external field. We study how the agents support the activity of each other to confront the negative field, which suppresses the activity of agents and can lead to collapse of the whole network. The competition between the interactions and the field shape the structure of stable states of the system. In unweighted networks (uniform interactions) the stable states have the structure of k -cores of the interaction network. The interplay between the topology and the distribution of weights (heterogeneous interactions) impacts strongly the structural stability against a negative field, especially in the case of fat-tailed distributions of weights. We show that apart from critical slowing down there is also a critical change in the system structure that precedes the network collapse. The change can serve as an early warning of the critical transition. To characterize changes of network structure we develop a method based on statistical analysis of the k -core organization and so-called "corona" clusters belonging to the k -cores.

APINetworks: A general API for the treatment of complex networks in arbitrary computational environments

NASA Astrophysics Data System (ADS)

Niño, Alfonso; Muñoz-Caro, Camelia; Reyes, Sebastián

2015-11-01

The last decade witnessed a great development of the structural and dynamic study of complex systems described as a network of elements. Therefore, systems can be described as a set of, possibly, heterogeneous entities or agents (the network nodes) interacting in, possibly, different ways (defining the network edges). In this context, it is of practical interest to model and handle not only static and homogeneous networks but also dynamic, heterogeneous ones. Depending on the size and type of the problem, these networks may require different computational approaches involving sequential, parallel or distributed systems with or without the use of disk-based data structures. In this work, we develop an Application Programming Interface (APINetworks) for the modeling and treatment of general networks in arbitrary computational environments. To minimize dependency between components, we decouple the network structure from its function using different packages for grouping sets of related tasks. The structural package, the one in charge of building and handling the network structure, is the core element of the system. In this work, we focus in this API structural component. We apply an object-oriented approach that makes use of inheritance and polymorphism. In this way, we can model static and dynamic networks with heterogeneous elements in the nodes and heterogeneous interactions in the edges. In addition, this approach permits a unified treatment of different computational environments. Tests performed on a C++11 version of the structural package show that, on current standard computers, the system can handle, in main memory, directed and undirected linear networks formed by tens of millions of nodes and edges. Our results compare favorably to those of existing tools.

Toward Developmental Connectomics of the Human Brain

PubMed Central

Cao, Miao; Huang, Hao; Peng, Yun; Dong, Qi; He, Yong

2016-01-01

Imaging connectomics based on graph theory has become an effective and unique methodological framework for studying structural and functional connectivity patterns of the developing brain. Normal brain development is characterized by continuous and significant network evolution throughout infancy, childhood, and adolescence, following specific maturational patterns. Disruption of these normal changes is associated with neuropsychiatric developmental disorders, such as autism spectrum disorders or attention-deficit hyperactivity disorder. In this review, we focused on the recent progresses regarding typical and atypical development of human brain networks from birth to early adulthood, using a connectomic approach. Specifically, by the time of birth, structural networks already exhibit adult-like organization, with global efficient small-world and modular structures, as well as hub regions and rich-clubs acting as communication backbones. During development, the structure networks are fine-tuned, with increased global integration and robustness and decreased local segregation, as well as the strengthening of the hubs. In parallel, functional networks undergo more dramatic changes during maturation, with both increased integration and segregation during development, as brain hubs shift from primary regions to high order functioning regions, and the organization of modules transitions from a local anatomical emphasis to a more distributed architecture. These findings suggest that structural networks develop earlier than functional networks; meanwhile functional networks demonstrate more dramatic maturational changes with the evolution of structural networks serving as the anatomical backbone. In this review, we also highlighted topologically disorganized characteristics in structural and functional brain networks in several major developmental neuropsychiatric disorders (e.g., autism spectrum disorders, attention-deficit hyperactivity disorder and developmental dyslexia). Collectively, we showed that delineation of the brain network from a connectomics perspective offers a unique and refreshing view of both normal development and neuropsychiatric disorders. PMID:27064378

A new multi-scale method to reveal hierarchical modular structures in biological networks.

PubMed

Jiao, Qing-Ju; Huang, Yan; Shen, Hong-Bin

2016-11-15

Biological networks are effective tools for studying molecular interactions. Modular structure, in which genes or proteins may tend to be associated with functional modules or protein complexes, is a remarkable feature of biological networks. Mining modular structure from biological networks enables us to focus on a set of potentially important nodes, which provides a reliable guide to future biological experiments. The first fundamental challenge in mining modular structure from biological networks is that the quality of the observed network data is usually low owing to noise and incompleteness in the obtained networks. The second problem that poses a challenge to existing approaches to the mining of modular structure is that the organization of both functional modules and protein complexes in networks is far more complicated than was ever thought. For instance, the sizes of different modules vary considerably from each other and they often form multi-scale hierarchical structures. To solve these problems, we propose a new multi-scale protocol for mining modular structure (named ISIMB) driven by a node similarity metric, which works in an iteratively converged space to reduce the effects of the low data quality of the observed network data. The multi-scale node similarity metric couples both the local and the global topology of the network with a resolution regulator. By varying this resolution regulator to give different weightings to the local and global terms in the metric, the ISIMB method is able to fit the shape of modules and to detect them on different scales. Experiments on protein-protein interaction and genetic interaction networks show that our method can not only mine functional modules and protein complexes successfully, but can also predict functional modules from specific to general and reveal the hierarchical organization of protein complexes.

Control of magnetic bearing systems via the Chebyshev polynomial-based unified model (CPBUM) neural network.

PubMed

Jeng, J T; Lee, T T

2000-01-01

A Chebyshev polynomial-based unified model (CPBUM) neural network is introduced and applied to control a magnetic bearing systems. First, we show that the CPBUM neural network not only has the same capability of universal approximator, but also has faster learning speed than conventional feedforward/recurrent neural network. It turns out that the CPBUM neural network is more suitable in the design of controller than the conventional feedforward/recurrent neural network. Second, we propose the inverse system method, based on the CPBUM neural networks, to control a magnetic bearing system. The proposed controller has two structures; namely, off-line and on-line learning structures. We derive a new learning algorithm for each proposed structure. The experimental results show that the proposed neural network architecture provides a greater flexibility and better performance in controlling magnetic bearing systems.

A dynamic network model for interbank market

NASA Astrophysics Data System (ADS)

Xu, Tao; He, Jianmin; Li, Shouwei

2016-12-01

In this paper, a dynamic network model based on agent behavior is introduced to explain the formation mechanism of interbank market network. We investigate the impact of credit lending preference on interbank market network topology, the evolution of interbank market network and stability of interbank market. Experimental results demonstrate that interbank market network is a small-world network and cumulative degree follows the power-law distribution. We find that the interbank network structure keeps dynamic stability in the network evolution process. With the increase of bank credit lending preference, network clustering coefficient increases and average shortest path length decreases monotonously, which improves the stability of the network structure. External shocks are main threats for the interbank market and the reduction of bank external investment yield rate and deposits fluctuations contribute to improve the resilience of the banking system.

Brain networks, structural realism, and local approaches to the scientific realism debate.

PubMed

Yan, Karen; Hricko, Jonathon

2017-08-01

We examine recent work in cognitive neuroscience that investigates brain networks. Brain networks are characterized by the ways in which brain regions are functionally and anatomically connected to one another. Cognitive neuroscientists use various noninvasive techniques (e.g., fMRI) to investigate these networks. They represent them formally as graphs. And they use various graph theoretic techniques to analyze them further. We distinguish between knowledge of the graph theoretic structure of such networks (structural knowledge) and knowledge of what instantiates that structure (nonstructural knowledge). And we argue that this work provides structural knowledge of brain networks. We explore the significance of this conclusion for the scientific realism debate. We argue that our conclusion should not be understood as an instance of a global structural realist claim regarding the structure of the unobservable part of the world, but instead, as a local structural realist attitude towards brain networks in particular. And we argue that various local approaches to the realism debate, i.e., approaches that restrict realist commitments to particular theories and/or entities, are problematic insofar as they don't allow for the possibility of such a local structural realist attitude. Copyright © 2017 Elsevier Ltd. All rights reserved.

Exploring the underlying structure of mental disorders: cross-diagnostic differences and similarities from a network perspective using both a top-down and a bottom-up approach.

PubMed

Wigman, J T W; van Os, J; Borsboom, D; Wardenaar, K J; Epskamp, S; Klippel, A; Viechtbauer, W; Myin-Germeys, I; Wichers, M

2015-08-01

It has been suggested that the structure of psychopathology is best described as a complex network of components that interact in dynamic ways. The goal of the present paper was to examine the concept of psychopathology from a network perspective, combining complementary top-down and bottom-up approaches using momentary assessment techniques. A pooled Experience Sampling Method (ESM) dataset of three groups (individuals with a diagnosis of depression, psychotic disorder or no diagnosis) was used (pooled N = 599). The top-down approach explored the network structure of mental states across different diagnostic categories. For this purpose, networks of five momentary mental states ('cheerful', 'content', 'down', 'insecure' and 'suspicious') were compared between the three groups. The complementary bottom-up approach used principal component analysis to explore whether empirically derived network structures yield meaningful higher order clusters. Individuals with a clinical diagnosis had more strongly connected moment-to-moment network structures, especially the depressed group. This group also showed more interconnections specifically between positive and negative mental states than the psychotic group. In the bottom-up approach, all possible connections between mental states were clustered into seven main components that together captured the main characteristics of the network dynamics. Our combination of (i) comparing network structure of mental states across three diagnostically different groups and (ii) searching for trans-diagnostic network components across all pooled individuals showed that these two approaches yield different, complementary perspectives in the field of psychopathology. The network paradigm therefore may be useful to map transdiagnostic processes.

Interfacing cellular networks of S. cerevisiae and E. coli: Connecting dynamic and genetic information

PubMed Central

2013-01-01

Background In recent years, various types of cellular networks have penetrated biology and are nowadays used omnipresently for studying eukaryote and prokaryote organisms. Still, the relation and the biological overlap among phenomenological and inferential gene networks, e.g., between the protein interaction network and the gene regulatory network inferred from large-scale transcriptomic data, is largely unexplored. Results We provide in this study an in-depth analysis of the structural, functional and chromosomal relationship between a protein-protein network, a transcriptional regulatory network and an inferred gene regulatory network, for S. cerevisiae and E. coli. Further, we study global and local aspects of these networks and their biological information overlap by comparing, e.g., the functional co-occurrence of Gene Ontology terms by exploiting the available interaction structure among the genes. Conclusions Although the individual networks represent different levels of cellular interactions with global structural and functional dissimilarities, we observe crucial functions of their network interfaces for the assembly of protein complexes, proteolysis, transcription, translation, metabolic and regulatory interactions. Overall, our results shed light on the integrability of these networks and their interfacing biological processes. PMID:23663484

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hagberg, Aric; Swart, Pieter; S Chult, Daniel

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 distributionmore » 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.« less

Probing the cross-effect of strains in non-linear elasticity of nearly regular polymer networks by pure shear deformation.

PubMed

Katashima, Takuya; Urayama, Kenji; Chung, Ung-il; Sakai, Takamasa

2015-05-07

The pure shear deformation of the Tetra-polyethylene glycol gels reveals the presence of an explicit cross-effect of strains in the strain energy density function even for the polymer networks with nearly regular structure including no appreciable amount of structural defect such as trapped entanglement. This result is in contrast to the expectation of the classical Gaussian network model (Neo Hookean model), i.e., the vanishing of the cross effect in regular networks with no trapped entanglement. The results show that (1) the cross effect of strains is not dependent on the network-strand length; (2) the cross effect is not affected by the presence of non-network strands; (3) the cross effect is proportional to the network polymer concentration including both elastically effective and ineffective strands; (4) no cross effect is expected exclusively in zero limit of network concentration in real polymer networks. These features indicate that the real polymer networks with regular network structures have an explicit cross-effect of strains, which originates from some interaction between network strands (other than entanglement effect) such as nematic interaction, topological interaction, and excluded volume interaction.

Subnetworks of percolation backbones to model karst systems around Tulum, Mexico

NASA Astrophysics Data System (ADS)

Hendrick, Martin; Renard, Philippe

2016-11-01

Karstic caves, which play a key role in groundwater transport, are often organized as complex connected networks resulting from the dissolution of carbonate rocks. In this work, we propose a new model to describe and study the structures of the two largest submersed karst networks in the world. Both of these networks are located in the area of Tulum (Quintana Roo, Mexico). In a previous work te{hendrick2016fractal} we showed that these networks behave as self-similar structures exhibiting well-defined scaling behaviours. In this paper, we suggest that these networks can be modeled using substructures of percolation clusters (θ-subnetworks) having similar structural behaviour (in terms of fractal dimension and conductivity exponent) to those observed in Tulum's karst networks. We show in addition that these θ-subnetworks correspond to structures that minimise a global function, where this global function includes energy dissipation by the viscous forces when water flows through the network, and the cost of network formation itself.

Social learning strategies modify the effect of network structure on group performance.

PubMed

Barkoczi, Daniel; Galesic, Mirta

2016-10-07

The structure of communication networks is an important determinant of the capacity of teams, organizations and societies to solve policy, business and science problems. Yet, previous studies reached contradictory results about the relationship between network structure and performance, finding support for the superiority of both well-connected efficient and poorly connected inefficient network structures. Here we argue that understanding how communication networks affect group performance requires taking into consideration the social learning strategies of individual team members. We show that efficient networks outperform inefficient networks when individuals rely on conformity by copying the most frequent solution among their contacts. However, inefficient networks are superior when individuals follow the best member by copying the group member with the highest payoff. In addition, groups relying on conformity based on a small sample of others excel at complex tasks, while groups following the best member achieve greatest performance for simple tasks. Our findings reconcile contradictory results in the literature and have broad implications for the study of social learning across disciplines.

Social learning strategies modify the effect of network structure on group performance

NASA Astrophysics Data System (ADS)

Barkoczi, Daniel; Galesic, Mirta

2016-10-01

The structure of communication networks is an important determinant of the capacity of teams, organizations and societies to solve policy, business and science problems. Yet, previous studies reached contradictory results about the relationship between network structure and performance, finding support for the superiority of both well-connected efficient and poorly connected inefficient network structures. Here we argue that understanding how communication networks affect group performance requires taking into consideration the social learning strategies of individual team members. We show that efficient networks outperform inefficient networks when individuals rely on conformity by copying the most frequent solution among their contacts. However, inefficient networks are superior when individuals follow the best member by copying the group member with the highest payoff. In addition, groups relying on conformity based on a small sample of others excel at complex tasks, while groups following the best member achieve greatest performance for simple tasks. Our findings reconcile contradictory results in the literature and have broad implications for the study of social learning across disciplines.

Noise-induced relations between network connectivity and dynamics

NASA Astrophysics Data System (ADS)

Ching, Emily Sc

Many biological systems of interest can be represented as networks of many nodes that are interacting with one another. Often these systems are subject to external influence or noise. One of the central issues is to understand the relation between dynamics and the interaction pattern of the system or the connectivity structure of the network. In particular, a challenging problem is to infer the network connectivity structure from the dynamics. In this talk, we show that for stochastic dynamical systems subjected to noise, the presence of noise gives rise to mathematical relations between the network connectivity structure and quantities that can be calculated using solely the time-series measurements of the dynamics of the nodes. We present these relations for both undirected networks with bidirectional coupling and directed networks with directional coupling and discuss how such relations can be utilized to infer the network connectivity structure of the systems. Work supported by the Hong Kong Research Grants Council under Grant No. CUHK 14300914.

Clustered marginalization of minorities during social transitions induced by co-evolution of behaviour and network structure

NASA Astrophysics Data System (ADS)

Schleussner, Carl-Friedrich; Donges, Jonathan F.; Engemann, Denis A.; Levermann, Anders

2016-08-01

Large-scale transitions in societies are associated with both individual behavioural change and restructuring of the social network. These two factors have often been considered independently, yet recent advances in social network research challenge this view. Here we show that common features of societal marginalization and clustering emerge naturally during transitions in a co-evolutionary adaptive network model. This is achieved by explicitly considering the interplay between individual interaction and a dynamic network structure in behavioural selection. We exemplify this mechanism by simulating how smoking behaviour and the network structure get reconfigured by changing social norms. Our results are consistent with empirical findings: The prevalence of smoking was reduced, remaining smokers were preferentially connected among each other and formed increasingly marginalized clusters. We propose that self-amplifying feedbacks between individual behaviour and dynamic restructuring of the network are main drivers of the transition. This generative mechanism for co-evolution of individual behaviour and social network structure may apply to a wide range of examples beyond smoking.

Active influence in dynamical models of structural balance in social networks

NASA Astrophysics Data System (ADS)

Summers, Tyler H.; Shames, Iman

2013-07-01

We consider a nonlinear dynamical system on a signed graph, which can be interpreted as a mathematical model of social networks in which the links can have both positive and negative connotations. In accordance with a concept from social psychology called structural balance, the negative links play a key role in both the structure and dynamics of the network. Recent research has shown that in a nonlinear dynamical system modeling the time evolution of “friendliness levels” in the network, two opposing factions emerge from almost any initial condition. Here we study active external influence in this dynamical model and show that any agent in the network can achieve any desired structurally balanced state from any initial condition by perturbing its own local friendliness levels. Based on this result, we also introduce a new network centrality measure for signed networks. The results are illustrated in an international-relations network using United Nations voting record data from 1946 to 2008 to estimate friendliness levels amongst various countries.

Clustered marginalization of minorities during social transitions induced by co-evolution of behaviour and network structure.

PubMed

Schleussner, Carl-Friedrich; Donges, Jonathan F; Engemann, Denis A; Levermann, Anders

2016-08-11

Large-scale transitions in societies are associated with both individual behavioural change and restructuring of the social network. These two factors have often been considered independently, yet recent advances in social network research challenge this view. Here we show that common features of societal marginalization and clustering emerge naturally during transitions in a co-evolutionary adaptive network model. This is achieved by explicitly considering the interplay between individual interaction and a dynamic network structure in behavioural selection. We exemplify this mechanism by simulating how smoking behaviour and the network structure get reconfigured by changing social norms. Our results are consistent with empirical findings: The prevalence of smoking was reduced, remaining smokers were preferentially connected among each other and formed increasingly marginalized clusters. We propose that self-amplifying feedbacks between individual behaviour and dynamic restructuring of the network are main drivers of the transition. This generative mechanism for co-evolution of individual behaviour and social network structure may apply to a wide range of examples beyond smoking.

Regulation, Competition and Network Evolution in Aviation

NASA Technical Reports Server (NTRS)

Gillen, David; Morrison, William

2003-01-01

Our focus is the evolution of business strategies and network structure decisions in the commercial passenger aviation industry. The paper reviews the growth of hub-and-spoke networks as the dominant business model following deregulation in the latter part of the 20 century, followed by the emergence of value-based airlines as a global phenomenon at the end of the century. The paper highlights the link between airline business strategies and network structures, and examines the resulting competition between divergent network structure business models. In this context we discuss issues of market structure stability and the role played by competition policy.

Cognitive and Social Structure of the Elite Collaboration Network of Astrophysics: A Case Study on Shifting Network Structures

ERIC Educational Resources Information Center

Heidler, Richard

2011-01-01

Scientific collaboration can only be understood along the epistemic and cognitive grounding of scientific disciplines. New scientific discoveries in astrophysics led to a major restructuring of the elite network of astrophysics. To study the interplay of the epistemic grounding and the social network structure of a discipline, a mixed-methods…

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

NASA Astrophysics Data System (ADS)

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

2016-06-01

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.

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

PubMed

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.

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

PubMed Central

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

2016-01-01

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. PMID:27255783

Graph properties of synchronized cortical networks during visual working memory maintenance.

PubMed

Palva, Satu; Monto, Simo; Palva, J Matias

2010-02-15

Oscillatory synchronization facilitates communication in neuronal networks and is intimately associated with human cognition. Neuronal activity in the human brain can be non-invasively imaged with magneto- (MEG) and electroencephalography (EEG), but the large-scale structure of synchronized cortical networks supporting cognitive processing has remained uncharacterized. We combined simultaneous MEG and EEG (MEEG) recordings with minimum-norm-estimate-based inverse modeling to investigate the structure of oscillatory phase synchronized networks that were active during visual working memory (VWM) maintenance. Inter-areal phase-synchrony was quantified as a function of time and frequency by single-trial phase-difference estimates of cortical patches covering the entire cortical surfaces. The resulting networks were characterized with a number of network metrics that were then compared between delta/theta- (3-6 Hz), alpha- (7-13 Hz), beta- (16-25 Hz), and gamma- (30-80 Hz) frequency bands. We found several salient differences between frequency bands. Alpha- and beta-band networks were more clustered and small-world like but had smaller global efficiency than the networks in the delta/theta and gamma bands. Alpha- and beta-band networks also had truncated-power-law degree distributions and high k-core numbers. The data converge on showing that during the VWM-retention period, human cortical alpha- and beta-band networks have a memory-load dependent, scale-free small-world structure with densely connected core-like structures. These data further show that synchronized dynamic networks underlying a specific cognitive state can exhibit distinct frequency-dependent network structures that could support distinct functional roles. Copyright 2009 Elsevier Inc. All rights reserved.

Genetic effect of interleukin-1 beta (C-511T) polymorphism on the structural covariance network and white matter integrity in Alzheimer's disease.

PubMed

Huang, Chi-Wei; Hsu, Shih-Wei; Tsai, Shih-Jen; Chen, Nai-Ching; Liu, Mu-En; Lee, Chen-Chang; Huang, Shu-Hua; Chang, Weng-Neng; Chang, Ya-Ting; Tsai, Wan-Chen; Chang, Chiung-Chih

2017-01-18

Inflammatory processes play a pivotal role in the degenerative process of Alzheimer's disease. In humans, a biallelic (C/T) polymorphism in the promoter region (position-511) (rs16944) of the interleukin-1 beta gene has been significantly associated with differences in the secretory capacity of interleukin-1 beta. In this study, we investigated whether this functional polymorphism mediates the brain networks in patients with Alzheimer's disease. We enrolled a total of 135 patients with Alzheimer's disease (65 males, 70 females), and investigated their gray matter structural covariance networks using 3D T1 magnetic resonance imaging and their white matter macro-structural integrities using fractional anisotropy. The patients were classified into two genotype groups: C-carriers (n = 108) and TT-carriers (n = 27), and the structural covariance networks were constructed using seed-based analysis focusing on the default mode network medial temporal or dorsal medial subsystem, salience network and executive control network. Neurobehavioral scores were used as the major outcome factors for clinical correlations. There were no differences between the two genotype groups in the cognitive test scores, seed, or peak cluster volumes and white matter fractional anisotropy. The covariance strength showing C-carriers > TT-carriers was the entorhinal-cingulum axis. There were two peak clusters (Brodmann 6 and 10) in the salience network and four peak clusters (superior prefrontal, precentral, fusiform, and temporal) in the executive control network that showed C-carriers < TT-carriers in covariance strength. The salience network and executive control network peak clusters in the TT group and the default mode network peak clusters in the C-carriers strongly predicted the cognitive test scores. Interleukin-1 beta C-511 T polymorphism modulates the structural covariance strength on the anterior brain network and entorhinal-interconnected network which were independent of the white matter tract integrity. Depending on the specific C-511 T genotype, different network clusters could predict the cognitive tests.

Structural evolution of trimesic acid (TMA)/Zn2 + ion network on Au(111) to final structure of (10√3 × 10√3)

NASA Astrophysics Data System (ADS)

Kim, Jandee; Lee, Jaesung; Rhee, Choong Kyun

2016-02-01

Presented is a scanning tunneling microscopy (STM) study of structural evolution of TMA/Zn2 + ion network on Au(111) to the final structure of (10√3 × 10√3) during solution phase post-modification of pristine trimesic acid (TMA) network of a (5√3 × 5√3) structure with Zn2 + ions. Coordination of Zn2 + ions into adsorbed TMA molecules transforms crown-like TMA hexamers in pristine TMA network to chevron pairs in TMA/Zn2 + ion network. Two ordered transient structures of TMA/Zn2 + ion network were observed. One is a (5√7 × 5√7) structure consisting of Zn2 + ion-containing chevron pairs and Zn2 + ion-free TMA dimers. The other is a (5√39 × 5√21) structure made of chevron pairs and chevron-pair-missing sites. An STM image showing domains of different stages of crystallization of chevron pairs demonstrates that the TMA/Zn2 + network before reaching to the final one is quite dynamic. The observed structural evolution of the TMA/Zn2 + ion network is discussed in terms of modification of configurations of adsorbed TMA as accommodating Zn2 + ions and re-ordering of Zn2 + ion-containing chevron pairs.

A new similarity measure for link prediction based on local structures in social networks

NASA Astrophysics Data System (ADS)

Aghabozorgi, Farshad; Khayyambashi, Mohammad Reza

2018-07-01

Link prediction is a fundamental problem in social network analysis. There exist a variety of techniques for link prediction which applies the similarity measures to estimate proximity of vertices in the network. Complex networks like social networks contain structural units named network motifs. In this study, a newly developed similarity measure is proposed where these structural units are applied as the source of similarity estimation. This similarity measure is tested through a supervised learning experiment framework, where other similarity measures are compared with this similarity measure. The classification model trained with this similarity measure outperforms others of its kind.

"Us and them": a social network analysis of physicians' professional networks and their attitudes towards EBM.

PubMed

Mascia, Daniele; Cicchetti, Americo; Damiani, Gianfranco

2013-10-22

Extant research suggests that there is a strong social component to Evidence-Based Medicine (EBM) adoption since professional networks amongst physicians are strongly associated with their attitudes towards EBM. Despite this evidence, it is still unknown whether individual attitudes to use scientific evidence in clinical decision-making influence the position that physicians hold in their professional network. This paper explores how physicians' attitudes towards EBM is related to the network position they occupy within healthcare organizations. Data pertain to a sample of Italian physicians, whose professional network relationships, demographics and work-profile characteristics were collected. A social network analysis was performed to capture the structural importance of physicians in the collaboration network by the means of a core-periphery analysis and the computation of network centrality indicators. Then, regression analysis was used to test the association between the network position of individual clinicians and their attitudes towards EBM. Findings documented that the overall network structure is made up of a dense cohesive core of physicians and of less connected clinicians who occupy the periphery. A negative association between the physicians' attitudes towards EBM and the coreness they exhibited in the professional network was also found. Network centrality indicators confirmed these results documenting a negative association between physicians' propensity to use EBM and their structural importance in the professional network. Attitudes that physicians show towards EBM are related to the part (core or periphery) of the professional networks to which they belong as well as to their structural importance. By identifying virtuous attitudes and behaviors of professionals within their organizations, policymakers and executives may avoid marginalization and stimulate integration and continuity of care, both within and across the boundaries of healthcare providers.

Inferring the mesoscale structure of layered, edge-valued, and time-varying networks

NASA Astrophysics Data System (ADS)

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.

Structural vulnerability of the French swine industry trade network to the spread of infectious diseases.

PubMed

Rautureau, S; Dufour, B; Durand, B

2012-07-01

The networks generated by live animal movements are the principal vector for the propagation of infectious agents between farms, and their topology strongly affects how fast a disease may spread. The structural characteristics of networks may thus provide indicators of network vulnerability to the spread of infectious disease. This study applied social network analysis methods to describe the French swine trade network. Initial analysis involved calculating several parameters to characterize networks and then identifying high-risk subgroups of holdings for different time scales. Holding-specific centrality measurements ('degree', 'betweenness' and 'ingoing infection chain'), which summarize the place and the role of holdings in the network, were compared according to the production type. In addition, network components and communities, areas where connectedness is particularly high and could influence the speed and the extent of a disease, were identified and analysed. Dealer holdings stood out because of their high centrality values suggesting that these holdings may control the flow of animals in part of the network. Herds with growing units had higher values for degree and betweenness centrality, representing central positions for both spreading and receiving disease, whereas herds with finishing units had higher values for in-degree and ingoing infection chain centrality values and appeared more vulnerable with many contacts through live animal movements and thus at potentially higher risk for introduction of contagious diseases. This reflects the dynamics of the swine trade with downward movements along the production chain. But, the significant heterogeneity of farms with several production units did not reveal any particular type of production for targeting disease surveillance or control. Besides, no giant strong connected component was observed, the network being rather organized according to communities of small or medium size (<20% of network size). Because of this fragmentation, the swine trade network appeared less structurally vulnerable than ruminant trade networks. This fragmentation is explained by the hierarchical structure, which thus limits the structural vulnerability of the global trade network. However, inside communities, the hierarchical structure of the swine production system would favour the spread of an infectious agent (especially if introduced in breeding herds).

Optimization of hierarchical structure and nanoscale-enabled plasmonic refraction for window electrodes in photovoltaics

PubMed Central

Han, Bing; Peng, Qiang; Li, Ruopeng; Rong, Qikun; Ding, Yang; Akinoglu, Eser Metin; Wu, Xueyuan; Wang, Xin; Lu, Xubing; Wang, Qianming; Zhou, Guofu; Liu, Jun-Ming; Ren, Zhifeng; Giersig, Michael; Herczynski, Andrzej; Kempa, Krzysztof; Gao, Jinwei

2016-01-01

An ideal network window electrode for photovoltaic applications should provide an optimal surface coverage, a uniform current density into and/or from a substrate, and a minimum of the overall resistance for a given shading ratio. Here we show that metallic networks with quasi-fractal structure provides a near-perfect practical realization of such an ideal electrode. We find that a leaf venation network, which possesses key characteristics of the optimal structure, indeed outperforms other networks. We further show that elements of hierarchal topology, rather than details of the branching geometry, are of primary importance in optimizing the networks, and demonstrate this experimentally on five model artificial hierarchical networks of varied levels of complexity. In addition to these structural effects, networks containing nanowires are shown to acquire transparency exceeding the geometric constraint due to the plasmonic refraction. PMID:27667099

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics

NASA Astrophysics Data System (ADS)

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Network Structure and Travel Time Perception

PubMed Central

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. PMID:24204932

Parameterized centrality metric for network analysis

NASA Astrophysics Data System (ADS)

Ghosh, Rumi; Lerman, Kristina

2011-06-01

A variety of metrics have been proposed to measure the relative importance of nodes in a network. One of these, alpha-centrality [P. Bonacich, Am. J. Sociol.0002-960210.1086/228631 92, 1170 (1987)], measures the number of attenuated paths that exist between nodes. We introduce a normalized version of this metric and use it to study network structure, for example, to rank nodes and find community structure of the network. Specifically, we extend the modularity-maximization method for community detection to use this metric as the measure of node connectivity. Normalized alpha-centrality is a powerful tool for network analysis, since it contains a tunable parameter that sets the length scale of interactions. Studying how rankings and discovered communities change when this parameter is varied allows us to identify locally and globally important nodes and structures. We apply the proposed metric to several benchmark networks and show that it leads to better insights into network structure than alternative metrics.

Mixture models with entropy regularization for community detection in networks

NASA Astrophysics Data System (ADS)

Chang, Zhenhai; Yin, Xianjun; Jia, Caiyan; Wang, Xiaoyang

2018-04-01

Community detection is a key exploratory tool in network analysis and has received much attention in recent years. NMM (Newman's mixture model) is one of the best models for exploring a range of network structures including community structure, bipartite and core-periphery structures, etc. However, NMM needs to know the number of communities in advance. Therefore, in this study, we have proposed an entropy regularized mixture model (called EMM), which is capable of inferring the number of communities and identifying network structure contained in a network, simultaneously. In the model, by minimizing the entropy of mixing coefficients of NMM using EM (expectation-maximization) solution, the small clusters contained little information can be discarded step by step. The empirical study on both synthetic networks and real networks has shown that the proposed model EMM is superior to the state-of-the-art methods.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics.

PubMed

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Mitochondrial network complexity emerges from fission/fusion dynamics.

PubMed

Zamponi, Nahuel; Zamponi, Emiliano; Cannas, Sergio A; Billoni, Orlando V; Helguera, Pablo R; Chialvo, Dante R

2018-01-10

Mitochondrial networks exhibit a variety of complex behaviors, including coordinated cell-wide oscillations of energy states as well as a phase transition (depolarization) in response to oxidative stress. Since functional and structural properties are often interwinded, here we characterized the structure of mitochondrial networks in mouse embryonic fibroblasts using network tools and percolation theory. Subsequently we perturbed the system either by promoting the fusion of mitochondrial segments or by inducing mitochondrial fission. Quantitative analysis of mitochondrial clusters revealed that structural parameters of healthy mitochondria laid in between the extremes of highly fragmented and completely fusioned networks. We confirmed our results by contrasting our empirical findings with the predictions of a recently described computational model of mitochondrial network emergence based on fission-fusion kinetics. Altogether these results offer not only an objective methodology to parametrize the complexity of this organelle but also support the idea that mitochondrial networks behave as critical systems and undergo structural phase transitions.

The Laplacian spectrum of neural networks

PubMed Central

de Lange, Siemon C.; de Reus, Marcel A.; van den Heuvel, Martijn P.

2014-01-01

The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks. Many popular graph metrics, however, encode average properties of individual network elements. Complementing these “conventional” graph metrics, the eigenvalue spectrum of the normalized Laplacian describes a network's structure directly at a systems level, without referring to individual nodes or connections. In this paper, the Laplacian spectra of the macroscopic anatomical neuronal networks of the macaque and cat, and the microscopic network of the Caenorhabditis elegans were examined. Consistent with conventional graph metrics, analysis of the Laplacian spectra revealed an integrative community structure in neural brain networks. Extending previous findings of overlap of network attributes across species, similarity of the Laplacian spectra across the cat, macaque and C. elegans neural networks suggests a certain level of consistency in the overall architecture of the anatomical neural networks of these species. Our results further suggest a specific network class for neural networks, distinct from conceptual small-world and scale-free models as well as several empirical networks. PMID:24454286

Cascading failures in complex networks with community structure

NASA Astrophysics Data System (ADS)

Lin, Guoqiang; di, Zengru; Fan, Ying

2014-12-01

Much empirical evidence shows that when attacked with cascading failures, scale-free or even random networks tend to collapse more extensively when the initially deleted node has higher betweenness. Meanwhile, in networks with strong community structure, high-betweenness nodes tend to be bridge nodes that link different communities, and the removal of such nodes will reduce only the connections among communities, leaving the networks fairly stable. Understanding what will affect cascading failures and how to protect or attack networks with strong community structure is therefore of interest. In this paper, we have constructed scale-free Community Networks (SFCN) and Random Community Networks (RCN). We applied these networks, along with the Lancichinett-Fortunato-Radicchi (LFR) benchmark, to the cascading-failure scenario to explore their vulnerability to attack and the relationship between cascading failures and the degree distribution and community structure of a network. The numerical results show that when the networks are of a power-law distribution, a stronger community structure will result in the failure of fewer nodes. In addition, the initial removal of the node with the highest betweenness will not lead to the worst cascading, i.e. the largest avalanche size. The Betweenness Overflow (BOF), an index that we developed, is an effective indicator of this tendency. The RCN, however, display a different result. In addition, the avalanche size of each node can be adopted as an index to evaluate the importance of the node.

An exploration of the Facebook social networks of smokers and non-smokers.

PubMed

Fu, Luella; Jacobs, Megan A; Brookover, Jody; Valente, Thomas W; Cobb, Nathan K; Graham, Amanda L

2017-01-01

Social networks influence health behavior, including tobacco use and cessation. To date, little is known about whether and how the networks of online smokers and non-smokers may differ, or the potential implications of such differences with regards to intervention efforts. Understanding how social networks vary by smoking status could inform public health efforts to accelerate cessation or slow the adoption of tobacco use. These secondary analyses explore the structure of ego networks of both smokers and non-smokers collected as part of a randomized control trial conducted within Facebook. During the trial, a total of 14,010 individuals installed a Facebook smoking cessation app: 9,042 smokers who were randomized in the trial, an additional 2,881 smokers who did not meet full eligibility criteria, and 2,087 non-smokers. The ego network for all individuals was constructed out to second-degree connections. Four kinds of networks were constructed: friendship, family, photo, and group networks. From these networks we measured edges, isolates, density, mean betweenness, transitivity, and mean closeness. We also measured diameter, clustering, and modularity without ego and isolates. Logistic regressions were performed with smoking status as the response and network metrics as the primary independent variables and demographics and Facebook utilization metrics as covariates. The four networks had different characteristics, indicated by different multicollinearity issues and by logistic regression output. Among Friendship networks, the odds of smoking were higher in networks with lower betweenness (p = 0.00), lower transitivity (p = 0.00), and larger diameter (p = 0.00). Among Family networks, the odds of smoking were higher in networks with more vertices (p = .01), less transitivity (p = .04), and fewer isolates (p = .01). Among Photo networks, none of the network metrics were predictive of smoking status. Among Group networks, the odds of smoking were higher when diameter was smaller (p = .04). Together, these findings suggested that compared to non-smokers, smokers in this sample had less connected, more dispersed Facebook Friendship networks; larger but more fractured Family networks with fewer isolates; more compact Group networks; and Photo networks that were similar in network structure to those of non-smokers. This study illustrates the importance of examining structural differences in online social networks as a critical component for network-based interventions and lays the foundation for future research that examines the ways that social networks differ based on individual health behavior. Interventions that seek to target the behavior of individuals in the context of their social environment would be well served to understand social network structures of participants.

An exploration of the Facebook social networks of smokers and non-smokers

PubMed Central

2017-01-01

Background Social networks influence health behavior, including tobacco use and cessation. To date, little is known about whether and how the networks of online smokers and non-smokers may differ, or the potential implications of such differences with regards to intervention efforts. Understanding how social networks vary by smoking status could inform public health efforts to accelerate cessation or slow the adoption of tobacco use. Objectives These secondary analyses explore the structure of ego networks of both smokers and non-smokers collected as part of a randomized control trial conducted within Facebook. Methods During the trial, a total of 14,010 individuals installed a Facebook smoking cessation app: 9,042 smokers who were randomized in the trial, an additional 2,881 smokers who did not meet full eligibility criteria, and 2,087 non-smokers. The ego network for all individuals was constructed out to second-degree connections. Four kinds of networks were constructed: friendship, family, photo, and group networks. From these networks we measured edges, isolates, density, mean betweenness, transitivity, and mean closeness. We also measured diameter, clustering, and modularity without ego and isolates. Logistic regressions were performed with smoking status as the response and network metrics as the primary independent variables and demographics and Facebook utilization metrics as covariates. Results The four networks had different characteristics, indicated by different multicollinearity issues and by logistic regression output. Among Friendship networks, the odds of smoking were higher in networks with lower betweenness (p = 0.00), lower transitivity (p = 0.00), and larger diameter (p = 0.00). Among Family networks, the odds of smoking were higher in networks with more vertices (p = .01), less transitivity (p = .04), and fewer isolates (p = .01). Among Photo networks, none of the network metrics were predictive of smoking status. Among Group networks, the odds of smoking were higher when diameter was smaller (p = .04). Together, these findings suggested that compared to non-smokers, smokers in this sample had less connected, more dispersed Facebook Friendship networks; larger but more fractured Family networks with fewer isolates; more compact Group networks; and Photo networks that were similar in network structure to those of non-smokers. Conclusions This study illustrates the importance of examining structural differences in online social networks as a critical component for network-based interventions and lays the foundation for future research that examines the ways that social networks differ based on individual health behavior. Interventions that seek to target the behavior of individuals in the context of their social environment would be well served to understand social network structures of participants. PMID:29095958

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

PubMed

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.

Organization of complex networks

NASA Astrophysics Data System (ADS)

Kitsak, Maksim

Many large complex systems can be successfully analyzed using the language of graphs and networks. Interactions between the objects in a network are treated as links connecting nodes. This approach to understanding the structure of networks is an important step toward understanding the way corresponding complex systems function. Using the tools of statistical physics, we analyze the structure of networks as they are found in complex systems such as the Internet, the World Wide Web, and numerous industrial and social networks. In the first chapter we apply the concept of self-similarity to the study of transport properties in complex networks. Self-similar or fractal networks, unlike non-fractal networks, exhibit similarity on a range of scales. We find that these fractal networks have transport properties that differ from those of non-fractal networks. In non-fractal networks, transport flows primarily through the hubs. In fractal networks, the self-similar structure requires any transport to also flow through nodes that have only a few connections. We also study, in models and in real networks, the crossover from fractal to non-fractal networks that occurs when a small number of random interactions are added by means of scaling techniques. In the second chapter we use k-core techniques to study dynamic processes in networks. The k-core of a network is the network's largest component that, within itself, exhibits all nodes with at least k connections. We use this k-core analysis to estimate the relative leadership positions of firms in the Life Science (LS) and Information and Communication Technology (ICT) sectors of industry. We study the differences in the k-core structure between the LS and the ICT sectors. We find that the lead segment (highest k-core) of the LS sector, unlike that of the ICT sector, is remarkably stable over time: once a particular firm enters the lead segment, it is likely to remain there for many years. In the third chapter we study how epidemics spread though networks. Our results indicate that a virus is more likely to infect a large area of a network if it originates at a node contained within k-core of high index k.

Principal Component Analysis Based Measure of Structural Holes

NASA Astrophysics Data System (ADS)

Deng, Shiguo; Zhang, Wenqing; Yang, Huijie

2013-02-01

Based upon principal component analysis, a new measure called compressibility coefficient is proposed to evaluate structural holes in networks. This measure incorporates a new effect from identical patterns in networks. It is found that compressibility coefficient for Watts-Strogatz small-world networks increases monotonically with the rewiring probability and saturates to that for the corresponding shuffled networks. While compressibility coefficient for extended Barabasi-Albert scale-free networks decreases monotonically with the preferential effect and is significantly large compared with that for corresponding shuffled networks. This measure is helpful in diverse research fields to evaluate global efficiency of networks.

New methodologies for multi-scale time-variant reliability analysis of complex lifeline networks

NASA Astrophysics Data System (ADS)

Kurtz, Nolan Scot

The cost of maintaining existing civil infrastructure is enormous. Since the livelihood of the public depends on such infrastructure, its state must be managed appropriately using quantitative approaches. Practitioners must consider not only which components are most fragile to hazard, e.g. seismicity, storm surge, hurricane winds, etc., but also how they participate on a network level using network analysis. Focusing on particularly damaged components does not necessarily increase network functionality, which is most important to the people that depend on such infrastructure. Several network analyses, e.g. S-RDA, LP-bounds, and crude-MCS, and performance metrics, e.g. disconnection bounds and component importance, are available for such purposes. Since these networks are existing, the time state is also important. If networks are close to chloride sources, deterioration may be a major issue. Information from field inspections may also have large impacts on quantitative models. To address such issues, hazard risk analysis methodologies for deteriorating networks subjected to seismicity, i.e. earthquakes, have been created from analytics. A bridge component model has been constructed for these methodologies. The bridge fragilities, which were constructed from data, required a deeper level of analysis as these were relevant for specific structures. Furthermore, chloride-induced deterioration network effects were investigated. Depending on how mathematical models incorporate new information, many approaches are available, such as Bayesian model updating. To make such procedures more flexible, an adaptive importance sampling scheme was created for structural reliability problems. Additionally, such a method handles many kinds of system and component problems with singular or multiple important regions of the limit state function. These and previously developed analysis methodologies were found to be strongly sensitive to the network size. Special network topologies may be more or less computationally difficult, while the resolution of the network also has large affects. To take advantage of some types of topologies, network hierarchical structures with super-link representation have been used in the literature to increase the computational efficiency by analyzing smaller, densely connected networks; however, such structures were based on user input and subjective at times. To address this, algorithms must be automated and reliable. These hierarchical structures may indicate the structure of the network itself. This risk analysis methodology has been expanded to larger networks using such automated hierarchical structures. Component importance is the most important objective from such network analysis; however, this may only provide the information of which bridges to inspect/repair earliest and little else. High correlations influence such component importance measures in a negative manner. Additionally, a regional approach is not appropriately modelled. To investigate a more regional view, group importance measures based on hierarchical structures have been created. Such structures may also be used to create regional inspection/repair approaches. Using these analytical, quantitative risk approaches, the next generation of decision makers may make both component and regional-based optimal decisions using information from both network function and further effects of infrastructure deterioration.

Enhanced collective influence: A paradigm to optimize network disruption

NASA Astrophysics Data System (ADS)

Wu, Tao; Chen, Leiting; Zhong, Linfeng; Xian, Xingping

2017-04-01

The function of complex networks typically relies on the integrity of underlying structure. Sometimes, practical applications need to attack networks' function, namely inactivate and fragment networks' underlying structure. To effectively dismantle complex networks and regulate the function of them, a centrality measure, named CI (Morone and Makse, 2015), was proposed for node ranking. We observe that the performance of CI centrality in network disruption problem may deteriorate when it is used in networks with different topology properties. Specifically, the structural features of local network topology are overlooked in CI centrality, even though the local network topology of the nodes with a fixed CI value may have very different organization. To improve the ranking accuracy of CI, this paper proposes a variant ECI to CI by considering loop density and degree diversity of local network topology. And the proposed ECI centrality would degenerate into CI centrality with the reduction of the loop density and the degree diversity level. By comparing ECI with CI and classical centrality measures in both synthetic and real networks, the experimental results suggest that ECI can largely improve the performance of CI for network disruption. Based on the results, we analyze the correlation between the improvement and the properties of the networks. We find that the performance of ECI is positively correlated with assortative coefficient and community modularity and negatively correlated with degree inequality of networks, which can be used as guidance for practical applications.

Network evolution by nonlinear preferential rewiring of edges

NASA Astrophysics Data System (ADS)

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

2011-06-01

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

Functional brain networks reconstruction using group sparsity-regularized learning.

PubMed

Zhao, Qinghua; Li, Will X Y; Jiang, Xi; Lv, Jinglei; Lu, Jianfeng; Liu, Tianming

2018-06-01

Investigating functional brain networks and patterns using sparse representation of fMRI data has received significant interests in the neuroimaging community. It has been reported that sparse representation is effective in reconstructing concurrent and interactive functional brain networks. To date, most of data-driven network reconstruction approaches rarely take consideration of anatomical structures, which are the substrate of brain function. Furthermore, it has been rarely explored whether structured sparse representation with anatomical guidance could facilitate functional networks reconstruction. To address this problem, in this paper, we propose to reconstruct brain networks utilizing the structure guided group sparse regression (S2GSR) in which 116 anatomical regions from the AAL template, as prior knowledge, are employed to guide the network reconstruction when performing sparse representation of whole-brain fMRI data. Specifically, we extract fMRI signals from standard space aligned with the AAL template. Then by learning a global over-complete dictionary, with the learned dictionary as a set of features (regressors), the group structured regression employs anatomical structures as group information to regress whole brain signals. Finally, the decomposition coefficients matrix is mapped back to the brain volume to represent functional brain networks and patterns. We use the publicly available Human Connectome Project (HCP) Q1 dataset as the test bed, and the experimental results indicate that the proposed anatomically guided structure sparse representation is effective in reconstructing concurrent functional brain networks.

The Embedded Self: A Social Networks Approach to Identity Theory

ERIC Educational Resources Information Center

Walker, Mark H.; Lynn, Freda B.

2013-01-01

Despite the fact that key sociological theories of self and identity view the self as fundamentally rooted in networks of interpersonal relationships, empirical research investigating how personal network structure influences the self is conspicuously lacking. To address this gap, we examine links between network structure and role identity…

Stationary and structural control in gene regulatory networks: basic concepts

NASA Astrophysics Data System (ADS)

Dougherty, Edward R.; Pal, Ranadip; Qian, Xiaoning; Bittner, Michael L.; Datta, Aniruddha

2010-01-01

A major reason for constructing gene regulatory networks is to use them as models for determining therapeutic intervention strategies by deriving ways of altering their long-run dynamics in such a way as to reduce the likelihood of entering undesirable states. In general, two paradigms have been taken for gene network intervention: (1) stationary external control is based on optimally altering the status of a control gene (or genes) over time to drive network dynamics; and (2) structural intervention involves an optimal one-time change of the network structure (wiring) to beneficially alter the long-run behaviour of the network. These intervention approaches have mainly been developed within the context of the probabilistic Boolean network model for gene regulation. This article reviews both types of intervention and applies them to reducing the metastatic competence of cells via intervention in a melanoma-related network.

The network of concepts in written texts

NASA Astrophysics Data System (ADS)

Caldeira, S. M. G.; Petit Lobão, T. C.; Andrade, R. F. S.; Neme, A.; Miranda, J. G. V.

2006-02-01

Complex network theory is used to investigate the structure of meaningful concepts in written texts of individual authors. Networks have been constructed after a two phase filtering, where words with less meaning contents are eliminated and all remaining words are set to their canonical form, without any number, gender or time flexion. Each sentence in the text is added to the network as a clique. A large number of written texts have been scrutinised, and it is found that texts have small-world as well as scale-free structures. The growth process of these networks has also been investigated, and a universal evolution of network quantifiers have been found among the set of texts written by distinct authors. Further analyses, based on shuffling procedures taken either on the texts or on the constructed networks, provide hints on the role played by the word frequency and sentence length distributions to the network structure.

Structure and function of complex brain networks

PubMed Central

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

Temporal efficiency evaluation and small-worldness characterization in temporal networks

PubMed Central

Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu

2016-01-01

Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks. PMID:27682314

Temporal efficiency evaluation and small-worldness characterization in temporal networks

NASA Astrophysics Data System (ADS)

Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu

2016-09-01

Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks.

More Stable Ties or Better Structure? An Examination of the Impact of Co-author Network on Team Knowledge Creation

PubMed Central

Li, Mingze; Zhuang, Xiaoli; Liu, Wenxing; Zhang, Pengcheng

2017-01-01

This study aims to explore the influence of co-author network on team knowledge creation. Integrating the two traditional perspectives of network relationship and network structure, we examine the direct and interactive effects of tie stability and structural holes on team knowledge creation. Tracking scientific articles published by 111 scholars in the research field of human resource management from the top 8 American universities, we analyze scholars’ scientific co-author networks. The result indicates that tie stability changes the teams’ information processing modes and, when graphed, results in an inverted U-shape relationship between tie stability and team knowledge creation. Moreover, structural holes in co-author network are proved to be harmful to team knowledge sharing and diffusion, thereby impeding team knowledge creation. Also, tie stability and structural hole interactively influence team knowledge creation. When the number of structural hole is low in the co-author network, the graphical representation of the relationship between tie stability and team knowledge creation tends to be a more distinct U-shape. PMID:28993744

More Stable Ties or Better Structure? An Examination of the Impact of Co-author Network on Team Knowledge Creation.

PubMed

Li, Mingze; Zhuang, Xiaoli; Liu, Wenxing; Zhang, Pengcheng

2017-01-01

This study aims to explore the influence of co-author network on team knowledge creation. Integrating the two traditional perspectives of network relationship and network structure, we examine the direct and interactive effects of tie stability and structural holes on team knowledge creation. Tracking scientific articles published by 111 scholars in the research field of human resource management from the top 8 American universities, we analyze scholars' scientific co-author networks. The result indicates that tie stability changes the teams' information processing modes and, when graphed, results in an inverted U-shape relationship between tie stability and team knowledge creation. Moreover, structural holes in co-author network are proved to be harmful to team knowledge sharing and diffusion, thereby impeding team knowledge creation. Also, tie stability and structural hole interactively influence team knowledge creation. When the number of structural hole is low in the co-author network, the graphical representation of the relationship between tie stability and team knowledge creation tends to be a more distinct U-shape.

The role of syntax in complex networks: Local and global importance of verbs in a syntactic dependency network

NASA Astrophysics Data System (ADS)

Čech, Radek; Mačutek, Ján; Žabokrtský, Zdeněk

2011-10-01

Syntax of natural language has been the focus of linguistics for decades. The complex network theory, being one of new research tools, opens new perspectives on syntax properties of the language. Despite numerous partial achievements, some fundamental problems remain unsolved. Specifically, although statistical properties typical for complex networks can be observed in all syntactic networks, the impact of syntax itself on these properties is still unclear. The aim of the present study is to shed more light on the role of syntax in the syntactic network structure. In particular, we concentrate on the impact of the syntactic function of a verb in the sentence on the complex network structure. Verbs play the decisive role in the sentence structure (“local” importance). From this fact we hypothesize the importance of verbs in the complex network (“global” importance). The importance of verb in the complex network is assessed by the number of links which are directed from the node representing verb to other nodes in the network. Six languages (Catalan, Czech, Dutch, Hungarian, Italian, Portuguese) were used for testing the hypothesis.

The patterns of organisation and structure of interactions in a fish-parasite network of a neotropical river.

PubMed

Bellay, Sybelle; Oliveira, Edson F de; Almeida-Neto, Mário; Abdallah, Vanessa D; Azevedo, Rodney K de; Takemoto, Ricardo M; Luque, José L

2015-07-01

The use of the complex network approach to study host-parasite interactions has helped to improve the understanding of the structure and dynamics of ecological communities. In this study, this network approach is applied to evaluate the patterns of organisation and structure of interactions in a fish-parasite network of a neotropical Atlantic Forest river. The network includes 20 fish species and 73 metazoan parasite species collected from the Guandu River, Rio de Janeiro State, Brazil. According to the usual measures in studies of networks, the organisation of the network was evaluated using measures of host susceptibility, parasite dependence, interaction asymmetry, species strength and complementary specialisation of each species as well as the network. The network structure was evaluated using connectance, nestedness and modularity measures. Host susceptibility typically presented low values, whereas parasite dependence was high. The asymmetry and species strength were correlated with host taxonomy but not with parasite taxonomy. Differences among parasite taxonomic groups in the complementary specialisation of each species on hosts were also observed. However, the complementary specialisation and species strength values were not correlated. The network had a high complementary specialisation, low connectance and nestedness, and high modularity, thus indicating variability in the roles of species in the network organisation and the expected presence of many specialist species. Copyright © 2015 Australian Society for Parasitology Inc. Published by Elsevier Ltd. All rights reserved.

Graph theoretical analysis of complex networks in the brain

PubMed Central

Stam, Cornelis J; Reijneveld, Jaap C

2007-01-01

Since the discovery of small-world and scale-free networks the study of complex systems from a network perspective has taken an enormous flight. In recent years many important properties of complex networks have been delineated. In particular, significant progress has been made in understanding the relationship between the structural properties of networks and the nature of dynamics taking place on these networks. For instance, the 'synchronizability' of complex networks of coupled oscillators can be determined by graph spectral analysis. These developments in the theory of complex networks have inspired new applications in the field of neuroscience. Graph analysis has been used in the study of models of neural networks, anatomical connectivity, and functional connectivity based upon fMRI, EEG and MEG. These studies suggest that the human brain can be modelled as a complex network, and may have a small-world structure both at the level of anatomical as well as functional connectivity. This small-world structure is hypothesized to reflect an optimal situation associated with rapid synchronization and information transfer, minimal wiring costs, as well as a balance between local processing and global integration. The topological structure of functional networks is probably restrained by genetic and anatomical factors, but can be modified during tasks. There is also increasing evidence that various types of brain disease such as Alzheimer's disease, schizophrenia, brain tumours and epilepsy may be associated with deviations of the functional network topology from the optimal small-world pattern. PMID:17908336

Structural and functional social network attributes moderate the association of self-rated health with mental health in midlife and older adults.

PubMed

Windsor, Tim D; Rioseco, Pilar; Fiori, Katherine L; Curtis, Rachel G; Booth, Heather

2016-01-01

Social relationships are multifaceted, and different social network components can operate via different processes to influence well-being. This study examined associations of social network structure and relationship quality (positive and negative social exchanges) with mental health in midlife and older adults. The focus was on both direct associations of network structure and relationship quality with mental health, and whether these social network attributes moderated the association of self-rated health (SRH) with mental health. Analyses were based on survey data provided by 2001 (Mean age = 65, SD = 8.07) midlife and older adults. We used Latent Class Analysis (LCA) to classify participants into network types based on network structure (partner status, network size, contact frequency, and activity engagement), and used continuous measures of positive and negative social exchanges to operationalize relationship quality. Regression analysis was used to test moderation. LCA revealed network types generally consistent with those reported in previous studies. Participants in more diverse networks reported better mental health than those categorized into a restricted network type after adjustment for age, sex, education, and employment status. Analysis of moderation indicated that those with poorer SRH were less likely to report poorer mental health if they were classified into more diverse networks. A similar moderation effect was also evident for positive exchanges. The findings suggest that both quantity and quality of social relationships can play a role in buffering against the negative implications of physical health decline for mental health.

Advanced functional network analysis in the geosciences: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan F.; Heitzig, Jobst; Runge, Jakob; Schultz, Hanna C. H.; Wiedermann, Marc; Zech, Alraune; Feldhoff, Jan; Rheinwalt, Aljoscha; Kutza, Hannes; Radebach, Alexander; Marwan, Norbert; Kurths, Jürgen

2013-04-01

Functional networks are a powerful tool for analyzing large geoscientific datasets such as global fields of climate time series originating from observations or model simulations. pyunicorn (pythonic unified complex network and recurrence analysis toolbox) is an open-source, fully object-oriented and easily parallelizable package written in the language Python. It allows for constructing functional networks (aka climate networks) representing the structure of statistical interrelationships in large datasets and, subsequently, investigating this structure using advanced methods of complex network theory such as measures for networks of interacting networks, node-weighted statistics or network surrogates. Additionally, pyunicorn allows to study the complex dynamics of geoscientific systems as recorded by time series by means of recurrence networks and visibility graphs. The range of possible applications of the package is outlined drawing on several examples from climatology.

Effect of dilution in asymmetric recurrent neural networks.

PubMed

Folli, Viola; Gosti, Giorgio; Leonetti, Marco; Ruocco, Giancarlo

2018-04-16

We study with numerical simulation the possible limit behaviors of synchronous discrete-time deterministic recurrent neural networks composed of N binary neurons as a function of a network's level of dilution and asymmetry. The network dilution measures the fraction of neuron couples that are connected, and the network asymmetry measures to what extent the underlying connectivity matrix is asymmetric. For each given neural network, we study the dynamical evolution of all the different initial conditions, thus characterizing the full dynamical landscape without imposing any learning rule. Because of the deterministic dynamics, each trajectory converges to an attractor, that can be either a fixed point or a limit cycle. These attractors form the set of all the possible limit behaviors of the neural network. For each network we then determine the convergence times, the limit cycles' length, the number of attractors, and the sizes of the attractors' basin. We show that there are two network structures that maximize the number of possible limit behaviors. The first optimal network structure is fully-connected and symmetric. On the contrary, the second optimal network structure is highly sparse and asymmetric. The latter optimal is similar to what observed in different biological neuronal circuits. These observations lead us to hypothesize that independently from any given learning model, an efficient and effective biologic network that stores a number of limit behaviors close to its maximum capacity tends to develop a connectivity structure similar to one of the optimal networks we found. Copyright © 2018 The Author(s). Published by Elsevier Ltd.. All rights reserved.

Control range: a controllability-based index for node significance in directed networks

NASA Astrophysics Data System (ADS)

Wang, Bingbo; Gao, Lin; Gao, Yong

2012-04-01

While a large number of methods for module detection have been developed for undirected networks, it is difficult to adapt them to handle directed networks due to the lack of consensus criteria for measuring the node significance in a directed network. In this paper, we propose a novel structural index, the control range, motivated by recent studies on the structural controllability of large-scale directed networks. The control range of a node quantifies the size of the subnetwork that the node can effectively control. A related index, called the control range similarity, is also introduced to measure the structural similarity between two nodes. When applying the index of control range to several real-world and synthetic directed networks, it is observed that the control range of the nodes is mainly influenced by the network's degree distribution and that nodes with a low degree may have a high control range. We use the index of control range similarity to detect and analyze functional modules in glossary networks and the enzyme-centric network of homo sapiens. Our results, as compared with other approaches to module detection such as modularity optimization algorithm, dynamic algorithm and clique percolation method, indicate that the proposed indices are effective and practical in depicting structural and modular characteristics of sparse directed networks.

Enabling Controlling Complex Networks with Local Topological Information.

PubMed

Li, Guoqi; Deng, Lei; Xiao, Gaoxi; Tang, Pei; Wen, Changyun; Hu, Wuhua; Pei, Jing; Shi, Luping; Stanley, H Eugene

2018-03-15

Complex networks characterize the nature of internal/external interactions in real-world systems including social, economic, biological, ecological, and technological networks. Two issues keep as obstacles to fulfilling control of large-scale networks: structural controllability which describes the ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs; and optimal control, which is a typical control approach to minimize the cost for driving the network to a predefined state with a given number of control inputs. For large complex networks without global information of network topology, both problems remain essentially open. Here we combine graph theory and control theory for tackling the two problems in one go, using only local network topology information. For the structural controllability problem, a distributed local-game matching method is proposed, where every node plays a simple Bayesian game with local information and local interactions with adjacent nodes, ensuring a suboptimal solution at a linear complexity. Starring from any structural controllability solution, a minimizing longest control path method can efficiently reach a good solution for the optimal control in large networks. Our results provide solutions for distributed complex network control and demonstrate a way to link the structural controllability and optimal control together.

Toward a model of school inspections in a polycentric system.

PubMed

Janssens, Frans J G; Ehren, Melanie C M

2016-06-01

Many education systems are developing towards more lateral structures where schools collaborate in networks to improve and provide (inclusive) education. These structures call for bottom-up models of network evaluation and accountability instead of the current hierarchical arrangements where single schools are evaluated by a central agency. This paper builds on available research about network effectiveness to present evolving models of network evaluation. Network effectiveness can be defined as the achievement of positive network level outcomes that cannot be attained by individual organizational participants acting alone. Models of network evaluation need to take into account the relations between network members, the structure of the network, its processes and its internal mechanism to enforce norms in order to understand the achievement and outcomes of the network and how these may evolve over time. A range of suitable evaluation models are presented in this paper, as well as a tentative school inspection framework which is inspired by these models. The final section will present examples from Inspectorates of Education in Northern Ireland and Scotland who have developed newer inspection models to evaluate the effectiveness of a range of different networks. Copyright © 2016 Elsevier Ltd. All rights reserved.

Spatial network surrogates for disentangling complex system structure from spatial embedding of nodes

NASA Astrophysics Data System (ADS)

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.

Re-examining the paradox of structure: a child health network perspective.

PubMed

McPherson, Charmaine M; Popp, Janice K; Lindstrom, Ronald R

2006-01-01

In their lead paper, Huerta, Casebeer and VanderPlaat argue that there are several key forces driving the development of health services delivery (HSD) networks, and propose a series of paradoxes and propositions to initiate this timely and essential dialogue. Ultimately, they submit that networks are likely to remain within the healthcare system to build system capacity and drive integration. Given this, they challenge us to further the dialogue and investigate these networks. While this peer commentary shares many of the lead author's perspectives, the generic nature of the discussion does not bring us to the relative complexities revealed in some HSD network practices. A Canadian child health network lens is used to re-examine the lead paper's conceptualization of network typologies and the proposed paradox of structure. We combine network practice and academic expertise to highlight the structural, governance and leadership tensions between traditional hierarchical public service organizations and the non-hierarchical nature of inter-organizational networks. Child health network leaders and members must examine and work with the challenges associated with importing traditional organizational cultures into an inter-organizationally networked context, while simultaneously maintaining these dual (or duelling) cultures.

Structuring evolution: biochemical networks and metabolic diversification in birds.

PubMed

Morrison, Erin S; Badyaev, Alexander V

2016-08-25

Recurrence and predictability of evolution are thought to reflect the correspondence between genomic and phenotypic dimensions of organisms, and the connectivity in deterministic networks within these dimensions. Direct examination of the correspondence between opportunities for diversification imbedded in such networks and realized diversity is illuminating, but is empirically challenging because both the deterministic networks and phenotypic diversity are modified in the course of evolution. Here we overcome this problem by directly comparing the structure of a "global" carotenoid network - comprising of all known enzymatic reactions among naturally occurring carotenoids - with the patterns of evolutionary diversification in carotenoid-producing metabolic networks utilized by birds. We found that phenotypic diversification in carotenoid networks across 250 species was closely associated with enzymatic connectivity of the underlying biochemical network - compounds with greater connectivity occurred the most frequently across species and were the hotspots of metabolic pathway diversification. In contrast, we found no evidence for diversification along the metabolic pathways, corroborating findings that the utilization of the global carotenoid network was not strongly influenced by history in avian evolution. The finding that the diversification in species-specific carotenoid networks is qualitatively predictable from the connectivity of the underlying enzymatic network points to significant structural determinism in phenotypic evolution.

Dynamics of functional failures and recovery in complex road networks

NASA Astrophysics Data System (ADS)

Zhan, Xianyuan; Ukkusuri, Satish V.; Rao, P. Suresh C.

2017-11-01

We propose a new framework for modeling the evolution of functional failures and recoveries in complex networks, with traffic congestion on road networks as the case study. Differently from conventional approaches, we transform the evolution of functional states into an equivalent dynamic structural process: dual-vertex splitting and coalescing embedded within the original network structure. The proposed model successfully explains traffic congestion and recovery patterns at the city scale based on high-resolution data from two megacities. Numerical analysis shows that certain network structural attributes can amplify or suppress cascading functional failures. Our approach represents a new general framework to model functional failures and recoveries in flow-based networks and allows understanding of the interplay between structure and function for flow-induced failure propagation and recovery.

Self-organization in neural networks - Applications in structural optimization

NASA Technical Reports Server (NTRS)

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.

An economic analysis on optical Ethernet in the access network

NASA Astrophysics Data System (ADS)

Kim, Sung Hwi; Nam, Dohyun; Yoo, Gunil; Kim, WoonHa

2004-04-01

Nowadays, Broadband service subscribers have increased exponentially and have almost saturated in Korea. Several types of solutions for broadband service applied to the field. Among several types of broadband services, most of subscribers provided xDSL service like ADSL or VDSL. Usually, they who live in an apartment provided Internet service by Ntopia network as FTTC structure that is a dormant network in economical view at KT. Under competitive telecom environment for new services like video, we faced with needing to expand or rebuild portions of our access networks, are looking for ways to provide any service that competitors might offer presently or in the near future. In order to look for new business model like FTTH service, we consider deploying optical access network. In spite of numerous benefits of PON until now, we cannot believe that PON is the best solution in Korea. Because we already deployed optical access network of ring type feeder cable and have densely population of subscribers that mainly distributed inside 6km from central office. So we try to utilize an existing Ntopia network for FTTH service under optical access environment. Despite of such situations, we try to deploy PON solution in the field as FTTC or FTTH architecture. Therefore we analyze PON structure in comparison with AON structure in order to look for optimized structure in Korea. At first, we describe the existing optical access networks and network architecture briefly. Secondly we investigate the cost of building optical access networks by modeling cost functions on AON and PON structure which based on Ethernet protocol, and analyze two different network architectures according to different deployment scenarios: Urban, small town, rural. Finally we suggest the economic and best solution with PON structure to optimize to optical access environment of KT.

Social network properties and self-rated health in later life: comparisons from the Korean social life, health, and aging project and the national social life, health and aging project.

PubMed

Youm, Yoosik; Laumann, Edward O; Ferraro, Kenneth F; Waite, Linda J; Kim, Hyeon Chang; Park, Yeong-Ran; Chu, Sang Hui; Joo, Won-Tak; Lee, Jin A

2014-09-14

This paper has two objectives. Firstly, it provides an overview of the social network module, data collection procedures, and measurement of ego-centric and complete-network properties in the Korean Social Life, Health, and Aging Project (KSHAP). Secondly, it directly compares the KSHAP structure and results to the ego-centric network structure and results of the National Social Life, Health, and Aging Project (NSHAP), which conducted in-home interviews with 3,005 persons 57 to 85 years of age in the United States. The structure of the complete social network of 814 KSHAP respondents living in Township K was measured and examined at two levels of networks. Ego-centric network properties include network size, composition, volume of contact with network members, density, and bridging potential. Complete-network properties are degree centrality, closeness centrality, betweenness centrality, and brokerage role. We found that KSHAP respondents with a smaller number of social network members were more likely to be older and tended to have poorer self-rated health. Compared to the NSHAP, the KSHAP respondents maintained a smaller network size with a greater network density among their members and lower bridging potential. Further analysis of the complete network properties of KSHAP respondents revealed that more brokerage roles inside the same neighborhood (Ri) were significantly associated with better self-rated health. Socially isolated respondents identified by network components had the worst self-rated health. The findings demonstrate the importance of social network analysis for the study of older adults' health status in Korea. The study also highlights the importance of complete-network data and its ability to reveal mechanisms beyond ego-centric network data.

Social network properties and self-rated health in later life: comparisons from the Korean social life, health, and aging project and the national social life, health and aging project

PubMed Central

2014-01-01

Background This paper has two objectives. Firstly, it provides an overview of the social network module, data collection procedures, and measurement of ego-centric and complete-network properties in the Korean Social Life, Health, and Aging Project (KSHAP). Secondly, it directly compares the KSHAP structure and results to the ego-centric network structure and results of the National Social Life, Health, and Aging Project (NSHAP), which conducted in-home interviews with 3,005 persons 57 to 85 years of age in the United States. Methods The structure of the complete social network of 814 KSHAP respondents living in Township K was measured and examined at two levels of networks. Ego-centric network properties include network size, composition, volume of contact with network members, density, and bridging potential. Complete-network properties are degree centrality, closeness centrality, betweenness centrality, and brokerage role. Results We found that KSHAP respondents with a smaller number of social network members were more likely to be older and tended to have poorer self-rated health. Compared to the NSHAP, the KSHAP respondents maintained a smaller network size with a greater network density among their members and lower bridging potential. Further analysis of the complete network properties of KSHAP respondents revealed that more brokerage roles inside the same neighborhood (Ri) were significantly associated with better self-rated health. Socially isolated respondents identified by network components had the worst self-rated health. Conclusions The findings demonstrate the importance of social network analysis for the study of older adults’ health status in Korea. The study also highlights the importance of complete-network data and its ability to reveal mechanisms beyond ego-centric network data. PMID:25217892

A spectral method to detect community structure based on distance modularity matrix

NASA Astrophysics Data System (ADS)

Yang, Jin-Xuan; Zhang, Xiao-Dong

2017-08-01

There are many community organizations in social and biological networks. How to identify these community structure in complex networks has become a hot issue. In this paper, an algorithm to detect community structure of networks is proposed by using spectra of distance modularity matrix. The proposed algorithm focuses on the distance of vertices within communities, rather than the most weakly connected vertex pairs or number of edges between communities. The experimental results show that our method achieves better effectiveness to identify community structure for a variety of real-world networks and computer generated networks with a little more time-consumption.

Insensitive dependence of delay-induced oscillation death on complex networks

NASA Astrophysics Data System (ADS)

Zou, Wei; Zheng, Xing; Zhan, Meng

2011-06-01

Oscillation death (also called amplitude death), a phenomenon of coupling induced stabilization of an unstable equilibrium, is studied for an arbitrary symmetric complex network with delay-coupled oscillators, and the critical conditions for its linear stability are explicitly obtained. All cases including one oscillator, a pair of oscillators, regular oscillator networks, and complex oscillator networks with delay feedback coupling, can be treated in a unified form. For an arbitrary symmetric network, we find that the corresponding smallest eigenvalue of the Laplacian λN (0 >λN ≥ -1) completely determines the death island, and as λN is located within the insensitive parameter region for nearly all complex networks, the death island keeps nearly the largest and does not sensitively depend on the complex network structures. This insensitivity effect has been tested for many typical complex networks including Watts-Strogatz (WS) and Newman-Watts (NW) small world networks, general scale-free (SF) networks, Erdos-Renyi (ER) random networks, geographical networks, and networks with community structures and is expected to be helpful for our understanding of dynamics on complex networks.

Resilient networks of ant-plant mutualists in Amazonian forest fragments.

PubMed

Passmore, Heather A; Bruna, Emilio M; Heredia, Sylvia M; Vasconcelos, Heraldo L

2012-01-01

The organization of networks of interacting species, such as plants and animals engaged in mutualisms, strongly influences the ecology and evolution of partner communities. Habitat fragmentation is a globally pervasive form of spatial heterogeneity that could profoundly impact the structure of mutualist networks. This is particularly true for biodiversity-rich tropical ecosystems, where the majority of plant species depend on mutualisms with animals and it is thought that changes in the structure of mutualist networks could lead to cascades of extinctions. We evaluated effects of fragmentation on mutualistic networks by calculating metrics of network structure for ant-plant networks in continuous Amazonian forests with those in forest fragments. We hypothesized that networks in fragments would have fewer species and higher connectance, but equal nestedness and resilience compared to forest networks. Only one of the nine metrics we compared differed between continuous forest and forest fragments, indicating that networks were resistant to the biotic and abiotic changes that accompany fragmentation. This is partially the result of the loss of only specialist species with one connection that were lost in forest fragments. We found that the networks of ant-plant mutualists in twenty-five year old fragments are similar to those in continuous forest, suggesting these interactions are resistant to the detrimental changes associated with habitat fragmentation, at least in landscapes that are a mosaic of fragments, regenerating forests, and pastures. However, ant-plant mutualistic networks may have several properties that may promote their persistence in fragmented landscapes. Proactive identification of key mutualist partners may be necessary to focus conservation efforts on the interactions that insure the integrity of network structure and the ecosystems services networks provide.

Kinetic products in coordination networks: ab initio X-ray powder diffraction analysis.

PubMed

Martí-Rujas, Javier; Kawano, Masaki

2013-02-19

Porous coordination networks are materials that maintain their crystal structure as molecular "guests" enter and exit their pores. They are of great research interest with applications in areas such as catalysis, gas adsorption, proton conductivity, and drug release. As with zeolite preparation, the kinetic states in coordination network preparation play a crucial role in determining the final products. Controlling the kinetic state during self-assembly of coordination networks is a fundamental aspect of developing further functionalization of this class of materials. However, unlike for zeolites, there are few structural studies reporting the kinetic products made during self-assembly of coordination networks. Synthetic routes that produce the necessary selectivity are complex. The structural knowledge obtained from X-ray crystallography has been crucial for developing rational strategies for design of organic-inorganic hybrid networks. However, despite the explosive progress in the solid-state study of coordination networks during the last 15 years, researchers still do not understand many chemical reaction processes because of the difficulties in growing single crystals suitable for X-ray diffraction: Fast precipitation can lead to kinetic (metastable) products, but in microcrystalline form, unsuitable for single crystal X-ray analysis. X-ray powder diffraction (XRPD) routinely is used to check phase purity, crystallinity, and to monitor the stability of frameworks upon guest removal/inclusion under various conditions, but rarely is used for structure elucidation. Recent advances in structure determination of microcrystalline solids from ab initio XRPD have allowed three-dimensional structure determination when single crystals are not available. Thus, ab initio XRPD structure determination is becoming a powerful method for structure determination of microcrystalline solids, including porous coordination networks. Because of the great interest across scientific disciplines in coordination networks, especially porous coordination networks, the ability to determine crystal structures when the crystals are not suitable for single crystal X-ray analysis is of paramount importance. In this Account, we report the potential of kinetic control to synthesize new coordination networks and we describe ab initio XRPD structure determination to characterize these networks' crystal structures. We describe our recent work on selective instant synthesis to yield kinetically controlled porous coordination networks. We demonstrate that instant synthesis can selectively produce metastable networks that are not possible to synthesize by conventional solution chemistry. Using kinetic products, we provide mechanistic insights into thermally induced (573-723 K) (i.e., annealing method) structural transformations in porous coordination networks as well as examples of guest exchange/inclusion reactions. Finally, we describe a memory effect that allows the transfer of structural information from kinetic precursor structures to thermally stable structures through amorphous intermediate phases. We believe that ab initio XRPD structure determination will soon be used to investigate chemical processes that lead intrinsically to microcrystalline solids, which up to now have not been fully understood due to the unavailability of single crystals. For example, only recently have researchers used single-crystal X-ray diffraction to elucidate crystal-to-crystal chemical reactions taking place in the crystalline scaffold of coordination networks. The potential of ab initio X-ray powder diffraction analysis goes beyond single-crystal-to-single-crystal processes, potentially allowing members of this field to study intriguing in situ reactions, such as reactions within pores.

Static network structure can stabilize human cooperation.

PubMed

Rand, David G; Nowak, Martin A; Fowler, James H; Christakis, Nicholas A

2014-12-02

The evolution of cooperation in network-structured populations has been a major focus of theoretical work in recent years. When players are embedded in fixed networks, cooperators are more likely to interact with, and benefit from, other cooperators. In theory, this clustering can foster cooperation on fixed networks under certain circumstances. Laboratory experiments with humans, however, have thus far found no evidence that fixed network structure actually promotes cooperation. Here, we provide such evidence and help to explain why others failed to find it. First, we show that static networks can lead to a stable high level of cooperation, outperforming well-mixed populations. We then systematically vary the benefit that cooperating provides to one's neighbors relative to the cost required to cooperate (b/c), as well as the average number of neighbors in the network (k). When b/c > k, we observe high and stable levels of cooperation. Conversely, when b/c ≤ k or players are randomly shuffled, cooperation decays. Our results are consistent with a quantitative evolutionary game theoretic prediction for when cooperation should succeed on networks and, for the first time to our knowledge, provide an experimental demonstration of the power of static network structure for stabilizing human cooperation.

Static network structure can stabilize human cooperation

PubMed Central

Rand, David G.; Nowak, Martin A.; Fowler, James H.; Christakis, Nicholas A.

2014-01-01

The evolution of cooperation in network-structured populations has been a major focus of theoretical work in recent years. When players are embedded in fixed networks, cooperators are more likely to interact with, and benefit from, other cooperators. In theory, this clustering can foster cooperation on fixed networks under certain circumstances. Laboratory experiments with humans, however, have thus far found no evidence that fixed network structure actually promotes cooperation. Here, we provide such evidence and help to explain why others failed to find it. First, we show that static networks can lead to a stable high level of cooperation, outperforming well-mixed populations. We then systematically vary the benefit that cooperating provides to one’s neighbors relative to the cost required to cooperate (b/c), as well as the average number of neighbors in the network (k). When b/c > k, we observe high and stable levels of cooperation. Conversely, when b/c ≤ k or players are randomly shuffled, cooperation decays. Our results are consistent with a quantitative evolutionary game theoretic prediction for when cooperation should succeed on networks and, for the first time to our knowledge, provide an experimental demonstration of the power of static network structure for stabilizing human cooperation. PMID:25404308

Followers Are Not Enough: A Multifaceted Approach to Community Detection in Online Social Networks

PubMed Central

2015-01-01

In online social media networks, individuals often have hundreds or even thousands of connections, which link these users not only to friends, associates, and colleagues, but also to news outlets, celebrities, and organizations. In these complex social networks, a ‘community’ as studied in the social network literature, can have very different meaning depending on the property of the network under study. Taking into account the multifaceted nature of these networks, we claim that community detection in online social networks should also be multifaceted in order to capture all of the different and valuable viewpoints of ‘community.’ In this paper we focus on three types of communities beyond follower-based structural communities: activity-based, topic-based, and interaction-based. We analyze a Twitter dataset using three different weightings of the structural network meant to highlight these three community types, and then infer the communities associated with these weightings. We show that interesting insights can be obtained about the complex community structure present in social networks by studying when and how these four community types give rise to similar as well as completely distinct community structure. PMID:26267868

The Missing Part of Seed Dispersal Networks: Structure and Robustness of Bat-Fruit Interactions

PubMed Central

Mello, Marco Aurelio Ribeiro; Marquitti, Flávia Maria Darcie; Guimarães, Paulo Roberto; Kalko, Elisabeth Klara Viktoria; Jordano, Pedro; de Aguiar, Marcus Aloizio Martinez

2011-01-01

Mutualistic networks are crucial to the maintenance of ecosystem services. Unfortunately, what we know about seed dispersal networks is based only on bird-fruit interactions. Therefore, we aimed at filling part of this gap by investigating bat-fruit networks. It is known from population studies that: (i) some bat species depend more on fruits than others, and (ii) that some specialized frugivorous bats prefer particular plant genera. We tested whether those preferences affected the structure and robustness of the whole network and the functional roles of species. Nine bat-fruit datasets from the literature were analyzed and all networks showed lower complementary specialization (H2' = 0.37±0.10, mean ± SD) and similar nestedness (NODF = 0.56±0.12) than pollination networks. All networks were modular (M = 0.32±0.07), and had on average four cohesive subgroups (modules) of tightly connected bats and plants. The composition of those modules followed the genus-genus associations observed at population level (Artibeus-Ficus, Carollia-Piper, and Sturnira-Solanum), although a few of those plant genera were dispersed also by other bats. Bat-fruit networks showed high robustness to simulated cumulative removals of both bats (R = 0.55±0.10) and plants (R = 0.68±0.09). Primary frugivores interacted with a larger proportion of the plants available and also occupied more central positions; furthermore, their extinction caused larger changes in network structure. We conclude that bat-fruit networks are highly cohesive and robust mutualistic systems, in which redundancy is high within modules, although modules are complementary to each other. Dietary specialization seems to be an important structuring factor that affects the topology, the guild structure and functional roles in bat-fruit networks. PMID:21386981

The missing part of seed dispersal networks: structure and robustness of bat-fruit interactions.

PubMed

Mello, Marco Aurelio Ribeiro; Marquitti, Flávia Maria Darcie; Guimarães, Paulo Roberto; Kalko, Elisabeth Klara Viktoria; Jordano, Pedro; de Aguiar, Marcus Aloizio Martinez

2011-02-28

Mutualistic networks are crucial to the maintenance of ecosystem services. Unfortunately, what we know about seed dispersal networks is based only on bird-fruit interactions. Therefore, we aimed at filling part of this gap by investigating bat-fruit networks. It is known from population studies that: (i) some bat species depend more on fruits than others, and (ii) that some specialized frugivorous bats prefer particular plant genera. We tested whether those preferences affected the structure and robustness of the whole network and the functional roles of species. Nine bat-fruit datasets from the literature were analyzed and all networks showed lower complementary specialization (H(2)' = 0.37±0.10, mean ± SD) and similar nestedness (NODF = 0.56±0.12) than pollination networks. All networks were modular (M = 0.32±0.07), and had on average four cohesive subgroups (modules) of tightly connected bats and plants. The composition of those modules followed the genus-genus associations observed at population level (Artibeus-Ficus, Carollia-Piper, and Sturnira-Solanum), although a few of those plant genera were dispersed also by other bats. Bat-fruit networks showed high robustness to simulated cumulative removals of both bats (R = 0.55±0.10) and plants (R = 0.68±0.09). Primary frugivores interacted with a larger proportion of the plants available and also occupied more central positions; furthermore, their extinction caused larger changes in network structure. We conclude that bat-fruit networks are highly cohesive and robust mutualistic systems, in which redundancy is high within modules, although modules are complementary to each other. Dietary specialization seems to be an important structuring factor that affects the topology, the guild structure and functional roles in bat-fruit networks.

Network resilience in the face of health system reform.

PubMed

Sheaff, Rod; Benson, Lawrence; Farbus, Lou; Schofield, Jill; Mannion, Russell; Reeves, David

2010-03-01

Many health systems now use networks as governance structures. Network 'macroculture' is the complex of artefacts, espoused values and unarticulated assumptions through which network members coordinate network activities. Knowledge of how network macroculture during 2006-2008 develops is therefore of value for understanding how health networks operate, how health system reforms affect them, and how networks function (and can be used) as governance structures. To examine how quasi-market reforms impact upon health networks' macrocultures we systematically compared longitudinal case studies of these impacts across two care networks, a programme network and a user-experience network in the English NHS. We conducted interviews with key informants, focus groups, non-participant observations of meetings and analyses of key documents. We found that in these networks, artefacts adapted to health system reform faster than espoused values did, and the latter adapted faster than basic underlying assumptions. These findings contribute to knowledge by providing empirical support for theories which hold that changes in networks' core practical activity are what stimulate changes in other aspects of network macroculture. The most powerful way of using network macroculture to manage the formation and operation of health networks therefore appears to be by focusing managerial activity on the ways in which networks produce their core artefacts. 2009 Elsevier Ltd. All rights reserved.

Computational Modeling of Allosteric Regulation in the Hsp90 Chaperones: A Statistical Ensemble Analysis of Protein Structure Networks and Allosteric Communications

PubMed Central

Blacklock, Kristin; Verkhivker, Gennady M.

2014-01-01

A fundamental role of the Hsp90 chaperone in regulating functional activity of diverse protein clients is essential for the integrity of signaling networks. In this work we have combined biophysical simulations of the Hsp90 crystal structures with the protein structure network analysis to characterize the statistical ensemble of allosteric interaction networks and communication pathways in the Hsp90 chaperones. We have found that principal structurally stable communities could be preserved during dynamic changes in the conformational ensemble. The dominant contribution of the inter-domain rigidity to the interaction networks has emerged as a common factor responsible for the thermodynamic stability of the active chaperone form during the ATPase cycle. Structural stability analysis using force constant profiling of the inter-residue fluctuation distances has identified a network of conserved structurally rigid residues that could serve as global mediating sites of allosteric communication. Mapping of the conformational landscape with the network centrality parameters has demonstrated that stable communities and mediating residues may act concertedly with the shifts in the conformational equilibrium and could describe the majority of functionally significant chaperone residues. The network analysis has revealed a relationship between structural stability, global centrality and functional significance of hotspot residues involved in chaperone regulation. We have found that allosteric interactions in the Hsp90 chaperone may be mediated by modules of structurally stable residues that display high betweenness in the global interaction network. The results of this study have suggested that allosteric interactions in the Hsp90 chaperone may operate via a mechanism that combines rapid and efficient communication by a single optimal pathway of structurally rigid residues and more robust signal transmission using an ensemble of suboptimal multiple communication routes. This may be a universal requirement encoded in protein structures to balance the inherent tension between resilience and efficiency of the residue interaction networks. PMID:24922508

Computational modeling of allosteric regulation in the hsp90 chaperones: a statistical ensemble analysis of protein structure networks and allosteric communications.

PubMed

Blacklock, Kristin; Verkhivker, Gennady M

2014-06-01

A fundamental role of the Hsp90 chaperone in regulating functional activity of diverse protein clients is essential for the integrity of signaling networks. In this work we have combined biophysical simulations of the Hsp90 crystal structures with the protein structure network analysis to characterize the statistical ensemble of allosteric interaction networks and communication pathways in the Hsp90 chaperones. We have found that principal structurally stable communities could be preserved during dynamic changes in the conformational ensemble. The dominant contribution of the inter-domain rigidity to the interaction networks has emerged as a common factor responsible for the thermodynamic stability of the active chaperone form during the ATPase cycle. Structural stability analysis using force constant profiling of the inter-residue fluctuation distances has identified a network of conserved structurally rigid residues that could serve as global mediating sites of allosteric communication. Mapping of the conformational landscape with the network centrality parameters has demonstrated that stable communities and mediating residues may act concertedly with the shifts in the conformational equilibrium and could describe the majority of functionally significant chaperone residues. The network analysis has revealed a relationship between structural stability, global centrality and functional significance of hotspot residues involved in chaperone regulation. We have found that allosteric interactions in the Hsp90 chaperone may be mediated by modules of structurally stable residues that display high betweenness in the global interaction network. The results of this study have suggested that allosteric interactions in the Hsp90 chaperone may operate via a mechanism that combines rapid and efficient communication by a single optimal pathway of structurally rigid residues and more robust signal transmission using an ensemble of suboptimal multiple communication routes. This may be a universal requirement encoded in protein structures to balance the inherent tension between resilience and efficiency of the residue interaction networks.

Influence networks among substance abuse treatment clinics: implications for the dissemination of innovations.

PubMed

Johnson, Kimberly; Quanbeck, Andrew; Maus, Adam; Gustafson, David H; Dearing, James W

2015-09-01

Understanding influence networks among substance abuse treatment clinics may speed the diffusion of innovations. The purpose of this study was to describe influence networks in Massachusetts, Michigan, New York, Oregon, and Washington and test two expectations, using social network analysis: (1) Social network measures can identify influential clinics; and (2) Within a network, some weakly connected clinics access out-of-network sources of innovative evidence-based practices and can spread these innovations through the network. A survey of 201 clinics in a parent study on quality improvement provided the data. Network measures and sociograms were obtained from adjacency matrixes created by UCINet. We used regression analysis to determine whether network status relates to clinics' adopting innovations. Findings suggest that influential clinics can be identified and that loosely linked clinics were likely to join the study sooner than more influential clinics but were not more likely to have improved outcomes than other organizations. Findings identify the structure of influence networks for SUD treatment organizations and have mixed results on how those structures impacted diffusion of the intervention under study. Further study is necessary to test whether use of knowledge of the network structure will have an effect on the pace and breadth of dissemination of innovations.

Mental health network governance: comparative analysis across Canadian regions.

PubMed

Wiktorowicz, Mary E; Fleury, Marie-Josée; Adair, Carol E; Lesage, Alain; Goldner, Elliot; Peters, Suzanne

2010-10-26

Modes of governance were compared in ten local mental health networks in diverse contexts (rural/urban and regionalized/non-regionalized) to clarify the governance processes that foster inter-organizational collaboration and the conditions that support them. Case studies of ten local mental health networks were developed using qualitative methods of document review, semi-structured interviews and focus groups that incorporated provincial policy, network and organizational levels of analysis. Mental health networks adopted either a corporate structure, mutual adjustment or an alliance governance model. A corporate structure supported by regionalization offered the most direct means for local governance to attain inter-organizational collaboration. The likelihood that networks with an alliance model developed coordination processes depended on the presence of the following conditions: a moderate number of organizations, goal consensus and trust among the organizations, and network-level competencies. In the small and mid-sized urban networks where these conditions were met their alliance realized the inter-organizational collaboration sought. In the large urban and rural networks where these conditions were not met, externally brokered forms of network governance were required to support alliance based models. In metropolitan and rural networks with such shared forms of network governance as an alliance or voluntary mutual adjustment, external mediation by a regional or provincial authority was an important lever to foster inter-organizational collaboration.

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

NASA Technical Reports Server (NTRS)

Conway, Sheila R.

2004-01-01

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

Establishing a Dynamic Self-Adaptation Learning Algorithm of the BP Neural Network and Its Applications

NASA Astrophysics Data System (ADS)

Li, Xiaofeng; Xiang, Suying; Zhu, Pengfei; Wu, Min

2015-12-01

In order to avoid the inherent deficiencies of the traditional BP neural network, such as slow convergence speed, that easily leading to local minima, poor generalization ability and difficulty in determining the network structure, the dynamic self-adaptive learning algorithm of the BP neural network is put forward to improve the function of the BP neural network. The new algorithm combines the merit of principal component analysis, particle swarm optimization, correlation analysis and self-adaptive model, hence can effectively solve the problems of selecting structural parameters, initial connection weights and thresholds and learning rates of the BP neural network. This new algorithm not only reduces the human intervention, optimizes the topological structures of BP neural networks and improves the network generalization ability, but also accelerates the convergence speed of a network, avoids trapping into local minima, and enhances network adaptation ability and prediction ability. The dynamic self-adaptive learning algorithm of the BP neural network is used to forecast the total retail sale of consumer goods of Sichuan Province, China. Empirical results indicate that the new algorithm is superior to the traditional BP network algorithm in predicting accuracy and time consumption, which shows the feasibility and effectiveness of the new algorithm.

Community structure from spectral properties in complex networks

NASA Astrophysics Data System (ADS)

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.

Connecting Core Percolation and Controllability of Complex Networks

PubMed Central

Jia, Tao; Pósfai, Márton

2014-01-01

Core percolation is a fundamental structural transition in complex networks related to a wide range of important problems. Recent advances have provided us an analytical framework of core percolation in uncorrelated random networks with arbitrary degree distributions. Here we apply the tools in analysis of network controllability. We confirm analytically that the emergence of the bifurcation in control coincides with the formation of the core and the structure of the core determines the control mode of the network. We also derive the analytical expression related to the controllability robustness by extending the deduction in core percolation. These findings help us better understand the interesting interplay between the structural and dynamical properties of complex networks. PMID:24946797

Collective network for computer structures

DOEpatents

Blumrich, Matthias A; Coteus, Paul W; Chen, Dong; Gara, Alan; Giampapa, Mark E; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd E; Steinmacher-Burow, Burkhard D; Vranas, Pavlos M

2014-01-07

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 are 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. 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 the needs of a processing algorithm.

An evolutionary algorithm that constructs recurrent neural networks.

PubMed

Angeline, P J; Saunders, G M; Pollack, J B

1994-01-01

Standard methods for simultaneously inducing the structure and weights of recurrent neural networks limit every task to an assumed class of architectures. Such a simplification is necessary since the interactions between network structure and function are not well understood. Evolutionary computations, which include genetic algorithms and evolutionary programming, are population-based search methods that have shown promise in many similarly complex tasks. This paper argues that genetic algorithms are inappropriate for network acquisition and describes an evolutionary program, called GNARL, that simultaneously acquires both the structure and weights for recurrent networks. GNARL's empirical acquisition method allows for the emergence of complex behaviors and topologies that are potentially excluded by the artificial architectural constraints imposed in standard network induction methods.

Hierarchical organization of brain functional networks during visual tasks.

PubMed

Zhuo, Zhao; Cai, Shi-Min; Fu, Zhong-Qian; Zhang, Jie

2011-09-01

The functional network of the brain is known to demonstrate modular structure over different hierarchical scales. In this paper, we systematically investigated the hierarchical modular organizations of the brain functional networks that are derived from the extent of phase synchronization among high-resolution EEG time series during a visual task. In particular, we compare the modular structure of the functional network from EEG channels with that of the anatomical parcellation of the brain cortex. Our results show that the modular architectures of brain functional networks correspond well to those from the anatomical structures over different levels of hierarchy. Most importantly, we find that the consistency between the modular structures of the functional network and the anatomical network becomes more pronounced in terms of vision, sensory, vision-temporal, motor cortices during the visual task, which implies that the strong modularity in these areas forms the functional basis for the visual task. The structure-function relationship further reveals that the phase synchronization of EEG time series in the same anatomical group is much stronger than that of EEG time series from different anatomical groups during the task and that the hierarchical organization of functional brain network may be a consequence of functional segmentation of the brain cortex.

Efficient discovery of overlapping communities in massive networks

PubMed Central

Gopalan, Prem K.; Blei, David M.

2013-01-01

Detecting overlapping communities is essential to analyzing and exploring natural networks such as social networks, biological networks, and citation networks. However, most existing approaches do not scale to the size of networks that we regularly observe in the real world. In this paper, we develop a scalable approach to community detection that discovers overlapping communities in massive real-world networks. Our approach is based on a Bayesian model of networks that allows nodes to participate in multiple communities, and a corresponding algorithm that naturally interleaves subsampling from the network and updating an estimate of its communities. We demonstrate how we can discover the hidden community structure of several real-world networks, including 3.7 million US patents, 575,000 physics articles from the arXiv preprint server, and 875,000 connected Web pages from the Internet. Furthermore, we demonstrate on large simulated networks that our algorithm accurately discovers the true community structure. This paper opens the door to using sophisticated statistical models to analyze massive networks. PMID:23950224

Structural and robustness properties of smart-city transportation networks

NASA Astrophysics Data System (ADS)

Zhang, Zhen-Gang; Ding, Zhuo; Fan, Jing-Fang; Meng, Jun; Ding, Yi-Min; Ye, Fang-Fu; Chen, Xiao-Song

2015-09-01

The concept of smart city gives an excellent resolution to construct and develop modern cities, and also demands infrastructure construction. How to build a safe, stable, and highly efficient public transportation system becomes an important topic in the process of city construction. In this work, we study the structural and robustness properties of transportation networks and their sub-networks. We introduce a complementary network model to study the relevance and complementarity between bus network and subway network. Our numerical results show that the mutual supplement of networks can improve the network robustness. This conclusion provides a theoretical basis for the construction of public traffic networks, and it also supports reasonable operation of managing smart cities. Project supported by the Major Projects of the China National Social Science Fund (Grant No. 11 & ZD154).

Transnational cocaine and heroin flow networks in western Europe: A comparison.

PubMed

Chandra, Siddharth; Joba, Johnathan

2015-08-01

A comparison of the properties of drug flow networks for cocaine and heroin in a group of 17 western European countries is provided with the aim of understanding the implications of their similarities and differences for drug policy. Drug flow data for the cocaine and heroin networks were analyzed using the UCINET software package. Country-level characteristics including hub and authority scores, core and periphery membership, and centrality, and network-level characteristics including network density, the results of a triad census, and the final fitness of the core-periphery structure of the network, were computed and compared between the two networks. The cocaine network contains fewer path redundancies and a smaller, more tightly knit core than the heroin network. Authorities, hubs and countries central to the cocaine network tend to have higher hub, authority, and centrality scores than those in the heroin network. The core-periphery and hub-authority structures of the cocaine and heroin networks reflect the west-to-east and east-to-west patterns of flow of cocaine and heroin respectively across Europe. The key nodes in the cocaine and heroin networks are generally distinct from one another. The analysis of drug flow networks can reveal important structural features of trafficking networks that can be useful for the allocation of scarce drug control resources. The identification of authorities, hubs, network cores, and network-central nodes can suggest foci for the allocation of these resources. In the case of Europe, while some countries are important to both cocaine and heroin networks, different sets of countries occupy positions of prominence in the two networks. The distinct nature of the cocaine and heroin networks also suggests that a one-size-fits-all supply- and interdiction-focused policy may not work as well as an approach that takes into account the particular characteristics of each network. Copyright © 2015 Elsevier B.V. All rights reserved.

Processes entangling interactions in communities: forbidden links are more important than abundance in a hummingbird-plant network.

PubMed

Vizentin-Bugoni, Jeferson; Maruyama, Pietro Kiyoshi; Sazima, Marlies

2014-04-07

Understanding the relative importance of multiple processes on structuring species interactions within communities is one of the major challenges in ecology. Here, we evaluated the relative importance of species abundance and forbidden links in structuring a hummingbird-plant interaction network from the Atlantic rainforest in Brazil. Our results show that models incorporating phenological overlapping and morphological matches were more accurate in predicting the observed interactions than models considering species abundance. This means that forbidden links, by imposing constraints on species interactions, play a greater role than species abundance in structuring the ecological network. We also show that using the frequency of interaction as a proxy for species abundance and network metrics to describe the detailed network structure might lead to biased conclusions regarding mechanisms generating network structure. Together, our findings suggest that species abundance can be a less important driver of species interactions in communities than previously thought.

Processes entangling interactions in communities: forbidden links are more important than abundance in a hummingbird–plant network

PubMed Central

Vizentin-Bugoni, Jeferson; Maruyama, Pietro Kiyoshi; Sazima, Marlies

2014-01-01

Understanding the relative importance of multiple processes on structuring species interactions within communities is one of the major challenges in ecology. Here, we evaluated the relative importance of species abundance and forbidden links in structuring a hummingbird–plant interaction network from the Atlantic rainforest in Brazil. Our results show that models incorporating phenological overlapping and morphological matches were more accurate in predicting the observed interactions than models considering species abundance. This means that forbidden links, by imposing constraints on species interactions, play a greater role than species abundance in structuring the ecological network. We also show that using the frequency of interaction as a proxy for species abundance and network metrics to describe the detailed network structure might lead to biased conclusions regarding mechanisms generating network structure. Together, our findings suggest that species abundance can be a less important driver of species interactions in communities than previously thought. PMID:24552835

Brain structural covariance network centrality in maltreated youth with PTSD and in maltreated youth resilient to PTSD.

PubMed

Sun, Delin; Haswell, Courtney C; Morey, Rajendra A; De Bellis, Michael D

2018-04-10

Child maltreatment is a major cause of pediatric posttraumatic stress disorder (PTSD). Previous studies have not investigated potential differences in network architecture in maltreated youth with PTSD and those resilient to PTSD. High-resolution magnetic resonance imaging brain scans at 3 T were completed in maltreated youth with PTSD (n = 31), without PTSD (n = 32), and nonmaltreated controls (n = 57). Structural covariance network architecture was derived from between-subject intraregional correlations in measures of cortical thickness in 148 cortical regions (nodes). Interregional positive partial correlations controlling for demographic variables were assessed, and those correlations that exceeded specified thresholds constituted connections in cortical brain networks. Four measures of network centrality characterized topology, and the importance of cortical regions (nodes) within the network architecture were calculated for each group. Permutation testing and principle component analysis method were employed to calculate between-group differences. Principle component analysis is a methodological improvement to methods used in previous brain structural covariance network studies. Differences in centrality were observed between groups. Larger centrality was found in maltreated youth with PTSD in the right posterior cingulate cortex; smaller centrality was detected in the right inferior frontal cortex compared to youth resilient to PTSD and controls, demonstrating network characteristics unique to pediatric maltreatment-related PTSD. Larger centrality was detected in right frontal pole in maltreated youth resilient to PTSD compared to youth with PTSD and controls, demonstrating structural covariance network differences in youth resilience to PTSD following maltreatment. Smaller centrality was found in the left posterior cingulate cortex and in the right inferior frontal cortex in maltreated youth compared to controls, demonstrating attributes of structural covariance network topology that is unique to experiencing maltreatment. This work is the first to identify cortical thickness-based structural covariance network differences between maltreated youth with and without PTSD. We demonstrated network differences in both networks unique to maltreated youth with PTSD and those resilient to PTSD. The networks identified are important for the successful attainment of age-appropriate social cognition, attention, emotional processing, and inhibitory control. Our findings in maltreated youth with PTSD versus those without PTSD suggest vulnerability mechanisms for developing PTSD.

Social networks and health: a systematic review of sociocentric network studies in low- and middle-income countries.

PubMed

Perkins, Jessica M; Subramanian, S V; Christakis, Nicholas A

2015-01-01

In low- and middle-income countries (LMICs), naturally occurring social networks may be particularly vital to health outcomes as extended webs of social ties often are the principal source of various resources. Understanding how social network structure, and influential individuals within the network, may amplify the effects of interventions in LMICs, by creating, for example, cascade effects to non-targeted participants, presents an opportunity to improve the efficiency and effectiveness of public health interventions in such settings. We conducted a systematic review of PubMed, Econlit, Sociological Abstracts, and PsycINFO to identify a sample of 17 sociocentric network papers (arising from 10 studies) that specifically examined health issues in LMICs. We also separately selected to review 19 sociocentric network papers (arising from 10 other studies) on development topics related to wellbeing in LMICs. First, to provide a methodological resource, we discuss the sociocentric network study designs employed in the selected papers, and then provide a catalog of 105 name generator questions used to measure social ties across all the LMIC network papers (including both ego- and sociocentric network papers) cited in this review. Second, we show that network composition, individual network centrality, and network structure are associated with important health behaviors and health and development outcomes in different contexts across multiple levels of analysis and across distinct network types. Lastly, we highlight the opportunities for health researchers and practitioners in LMICs to 1) design effective studies and interventions in LMICs that account for the sociocentric network positions of certain individuals and overall network structure, 2) measure the spread of outcomes or intervention externalities, and 3) enhance the effectiveness and efficiency of aid based on knowledge of social structure. In summary, human health and wellbeing are connected through complex webs of dynamic social relationships. Harnessing such information may be especially important in contexts where resources are limited and people depend on their direct and indirect connections for support. Copyright © 2014 Elsevier Ltd. All rights reserved.

Social Networks and Health: A Systematic Review of Sociocentric Network Studies in Low- and Middle-Income Countries

PubMed Central

Perkins, Jessica M; Subramanian, S V; Christakis, Nicholas A

2015-01-01

In low- and middle-income countries (LMICs), naturally occurring social networks may be particularly vital to health outcomes as extended webs of social ties often are the principal source of various resources. Understanding how social network structure, and influential individuals within the network, may amplify the effects of interventions in LMICs, by creating, for example, cascade effects to non-targeted participants, presents an opportunity to improve the efficiency and effectiveness of public health interventions in such settings. We conducted a systematic review of PubMed, Econlit, Sociological Abstracts, and PsycINFO to identify a sample of 17 sociocentric network papers (arising from 10 studies) that specifically examined health issues in LMICs. We also separately selected to review 19 sociocentric network papers (arising from 10 other studies) on development topics related to wellbeing in LMICs. First, to provide a methodological resource, we discuss the sociocentric network study designs employed in the selected papers, and then provide a catalog of 105 name generator questions used to measure social ties across all the LMIC network papers (including both ego- and sociocentric network papers) cited in this review. Second, we show that network composition, individual network centrality, and network structure are associated with important health behaviors and health and development outcomes in different contexts across multiple levels of analysis and across distinct network types. Lastly, we highlight the opportunities for health researchers and practitioners in LMICs to 1) design effective studies and interventions in LMICs that account for the sociocentric network positions of certain individuals and overall network structure, 2) measure the spread of outcomes or intervention externalities, and 3) enhance the effectiveness and efficiency of aid based on knowledge of social structure. In summary, human health and wellbeing are connected through complex webs of dynamic social relationships. Harnessing such information may be especially important in contexts where resources are limited and people depend on their direct and indirect connections for support. PMID:25442969

Disrupted functional and structural networks in cognitively normal elderly subjects with the APOE ɛ4 allele.

PubMed

Chen, Yaojing; Chen, Kewei; Zhang, Junying; Li, Xin; Shu, Ni; Wang, Jun; Zhang, Zhanjun; Reiman, Eric M

2015-03-13

As the Apolipoprotein E (APOE) ɛ4 allele is a major genetic risk factor for sporadic Alzheimer's disease (AD), which has been suggested as a disconnection syndrome manifested by the disruption of white matter (WM) integrity and functional connectivity (FC), elucidating the subtle brain structural and functional network changes in cognitively normal ɛ4 carriers is essential for identifying sensitive neuroimaging based biomarkers and understanding the preclinical AD-related abnormality development. We first constructed functional network on the basis of resting-state functional magnetic resonance imaging and a structural network on the basis of diffusion tensor image. Using global, local and nodal efficiencies of these two networks, we then examined (i) the differences of functional and WM structural network between cognitively normal ɛ4 carriers and non-carriers simultaneously, (ii) the sensitivity of these indices as biomarkers, and (iii) their relationship to behavior measurements, as well as to cholesterol level. For ɛ4 carriers, we found reduced global efficiency significantly in WM and marginally in FC, regional FC dysfunctions mainly in medial temporal areas, and more widespread for WM network. Importantly, the right parahippocampal gyrus (PHG.R) was the only region with simultaneous functional and structural damage, and the nodal efficiency of PHG.R in WM network mediates the APOE ɛ4 effect on memory function. Finally, the cholesterol level correlated with WM network differently than with the functional network in ɛ4 carriers. Our results demonstrated ɛ4-specific abnormal structural and functional patterns, which may potentially serve as biomarkers for early detection before the onset of the disease.

Epidemics in adaptive networks with community structure

NASA Astrophysics Data System (ADS)

Shaw, Leah; Tunc, Ilker

2010-03-01

Models for epidemic spread on static social networks do not account for changes in individuals' social interactions. Recent studies of adaptive networks have modeled avoidance behavior, as non-infected individuals try to avoid contact with infectives. Such models have not generally included realistic social structure. Here we study epidemic spread on an adaptive network with community structure. We model the effect of heterogeneous communities on infection levels and epidemic extinction. We also show how an epidemic can alter the community structure.

Surveying hospital network structure in New York State: how are they structured?

PubMed

Nauenberg, E; Brewer, C S

2000-01-01

We determine the most common network structures in New York state. The taxonomy employed uses three structural dimensions: integration, complexity, and risk-sharing between organizations. Based on a survey conducted in 1996, the most common type of network (26.4 percent) had medium levels of integration, medium or high levels of complexity, and some risk-sharing. Also common were networks with low levels of integration, low levels of complexity, and no risk-sharing (22.1 percent).

Inter-subject FDG PET Brain Networks Exhibit Multi-scale Community Structure with Different Normalization Techniques.

PubMed

Sperry, Megan M; Kartha, Sonia; Granquist, Eric J; Winkelstein, Beth A

2018-07-01

Inter-subject networks are used to model correlations between brain regions and are particularly useful for metabolic imaging techniques, like 18F-2-deoxy-2-(18F)fluoro-D-glucose (FDG) positron emission tomography (PET). Since FDG PET typically produces a single image, correlations cannot be calculated over time. Little focus has been placed on the basic properties of inter-subject networks and if they are affected by group size and image normalization. FDG PET images were acquired from rats (n = 18), normalized by whole brain, visual cortex, or cerebellar FDG uptake, and used to construct correlation matrices. Group size effects on network stability were investigated by systematically adding rats and evaluating local network connectivity (node strength and clustering coefficient). Modularity and community structure were also evaluated in the differently normalized networks to assess meso-scale network relationships. Local network properties are stable regardless of normalization region for groups of at least 10. Whole brain-normalized networks are more modular than visual cortex- or cerebellum-normalized network (p < 0.00001); however, community structure is similar at network resolutions where modularity differs most between brain and randomized networks. Hierarchical analysis reveals consistent modules at different scales and clustering of spatially-proximate brain regions. Findings suggest inter-subject FDG PET networks are stable for reasonable group sizes and exhibit multi-scale modularity.

Internal Capabilities, External Network Position, and Knowledge Creation

ERIC Educational Resources Information Center

Liao, Yin-Chi

2010-01-01

Despite the general consensus on the importance of interfirm networks, there is an ongoing debate centering on which type of network structure is most beneficial to firm performance. While spanning structural holes--a network position with disconnected partners--is argued to be advantageous in terms of providing access to diverse knowledge,…

Decomposition of metabolic network into functional modules based on the global connectivity structure of reaction graph.

PubMed

Ma, Hong-Wu; Zhao, Xue-Ming; Yuan, Ying-Jin; Zeng, An-Ping

2004-08-12

Metabolic networks are organized in a modular, hierarchical manner. Methods for a rational decomposition of the metabolic network into relatively independent functional subsets are essential to better understand the modularity and organization principle of a large-scale, genome-wide network. Network decomposition is also necessary for functional analysis of metabolism by pathway analysis methods that are often hampered by the problem of combinatorial explosion due to the complexity of metabolic network. Decomposition methods proposed in literature are mainly based on the connection degree of metabolites. To obtain a more reasonable decomposition, the global connectivity structure of metabolic networks should be taken into account. In this work, we use a reaction graph representation of a metabolic network for the identification of its global connectivity structure and for decomposition. A bow-tie connectivity structure similar to that previously discovered for metabolite graph is found also to exist in the reaction graph. Based on this bow-tie structure, a new decomposition method is proposed, which uses a distance definition derived from the path length between two reactions. An hierarchical classification tree is first constructed from the distance matrix among the reactions in the giant strong component of the bow-tie structure. These reactions are then grouped into different subsets based on the hierarchical tree. Reactions in the IN and OUT subsets of the bow-tie structure are subsequently placed in the corresponding subsets according to a 'majority rule'. Compared with the decomposition methods proposed in literature, ours is based on combined properties of the global network structure and local reaction connectivity rather than, primarily, on the connection degree of metabolites. The method is applied to decompose the metabolic network of Escherichia coli. Eleven subsets are obtained. More detailed investigations of the subsets show that reactions in the same subset are really functionally related. The rational decomposition of metabolic networks, and subsequent studies of the subsets, make it more amenable to understand the inherent organization and functionality of metabolic networks at the modular level. http://genome.gbf.de/bioinformatics/

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks IV: structuring synaptic pathways among recurrent connections.

PubMed

Gilson, Matthieu; Burkitt, Anthony N; Grayden, David B; Thomas, Doreen A; van Hemmen, J Leo

2009-12-01

In neuronal networks, the changes of synaptic strength (or weight) performed by spike-timing-dependent plasticity (STDP) are hypothesized to give rise to functional network structure. This article investigates how this phenomenon occurs for the excitatory recurrent connections of a network with fixed input weights that is stimulated by external spike trains. We develop a theoretical framework based on the Poisson neuron model to analyze the interplay between the neuronal activity (firing rates and the spike-time correlations) and the learning dynamics, when the network is stimulated by correlated pools of homogeneous Poisson spike trains. STDP can lead to both a stabilization of all the neuron firing rates (homeostatic equilibrium) and a robust weight specialization. The pattern of specialization for the recurrent weights is determined by a relationship between the input firing-rate and correlation structures, the network topology, the STDP parameters and the synaptic response properties. We find conditions for feed-forward pathways or areas with strengthened self-feedback to emerge in an initially homogeneous recurrent network.

Impact of constrained rewiring on network structure and node dynamics

NASA Astrophysics Data System (ADS)

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.

Clustered marginalization of minorities during social transitions induced by co-evolution of behaviour and network structure

PubMed Central

Schleussner, Carl-Friedrich; Donges, Jonathan F.; Engemann, Denis A.; Levermann, Anders

2016-01-01

Large-scale transitions in societies are associated with both individual behavioural change and restructuring of the social network. These two factors have often been considered independently, yet recent advances in social network research challenge this view. Here we show that common features of societal marginalization and clustering emerge naturally during transitions in a co-evolutionary adaptive network model. This is achieved by explicitly considering the interplay between individual interaction and a dynamic network structure in behavioural selection. We exemplify this mechanism by simulating how smoking behaviour and the network structure get reconfigured by changing social norms. Our results are consistent with empirical findings: The prevalence of smoking was reduced, remaining smokers were preferentially connected among each other and formed increasingly marginalized clusters. We propose that self-amplifying feedbacks between individual behaviour and dynamic restructuring of the network are main drivers of the transition. This generative mechanism for co-evolution of individual behaviour and social network structure may apply to a wide range of examples beyond smoking. PMID:27510641

A network model of the interbank market

NASA Astrophysics Data System (ADS)

Li, Shouwei; He, Jianmin; Zhuang, Yaming

2010-12-01

This work introduces a network model of an interbank market based on interbank credit lending relationships. It generates some network features identified through empirical analysis. The critical issue to construct an interbank network is to decide the edges among banks, which is realized in this paper based on the interbank’s degree of trust. Through simulation analysis of the interbank network model, some typical structural features are identified in our interbank network, which are also proved to exist in real interbank networks. They are namely, a low clustering coefficient and a relatively short average path length, community structures, and a two-power-law distribution of out-degree and in-degree.

Resolving Structural Variability in Network Models and the Brain

PubMed Central

Klimm, Florian; Bassett, Danielle S.; Carlson, Jean M.; Mucha, Peter J.

2014-01-01

Large-scale white matter pathways crisscrossing the cortex create a complex pattern of connectivity that underlies human cognitive function. Generative mechanisms for this architecture have been difficult to identify in part because little is known in general about mechanistic drivers of structured networks. Here we contrast network properties derived from diffusion spectrum imaging data of the human brain with 13 synthetic network models chosen to probe the roles of physical network embedding and temporal network growth. We characterize both the empirical and synthetic networks using familiar graph metrics, but presented here in a more complete statistical form, as scatter plots and distributions, to reveal the full range of variability of each measure across scales in the network. We focus specifically on the degree distribution, degree assortativity, hierarchy, topological Rentian scaling, and topological fractal scaling—in addition to several summary statistics, including the mean clustering coefficient, the shortest path-length, and the network diameter. The models are investigated in a progressive, branching sequence, aimed at capturing different elements thought to be important in the brain, and range from simple random and regular networks, to models that incorporate specific growth rules and constraints. We find that synthetic models that constrain the network nodes to be physically embedded in anatomical brain regions tend to produce distributions that are most similar to the corresponding measurements for the brain. We also find that network models hardcoded to display one network property (e.g., assortativity) do not in general simultaneously display a second (e.g., hierarchy). This relative independence of network properties suggests that multiple neurobiological mechanisms might be at play in the development of human brain network architecture. Together, the network models that we develop and employ provide a potentially useful starting point for the statistical inference of brain network structure from neuroimaging data. PMID:24675546

A comparative study of theoretical graph models for characterizing structural networks of human brain.

PubMed

Li, Xiaojin; Hu, Xintao; Jin, Changfeng; Han, Junwei; Liu, Tianming; Guo, Lei; Hao, Wei; Li, Lingjiang

2013-01-01

Previous studies have investigated both structural and functional brain networks via graph-theoretical methods. However, there is an important issue that has not been adequately discussed before: what is the optimal theoretical graph model for describing the structural networks of human brain? In this paper, we perform a comparative study to address this problem. Firstly, large-scale cortical regions of interest (ROIs) are localized by recently developed and validated brain reference system named Dense Individualized Common Connectivity-based Cortical Landmarks (DICCCOL) to address the limitations in the identification of the brain network ROIs in previous studies. Then, we construct structural brain networks based on diffusion tensor imaging (DTI) data. Afterwards, the global and local graph properties of the constructed structural brain networks are measured using the state-of-the-art graph analysis algorithms and tools and are further compared with seven popular theoretical graph models. In addition, we compare the topological properties between two graph models, namely, stickiness-index-based model (STICKY) and scale-free gene duplication model (SF-GD), that have higher similarity with the real structural brain networks in terms of global and local graph properties. Our experimental results suggest that among the seven theoretical graph models compared in this study, STICKY and SF-GD models have better performances in characterizing the structural human brain network.

Disruptions of brain structural network in end-stage renal disease patients with long-term hemodialysis and normal-appearing brain tissues.

PubMed

Chou, Ming-Chung; Ko, Chih-Hung; Chang, Jer-Ming; Hsieh, Tsyh-Jyi

2018-05-04

End-stage renal disease (ESRD) patients on hemodialysis were demonstrated to exhibit silent and invisible white-matter alterations which would likely lead to disruptions of brain structural networks. Therefore, the purpose of this study was to investigate the disruptions of brain structural network in ESRD patients. Thiry-three ESRD patients with normal-appearing brain tissues and 29 age- and gender-matched healthy controls were enrolled in this study and underwent both cognitive ability screening instrument (CASI) assessment and diffusion tensor imaging (DTI) acquisition. Brain structural connectivity network was constructed using probabilistic tractography with automatic anatomical labeling template. Graph-theory analysis was performed to detect the alterations of node-strength, node-degree, node-local efficiency, and node-clustering coefficient in ESRD patients. Correlational analysis was performed to understand the relationship between network measures, CASI score, and dialysis duration. Structural connectivity, node-strength, node-degree, and node-local efficiency were significantly decreased, whereas node-clustering coefficient was significantly increased in ESRD patients as compared with healthy controls. The disrupted local structural networks were generally associated with common neurological complications of ESRD patients, but the correlational analysis did not reveal significant correlation between network measures, CASI score, and dialysis duration. Graph-theory analysis was helpful to investigate disruptions of brain structural network in ESRD patients with normal-appearing brain tissues. Copyright © 2018. Published by Elsevier Masson SAS.

Structure versus time in the evolutionary diversification of avian carotenoid metabolic networks.

PubMed

Morrison, Erin S; Badyaev, Alexander V

2018-05-01

Historical associations of genes and proteins are thought to delineate pathways available to subsequent evolution; however, the effects of past functional involvements on contemporary evolution are rarely quantified. Here, we examined the extent to which the structure of a carotenoid enzymatic network persists in avian evolution. Specifically, we tested whether the evolution of carotenoid networks was most concordant with phylogenetically structured expansion from core reactions of common ancestors or with subsampling of biochemical pathway modules from an ancestral network. We compared structural and historical associations in 467 carotenoid networks of extant and ancestral species and uncovered the overwhelming effect of pre-existing metabolic network structure on carotenoid diversification over the last 50 million years of avian evolution. Over evolutionary time, birds repeatedly subsampled and recombined conserved biochemical modules, which likely maintained the overall structure of the carotenoid metabolic network during avian evolution. These findings explain the recurrent convergence of evolutionary distant species in carotenoid metabolism and weak phylogenetic signal in avian carotenoid evolution. Remarkable retention of an ancient metabolic structure throughout extensive and prolonged ecological diversification in avian carotenoid metabolism illustrates a fundamental requirement of organismal evolution - historical continuity of a deterministic network that links past and present functional associations of its components. © 2018 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2018 European Society For Evolutionary Biology.

Effects of amyloid and small vessel disease on white matter network disruption.

PubMed

Kim, Hee Jin; Im, Kiho; Kwon, Hunki; Lee, Jong Min; Ye, Byoung Seok; Kim, Yeo Jin; Cho, Hanna; Choe, Yearn Seong; Lee, Kyung Han; Kim, Sung Tae; Kim, Jae Seung; Lee, Jae Hong; Na, Duk L; Seo, Sang Won

2015-01-01

There is growing evidence that the human brain is a large scale complex network. The structural network is reported to be disrupted in cognitively impaired patients. However, there have been few studies evaluating the effects of amyloid and small vessel disease (SVD) markers, the common causes of cognitive impairment, on structural networks. Thus, we evaluated the association between amyloid and SVD burdens and structural networks using diffusion tensor imaging (DTI). Furthermore, we determined if network parameters predict cognitive impairments. Graph theoretical analysis was applied to DTI data from 232 cognitively impaired patients with varying degrees of amyloid and SVD burdens. All patients underwent Pittsburgh compound-B (PiB) PET to detect amyloid burden, MRI to detect markers of SVD, including the volume of white matter hyperintensities and the number of lacunes, and detailed neuropsychological testing. The whole-brain network was assessed by network parameters of integration (shortest path length, global efficiency) and segregation (clustering coefficient, transitivity, modularity). PiB retention ratio was not associated with any white matter network parameters. Greater white matter hyperintensity volumes or lacunae numbers were significantly associated with decreased network integration (increased shortest path length, decreased global efficiency) and increased network segregation (increased clustering coefficient, increased transitivity, increased modularity). Decreased network integration or increased network segregation were associated with poor performances in attention, language, visuospatial, memory, and frontal-executive functions. Our results suggest that SVD alters white matter network integration and segregation, which further predicts cognitive dysfunction.

Revealing the hidden language of complex networks.

PubMed

Yaveroğlu, Ömer Nebil; Malod-Dognin, Noël; Davis, Darren; Levnajic, Zoran; Janjic, Vuk; Karapandza, Rasa; Stojmirovic, Aleksandar; Pržulj, Nataša

2014-04-01

Sophisticated methods for analysing complex networks promise to be of great benefit to almost all scientific disciplines, yet they elude us. In this work, we make fundamental methodological advances to rectify this. We discover that the interaction between a small number of roles, played by nodes in a network, can characterize a network's structure and also provide a clear real-world interpretation. Given this insight, we develop a framework for analysing and comparing networks, which outperforms all existing ones. We demonstrate its strength by uncovering novel relationships between seemingly unrelated networks, such as Facebook, metabolic, and protein structure networks. We also use it to track the dynamics of the world trade network, showing that a country's role of a broker between non-trading countries indicates economic prosperity, whereas peripheral roles are associated with poverty. This result, though intuitive, has escaped all existing frameworks. Finally, our approach translates network topology into everyday language, bringing network analysis closer to domain scientists.

The Energy Coding of a Structural Neural Network Based on the Hodgkin-Huxley Model.

PubMed

Zhu, Zhenyu; Wang, Rubin; Zhu, Fengyun

2018-01-01

Based on the Hodgkin-Huxley model, the present study established a fully connected structural neural network to simulate the neural activity and energy consumption of the network by neural energy coding theory. The numerical simulation result showed that the periodicity of the network energy distribution was positively correlated to the number of neurons and coupling strength, but negatively correlated to signal transmitting delay. Moreover, a relationship was established between the energy distribution feature and the synchronous oscillation of the neural network, which showed that when the proportion of negative energy in power consumption curve was high, the synchronous oscillation of the neural network was apparent. In addition, comparison with the simulation result of structural neural network based on the Wang-Zhang biophysical model of neurons showed that both models were essentially consistent.

Discovering Network Structure Beyond Communities

NASA Astrophysics Data System (ADS)

Nishikawa, Takashi; Motter, Adilson E.

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

Impact of network structure on the capacity of wireless multihop ad hoc communication

NASA Astrophysics Data System (ADS)

Krause, Wolfram; Glauche, Ingmar; Sollacher, Rudolf; Greiner, Martin

2004-07-01

As a representative of a complex technological system, the so-called wireless multihop ad hoc communication networks are discussed. They represent an infrastructure-less generalization of todays wireless cellular phone networks. Lacking a central control authority, the ad hoc nodes have to coordinate themselves such that the overall network performs in an optimal way. A performance indicator is the end-to-end throughput capacity. Various models, generating differing ad hoc network structure via differing transmission power assignments, are constructed and characterized. They serve as input for a generic data traffic simulation as well as some semi-analytic estimations. The latter reveal that due to the most-critical-node effect the end-to-end throughput capacity sensitively depends on the underlying network structure, resulting in differing scaling laws with respect to network size.

Modeling MAC layer for powerline communications networks

NASA Astrophysics Data System (ADS)

Hrasnica, Halid; Haidine, Abdelfatteh

2001-02-01

The usage of electrical power distribution networks for voice and data transmission, called Powerline Communications, becomes nowadays more and more attractive, particularly in the telecommunication access area. The most important reasons for that are the deregulation of the telecommunication market and a fact that the access networks are still property of former monopolistic companies. In this work, first we analyze a PLC network and system structure as well as a disturbance scenario in powerline networks. After that, we define a logical structure of the powerline MAC layer and propose the reservation MAC protocols for the usage in the PLC network which provides collision free data transmission. This makes possible better network utilization and realization of QoS guarantees which can make PLC networks competitive to other access technologies.

Single-subject structural networks with closed-form rotation invariant matching mprove power in developmental studies of the cortex.

PubMed

Kandel, Benjamin M; Wang, Danny J J; Gee, James C; Avants, Brian B

2014-01-01

Although much attention has recently been focused on single-subject functional networks, using methods such as resting-state functional MRI, methods for constructing single-subject structural networks are in their infancy. Single-subject cortical networks aim to describe the self-similarity across the cortical structure, possibly signifying convergent developmental pathways. Previous methods for constructing single-subject cortical networks have used patch-based correlations and distance metrics based on curvature and thickness. We present here a method for constructing similarity-based cortical structural networks that utilizes a rotation-invariant representation of structure. The resulting graph metrics are closely linked to age and indicate an increasing degree of closeness throughout development in nearly all brain regions, perhaps corresponding to a more regular structure as the brain matures. The derived graph metrics demonstrate a four-fold increase in power for detecting age as compared to cortical thickness. This proof of concept study indicates that the proposed metric may be useful in identifying biologically relevant cortical patterns.

Epidemic spreading on complex networks with overlapping and non-overlapping community structure

NASA Astrophysics Data System (ADS)

Shang, Jiaxing; Liu, Lianchen; Li, Xin; Xie, Feng; Wu, Cheng

2015-02-01

Many real-world networks exhibit community structure where vertices belong to one or more communities. Recent studies show that community structure plays an import role in epidemic spreading. In this paper, we investigate how the extent of overlap among communities affects epidemics. In order to experiment on the characteristic of overlapping communities, we propose a rewiring algorithm that can change the community structure from overlapping to non-overlapping while maintaining the degree distribution of the network. We simulate the Susceptible-Infected-Susceptible (SIS) epidemic process on synthetic scale-free networks and real-world networks by applying our rewiring algorithm. Experiments show that epidemics spread faster on networks with higher level of overlapping communities. Furthermore, overlapping communities' effect interacts with the average degree's effect. Our work further illustrates the important role of overlapping communities in the process of epidemic spreading.

Relating the large-scale structure of time series and visibility networks.

PubMed

Rodríguez, Miguel A

2017-06-01

The structure of time series is usually characterized by means of correlations. A new proposal based on visibility networks has been considered recently. Visibility networks are complex networks mapped from surfaces or time series using visibility properties. The structures of time series and visibility networks are closely related, as shown by means of fractional time series in recent works. In these works, a simple relationship between the Hurst exponent H of fractional time series and the exponent of the distribution of edges γ of the corresponding visibility network, which exhibits a power law, is shown. To check and generalize these results, in this paper we delve into this idea of connected structures by defining both structures more properly. In addition to the exponents used before, H and γ, which take into account local properties, we consider two more exponents that, as we will show, characterize global properties. These are the exponent α for time series, which gives the scaling of the variance with the size as var∼T^{2α}, and the exponent κ of their corresponding network, which gives the scaling of the averaged maximum of the number of edges, 〈k_{M}〉∼N^{κ}. With this representation, a more precise connection between the structures of general time series and their associated visibility network is achieved. Similarities and differences are more clearly established, and new scaling forms of complex networks appear in agreement with their respective classes of time series.

Agent-Based Modeling of China's Rural-Urban Migration and Social Network Structure.

PubMed

Fu, Zhaohao; Hao, Lingxin

2018-01-15

We analyze China's rural-urban migration and endogenous social network structures using agent-based modeling. The agents from census micro data are located in their rural origin with an empirical-estimated prior propensity to move. The population-scale social network is a hybrid one, combining observed family ties and locations of the origin with a parameter space calibrated from census, survey and aggregate data and sampled using a stepwise Latin Hypercube Sampling method. At monthly intervals, some agents migrate and these migratory acts change the social network by turning within-nonmigrant connections to between-migrant-nonmigrant connections, turning local connections to nonlocal connections, and adding among-migrant connections. In turn, the changing social network structure updates migratory propensities of those well-connected nonmigrants who become more likely to move. These two processes iterate over time. Using a core-periphery method developed from the k -core decomposition method, we identify and quantify the network structural changes and map these changes with the migration acceleration patterns. We conclude that network structural changes are essential for explaining migration acceleration observed in China during the 1995-2000 period.

Agent-based modeling of China's rural-urban migration and social network structure

NASA Astrophysics Data System (ADS)

Fu, Zhaohao; Hao, Lingxin

2018-01-01

We analyze China's rural-urban migration and endogenous social network structures using agent-based modeling. The agents from census micro data are located in their rural origin with an empirical-estimated prior propensity to move. The population-scale social network is a hybrid one, combining observed family ties and locations of the origin with a parameter space calibrated from census, survey and aggregate data and sampled using a stepwise Latin Hypercube Sampling method. At monthly intervals, some agents migrate and these migratory acts change the social network by turning within-nonmigrant connections to between-migrant-nonmigrant connections, turning local connections to nonlocal connections, and adding among-migrant connections. In turn, the changing social network structure updates migratory propensities of those well-connected nonmigrants who become more likely to move. These two processes iterate over time. Using a core-periphery method developed from the k-core decomposition method, we identify and quantify the network structural changes and map these changes with the migration acceleration patterns. We conclude that network structural changes are essential for explaining migration acceleration observed in China during the 1995-2000 period.

Features of the Correlation Structure of Price Indices

PubMed Central

Gao, Xiangyun; An, Haizhong; Zhong, Weiqiong

2013-01-01

What are the features of the correlation structure of price indices? To answer this question, 5 types of price indices, including 195 specific price indices from 2003 to 2011, were selected as sample data. To build a weighted network of price indices each price index is represented by a vertex, and a positive correlation between two price indices is represented by an edge. We studied the features of the weighted network structure by applying economic theory to the analysis of complex network parameters. We found that the frequency of the price indices follows a normal distribution by counting the weighted degrees of the nodes, and we identified the price indices which have an important impact on the network's structure. We found out small groups in the weighted network by the methods of k-core and k-plex. We discovered structure holes in the network by calculating the hierarchy of the nodes. Finally, we found that the price indices weighted network has a small-world effect by calculating the shortest path. These results provide a scientific basis for macroeconomic control policies. PMID:23593399

Structural power and the evolution of collective fairness in social networks.

PubMed

Santos, Fernando P; Pacheco, Jorge M; Paiva, Ana; Santos, Francisco C

2017-01-01

From work contracts and group buying platforms to political coalitions and international climate and economical summits, often individuals assemble in groups that must collectively reach decisions that may favor each part unequally. Here we quantify to which extent our network ties promote the evolution of collective fairness in group interactions, modeled by means of Multiplayer Ultimatum Games (MUG). We show that a single topological feature of social networks-which we call structural power-has a profound impact on the tendency of individuals to take decisions that favor each part equally. Increased fair outcomes are attained whenever structural power is high, such that the networks that tie individuals allow them to meet the same partners in different groups, thus providing the opportunity to strongly influence each other. On the other hand, the absence of such close peer-influence relationships dismisses any positive effect created by the network. Interestingly, we show that increasing the structural power of a network leads to the appearance of well-defined modules-as found in human social networks that often exhibit community structure-providing an interaction environment that maximizes collective fairness.

Application of structured support vector machine backpropagation to a convolutional neural network for human pose estimation.

PubMed

Witoonchart, Peerajak; Chongstitvatana, Prabhas

2017-08-01

In this study, for the first time, we show how to formulate a structured support vector machine (SSVM) as two layers in a convolutional neural network, where the top layer is a loss augmented inference layer and the bottom layer is the normal convolutional layer. We show that a deformable part model can be learned with the proposed structured SVM neural network by backpropagating the error of the deformable part model to the convolutional neural network. The forward propagation calculates the loss augmented inference and the backpropagation calculates the gradient from the loss augmented inference layer to the convolutional layer. Thus, we obtain a new type of convolutional neural network called an Structured SVM convolutional neural network, which we applied to the human pose estimation problem. This new neural network can be used as the final layers in deep learning. Our method jointly learns the structural model parameters and the appearance model parameters. We implemented our method as a new layer in the existing Caffe library. Copyright © 2017 Elsevier Ltd. All rights reserved.

Research on energy stock market associated network structure based on financial indicators

NASA Astrophysics Data System (ADS)

Xi, Xian; An, Haizhong

2018-01-01

A financial market is a complex system consisting of many interacting units. In general, due to the various types of information exchange within the industry, there is a relationship between the stocks that can reveal their clear structural characteristics. Complex network methods are powerful tools for studying the internal structure and function of the stock market, which allows us to better understand the stock market. Applying complex network methodology, a stock associated network model based on financial indicators is created. Accordingly, we set threshold value and use modularity to detect the community network, and we analyze the network structure and community cluster characteristics of different threshold situations. The study finds that the threshold value of 0.7 is the abrupt change point of the network. At the same time, as the threshold value increases, the independence of the community strengthens. This study provides a method of researching stock market based on the financial indicators, exploring the structural similarity of financial indicators of stocks. Also, it provides guidance for investment and corporate financial management.

An evolutionary game approach for determination of the structural conflicts in signed networks

PubMed Central

Tan, Shaolin; Lü, Jinhu

2016-01-01

Social or biochemical networks can often divide into two opposite alliances in response to structural conflicts between positive (friendly, activating) and negative (hostile, inhibiting) interactions. Yet, the underlying dynamics on how the opposite alliances are spontaneously formed to minimize the structural conflicts is still unclear. Here, we demonstrate that evolutionary game dynamics provides a felicitous possible tool to characterize the evolution and formation of alliances in signed networks. Indeed, an evolutionary game dynamics on signed networks is proposed such that each node can adaptively adjust its choice of alliances to maximize its own fitness, which yet leads to a minimization of the structural conflicts in the entire network. Numerical experiments show that the evolutionary game approach is universally efficient in quality and speed to find optimal solutions for all undirected or directed, unweighted or weighted signed networks. Moreover, the evolutionary game approach is inherently distributed. These characteristics thus suggest the evolutionary game dynamic approach as a feasible and effective tool for determining the structural conflicts in large-scale on-line signed networks. PMID:26915581

Diagnosis of helicopter gearboxes using structure-based networks

NASA Technical Reports Server (NTRS)

Jammu, Vinay B.; Danai, Kourosh; Lewicki, David G.

1995-01-01

A connectionist network is introduced for fault diagnosis of helicopter gearboxes that incorporates knowledge of the gearbox structure and characteristics of the vibration features as its fuzzy weights. Diagnosis is performed by propagating the abnormal features of vibration measurements through this Structure-Based Connectionist Network (SBCN), the outputs of which represent the fault possibility values for individual components of the gearbox. The performance of this network is evaluated by applying it to experimental vibration data from an OH-58A helicopter gearbox. The diagnostic results indicate that the network performance is comparable to those obtained from supervised pattern classification.

Geometrical structure of Neural Networks: Geodesics, Jeffrey's Prior and Hyper-ribbons

NASA Astrophysics Data System (ADS)

Hayden, Lorien; Alemi, Alex; Sethna, James

2014-03-01

Neural networks are learning algorithms which are employed in a host of Machine Learning problems including speech recognition, object classification and data mining. In practice, neural networks learn a low dimensional representation of high dimensional data and define a model manifold which is an embedding of this low dimensional structure in the higher dimensional space. In this work, we explore the geometrical structure of a neural network model manifold. A Stacked Denoising Autoencoder and a Deep Belief Network are trained on handwritten digits from the MNIST database. Construction of geodesics along the surface and of slices taken from the high dimensional manifolds reveal a hierarchy of widths corresponding to a hyper-ribbon structure. This property indicates that neural networks fall into the class of sloppy models, in which certain parameter combinations dominate the behavior. Employing this information could prove valuable in designing both neural network architectures and training algorithms. This material is based upon work supported by the National Science Foundation Graduate Research Fellowship under Grant No . DGE-1144153.

Using a two-phase evolutionary framework to select multiple network spreaders based on community structure

NASA Astrophysics Data System (ADS)

Fu, Yu-Hsiang; Huang, Chung-Yuan; Sun, Chuen-Tsai

2016-11-01

Using network community structures to identify multiple influential spreaders is an appropriate method for analyzing the dissemination of information, ideas and infectious diseases. For example, data on spreaders selected from groups of customers who make similar purchases may be used to advertise products and to optimize limited resource allocation. Other examples include community detection approaches aimed at identifying structures and groups in social or complex networks. However, determining the number of communities in a network remains a challenge. In this paper we describe our proposal for a two-phase evolutionary framework (TPEF) for determining community numbers and maximizing community modularity. Lancichinetti-Fortunato-Radicchi benchmark networks were used to test our proposed method and to analyze execution time, community structure quality, convergence, and the network spreading effect. Results indicate that our proposed TPEF generates satisfactory levels of community quality and convergence. They also suggest a need for an index, mechanism or sampling technique to determine whether a community detection approach should be used for selecting multiple network spreaders.

From calls to communities: a model for time-varying social networks

NASA Astrophysics Data System (ADS)

Laurent, Guillaume; Saramäki, Jari; Karsai, Márton

2015-11-01

Social interactions vary in time and appear to be driven by intrinsic mechanisms that shape the emergent structure of social networks. Large-scale empirical observations of social interaction structure have become possible only recently, and modelling their dynamics is an actual challenge. Here we propose a temporal network model which builds on the framework of activity-driven time-varying networks with memory. The model integrates key mechanisms that drive the formation of social ties - social reinforcement, focal closure and cyclic closure, which have been shown to give rise to community structure and small-world connectedness in social networks. We compare the proposed model with a real-world time-varying network of mobile phone communication, and show that they share several characteristics from heterogeneous degrees and weights to rich community structure. Further, the strong and weak ties that emerge from the model follow similar weight-topology correlations as real-world social networks, including the role of weak ties.

Disseminating educational innovations in health care practice: training versus social networks.

PubMed

Jippes, Erik; Achterkamp, Marjolein C; Brand, Paul L P; Kiewiet, Derk Jan; Pols, Jan; van Engelen, Jo M L

2010-05-01

Improvements and innovation in health service organization and delivery have become more and more important due to the gap between knowledge and practice, rising costs, medical errors, and the organization of health care systems. Since training and education is widely used to convey and distribute innovative initiatives, we examined the effect that following an intensive Teach-the-Teacher training had on the dissemination of a new structured competency-based feedback technique of assessing clinical competencies among medical specialists in the Netherlands. We compared this with the effect of the structure of the social network of medical specialists, specifically the network tie strength (strong ties versus weak ties). We measured dissemination of the feedback technique by using a questionnaire filled in by Obstetrics & Gynecology and Pediatrics residents (n=63). Data on network tie strength was gathered with a structured questionnaire given to medical specialists (n=81). Social network analysis was used to compose the required network coefficients. We found a strong effect for network tie strength and no effect for the Teach-the-Teacher training course on the dissemination of the new structured feedback technique. This paper shows the potential that social networks have for disseminating innovations in health service delivery and organization. Further research is needed into the role and structure of social networks on the diffusion of innovations between departments and the various types of innovations involved. Copyright (c) 2010 Elsevier Ltd. All rights reserved.

Elastic properties and short-range structural order in mixed network former glasses.

PubMed

Wang, Weimin; Christensen, Randilynn; Curtis, Brittany; Hynek, David; Keizer, Sydney; Wang, James; Feller, Steve; Martin, Steve W; Kieffer, John

2017-06-21

Elastic properties of alkali containing glasses are of great interest not only because they provide information about overall structural integrity but also they are related to other properties such as thermal conductivity and ion mobility. In this study, we investigate two mixed-network former glass systems, sodium borosilicate 0.2Na 2 O + 0.8[xBO 1.5 + (1 - x)SiO 2 ] and sodium borogermanate 0.2Na 2 O + 0.8[xBO 1.5 + (1 - x)GeO 2 ] glasses. By mixing network formers, the network topology can be changed while keeping the network modifier concentration constant, which allows for the effect of network structure on elastic properties to be analyzed over a wide parametric range. In addition to non-linear, non-additive mixed-glass former effects, maxima are observed in longitudinal, shear and Young's moduli with increasing atomic number density. By combining results from NMR spectroscopy and Brillouin light scattering with a newly developed statistical thermodynamic reaction equilibrium model, it is possible to determine the relative proportions of all network structural units. This new analysis reveals that the structural characteristic predominantly responsible for effective mechanical load transmission in these glasses is a high density of network cations coordinated by four or more bridging oxygens, as it provides for establishing a network of covalent bonds among these cations with connectivity in three dimensions.

Neural-like growing networks

NASA Astrophysics Data System (ADS)

Yashchenko, Vitaliy A.

2000-03-01

On the basis of the analysis of scientific ideas reflecting the law in the structure and functioning the biological structures of a brain, and analysis and synthesis of knowledge, developed by various directions in Computer Science, also there were developed the bases of the theory of a new class neural-like growing networks, not having the analogue in world practice. In a base of neural-like growing networks the synthesis of knowledge developed by classical theories - semantic and neural of networks is. The first of them enable to form sense, as objects and connections between them in accordance with construction of the network. With thus each sense gets a separate a component of a network as top, connected to other tops. In common it quite corresponds to structure reflected in a brain, where each obvious concept is presented by certain structure and has designating symbol. Secondly, this network gets increased semantic clearness at the expense owing to formation not only connections between neural by elements, but also themselves of elements as such, i.e. here has a place not simply construction of a network by accommodation sense structures in environment neural of elements, and purely creation of most this environment, as of an equivalent of environment of memory. Thus neural-like growing networks are represented by the convenient apparatus for modeling of mechanisms of teleological thinking, as a fulfillment of certain psychophysiological of functions.

Modular and hierarchical structure of social contact networks

NASA Astrophysics Data System (ADS)

Ge, Yuanzheng; Song, Zhichao; Qiu, Xiaogang; Song, Hongbin; Wang, Yong

2013-10-01

Social contact networks exhibit overlapping qualities of communities, hierarchical structure and spatial-correlated nature. We propose a mixing pattern of modular and growing hierarchical structures to reconstruct social contact networks by using an individual’s geospatial distribution information in the real world. The hierarchical structure of social contact networks is defined based on the spatial distance between individuals, and edges among individuals are added in turn from the modular layer to the highest layer. It is a gradual process to construct the hierarchical structure: from the basic modular model up to the global network. The proposed model not only shows hierarchically increasing degree distribution and large clustering coefficients in communities, but also exhibits spatial clustering features of individual distributions. As an evaluation of the method, we reconstruct a hierarchical contact network based on the investigation data of a university. Transmission experiments of influenza H1N1 are carried out on the generated social contact networks, and results show that the constructed network is efficient to reproduce the dynamic process of an outbreak and evaluate interventions. The reproduced spread process exhibits that the spatial clustering of infection is accordant with the clustering of network topology. Moreover, the effect of individual topological character on the spread of influenza is analyzed, and the experiment results indicate that the spread is limited by individual daily contact patterns and local clustering topology rather than individual degree.

Sampling properties of directed networks

NASA Astrophysics Data System (ADS)

Son, S.-W.; Christensen, C.; Bizhani, G.; Foster, D. V.; Grassberger, P.; Paczuski, M.

2012-10-01

For many real-world networks only a small “sampled” version of the original network may be investigated; those results are then used to draw conclusions about the actual system. Variants of breadth-first search (BFS) sampling, which are based on epidemic processes, are widely used. Although it is well established that BFS sampling fails, in most cases, to capture the IN component(s) of directed networks, a description of the effects of BFS sampling on other topological properties is all but absent from the literature. To systematically study the effects of sampling biases on directed networks, we compare BFS sampling to random sampling on complete large-scale directed networks. We present new results and a thorough analysis of the topological properties of seven complete directed networks (prior to sampling), including three versions of Wikipedia, three different sources of sampled World Wide Web data, and an Internet-based social network. We detail the differences that sampling method and coverage can make to the structural properties of sampled versions of these seven networks. Most notably, we find that sampling method and coverage affect both the bow-tie structure and the number and structure of strongly connected components in sampled networks. In addition, at a low sampling coverage (i.e., less than 40%), the values of average degree, variance of out-degree, degree autocorrelation, and link reciprocity are overestimated by 30% or more in BFS-sampled networks and only attain values within 10% of the corresponding values in the complete networks when sampling coverage is in excess of 65%. These results may cause us to rethink what we know about the structure, function, and evolution of real-world directed networks.

Influences of sampling effort on detected patterns and structuring processes of a Neotropical plant-hummingbird network.

PubMed

Vizentin-Bugoni, Jeferson; Maruyama, Pietro K; Debastiani, Vanderlei J; Duarte, L da S; Dalsgaard, Bo; Sazima, Marlies

2016-01-01

Virtually all empirical ecological interaction networks to some extent suffer from undersampling. However, how limitations imposed by sampling incompleteness affect our understanding of ecological networks is still poorly explored, which may hinder further advances in the field. Here, we use a plant-hummingbird network with unprecedented sampling effort (2716 h of focal observations) from the Atlantic Rainforest in Brazil, to investigate how sampling effort affects the description of network structure (i.e. widely used network metrics) and the relative importance of distinct processes (i.e. species abundances vs. traits) in determining the frequency of pairwise interactions. By dividing the network into time slices representing a gradient of sampling effort, we show that quantitative metrics, such as interaction evenness, specialization (H2 '), weighted nestedness (wNODF) and modularity (Q; QuanBiMo algorithm) were less biased by sampling incompleteness than binary metrics. Furthermore, the significance of some network metrics changed along the sampling effort gradient. Nevertheless, the higher importance of traits in structuring the network was apparent even with small sampling effort. Our results (i) warn against using very poorly sampled networks as this may bias our understanding of networks, both their patterns and structuring processes, (ii) encourage the use of quantitative metrics little influenced by sampling when performing spatio-temporal comparisons and (iii) indicate that in networks strongly constrained by species traits, such as plant-hummingbird networks, even small sampling is sufficient to detect their relative importance for the frequencies of interactions. Finally, we argue that similar effects of sampling are expected for other highly specialized subnetworks. © 2015 The Authors. Journal of Animal Ecology © 2015 British Ecological Society.

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

DOEpatents

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.

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

DOEpatents

Ortiz, M.G.

1993-06-08

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.

How does the host population's network structure affect the estimation accuracy of epidemic parameters?

NASA Astrophysics Data System (ADS)

Yashima, Kenta; Ito, Kana; Nakamura, Kazuyuki

2013-03-01

When an Infectious disease where to prevail throughout the population, epidemic parameters such as the basic reproduction ratio, initial point of infection etc. are estimated from the time series data of infected population. However, it is unclear how does the structure of host population affects this estimation accuracy. In other words, what kind of city is difficult to estimate its epidemic parameters? To answer this question, epidemic data are simulated by constructing a commuting network with different network structure and running the infection process over this network. From the given time series data for each network structure, we would like to analyzed estimation accuracy of epidemic parameters.

Inference of time-delayed gene regulatory networks based on dynamic Bayesian network hybrid learning method

PubMed Central

Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui

2017-01-01

Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli, and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs. PMID:29113310

Inference of time-delayed gene regulatory networks based on dynamic Bayesian network hybrid learning method.

PubMed

Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui

2017-10-06

Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli , and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs.

Correlation between hierarchical structure of crystal networks and macroscopic performance of mesoscopic soft materials and engineering principles.

PubMed

Lin, Naibo; Liu, Xiang Yang

2015-11-07

This review examines how the concepts and ideas of crystallization can be extended further and applied to the field of mesoscopic soft materials. It concerns the structural characteristics vs. the macroscopic performance, and the formation mechanism of crystal networks. Although this subject can be discussed in a broad sense across the area of mesoscopic soft materials, our main focus is on supramolecular materials, spider and silkworm silks, and biominerals. First, the occurrence of a hierarchical structure, i.e. crystal network and domain network structures, will facilitate the formation kinetics of mesoscopic phases and boost up the macroscopic performance of materials in some cases (i.e. spider silk fibres). Second, the structure and performance of materials can be correlated in some way by the four factors: topology, correlation length, symmetry/ordering, and strength of association of crystal networks. Moreover, four different kinetic paths of crystal network formation are identified, namely, one-step process of assembly, two-step process of assembly, mixed mode of assembly and foreign molecule mediated assembly. Based on the basic mechanisms of crystal nucleation and growth, the formation of crystal networks, such as crystallographic mismatch (or noncrystallographic) branching (tip branching and fibre side branching) and fibre/polymeric side merging, are reviewed. This facilitates the rational design and construction of crystal networks in supramolecular materials. In this context, the (re-)construction of a hierarchical crystal network structure can be implemented by thermal, precipitate, chemical, and sonication stimuli. As another important class of soft materials, the unusual mechanical performance of spider and silkworm silk fibres are reviewed in comparison with the regenerated silk protein derivatives. It follows that the considerably larger breaking stress and unusual breaking strain of spider silk fibres vs. silkworm silk fibres can be interpreted according to the synergistically correlated hierarchical structures of the domain and crystal networks, which can be quantified by the hierarchical structural correlation and the four structural parameters. Based on the concept of crystal networks, the new understanding acquired will transfer the research and engineering of mesoscopic materials, particularly, soft functional materials, to a new phase.

The development of computer networks: First results from a microeconomic model

NASA Astrophysics Data System (ADS)

Maier, Gunther; Kaufmann, Alexander

Computer networks like the Internet are gaining importance in social and economic life. The accelerating pace of the adoption of network technologies for business purposes is a rather recent phenomenon. Many applications are still in the early, sometimes even experimental, phase. Nevertheless, it seems to be certain that networks will change the socioeconomic structures we know today. This is the background for our special interest in the development of networks, in the role of spatial factors influencing the formation of networks, and consequences of networks on spatial structures, and in the role of externalities. This paper discusses a simple economic model - based on a microeconomic calculus - that incorporates the main factors that generate the growth of computer networks. The paper provides analytic results about the generation of computer networks. The paper discusses (1) under what conditions economic factors will initiate the process of network formation, (2) the relationship between individual and social evaluation, and (3) the efficiency of a network that is generated based on economic mechanisms.

Inferring general relations between network characteristics from specific network ensembles.

PubMed

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

2012-01-01

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

Interaction Networks: Generating High Level Hints Based on Network Community Clustering

ERIC Educational Resources Information Center

Eagle, Michael; Johnson, Matthew; Barnes, Tiffany

2012-01-01

We introduce a novel data structure, the Interaction Network, for representing interaction-data from open problem solving environment tutors. We show how using network community detecting techniques are used to identify sub-goals in problems in a logic tutor. We then use those community structures to generate high level hints between sub-goals.…

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

ERIC Educational Resources Information Center

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,…

The neural representation of social networks.

PubMed

Weaverdyck, Miriam E; Parkinson, Carolyn

2018-05-24

The computational demands associated with navigating large, complexly bonded social groups are thought to have significantly shaped human brain evolution. Yet, research on social network representation and cognitive neuroscience have progressed largely independently. Thus, little is known about how the human brain encodes the structure of the social networks in which it is embedded. This review highlights recent work seeking to bridge this gap in understanding. While the majority of research linking social network analysis and neuroimaging has focused on relating neuroanatomy to social network size, researchers have begun to define the neural architecture that encodes social network structure, cognitive and behavioral consequences of encoding this information, and individual differences in how people represent the structure of their social world. Copyright © 2018 Elsevier Ltd. All rights reserved.

Incorporating profile information in community detection for online social networks

NASA Astrophysics Data System (ADS)

Fan, W.; Yeung, K. H.

2014-07-01

Community structure is an important feature in the study of complex networks. It is because nodes of the same community may have similar properties. In this paper we extend two popular community detection methods to partition online social networks. In our extended methods, the profile information of users is used for partitioning. We apply the extended methods in several sample networks of Facebook. Compared with the original methods, the community structures we obtain have higher modularity. Our results indicate that users' profile information is consistent with the community structure of their friendship network to some extent. To the best of our knowledge, this paper is the first to discuss how profile information can be used to improve community detection in online social networks.

Finding Correlation between Protein Protein Interaction Modules Using Semantic Web Techniques

NASA Astrophysics Data System (ADS)

Kargar, Mehdi; Moaven, Shahrouz; Abolhassani, Hassan

Many complex networks such as social networks and computer show modular structures, where edges between nodes are much denser within modules than between modules. It is strongly believed that cellular networks are also modular, reflecting the relative independence and coherence of different functional units in a cell. In this paper we used a human curated dataset. In this paper we consider each module in the PPI network as ontology. Using techniques in ontology alignment, we compare each pair of modules in the network. We want to see that is there a correlation between the structure of each module or they have totally different structures. Our results show that there is no correlation between proteins in a protein protein interaction network.

Model of community emergence in weighted social networks

NASA Astrophysics Data System (ADS)

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

2009-04-01

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

Complex networks with scale-free nature and hierarchical modularity

NASA Astrophysics Data System (ADS)

Shekatkar, Snehal M.; Ambika, G.

2015-09-01

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

Expectation propagation for large scale Bayesian inference of non-linear molecular networks from perturbation data.

PubMed

Narimani, Zahra; Beigy, Hamid; Ahmad, Ashar; Masoudi-Nejad, Ali; Fröhlich, Holger

2017-01-01

Inferring the structure of molecular networks from time series protein or gene expression data provides valuable information about the complex biological processes of the cell. Causal network structure inference has been approached using different methods in the past. Most causal network inference techniques, such as Dynamic Bayesian Networks and ordinary differential equations, are limited by their computational complexity and thus make large scale inference infeasible. This is specifically true if a Bayesian framework is applied in order to deal with the unavoidable uncertainty about the correct model. We devise a novel Bayesian network reverse engineering approach using ordinary differential equations with the ability to include non-linearity. Besides modeling arbitrary, possibly combinatorial and time dependent perturbations with unknown targets, one of our main contributions is the use of Expectation Propagation, an algorithm for approximate Bayesian inference over large scale network structures in short computation time. We further explore the possibility of integrating prior knowledge into network inference. We evaluate the proposed model on DREAM4 and DREAM8 data and find it competitive against several state-of-the-art existing network inference methods.

Can Burt's Theory of Structural Holes be Applied to Study Social Support Among Mid-Age Female Sex Workers? A Multi-Site Egocentric Network Study in China.

PubMed

Liu, Hongjie

2017-12-01

The epidemic of HIV/AIDS continues to spread among older adults and mid-age female sex workers (FSWs) over 35 years old. We used egocentric network data collected from three study sites in China to examine the applicability of Burt's Theory of Social Holes to study social support among mid-age FSWs. Using respondent-driven sampling, 1245 eligible mid-age FSWs were interviewed. Network structural holes were measured by network constraint and effective size. Three types of social networks were identified: family networks, workplace networks, and non-FSW networks. A larger effective size was significantly associated with a higher level of social support [regression coefficient (β) 5.43-10.59] across the three study samples. In contrast, a greater constraint was significantly associated with a lower level of social support (β -9.33 to -66.76). This study documents the applicability of the Theory of Structural Holes in studying network support among marginalized populations, such as FSWs.

Percolation on shopping and cashback electronic commerce networks

NASA Astrophysics Data System (ADS)

Fu, Tao; Chen, Yini; Qin, Zhen; Guo, Liping

2013-06-01

Many realistic networks live in the form of multiple networks, including interacting networks and interdependent networks. Here we study percolation properties of a special kind of interacting networks, namely Shopping and Cashback Electronic Commerce Networks (SCECNs). We investigate two actual SCECNs to extract their structural properties, and develop a mathematical framework based on generating functions for analyzing directed interacting networks. Then we derive the necessary and sufficient condition for the absence of the system-wide giant in- and out- component, and propose arithmetic to calculate the corresponding structural measures in the sub-critical and supercritical regimes. We apply our mathematical framework and arithmetic to those two actual SCECNs to observe its accuracy, and give some explanations on the discrepancies. We show those structural measures based on our mathematical framework and arithmetic are useful to appraise the status of SCECNs. We also find that the supercritical regime of the whole network is maintained mainly by hyperlinks between different kinds of websites, while those hyperlinks between the same kinds of websites can only enlarge the sizes of in-components and out-components.

A network function-based definition of communities in complex networks.

PubMed

Chauhan, Sanjeev; Girvan, Michelle; Ott, Edward

2012-09-01

We consider an alternate definition of community structure that is functionally motivated. We define network community structure based on the function the network system is intended to perform. In particular, as a specific example of this approach, we consider communities whose function is enhanced by the ability to synchronize and/or by resilience to node failures. Previous work has shown that, in many cases, the largest eigenvalue of the network's adjacency matrix controls the onset of both synchronization and percolation processes. Thus, for networks whose functional performance is dependent on these processes, we propose a method that divides a given network into communities based on maximizing a function of the largest eigenvalues of the adjacency matrices of the resulting communities. We also explore the differences between the partitions obtained by our method and the modularity approach (which is based solely on consideration of network structure). We do this for several different classes of networks. We find that, in many cases, modularity-based partitions do almost as well as our function-based method in finding functional communities, even though modularity does not specifically incorporate consideration of function.

Generalised Transfer Functions of Neural Networks

NASA Astrophysics Data System (ADS)

Fung, C. F.; Billings, S. A.; Zhang, H.

1997-11-01

When artificial neural networks are used to model non-linear dynamical systems, the system structure which can be extremely useful for analysis and design, is buried within the network architecture. In this paper, explicit expressions for the frequency response or generalised transfer functions of both feedforward and recurrent neural networks are derived in terms of the network weights. The derivation of the algorithm is established on the basis of the Taylor series expansion of the activation functions used in a particular neural network. This leads to a representation which is equivalent to the non-linear recursive polynomial model and enables the derivation of the transfer functions to be based on the harmonic expansion method. By mapping the neural network into the frequency domain information about the structure of the underlying non-linear system can be recovered. Numerical examples are included to demonstrate the application of the new algorithm. These examples show that the frequency response functions appear to be highly sensitive to the network topology and training, and that the time domain properties fail to reveal deficiencies in the trained network structure.

Competitive Dynamics on Complex Networks

PubMed Central

Zhao, Jiuhua; Liu, Qipeng; Wang, Xiaofan

2014-01-01

We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is a convex combination of the competitors' states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is most likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition. PMID:25068622

Network structure of subway passenger flows

NASA Astrophysics Data System (ADS)

Xu, Q.; Mao, B. H.; Bai, Y.

2016-03-01

The results of transportation infrastructure network analyses have been used to analyze complex networks in a topological context. However, most modeling approaches, including those based on complex network theory, do not fully account for real-life traffic patterns and may provide an incomplete view of network functions. This study utilizes trip data obtained from the Beijing Subway System to characterize individual passenger movement patterns. A directed weighted passenger flow network was constructed from the subway infrastructure network topology by incorporating trip data. The passenger flow networks exhibit several properties that can be characterized by power-law distributions based on flow size, and log-logistic distributions based on the fraction of boarding and departing passengers. The study also characterizes the temporal patterns of in-transit and waiting passengers and provides a hierarchical clustering structure for passenger flows. This hierarchical flow organization varies in the spatial domain. Ten cluster groups were identified, indicating a hierarchical urban polycentric structure composed of large concentrated flows at urban activity centers. These empirical findings provide insights regarding urban human mobility patterns within a large subway network.

Spatiotemporal dynamics in excitable homogeneous random networks composed of periodically self-sustained oscillation.

PubMed

Qian, Yu; Liu, Fei; Yang, Keli; Zhang, Ge; Yao, Chenggui; Ma, Jun

2017-09-19

The collective behaviors of networks are often dependent on the network connections and bifurcation parameters, also the local kinetics plays an important role in contributing the consensus of coupled oscillators. In this paper, we systematically investigate the influence of network structures and system parameters on the spatiotemporal dynamics in excitable homogeneous random networks (EHRNs) composed of periodically self-sustained oscillation (PSO). By using the dominant phase-advanced driving (DPAD) method, the one-dimensional (1D) Winfree loop is exposed as the oscillation source supporting the PSO, and the accurate wave propagation pathways from the oscillation source to the whole network are uncovered. Then, an order parameter is introduced to quantitatively study the influence of network structures and system parameters on the spatiotemporal dynamics of PSO in EHRNs. Distinct results induced by the network structures and the system parameters are observed. Importantly, the corresponding mechanisms are revealed. PSO influenced by the network structures are induced not only by the change of average path length (APL) of network, but also by the invasion of 1D Winfree loop from the outside linking nodes. Moreover, PSO influenced by the system parameters are determined by the excitation threshold and the minimum 1D Winfree loop. Finally, we confirmed that the excitation threshold and the minimum 1D Winfree loop determined PSO will degenerate as the system size is expanded.

Mutual connectivity analysis (MCA) using generalized radial basis function neural networks for nonlinear functional connectivity network recovery in resting-state functional MRI

NASA Astrophysics Data System (ADS)

D'Souza, Adora M.; Abidin, Anas Zainul; Nagarajan, Mahesh B.; Wismüller, Axel

2016-03-01

We investigate the applicability of a computational framework, called mutual connectivity analysis (MCA), for directed functional connectivity analysis in both synthetic and resting-state functional MRI data. This framework comprises of first evaluating non-linear cross-predictability between every pair of time series prior to recovering the underlying network structure using community detection algorithms. We obtain the non-linear cross-prediction score between time series using Generalized Radial Basis Functions (GRBF) neural networks. These cross-prediction scores characterize the underlying functionally connected networks within the resting brain, which can be extracted using non-metric clustering approaches, such as the Louvain method. We first test our approach on synthetic models with known directional influence and network structure. Our method is able to capture the directional relationships between time series (with an area under the ROC curve = 0.92 +/- 0.037) as well as the underlying network structure (Rand index = 0.87 +/- 0.063) with high accuracy. Furthermore, we test this method for network recovery on resting-state fMRI data, where results are compared to the motor cortex network recovered from a motor stimulation sequence, resulting in a strong agreement between the two (Dice coefficient = 0.45). We conclude that our MCA approach is effective in analyzing non-linear directed functional connectivity and in revealing underlying functional network structure in complex systems.

Industrial entrepreneurial network: Structural and functional analysis

NASA Astrophysics Data System (ADS)

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.

Mutual Connectivity Analysis (MCA) Using Generalized Radial Basis Function Neural Networks for Nonlinear Functional Connectivity Network Recovery in Resting-State Functional MRI.

PubMed

DSouza, Adora M; Abidin, Anas Zainul; Nagarajan, Mahesh B; Wismüller, Axel

2016-03-29

We investigate the applicability of a computational framework, called mutual connectivity analysis (MCA), for directed functional connectivity analysis in both synthetic and resting-state functional MRI data. This framework comprises of first evaluating non-linear cross-predictability between every pair of time series prior to recovering the underlying network structure using community detection algorithms. We obtain the non-linear cross-prediction score between time series using Generalized Radial Basis Functions (GRBF) neural networks. These cross-prediction scores characterize the underlying functionally connected networks within the resting brain, which can be extracted using non-metric clustering approaches, such as the Louvain method. We first test our approach on synthetic models with known directional influence and network structure. Our method is able to capture the directional relationships between time series (with an area under the ROC curve = 0.92 ± 0.037) as well as the underlying network structure (Rand index = 0.87 ± 0.063) with high accuracy. Furthermore, we test this method for network recovery on resting-state fMRI data, where results are compared to the motor cortex network recovered from a motor stimulation sequence, resulting in a strong agreement between the two (Dice coefficient = 0.45). We conclude that our MCA approach is effective in analyzing non-linear directed functional connectivity and in revealing underlying functional network structure in complex systems.

Network evaluation: principles, structures and outcomes of the German working group of Health Promoting Universities.

PubMed

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.

Sampling of temporal networks: Methods and biases

NASA Astrophysics Data System (ADS)

Rocha, Luis E. C.; Masuda, Naoki; Holme, Petter

2017-11-01

Temporal networks have been increasingly used to model a diversity of systems that evolve in time; for example, human contact structures over which dynamic processes such as epidemics take place. A fundamental aspect of real-life networks is that they are sampled within temporal and spatial frames. Furthermore, one might wish to subsample networks to reduce their size for better visualization or to perform computationally intensive simulations. The sampling method may affect the network structure and thus caution is necessary to generalize results based on samples. In this paper, we study four sampling strategies applied to a variety of real-life temporal networks. We quantify the biases generated by each sampling strategy on a number of relevant statistics such as link activity, temporal paths and epidemic spread. We find that some biases are common in a variety of networks and statistics, but one strategy, uniform sampling of nodes, shows improved performance in most scenarios. Given the particularities of temporal network data and the variety of network structures, we recommend that the choice of sampling methods be problem oriented to minimize the potential biases for the specific research questions on hand. Our results help researchers to better design network data collection protocols and to understand the limitations of sampled temporal network data.

Fragmenting networks by targeting collective influencers at a mesoscopic level.

PubMed

Kobayashi, Teruyoshi; Masuda, Naoki

2016-11-25

A practical approach to protecting networks against epidemic processes such as spreading of infectious diseases, malware, and harmful viral information is to remove some influential nodes beforehand to fragment the network into small components. Because determining the optimal order to remove nodes is a computationally hard problem, various approximate algorithms have been proposed to efficiently fragment networks by sequential node removal. Morone and Makse proposed an algorithm employing the non-backtracking matrix of given networks, which outperforms various existing algorithms. In fact, many empirical networks have community structure, compromising the assumption of local tree-like structure on which the original algorithm is based. We develop an immunization algorithm by synergistically combining the Morone-Makse algorithm and coarse graining of the network in which we regard a community as a supernode. In this way, we aim to identify nodes that connect different communities at a reasonable computational cost. The proposed algorithm works more efficiently than the Morone-Makse and other algorithms on networks with community structure.

Fragmenting networks by targeting collective influencers at a mesoscopic level

NASA Astrophysics Data System (ADS)

Kobayashi, Teruyoshi; Masuda, Naoki

2016-11-01

A practical approach to protecting networks against epidemic processes such as spreading of infectious diseases, malware, and harmful viral information is to remove some influential nodes beforehand to fragment the network into small components. Because determining the optimal order to remove nodes is a computationally hard problem, various approximate algorithms have been proposed to efficiently fragment networks by sequential node removal. Morone and Makse proposed an algorithm employing the non-backtracking matrix of given networks, which outperforms various existing algorithms. In fact, many empirical networks have community structure, compromising the assumption of local tree-like structure on which the original algorithm is based. We develop an immunization algorithm by synergistically combining the Morone-Makse algorithm and coarse graining of the network in which we regard a community as a supernode. In this way, we aim to identify nodes that connect different communities at a reasonable computational cost. The proposed algorithm works more efficiently than the Morone-Makse and other algorithms on networks with community structure.

Fragmenting networks by targeting collective influencers at a mesoscopic level

PubMed Central

Kobayashi, Teruyoshi; Masuda, Naoki

2016-01-01

A practical approach to protecting networks against epidemic processes such as spreading of infectious diseases, malware, and harmful viral information is to remove some influential nodes beforehand to fragment the network into small components. Because determining the optimal order to remove nodes is a computationally hard problem, various approximate algorithms have been proposed to efficiently fragment networks by sequential node removal. Morone and Makse proposed an algorithm employing the non-backtracking matrix of given networks, which outperforms various existing algorithms. In fact, many empirical networks have community structure, compromising the assumption of local tree-like structure on which the original algorithm is based. We develop an immunization algorithm by synergistically combining the Morone-Makse algorithm and coarse graining of the network in which we regard a community as a supernode. In this way, we aim to identify nodes that connect different communities at a reasonable computational cost. The proposed algorithm works more efficiently than the Morone-Makse and other algorithms on networks with community structure. PMID:27886251

Neuronal avalanches of a self-organized neural network with active-neuron-dominant structure.

PubMed

Li, Xiumin; Small, Michael

2012-06-01

Neuronal avalanche is a spontaneous neuronal activity which obeys a power-law distribution of population event sizes with an exponent of -3/2. It has been observed in the superficial layers of cortex both in vivo and in vitro. In this paper, we analyze the information transmission of a novel self-organized neural network with active-neuron-dominant structure. Neuronal avalanches can be observed in this network with appropriate input intensity. We find that the process of network learning via spike-timing dependent plasticity dramatically increases the complexity of network structure, which is finally self-organized to be active-neuron-dominant connectivity. Both the entropy of activity patterns and the complexity of their resulting post-synaptic inputs are maximized when the network dynamics are propagated as neuronal avalanches. This emergent topology is beneficial for information transmission with high efficiency and also could be responsible for the large information capacity of this network compared with alternative archetypal networks with different neural connectivity.

Modeling the coevolution of topology and traffic on weighted technological networks

NASA Astrophysics Data System (ADS)

Xie, Yan-Bo; Wang, Wen-Xu; Wang, Bing-Hong

2007-02-01

For many technological networks, the network structures and the traffic taking place on them mutually interact. The demands of traffic increment spur the evolution and growth of the networks to maintain their normal and efficient functioning. In parallel, a change of the network structure leads to redistribution of the traffic. In this paper, we perform an extensive numerical and analytical study, extending results of Wang [Phys. Rev. Lett. 94, 188702 (2005)]. By introducing a general strength-coupling interaction driven by the traffic increment between any pair of vertices, our model generates networks of scale-free distributions of strength, weight, and degree. In particular, the obtained nonlinear correlation between vertex strength and degree, and the disassortative property demonstrate that the model is capable of characterizing weighted technological networks. Moreover, the generated graphs possess both dense clustering structures and an anticorrelation between vertex clustering and degree, which are widely observed in real-world networks. The corresponding theoretical predictions are well consistent with simulation results.

Structural Controllability and Controlling Centrality of Temporal Networks

PubMed Central

Pan, Yujian; Li, Xiang

2014-01-01

Temporal networks are such networks where nodes and interactions may appear and disappear at various time scales. With the evidence of ubiquity of temporal networks in our economy, nature and society, it's urgent and significant to focus on its structural controllability as well as the corresponding characteristics, which nowadays is still an untouched topic. We develop graphic tools to study the structural controllability as well as its characteristics, identifying the intrinsic mechanism of the ability of individuals in controlling a dynamic and large-scale temporal network. Classifying temporal trees of a temporal network into different types, we give (both upper and lower) analytical bounds of the controlling centrality, which are verified by numerical simulations of both artificial and empirical temporal networks. We find that the positive relationship between aggregated degree and controlling centrality as well as the scale-free distribution of node's controlling centrality are virtually independent of the time scale and types of datasets, meaning the inherent robustness and heterogeneity of the controlling centrality of nodes within temporal networks. PMID:24747676

Educational network comparative analysis of small groups: Short- and long-term communications

NASA Astrophysics Data System (ADS)

Berg, D. B.; Zvereva, O. M.; Nazarova, Yu. Yu.; Chepurov, E. G.; Kokovin, A. V.; Ranyuk, S. V.

2017-11-01

The present study is devoted to the discussion of small group communication network structures. These communications were observed in student groups, where actors were united with a regular educational activity. The comparative analysis was carried out for networks of short-term (1 hour) and long-term (4 weeks) communications, it was based on seven structural parameters, and consisted of two stages. At the first stage, differences between the network graphs were examined, and the random corresponding Bernoulli graphs were built. At the second stage, revealed differences were compared. Calculations were performed using UCINET software framework. It was found out that networks of long-term and short-term communications are quite different: the structure of a short-term communication network is close to a random one, whereas the most of long-term communication network parameters differ from the corresponding random ones by more than 30%. This difference can be explained by strong "noisiness" of a short-term communication network, and the lack of social in it.

Multi-attribute integrated measurement of node importance in complex networks.

PubMed

Wang, Shibo; Zhao, Jinlou

2015-11-01

The measure of node importance in complex networks is very important to the research of networks stability and robustness; it also can ensure the security of the whole network. Most researchers have used a single indicator to measure the networks node importance, so that the obtained measurement results only reflect certain aspects of the networks with a loss of information. Meanwhile, because of the difference of networks topology, the nodes' importance should be described by combining the character of the networks topology. Most of the existing evaluation algorithms cannot completely reflect the circumstances of complex networks, so this paper takes into account the degree of centrality, the relative closeness centrality, clustering coefficient, and topology potential and raises an integrated measuring method to measure the nodes' importance. This method can reflect nodes' internal and outside attributes and eliminate the influence of network structure on the node importance. The experiments of karate network and dolphin network show that networks topology structure integrated measure has smaller range of metrical result than a single indicator and more universal. Experiments show that attacking the North American power grid and the Internet network with the method has a faster convergence speed than other methods.

Identifying influencers from sampled social networks

NASA Astrophysics Data System (ADS)

Tsugawa, Sho; Kimura, Kazuma

2018-10-01

Identifying influencers who can spread information to many other individuals from a social network is a fundamental research task in the network science research field. Several measures for identifying influencers have been proposed, and the effectiveness of these influence measures has been evaluated for the case where the complete social network structure is known. However, it is difficult in practice to obtain the complete structure of a social network because of missing data, false data, or node/link sampling from the social network. In this paper, we investigate the effects of node sampling from a social network on the effectiveness of influence measures at identifying influencers. Our experimental results show that the negative effect of biased sampling, such as sample edge count, on the identification of influencers is generally small. For social media networks, we can identify influencers whose influence is comparable with that of those identified from the complete social networks by sampling only 10%-30% of the networks. Moreover, our results also suggest the possible benefit of network sampling in the identification of influencers. Our results show that, for some networks, nodes with higher influence can be discovered from sampled social networks than from complete social networks.

Social networks and links to isolation and loneliness among elderly HCBS clients.

PubMed

Medvene, Louis J; Nilsen, Kari M; Smith, Rachel; Ofei-Dodoo, Samuel; DiLollo, Anthony; Webster, Noah; Graham, Annette; Nance, Anita

2016-01-01

The purpose of this study was to explore the network types of HCBS clients based on the structural characteristics of their social networks. We also examined how the network types were associated with social isolation, relationship quality and loneliness. Forty personal interviews were carried out with HCBS clients to assess the structure of their social networks as indicated by frequency of contact with children, friends, family and participation in religious and community organizations. Hierarchical cluster analysis was conducted to identify network types. Four network types were found including: family (n = 16), diverse (n = 8), restricted (n = 8) and religious (n = 7). Family members comprised almost half of participants' social networks, and friends comprised less than one-third. Clients embedded in family, diverse and religious networks had significantly more positive relationships than clients embedded in restricted networks. Clients embedded in restricted networks had significantly higher social isolation scores and were lonelier than clients in diverse and family networks. The findings suggest that HCBS clients' isolation and loneliness are linked to the types of social networks in which they are embedded. The findings also suggest that clients embedded in restricted networks are at high risk for negative outcomes.

The Dichotomy in Degree Correlation of Biological Networks

PubMed Central

Hao, Dapeng; Li, Chuanxing

2011-01-01

Most complex networks from different areas such as biology, sociology or technology, show a correlation on node degree where the possibility of a link between two nodes depends on their connectivity. It is widely believed that complex networks are either disassortative (links between hubs are systematically suppressed) or assortative (links between hubs are enhanced). In this paper, we analyze a variety of biological networks and find that they generally show a dichotomous degree correlation. We find that many properties of biological networks can be explained by this dichotomy in degree correlation, including the neighborhood connectivity, the sickle-shaped clustering coefficient distribution and the modularity structure. This dichotomy distinguishes biological networks from real disassortative networks or assortative networks such as the Internet and social networks. We suggest that the modular structure of networks accounts for the dichotomy in degree correlation and vice versa, shedding light on the source of modularity in biological networks. We further show that a robust and well connected network necessitates the dichotomy of degree correlation, suggestive of an evolutionary motivation for its existence. Finally, we suggest that a dichotomous degree correlation favors a centrally connected modular network, by which the integrity of network and specificity of modules might be reconciled. PMID:22164269

Construction of multi-scale consistent brain networks: methods and applications.

PubMed

Ge, Bao; Tian, Yin; Hu, Xintao; Chen, Hanbo; Zhu, Dajiang; Zhang, Tuo; Han, Junwei; Guo, Lei; Liu, Tianming

2015-01-01

Mapping human brain networks provides a basis for studying brain function and dysfunction, and thus has gained significant interest in recent years. However, modeling human brain networks still faces several challenges including constructing networks at multiple spatial scales and finding common corresponding networks across individuals. As a consequence, many previous methods were designed for a single resolution or scale of brain network, though the brain networks are multi-scale in nature. To address this problem, this paper presents a novel approach to constructing multi-scale common structural brain networks from DTI data via an improved multi-scale spectral clustering applied on our recently developed and validated DICCCOLs (Dense Individualized and Common Connectivity-based Cortical Landmarks). Since the DICCCOL landmarks possess intrinsic structural correspondences across individuals and populations, we employed the multi-scale spectral clustering algorithm to group the DICCCOL landmarks and their connections into sub-networks, meanwhile preserving the intrinsically-established correspondences across multiple scales. Experimental results demonstrated that the proposed method can generate multi-scale consistent and common structural brain networks across subjects, and its reproducibility has been verified by multiple independent datasets. As an application, these multi-scale networks were used to guide the clustering of multi-scale fiber bundles and to compare the fiber integrity in schizophrenia and healthy controls. In general, our methods offer a novel and effective framework for brain network modeling and tract-based analysis of DTI data.

Mental health network governance: comparative analysis across Canadian regions

PubMed Central

Wiktorowicz, Mary E; Fleury, Marie-Josée; Adair, Carol E; Lesage, Alain; Goldner, Elliot; Peters, Suzanne

2010-01-01

Objective Modes of governance were compared in ten local mental health networks in diverse contexts (rural/urban and regionalized/non-regionalized) to clarify the governance processes that foster inter-organizational collaboration and the conditions that support them. Methods Case studies of ten local mental health networks were developed using qualitative methods of document review, semi-structured interviews and focus groups that incorporated provincial policy, network and organizational levels of analysis. Results Mental health networks adopted either a corporate structure, mutual adjustment or an alliance governance model. A corporate structure supported by regionalization offered the most direct means for local governance to attain inter-organizational collaboration. The likelihood that networks with an alliance model developed coordination processes depended on the presence of the following conditions: a moderate number of organizations, goal consensus and trust among the organizations, and network-level competencies. In the small and mid-sized urban networks where these conditions were met their alliance realized the inter-organizational collaboration sought. In the large urban and rural networks where these conditions were not met, externally brokered forms of network governance were required to support alliance based models. Discussion In metropolitan and rural networks with such shared forms of network governance as an alliance or voluntary mutual adjustment, external mediation by a regional or provincial authority was an important lever to foster inter-organizational collaboration. PMID:21289999

Network integration and limits to social inheritance in vervet monkeys.

PubMed

Jarrett, Jonathan D; Bonnell, Tyler R; Young, Christopher; Barrett, Louise; Henzi, S Peter

2018-04-11

Social networks can be adaptive for members and a recent model (Ilany and Akçay 2016 Nat. Comm. 7 , 12084 (doi:10.1038/ncomms12084)) has demonstrated that network structure can be maintained by a simple process of social inheritance. Here, we ask how juvenile vervet monkeys integrate into their adult grooming networks, using the model to test whether observed grooming patterns replicate network structure. Female juveniles, who are philopatric, increased their grooming effort towards adults more than males, although this was not reciprocated by the adults themselves. While more consistent maternal grooming networks, together with maternal network strength, predicted increasing similarity in the patterning of mother-daughter grooming allocations, daughters' grooming networks generally did not match closely those of their mothers. However, maternal networks themselves were not very consistent across time, thus presenting youngsters with a moving target that may be difficult to match. Observed patterns of juvenile female grooming did not replicate the adult network, for which increased association with adults not groomed by their mothers would be necessary. These results suggest that network flexibility, not stability, characterizes our groups and that juveniles are exposed to, and must learn to cope with, temporal shifts in network structure. We hypothesize that this may lead to individual variation in behavioural flexibility, which in turn may help explain why and how variation in sociability influences fitness. © 2018 The Author(s).

A network view on psychiatric disorders: network clusters of symptoms as elementary syndromes of psychopathology.

PubMed

Goekoop, Rutger; Goekoop, Jaap G

2014-01-01

The vast number of psychopathological syndromes that can be observed in clinical practice can be described in terms of a limited number of elementary syndromes that are differentially expressed. Previous attempts to identify elementary syndromes have shown limitations that have slowed progress in the taxonomy of psychiatric disorders. To examine the ability of network community detection (NCD) to identify elementary syndromes of psychopathology and move beyond the limitations of current classification methods in psychiatry. 192 patients with unselected mental disorders were tested on the Comprehensive Psychopathological Rating Scale (CPRS). Principal component analysis (PCA) was performed on the bootstrapped correlation matrix of symptom scores to extract the principal component structure (PCS). An undirected and weighted network graph was constructed from the same matrix. Network community structure (NCS) was optimized using a previously published technique. In the optimal network structure, network clusters showed a 89% match with principal components of psychopathology. Some 6 network clusters were found, including "Depression", "Mania", "Anxiety", "Psychosis", "Retardation", and "Behavioral Disorganization". Network metrics were used to quantify the continuities between the elementary syndromes. We present the first comprehensive network graph of psychopathology that is free from the biases of previous classifications: a 'Psychopathology Web'. Clusters within this network represent elementary syndromes that are connected via a limited number of bridge symptoms. Many problems of previous classifications can be overcome by using a network approach to psychopathology.

Early grey matter changes in structural covariance networks in Huntington's disease.

PubMed

Coppen, Emma M; van der Grond, Jeroen; Hafkemeijer, Anne; Rombouts, Serge A R B; Roos, Raymund A C

2016-01-01

Progressive subcortical changes are known to occur in Huntington's disease (HD), a hereditary neurodegenerative disorder. Less is known about the occurrence and cohesion of whole brain grey matter changes in HD. We aimed to detect network integrity changes in grey matter structural covariance networks and examined relationships with clinical assessments. Structural magnetic resonance imaging data of premanifest HD ( n  = 30), HD patients (n = 30) and controls (n = 30) was used to identify ten structural covariance networks based on a novel technique using the co-variation of grey matter with independent component analysis in FSL. Group differences were studied controlling for age and gender. To explore whether our approach is effective in examining grey matter changes, regional voxel-based analysis was additionally performed. Premanifest HD and HD patients showed decreased network integrity in two networks compared to controls. One network included the caudate nucleus, precuneous and anterior cingulate cortex (in HD p  < 0.001, in pre-HD p  = 0.003). One other network contained the hippocampus, premotor, sensorimotor, and insular cortices (in HD p  < 0.001, in pre-HD p  = 0.023). Additionally, in HD patients only, decreased network integrity was observed in a network including the lingual gyrus, intracalcarine, cuneal, and lateral occipital cortices ( p  = 0.032). Changes in network integrity were significantly associated with scores of motor and neuropsychological assessments. In premanifest HD, voxel-based analyses showed pronounced volume loss in the basal ganglia, but less prominent in cortical regions. Our results suggest that structural covariance might be a sensitive approach to reveal early grey matter changes, especially for premanifest HD.

Designing Industrial Networks Using Ecological Food Web Metrics.

PubMed

Layton, Astrid; Bras, Bert; Weissburg, Marc

2016-10-18

Biologically Inspired Design (biomimicry) and Industrial Ecology both look to natural systems to enhance the sustainability and performance of engineered products, systems and industries. Bioinspired design (BID) traditionally has focused on a unit operation and single product level. In contrast, this paper describes how principles of network organization derived from analysis of ecosystem properties can be applied to industrial system networks. Specifically, this paper examines the applicability of particular food web matrix properties as design rules for economically and biologically sustainable industrial networks, using an optimization model developed for a carpet recycling network. Carpet recycling network designs based on traditional cost and emissions based optimization are compared to designs obtained using optimizations based solely on ecological food web metrics. The analysis suggests that networks optimized using food web metrics also were superior from a traditional cost and emissions perspective; correlations between optimization using ecological metrics and traditional optimization ranged generally from 0.70 to 0.96, with flow-based metrics being superior to structural parameters. Four structural food parameters provided correlations nearly the same as that obtained using all structural parameters, but individual structural parameters provided much less satisfactory correlations. The analysis indicates that bioinspired design principles from ecosystems can lead to both environmentally and economically sustainable industrial resource networks, and represent guidelines for designing sustainable industry networks.

Kohonen and counterpropagation neural networks applied for mapping and interpretation of IR spectra.

PubMed

Novic, Marjana

2008-01-01

The principles of learning strategy of Kohonen and counterpropagation neural networks are introduced. The advantages of unsupervised learning are discussed. The self-organizing maps produced in both methods are suitable for a wide range of applications. Here, we present an example of Kohonen and counterpropagation neural networks used for mapping, interpretation, and simulation of infrared (IR) spectra. The artificial neural network models were trained for prediction of structural fragments of an unknown compound from its infrared spectrum. The training set contained over 3,200 IR spectra of diverse compounds of known chemical structure. The structure-spectra relationship was encompassed by the counterpropagation neural network, which assigned structural fragments to individual compounds within certain probability limits, assessed from the predictions of test compounds. The counterpropagation neural network model for prediction of fragments of chemical structure is reversible, which means that, for a given structural domain, limited to the training data set in the study, it can be used to simulate the IR spectrum of a chemical defined with a set of structural fragments.

Structural integration and performance of inter-sectoral public health-related policy networks: An analysis across policy phases.

PubMed

Peters, D T J M; Raab, J; Grêaux, K M; Stronks, K; Harting, J

2017-12-01

Inter-sectoral policy networks may be effective in addressing environmental determinants of health with interventions. However, contradictory results are reported on relations between structural network characteristics (i.e., composition and integration) and network performance, such as addressing environmental determinants of health. This study examines these relations in different phases of the policy process. A multiple-case study was performed on four public health-related policy networks. Using a snowball method among network actors, overall and sub-networks per policy phase were identified and the policy sector of each actor was assigned. To operationalise the outcome variable, interventions were classified by the proportion of environmental determinants they addressed. In the overall networks, no relation was found between structural network characteristics and network performance. In most effective cases, the policy development sub-networks were characterised by integration with less interrelations between actors (low cohesion), more equally distributed distances between the actors (low closeness centralisation), and horizontal integration in inter-sectoral cliques. The most effective case had non-public health central actors with less connections in all sub-networks. The results suggest that, to address environmental determinants of health, sub-networks should be inter-sectorally composed in the policy development rather than in the intervention development and implementation phases, and that policy development actors should have the opportunity to connect with other actors, without strong direction from a central actor. Copyright © 2017 Elsevier B.V. All rights reserved.

Personal network structure and substance use in women by 12 months post treatment intake

PubMed Central

Tracy, Elizabeth M.; Min, Meeyoung O.; Park, Hyunyong; Jun, MinKyoung; Brown, Suzanne; Francis, Meredith W.

2015-01-01

Introduction Women with substance use disorders enter treatment with limited personal network resources and reduced recovery support. This study examined the impact of personal networks on substance use by 12 months post treatment intake. Methods Data were collected from 284 women who received substance abuse treatment. At six month follow up, composition, support availability and structure of personal networks were examined. Substance use was measured by women’s report of any use of alcohol or drugs. Hierarchical multivariate logistic regression was conducted to examine the contribution of personal network characteristics on substance use by 12 months post treatment intake. Results Higher numbers of substance using alters (network members) and more densely connected networks at six month follow-up were associated with an increased likelihood of substance use by 12 months post treatment intake. A greater number of isolates in women’s networks was associated with decreased odds of substance use. Women who did not use substances by 12 months post treatment intake had more non-users among their isolates at six months compared to those who used substances. No association was found between support availability and likelihood of substance use. Conclusions Both network composition and structure could be relevant foci for network interventions e.g. helping women change network composition by reducing substance users as well as increasing network connections. Isolates who are not substance users may be a particular strength to help women cultivate within their network to promote sustained sobriety post treatment. PMID:26712040

The network organization of protein interactions in the spliceosome is reproduced by the simple rules of food-web models

PubMed Central

Pires, Mathias M.; Cantor, Maurício; Guimarães, Paulo R.; de Aguiar, Marcus A. M.; dos Reis, Sérgio F.; Coltri, Patricia P.

2015-01-01

The network structure of biological systems provides information on the underlying processes shaping their organization and dynamics. Here we examined the structure of the network depicting protein interactions within the spliceosome, the macromolecular complex responsible for splicing in eukaryotic cells. We show the interactions of less connected spliceosome proteins are nested subsets of the connections of the highly connected proteins. At the same time, the network has a modular structure with groups of proteins sharing similar interaction patterns. We then investigated the role of affinity and specificity in shaping the spliceosome network by adapting a probabilistic model originally designed to reproduce food webs. This food-web model was as successful in reproducing the structure of protein interactions as it is in reproducing interactions among species. The good performance of the model suggests affinity and specificity, partially determined by protein size and the timing of association to the complex, may be determining network structure. Moreover, because network models allow building ensembles of realistic networks while encompassing uncertainty they can be useful to examine the dynamics and vulnerability of intracelullar processes. Unraveling the mechanisms organizing the spliceosome interactions is important to characterize the role of individual proteins on splicing catalysis and regulation. PMID:26443080

TreeNetViz: revealing patterns of networks over tree structures.

PubMed

Gou, Liang; Zhang, Xiaolong Luke

2011-12-01

Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns. © 2011 IEEE

Attack tolerance of correlated time-varying social networks with well-defined communities

NASA Astrophysics Data System (ADS)

Sur, Souvik; Ganguly, Niloy; Mukherjee, Animesh

2015-02-01

In this paper, we investigate the efficiency and the robustness of information transmission for real-world social networks, modeled as time-varying instances, under targeted attack in shorter time spans. We observe that these quantities are markedly higher than that of the randomized versions of the considered networks. An important factor that drives this efficiency or robustness is the presence of short-time correlations across the network instances which we quantify by a novel metric the-edge emergence factor, denoted as ξ. We find that standard targeted attacks are not effective in collapsing this network structure. Remarkably, if the hourly community structures of the temporal network instances are attacked with the largest size community attacked first, the second largest next and so on, the network soon collapses. This behavior, we show is an outcome of the fact that the edge emergence factor bears a strong positive correlation with the size ordered community structures.

Common cold outbreaks: A network theory approach

NASA Astrophysics Data System (ADS)

Vishkaie, Faranak Rajabi; Bakouie, Fatemeh; Gharibzadeh, Shahriar

2014-11-01

In this study, at first we evaluated the network structure in social encounters by which respiratory diseases can spread. We considered common-cold and recorded a sample of human population and actual encounters between them. Our results show that the database structure presents a great value of clustering. In the second step, we evaluated dynamics of disease spread with SIR model by assigning a function to each node of the structural network. The rate of disease spread in networks was observed to be inversely correlated with characteristic path length. Therefore, the shortcuts have a significant role in increasing spread rate. We conclude that the dynamics of social encounters' network stands between the random and the lattice in network spectrum. Although in this study we considered the period of common-cold disease for network dynamics, it seems that similar approaches may be useful for other airborne diseases such as SARS.

Ubiquitousness of link-density and link-pattern communities in real-world networks

NASA Astrophysics Data System (ADS)

Šubelj, L.; Bajec, M.

2012-01-01

Community structure appears to be an intrinsic property of many complex real-world networks. However, recent work shows that real-world networks reveal even more sophisticated modules than classical cohesive (link-density) communities. In particular, networks can also be naturally partitioned according to similar patterns of connectedness among the nodes, revealing link-pattern communities. We here propose a propagation based algorithm that can extract both link-density and link-pattern communities, without any prior knowledge of the true structure. The algorithm was first validated on different classes of synthetic benchmark networks with community structure, and also on random networks. We have further applied the algorithm to different social, information, technological and biological networks, where it indeed reveals meaningful (composites of) link-density and link-pattern communities. The results thus seem to imply that, similarly as link-density counterparts, link-pattern communities appear ubiquitous in nature and design.

Multimedia Information Networks in Social Media

NASA Astrophysics Data System (ADS)

Cao, Liangliang; Qi, Guojun; Tsai, Shen-Fu; Tsai, Min-Hsuan; Pozo, Andrey Del; Huang, Thomas S.; Zhang, Xuemei; Lim, Suk Hwan

The popularity of personal digital cameras and online photo/video sharing community has lead to an explosion of multimedia information. Unlike traditional multimedia data, many new multimedia datasets are organized in a structural way, incorporating rich information such as semantic ontology, social interaction, community media, geographical maps, in addition to the multimedia contents by themselves. Studies of such structured multimedia data have resulted in a new research area, which is referred to as Multimedia Information Networks. Multimedia information networks are closely related to social networks, but especially focus on understanding the topics and semantics of the multimedia files in the context of network structure. This chapter reviews different categories of recent systems related to multimedia information networks, summarizes the popular inference methods used in recent works, and discusses the applications related to multimedia information networks. We also discuss a wide range of topics including public datasets, related industrial systems, and potential future research directions in this field.

Advanced Polymer Network Structures

DTIC Science & Technology

2016-02-01

double networks in a single step was identified from coarse-grained molecular dynamics simulations of polymer solvents bearing rigid side chains dissolved...in a polymer network. Coarse-grained molecular dynamics simulations also explored the mechanical behavior of traditional double networks and...DRI), polymer networks, polymer gels, molecular dynamics simulations , double networks 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF

Nested Neural Networks

NASA Technical Reports Server (NTRS)

Baram, Yoram

1992-01-01

Report presents analysis of nested neural networks, consisting of interconnected subnetworks. Analysis based on simplified mathematical models more appropriate for artificial electronic neural networks, partly applicable to biological neural networks. Nested structure allows for retrieval of individual subpatterns. Requires fewer wires and connection devices than fully connected networks, and allows for local reconstruction of damaged subnetworks without rewiring entire network.

How the initial level of visibility and limited resource affect the evolution of cooperation

NASA Astrophysics Data System (ADS)

Han, Dun; Li, Dandan; Sun, Mei

2016-06-01

This work sheds important light on how the initial level of visibility and limited resource might affect the evolution of the players’ strategies under different network structure. We perform the prisoner’s dilemma game in the lattice network and the scale-free network, the simulation results indicate that the average density of death in lattice network decreases with the increases of the initial proportion of visibility. However, the contrary phenomenon is observed in the scale-free network. Further results reflect that the individuals’ payoff in lattice network is significantly larger than the one in the scale-free network. In the lattice network, the visibility individuals could earn much more than the invisibility one. However, the difference is not apparent in the scale-free network. We also find that a high Successful-Defection-Payoff (SDB) and a rich natural environment have relatively larger deleterious cooperation effects. A high SDB is beneficial to raising the level of visibility in the heterogeneous network, however, that has adverse visibility consequences in homogeneous network. Our result reveals that players are more likely to cooperate voluntarily under homogeneous network structure.

Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes

NASA Astrophysics Data System (ADS)

Yang, Hui; Tang, Ming; Gross, Thilo

2015-08-01

One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that network heterogeneity, i.e. a broad degree distribution, can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. However, it has been pointed out that networks in which the properties of nodes are intrinsically heterogeneous can be very resilient to disease spreading. Heterogeneity in structure can enhance or diminish the resilience of networks with heterogeneous nodes, depending on the correlations between the topological and intrinsic properties. Here, we consider a plausible scenario where people have intrinsic differences in susceptibility and adapt their social network structure to the presence of the disease. We show that the resilience of networks with heterogeneous connectivity can surpass those of networks with homogeneous connectivity. For epidemiology, this implies that network heterogeneity should not be studied in isolation, it is instead the heterogeneity of infection risk that determines the likelihood of outbreaks.

Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes.

PubMed

Yang, Hui; Tang, Ming; Gross, Thilo

2015-08-21

One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that network heterogeneity, i.e. a broad degree distribution, can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. However, it has been pointed out that networks in which the properties of nodes are intrinsically heterogeneous can be very resilient to disease spreading. Heterogeneity in structure can enhance or diminish the resilience of networks with heterogeneous nodes, depending on the correlations between the topological and intrinsic properties. Here, we consider a plausible scenario where people have intrinsic differences in susceptibility and adapt their social network structure to the presence of the disease. We show that the resilience of networks with heterogeneous connectivity can surpass those of networks with homogeneous connectivity. For epidemiology, this implies that network heterogeneity should not be studied in isolation, it is instead the heterogeneity of infection risk that determines the likelihood of outbreaks.

Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan F.; Heitzig, Jobst; Beronov, Boyan; Wiedermann, Marc; Runge, Jakob; Feng, Qing Yi; Tupikina, Liubov; Stolbova, Veronika; Donner, Reik V.; Marwan, Norbert; Dijkstra, Henk A.; Kurths, Jürgen

2015-11-01

We introduce the pyunicorn (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. pyunicorn is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics, or network surrogates. Additionally, pyunicorn provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence quantification analysis, recurrence networks, visibility graphs, and construction of surrogate time series. The range of possible applications of the library is outlined, drawing on several examples mainly from the field of climatology.

Empirical Reference Distributions for Networks of Different Size

PubMed Central

Smith, Anna; Calder, Catherine A.; Browning, Christopher R.

2016-01-01

Network analysis has become an increasingly prevalent research tool across a vast range of scientific fields. Here, we focus on the particular issue of comparing network statistics, i.e. graph-level measures of network structural features, across multiple networks that differ in size. Although “normalized” versions of some network statistics exist, we demonstrate via simulation why direct comparison is often inappropriate. We consider normalizing network statistics relative to a simple fully parameterized reference distribution and demonstrate via simulation how this is an improvement over direct comparison, but still sometimes problematic. We propose a new adjustment method based on a reference distribution constructed as a mixture model of random graphs which reflect the dependence structure exhibited in the observed networks. We show that using simple Bernoulli models as mixture components in this reference distribution can provide adjusted network statistics that are relatively comparable across different network sizes but still describe interesting features of networks, and that this can be accomplished at relatively low computational expense. Finally, we apply this methodology to a collection of ecological networks derived from the Los Angeles Family and Neighborhood Survey activity location data. PMID:27721556

Structural controllability of unidirectional bipartite networks

NASA Astrophysics Data System (ADS)

Nacher, Jose C.; Akutsu, Tatsuya

2013-04-01

The interactions between fundamental life molecules, people and social organisations build complex architectures that often result in undesired behaviours. Despite all of the advances made in our understanding of network structures over the past decade, similar progress has not been achieved in the controllability of real-world networks. In particular, an analytical framework to address the controllability of bipartite networks is still absent. Here, we present a dominating set (DS)-based approach to bipartite network controllability that identifies the topologies that are relatively easy to control with the minimum number of driver nodes. Our theoretical calculations, assisted by computer simulations and an evaluation of real-world networks offer a promising framework to control unidirectional bipartite networks. Our analysis should open a new approach to reverting the undesired behaviours in unidirectional bipartite networks at will.

Fast detection of the fuzzy communities based on leader-driven algorithm

NASA Astrophysics Data System (ADS)

Fang, Changjian; Mu, Dejun; Deng, Zhenghong; Hu, Jun; Yi, Chen-He

2018-03-01

In this paper, we present the leader-driven algorithm (LDA) for learning community structure in networks. The algorithm allows one to find overlapping clusters in a network, an important aspect of real networks, especially social networks. The algorithm requires no input parameters and learns the number of clusters naturally from the network. It accomplishes this using leadership centrality in a clever manner. It identifies local minima of leadership centrality as followers which belong only to one cluster, and the remaining nodes are leaders which connect clusters. In this way, the number of clusters can be learned using only the network structure. The LDA is also an extremely fast algorithm, having runtime linear in the network size. Thus, this algorithm can be used to efficiently cluster extremely large networks.

On the Structure of Cortical Microcircuits Inferred from Small Sample Sizes.

PubMed

Vegué, Marina; Perin, Rodrigo; Roxin, Alex

2017-08-30

The structure in cortical microcircuits deviates from what would be expected in a purely random network, which has been seen as evidence of clustering. To address this issue, we sought to reproduce the nonrandom features of cortical circuits by considering several distinct classes of network topology, including clustered networks, networks with distance-dependent connectivity, and those with broad degree distributions. To our surprise, we found that all of these qualitatively distinct topologies could account equally well for all reported nonrandom features despite being easily distinguishable from one another at the network level. This apparent paradox was a consequence of estimating network properties given only small sample sizes. In other words, networks that differ markedly in their global structure can look quite similar locally. This makes inferring network structure from small sample sizes, a necessity given the technical difficulty inherent in simultaneous intracellular recordings, problematic. We found that a network statistic called the sample degree correlation (SDC) overcomes this difficulty. The SDC depends only on parameters that can be estimated reliably given small sample sizes and is an accurate fingerprint of every topological family. We applied the SDC criterion to data from rat visual and somatosensory cortex and discovered that the connectivity was not consistent with any of these main topological classes. However, we were able to fit the experimental data with a more general network class, of which all previous topologies were special cases. The resulting network topology could be interpreted as a combination of physical spatial dependence and nonspatial, hierarchical clustering. SIGNIFICANCE STATEMENT The connectivity of cortical microcircuits exhibits features that are inconsistent with a simple random network. Here, we show that several classes of network models can account for this nonrandom structure despite qualitative differences in their global properties. This apparent paradox is a consequence of the small numbers of simultaneously recorded neurons in experiment: when inferred via small sample sizes, many networks may be indistinguishable despite being globally distinct. We develop a connectivity measure that successfully classifies networks even when estimated locally with a few neurons at a time. We show that data from rat cortex is consistent with a network in which the likelihood of a connection between neurons depends on spatial distance and on nonspatial, asymmetric clustering. Copyright © 2017 the authors 0270-6474/17/378498-13$15.00/0.

Ownership strategies of multinational corporations: Towards designing effective global networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Raghunathan, S.P.

1992-01-01

The thesis of this research is that MNCs, attempting to implement different international strategies in response to several environmental factors, let their global networks evolve. The ownership structure of the network is therefore a function of the international strategy and environment of a firm. A particular strategy (configuration/coordination), given a certain environment, may be effective if associated with the appropriate structure. This study is based on a survey of 318 US manufacturing-sector MNCs using a questionnaire. The ownership structure of an MNC network was identified by studying the nature of ownership - method and form - of overseas subsidiaries. Usingmore » network theoretic methods, ownership structure was empirically related to international environment, strategy, and performance. Results of this study throw light on the design of global networks and enable a general theory of the design of MNCs to be eventually developed.« less

Displacement and deformation measurement for large structures by camera network

NASA Astrophysics Data System (ADS)

Shang, Yang; Yu, Qifeng; Yang, Zhen; Xu, Zhiqiang; Zhang, Xiaohu

2014-03-01

A displacement and deformation measurement method for large structures by a series-parallel connection camera network is presented. By taking the dynamic monitoring of a large-scale crane in lifting operation as an example, a series-parallel connection camera network is designed, and the displacement and deformation measurement method by using this series-parallel connection camera network is studied. The movement range of the crane body is small, and that of the crane arm is large. The displacement of the crane body, the displacement of the crane arm relative to the body and the deformation of the arm are measured. Compared with a pure series or parallel connection camera network, the designed series-parallel connection camera network can be used to measure not only the movement and displacement of a large structure but also the relative movement and deformation of some interesting parts of the large structure by a relatively simple optical measurement system.

The evolutionary and ecological consequences of animal social networks: emerging issues.

PubMed

Kurvers, Ralf H J M; Krause, Jens; Croft, Darren P; Wilson, Alexander D M; Wolf, Max

2014-06-01

The first generation of research on animal social networks was primarily aimed at introducing the concept of social networks to the fields of animal behaviour and behavioural ecology. More recently, a diverse body of evidence has shown that social fine structure matters on a broader scale than initially expected, affecting many key ecological and evolutionary processes. Here, we review this development. We discuss the effects of social network structure on evolutionary dynamics (genetic drift, fixation probabilities, and frequency-dependent selection) and social evolution (cooperation and between-individual behavioural differences). We discuss how social network structure can affect important coevolutionary processes (host-pathogen interactions and mutualisms) and population stability. We also discuss the potentially important, but poorly studied, role of social network structure on dispersal and invasion. Throughout, we highlight important areas for future research. Copyright © 2014 Elsevier Ltd. All rights reserved.

Network Ecology and Adolescent Social Structure

PubMed Central

McFarland, Daniel A.; Moody, James; Diehl, David; Smith, Jeffrey A.; Thomas, Reuben J.

2014-01-01

Adolescent societies—whether arising from weak, short-term classroom friendships or from close, long-term friendships—exhibit various levels of network clustering, segregation, and hierarchy. Some are rank-ordered caste systems and others are flat, cliquish worlds. Explaining the source of such structural variation remains a challenge, however, because global network features are generally treated as the agglomeration of micro-level tie-formation mechanisms, namely balance, homophily, and dominance. How do the same micro-mechanisms generate significant variation in global network structures? To answer this question we propose and test a network ecological theory that specifies the ways features of organizational environments moderate the expression of tie-formation processes, thereby generating variability in global network structures across settings. We develop this argument using longitudinal friendship data on schools (Add Health study) and classrooms (Classroom Engagement study), and by extending exponential random graph models to the study of multiple societies over time. PMID:25535409

Dynamic functional connectivity using state-based dynamic community structure: method and application to opioid analgesia.

PubMed

Robinson, Lucy F; Atlas, Lauren Y; Wager, Tor D

2015-03-01

We present a new method, State-based Dynamic Community Structure, that detects time-dependent community structure in networks of brain regions. Most analyses of functional connectivity assume that network behavior is static in time, or differs between task conditions with known timing. Our goal is to determine whether brain network topology remains stationary over time, or if changes in network organization occur at unknown time points. Changes in network organization may be related to shifts in neurological state, such as those associated with learning, drug uptake or experimental conditions. Using a hidden Markov stochastic blockmodel, we define a time-dependent community structure. We apply this approach to data from a functional magnetic resonance imaging experiment examining how contextual factors influence drug-induced analgesia. Results reveal that networks involved in pain, working memory, and emotion show distinct profiles of time-varying connectivity. Copyright © 2014 Elsevier Inc. All rights reserved.

Network Ecology and Adolescent Social Structure.

PubMed

McFarland, Daniel A; Moody, James; Diehl, David; Smith, Jeffrey A; Thomas, Reuben J

2014-12-01

Adolescent societies-whether arising from weak, short-term classroom friendships or from close, long-term friendships-exhibit various levels of network clustering, segregation, and hierarchy. Some are rank-ordered caste systems and others are flat, cliquish worlds. Explaining the source of such structural variation remains a challenge, however, because global network features are generally treated as the agglomeration of micro-level tie-formation mechanisms, namely balance, homophily, and dominance. How do the same micro-mechanisms generate significant variation in global network structures? To answer this question we propose and test a network ecological theory that specifies the ways features of organizational environments moderate the expression of tie-formation processes, thereby generating variability in global network structures across settings. We develop this argument using longitudinal friendship data on schools (Add Health study) and classrooms (Classroom Engagement study), and by extending exponential random graph models to the study of multiple societies over time.

The circadian rhythm induced by the heterogeneous network structure of the suprachiasmatic nucleus

NASA Astrophysics Data System (ADS)

Gu, Changgui; Yang, Huijie

2016-05-01

In mammals, the master clock is located in the suprachiasmatic nucleus (SCN), which is composed of about 20 000 nonidentical neuronal oscillators expressing different intrinsic periods. These neurons are coupled through neurotransmitters to form a network consisting of two subgroups, i.e., a ventrolateral (VL) subgroup and a dorsomedial (DM) subgroup. The VL contains about 25% SCN neurons that receive photic input from the retina, and the DM comprises the remaining 75% SCN neurons which are coupled to the VL. The synapses from the VL to the DM are evidently denser than that from the DM to the VL, in which the VL dominates the DM. Therefore, the SCN is a heterogeneous network where the neurons of the VL are linked with a large number of SCN neurons. In the present study, we mimicked the SCN network based on Goodwin model considering four types of networks including an all-to-all network, a Newman-Watts (NW) small world network, an Erdös-Rényi (ER) random network, and a Barabási-Albert (BA) scale free network. We found that the circadian rhythm was induced in the BA, ER, and NW networks, while the circadian rhythm was absent in the all-to-all network with weak cellular coupling, where the amplitude of the circadian rhythm is largest in the BA network which is most heterogeneous in the network structure. Our finding provides an alternative explanation for the induction or enhancement of circadian rhythm by the heterogeneity of the network structure.

Effects of Neuromodulation on Excitatory-Inhibitory Neural Network Dynamics Depend on Network Connectivity Structure

NASA Astrophysics Data System (ADS)

Rich, Scott; Zochowski, Michal; Booth, Victoria

2018-01-01

Acetylcholine (ACh), one of the brain's most potent neuromodulators, can affect intrinsic neuron properties through blockade of an M-type potassium current. The effect of ACh on excitatory and inhibitory cells with this potassium channel modulates their membrane excitability, which in turn affects their tendency to synchronize in networks. Here, we study the resulting changes in dynamics in networks with inter-connected excitatory and inhibitory populations (E-I networks), which are ubiquitous in the brain. Utilizing biophysical models of E-I networks, we analyze how the network connectivity structure in terms of synaptic connectivity alters the influence of ACh on the generation of synchronous excitatory bursting. We investigate networks containing all combinations of excitatory and inhibitory cells with high (Type I properties) or low (Type II properties) modulatory tone. To vary network connectivity structure, we focus on the effects of the strengths of inter-connections between excitatory and inhibitory cells (E-I synapses and I-E synapses), and the strengths of intra-connections among excitatory cells (E-E synapses) and among inhibitory cells (I-I synapses). We show that the presence of ACh may or may not affect the generation of network synchrony depending on the network connectivity. Specifically, strong network inter-connectivity induces synchronous excitatory bursting regardless of the cellular propensity for synchronization, which aligns with predictions of the PING model. However, when a network's intra-connectivity dominates its inter-connectivity, the propensity for synchrony of either inhibitory or excitatory cells can determine the generation of network-wide bursting.

The association between social network relationships and depressive symptoms among older Americans: what matters most?

PubMed

Litwin, Howard

2011-08-01

Although social network relationships are linked to mental health in late life, it is still unclear whether it is the structure of social networks or their perceived quality that matters. The current study regressed a dichotomous 8-item version of the Center for Epidemiological Studies Depression Scale (CESD-8) score on measures of social network relationships among Americans, aged 65-85 years, from the first wave of the National Social Life, Health and Aging Project. The network indicators included a structural variable - social network type - and a series of relationship quality indicators: perceived positive and negative ties with family, friends and spouse/ partner. Multivariate logistic regression analyses controlled for age, gender, education, income, race/ethnicity, religious affiliation, functional health and physical health. The perceived social network quality variables were unrelated to the presence of a high level of depressive symptoms, but social network type maintained an association with this mental health outcome even after controlling for confounders. Respondents embedded in resourceful social network types in terms of social capital--"diverse," "friend" and "congregant" networks--reported less presence of depressive symptoms, to varying degrees. The results show that the structure of the network seems to matter more than the perceived quality of the ties as an indicator of depressive symptoms. Moreover, the composite network type variable stands out in capturing the differences in mental state. The construct of network type should be incorporated in mental health screening among older people who reside in the community. One's social network type can be an important initial indicator that one is at risk.

Whole-brain analytic measures of network communication reveal increased structure-function correlation in right temporal lobe epilepsy.

PubMed

Wirsich, Jonathan; Perry, Alistair; Ridley, Ben; Proix, Timothée; Golos, Mathieu; Bénar, Christian; Ranjeva, Jean-Philippe; Bartolomei, Fabrice; Breakspear, Michael; Jirsa, Viktor; Guye, Maxime

2016-01-01

The in vivo structure-function relationship is key to understanding brain network reorganization due to pathologies. This relationship is likely to be particularly complex in brain network diseases such as temporal lobe epilepsy, in which disturbed large-scale systems are involved in both transient electrical events and long-lasting functional and structural impairments. Herein, we estimated this relationship by analyzing the correlation between structural connectivity and functional connectivity in terms of analytical network communication parameters. As such, we targeted the gradual topological structure-function reorganization caused by the pathology not only at the whole brain scale but also both in core and peripheral regions of the brain. We acquired diffusion (dMRI) and resting-state fMRI (rsfMRI) data in seven right-lateralized TLE (rTLE) patients and fourteen healthy controls and analyzed the structure-function relationship by using analytical network communication metrics derived from the structural connectome. In rTLE patients, we found a widespread hypercorrelated functional network. Network communication analysis revealed greater unspecific branching of the shortest path (search information) in the structural connectome and a higher global correlation between the structural and functional connectivity for the patient group. We also found evidence for a preserved structural rich-club in the patient group. In sum, global augmentation of structure-function correlation might be linked to a smaller functional repertoire in rTLE patients, while sparing the central core of the brain which may represent a pathway that facilitates the spread of seizures.

Enhancing robustness and immunization in geographical networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huang Liang; Department of Physics, Lanzhou University, Lanzhou 730000; Yang Kongqing

2007-03-15

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

Neurocomputing

NASA Technical Reports Server (NTRS)

Hecht-Nielsen, Robert

1990-01-01

The present work is intended to give technologists, research scientists, and mathematicians a graduate-level overview of the field of neurocomputing. After exploring the relationship of this field to general neuroscience, attention is given to neural network building blocks, the self-adaptation equations of learning laws, the data-transformation structures of associative networks, and the multilayer data-transformation structures of mapping networks. Also treated are the neurocomputing frontiers of spatiotemporal, stochastic, and hierarchical networks, 'neurosoftware', the creation of neural network-based computers, and neurocomputing applications in sensor processing, control, and data analysis.

Synconset Waves and Chains: Spiking Onsets in Synchronous Populations Predict and Are Predicted by Network Structure

PubMed Central

Raghavan, Mohan; Amrutur, Bharadwaj; Narayanan, Rishikesh; Sikdar, Sujit Kumar

2013-01-01

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 utilities of our framework to several aspects of network physiology including cell assemblies, population codes, and oscillatory synchrony. PMID:24116018

Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches.

PubMed

Enns, Eva A; Brandeau, Margaret L

2015-04-21

For many communicable diseases, knowledge of the underlying contact network through which the disease spreads is essential to determining appropriate control measures. When behavior change is the primary intervention for disease prevention, it is important to understand how to best modify network connectivity using the limited resources available to control disease spread. We describe and compare four algorithms for selecting a limited number of links to remove from a network: two "preventive" approaches (edge centrality, R0 minimization), where the decision of which links to remove is made prior to any disease outbreak and depends only on the network structure; and two "reactive" approaches (S-I edge centrality, optimal quarantining), where information about the initial disease states of the nodes is incorporated into the decision of which links to remove. We evaluate the performance of these algorithms in minimizing the total number of infections that occur over the course of an acute outbreak of disease. We consider different network structures, including both static and dynamic Erdös-Rényi random networks with varying levels of connectivity, a real-world network of residential hotels connected through injection drug use, and a network exhibiting community structure. We show that reactive approaches outperform preventive approaches in averting infections. Among reactive approaches, removing links in order of S-I edge centrality is favored when the link removal budget is small, while optimal quarantining performs best when the link removal budget is sufficiently large. The budget threshold above which optimal quarantining outperforms the S-I edge centrality algorithm is a function of both network structure (higher for unstructured Erdös-Rényi random networks compared to networks with community structure or the real-world network) and disease infectiousness (lower for highly infectious diseases). We conduct a value-of-information analysis of knowing which nodes are initially infected by comparing the performance improvement achieved by reactive over preventive strategies. We find that such information is most valuable for moderate budget levels, with increasing value as disease spread becomes more likely (due to either increased connectedness of the network or increased infectiousness of the disease). Copyright © 2015 Elsevier Ltd. All rights reserved.

Link removal for the control of stochastically evolving epidemics over networks: A comparison of approaches

PubMed Central

Brandeau, Margaret L.

2015-01-01

For many communicable diseases, knowledge of the underlying contact network through which the disease spreads is essential to determining appropriate control measures. When behavior change is the primary intervention for disease prevention, it is important to understand how to best modify network connectivity using the limited resources available to control disease spread. We describe and compare four algorithms for selecting a limited number of links to remove from a network: two “preventive” approaches (edge centrality, R0 minimization), where the decision of which links to remove is made prior to any disease outbreak and depends only on the network structure; and two “reactive” approaches (S-I edge centrality, optimal quarantining), where information about the initial disease states of the nodes is incorporated into the decision of which links to remove. We evaluate the performance of these algorithms in minimizing the total number of infections that occur over the course of an acute outbreak of disease. We consider different network structures, including both static and dynamic Erdős-Rényi random networks with varying levels of connectivity, a real-world network of residential hotels connected through injection drug use, and a network exhibiting community structure. We show that reactive approaches outperform preventive approaches in averting infections. Among reactive approaches, removing links in order of S-I edge centrality is favored when the link removal budget is small, while optimal quarantining performs best when the link removal budget is sufficiently large. The budget threshold above which optimal quarantining outperforms the S-I edge centrality algorithm is a function of both network structure (higher for unstructured Erdős-Rényi random networks compared to networks with community structure or the real-world network) and disease infectiousness (lower for highly infectious diseases). We conduct a value-of-information analysis of knowing which nodes are initially infected by comparing the performance improvement achieved by reactive over preventive strategies. We find that such information is most valuable for moderate budget levels, with increasing value as disease spread becomes more likely (due to either increased connectedness of the network or increased infectiousness of the disease). PMID:25698229

The Structure of Male Adolescent Peer Networks and Risk for Intimate Partner Violence Perpetration: Findings from a National Sample

ERIC Educational Resources Information Center

Casey, Erin A.; Beadnell, Blair

2010-01-01

Although peer networks have been implicated as influential in a range of adolescent behaviors, little is known about relationships between peer network structures and risk for intimate partner violence (IPV) among youth. This study is a descriptive analysis of how peer network "types" may be related to subsequent risk for IPV…

A Social Network Analysis of Teaching and Research Collaboration in a Teachers' Virtual Learning Community

ERIC Educational Resources Information Center

Lin, Xiaofan; Hu, Xiaoyong; Hu, Qintai; Liu, Zhichun

2016-01-01

Analysing the structure of a social network can help us understand the key factors influencing interaction and collaboration in a virtual learning community (VLC). Here, we describe the mechanisms used in social network analysis (SNA) to analyse the social network structure of a VLC for teachers and discuss the relationship between face-to-face…

Maximal Neighbor Similarity Reveals Real Communities in Networks

PubMed Central

Žalik, Krista Rizman

2015-01-01

An important problem in the analysis of network data is the detection of groups of densely interconnected nodes also called modules or communities. Community structure reveals functions and organizations of networks. Currently used algorithms for community detection in large-scale real-world networks are computationally expensive or require a priori information such as the number or sizes of communities or are not able to give the same resulting partition in multiple runs. In this paper we investigate a simple and fast algorithm that uses the network structure alone and requires neither optimization of pre-defined objective function nor information about number of communities. We propose a bottom up community detection algorithm in which starting from communities consisting of adjacent pairs of nodes and their maximal similar neighbors we find real communities. We show that the overall advantage of the proposed algorithm compared to the other community detection algorithms is its simple nature, low computational cost and its very high accuracy in detection communities of different sizes also in networks with blurred modularity structure consisting of poorly separated communities. All communities identified by the proposed method for facebook network and E-Coli transcriptional regulatory network have strong structural and functional coherence. PMID:26680448

Centrality measures in temporal networks with time series analysis

NASA Astrophysics Data System (ADS)

Huang, Qiangjuan; Zhao, Chengli; Zhang, Xue; Wang, Xiaojie; Yi, Dongyun

2017-05-01

The study of identifying important nodes in networks has a wide application in different fields. However, the current researches are mostly based on static or aggregated networks. Recently, the increasing attention to networks with time-varying structure promotes the study of node centrality in temporal networks. In this paper, we define a supra-evolution matrix to depict the temporal network structure. With using of the time series analysis, the relationships between different time layers can be learned automatically. Based on the special form of the supra-evolution matrix, the eigenvector centrality calculating problem is turned into the calculation of eigenvectors of several low-dimensional matrices through iteration, which effectively reduces the computational complexity. Experiments are carried out on two real-world temporal networks, Enron email communication network and DBLP co-authorship network, the results of which show that our method is more efficient at discovering the important nodes than the common aggregating method.

Emergence, evolution and scaling of online social networks.

PubMed

Wang, Le-Zhi; Huang, Zi-Gang; Rong, Zhi-Hai; Wang, Xiao-Fan; Lai, Ying-Cheng

2014-01-01

Online social networks have become increasingly ubiquitous and understanding their structural, dynamical, and scaling properties not only is of fundamental interest but also has a broad range of applications. Such networks can be extremely dynamic, generated almost instantaneously by, for example, breaking-news items. We investigate a common class of online social networks, the user-user retweeting networks, by analyzing the empirical data collected from Sina Weibo (a massive twitter-like microblogging social network in China) with respect to the topic of the 2011 Japan earthquake. We uncover a number of algebraic scaling relations governing the growth and structure of the network and develop a probabilistic model that captures the basic dynamical features of the system. The model is capable of reproducing all the empirical results. Our analysis not only reveals the basic mechanisms underlying the dynamics of the retweeting networks, but also provides general insights into the control of information spreading on such networks.

Reciprocity of weighted networks

PubMed Central

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

2013-01-01

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

Reciprocity of weighted networks.

PubMed

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

2013-01-01

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

Describing spatial pattern in stream networks: A practical approach

USGS Publications Warehouse

Ganio, L.M.; Torgersen, C.E.; Gresswell, R.E.

2005-01-01

The shape and configuration of branched networks influence ecological patterns and processes. Recent investigations of network influences in riverine ecology stress the need to quantify spatial structure not only in a two-dimensional plane, but also in networks. An initial step in understanding data from stream networks is discerning non-random patterns along the network. On the other hand, data collected in the network may be spatially autocorrelated and thus not suitable for traditional statistical analyses. Here we provide a method that uses commercially available software to construct an empirical variogram to describe spatial pattern in the relative abundance of coastal cutthroat trout in headwater stream networks. We describe the mathematical and practical considerations involved in calculating a variogram using a non-Euclidean distance metric to incorporate the network pathway structure in the analysis of spatial variability, and use a non-parametric technique to ascertain if the pattern in the empirical variogram is non-random.

A geostatistical approach for describing spatial pattern in stream networks

USGS Publications Warehouse

Ganio, L.M.; Torgersen, C.E.; Gresswell, R.E.

2005-01-01

The shape and configuration of branched networks influence ecological patterns and processes. Recent investigations of network influences in riverine ecology stress the need to quantify spatial structure not only in a two-dimensional plane, but also in networks. An initial step in understanding data from stream networks is discerning non-random patterns along the network. On the other hand, data collected in the network may be spatially autocorrelated and thus not suitable for traditional statistical analyses. Here we provide a method that uses commercially available software to construct an empirical variogram to describe spatial pattern in the relative abundance of coastal cutthroat trout in headwater stream networks. We describe the mathematical and practical considerations involved in calculating a variogram using a non-Euclidean distance metric to incorporate the network pathway structure in the analysis of spatial variability, and use a non-parametric technique to ascertain if the pattern in the empirical variogram is non-random.

A Mobile Satellite Experiment (MSAT-X) network definition

NASA Technical Reports Server (NTRS)

Wang, Charles C.; Yan, Tsun-Yee

1990-01-01

The network architecture development of the Mobile Satellite Experiment (MSAT-X) project for the past few years is described. The results and findings of the network research activities carried out under the MSAT-X project are summarized. A framework is presented upon which the Mobile Satellite Systems (MSSs) operator can design a commercial network. A sample network configuration and its capability are also included under the projected scenario. The Communication Interconnection aspect of the MSAT-X network is discussed. In the MSAT-X network structure two basic protocols are presented: the channel access protocol, and the link connection protocol. The error-control techniques used in the MSAT-X project and the packet structure are also discussed. A description of two testbeds developed for experimentally simulating the channel access protocol and link control protocol, respectively, is presented. A sample network configuration and some future network activities of the MSAT-X project are also presented.

Multilayer networks reveal the spatial structure of seed-dispersal interactions across the Great Rift landscapes.

PubMed

Timóteo, Sérgio; Correia, Marta; Rodríguez-Echeverría, Susana; Freitas, Helena; Heleno, Ruben

2018-01-10

Species interaction networks are traditionally explored as discrete entities with well-defined spatial borders, an oversimplification likely impairing their applicability. Using a multilayer network approach, explicitly accounting for inter-habitat connectivity, we investigate the spatial structure of seed-dispersal networks across the Gorongosa National Park, Mozambique. We show that the overall seed-dispersal network is composed by spatially explicit communities of dispersers spanning across habitats, functionally linking the landscape mosaic. Inter-habitat connectivity determines spatial structure, which cannot be accurately described with standard monolayer approaches either splitting or merging habitats. Multilayer modularity cannot be predicted by null models randomizing either interactions within each habitat or those linking habitats; however, as habitat connectivity increases, random processes become more important for overall structure. The importance of dispersers for the overall network structure is captured by multilayer versatility but not by standard metrics. Highly versatile species disperse many plant species across multiple habitats, being critical to landscape functional cohesion.

Relating microstructure to rheology of a bundled and cross-linked F-actin network in vitro

NASA Astrophysics Data System (ADS)

Shin, J. H.; Gardel, M. L.; Mahadevan, L.; Matsudaira, P.; Weitz, D. A.

2004-06-01

The organization of individual actin filaments into higher-order structures is controlled by actin-binding proteins (ABPs). Although the biological significance of the ABPs is well documented, little is known about how bundling and cross-linking quantitatively affect the microstructure and mechanical properties of actin networks. Here we quantify the effect of the ABP scruin on actin networks by using imaging techniques, cosedimentation assays, multiparticle tracking, and bulk rheology. We show how the structure of the actin network is modified as the scruin concentration is varied, and we correlate these structural changes to variations in the resultant network elasticity.

Evidence of social network influence on multiple HIV risk behaviors and normative beliefs among young Tanzanian men

PubMed Central

Mulawa, Marta; Yamanis, Thespina J.; Hill, Lauren; Balvanz, Peter; Kajula, Lusajo J.; Maman, Suzanne

2016-01-01

Research on network-level influences on HIV risk behaviors among young men in sub-Saharan Africa is severely lacking. One significant gap in the literature that may provide direction for future research with this population is understanding the degree to which various HIV risk behaviors and normative beliefs cluster within men’s social networks. Such research may help us understand which HIV-related norms and behaviors have the greatest potential to be changed through social influence. Additionally, few network-based studies have described the structure of social networks of young men in sub-Saharan Africa. Understanding the structure of men’s peer networks may motivate future research examining the ways in which network structures shape the spread of information, adoption of norms, and diffusion of behaviors. We contribute to filling these gaps by using social network analysis and multilevel modeling to describe a unique dataset of mostly young men (n= 1,249 men and 242 women) nested within 59 urban social networks in Dar es Salaam, Tanzania. We examine the means, ranges, and clustering of men’s HIV-related normative beliefs and behaviors. Networks in this urban setting varied substantially in both composition and structure and a large proportion of men engaged in risky behaviors including inconsistent condom use, sexual partner concurrency, and intimate partner violence perpetration. We found significant clustering of normative beliefs and risk behaviors within these men’s social networks. Specifically, network membership explained between 5.78 and 7.17% of variance in men’s normative beliefs and between 1.93 and 15.79% of variance in risk behaviors. Our results suggest that social networks are important socialization sites for young men and may influence the adoption of norms and behaviors. We conclude by calling for more research on men’s social networks in Sub-Saharan Africa and map out several areas of future inquiry. PMID:26874081

Evidence of social network influence on multiple HIV risk behaviors and normative beliefs among young Tanzanian men.

PubMed

Mulawa, Marta; Yamanis, Thespina J; Hill, Lauren M; Balvanz, Peter; Kajula, Lusajo J; Maman, Suzanne

2016-03-01

Research on network-level influences on HIV risk behaviors among young men in sub-Saharan Africa is severely lacking. One significant gap in the literature that may provide direction for future research with this population is understanding the degree to which various HIV risk behaviors and normative beliefs cluster within men's social networks. Such research may help us understand which HIV-related norms and behaviors have the greatest potential to be changed through social influence. Additionally, few network-based studies have described the structure of social networks of young men in sub-Saharan Africa. Understanding the structure of men's peer networks may motivate future research examining the ways in which network structures shape the spread of information, adoption of norms, and diffusion of behaviors. We contribute to filling these gaps by using social network analysis and multilevel modeling to describe a unique dataset of mostly young men (n = 1249 men and 242 women) nested within 59 urban social networks in Dar es Salaam, Tanzania. We examine the means, ranges, and clustering of men's HIV-related normative beliefs and behaviors. Networks in this urban setting varied substantially in both composition and structure and a large proportion of men engaged in risky behaviors including inconsistent condom use, sexual partner concurrency, and intimate partner violence perpetration. We found significant clustering of normative beliefs and risk behaviors within these men's social networks. Specifically, network membership explained between 5.78 and 7.17% of variance in men's normative beliefs and between 1.93 and 15.79% of variance in risk behaviors. Our results suggest that social networks are important socialization sites for young men and may influence the adoption of norms and behaviors. We conclude by calling for more research on men's social networks in Sub-Saharan Africa and map out several areas of future inquiry. Copyright © 2016 Elsevier Ltd. All rights reserved.

Combinatorial explosion in model gene networks

NASA Astrophysics Data System (ADS)

Edwards, R.; Glass, L.

2000-09-01

The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such networks are extremely rich and they offer novel ways to think about how mutations can alter dynamics.

Combinatorial explosion in model gene networks.

PubMed

Edwards, R.; Glass, L.

2000-09-01

The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such networks are extremely rich and they offer novel ways to think about how mutations can alter dynamics. (c) 2000 American Institute of Physics.

Structure of Particle Networks in Capillary Suspensions with Wetting and Nonwetting Fluids

PubMed Central

2016-01-01

The mechanical properties of a suspension can be dramatically altered by adding a small amount of a secondary fluid that is immiscible with the bulk phase. The substantial changes in the strength of these capillary suspensions arise due to the capillary force inducing a percolating particle network. Spatial information on the structure of the particle networks is obtained using confocal microscopy. It is possible, for the first time, to visualize the different types of percolating structures of capillary suspensions in situ. These capillary networks are unique from other types of particulate networks due to the nature of the capillary attraction. We investigate the influence of the three-phase contact angle on the structure of an oil-based capillary suspension with silica microspheres. Contact angles smaller than 90° lead to pendular networks of particles connected with single capillary bridges or clusters comparable to the funicular state in wet granular matter, whereas a different clustered structure, the capillary state, forms for angles larger than 90°. Particle pair distribution functions are obtained by image analysis, which demonstrate differences in the network microstructures. When porous particles are used, the pendular conformation also appears for apparent contact angles larger than 90°. The complex shear modulus can be correlated to these microstructural changes. When the percolating structure is formed, the complex shear modulus increases by nearly three decades. Pendular bridges lead to stronger networks than the capillary state network conformations, but the capillary state clusters are nevertheless much stronger than pure suspensions without the added liquid. PMID:26807651

Mean-field equations for neuronal networks with arbitrary degree distributions.

PubMed

Nykamp, Duane Q; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Heuristic urban transportation network design method, a multilayer coevolution approach

NASA Astrophysics Data System (ADS)

Ding, Rui; Ujang, Norsidah; Hamid, Hussain bin; Manan, Mohd Shahrudin Abd; Li, Rong; Wu, Jianjun

2017-08-01

The design of urban transportation networks plays a key role in the urban planning process, and the coevolution of urban networks has recently garnered significant attention in literature. However, most of these recent articles are based on networks that are essentially planar. In this research, we propose a heuristic multilayer urban network coevolution model with lower layer network and upper layer network that are associated with growth and stimulate one another. We first use the relative neighbourhood graph and the Gabriel graph to simulate the structure of rail and road networks, respectively. With simulation we find that when a specific number of nodes are added, the total travel cost ratio between an expanded network and the initial lower layer network has the lowest value. The cooperation strength Λ and the changeable parameter average operation speed ratio Θ show that transit users' route choices change dramatically through the coevolution process and that their decisions, in turn, affect the multilayer network structure. We also note that the simulated relation between the Gini coefficient of the betweenness centrality, Θ and Λ have an optimal point for network design. This research could inspire the analysis of urban network topology features and the assessment of urban growth trends.

Do governance choices matter in health care networks?: an exploratory configuration study of health care networks.

PubMed

Willem, Annick; Gemmel, Paul

2013-06-24

Health care networks are widely used and accepted as an organizational form that enables integrated care as well as dealing with complex matters in health care. However, research on the governance of health care networks lags behind. The research aim of our study is to explore the type and importance of governance structure and governance mechanisms for network effectiveness. The study has a multiple case study design and covers 22 health care networks. Using a configuration view, combinations of network governance and other network characteristics were studied on the level of the network. Based on interview and questionnaire data, network characteristics were identified and patterns in the data looked for. Neither a dominant (or optimal) governance structure or mechanism nor a perfect fit among governance and other characteristics were revealed, but a number of characteristics that need further study might be related to effective networks such as the role of governmental agencies, legitimacy, and relational, hierarchical, and contractual governance mechanisms as complementary factors. Although the results emphasize the situational character of network governance and effectiveness, they give practitioners in the health care sector indications of which factors might be more or less crucial for network effectiveness.

Mean-field equations for neuronal networks with arbitrary degree distributions

NASA Astrophysics Data System (ADS)

Nykamp, Duane Q.; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Altered Integration of Structural Covariance Networks in Young Children With Type 1 Diabetes.

PubMed

Hosseini, S M Hadi; Mazaika, Paul; Mauras, Nelly; Buckingham, Bruce; Weinzimer, Stuart A; Tsalikian, Eva; White, Neil H; Reiss, Allan L

2016-11-01

Type 1 diabetes mellitus (T1D), one of the most frequent chronic diseases in children, is associated with glucose dysregulation that contributes to an increased risk for neurocognitive deficits. While there is a bulk of evidence regarding neurocognitive deficits in adults with T1D, little is known about how early-onset T1D affects neural networks in young children. Recent data demonstrated widespread alterations in regional gray matter and white matter associated with T1D in young children. These widespread neuroanatomical changes might impact the organization of large-scale brain networks. In the present study, we applied graph-theoretical analysis to test whether the organization of structural covariance networks in the brain for a cohort of young children with T1D (N = 141) is altered compared to healthy controls (HC; N = 69). While the networks in both groups followed a small world organization-an architecture that is simultaneously highly segregated and integrated-the T1D network showed significantly longer path length compared with HC, suggesting reduced global integration of brain networks in young children with T1D. In addition, network robustness analysis revealed that the T1D network model showed more vulnerability to neural insult compared with HC. These results suggest that early-onset T1D negatively impacts the global organization of structural covariance networks and influences the trajectory of brain development in childhood. This is the first study to examine structural covariance networks in young children with T1D. Improving glycemic control for young children with T1D might help prevent alterations in brain networks in this population. Hum Brain Mapp 37:4034-4046, 2016. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Structural covariance networks are coupled to expression of genes enriched in supragranular layers of the human cortex.

PubMed

Romero-Garcia, Rafael; Whitaker, Kirstie J; Váša, František; Seidlitz, Jakob; Shinn, Maxwell; Fonagy, Peter; Dolan, Raymond J; Jones, Peter B; Goodyer, Ian M; Bullmore, Edward T; Vértes, Petra E

2018-05-01

Complex network topology is characteristic of many biological systems, including anatomical and functional brain networks (connectomes). Here, we first constructed a structural covariance network from MRI measures of cortical thickness on 296 healthy volunteers, aged 14-24 years. Next, we designed a new algorithm for matching sample locations from the Allen Brain Atlas to the nodes of the SCN. Subsequently we used this to define, transcriptomic brain networks by estimating gene co-expression between pairs of cortical regions. Finally, we explored the hypothesis that transcriptional networks and structural MRI connectomes are coupled. A transcriptional brain network (TBN) and a structural covariance network (SCN) were correlated across connection weights and showed qualitatively similar complex topological properties: assortativity, small-worldness, modularity, and a rich-club. In both networks, the weight of an edge was inversely related to the anatomical (Euclidean) distance between regions. There were differences between networks in degree and distance distributions: the transcriptional network had a less fat-tailed degree distribution and a less positively skewed distance distribution than the SCN. However, cortical areas connected to each other within modules of the SCN had significantly higher levels of whole genome co-expression than expected by chance. Nodes connected in the SCN had especially high levels of expression and co-expression of a human supragranular enriched (HSE) gene set that has been specifically located to supragranular layers of human cerebral cortex and is known to be important for large-scale, long-distance cortico-cortical connectivity. This coupling of brain transcriptome and connectome topologies was largely but not entirely accounted for by the common constraint of physical distance on both networks. Copyright © 2018 The Authors. Published by Elsevier Inc. All rights reserved.

Alternations of White Matter Structural Networks in First Episode Untreated Major Depressive Disorder with Short Duration.

PubMed

Lu, Yi; Shen, Zonglin; Cheng, Yuqi; Yang, Hui; He, Bo; Xie, Yue; Wen, Liang; Zhang, Zhenguang; Sun, Xuejin; Zhao, Wei; Xu, Xiufeng; Han, Dan

2017-01-01

It is crucial to explore the pathogenesis of major depressive disorder (MDD) at the early stage for the better diagnostic and treatment strategies. It was suggested that MDD might be involving in functional or structural alternations at the brain network level. However, at the onset of MDD, whether the whole brain white matter (WM) alterations at network level are already evident still remains unclear. In the present study, diffusion MRI scanning was adopt to depict the unique WM structural network topology across the entire brain at the early stage of MDD. Twenty-one first episode, short duration (<1 year) and drug-naïve depression patients, and 25 healthy control (HC) subjects were recruited. To construct the WM structural network, atlas-based brain regions were used for nodes, and the value of multiplying fiber number by the mean fractional anisotropy along the fiber bundles connected a pair of brain regions were used for edges. The structural network was analyzed by graph theoretic and network-based statistic methods. Pearson partial correlation analysis was also performed to evaluate their correlation with the clinical variables. Compared with HCs, the MDD patients had a significant decrease in the small-worldness (σ). Meanwhile, the MDD patients presented a significantly decreased subnetwork, which mainly involved in the frontal-subcortical and limbic regions. Our results suggested that the abnormal structural network of the orbitofrontal cortex and thalamus, involving the imbalance with the limbic system, might be a key pathology in early stage drug-naive depression. And the structural network analysis might be potential in early detection and diagnosis of MDD.

Design of a sensor network for structural health monitoring of a full-scale composite horizontal tail

NASA Astrophysics Data System (ADS)

Gao, Dongyue; Wang, Yishou; Wu, Zhanjun; Rahim, Gorgin; Bai, Shengbao

2014-05-01

The detection capability of a given structural health monitoring (SHM) system strongly depends on its sensor network placement. In order to minimize the number of sensors while maximizing the detection capability, optimal design of the PZT sensor network placement is necessary for structural health monitoring (SHM) of a full-scale composite horizontal tail. In this study, the sensor network optimization was simplified as a problem of determining the sensor array placement between stiffeners to achieve the desired the coverage rate. First, an analysis of the structural layout and load distribution of a composite horizontal tail was performed. The constraint conditions of the optimal design were presented. Then, the SHM algorithm of the composite horizontal tail under static load was proposed. Based on the given SHM algorithm, a sensor network was designed for the full-scale composite horizontal tail structure. Effective profiles of cross-stiffener paths (CRPs) and uncross-stiffener paths (URPs) were estimated by a Lamb wave propagation experiment in a multi-stiffener composite specimen. Based on the coverage rate and the redundancy requirements, a seven-sensor array-network was chosen as the optimal sensor network for each airfoil. Finally, a preliminary SHM experiment was performed on a typical composite aircraft structure component. The reliability of the SHM result for a composite horizontal tail structure under static load was validated. In the result, the red zone represented the delamination damage. The detection capability of the optimized sensor network was verified by SHM of a full-scale composite horizontal tail; all the diagnosis results were obtained in two minutes. The result showed that all the damage in the monitoring region was covered by the sensor network.

Alternations of White Matter Structural Networks in First Episode Untreated Major Depressive Disorder with Short Duration

PubMed Central

Lu, Yi; Shen, Zonglin; Cheng, Yuqi; Yang, Hui; He, Bo; Xie, Yue; Wen, Liang; Zhang, Zhenguang; Sun, Xuejin; Zhao, Wei; Xu, Xiufeng; Han, Dan

2017-01-01

It is crucial to explore the pathogenesis of major depressive disorder (MDD) at the early stage for the better diagnostic and treatment strategies. It was suggested that MDD might be involving in functional or structural alternations at the brain network level. However, at the onset of MDD, whether the whole brain white matter (WM) alterations at network level are already evident still remains unclear. In the present study, diffusion MRI scanning was adopt to depict the unique WM structural network topology across the entire brain at the early stage of MDD. Twenty-one first episode, short duration (<1 year) and drug-naïve depression patients, and 25 healthy control (HC) subjects were recruited. To construct the WM structural network, atlas-based brain regions were used for nodes, and the value of multiplying fiber number by the mean fractional anisotropy along the fiber bundles connected a pair of brain regions were used for edges. The structural network was analyzed by graph theoretic and network-based statistic methods. Pearson partial correlation analysis was also performed to evaluate their correlation with the clinical variables. Compared with HCs, the MDD patients had a significant decrease in the small-worldness (σ). Meanwhile, the MDD patients presented a significantly decreased subnetwork, which mainly involved in the frontal–subcortical and limbic regions. Our results suggested that the abnormal structural network of the orbitofrontal cortex and thalamus, involving the imbalance with the limbic system, might be a key pathology in early stage drug-naive depression. And the structural network analysis might be potential in early detection and diagnosis of MDD. PMID:29118724

Abstraction networks for terminologies: Supporting management of "big knowledge".

PubMed

Halper, Michael; Gu, Huanying; Perl, Yehoshua; Ochs, Christopher

2015-05-01

Terminologies and terminological systems have assumed important roles in many medical information processing environments, giving rise to the "big knowledge" challenge when terminological content comprises tens of thousands to millions of concepts arranged in a tangled web of relationships. Use and maintenance of knowledge structures on that scale can be daunting. The notion of abstraction network is presented as a means of facilitating the usability, comprehensibility, visualization, and quality assurance of terminologies. An abstraction network overlays a terminology's underlying network structure at a higher level of abstraction. In particular, it provides a more compact view of the terminology's content, avoiding the display of minutiae. General abstraction network characteristics are discussed. Moreover, the notion of meta-abstraction network, existing at an even higher level of abstraction than a typical abstraction network, is described for cases where even the abstraction network itself represents a case of "big knowledge." Various features in the design of abstraction networks are demonstrated in a methodological survey of some existing abstraction networks previously developed and deployed for a variety of terminologies. The applicability of the general abstraction-network framework is shown through use-cases of various terminologies, including the Systematized Nomenclature of Medicine - Clinical Terms (SNOMED CT), the Medical Entities Dictionary (MED), and the Unified Medical Language System (UMLS). Important characteristics of the surveyed abstraction networks are provided, e.g., the magnitude of the respective size reduction referred to as the abstraction ratio. Specific benefits of these alternative terminology-network views, particularly their use in terminology quality assurance, are discussed. Examples of meta-abstraction networks are presented. The "big knowledge" challenge constitutes the use and maintenance of terminological structures that comprise tens of thousands to millions of concepts and their attendant complexity. The notion of abstraction network has been introduced as a tool in helping to overcome this challenge, thus enhancing the usefulness of terminologies. Abstraction networks have been shown to be applicable to a variety of existing biomedical terminologies, and these alternative structural views hold promise for future expanded use with additional terminologies. Copyright © 2015 Elsevier B.V. All rights reserved.

Multilayer motif analysis of brain networks

NASA Astrophysics Data System (ADS)

Battiston, Federico; Nicosia, Vincenzo; Chavez, Mario; Latora, Vito

2017-04-01

In the last decade, network science has shed new light both on the structural (anatomical) and on the functional (correlations in the activity) connectivity among the different areas of the human brain. The analysis of brain networks has made possible to detect the central areas of a neural system and to identify its building blocks by looking at overabundant small subgraphs, known as motifs. However, network analysis of the brain has so far mainly focused on anatomical and functional networks as separate entities. The recently developed mathematical framework of multi-layer networks allows us to perform an analysis of the human brain where the structural and functional layers are considered together. In this work, we describe how to classify the subgraphs of a multiplex network, and we extend the motif analysis to networks with an arbitrary number of layers. We then extract multi-layer motifs in brain networks of healthy subjects by considering networks with two layers, anatomical and functional, respectively, obtained from diffusion and functional magnetic resonance imaging. Results indicate that subgraphs in which the presence of a physical connection between brain areas (links at the structural layer) coexists with a non-trivial positive correlation in their activities are statistically overabundant. Finally, we investigate the existence of a reinforcement mechanism between the two layers by looking at how the probability to find a link in one layer depends on the intensity of the connection in the other one. Showing that functional connectivity is non-trivially constrained by the underlying anatomical network, our work contributes to a better understanding of the interplay between the structure and function in the human brain.

The role of banks in the Brazilian interbank market: Does bank type matter?

NASA Astrophysics Data System (ADS)

Cajueiro, Daniel O.; Tabak, Benjamin M.

2008-12-01

This paper analyzes the Brazilian interbank network structure using a complex network-based approach. Results suggest a weak evidence of community structure, high heterogeneity of the network and that this market is characterized by money centers having exposures to many banks. Furthermore, we go beyond the structure of the network using information about the characteristics of the nodes and a non-parametric test in order to understand the role of the banks in the interbanking market.

Effects of contact network structure on epidemic transmission trees: implications for data required to estimate network structure.

PubMed

Carnegie, Nicole Bohme

2018-01-30

Understanding the dynamics of disease spread is key to developing effective interventions to control or prevent an epidemic. The structure of the network of contacts over which the disease spreads has been shown to have a strong influence on the outcome of the epidemic, but an open question remains as to whether it is possible to estimate contact network features from data collected in an epidemic. The approach taken in this paper is to examine the distributions of epidemic outcomes arising from epidemics on networks with particular structural features to assess whether that structure could be measured from epidemic data and what other constraints might be needed to make the problem identifiable. To this end, we vary the network size, mean degree, and transmissibility of the pathogen, as well as the network feature of interest: clustering, degree assortativity, or attribute-based preferential mixing. We record several standard measures of the size and spread of the epidemic, as well as measures that describe the shape of the transmission tree in order to ascertain whether there are detectable signals in the final data from the outbreak. The results suggest that there is potential to estimate contact network features from transmission trees or pure epidemic data, particularly for diseases with high transmissibility or for which the relevant contact network is of low mean degree. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

Chinese lexical networks: The structure, function and formation

NASA Astrophysics Data System (ADS)

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.

Sociometric network structure and its association with methamphetamine use norms among homeless youth

PubMed Central

Barman-Adhikari, Anamika; Begun, Stephanie; Rice, Eric; Yoshioka-Maxwell, Amanda; Perez-Portillo, Andrea

2016-01-01

Homeless youths' social networks are consistently linked with their substance use. Social networks influence behavior through several mechanisms, especially social norms. This study used sociometric analyses to understand whether social norms of drug use behaviors are clustered in network structures and whether these perceived norms (descriptive and injunctive) influence youths' drug use behaviors. An event-based approach was used to delineate boundaries of the two sociometric networks of homeless youth, one in Los Angeles, CA (n = 160) and the other in Santa Monica, CA (n = 130). Network characteristics included centrality (i.e., popularity) and cohesiveness (location in dense subnetworks). The primary outcome was recent methamphetamine use. Results revealed that both descriptive and injunctive norms influenced methamphetamine use. Network cohesion was found to be associated with perception of both descriptive and injunctive norms in both networks, however in opposite directions. Network interventions therefore might be effective if designed to capitalize on social influence that naturally occurs in cohesive parts of networks. PMID:27194667

Topology effects on nonaffine behavior of semiflexible fiber networks

NASA Astrophysics Data System (ADS)

Hatami-Marbini, H.; Shriyan, V.

2017-12-01

Filamentous semiflexible networks define the mechanical and physical properties of many materials such as cytoskeleton. In the absence of a distinct unit cell, the Mikado fiber network model is commonly used algorithm for representing the microstructure of these networks in numerical models. Nevertheless, certain types of filamentous structures such as collagenous tissues, at early stages of their development, are assembled by growth of individual fibers from random nucleation sites. In this work, we develop a computational model to investigate the mechanical response of such networks by characterizing their nonaffine behavior. We show that the deformation of these networks is nonaffine at all length scales. Furthermore, similar to Mikado networks, the degree of nonaffinity in these structures decreases with increasing the probing length scale, the network fiber density, and/or the bending stiffness of constituting filaments. Nevertheless, despite the lower coordination number of these networks, their deformation field is more affine than that of the Mikado networks with the same fiber density and fiber mechanical properties.

Complexity analysis on public transport networks of 97 large- and medium-sized cities in China

NASA Astrophysics Data System (ADS)

Tian, Zhanwei; Zhang, Zhuo; Wang, Hongfei; Ma, Li

2018-04-01

The traffic situation in Chinese urban areas is continuing to deteriorate. To make a better planning and designing of the public transport system, it is necessary to make profound research on the structure of urban public transport networks (PTNs). We investigate 97 large- and medium-sized cities’ PTNs in China, construct three types of network models — bus stop network, bus transit network and bus line network, then analyze the structural characteristics of them. It is revealed that bus stop network is small-world and scale-free, bus transit network and bus line network are both small-world. Betweenness centrality of each city’s PTN shows similar distribution pattern, although these networks’ size is various. When classifying cities according to the characteristics of PTNs or economic development level, the results are similar. It means that the development of cities’ economy and transport network has a strong correlation, PTN expands in a certain model with the development of economy.

A Comparison of Geographic Information Systems, Complex Networks, and Other Models for Analyzing Transportation Network Topologies

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher

2005-01-01

This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.

Revealing the Hidden Language of Complex Networks

PubMed Central

Yaveroğlu, Ömer Nebil; Malod-Dognin, Noël; Davis, Darren; Levnajic, Zoran; Janjic, Vuk; Karapandza, Rasa; Stojmirovic, Aleksandar; Pržulj, Nataša

2014-01-01

Sophisticated methods for analysing complex networks promise to be of great benefit to almost all scientific disciplines, yet they elude us. In this work, we make fundamental methodological advances to rectify this. We discover that the interaction between a small number of roles, played by nodes in a network, can characterize a network's structure and also provide a clear real-world interpretation. Given this insight, we develop a framework for analysing and comparing networks, which outperforms all existing ones. We demonstrate its strength by uncovering novel relationships between seemingly unrelated networks, such as Facebook, metabolic, and protein structure networks. We also use it to track the dynamics of the world trade network, showing that a country's role of a broker between non-trading countries indicates economic prosperity, whereas peripheral roles are associated with poverty. This result, though intuitive, has escaped all existing frameworks. Finally, our approach translates network topology into everyday language, bringing network analysis closer to domain scientists. PMID:24686408

White matter integrity in brain networks relevant to anxiety and depression: evidence from the human connectome project dataset.

PubMed

De Witte, Nele A J; Mueller, Sven C

2017-12-01

Anxiety and depression are associated with altered communication within global brain networks and between these networks and the amygdala. Functional connectivity studies demonstrate an effect of anxiety and depression on four critical brain networks involved in top-down attentional control (fronto-parietal network; FPN), salience detection and error monitoring (cingulo-opercular network; CON), bottom-up stimulus-driven attention (ventral attention network; VAN), and default mode (default mode network; DMN). However, structural evidence on the white matter (WM) connections within these networks and between these networks and the amygdala is lacking. The current study in a large healthy sample (n = 483) observed that higher trait anxiety-depression predicted lower WM integrity in the connections between amygdala and specific regions of the FPN, CON, VAN, and DMN. We discuss the possible consequences of these anatomical alterations for cognitive-affective functioning and underscore the need for further theory-driven research on individual differences in anxiety and depression on brain structure.

Dermoscopy of accessory nipples in authors’ own study

PubMed Central

Szymszal, Jan; Silny, Wojciech

2014-01-01

Introduction The accessory nipple (AN) is characterised by its network-like structures, which may suggest the diagnosis of a melanocytic lesion. The knowledge about additional dermoscopic features of AN may greatly minimise the risk of unnecessary surgical excisions. Aim To analyse and present different clinical and dermoscopic forms, in which the AN may appear. Material and methods Ninety AN with dermoscopic features were evaluated in the study, detected in 14 patients between the years 2008 and 2014. Results The most common dermoscopic features of the AN were central, scar-like areas (15/19) and peripheral network-like structures (12/19). A number of cleft-like appearances (8/19) and central network-like structures (7/19) had also been observed. Moreover, among the dermoscopic features, white cobblestone-like structures (7/19), a central round dimpling with a plug (6/19) and fisheye-like structures resembling comedo-like openings (9/19) have all also been noted. There is a statistical significance in the occurrence of white cobblestone-like structures with central network-like structures (Fisher's exact test p = 0.0449). The presence of peripheral network-like structures with the occurrence of central scar-like areas was statistically highly significant (p = 0.0091). The central round dimpling was never observed alongside any central network-like structures in any of the lesions (p = 0.0436). Conclusions Accessory nipples are most commonly characterised by the occurrence of a peripheral network-like structure accompanied by the presence of a scar-like area. PMID:25097482

Core-periphery structure requires something else in the network

NASA Astrophysics Data System (ADS)

Kojaku, Sadamori; Masuda, Naoki

2018-04-01

A network with core-periphery structure consists of core nodes that are densely interconnected. In contrast to a community structure, which is a different meso-scale structure of networks, core nodes can be connected to peripheral nodes and peripheral nodes are not densely interconnected. Although core-periphery structure sounds reasonable, we argue that it is merely accounted for by heterogeneous degree distributions, if one partitions a network into a single core block and a single periphery block, which the famous Borgatti–Everett algorithm and many succeeding algorithms assume. In other words, there is a strong tendency that high-degree and low-degree nodes are judged to be core and peripheral nodes, respectively. To discuss core-periphery structure beyond the expectation of the node’s degree (as described by the configuration model), we propose that one needs to assume at least one block of nodes apart from the focal core-periphery structure, such as a different core-periphery pair, community or nodes not belonging to any meso-scale structure. We propose a scalable algorithm to detect pairs of core and periphery in networks, controlling for the effect of the node’s degree. We illustrate our algorithm using various empirical networks.

Formation of porous networks on polymeric surfaces by femtosecond laser micromachining

NASA Astrophysics Data System (ADS)

Assaf, Youssef; Kietzig, Anne-Marie

2017-02-01

In this study, porous network structures were successfully created on various polymer surfaces by femtosecond laser micromachining. Six different polymers (poly(tetrafluoroethylene) (PTFE), poly(methyl methacrylate) (PMMA), high density poly(ethylene) (HDPE), poly(lactic acid) (PLA), poly(carbonate) (PC), and poly(ethylene terephthalate) (PET)) were machined at different fluences and pulse numbers, and the resulting structures were identified and compared by lacunarity analysis. At low fluence and pulse numbers, porous networks were confirmed to form on all materials except PLA. Furthermore, all networks except for PMMA were shown to bundle up at high fluence and pulse numbers. In the case of PC, a complete breakdown of the structure at such conditions was observed. Operation slightly above threshold fluence and at low pulse numbers is therefore recommended for porous network formation. Finally, the thickness over which these structures formed was measured and compared to two intrinsic material dependent parameters: the single pulse threshold fluence and the incubation coefficient. Results indicate that a lower threshold fluence at operating conditions favors material removal over structure formation and is hence detrimental to porous network formation. Favorable machining conditions and material-dependent parameters for the formation of porous networks on polymer surfaces have thus been identified.

Structural Reproduction of Social Networks in Computer-Mediated Communication Forums

ERIC Educational Resources Information Center

Stefanone, M. A.; Gay, G.

2008-01-01

This study explores the relationship between the structure of an existing social network and the structure of an emergent discussion-board network in an undergraduate university class. Thirty-one students were issued with laptop computers that remained in their possession for the duration of the semester. While using these machines, participants'…

Protein secondary structure prediction using modular reciprocal bidirectional recurrent neural networks.

PubMed

Babaei, Sepideh; Geranmayeh, Amir; Seyyedsalehi, Seyyed Ali

2010-12-01

The supervised learning of recurrent neural networks well-suited for prediction of protein secondary structures from the underlying amino acids sequence is studied. Modular reciprocal recurrent neural networks (MRR-NN) are proposed to model the strong correlations between adjacent secondary structure elements. Besides, a multilayer bidirectional recurrent neural network (MBR-NN) is introduced to capture the long-range intramolecular interactions between amino acids in formation of the secondary structure. The final modular prediction system is devised based on the interactive integration of the MRR-NN and the MBR-NN structures to arbitrarily engage the neighboring effects of the secondary structure types concurrent with memorizing the sequential dependencies of amino acids along the protein chain. The advanced combined network augments the percentage accuracy (Q₃) to 79.36% and boosts the segment overlap (SOV) up to 70.09% when tested on the PSIPRED dataset in three-fold cross-validation. Copyright © 2010 Elsevier Ireland Ltd. All rights reserved.

Managing cancer care through service delivery networks: The role of professional collaboration in two European cancer networks.

PubMed

Prades, Joan; Morando, Verdiana; Tozzi, Valeria D; Verhoeven, Didier; Germà, Jose R; Borras, Josep M

2017-01-01

Background The study examines two meso-strategic cancer networks, exploring to what extent collaboration can strengthen or hamper network effectiveness. Unlike macro-strategic networks, meso-strategic networks have no hierarchical governance structures nor are they institutionalised within healthcare services' delivery systems. This study aims to analyse the models of professional cooperation and the tools developed for managing clinical practice within two meso-strategic, European cancer networks. Methods Multiple case study design based on the comparative analysis of two cancer networks: Iridium, in Antwerp, Belgium and the Institut Català d'Oncologia in Catalonia, Spain. The case studies applied mixed methods, with qualitative research based on semi-structured interviews ( n = 35) together with case-site observation and material collection. Results The analysis identified four levels of collaborative intensity within medical specialties as well as in multidisciplinary settings, which became both platforms for crosscutting clinical work between hubs' experts and local care teams and the levers for network-based tools development. The organisation of clinical practice relied on professional-based cooperative processes and tiers, lacking vertical integration mechanisms. Conclusions The intensity of professional linkages largely shaped the potential of meso-strategic cancer networks to influence clinical practice organisation. Conversely, the introduction of managerial techniques or network governance structures, without introducing vertical hierarchies, was found to be critical solutions.

Enhancing biological relevance of a weighted gene co-expression network for functional module identification.

PubMed

Prom-On, Santitham; Chanthaphan, Atthawut; Chan, Jonathan Hoyin; Meechai, Asawin

2011-02-01

Relationships among gene expression levels may be associated with the mechanisms of the disease. While identifying a direct association such as a difference in expression levels between case and control groups links genes to disease mechanisms, uncovering an indirect association in the form of a network structure may help reveal the underlying functional module associated with the disease under scrutiny. This paper presents a method to improve the biological relevance in functional module identification from the gene expression microarray data by enhancing the structure of a weighted gene co-expression network using minimum spanning tree. The enhanced network, which is called a backbone network, contains only the essential structural information to represent the gene co-expression network. The entire backbone network is decoupled into a number of coherent sub-networks, and then the functional modules are reconstructed from these sub-networks to ensure minimum redundancy. The method was tested with a simulated gene expression dataset and case-control expression datasets of autism spectrum disorder and colorectal cancer studies. The results indicate that the proposed method can accurately identify clusters in the simulated dataset, and the functional modules of the backbone network are more biologically relevant than those obtained from the original approach.

Knockouts of high-ranking males have limited impact on baboon social networks.

PubMed

Franz, Mathias; Altmann, Jeanne; Alberts, Susan C

Social network structures can crucially impact complex social processes such as collective behaviour or the transmission of information and diseases. However, currently it is poorly understood how social networks change over time. Previous studies on primates suggest that `knockouts' (due to death or dispersal) of high-ranking individuals might be important drivers for structural changes in animal social networks. Here we test this hypothesis using long-term data on a natural population of baboons, examining the effects of 29 natural knockouts of alpha or beta males on adult female social networks. We investigated whether and how knockouts affected (1) changes in grooming and association rates among adult females, and (2) changes in mean degree and global clustering coefficient in these networks. The only significant effect that we found was a decrease in mean degree in grooming networks in the first month after knockouts, but this decrease was rather small, and grooming networks rebounded to baseline levels by the second month after knockouts. Taken together our results indicate that the removal of high-ranking males has only limited or no lasting effects on social networks of adult female baboons. This finding calls into question the hypothesis that the removal of high-ranking individuals has a destabilizing effect on social network structures in social animals.

Prediction of β-turns in proteins from multiple alignment using neural network

PubMed Central

Kaur, Harpreet; Raghava, Gajendra Pal Singh

2003-01-01

A neural network-based method has been developed for the prediction of β-turns in proteins by using multiple sequence alignment. Two feed-forward back-propagation networks with a single hidden layer are used where the first-sequence structure network is trained with the multiple sequence alignment in the form of PSI-BLAST–generated position-specific scoring matrices. The initial predictions from the first network and PSIPRED-predicted secondary structure are used as input to the second structure-structure network to refine the predictions obtained from the first net. A significant improvement in prediction accuracy has been achieved by using evolutionary information contained in the multiple sequence alignment. The final network yields an overall prediction accuracy of 75.5% when tested by sevenfold cross-validation on a set of 426 nonhomologous protein chains. The corresponding Qpred, Qobs, and Matthews correlation coefficient values are 49.8%, 72.3%, and 0.43, respectively, and are the best among all the previously published β-turn prediction methods. The Web server BetaTPred2 (http://www.imtech.res.in/raghava/betatpred2/) has been developed based on this approach. PMID:12592033

Relationships between cortical myeloarchitecture and electrophysiological networks

PubMed Central

Hunt, Benjamin A. E.; Tewarie, Prejaas K.; Mougin, Olivier E.; Geades, Nicolas; Singh, Krish D.; Morris, Peter G.; Gowland, Penny A.; Brookes, Matthew J.

2016-01-01

The human brain relies upon the dynamic formation and dissolution of a hierarchy of functional networks to support ongoing cognition. However, how functional connectivities underlying such networks are supported by cortical microstructure remains poorly understood. Recent animal work has demonstrated that electrical activity promotes myelination. Inspired by this, we test a hypothesis that gray-matter myelin is related to electrophysiological connectivity. Using ultra-high field MRI and the principle of structural covariance, we derive a structural network showing how myelin density differs across cortical regions and how separate regions can exhibit similar myeloarchitecture. Building upon recent evidence that neural oscillations mediate connectivity, we use magnetoencephalography to elucidate networks that represent the major electrophysiological pathways of communication in the brain. Finally, we show that a significant relationship exists between our functional and structural networks; this relationship differs as a function of neural oscillatory frequency and becomes stronger when integrating oscillations over frequency bands. Our study sheds light on the way in which cortical microstructure supports functional networks. Further, it paves the way for future investigations of the gray-matter structure/function relationship and its breakdown in pathology. PMID:27830650

Population coding in sparsely connected networks of noisy neurons.

PubMed

Tripp, Bryan P; Orchard, Jeff

2012-01-01

This study examines the relationship between population coding and spatial connection statistics in networks of noisy neurons. Encoding of sensory information in the neocortex is thought to require coordinated neural populations, because individual cortical neurons respond to a wide range of stimuli, and exhibit highly variable spiking in response to repeated stimuli. Population coding is rooted in network structure, because cortical neurons receive information only from other neurons, and because the information they encode must be decoded by other neurons, if it is to affect behavior. However, population coding theory has often ignored network structure, or assumed discrete, fully connected populations (in contrast with the sparsely connected, continuous sheet of the cortex). In this study, we modeled a sheet of cortical neurons with sparse, primarily local connections, and found that a network with this structure could encode multiple internal state variables with high signal-to-noise ratio. However, we were unable to create high-fidelity networks by instantiating connections at random according to spatial connection probabilities. In our models, high-fidelity networks required additional structure, with higher cluster factors and correlations between the inputs to nearby neurons.

To cut or not to cut? Assessing the modular structure of brain networks.

PubMed

Chang, Yu-Teng; Pantazis, Dimitrios; Leahy, Richard M

2014-05-01

A wealth of methods has been developed to identify natural divisions of brain networks into groups or modules, with one of the most prominent being modularity. Compared with the popularity of methods to detect community structure, only a few methods exist to statistically control for spurious modules, relying almost exclusively on resampling techniques. It is well known that even random networks can exhibit high modularity because of incidental concentration of edges, even though they have no underlying organizational structure. Consequently, interpretation of community structure is confounded by the lack of principled and computationally tractable approaches to statistically control for spurious modules. In this paper we show that the modularity of random networks follows a transformed version of the Tracy-Widom distribution, providing for the first time a link between module detection and random matrix theory. We compute parametric formulas for the distribution of modularity for random networks as a function of network size and edge variance, and show that we can efficiently control for false positives in brain and other real-world networks. Copyright © 2014 Elsevier Inc. All rights reserved.

Structure and dynamics of stock market in times of crisis

NASA Astrophysics Data System (ADS)

Zhao, Longfeng; Li, Wei; Cai, Xu

2016-02-01

Daily correlations among 322 S&P 500 constituent stocks are investigated by means of correlation-based (CB) network. By using the heterogeneous time scales, we identify global expansion and local clustering market behaviors during crises, which are mainly caused by community splits and inter-sector edge number decreases. The CB networks display distinctive community and sector structures. Graph edit distance is applied to capturing the dynamics of CB networks in which drastic structure reconfigurations can be observed during crisis periods. Edge statistics reveal the power-law nature of edges' duration time distribution. Despite the networks' strong structural changes during crises, we still find some long-duration edges that serve as the backbone of the stock market. Finally the dynamical change of network structure has shown its capability in predicting the implied volatility index (VIX).

Controllability of structural brain networks

NASA Astrophysics Data System (ADS)

Gu, Shi; Pasqualetti, Fabio; Cieslak, Matthew; Telesford, Qawi K.; Yu, Alfred B.; Kahn, Ari E.; Medaglia, John D.; Vettel, Jean M.; Miller, Michael B.; Grafton, Scott T.; Bassett, Danielle S.

2015-10-01

Cognitive function is driven by dynamic interactions between large-scale neural circuits or networks, enabling behaviour. However, fundamental principles constraining these dynamic network processes have remained elusive. Here we use tools from control and network theories to offer a mechanistic explanation for how the brain moves between cognitive states drawn from the network organization of white matter microstructure. Our results suggest that densely connected areas, particularly in the default mode system, facilitate the movement of the brain to many easily reachable states. Weakly connected areas, particularly in cognitive control systems, facilitate the movement of the brain to difficult-to-reach states. Areas located on the boundary between network communities, particularly in attentional control systems, facilitate the integration or segregation of diverse cognitive systems. Our results suggest that structural network differences between cognitive circuits dictate their distinct roles in controlling trajectories of brain network function.

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

NASA Astrophysics Data System (ADS)

Ma, Fei; Yao, Bing

2017-10-01

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

A Network View on Psychiatric Disorders: Network Clusters of Symptoms as Elementary Syndromes of Psychopathology

PubMed Central

Goekoop, Rutger; Goekoop, Jaap G.

2014-01-01

Introduction The vast number of psychopathological syndromes that can be observed in clinical practice can be described in terms of a limited number of elementary syndromes that are differentially expressed. Previous attempts to identify elementary syndromes have shown limitations that have slowed progress in the taxonomy of psychiatric disorders. Aim To examine the ability of network community detection (NCD) to identify elementary syndromes of psychopathology and move beyond the limitations of current classification methods in psychiatry. Methods 192 patients with unselected mental disorders were tested on the Comprehensive Psychopathological Rating Scale (CPRS). Principal component analysis (PCA) was performed on the bootstrapped correlation matrix of symptom scores to extract the principal component structure (PCS). An undirected and weighted network graph was constructed from the same matrix. Network community structure (NCS) was optimized using a previously published technique. Results In the optimal network structure, network clusters showed a 89% match with principal components of psychopathology. Some 6 network clusters were found, including "DEPRESSION", "MANIA", “ANXIETY”, "PSYCHOSIS", "RETARDATION", and "BEHAVIORAL DISORGANIZATION". Network metrics were used to quantify the continuities between the elementary syndromes. Conclusion We present the first comprehensive network graph of psychopathology that is free from the biases of previous classifications: a ‘Psychopathology Web’. Clusters within this network represent elementary syndromes that are connected via a limited number of bridge symptoms. Many problems of previous classifications can be overcome by using a network approach to psychopathology. PMID:25427156

Propagating annotations of molecular networks using in silico fragmentation

PubMed Central

da Silva, Ricardo R.; Wang, Mingxun; Fox, Evan; Balunas, Marcy J.; Klassen, Jonathan L.; Dorrestein, Pieter C.

2018-01-01

The annotation of small molecules is one of the most challenging and important steps in untargeted mass spectrometry analysis, as most of our biological interpretations rely on structural annotations. Molecular networking has emerged as a structured way to organize and mine data from untargeted tandem mass spectrometry (MS/MS) experiments and has been widely applied to propagate annotations. However, propagation is done through manual inspection of MS/MS spectra connected in the spectral networks and is only possible when a reference library spectrum is available. One of the alternative approaches used to annotate an unknown fragmentation mass spectrum is through the use of in silico predictions. One of the challenges of in silico annotation is the uncertainty around the correct structure among the predicted candidate lists. Here we show how molecular networking can be used to improve the accuracy of in silico predictions through propagation of structural annotations, even when there is no match to a MS/MS spectrum in spectral libraries. This is accomplished through creating a network consensus of re-ranked structural candidates using the molecular network topology and structural similarity to improve in silico annotations. The Network Annotation Propagation (NAP) tool is accessible through the GNPS web-platform https://gnps.ucsd.edu/ProteoSAFe/static/gnps-theoretical.jsp. PMID:29668671

Propagating annotations of molecular networks using in silico fragmentation.

PubMed

da Silva, Ricardo R; Wang, Mingxun; Nothias, Louis-Félix; van der Hooft, Justin J J; Caraballo-Rodríguez, Andrés Mauricio; Fox, Evan; Balunas, Marcy J; Klassen, Jonathan L; Lopes, Norberto Peporine; Dorrestein, Pieter C

2018-04-01

The annotation of small molecules is one of the most challenging and important steps in untargeted mass spectrometry analysis, as most of our biological interpretations rely on structural annotations. Molecular networking has emerged as a structured way to organize and mine data from untargeted tandem mass spectrometry (MS/MS) experiments and has been widely applied to propagate annotations. However, propagation is done through manual inspection of MS/MS spectra connected in the spectral networks and is only possible when a reference library spectrum is available. One of the alternative approaches used to annotate an unknown fragmentation mass spectrum is through the use of in silico predictions. One of the challenges of in silico annotation is the uncertainty around the correct structure among the predicted candidate lists. Here we show how molecular networking can be used to improve the accuracy of in silico predictions through propagation of structural annotations, even when there is no match to a MS/MS spectrum in spectral libraries. This is accomplished through creating a network consensus of re-ranked structural candidates using the molecular network topology and structural similarity to improve in silico annotations. The Network Annotation Propagation (NAP) tool is accessible through the GNPS web-platform https://gnps.ucsd.edu/ProteoSAFe/static/gnps-theoretical.jsp.

Coupling effect of nodes popularity and similarity on social network persistence

PubMed Central

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-01-01

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes’ popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology. PMID:28220840

Coupling effect of nodes popularity and similarity on social network persistence

NASA Astrophysics Data System (ADS)

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-02-01

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes’ popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology.

Coupling effect of nodes popularity and similarity on social network persistence.

PubMed

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-02-21

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes' popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology.

Network marketing on a small-world network

NASA Astrophysics Data System (ADS)

Kim, Beom Jun; Jun, Tackseung; Kim, Jeong-Yoo; Choi, M. Y.

2006-02-01

We investigate a dynamic model of network marketing in a small-world network structure artificially constructed similarly to the Watts-Strogatz network model. Different from the traditional marketing, consumers can also play the role of the manufacturer's selling agents in network marketing, which is stimulated by the referral fee the manufacturer offers. As the wiring probability α is increased from zero to unity, the network changes from the one-dimensional regular directed network to the star network where all but one player are connected to one consumer. The price p of the product and the referral fee r are used as free parameters to maximize the profit of the manufacturer. It is observed that at α=0 the maximized profit is constant independent of the network size N while at α≠0, it increases linearly with N. This is in parallel to the small-world transition. It is also revealed that while the optimal value of p stays at an almost constant level in a broad range of α, that of r is sensitive to a change in the network structure. The consumer surplus is also studied and discussed.

Synchronization in a noise-driven developing neural network

NASA Astrophysics Data System (ADS)

Lin, I.-H.; Wu, R.-K.; Chen, C.-M.

2011-11-01

We use computer simulations to investigate the structural and dynamical properties of a developing neural network whose activity is driven by noise. Structurally, the constructed neural networks in our simulations exhibit the small-world properties that have been observed in several neural networks. The dynamical change of neuronal membrane potential is described by the Hodgkin-Huxley model, and two types of learning rules, including spike-timing-dependent plasticity (STDP) and inverse STDP, are considered to restructure the synaptic strength between neurons. Clustered synchronized firing (SF) of the network is observed when the network connectivity (number of connections/maximal connections) is about 0.75, in which the firing rate of neurons is only half of the network frequency. At the connectivity of 0.86, all neurons fire synchronously at the network frequency. The network SF frequency increases logarithmically with the culturing time of a growing network and decreases exponentially with the delay time in signal transmission. These conclusions are consistent with experimental observations. The phase diagrams of SF in a developing network are investigated for both learning rules.

Statistical Analysis of Bus Networks in India

PubMed Central

2016-01-01

In this paper, we model the bus networks of six major Indian cities as graphs in L-space, and evaluate their various statistical properties. While 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 transport plays an important role in day-to-day commutation, it is of significant interest to analyze its topological structure and answer basic questions on its evolution, growth, robustness and resiliency. Although the common feature of small-world property is observed, our analysis reveals a wide spectrum of network topologies arising due to significant variation in the degree-distribution patterns in the networks. We also observe that these networks although, robust and resilient to random attacks are particularly degree-sensitive. Unlike real-world networks, such as Internet, WWW and airline, that are virtual, bus networks are physically constrained. Our findings therefore, throw light on the evolution of such geographically and constrained networks that will help us in designing more efficient bus networks in the future. PMID:27992590

Multilayer Brain Networks

NASA Astrophysics Data System (ADS)

Vaiana, Michael; Muldoon, Sarah Feldt

2018-01-01

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

Endemic infections are always possible on regular networks

NASA Astrophysics Data System (ADS)

Del Genio, Charo I.; House, Thomas

2013-10-01

We study the dependence of the largest component in regular networks on the clustering coefficient, showing that its size changes smoothly without undergoing a phase transition. We explain this behavior via an analytical approach based on the network structure, and provide an exact equation describing the numerical results. Our work indicates that intrinsic structural properties always allow the spread of epidemics on regular networks.

Nanocarbon networks for advanced rechargeable lithium batteries.

PubMed

Xin, Sen; Guo, Yu-Guo; Wan, Li-Jun

2012-10-16

Carbon is one of the essential elements in energy storage. In rechargeable lithium batteries, researchers have considered many types of nanostructured carbons, such as carbon nanoparticles, carbon nanotubes, graphene, and nanoporous carbon, as anode materials and, especially, as key components for building advanced composite electrode materials. Nanocarbons can form efficient three-dimensional conducting networks that improve the performance of electrode materials suffering from the limited kinetics of lithium storage. Although the porous structure guarantees a fast migration of Li ions, the nanocarbon network can serve as an effective matrix for dispersing the active materials to prevent them from agglomerating. The nanocarbon network also affords an efficient electron pathway to provide better electrical contacts. Because of their structural stability and flexibility, nanocarbon networks can alleviate the stress and volume changes that occur in active materials during the Li insertion/extraction process. Through the elegant design of hierarchical electrode materials with nanocarbon networks, researchers can improve both the kinetic performance and the structural stability of the electrode material, which leads to optimal battery capacity, cycling stability, and rate capability. This Account summarizes recent progress in the structural design, chemical synthesis, and characterization of the electrochemical properties of nanocarbon networks for Li-ion batteries. In such systems, storage occurs primarily in the non-carbon components, while carbon acts as the conductor and as the structural buffer. We emphasize representative nanocarbon networks including those that use carbon nanotubes and graphene. We discuss the role of carbon in enhancing the performance of various electrode materials in areas such as Li storage, Li ion and electron transport, and structural stability during cycling. We especially highlight the use of graphene to construct the carbon conducting network for alloy anodes, such as Si and Ge, to accelerate electron transport, alleviate volume change, and prevent the agglomeration of active nanoparticles. Finally, we describe the power of nanocarbon networks for the next generation rechargeable lithium batteries, including Li-S, Li-O(2), and Li-organic batteries, and provide insights into the design of ideal nanocarbon networks for these devices. In addition, we address the ways in which nanocarbon networks can expand the applications of rechargeable lithium batteries into the emerging fields of stationary energy storage and transportation.

A character network study of two Sci-Fi TV series

NASA Astrophysics Data System (ADS)

Tan, M. S. A.; Ujum, E. A.; Ratnavelu, K.

2014-03-01

This work is an analysis of the character networks in two science fiction television series: Stargate and Star Trek. These networks are constructed on the basis of scene co-occurrence between characters to indicate the presence of a connection. Global network structure measures such as the average path length, graph density, network diameter, average degree, median degree, maximum degree, and average clustering coefficient are computed as well as individual node centrality scores. The two fictional networks constructed are found to be quite similar in structure which is astonishing given that Stargate only ran for 18 years in comparison to the 48 years for Star Trek.

Global interrupt and barrier networks

DOEpatents

Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E; Heidelberger, Philip; Kopcsay, Gerard V.; Steinmacher-Burow, Burkhard D.; Takken, Todd E.

2008-10-28

A system and method for generating global asynchronous signals in a computing structure. Particularly, a global interrupt and barrier network is implemented that implements logic for generating global interrupt and barrier signals for controlling global asynchronous operations performed by processing elements at selected processing nodes of a computing structure in accordance with a processing algorithm; and includes the physical interconnecting of the processing nodes for communicating the global interrupt and barrier signals to the elements via low-latency paths. The global asynchronous signals respectively initiate interrupt and barrier operations at the processing nodes at times selected for optimizing performance of the processing algorithms. In one embodiment, the global interrupt and barrier network is implemented in a scalable, massively parallel supercomputing device structure comprising a plurality of processing nodes interconnected by multiple independent networks, with each node including one or more processing elements for performing computation or communication activity as required when performing parallel algorithm operations. One multiple independent network includes a global tree network for enabling high-speed global tree communications among global tree network nodes or sub-trees thereof. The global interrupt and barrier network may operate in parallel with the global tree network for providing global asynchronous sideband signals.

Rich-Cores in Networks

PubMed Central

Ma, Athen; Mondragón, Raúl J.

2015-01-01

A core comprises of a group of central and densely connected nodes which governs the overall behaviour of a network. It is recognised as one of the key meso-scale structures in complex networks. Profiling this meso-scale structure currently relies on a limited number of methods which are often complex and parameter dependent or require a null model. As a result, scalability issues are likely to arise when dealing with very large networks together with the need for subjective adjustment of parameters. The notion of a rich-club describes nodes which are essentially the hub of a network, as they play a dominating role in structural and functional properties. The definition of a rich-club naturally emphasises high degree nodes and divides a network into two subgroups. Here, we develop a method to characterise a rich-core in networks by theoretically coupling the underlying principle of a rich-club with the escape time of a random walker. The method is fast, scalable to large networks and completely parameter free. In particular, we show that the evolution of the core in World Trade and C. elegans networks correspond to responses to historical events and key stages in their physical development, respectively. PMID:25799585

Rich-cores in networks.

PubMed

Ma, Athen; Mondragón, Raúl J

2015-01-01

A core comprises of a group of central and densely connected nodes which governs the overall behaviour of a network. It is recognised as one of the key meso-scale structures in complex networks. Profiling this meso-scale structure currently relies on a limited number of methods which are often complex and parameter dependent or require a null model. As a result, scalability issues are likely to arise when dealing with very large networks together with the need for subjective adjustment of parameters. The notion of a rich-club describes nodes which are essentially the hub of a network, as they play a dominating role in structural and functional properties. The definition of a rich-club naturally emphasises high degree nodes and divides a network into two subgroups. Here, we develop a method to characterise a rich-core in networks by theoretically coupling the underlying principle of a rich-club with the escape time of a random walker. The method is fast, scalable to large networks and completely parameter free. In particular, we show that the evolution of the core in World Trade and C. elegans networks correspond to responses to historical events and key stages in their physical development, respectively.

Random graph models for dynamic networks

NASA Astrophysics Data System (ADS)

Zhang, Xiao; Moore, Cristopher; Newman, Mark E. J.

2017-10-01

Recent theoretical work on the modeling of network structure has focused primarily on networks that are static and unchanging, but many real-world networks change their structure over time. There exist natural generalizations to the dynamic case of many static network models, including the classic random graph, the configuration model, and the stochastic block model, where one assumes that the appearance and disappearance of edges are governed by continuous-time Markov processes with rate parameters that can depend on properties of the nodes. Here we give an introduction to this class of models, showing for instance how one can compute their equilibrium properties. We also demonstrate their use in data analysis and statistical inference, giving efficient algorithms for fitting them to observed network data using the method of maximum likelihood. This allows us, for example, to estimate the time constants of network evolution or infer community structure from temporal network data using cues embedded both in the probabilities over time that node pairs are connected by edges and in the characteristic dynamics of edge appearance and disappearance. We illustrate these methods with a selection of applications, both to computer-generated test networks and real-world examples.

Randomizing bipartite networks: the case of the World Trade Web.

PubMed

Saracco, Fabio; Di Clemente, Riccardo; Gabrielli, Andrea; Squartini, Tiziano

2015-06-01

Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful representation of many systems, ranging from mutualistic networks in ecology to trade networks in economy, whence the need of a pattern detection-oriented analysis in order to identify statistically-significant structural properties. Such an analysis rests upon the definition of suitable null models, i.e. upon the choice of the portion of network structure to be preserved while randomizing everything else. However, quite surprisingly, little work has been done so far to define null models for real bipartite networks. The aim of the present work is to fill this gap, extending a recently-proposed method to randomize monopartite networks to bipartite networks. While the proposed formalism is perfectly general, we apply our method to the binary, undirected, bipartite representation of the World Trade Web, comparing the observed values of a number of structural quantities of interest with the expected ones, calculated via our randomization procedure. Interestingly, the behavior of the World Trade Web in this new representation is strongly different from the monopartite analogue, showing highly non-trivial patterns of self-organization.

A local immunization strategy for networks with overlapping community structure

NASA Astrophysics Data System (ADS)

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.

On the Wiener Polarity Index of Lattice Networks.

PubMed

Chen, Lin; Li, Tao; Liu, Jinfeng; Shi, Yongtang; Wang, Hua

2016-01-01

Network structures are everywhere, including but not limited to applications in biological, physical and social sciences, information technology, and optimization. Network robustness is of crucial importance in all such applications. Research on this topic relies on finding a suitable measure and use this measure to quantify network robustness. A number of distance-based graph invariants, also known as topological indices, have recently been incorporated as descriptors of complex networks. Among them the Wiener type indices are the most well known and commonly used such descriptors. As one of the fundamental variants of the original Wiener index, the Wiener polarity index has been introduced for a long time and known to be related to the cluster coefficient of networks. In this paper, we consider the value of the Wiener polarity index of lattice networks, a common network structure known for its simplicity and symmetric structure. We first present a simple general formula for computing the Wiener polarity index of any graph. Using this formula, together with the symmetric and recursive topology of lattice networks, we provide explicit formulas of the Wiener polarity index of the square lattices, the hexagonal lattices, the triangular lattices, and the 33 ⋅ 42 lattices. We also comment on potential future research topics.

Community Detection in Signed Networks: the Role of Negative ties in Different Scales

PubMed Central

Esmailian, Pouya; Jalili, Mahdi

2015-01-01

Extracting community structure of complex network systems has many applications from engineering to biology and social sciences. There exist many algorithms to discover community structure of networks. However, it has been significantly under-explored for networks with positive and negative links as compared to unsigned ones. Trying to fill this gap, we measured the quality of partitions by introducing a Map Equation for signed networks. It is based on the assumption that negative relations weaken positive flow from a node towards a community, and thus, external (internal) negative ties increase the probability of staying inside (escaping from) a community. We further extended the Constant Potts Model, providing a map spectrum for signed networks. Accordingly, a partition is selected through balancing between abridgment and expatiation of a signed network. Most importantly, multi-scale spectrum of signed networks revealed how informative are negative ties in different scales, and quantified the topological placement of negative ties between dense positive ones. Moreover, an inconsistency was found in the signed Modularity: as the number of negative ties increases, the density of positive ties is neglected more. These results shed lights on the community structure of signed networks. PMID:26395815

Network motif frequency vectors reveal evolving metabolic network organisation.

PubMed

Pearcy, Nicole; Crofts, Jonathan J; Chuzhanova, Nadia

2015-01-01

At the systems level many organisms of interest may be described by their patterns of interaction, and as such, are perhaps best characterised via network or graph models. Metabolic networks, in particular, are fundamental to the proper functioning of many important biological processes, and thus, have been widely studied over the past decade or so. Such investigations have revealed a number of shared topological features, such as a short characteristic path-length, large clustering coefficient and hierarchical modular structure. However, the extent to which evolutionary and functional properties of metabolism manifest via this underlying network architecture remains unclear. In this paper, we employ a novel graph embedding technique, based upon low-order network motifs, to compare metabolic network structure for 383 bacterial species categorised according to a number of biological features. In particular, we introduce a new global significance score which enables us to quantify important evolutionary relationships that exist between organisms and their physical environments. Using this new approach, we demonstrate a number of significant correlations between environmental factors, such as growth conditions and habitat variability, and network motif structure, providing evidence that organism adaptability leads to increased complexities in the resultant metabolic networks.

DeDaL: Cytoscape 3 app for producing and morphing data-driven and structure-driven network layouts.

PubMed

Czerwinska, Urszula; Calzone, Laurence; Barillot, Emmanuel; Zinovyev, Andrei

2015-08-14

Visualization and analysis of molecular profiling data together with biological networks are able to provide new mechanistic insights into biological functions. Currently, it is possible to visualize high-throughput data on top of pre-defined network layouts, but they are not always adapted to a given data analysis task. A network layout based simultaneously on the network structure and the associated multidimensional data might be advantageous for data visualization and analysis in some cases. We developed a Cytoscape app, which allows constructing biological network layouts based on the data from molecular profiles imported as values of node attributes. DeDaL is a Cytoscape 3 app, which uses linear and non-linear algorithms of dimension reduction to produce data-driven network layouts based on multidimensional data (typically gene expression). DeDaL implements several data pre-processing and layout post-processing steps such as continuous morphing between two arbitrary network layouts and aligning one network layout with respect to another one by rotating and mirroring. The combination of all these functionalities facilitates the creation of insightful network layouts representing both structural network features and correlation patterns in multivariate data. We demonstrate the added value of applying DeDaL in several practical applications, including an example of a large protein-protein interaction network. DeDaL is a convenient tool for applying data dimensionality reduction methods and for designing insightful data displays based on data-driven layouts of biological networks, built within Cytoscape environment. DeDaL is freely available for downloading at http://bioinfo-out.curie.fr/projects/dedal/.

Computational Analysis of Residue Interaction Networks and Coevolutionary Relationships in the Hsp70 Chaperones: A Community-Hopping Model of Allosteric Regulation and Communication

PubMed Central

Stetz, Gabrielle; Verkhivker, Gennady M.

2017-01-01

Allosteric interactions in the Hsp70 proteins are linked with their regulatory mechanisms and cellular functions. Despite significant progress in structural and functional characterization of the Hsp70 proteins fundamental questions concerning modularity of the allosteric interaction networks and hierarchy of signaling pathways in the Hsp70 chaperones remained largely unexplored and poorly understood. In this work, we proposed an integrated computational strategy that combined atomistic and coarse-grained simulations with coevolutionary analysis and network modeling of the residue interactions. A novel aspect of this work is the incorporation of dynamic residue correlations and coevolutionary residue dependencies in the construction of allosteric interaction networks and signaling pathways. We found that functional sites involved in allosteric regulation of Hsp70 may be characterized by structural stability, proximity to global hinge centers and local structural environment that is enriched by highly coevolving flexible residues. These specific characteristics may be necessary for regulation of allosteric structural transitions and could distinguish regulatory sites from nonfunctional conserved residues. The observed confluence of dynamics correlations and coevolutionary residue couplings with global networking features may determine modular organization of allosteric interactions and dictate localization of key mediating sites. Community analysis of the residue interaction networks revealed that concerted rearrangements of local interacting modules at the inter-domain interface may be responsible for global structural changes and a population shift in the DnaK chaperone. The inter-domain communities in the Hsp70 structures harbor the majority of regulatory residues involved in allosteric signaling, suggesting that these sites could be integral to the network organization and coordination of structural changes. Using a network-based formalism of allostery, we introduced a community-hopping model of allosteric communication. Atomistic reconstruction of signaling pathways in the DnaK structures captured a direction-specific mechanism and molecular details of signal transmission that are fully consistent with the mutagenesis experiments. The results of our study reconciled structural and functional experiments from a network-centric perspective by showing that global properties of the residue interaction networks and coevolutionary signatures may be linked with specificity and diversity of allosteric regulation mechanisms. PMID:28095400

Computational Analysis of Residue Interaction Networks and Coevolutionary Relationships in the Hsp70 Chaperones: A Community-Hopping Model of Allosteric Regulation and Communication.

PubMed

Stetz, Gabrielle; Verkhivker, Gennady M

2017-01-01

Allosteric interactions in the Hsp70 proteins are linked with their regulatory mechanisms and cellular functions. Despite significant progress in structural and functional characterization of the Hsp70 proteins fundamental questions concerning modularity of the allosteric interaction networks and hierarchy of signaling pathways in the Hsp70 chaperones remained largely unexplored and poorly understood. In this work, we proposed an integrated computational strategy that combined atomistic and coarse-grained simulations with coevolutionary analysis and network modeling of the residue interactions. A novel aspect of this work is the incorporation of dynamic residue correlations and coevolutionary residue dependencies in the construction of allosteric interaction networks and signaling pathways. We found that functional sites involved in allosteric regulation of Hsp70 may be characterized by structural stability, proximity to global hinge centers and local structural environment that is enriched by highly coevolving flexible residues. These specific characteristics may be necessary for regulation of allosteric structural transitions and could distinguish regulatory sites from nonfunctional conserved residues. The observed confluence of dynamics correlations and coevolutionary residue couplings with global networking features may determine modular organization of allosteric interactions and dictate localization of key mediating sites. Community analysis of the residue interaction networks revealed that concerted rearrangements of local interacting modules at the inter-domain interface may be responsible for global structural changes and a population shift in the DnaK chaperone. The inter-domain communities in the Hsp70 structures harbor the majority of regulatory residues involved in allosteric signaling, suggesting that these sites could be integral to the network organization and coordination of structural changes. Using a network-based formalism of allostery, we introduced a community-hopping model of allosteric communication. Atomistic reconstruction of signaling pathways in the DnaK structures captured a direction-specific mechanism and molecular details of signal transmission that are fully consistent with the mutagenesis experiments. The results of our study reconciled structural and functional experiments from a network-centric perspective by showing that global properties of the residue interaction networks and coevolutionary signatures may be linked with specificity and diversity of allosteric regulation mechanisms.

Hamiltonian dynamics for complex food webs

NASA Astrophysics Data System (ADS)

Kozlov, Vladimir; Vakulenko, Sergey; Wennergren, Uno

2016-03-01

We investigate stability and dynamics of large ecological networks by introducing classical methods of dynamical system theory from physics, including Hamiltonian and averaging methods. Our analysis exploits the topological structure of the network, namely the existence of strongly connected nodes (hubs) in the networks. We reveal new relations between topology, interaction structure, and network dynamics. We describe mechanisms of catastrophic phenomena leading to sharp changes of dynamics and hence completely altering the ecosystem. We also show how these phenomena depend on the structure of interaction between species. We can conclude that a Hamiltonian structure of biological interactions leads to stability and large biodiversity.

The Structure of Male Adolescent Peer Networks and Risk for Intimate Partner Violence Perpetration: Findings from a National Sample

PubMed Central

Casey, Erin A.; Beadnell, Blair

2015-01-01

Although peer networks have been implicated as influential in a range of adolescent behaviors, little is known about relationships between peer network structures and risk for intimate partner violence (IPV) among youth. This study is a descriptive analysis of how peer network “types” may be related to subsequent risk for IPV perpetration among adolescents using data from 3,030 male respondents to the National Longitudinal Study of Adolescent Health. Sampled youth were a mean of 16 years of age when surveyed about the nature of their peer networks, and 21.9 when asked to report about IPV perpetration in their adolescent and early adulthood relationships. A latent class analysis of the size, structure, gender composition and delinquency level of friendship groups identified four unique profiles of peer network structures. Men in the group type characterized by small, dense, mostly male peer networks with higher levels of delinquent behavior reported higher rates of subsequent IPV perpetration than men whose adolescent network type was characterized by large, loosely connected groups of less delinquent male and female friends. Other factors known to be antecedents and correlates of IPV perpetration varied in their distribution across the peer group types, suggesting that different configurations of risk for relationship aggression can be found across peer networks. Implications for prevention programming and future research are addressed. PMID:20422351

Altered Brain Network Segregation in Fragile X Syndrome Revealed by Structural Connectomics.

PubMed

Bruno, Jennifer Lynn; Hosseini, S M Hadi; Saggar, Manish; Quintin, Eve-Marie; Raman, Mira Michelle; Reiss, Allan L

2017-03-01

Fragile X syndrome (FXS), the most common inherited cause of intellectual disability and autism spectrum disorder, is associated with significant behavioral, social, and neurocognitive deficits. Understanding structural brain network topology in FXS provides an important link between neurobiological and behavioral/cognitive symptoms of this disorder. We investigated the connectome via whole-brain structural networks created from group-level morphological correlations. Participants included 100 individuals: 50 with FXS and 50 with typical development, age 11-23 years. Results indicated alterations in topological properties of structural brain networks in individuals with FXS. Significantly reduced small-world index indicates a shift in the balance between network segregation and integration and significantly reduced clustering coefficient suggests that reduced local segregation shifted this balance. Caudate and amygdala were less interactive in the FXS network further highlighting the importance of subcortical region alterations in the neurobiological signature of FXS. Modularity analysis indicates that FXS and typically developing groups' networks decompose into different sets of interconnected sub networks, potentially indicative of aberrant local interconnectivity in individuals with FXS. These findings advance our understanding of the effects of fragile X mental retardation protein on large-scale brain networks and could be used to develop a connectome-level biological signature for FXS. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

The Role of Temporal Trends in Growing Networks

PubMed Central

Ruppin, Eytan; Shavitt, Yuval

2016-01-01

The rich get richer principle, manifested by the Preferential attachment (PA) mechanism, is widely considered one of the major factors in the growth of real-world networks. PA stipulates that popular nodes are bound to be more attractive than less popular nodes; for example, highly cited papers are more likely to garner further citations. However, it overlooks the transient nature of popularity, which is often governed by trends. Here, we show that in a wide range of real-world networks the recent popularity of a node, i.e., the extent by which it accumulated links recently, significantly influences its attractiveness and ability to accumulate further links. We proceed to model this observation with a natural extension to PA, named Trending Preferential Attachment (TPA), in which edges become less influential as they age. TPA quantitatively parametrizes a fundamental network property, namely the network’s tendency to trends. Through TPA, we find that real-world networks tend to be moderately to highly trendy. Networks are characterized by different susceptibilities to trends, which determine their structure to a large extent. Trendy networks display complex structural traits, such as modular community structure and degree-assortativity, occurring regularly in real-world networks. In summary, this work addresses an inherent trait of complex networks, which greatly affects their growth and structure, and develops a unified model to address its interaction with preferential attachment. PMID:27486847

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

PubMed

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

2018-05-01

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

Structure-Function Network Mapping and Its Assessment via Persistent Homology

PubMed Central

2017-01-01

Understanding the relationship between brain structure and function is a fundamental problem in network neuroscience. This work deals with the general method of structure-function mapping at the whole-brain level. We formulate the problem as a topological mapping of structure-function connectivity via matrix function, and find a stable solution by exploiting a regularization procedure to cope with large matrices. We introduce a novel measure of network similarity based on persistent homology for assessing the quality of the network mapping, which enables a detailed comparison of network topological changes across all possible thresholds, rather than just at a single, arbitrary threshold that may not be optimal. We demonstrate that our approach can uncover the direct and indirect structural paths for predicting functional connectivity, and our network similarity measure outperforms other currently available methods. We systematically validate our approach with (1) a comparison of regularized vs. non-regularized procedures, (2) a null model of the degree-preserving random rewired structural matrix, (3) different network types (binary vs. weighted matrices), and (4) different brain parcellation schemes (low vs. high resolutions). Finally, we evaluate the scalability of our method with relatively large matrices (2514x2514) of structural and functional connectivity obtained from 12 healthy human subjects measured non-invasively while at rest. Our results reveal a nonlinear structure-function relationship, suggesting that the resting-state functional connectivity depends on direct structural connections, as well as relatively parsimonious indirect connections via polysynaptic pathways. PMID:28046127

Biomimetic oral mucin from polymer micelle networks

NASA Astrophysics Data System (ADS)

Authimoolam, Sundar Prasanth

Mucin networks are formed by the complexation of bottlebrush-like mucin glycoprotein with other small molecule glycoproteins. These glycoproteins create nanoscale strands that then arrange into a nanoporous mesh. These networks play an important role in ensuring surface hydration, lubricity and barrier protection. In order to understand the functional behavior in mucin networks, it is important to decouple their chemical and physical effects responsible for generating the fundamental property-function relationship. To achieve this goal, we propose to develop a synthetic biomimetic mucin using a layer-by-layer (LBL) deposition approach. In this work, a hierarchical 3-dimensional structures resembling natural mucin networks was generated using affinity-based interactions on synthetic and biological surfaces. Unlike conventional polyelectrolyte-based LBL methods, pre-assembled biotin-functionalized filamentous (worm-like) micelles was utilized as the network building block, which from complementary additions of streptavidin generated synthetic networks of desired thickness. The biomimetic nature in those synthetic networks are studied by evaluating its structural and bio-functional properties. Structurally, synthetic networks formed a nanoporous mesh. The networks demonstrated excellent surface hydration property and were able capable of microbial capture. Those functional properties are akin to that of natural mucin networks. Further, the role of synthetic mucin as a drug delivery vehicle, capable of providing localized and tunable release was demonstrated. By incorporating antibacterial curcumin drug loading within synthetic networks, bacterial growth inhibition was also demonstrated. Thus, such bioactive interfaces can serve as a model for independently characterizing mucin network properties and through its role as a drug carrier vehicle it presents exciting future opportunities for localized drug delivery, in regenerative applications and as bio-functional implant coats. KEYWORDS: Biomimic, Bioapplication, Drug delivery, Filomicelle, Mucin, Polymer networks.

Human Impacts and Climate Change Influence Nestedness and Modularity in Food-Web and Mutualistic Networks.

PubMed

Takemoto, Kazuhiro; Kajihara, Kosuke

2016-01-01

Theoretical studies have indicated that nestedness and modularity-non-random structural patterns of ecological networks-influence the stability of ecosystems against perturbations; as such, climate change and human activity, as well as other sources of environmental perturbations, affect the nestedness and modularity of ecological networks. However, the effects of climate change and human activities on ecological networks are poorly understood. Here, we used a spatial analysis approach to examine the effects of climate change and human activities on the structural patterns of food webs and mutualistic networks, and found that ecological network structure is globally affected by climate change and human impacts, in addition to current climate. In pollination networks, for instance, nestedness increased and modularity decreased in response to increased human impacts. Modularity in seed-dispersal networks decreased with temperature change (i.e., warming), whereas food web nestedness increased and modularity declined in response to global warming. Although our findings are preliminary owing to data-analysis limitations, they enhance our understanding of the effects of environmental change on ecological communities.

Contact networks structured by sex underpin sex-specific epidemiology of infection.

PubMed

Silk, Matthew J; Weber, Nicola L; Steward, Lucy C; Hodgson, David J; Boots, Mike; Croft, Darren P; Delahay, Richard J; McDonald, Robbie A

2018-02-01

Contact networks are fundamental to the transmission of infection and host sex often affects the acquisition and progression of infection. However, the epidemiological impacts of sex-related variation in animal contact networks have rarely been investigated. We test the hypothesis that sex-biases in infection are related to variation in multilayer contact networks structured by sex in a population of European badgers Meles meles naturally infected with Mycobacterium bovis. Our key results are that male-male and between-sex networks are structured at broader spatial scales than female-female networks and that in male-male and between-sex contact networks, but not female-female networks, there is a significant relationship between infection and contacts with individuals in other groups. These sex differences in social behaviour may underpin male-biased acquisition of infection and may result in males being responsible for more between-group transmission. This highlights the importance of sex-related variation in host behaviour when managing animal diseases. © 2017 The Authors. Ecology Letters published by CNRS and John Wiley & Sons Ltd.

Bribery games on inter-dependent regular networks.

PubMed

Verma, Prateek; Nandi, Anjan K; Sengupta, Supratim

2017-02-16

We examine a scenario of social conflict that is manifest during an interaction between government servants providing a service and citizens who are legally entitled to the service, using evolutionary game-theory in structured populations characterized by an inter-dependent network. Bribe-demands by government servants during such transactions, called harassment bribes, constitute a widespread form of corruption in many countries. We investigate the effect of varying bribe demand made by corrupt officials and the cost of complaining incurred by harassed citizens, on the proliferation of corrupt strategies in the population. We also examine how the connectivity of the various constituent networks affects the spread of corrupt officials in the population. We find that incidents of bribery can be considerably reduced in a network-structured populations compared to mixed populations. Interestingly, we also find that an optimal range for the connectivity of nodes in the citizen's network (signifying the degree of influence a citizen has in affecting the strategy of other citizens in the network) as well as the interaction network aids in the fixation of honest officers. Our results reveal the important role of network structure and connectivity in asymmetric games.

Costs for switching partners reduce network dynamics but not cooperative behaviour

PubMed Central

Bednarik, Peter; Fehl, Katrin; Semmann, Dirk

2014-01-01

Social networks represent the structuring of interactions between group members. Above all, many interactions are profoundly cooperative in humans and other animals. In accordance with this natural observation, theoretical work demonstrates that certain network structures favour the evolution of cooperation. Yet, recent experimental evidence suggests that static networks do not enhance cooperative behaviour in humans. By contrast, dynamic networks do foster cooperation. However, costs associated with dynamism such as time or resource investments in finding and establishing new partnerships have been neglected so far. Here, we show that human participants are much less likely to break links when costs arise for building new links. Especially, when costs were high, the network was nearly static. Surprisingly, cooperation levels in Prisoner's Dilemma games were not affected by reduced dynamism in social networks. We conclude that the mere potential to quit collaborations is sufficient in humans to reach high levels of cooperative behaviour. Effects of self-structuring processes or assortment on the network played a minor role: participants simply adjusted their cooperative behaviour in response to the threats of losing a partner or of being expelled. PMID:25122233

Living in the branches: population dynamics and ecological processes in dendritic networks

USGS Publications Warehouse

Grant, E.H.C.; Lowe, W.H.; Fagan, W.F.

2007-01-01

Spatial structure regulates and modifies processes at several levels of ecological organization (e.g. individual/genetic, population and community) and is thus a key component of complex systems, where knowledge at a small scale can be insufficient for understanding system behaviour at a larger scale. Recent syntheses outline potential applications of network theory to ecological systems, but do not address the implications of physical structure for network dynamics. There is a specific need to examine how dendritic habitat structure, such as that found in stream, hedgerow and cave networks, influences ecological processes. Although dendritic networks are one type of ecological network, they are distinguished by two fundamental characteristics: (1) both the branches and the nodes serve as habitat, and (2) the specific spatial arrangement and hierarchical organization of these elements interacts with a species' movement behaviour to alter patterns of population distribution and abundance, and community interactions. Here, we summarize existing theory relating to ecological dynamics in dendritic networks, review empirical studies examining the population- and community-level consequences of these networks, and suggest future research integrating spatial pattern and processes in dendritic systems.

Toward link predictability of complex networks

PubMed Central

Lü, Linyuan; Pan, Liming; Zhou, Tao; Zhang, Yi-Cheng; Stanley, H. Eugene

2015-01-01

The organization of real networks usually embodies both regularities and irregularities, and, in principle, the former can be modeled. The extent to which the formation of a network can be explained coincides with our ability to predict missing links. To understand network organization, we should be able to estimate link predictability. We assume that the regularity of a network is reflected in the consistency of structural features before and after a random removal of a small set of links. Based on the perturbation of the adjacency matrix, we propose a universal structural consistency index that is free of prior knowledge of network organization. Extensive experiments on disparate real-world networks demonstrate that (i) structural consistency is a good estimation of link predictability and (ii) a derivative algorithm outperforms state-of-the-art link prediction methods in both accuracy and robustness. This analysis has further applications in evaluating link prediction algorithms and monitoring sudden changes in evolving network mechanisms. It will provide unique fundamental insights into the above-mentioned academic research fields, and will foster the development of advanced information filtering technologies of interest to information technology practitioners. PMID:25659742

Sparse Regression Based Structure Learning of Stochastic Reaction Networks from Single Cell Snapshot Time Series.

PubMed

Klimovskaia, Anna; Ganscha, Stefan; Claassen, Manfred

2016-12-01

Stochastic chemical reaction networks constitute a model class to quantitatively describe dynamics and cell-to-cell variability in biological systems. The topology of these networks typically is only partially characterized due to experimental limitations. Current approaches for refining network topology are based on the explicit enumeration of alternative topologies and are therefore restricted to small problem instances with almost complete knowledge. We propose the reactionet lasso, a computational procedure that derives a stepwise sparse regression approach on the basis of the Chemical Master Equation, enabling large-scale structure learning for reaction networks by implicitly accounting for billions of topology variants. We have assessed the structure learning capabilities of the reactionet lasso on synthetic data for the complete TRAIL induced apoptosis signaling cascade comprising 70 reactions. We find that the reactionet lasso is able to efficiently recover the structure of these reaction systems, ab initio, with high sensitivity and specificity. With only < 1% false discoveries, the reactionet lasso is able to recover 45% of all true reactions ab initio among > 6000 possible reactions and over 102000 network topologies. In conjunction with information rich single cell technologies such as single cell RNA sequencing or mass cytometry, the reactionet lasso will enable large-scale structure learning, particularly in areas with partial network structure knowledge, such as cancer biology, and thereby enable the detection of pathological alterations of reaction networks. We provide software to allow for wide applicability of the reactionet lasso.

[Study on Abnormal Topological Properties of Structural Brain Networks of Patients with Depression Comorbid with Anxiety].

PubMed

Wu, Xiuyong; Wu, Xiaoming; Peng, Hongjun; Ning, Yuping; Wu, Kai

2016-06-01

This paper is aimed to analyze the topological properties of structural brain networks in depressive patients with and without anxiety and to explore the neuropath logical mechanisms of depression comorbid with anxiety.Diffusion tensor imaging and deterministic tractography were applied to map the white matter structural networks.We collected 20 depressive patients with anxiety(DPA),18 depressive patients without anxiety(DP),and 28 normal controls(NC)as comparative groups.The global and nodal properties of the structural brain networks in the three groups were analyzed with graph theoretical methods.The result showed that1 the structural brain networks in three groups showed small-world properties and highly connected global hubs predominately from association cortices;2DP group showed lower local efficiency and global efficiency compared to NC group,whereas DPA group showed higher local efficiency and global efficiency compared to NC group;3significant differences of network properties(clustering coefficient,characteristic path lengths,local efficiency,global efficiency)were found between DPA and DP groups;4DP group showed significant changes of nodal efficiency in the brain areas primarily in the temporal lobe and bilateral frontal gyrus,compared to DPA and NC groups.The analysis indicated that the DP and DPA groups showed nodal properties of the structural brain networks,compared to NC group.Moreover,the two diseased groups indicated an opposite trend in the network properties.The results of this study may provide a new imaging index for clinical diagnosis for depression comorbid with anxiety.

The Ordered Network Structure and Prediction Summary for M≥7 Earthquakes in Xinjiang Region of China

NASA Astrophysics Data System (ADS)

Men, Ke-Pei; Zhao, Kai

2014-12-01

M ≥7 earthquakes have showed an obvious commensurability and orderliness in Xinjiang of China and its adjacent region since 1800. The main orderly values are 30 a × k (k = 1,2,3), 11 12 a, 41 43 a, 18 19 a, and 5 6 a. In the guidance of the information forecasting theory of Wen-Bo Weng, based on previous research results, combining ordered network structure analysis with complex network technology, we focus on the prediction summary of M ≥ 7 earthquakes by using the ordered network structure, and add new information to further optimize network, hence construct the 2D- and 3D-ordered network structure of M ≥ 7 earthquakes. In this paper, the network structure revealed fully the regularity of seismic activity of M ≥ 7 earthquakes in the study region during the past 210 years. Based on this, the Karakorum M7.1 earthquake in 1996, the M7.9 earthquake on the frontier of Russia, Mongol, and China in 2003, and two Yutian M7.3 earthquakes in 2008 and 2014 were predicted successfully. At the same time, a new prediction opinion is presented that the future two M ≥ 7 earthquakes will probably occur around 2019 - 2020 and 2025 - 2026 in this region. The results show that large earthquake occurred in defined region can be predicted. The method of ordered network structure analysis produces satisfactory results for the mid-and-long term prediction of M ≥ 7 earthquakes.