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.

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.

Distribution of Orientation Selectivity in Recurrent Networks of Spiking Neurons with Different Random Topologies

PubMed Central

Sadeh, Sadra; Rotter, Stefan

2014-01-01

Neurons in the primary visual cortex are more or less selective for the orientation of a light bar used for stimulation. A broad distribution of individual grades of orientation selectivity has in fact been reported in all species. A possible reason for emergence of broad distributions is the recurrent network within which the stimulus is being processed. Here we compute the distribution of orientation selectivity in randomly connected model networks that are equipped with different spatial patterns of connectivity. We show that, for a wide variety of connectivity patterns, a linear theory based on firing rates accurately approximates the outcome of direct numerical simulations of networks of spiking neurons. Distance dependent connectivity in networks with a more biologically realistic structure does not compromise our linear analysis, as long as the linearized dynamics, and hence the uniform asynchronous irregular activity state, remain stable. We conclude that linear mechanisms of stimulus processing are indeed responsible for the emergence of orientation selectivity and its distribution in recurrent networks with functionally heterogeneous synaptic connectivity. PMID:25469704

Pruning a minimum spanning tree

NASA Astrophysics Data System (ADS)

Sandoval, Leonidas

2012-04-01

This work employs various techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The first technique establishes a threshold above which connections are considered affected by noise, based on the study of random networks with the same probability density distribution of the original data. The second technique is to judge the strength of a connection by its survival rate, which is the amount of time a connection between two stock market indices endures. The idea is that true connections will survive for longer periods of time, and that random connections will not. That information is then combined with the information obtained from the first technique in order to create a smaller network, in which most of the connections are either strong or enduring in time.

Optimal Quantum Spatial Search on Random Temporal Networks

NASA Astrophysics Data System (ADS)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Infectious disease control using contact tracing in random and scale-free networks

PubMed Central

Kiss, Istvan Z; Green, Darren M; Kao, Rowland R

2005-01-01

Contact tracing aims to identify and isolate individuals that have been in contact with infectious individuals. The efficacy of contact tracing and the hierarchy of traced nodes—nodes with higher degree traced first—is investigated and compared on random and scale-free (SF) networks with the same number of nodes N and average connection K. For values of the transmission rate larger than a threshold, the final epidemic size on SF networks is smaller than that on corresponding random networks. While in random networks new infectious and traced nodes from all classes have similar average degrees, in SF networks the average degree of nodes that are in more advanced stages of the disease is higher at any given time. On SF networks tracing removes possible sources of infection with high average degree. However a higher tracing effort is required to control the epidemic than on corresponding random networks due to the high initial velocity of spread towards the highly connected nodes. An increased latency period fails to significantly improve contact tracing efficacy. Contact tracing has a limited effect if the removal rate of susceptible nodes is relatively high, due to the fast local depletion of susceptible nodes. PMID:16849217

Intrinsic Cellular Properties and Connectivity Density Determine Variable Clustering Patterns in Randomly Connected Inhibitory Neural Networks

PubMed Central

Rich, Scott; Booth, Victoria; Zochowski, Michal

2016-01-01

The plethora of inhibitory interneurons in the hippocampus and cortex play a pivotal role in generating rhythmic activity by clustering and synchronizing cell firing. Results of our simulations demonstrate that both the intrinsic cellular properties of neurons and the degree of network connectivity affect the characteristics of clustered dynamics exhibited in randomly connected, heterogeneous inhibitory networks. We quantify intrinsic cellular properties by the neuron's current-frequency relation (IF curve) and Phase Response Curve (PRC), a measure of how perturbations given at various phases of a neurons firing cycle affect subsequent spike timing. We analyze network bursting properties of networks of neurons with Type I or Type II properties in both excitability and PRC profile; Type I PRCs strictly show phase advances and IF curves that exhibit frequencies arbitrarily close to zero at firing threshold while Type II PRCs display both phase advances and delays and IF curves that have a non-zero frequency at threshold. Type II neurons whose properties arise with or without an M-type adaptation current are considered. We analyze network dynamics under different levels of cellular heterogeneity and as intrinsic cellular firing frequency and the time scale of decay of synaptic inhibition are varied. Many of the dynamics exhibited by these networks diverge from the predictions of the interneuron network gamma (ING) mechanism, as well as from results in all-to-all connected networks. Our results show that randomly connected networks of Type I neurons synchronize into a single cluster of active neurons while networks of Type II neurons organize into two mutually exclusive clusters segregated by the cells' intrinsic firing frequencies. Networks of Type II neurons containing the adaptation current behave similarly to networks of either Type I or Type II neurons depending on network parameters; however, the adaptation current creates differences in the cluster dynamics compared to those in networks of Type I or Type II neurons. To understand these results, we compute neuronal PRCs calculated with a perturbation matching the profile of the synaptic current in our networks. Differences in profiles of these PRCs across the different neuron types reveal mechanisms underlying the divergent network dynamics. PMID:27812323

Synchronization and Inter-Layer Interactions of Noise-Driven Neural Networks

PubMed Central

Yuniati, Anis; Mai, Te-Lun; Chen, Chi-Ming

2017-01-01

In this study, we used the Hodgkin-Huxley (HH) model of neurons to investigate the phase diagram of a developing single-layer neural network and that of a network consisting of two weakly coupled neural layers. These networks are noise driven and learn through the spike-timing-dependent plasticity (STDP) or the inverse STDP rules. We described how these networks transited from a non-synchronous background activity state (BAS) to a synchronous firing state (SFS) by varying the network connectivity and the learning efficacy. In particular, we studied the interaction between a SFS layer and a BAS layer, and investigated how synchronous firing dynamics was induced in the BAS layer. We further investigated the effect of the inter-layer interaction on a BAS to SFS repair mechanism by considering three types of neuron positioning (random, grid, and lognormal distributions) and two types of inter-layer connections (random and preferential connections). Among these scenarios, we concluded that the repair mechanism has the largest effect for a network with the lognormal neuron positioning and the preferential inter-layer connections. PMID:28197088

Synchronization and Inter-Layer Interactions of Noise-Driven Neural Networks.

PubMed

Yuniati, Anis; Mai, Te-Lun; Chen, Chi-Ming

2017-01-01

In this study, we used the Hodgkin-Huxley (HH) model of neurons to investigate the phase diagram of a developing single-layer neural network and that of a network consisting of two weakly coupled neural layers. These networks are noise driven and learn through the spike-timing-dependent plasticity (STDP) or the inverse STDP rules. We described how these networks transited from a non-synchronous background activity state (BAS) to a synchronous firing state (SFS) by varying the network connectivity and the learning efficacy. In particular, we studied the interaction between a SFS layer and a BAS layer, and investigated how synchronous firing dynamics was induced in the BAS layer. We further investigated the effect of the inter-layer interaction on a BAS to SFS repair mechanism by considering three types of neuron positioning (random, grid, and lognormal distributions) and two types of inter-layer connections (random and preferential connections). Among these scenarios, we concluded that the repair mechanism has the largest effect for a network with the lognormal neuron positioning and the preferential inter-layer connections.

Topology-selective jamming of fully-connected, code-division random-access networks

NASA Technical Reports Server (NTRS)

Polydoros, Andreas; Cheng, Unjeng

1990-01-01

The purpose is to introduce certain models of topology selective stochastic jamming and examine its impact on a class of fully-connected, spread-spectrum, slotted ALOHA-type random access networks. The theory covers dedicated as well as half-duplex units. The dominant role of the spatial duty factor is established, and connections with the dual concept of time selective jamming are discussed. The optimal choices of coding rate and link access parameters (from the users' side) and the jamming spatial fraction are numerically established for DS and FH spreading.

Reciprocity in spatial evolutionary public goods game on double-layered network

NASA Astrophysics Data System (ADS)

Kim, Jinho; Yook, Soon-Hyung; Kim, Yup

2016-08-01

Spatial evolutionary games have mainly been studied on a single, isolated network. However, in real world systems, many interaction topologies are not isolated but many different types of networks are inter-connected to each other. In this study, we investigate the spatial evolutionary public goods game (SEPGG) on double-layered random networks (DRN). Based on the mean-field type arguments and numerical simulations, we find that SEPGG on DRN shows very rich interesting phenomena, especially, depending on the size of each layer, intra-connectivity, and inter-connected couplings, the network reciprocity of SEPGG on DRN can be drastically enhanced through the inter-connected coupling. Furthermore, SEPGG on DRN can provide a more general framework which includes the evolutionary dynamics on multiplex networks and inter-connected networks at the same time.

Reciprocity in spatial evolutionary public goods game on double-layered network

PubMed Central

Kim, Jinho; Yook, Soon-Hyung; Kim, Yup

2016-01-01

Spatial evolutionary games have mainly been studied on a single, isolated network. However, in real world systems, many interaction topologies are not isolated but many different types of networks are inter-connected to each other. In this study, we investigate the spatial evolutionary public goods game (SEPGG) on double-layered random networks (DRN). Based on the mean-field type arguments and numerical simulations, we find that SEPGG on DRN shows very rich interesting phenomena, especially, depending on the size of each layer, intra-connectivity, and inter-connected couplings, the network reciprocity of SEPGG on DRN can be drastically enhanced through the inter-connected coupling. Furthermore, SEPGG on DRN can provide a more general framework which includes the evolutionary dynamics on multiplex networks and inter-connected networks at the same time. PMID:27503801

Cortical Dynamics in Presence of Assemblies of Densely Connected Weight-Hub Neurons

PubMed Central

Setareh, Hesam; Deger, Moritz; Petersen, Carl C. H.; Gerstner, Wulfram

2017-01-01

Experimental measurements of pairwise connection probability of pyramidal neurons together with the distribution of synaptic weights have been used to construct randomly connected model networks. However, several experimental studies suggest that both wiring and synaptic weight structure between neurons show statistics that differ from random networks. Here we study a network containing a subset of neurons which we call weight-hub neurons, that are characterized by strong inward synapses. We propose a connectivity structure for excitatory neurons that contain assemblies of densely connected weight-hub neurons, while the pairwise connection probability and synaptic weight distribution remain consistent with experimental data. Simulations of such a network with generalized integrate-and-fire neurons display regular and irregular slow oscillations akin to experimentally observed up/down state transitions in the activity of cortical neurons with a broad distribution of pairwise spike correlations. Moreover, stimulation of a model network in the presence or absence of assembly structure exhibits responses similar to light-evoked responses of cortical layers in optogenetically modified animals. We conclude that a high connection probability into and within assemblies of excitatory weight-hub neurons, as it likely is present in some but not all cortical layers, changes the dynamics of a layer of cortical microcircuitry significantly. PMID:28690508

Estimating the epidemic threshold on networks by deterministic connections

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

Li, Kezan, E-mail: lkzzr@sohu.com; Zhu, Guanghu; Fu, Xinchu

2014-12-15

For many epidemic networks some connections between nodes are treated as deterministic, while the remainder are random and have different connection probabilities. By applying spectral analysis to several constructed models, we find that one can estimate the epidemic thresholds of these networks by investigating information from only the deterministic connections. Nonetheless, in these models, generic nonuniform stochastic connections and heterogeneous community structure are also considered. The estimation of epidemic thresholds is achieved via inequalities with upper and lower bounds, which are found to be in very good agreement with numerical simulations. Since these deterministic connections are easier to detect thanmore » those stochastic connections, this work provides a feasible and effective method to estimate the epidemic thresholds in real epidemic networks.« less

The connection-set algebra--a novel formalism for the representation of connectivity structure in neuronal network models.

PubMed

Djurfeldt, Mikael

2012-07-01

The connection-set algebra (CSA) is a novel and general formalism for the description of connectivity in neuronal network models, from small-scale to large-scale structure. The algebra provides operators to form more complex sets of connections from simpler ones and also provides parameterization of such sets. CSA is expressive enough to describe a wide range of connection patterns, including multiple types of random and/or geometrically dependent connectivity, and can serve as a concise notation for network structure in scientific writing. CSA implementations allow for scalable and efficient representation of connectivity in parallel neuronal network simulators and could even allow for avoiding explicit representation of connections in computer memory. The expressiveness of CSA makes prototyping of network structure easy. A C+ + version of the algebra has been implemented and used in a large-scale neuronal network simulation (Djurfeldt et al., IBM J Res Dev 52(1/2):31-42, 2008b) and an implementation in Python has been publicly released.

Enhanced Vaccine Control of Epidemics in Adaptive Networks

DTIC Science & Technology

2010-04-29

than random vaccination 32. When vaccine is very limited, outbreaks can be minimized by fragmenting the network via a graph partitioning strategy...Although an outbreak could transiently decrease network connectivity in a real social network, long term reductions in average connectivity are...37, cholera and typhoid fever 35, as well as pertussis 38. Although not all of the above diseases currently possess a vaccine, research is ongo

Programmability of nanowire networks

NASA Astrophysics Data System (ADS)

Bellew, A. T.; Bell, A. P.; McCarthy, E. K.; Fairfield, J. A.; Boland, J. J.

2014-07-01

Electrical connectivity in networks of nanoscale junctions must be better understood if nanowire devices are to be scaled up from single wires to functional material systems. We show that the natural connectivity behaviour found in random nanowire networks presents a new paradigm for creating multi-functional, programmable materials. In devices made from networks of Ni/NiO core-shell nanowires at different length scales, we discover the emergence of distinct behavioural regimes when networks are electrically stressed. We show that a small network, with few nanowire-nanowire junctions, acts as a unipolar resistive switch, demonstrating very high ON/OFF current ratios (>105). However, large networks of nanowires distribute an applied bias across a large number of junctions, and thus respond not by switching but instead by evolving connectivity. We demonstrate that these emergent properties lead to fault-tolerant materials whose resistance may be tuned, and which are capable of adaptively reconfiguring under stress. By combining these two behavioural regimes, we demonstrate that the same nanowire network may be programmed to act both as a metallic interconnect, and a resistive switch device with high ON/OFF ratio. These results enable the fabrication of programmable, multi-functional materials from random nanowire networks.Electrical connectivity in networks of nanoscale junctions must be better understood if nanowire devices are to be scaled up from single wires to functional material systems. We show that the natural connectivity behaviour found in random nanowire networks presents a new paradigm for creating multi-functional, programmable materials. In devices made from networks of Ni/NiO core-shell nanowires at different length scales, we discover the emergence of distinct behavioural regimes when networks are electrically stressed. We show that a small network, with few nanowire-nanowire junctions, acts as a unipolar resistive switch, demonstrating very high ON/OFF current ratios (>105). However, large networks of nanowires distribute an applied bias across a large number of junctions, and thus respond not by switching but instead by evolving connectivity. We demonstrate that these emergent properties lead to fault-tolerant materials whose resistance may be tuned, and which are capable of adaptively reconfiguring under stress. By combining these two behavioural regimes, we demonstrate that the same nanowire network may be programmed to act both as a metallic interconnect, and a resistive switch device with high ON/OFF ratio. These results enable the fabrication of programmable, multi-functional materials from random nanowire networks. Electronic supplementary information (ESI) available: Nanowire statistics (length, diameter statistics, and oxide thickness) are provided. Forming curves for single junctions and networks. Passive voltage contrast image demonstrating selectivity of conductive pathways in 100 μm network. See DOI: 10.1039/c4nr02338b

Influence network linkages across implementation strategy conditions in a randomized controlled trial of two strategies for scaling up evidence-based practices in public youth-serving systems.

PubMed

Palinkas, Lawrence A; Holloway, Ian W; Rice, Eric; Brown, C Hendricks; Valente, Thomas W; Chamberlain, Patricia

2013-11-14

Given the importance of influence networks in the implementation of evidence-based practices and interventions, it is unclear whether such networks continue to operate as sources of information and advice when they are segmented and disrupted by randomization to different implementation strategy conditions. The present study examines the linkages across implementation strategy conditions of social influence networks of leaders of youth-serving systems in 12 California counties participating in a randomized controlled trial of community development teams (CDTs) to scale up use of an evidence-based practice. Semi-structured interviews were conducted with 38 directors, assistant directors, and program managers of county probation, mental health, and child welfare departments. A web-based survey collected additional quantitative data on information and advice networks of study participants. A mixed-methods approach to data analysis was used to create a sociometric data set (n = 176) to examine linkages between treatment and standard conditions. Of those network members who were affiliated with a county (n = 137), only 6 (4.4%) were directly connected to a member of the opposite implementation strategy condition; 19 (13.9%) were connected by two steps or fewer to a member of the opposite implementation strategy condition; 64 (46.7%) were connected by three or fewer steps to a member of the opposite implementation strategy condition. Most of the indirect steps between individuals who were in different implementation strategy conditions were connections involving a third non-county organizational entity that had an important role in the trial in keeping the implementation strategy conditions separate. When these entities were excluded, the CDT network exhibited fewer components and significantly higher betweenness centralization than did the standard condition network. Although the integrity of the RCT in this instance was not compromised by study participant influence networks, RCT designs should consider how influence networks may extend beyond boundaries established by the randomization process in implementation studies. NCT00880126.

Statistical mechanics of scale-free gene expression networks

NASA Astrophysics Data System (ADS)

Gross, Eitan

2012-12-01

The gene co-expression networks of many organisms including bacteria, mice and man exhibit scale-free distribution. This heterogeneous distribution of connections decreases the vulnerability of the network to random attacks and thus may confer the genetic replication machinery an intrinsic resilience to such attacks, triggered by changing environmental conditions that the organism may be subject to during evolution. This resilience to random attacks comes at an energetic cost, however, reflected by the lower entropy of the scale-free distribution compared to the more homogenous, random network. In this study we found that the cell cycle-regulated gene expression pattern of the yeast Saccharomyces cerevisiae obeys a power-law distribution with an exponent α = 2.1 and an entropy of 1.58. The latter is very close to the maximal value of 1.65 obtained from linear optimization of the entropy function under the constraint of a constant cost function, determined by the average degree connectivity . We further show that the yeast's gene expression network can achieve scale-free distribution in a process that does not involve growth but rather via re-wiring of the connections between nodes of an ordered network. Our results support the idea of an evolutionary selection, which acts at the level of the protein sequence, and is compatible with the notion of greater biological importance of highly connected nodes in the protein interaction network. Our constrained re-wiring model provides a theoretical framework for a putative thermodynamically driven evolutionary selection process.

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.

Measuring Symmetry, Asymmetry and Randomness in Neural Network Connectivity

PubMed Central

Esposito, Umberto; Giugliano, Michele; van Rossum, Mark; Vasilaki, Eleni

2014-01-01

Cognitive functions are stored in the connectome, the wiring diagram of the brain, which exhibits non-random features, so-called motifs. In this work, we focus on bidirectional, symmetric motifs, i.e. two neurons that project to each other via connections of equal strength, and unidirectional, non-symmetric motifs, i.e. within a pair of neurons only one neuron projects to the other. We hypothesise that such motifs have been shaped via activity dependent synaptic plasticity processes. As a consequence, learning moves the distribution of the synaptic connections away from randomness. Our aim is to provide a global, macroscopic, single parameter characterisation of the statistical occurrence of bidirectional and unidirectional motifs. To this end we define a symmetry measure that does not require any a priori thresholding of the weights or knowledge of their maximal value. We calculate its mean and variance for random uniform or Gaussian distributions, which allows us to introduce a confidence measure of how significantly symmetric or asymmetric a specific configuration is, i.e. how likely it is that the configuration is the result of chance. We demonstrate the discriminatory power of our symmetry measure by inspecting the eigenvalues of different types of connectivity matrices. We show that a Gaussian weight distribution biases the connectivity motifs to more symmetric configurations than a uniform distribution and that introducing a random synaptic pruning, mimicking developmental regulation in synaptogenesis, biases the connectivity motifs to more asymmetric configurations, regardless of the distribution. We expect that our work will benefit the computational modelling community, by providing a systematic way to characterise symmetry and asymmetry in network structures. Further, our symmetry measure will be of use to electrophysiologists that investigate symmetry of network connectivity. PMID:25006663

Measuring symmetry, asymmetry and randomness in neural network connectivity.

PubMed

Esposito, Umberto; Giugliano, Michele; van Rossum, Mark; Vasilaki, Eleni

2014-01-01

Cognitive functions are stored in the connectome, the wiring diagram of the brain, which exhibits non-random features, so-called motifs. In this work, we focus on bidirectional, symmetric motifs, i.e. two neurons that project to each other via connections of equal strength, and unidirectional, non-symmetric motifs, i.e. within a pair of neurons only one neuron projects to the other. We hypothesise that such motifs have been shaped via activity dependent synaptic plasticity processes. As a consequence, learning moves the distribution of the synaptic connections away from randomness. Our aim is to provide a global, macroscopic, single parameter characterisation of the statistical occurrence of bidirectional and unidirectional motifs. To this end we define a symmetry measure that does not require any a priori thresholding of the weights or knowledge of their maximal value. We calculate its mean and variance for random uniform or Gaussian distributions, which allows us to introduce a confidence measure of how significantly symmetric or asymmetric a specific configuration is, i.e. how likely it is that the configuration is the result of chance. We demonstrate the discriminatory power of our symmetry measure by inspecting the eigenvalues of different types of connectivity matrices. We show that a Gaussian weight distribution biases the connectivity motifs to more symmetric configurations than a uniform distribution and that introducing a random synaptic pruning, mimicking developmental regulation in synaptogenesis, biases the connectivity motifs to more asymmetric configurations, regardless of the distribution. We expect that our work will benefit the computational modelling community, by providing a systematic way to characterise symmetry and asymmetry in network structures. Further, our symmetry measure will be of use to electrophysiologists that investigate symmetry of network connectivity.

Network Sampling and Classification:An Investigation of Network Model Representations

PubMed Central

Airoldi, Edoardo M.; Bai, Xue; Carley, Kathleen M.

2011-01-01

Methods for generating a random sample of networks with desired properties are important tools for the analysis of social, biological, and information networks. Algorithm-based approaches to sampling networks have received a great deal of attention in recent literature. Most of these algorithms are based on simple intuitions that associate the full features of connectivity patterns with specific values of only one or two network metrics. Substantive conclusions are crucially dependent on this association holding true. However, the extent to which this simple intuition holds true is not yet known. In this paper, we examine the association between the connectivity patterns that a network sampling algorithm aims to generate and the connectivity patterns of the generated networks, measured by an existing set of popular network metrics. We find that different network sampling algorithms can yield networks with similar connectivity patterns. We also find that the alternative algorithms for the same connectivity pattern can yield networks with different connectivity patterns. We argue that conclusions based on simulated network studies must focus on the full features of the connectivity patterns of a network instead of on the limited set of network metrics for a specific network type. This fact has important implications for network data analysis: for instance, implications related to the way significance is currently assessed. PMID:21666773

Bridges in complex networks

NASA Astrophysics Data System (ADS)

Wu, Ang-Kun; Tian, Liang; Liu, Yang-Yu

2018-01-01

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that real networks typically have more bridges than their completely randomized counterparts, but they have a fraction of bridges that is very similar to their degree-preserving randomizations. We define an edge centrality measure, called bridgeness, to quantify the importance of a bridge in damaging a network. We find that certain real networks have a very large average and variance of bridgeness compared to their degree-preserving randomizations and other real networks. Finally, we offer an analytical framework to calculate the bridge fraction and the average and variance of bridgeness for uncorrelated random networks with arbitrary degree distributions.

Single-phase and two-phase flow properties of mesaverde tight sandstone formation; random-network modeling approach

NASA Astrophysics Data System (ADS)

Bashtani, Farzad; Maini, Brij; Kantzas, Apostolos

2016-08-01

3D random networks are constructed in order to represent the tight Mesaverde formation which is located in north Wyoming, USA. The porous-space is represented by pore bodies of different shapes and sizes which are connected to each other by pore throats of varying length and diameter. Pore bodies are randomly distributed in space and their connectivity varies based on the connectivity number distribution which is used in order to generate the network. Network representations are then validated using publicly available mercury porosimetry experiments. The network modeling software solves the fundamental equations of two-phase immiscible flow incorporating wettability and contact angle variability. Quasi-static displacement is assumed. Single phase macroscopic properties (porosity, permeability) are calculated and whenever possible are compared to experimental data. Using this information drainage and imbibition capillary pressure, and relative permeability curves are predicted and (whenever possible) compared to experimental data. The calculated information is grouped and compared to available literature information on typical behavior of tight formations. Capillary pressure curve for primary drainage process is predicted and compared to experimental mercury porosimetry in order to validate the virtual porous media by history matching. Relative permeability curves are also calculated and presented.

The Robustness Analysis of Wireless Sensor Networks under Uncertain Interference

PubMed Central

Deng, Changjian

2013-01-01

Based on the complex network theory, robustness analysis of condition monitoring wireless sensor network under uncertain interference is present. In the evolution of the topology of sensor networks, the density weighted algebraic connectivity is taken into account, and the phenomenon of removing and repairing the link and node in the network is discussed. Numerical simulation is conducted to explore algebraic connectivity characteristics and network robustness performance. It is found that nodes density has the effect on algebraic connectivity distribution in the random graph model; high density nodes carry more connections, use more throughputs, and may be more unreliable. Moreover, the results show that, when network should be more error tolerant or robust by repairing nodes or adding new nodes, the network should be better clustered in median and high scale wireless sensor networks and be meshing topology in small scale networks. PMID:24363613

Cross over of recurrence networks to random graphs and random geometric graphs

NASA Astrophysics Data System (ADS)

Jacob, Rinku; Harikrishnan, K. P.; Misra, R.; Ambika, G.

2017-02-01

Recurrence networks are complex networks constructed from the time series of chaotic dynamical systems where the connection between two nodes is limited by the recurrence threshold. This condition makes the topology of every recurrence network unique with the degree distribution determined by the probability density variations of the representative attractor from which it is constructed. Here we numerically investigate the properties of recurrence networks from standard low-dimensional chaotic attractors using some basic network measures and show how the recurrence networks are different from random and scale-free networks. In particular, we show that all recurrence networks can cross over to random geometric graphs by adding sufficient amount of noise to the time series and into the classical random graphs by increasing the range of interaction to the system size. We also highlight the effectiveness of a combined plot of characteristic path length and clustering coefficient in capturing the small changes in the network characteristics.

Network meta-analysis of disconnected networks: How dangerous are random baseline treatment effects?

PubMed

Béliveau, Audrey; Goring, Sarah; Platt, Robert W; Gustafson, Paul

2017-12-01

In network meta-analysis, the use of fixed baseline treatment effects (a priori independent) in a contrast-based approach is regularly preferred to the use of random baseline treatment effects (a priori dependent). That is because, often, there is not a need to model baseline treatment effects, which carry the risk of model misspecification. However, in disconnected networks, fixed baseline treatment effects do not work (unless extra assumptions are made), as there is not enough information in the data to update the prior distribution on the contrasts between disconnected treatments. In this paper, we investigate to what extent the use of random baseline treatment effects is dangerous in disconnected networks. We take 2 publicly available datasets of connected networks and disconnect them in multiple ways. We then compare the results of treatment comparisons obtained from a Bayesian contrast-based analysis of each disconnected network using random normally distributed and exchangeable baseline treatment effects to those obtained from a Bayesian contrast-based analysis of their initial connected network using fixed baseline treatment effects. For the 2 datasets considered, we found that the use of random baseline treatment effects in disconnected networks was appropriate. Because those datasets were not cherry-picked, there should be other disconnected networks that would benefit from being analyzed using random baseline treatment effects. However, there is also a risk for the normality and exchangeability assumption to be inappropriate in other datasets even though we have not observed this situation in our case study. We provide code, so other datasets can be investigated. Copyright © 2017 John Wiley & Sons, Ltd.

Leveraging contact network structure in the design of cluster randomized trials.

PubMed

Harling, Guy; Wang, Rui; Onnela, Jukka-Pekka; De Gruttola, Victor

2017-02-01

In settings like the Ebola epidemic, where proof-of-principle trials have provided evidence of efficacy but questions remain about the effectiveness of different possible modes of implementation, it may be useful to conduct trials that not only generate information about intervention effects but also themselves provide public health benefit. Cluster randomized trials are of particular value for infectious disease prevention research by virtue of their ability to capture both direct and indirect effects of intervention, the latter of which depends heavily on the nature of contact networks within and across clusters. By leveraging information about these networks-in particular the degree of connection across randomized units, which can be obtained at study baseline-we propose a novel class of connectivity-informed cluster trial designs that aim both to improve public health impact (speed of epidemic control) and to preserve the ability to detect intervention effects. We several designs for cluster randomized trials with staggered enrollment, in each of which the order of enrollment is based on the total number of ties (contacts) from individuals within a cluster to individuals in other clusters. Our designs can accommodate connectivity based either on the total number of external connections at baseline or on connections only to areas yet to receive the intervention. We further consider a "holdback" version of the designs in which control clusters are held back from re-randomization for some time interval. We investigate the performance of these designs in terms of epidemic control outcomes (time to end of epidemic and cumulative incidence) and power to detect intervention effect, by simulating vaccination trials during an SEIR-type epidemic outbreak using a network-structured agent-based model. We compare results to those of a traditional Stepped Wedge trial. In our simulation studies, connectivity-informed designs lead to a 20% reduction in cumulative incidence compared to comparable traditional study designs, but have little impact on epidemic length. Power to detect intervention effect is reduced in all connectivity-informed designs, but "holdback" versions provide power that is very close to that of a traditional Stepped Wedge approach. Incorporating information about cluster connectivity in the design of cluster randomized trials can increase their public health impact, especially in acute outbreak settings. Using this information helps control outbreaks-by minimizing the number of cross-cluster infections-with very modest cost in terms of power to detect effectiveness.

Alzheimer Classification Using a Minimum Spanning Tree of High-Order Functional Network on fMRI Dataset

PubMed Central

Guo, Hao; Liu, Lei; Chen, Junjie; Xu, Yong; Jie, Xiang

2017-01-01

Functional magnetic resonance imaging (fMRI) is one of the most useful methods to generate functional connectivity networks of the brain. However, conventional network generation methods ignore dynamic changes of functional connectivity between brain regions. Previous studies proposed constructing high-order functional connectivity networks that consider the time-varying characteristics of functional connectivity, and a clustering method was performed to decrease computational cost. However, random selection of the initial clustering centers and the number of clusters negatively affected classification accuracy, and the network lost neurological interpretability. Here we propose a novel method that introduces the minimum spanning tree method to high-order functional connectivity networks. As an unbiased method, the minimum spanning tree simplifies high-order network structure while preserving its core framework. The dynamic characteristics of time series are not lost with this approach, and the neurological interpretation of the network is guaranteed. Simultaneously, we propose a multi-parameter optimization framework that involves extracting discriminative features from the minimum spanning tree high-order functional connectivity networks. Compared with the conventional methods, our resting-state fMRI classification method based on minimum spanning tree high-order functional connectivity networks greatly improved the diagnostic accuracy for Alzheimer's disease. PMID:29249926

On Connectivity of Wireless Sensor Networks with Directional Antennas

PubMed Central

Wang, Qiu; Dai, Hong-Ning; Zheng, Zibin; Imran, Muhammad; Vasilakos, Athanasios V.

2017-01-01

In this paper, we investigate the network connectivity of wireless sensor networks with directional antennas. In particular, we establish a general framework to analyze the network connectivity while considering various antenna models and the channel randomness. Since existing directional antenna models have their pros and cons in the accuracy of reflecting realistic antennas and the computational complexity, we propose a new analytical directional antenna model called the iris model to balance the accuracy against the complexity. We conduct extensive simulations to evaluate the analytical framework. Our results show that our proposed analytical model on the network connectivity is accurate, and our iris antenna model can provide a better approximation to realistic directional antennas than other existing antenna models. PMID:28085081

Finite plateau in spectral gap of polychromatic constrained random networks

NASA Astrophysics Data System (ADS)

Avetisov, V.; Gorsky, A.; Nechaev, S.; Valba, O.

2017-12-01

We consider critical behavior in the ensemble of polychromatic Erdős-Rényi networks and regular random graphs, where network vertices are painted in different colors. The links can be randomly removed and added to the network subject to the condition of the vertex degree conservation. In these constrained graphs we run the Metropolis procedure, which favors the connected unicolor triads of nodes. Changing the chemical potential, μ , of such triads, for some wide region of μ , we find the formation of a finite plateau in the number of intercolor links, which exactly matches the finite plateau in the network algebraic connectivity (the value of the first nonvanishing eigenvalue of the Laplacian matrix, λ2). We claim that at the plateau the spontaneously broken Z2 symmetry is restored by the mechanism of modes collectivization in clusters of different colors. The phenomena of a finite plateau formation holds also for polychromatic networks with M ≥2 colors. The behavior of polychromatic networks is analyzed via the spectral properties of their adjacency and Laplacian matrices.

Rhythmogenic neuronal networks, emergent leaders, and k-cores.

PubMed

Schwab, David J; Bruinsma, Robijn F; Feldman, Jack L; Levine, Alex J

2010-11-01

Neuronal network behavior results from a combination of the dynamics of individual neurons and the connectivity of the network that links them together. We study a simplified model, based on the proposal of Feldman and Del Negro (FDN) [Nat. Rev. Neurosci. 7, 232 (2006)], of the preBötzinger Complex, a small neuronal network that participates in the control of the mammalian breathing rhythm through periodic firing bursts. The dynamics of this randomly connected network of identical excitatory neurons differ from those of a uniformly connected one. Specifically, network connectivity determines the identity of emergent leader neurons that trigger the firing bursts. When neuronal desensitization is controlled by the number of input signals to the neurons (as proposed by FDN), the network's collective desensitization--required for successful burst termination--is mediated by k-core clusters of neurons.

The Cognitive Social Network in Dreams: Transitivity, Assortativity, and Giant Component Proportion Are Monotonic.

PubMed

Han, Hye Joo; Schweickert, Richard; Xi, Zhuangzhuang; Viau-Quesnel, Charles

2016-04-01

For five individuals, a social network was constructed from a series of his or her dreams. Three important network measures were calculated for each network: transitivity, assortativity, and giant component proportion. These were monotonically related; over the five networks as transitivity increased, assortativity increased and giant component proportion decreased. The relations indicate that characters appear in dreams systematically. Systematicity likely arises from the dreamer's memory of people and their relations, which is from the dreamer's cognitive social network. But the dream social network is not a copy of the cognitive social network. Waking life social networks tend to have positive assortativity; that is, people tend to be connected to others with similar connectivity. Instead, in our sample of dream social networks assortativity is more often negative or near 0, as in online social networks. We show that if characters appear via a random walk, negative assortativity can result, particularly if the random walk is biased as suggested by remote associations. Copyright © 2015 Cognitive Science Society, Inc.

Impact of Beamforming on the Path Connectivity in Cognitive Radio Ad Hoc Networks

PubMed Central

Dung, Le The; Hieu, Tran Dinh; Choi, Seong-Gon; Kim, Byung-Seo; An, Beongku

2017-01-01

This paper investigates the impact of using directional antennas and beamforming schemes on the connectivity of cognitive radio ad hoc networks (CRAHNs). Specifically, considering that secondary users use two kinds of directional antennas, i.e., uniform linear array (ULA) and uniform circular array (UCA) antennas, and two different beamforming schemes, i.e., randomized beamforming and center-directed to communicate with each other, we study the connectivity of all combination pairs of directional antennas and beamforming schemes and compare their performances to those of omnidirectional antennas. The results obtained in this paper show that, compared with omnidirectional transmission, beamforming transmission only benefits the connectivity when the density of secondary user is moderate. Moreover, the combination of UCA and randomized beamforming scheme gives the highest path connectivity in all evaluating scenarios. Finally, the number of antenna elements and degree of path loss greatly affect path connectivity in CRAHNs. PMID:28346377

Recurrent Network models of sequence generation and memory

PubMed Central

Rajan, Kanaka; Harvey, Christopher D; Tank, David W

2016-01-01

SUMMARY Sequential activation of neurons is a common feature of network activity during a variety of behaviors, including working memory and decision making. Previous network models for sequences and memory emphasized specialized architectures in which a principled mechanism is pre-wired into their connectivity. Here, we demonstrate that starting from random connectivity and modifying a small fraction of connections, a largely disordered recurrent network can produce sequences and implement working memory efficiently. We use this process, called Partial In-Network training (PINning), to model and match cellular-resolution imaging data from the posterior parietal cortex during a virtual memory-guided two-alternative forced choice task [Harvey, Coen and Tank, 2012]. Analysis of the connectivity reveals that sequences propagate by the cooperation between recurrent synaptic interactions and external inputs, rather than through feedforward or asymmetric connections. Together our results suggest that neural sequences may emerge through learning from largely unstructured network architectures. PMID:26971945

Quasirandom geometric networks from low-discrepancy sequences

NASA Astrophysics Data System (ADS)

Estrada, Ernesto

2017-08-01

We define quasirandom geometric networks using low-discrepancy sequences, such as Halton, Sobol, and Niederreiter. The networks are built in d dimensions by considering the d -tuples of digits generated by these sequences as the coordinates of the vertices of the networks in a d -dimensional Id unit hypercube. Then, two vertices are connected by an edge if they are at a distance smaller than a connection radius. We investigate computationally 11 network-theoretic properties of two-dimensional quasirandom networks and compare them with analogous random geometric networks. We also study their degree distribution and their spectral density distributions. We conclude from this intensive computational study that in terms of the uniformity of the distribution of the vertices in the unit square, the quasirandom networks look more random than the random geometric networks. We include an analysis of potential strategies for generating higher-dimensional quasirandom networks, where it is know that some of the low-discrepancy sequences are highly correlated. In this respect, we conclude that up to dimension 20, the use of scrambling, skipping and leaping strategies generate quasirandom networks with the desired properties of uniformity. Finally, we consider a diffusive process taking place on the nodes and edges of the quasirandom and random geometric graphs. We show that the diffusion time is shorter in the quasirandom graphs as a consequence of their larger structural homogeneity. In the random geometric graphs the diffusion produces clusters of concentration that make the process more slow. Such clusters are a direct consequence of the heterogeneous and irregular distribution of the nodes in the unit square in which the generation of random geometric graphs is based on.

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.

The influence of hubs in the structure of a neuronal network during an epileptic seizure

NASA Astrophysics Data System (ADS)

Rodrigues, Abner Cardoso; Cerdeira, Hilda A.; Machado, Birajara Soares

2016-02-01

In this work, we propose changes in the structure of a neuronal network with the intention to provoke strong synchronization to simulate episodes of epileptic seizure. Starting with a network of Izhikevich neurons we slowly increase the number of connections in selected nodes in a controlled way, to produce (or not) hubs. We study how these structures alter the synchronization on the spike firings interval, on individual neurons as well as on mean values, as a function of the concentration of connections for random and non-random (hubs) distribution. We also analyze how the post-ictal signal varies for the different distributions. We conclude that a network with hubs is more appropriate to represent an epileptic state.

Effects of local and global network connectivity on synergistic epidemics

NASA Astrophysics Data System (ADS)

Broder-Rodgers, David; Pérez-Reche, Francisco J.; Taraskin, Sergei N.

2015-12-01

Epidemics in networks can be affected by cooperation in transmission of infection and also connectivity between nodes. An interplay between these two properties and their influence on epidemic spread are addressed in the paper. A particular type of cooperative effects (called synergy effects) is considered, where the transmission rate between a pair of nodes depends on the number of infected neighbors. The connectivity effects are studied by constructing networks of different topology, starting with lattices with only local connectivity and then with networks that have both local and global connectivity obtained by random bond-rewiring to nodes within a certain distance. The susceptible-infected-removed epidemics were found to exhibit several interesting effects: (i) for epidemics with strong constructive synergy spreading in networks with high local connectivity, the bond rewiring has a negative role in epidemic spread, i.e., it reduces invasion probability; (ii) in contrast, for epidemics with destructive or weak constructive synergy spreading on networks of arbitrary local connectivity, rewiring helps epidemics to spread; (iii) and, finally, rewiring always enhances the spread of epidemics, independent of synergy, if the local connectivity is low.

Effects of local and global network connectivity on synergistic epidemics.

PubMed

Broder-Rodgers, David; Pérez-Reche, Francisco J; Taraskin, Sergei N

2015-12-01

Epidemics in networks can be affected by cooperation in transmission of infection and also connectivity between nodes. An interplay between these two properties and their influence on epidemic spread are addressed in the paper. A particular type of cooperative effects (called synergy effects) is considered, where the transmission rate between a pair of nodes depends on the number of infected neighbors. The connectivity effects are studied by constructing networks of different topology, starting with lattices with only local connectivity and then with networks that have both local and global connectivity obtained by random bond-rewiring to nodes within a certain distance. The susceptible-infected-removed epidemics were found to exhibit several interesting effects: (i) for epidemics with strong constructive synergy spreading in networks with high local connectivity, the bond rewiring has a negative role in epidemic spread, i.e., it reduces invasion probability; (ii) in contrast, for epidemics with destructive or weak constructive synergy spreading on networks of arbitrary local connectivity, rewiring helps epidemics to spread; (iii) and, finally, rewiring always enhances the spread of epidemics, independent of synergy, if the local connectivity is low.

OSI Network-layer Abstraction: Analysis of Simulation Dynamics and Performance Indicators

NASA Astrophysics Data System (ADS)

Lawniczak, Anna T.; Gerisch, Alf; Di Stefano, Bruno

2005-06-01

The Open Systems Interconnection (OSI) reference model provides a conceptual framework for communication among computers in a data communication network. The Network Layer of this model is responsible for the routing and forwarding of packets of data. We investigate the OSI Network Layer and develop an abstraction suitable for the study of various network performance indicators, e.g. throughput, average packet delay, average packet speed, average packet path-length, etc. We investigate how the network dynamics and the network performance indicators are affected by various routing algorithms and by the addition of randomly generated links into a regular network connection topology of fixed size. We observe that the network dynamics is not simply the sum of effects resulting from adding individual links to the connection topology but rather is governed nonlinearly by the complex interactions caused by the existence of all randomly added and already existing links in the network. Data for our study was gathered using Netzwerk-1, a C++ simulation tool that we developed for our abstraction.

Using circuit theory to model connectivity in ecology, evolution, and conservation.

PubMed

McRae, Brad H; Dickson, Brett G; Keitt, Timothy H; Shah, Viral B

2008-10-01

Connectivity among populations and habitats is important for a wide range of ecological processes. Understanding, preserving, and restoring connectivity in complex landscapes requires connectivity models and metrics that are reliable, efficient, and process based. We introduce a new class of ecological connectivity models based in electrical circuit theory. Although they have been applied in other disciplines, circuit-theoretic connectivity models are new to ecology. They offer distinct advantages over common analytic connectivity models, including a theoretical basis in random walk theory and an ability to evaluate contributions of multiple dispersal pathways. Resistance, current, and voltage calculated across graphs or raster grids can be related to ecological processes (such as individual movement and gene flow) that occur across large population networks or landscapes. Efficient algorithms can quickly solve networks with millions of nodes, or landscapes with millions of raster cells. Here we review basic circuit theory, discuss relationships between circuit and random walk theories, and describe applications in ecology, evolution, and conservation. We provide examples of how circuit models can be used to predict movement patterns and fates of random walkers in complex landscapes and to identify important habitat patches and movement corridors for conservation planning.

Coverage in Heterogeneous Sensor Networks

DTIC Science & Technology

2006-01-01

and S. Banerjee, “Node Placement for Connected Coverage in Sensor Networks,” in Proceedings of WiOpt ’03, March 2003. [10] F. Koushanfar, S...Meguerdichian, M. Potkonjak, and M. Srivastava, Cov- erage Problems in Wireless Ad-Hoc Sensor Networks, in Proceedings of the IEEE INFOCOM 01, March 2001, pp...Coverage and Connectivity of Ad Hoc Networks in Presence of Channel Randomness,” in Proceedings of the IEEE INFOCOM 05, March 2005, pp. 491–502. [16] S

Inclusion of Topological Measurements into Analytic Estimates of Effective Permeability in Fractured Media

NASA Astrophysics Data System (ADS)

Sævik, P. N.; Nixon, C. W.

2017-11-01

We demonstrate how topology-based measures of connectivity can be used to improve analytical estimates of effective permeability in 2-D fracture networks, which is one of the key parameters necessary for fluid flow simulations at the reservoir scale. Existing methods in this field usually compute fracture connectivity using the average fracture length. This approach is valid for ideally shaped, randomly distributed fractures, but is not immediately applicable to natural fracture networks. In particular, natural networks tend to be more connected than randomly positioned fractures of comparable lengths, since natural fractures often terminate in each other. The proposed topological connectivity measure is based on the number of intersections and fracture terminations per sampling area, which for statistically stationary networks can be obtained directly from limited outcrop exposures. To evaluate the method, numerical permeability upscaling was performed on a large number of synthetic and natural fracture networks, with varying topology and geometry. The proposed method was seen to provide much more reliable permeability estimates than the length-based approach, across a wide range of fracture patterns. We summarize our results in a single, explicit formula for the effective permeability.

Influence network linkages across implementation strategy conditions in a randomized controlled trial of two strategies for scaling up evidence-based practices in public youth-serving systems

PubMed Central

2013-01-01

Background Given the importance of influence networks in the implementation of evidence-based practices and interventions, it is unclear whether such networks continue to operate as sources of information and advice when they are segmented and disrupted by randomization to different implementation strategy conditions. The present study examines the linkages across implementation strategy conditions of social influence networks of leaders of youth-serving systems in 12 California counties participating in a randomized controlled trial of community development teams (CDTs) to scale up use of an evidence-based practice. Methods Semi-structured interviews were conducted with 38 directors, assistant directors, and program managers of county probation, mental health, and child welfare departments. A web-based survey collected additional quantitative data on information and advice networks of study participants. A mixed-methods approach to data analysis was used to create a sociometric data set (n = 176) to examine linkages between treatment and standard conditions. Results Of those network members who were affiliated with a county (n = 137), only 6 (4.4%) were directly connected to a member of the opposite implementation strategy condition; 19 (13.9%) were connected by two steps or fewer to a member of the opposite implementation strategy condition; 64 (46.7%) were connected by three or fewer steps to a member of the opposite implementation strategy condition. Most of the indirect steps between individuals who were in different implementation strategy conditions were connections involving a third non-county organizational entity that had an important role in the trial in keeping the implementation strategy conditions separate. When these entities were excluded, the CDT network exhibited fewer components and significantly higher betweenness centralization than did the standard condition network. Conclusion Although the integrity of the RCT in this instance was not compromised by study participant influence networks, RCT designs should consider how influence networks may extend beyond boundaries established by the randomization process in implementation studies. Trial registration NCT00880126 PMID:24229373

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

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

Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran

2005-09-01

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

Dynamics of Competition between Subnetworks of Spiking Neuronal Networks in the Balanced State.

PubMed

Lagzi, Fereshteh; Rotter, Stefan

2015-01-01

We explore and analyze the nonlinear switching dynamics of neuronal networks with non-homogeneous connectivity. The general significance of such transient dynamics for brain function is unclear; however, for instance decision-making processes in perception and cognition have been implicated with it. The network under study here is comprised of three subnetworks of either excitatory or inhibitory leaky integrate-and-fire neurons, of which two are of the same type. The synaptic weights are arranged to establish and maintain a balance between excitation and inhibition in case of a constant external drive. Each subnetwork is randomly connected, where all neurons belonging to a particular population have the same in-degree and the same out-degree. Neurons in different subnetworks are also randomly connected with the same probability; however, depending on the type of the pre-synaptic neuron, the synaptic weight is scaled by a factor. We observed that for a certain range of the "within" versus "between" connection weights (bifurcation parameter), the network activation spontaneously switches between the two sub-networks of the same type. This kind of dynamics has been termed "winnerless competition", which also has a random component here. In our model, this phenomenon is well described by a set of coupled stochastic differential equations of Lotka-Volterra type that imply a competition between the subnetworks. The associated mean-field model shows the same dynamical behavior as observed in simulations of large networks comprising thousands of spiking neurons. The deterministic phase portrait is characterized by two attractors and a saddle node, its stochastic component is essentially given by the multiplicative inherent noise of the system. We find that the dwell time distribution of the active states is exponential, indicating that the noise drives the system randomly from one attractor to the other. A similar model for a larger number of populations might suggest a general approach to study the dynamics of interacting populations of spiking networks.

Dynamics of Competition between Subnetworks of Spiking Neuronal Networks in the Balanced State

PubMed Central

Lagzi, Fereshteh; Rotter, Stefan

2015-01-01

We explore and analyze the nonlinear switching dynamics of neuronal networks with non-homogeneous connectivity. The general significance of such transient dynamics for brain function is unclear; however, for instance decision-making processes in perception and cognition have been implicated with it. The network under study here is comprised of three subnetworks of either excitatory or inhibitory leaky integrate-and-fire neurons, of which two are of the same type. The synaptic weights are arranged to establish and maintain a balance between excitation and inhibition in case of a constant external drive. Each subnetwork is randomly connected, where all neurons belonging to a particular population have the same in-degree and the same out-degree. Neurons in different subnetworks are also randomly connected with the same probability; however, depending on the type of the pre-synaptic neuron, the synaptic weight is scaled by a factor. We observed that for a certain range of the “within” versus “between” connection weights (bifurcation parameter), the network activation spontaneously switches between the two sub-networks of the same type. This kind of dynamics has been termed “winnerless competition”, which also has a random component here. In our model, this phenomenon is well described by a set of coupled stochastic differential equations of Lotka-Volterra type that imply a competition between the subnetworks. The associated mean-field model shows the same dynamical behavior as observed in simulations of large networks comprising thousands of spiking neurons. The deterministic phase portrait is characterized by two attractors and a saddle node, its stochastic component is essentially given by the multiplicative inherent noise of the system. We find that the dwell time distribution of the active states is exponential, indicating that the noise drives the system randomly from one attractor to the other. A similar model for a larger number of populations might suggest a general approach to study the dynamics of interacting populations of spiking networks. PMID:26407178

Random walks with long-range steps generated by functions of Laplacian matrices

NASA Astrophysics Data System (ADS)

Riascos, A. P.; Michelitsch, T. M.; Collet, B. A.; Nowakowski, A. F.; Nicolleau, F. C. G. A.

2018-04-01

In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize random walk strategies with local information in the Laplacian matrix, that describes the connections of a network, to a dynamic determined by functions of this matrix. The resulting processes are non-local allowing transitions of the random walker from one node to nodes beyond its nearest neighbors. We find that only two types of Laplacian functions are admissible with distinct behaviors for long-range steps in the infinite network limit: type (i) functions generate Brownian motions, type (ii) functions Lévy flights. For this asymptotic long-range step behavior only the lowest non-vanishing order of the Laplacian function is relevant, namely first order for type (i), and fractional order for type (ii) functions. In the first part, we discuss spectral properties of the Laplacian matrix and a series of relations that are maintained by a particular type of functions that allow to define random walks on any type of undirected connected networks. Once described general properties, we explore characteristics of random walk strategies that emerge from particular cases with functions defined in terms of exponentials, logarithms and powers of the Laplacian as well as relations of these dynamics with non-local strategies like Lévy flights and fractional transport. Finally, we analyze the global capacity of these random walk strategies to explore networks like lattices and trees and different types of random and complex networks.

Spatiotemporal Dynamics and Reliable Computations in Recurrent Spiking Neural Networks

NASA Astrophysics Data System (ADS)

Pyle, Ryan; Rosenbaum, Robert

2017-01-01

Randomly connected networks of excitatory and inhibitory spiking neurons provide a parsimonious model of neural variability, but are notoriously unreliable for performing computations. We show that this difficulty is overcome by incorporating the well-documented dependence of connection probability on distance. Spatially extended spiking networks exhibit symmetry-breaking bifurcations and generate spatiotemporal patterns that can be trained to perform dynamical computations under a reservoir computing framework.

Topographical maps as complex networks

NASA Astrophysics Data System (ADS)

da Fontoura Costa, Luciano; Diambra, Luis

2005-02-01

The neuronal networks in the mammalian cortex are characterized by the coexistence of hierarchy, modularity, short and long range interactions, spatial correlations, and topographical connections. Particularly interesting, the latter type of organization implies special demands on developing systems in order to achieve precise maps preserving spatial adjacencies, even at the expense of isometry. Although the object of intensive biological research, the elucidation of the main anatomic-functional purposes of the ubiquitous topographical connections in the mammalian brain remains an elusive issue. The present work reports on how recent results from complex network formalism can be used to quantify and model the effect of topographical connections between neuronal cells over the connectivity of the network. While the topographical mapping between two cortical modules is achieved by connecting nearest cells from each module, four kinds of network models are adopted for implementing intramodular connections, including random, preferential-attachment, short-range, and long-range networks. It is shown that, though spatially uniform and simple, topographical connections between modules can lead to major changes in the network properties in some specific cases, depending on intramodular connections schemes, fostering more effective intercommunication between the involved neuronal cells and modules. The possible implications of such effects on cortical operation are discussed.

A hypercube compact neural network

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

Rostykus, P.L.; Somani, A.K.

1988-09-01

A major problem facing implementation of neural networks is the connection problem. One popular tradeoff is to remove connections. Random disconnection severely degrades the capabilities. The hypercube based Compact Neural Network (CNN) has structured architecture combined with a rearrangement of the memory vectors gives a larger input space and better degradation than a cost equivalent network with more connections. The CNNs are based on a Hopfield network. The changes from the Hopfield net include states of -1 and +1 and when a node was evaluated to 0, it was not biased either positive or negative, instead it resumed its previousmore » state. L = PEs, N = memories and t/sub ij/s is the weights between i and j.« less

Minimum Winfree loop determines self-sustained oscillations in excitable Erdös-Rényi random networks.

PubMed

Qian, Yu; Cui, Xiaohua; Zheng, Zhigang

2017-07-18

The investigation of self-sustained oscillations in excitable complex networks is very important in understanding various activities in brain systems, among which the exploration of the key determinants of oscillations is a challenging task. In this paper, by investigating the influence of system parameters on self-sustained oscillations in excitable Erdös-Rényi random networks (EERRNs), the minimum Winfree loop (MWL) is revealed to be the key factor in determining the emergence of collective oscillations. Specifically, the one-to-one correspondence between the optimal connection probability (OCP) and the MWL length is exposed. Moreover, many important quantities such as the lower critical connection probability (LCCP), the OCP, and the upper critical connection probability (UCCP) are determined by the MWL. Most importantly, they can be approximately predicted by the network structure analysis, which have been verified in numerical simulations. Our results will be of great importance to help us in understanding the key factors in determining persistent activities in biological systems.

Memory replay in balanced recurrent networks

PubMed Central

Chenkov, Nikolay; Sprekeler, Henning; Kempter, Richard

2017-01-01

Complex patterns of neural activity appear during up-states in the neocortex and sharp waves in the hippocampus, including sequences that resemble those during prior behavioral experience. The mechanisms underlying this replay are not well understood. How can small synaptic footprints engraved by experience control large-scale network activity during memory retrieval and consolidation? We hypothesize that sparse and weak synaptic connectivity between Hebbian assemblies are boosted by pre-existing recurrent connectivity within them. To investigate this idea, we connect sequences of assemblies in randomly connected spiking neuronal networks with a balance of excitation and inhibition. Simulations and analytical calculations show that recurrent connections within assemblies allow for a fast amplification of signals that indeed reduces the required number of inter-assembly connections. Replay can be evoked by small sensory-like cues or emerge spontaneously by activity fluctuations. Global—potentially neuromodulatory—alterations of neuronal excitability can switch between network states that favor retrieval and consolidation. PMID:28135266

Spectrum of walk matrix for Koch network and its application

NASA Astrophysics Data System (ADS)

Xie, Pinchen; Lin, Yuan; Zhang, Zhongzhi

2015-06-01

Various structural and dynamical properties of a network are encoded in the eigenvalues of walk matrix describing random walks on the network. In this paper, we study the spectra of walk matrix of the Koch network, which displays the prominent scale-free and small-world features. Utilizing the particular architecture of the network, we obtain all the eigenvalues and their corresponding multiplicities. Based on the link between the eigenvalues of walk matrix and random target access time defined as the expected time for a walker going from an arbitrary node to another one selected randomly according to the steady-state distribution, we then derive an explicit solution to the random target access time for random walks on the Koch network. Finally, we corroborate our computation for the eigenvalues by enumerating spanning trees in the Koch network, using the connection governing eigenvalues and spanning trees, where a spanning tree of a network is a subgraph of the network, that is, a tree containing all the nodes.

Anisotropic connectivity implements motion-based prediction in a spiking neural network.

PubMed

Kaplan, Bernhard A; Lansner, Anders; Masson, Guillaume S; Perrinet, Laurent U

2013-01-01

Predictive coding hypothesizes that the brain explicitly infers upcoming sensory input to establish a coherent representation of the world. Although it is becoming generally accepted, it is not clear on which level spiking neural networks may implement predictive coding and what function their connectivity may have. We present a network model of conductance-based integrate-and-fire neurons inspired by the architecture of retinotopic cortical areas that assumes predictive coding is implemented through network connectivity, namely in the connection delays and in selectiveness for the tuning properties of source and target cells. We show that the applied connection pattern leads to motion-based prediction in an experiment tracking a moving dot. In contrast to our proposed model, a network with random or isotropic connectivity fails to predict the path when the moving dot disappears. Furthermore, we show that a simple linear decoding approach is sufficient to transform neuronal spiking activity into a probabilistic estimate for reading out the target trajectory.

Assortativity and leadership emerge from anti-preferential attachment in heterogeneous networks.

PubMed

Sendiña-Nadal, I; Danziger, M M; Wang, Z; Havlin, S; Boccaletti, S

2016-02-18

Real-world networks have distinct topologies, with marked deviations from purely random networks. Many of them exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Though microscopic mechanisms have been suggested for the emergence of other topological features, assortativity has proven elusive. Assortativity can be artificially implanted in a network via degree-preserving link permutations, however this destroys the graph's hierarchical clustering and does not correspond to any microscopic mechanism. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties in degree and clustering distributions and tunable realistic assortativity. Two distinct populations of nodes are incrementally added to an initial network by selecting a subgraph to connect to at random. One population (the followers) follows preferential attachment, while the other population (the potential leaders) connects via anti-preferential attachment: they link to lower degree nodes when added to the network. By selecting the lower degree nodes, the potential leader nodes maintain high visibility during the growth process, eventually growing into hubs. The evolution of links in Facebook empirically validates the connection between the initial anti-preferential attachment and long term high degree. In this way, our work sheds new light on the structure and evolution of social networks.

Assortativity and leadership emerge from anti-preferential attachment in heterogeneous networks

NASA Astrophysics Data System (ADS)

Sendiña-Nadal, I.; Danziger, M. M.; Wang, Z.; Havlin, S.; Boccaletti, S.

2016-02-01

Real-world networks have distinct topologies, with marked deviations from purely random networks. Many of them exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Though microscopic mechanisms have been suggested for the emergence of other topological features, assortativity has proven elusive. Assortativity can be artificially implanted in a network via degree-preserving link permutations, however this destroys the graph’s hierarchical clustering and does not correspond to any microscopic mechanism. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties in degree and clustering distributions and tunable realistic assortativity. Two distinct populations of nodes are incrementally added to an initial network by selecting a subgraph to connect to at random. One population (the followers) follows preferential attachment, while the other population (the potential leaders) connects via anti-preferential attachment: they link to lower degree nodes when added to the network. By selecting the lower degree nodes, the potential leader nodes maintain high visibility during the growth process, eventually growing into hubs. The evolution of links in Facebook empirically validates the connection between the initial anti-preferential attachment and long term high degree. In this way, our work sheds new light on the structure and evolution of social networks.

Disrupted subject-specific gray matter network properties and cognitive dysfunction in type 1 diabetes patients with and without proliferative retinopathy.

PubMed

van Duinkerken, Eelco; Ijzerman, Richard G; Klein, Martin; Moll, Annette C; Snoek, Frank J; Scheltens, Philip; Pouwels, Petra J W; Barkhof, Frederik; Diamant, Michaela; Tijms, Betty M

2016-03-01

Type 1 diabetes mellitus (T1DM) patients, especially with concomitant microvascular disease, such as proliferative retinopathy, have an increased risk of cognitive deficits. Local cortical gray matter volume reductions only partially explain these cognitive dysfunctions, possibly because volume reductions do not take into account the complex connectivity structure of the brain. This study aimed to identify gray matter network alterations in relation to cognition in T1DM. We investigated if subject-specific structural gray matter network properties, constructed from T1-weighted MRI scans, were different between T1DM patients with (n = 51) and without (n = 53) proliferative retinopathy versus controls (n = 49), and were associated to cognitive decrements and fractional anisotropy, as measured by voxel-based TBSS. Global normalized and local (45 bilateral anatomical regions) clustering coefficient and path length were assessed. These network properties measure how the organization of connections in a network differs from that of randomly connected networks. Global gray matter network topology was more randomly organized in both T1DM patient groups versus controls, with the largest effects seen in patients with proliferative retinopathy. Lower local path length values were widely distributed throughout the brain. Lower local clustering was observed in the middle frontal, postcentral, and occipital areas. Complex network topology explained up to 20% of the variance of cognitive decrements, beyond other predictors. Exploratory analyses showed that lower fractional anisotropy was associated with a more random gray matter network organization. T1DM and proliferative retinopathy affect cortical network organization that may consequently contribute to clinically relevant changes in cognitive functioning in these patients. © 2015 Wiley Periodicals, Inc.

Transport and percolation in complex networks

NASA Astrophysics Data System (ADS)

Li, Guanliang

To design complex networks with optimal transport properties such as flow efficiency, we consider three approaches to understanding transport and percolation in complex networks. We analyze the effects of randomizing the strengths of connections, randomly adding long-range connections to regular lattices, and percolation of spatially constrained networks. Various real-world networks often have links that are differentiated in terms of their strength, intensity, or capacity. We study the distribution P(σ) of the equivalent conductance for Erdoḧs-Rényi (ER) and scale-free (SF) weighted resistor networks with N nodes, for which links are assigned with conductance σ i ≡ e-axi, where xi is a random variable with 0 < xi < 1. We find, both analytically and numerically, that P(σ) for ER networks exhibits two regimes: (i) For σ < e-apc, P(σ) is independent of N and scales as a power law P(σ) ˜ sk/a-1 . Here pc = 1/ is the critical percolation threshold of the network and is the average degree of the network. (ii) For σ > e -apc, P(σ) has strong N dependence and scales as P(σ) ˜ f(σ, apc/N1/3). Transport properties are greatly affected by the topology of networks. We investigate the transport problem in lattices with long-range connections and subject to a cost constraint, seeking design principles for optimal transport networks. Our network is built from a regular d-dimensional lattice to be improved by adding long-range connections with probability Pij ˜ r-aij , where rij is the lattice distance between site i and j. We introduce a cost constraint on the total length of the additional links and find optimal transport in the system for α = d + 1, established here for d = 1, 2 and 3 for regular lattices and df for fractals. Remarkably, this cost constraint approach remains optimal, regardless of the strategy used for transport, whether based on local or global knowledge of the network structure. To further understand the role that long-range connections play in optimizing the transport of complex systems, we study the percolation of spatially constrained networks. We now consider originally empty lattices embedded in d dimensions by adding long-range connections with the same power law probability p(r) ˜ r -α. We find that, for α ≤ d, the percolation transition belongs to the universality class of percolation in ER networks, while for α > 2d it belongs to the universality class of percolation in regular lattices (for one-dimensional linear chain, there is no percolation transition). However for d < α < 2d, the percolation properties show new intermediate behavior different from ER networks, with critical exponents that depend on α.

Interplay between Graph Topology and Correlations of Third Order in Spiking Neuronal Networks.

PubMed

Jovanović, Stojan; Rotter, Stefan

2016-06-01

The study of processes evolving on networks has recently become a very popular research field, not only because of the rich mathematical theory that underpins it, but also because of its many possible applications, a number of them in the field of biology. Indeed, molecular signaling pathways, gene regulation, predator-prey interactions and the communication between neurons in the brain can be seen as examples of networks with complex dynamics. The properties of such dynamics depend largely on the topology of the underlying network graph. In this work, we want to answer the following question: Knowing network connectivity, what can be said about the level of third-order correlations that will characterize the network dynamics? We consider a linear point process as a model for pulse-coded, or spiking activity in a neuronal network. Using recent results from theory of such processes, we study third-order correlations between spike trains in such a system and explain which features of the network graph (i.e. which topological motifs) are responsible for their emergence. Comparing two different models of network topology-random networks of Erdős-Rényi type and networks with highly interconnected hubs-we find that, in random networks, the average measure of third-order correlations does not depend on the local connectivity properties, but rather on global parameters, such as the connection probability. This, however, ceases to be the case in networks with a geometric out-degree distribution, where topological specificities have a strong impact on average correlations.

Collective relaxation dynamics of small-world networks

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N , average degree k , and topological randomness q . We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q , including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Collective relaxation dynamics of small-world networks.

PubMed

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N, average degree k, and topological randomness q. We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q, including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Counting and classifying attractors in high dimensional dynamical systems.

PubMed

Bagley, R J; Glass, L

1996-12-07

Randomly connected Boolean networks have been used as mathematical models of neural, genetic, and immune systems. A key quantity of such networks is the number of basins of attraction in the state space. The number of basins of attraction changes as a function of the size of the network, its connectivity and its transition rules. In discrete networks, a simple count of the number of attractors does not reveal the combinatorial structure of the attractors. These points are illustrated in a reexamination of dynamics in a class of random Boolean networks considered previously by Kauffman. We also consider comparisons between dynamics in discrete networks and continuous analogues. A continuous analogue of a discrete network may have a different number of attractors for many different reasons. Some attractors in discrete networks may be associated with unstable dynamics, and several different attractors in a discrete network may be associated with a single attractor in the continuous case. Special problems in determining attractors in continuous systems arise when there is aperiodic dynamics associated with quasiperiodicity of deterministic chaos.

Mixed Effects Models for Resampled Network Statistics Improves Statistical Power to Find Differences in Multi-Subject Functional Connectivity

PubMed Central

Narayan, Manjari; Allen, Genevera I.

2016-01-01

Many complex brain disorders, such as autism spectrum disorders, exhibit a wide range of symptoms and disability. To understand how brain communication is impaired in such conditions, functional connectivity studies seek to understand individual differences in brain network structure in terms of covariates that measure symptom severity. In practice, however, functional connectivity is not observed but estimated from complex and noisy neural activity measurements. Imperfect subject network estimates can compromise subsequent efforts to detect covariate effects on network structure. We address this problem in the case of Gaussian graphical models of functional connectivity, by proposing novel two-level models that treat both subject level networks and population level covariate effects as unknown parameters. To account for imperfectly estimated subject level networks when fitting these models, we propose two related approaches—R2 based on resampling and random effects test statistics, and R3 that additionally employs random adaptive penalization. Simulation studies using realistic graph structures reveal that R2 and R3 have superior statistical power to detect covariate effects compared to existing approaches, particularly when the number of within subject observations is comparable to the size of subject networks. Using our novel models and methods to study parts of the ABIDE dataset, we find evidence of hypoconnectivity associated with symptom severity in autism spectrum disorders, in frontoparietal and limbic systems as well as in anterior and posterior cingulate cortices. PMID:27147940

Intrinsically-generated fluctuating activity in excitatory-inhibitory networks.

PubMed

Mastrogiuseppe, Francesca; Ostojic, Srdjan

2017-04-01

Recurrent networks of non-linear units display a variety of dynamical regimes depending on the structure of their synaptic connectivity. A particularly remarkable phenomenon is the appearance of strongly fluctuating, chaotic activity in networks of deterministic, but randomly connected rate units. How this type of intrinsically generated fluctuations appears in more realistic networks of spiking neurons has been a long standing question. To ease the comparison between rate and spiking networks, recent works investigated the dynamical regimes of randomly-connected rate networks with segregated excitatory and inhibitory populations, and firing rates constrained to be positive. These works derived general dynamical mean field (DMF) equations describing the fluctuating dynamics, but solved these equations only in the case of purely inhibitory networks. Using a simplified excitatory-inhibitory architecture in which DMF equations are more easily tractable, here we show that the presence of excitation qualitatively modifies the fluctuating activity compared to purely inhibitory networks. In presence of excitation, intrinsically generated fluctuations induce a strong increase in mean firing rates, a phenomenon that is much weaker in purely inhibitory networks. Excitation moreover induces two different fluctuating regimes: for moderate overall coupling, recurrent inhibition is sufficient to stabilize fluctuations; for strong coupling, firing rates are stabilized solely by the upper bound imposed on activity, even if inhibition is stronger than excitation. These results extend to more general network architectures, and to rate networks receiving noisy inputs mimicking spiking activity. Finally, we show that signatures of the second dynamical regime appear in networks of integrate-and-fire neurons.

Intrinsically-generated fluctuating activity in excitatory-inhibitory networks

PubMed Central

Mastrogiuseppe, Francesca; Ostojic, Srdjan

2017-01-01

Recurrent networks of non-linear units display a variety of dynamical regimes depending on the structure of their synaptic connectivity. A particularly remarkable phenomenon is the appearance of strongly fluctuating, chaotic activity in networks of deterministic, but randomly connected rate units. How this type of intrinsically generated fluctuations appears in more realistic networks of spiking neurons has been a long standing question. To ease the comparison between rate and spiking networks, recent works investigated the dynamical regimes of randomly-connected rate networks with segregated excitatory and inhibitory populations, and firing rates constrained to be positive. These works derived general dynamical mean field (DMF) equations describing the fluctuating dynamics, but solved these equations only in the case of purely inhibitory networks. Using a simplified excitatory-inhibitory architecture in which DMF equations are more easily tractable, here we show that the presence of excitation qualitatively modifies the fluctuating activity compared to purely inhibitory networks. In presence of excitation, intrinsically generated fluctuations induce a strong increase in mean firing rates, a phenomenon that is much weaker in purely inhibitory networks. Excitation moreover induces two different fluctuating regimes: for moderate overall coupling, recurrent inhibition is sufficient to stabilize fluctuations; for strong coupling, firing rates are stabilized solely by the upper bound imposed on activity, even if inhibition is stronger than excitation. These results extend to more general network architectures, and to rate networks receiving noisy inputs mimicking spiking activity. Finally, we show that signatures of the second dynamical regime appear in networks of integrate-and-fire neurons. PMID:28437436

Sensitivity and network topology in chemical reaction systems

NASA Astrophysics Data System (ADS)

Okada, Takashi; Mochizuki, Atsushi

2017-08-01

In living cells, biochemical reactions are catalyzed by specific enzymes and connect to one another by sharing substrates and products, forming complex networks. In our previous studies, we established a framework determining the responses to enzyme perturbations only from network topology, and then proved a theorem, called the law of localization, explaining response patterns in terms of network topology. In this paper, we generalize these results to reaction networks with conserved concentrations, which allows us to study any reaction system. We also propose network characteristics quantifying robustness. We compare E. coli metabolic network with randomly rewired networks, and find that the robustness of the E. coli network is significantly higher than that of the random networks.

Short-Term Memory in Orthogonal Neural Networks

NASA Astrophysics Data System (ADS)

White, Olivia L.; Lee, Daniel D.; Sompolinsky, Haim

2004-04-01

We study the ability of linear recurrent networks obeying discrete time dynamics to store long temporal sequences that are retrievable from the instantaneous state of the network. We calculate this temporal memory capacity for both distributed shift register and random orthogonal connectivity matrices. We show that the memory capacity of these networks scales with system size.

Effect of packing method on the randomness of disc packings

NASA Astrophysics Data System (ADS)

Zhang, Z. P.; Yu, A. B.; Oakeshott, R. B. S.

1996-06-01

The randomness of disc packings, generated by random sequential adsorption (RSA), random packing under gravity (RPG) and Mason packing (MP) which gives a packing density close to that of the RSA packing, has been analysed, based on the Delaunay tessellation, and is evaluated at two levels, i.e. the randomness at individual subunit level which relates to the construction of a triangle from a given edge length distribution and the randomness at network level which relates to the connection between triangles from a given triangle frequency distribution. The Delaunay tessellation itself is also analysed and its almost perfect randomness at the two levels is demonstrated, which verifies the proposed approach and provides a random reference system for the present analysis. It is found that (i) the construction of a triangle subunit is not random for the RSA, MP and RPG packings, with the degree of randomness decreasing from the RSA to MP and then to RPG packing; (ii) the connection of triangular subunits in the network is almost perfectly random for the RSA packing, acceptable for the MP packing and not good for the RPG packing. Packing method is an important factor governing the randomness of disc packings.

Immunization of Epidemics in Multiplex Networks

PubMed Central

Zhao, Dawei; Wang, Lianhai; Li, Shudong; Wang, Zhen; Wang, Lin; Gao, Bo

2014-01-01

Up to now, immunization of disease propagation has attracted great attention in both theoretical and experimental researches. However, vast majority of existing achievements are limited to the simple assumption of single layer networked population, which seems obviously inconsistent with recent development of complex network theory: each node could possess multiple roles in different topology connections. Inspired by this fact, we here propose the immunization strategies on multiplex networks, including multiplex node-based random (targeted) immunization and layer node-based random (targeted) immunization. With the theory of generating function, theoretical analysis is developed to calculate the immunization threshold, which is regarded as the most critical index for the effectiveness of addressed immunization strategies. Interestingly, both types of random immunization strategies show more efficiency in controlling disease spreading on multiplex Erdös-Rényi (ER) random networks; while targeted immunization strategies provide better protection on multiplex scale-free (SF) networks. PMID:25401755

Immunization of epidemics in multiplex networks.

PubMed

Zhao, Dawei; Wang, Lianhai; Li, Shudong; Wang, Zhen; Wang, Lin; Gao, Bo

2014-01-01

Up to now, immunization of disease propagation has attracted great attention in both theoretical and experimental researches. However, vast majority of existing achievements are limited to the simple assumption of single layer networked population, which seems obviously inconsistent with recent development of complex network theory: each node could possess multiple roles in different topology connections. Inspired by this fact, we here propose the immunization strategies on multiplex networks, including multiplex node-based random (targeted) immunization and layer node-based random (targeted) immunization. With the theory of generating function, theoretical analysis is developed to calculate the immunization threshold, which is regarded as the most critical index for the effectiveness of addressed immunization strategies. Interestingly, both types of random immunization strategies show more efficiency in controlling disease spreading on multiplex Erdös-Rényi (ER) random networks; while targeted immunization strategies provide better protection on multiplex scale-free (SF) networks.

A graph-theory framework for evaluating landscape connectivity and conservation planning.

PubMed

Minor, Emily S; Urban, Dean L

2008-04-01

Connectivity of habitat patches is thought to be important for movement of genes, individuals, populations, and species over multiple temporal and spatial scales. We used graph theory to characterize multiple aspects of landscape connectivity in a habitat network in the North Carolina Piedmont (U.S.A). We compared this landscape with simulated networks with known topology, resistance to disturbance, and rate of movement. We introduced graph measures such as compartmentalization and clustering, which can be used to identify locations on the landscape that may be especially resilient to human development or areas that may be most suitable for conservation. Our analyses indicated that for songbirds the Piedmont habitat network was well connected. Furthermore, the habitat network had commonalities with planar networks, which exhibit slow movement, and scale-free networks, which are resistant to random disturbances. These results suggest that connectivity in the habitat network was high enough to prevent the negative consequences of isolation but not so high as to allow rapid spread of disease. Our graph-theory framework provided insight into regional and emergent global network properties in an intuitive and visual way and allowed us to make inferences about rates and paths of species movements and vulnerability to disturbance. This approach can be applied easily to assessing habitat connectivity in any fragmented or patchy landscape.

Analytical connection between thresholds and immunization strategies of SIS model in random networks

NASA Astrophysics Data System (ADS)

Zhou, Ming-Yang; Xiong, Wen-Man; Liao, Hao; Wang, Tong; Wei, Zong-Wen; Fu, Zhong-Qian

2018-05-01

Devising effective strategies for hindering the propagation of viruses and protecting the population against epidemics is critical for public security and health. Despite a number of studies based on the susceptible-infected-susceptible (SIS) model devoted to this topic, we still lack a general framework to compare different immunization strategies in completely random networks. Here, we address this problem by suggesting a novel method based on heterogeneous mean-field theory for the SIS model. Our method builds the relationship between the thresholds and different immunization strategies in completely random networks. Besides, we provide an analytical argument that the targeted large-degree strategy achieves the best performance in random networks with arbitrary degree distribution. Moreover, the experimental results demonstrate the effectiveness of the proposed method in both artificial and real-world networks.

Emergence of self-sustained oscillations in excitable Erdös-Rényi random networks.

PubMed

Qian, Yu

2014-09-01

We investigate the emergence of self-sustained oscillations in excitable Erdös-Rényi random networks (EERRNs). Interestingly, periodical self-sustained oscillations have been found at a moderate connection probability P. For smaller or larger P, the system evolves into a homogeneous rest state with distinct mechanisms. One-dimensional Winfree loops are discovered as the sources to maintain the oscillations. Moreover, by analyzing these oscillation sources, we propose two criteria to explain the spatiotemporal dynamics obtained in EERRNs. Finally, the two critical connection probabilities for which self-sustained oscillations can emerge are approximately predicted based on these two criteria.

Network discovery with DCM

PubMed Central

Friston, Karl J.; Li, Baojuan; Daunizeau, Jean; Stephan, Klaas E.

2011-01-01

This paper is about inferring or discovering the functional architecture of distributed systems using Dynamic Causal Modelling (DCM). We describe a scheme that recovers the (dynamic) Bayesian dependency graph (connections in a network) using observed network activity. This network discovery uses Bayesian model selection to identify the sparsity structure (absence of edges or connections) in a graph that best explains observed time-series. The implicit adjacency matrix specifies the form of the network (e.g., cyclic or acyclic) and its graph-theoretical attributes (e.g., degree distribution). The scheme is illustrated using functional magnetic resonance imaging (fMRI) time series to discover functional brain networks. Crucially, it can be applied to experimentally evoked responses (activation studies) or endogenous activity in task-free (resting state) fMRI studies. Unlike conventional approaches to network discovery, DCM permits the analysis of directed and cyclic graphs. Furthermore, it eschews (implausible) Markovian assumptions about the serial independence of random fluctuations. The scheme furnishes a network description of distributed activity in the brain that is optimal in the sense of having the greatest conditional probability, relative to other networks. The networks are characterised in terms of their connectivity or adjacency matrices and conditional distributions over the directed (and reciprocal) effective connectivity between connected nodes or regions. We envisage that this approach will provide a useful complement to current analyses of functional connectivity for both activation and resting-state studies. PMID:21182971

Brain Network Analysis from High-Resolution EEG Signals

NASA Astrophysics Data System (ADS)

de Vico Fallani, Fabrizio; Babiloni, Fabio

Over the last decade, there has been a growing interest in the detection of the functional connectivity in the brain from different neuroelectromagnetic and hemodynamic signals recorded by several neuro-imaging devices such as the functional Magnetic Resonance Imaging (fMRI) scanner, electroencephalography (EEG) and magnetoencephalography (MEG) apparatus. Many methods have been proposed and discussed in the literature with the aim of estimating the functional relationships among different cerebral structures. However, the necessity of an objective comprehension of the network composed by the functional links of different brain regions is assuming an essential role in the Neuroscience. Consequently, there is a wide interest in the development and validation of mathematical tools that are appropriate to spot significant features that could describe concisely the structure of the estimated cerebral networks. The extraction of salient characteristics from brain connectivity patterns is an open challenging topic, since often the estimated cerebral networks have a relative large size and complex structure. Recently, it was realized that the functional connectivity networks estimated from actual brain-imaging technologies (MEG, fMRI and EEG) can be analyzed by means of the graph theory. Since a graph is a mathematical representation of a network, which is essentially reduced to nodes and connections between them, the use of a theoretical graph approach seems relevant and useful as firstly demonstrated on a set of anatomical brain networks. In those studies, the authors have employed two characteristic measures, the average shortest path L and the clustering index C, to extract respectively the global and local properties of the network structure. They have found that anatomical brain networks exhibit many local connections (i.e. a high C) and few random long distance connections (i.e. a low L). These values identify a particular model that interpolate between a regular lattice and a random structure. Such a model has been designated as "small-world" network in analogy with the concept of the small-world phenomenon observed more than 30 years ago in social systems. In a similar way, many types of functional brain networks have been analyzed according to this mathematical approach. In particular, several studies based on different imaging techniques (fMRI, MEG and EEG) have found that the estimated functional networks showed small-world characteristics. In the functional brain connectivity context, these properties have been demonstrated to reflect an optimal architecture for the information processing and propagation among the involved cerebral structures. However, the performance of cognitive and motor tasks as well as the presence of neural diseases has been demonstrated to affect such a small-world topology, as revealed by the significant changes of L and C. Moreover, some functional brain networks have been mostly found to be very unlike the random graphs in their degree-distribution, which gives information about the allocation of the functional links within the connectivity pattern. It was demonstrated that the degree distributions of these networks follow a power-law trend. For this reason those networks are called "scale-free". They still exhibit the small-world phenomenon but tend to contain few nodes that act as highly connected "hubs". Scale-free networks are known to show resistance to failure, facility of synchronization and fast signal processing. Hence, it would be important to see whether the scaling properties of the functional brain networks are altered under various pathologies or experimental tasks. The present Chapter proposes a theoretical graph approach in order to evaluate the functional connectivity patterns obtained from high-resolution EEG signals. In this way, the "Brain Network Analysis" (in analogy with the Social Network Analysis that has emerged as a key technique in modern sociology) represents an effective methodology improving the comprehension of the complex interactions in the brain.

Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science.

PubMed

Mocanu, Decebal Constantin; Mocanu, Elena; Stone, Peter; Nguyen, Phuong H; Gibescu, Madeleine; Liotta, Antonio

2018-06-19

Through the success of deep learning in various domains, artificial neural networks are currently among the most used artificial intelligence methods. Taking inspiration from the network properties of biological neural networks (e.g. sparsity, scale-freeness), we argue that (contrary to general practice) artificial neural networks, too, should not have fully-connected layers. Here we propose sparse evolutionary training of artificial neural networks, an algorithm which evolves an initial sparse topology (Erdős-Rényi random graph) of two consecutive layers of neurons into a scale-free topology, during learning. Our method replaces artificial neural networks fully-connected layers with sparse ones before training, reducing quadratically the number of parameters, with no decrease in accuracy. We demonstrate our claims on restricted Boltzmann machines, multi-layer perceptrons, and convolutional neural networks for unsupervised and supervised learning on 15 datasets. Our approach has the potential to enable artificial neural networks to scale up beyond what is currently possible.

Mass media influence spreading in social networks with community structure

NASA Astrophysics Data System (ADS)

Candia, Julián; Mazzitello, Karina I.

2008-07-01

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

Atomoxetine Treatment Strengthens an Anti-Correlated Relationship between Functional Brain Networks in Medication-Naïve Adults with Attention-Deficit Hyperactivity Disorder: A Randomized Double-Blind Placebo-Controlled Clinical Trial

PubMed Central

Lin, Hsiang-Yuan

2016-01-01

Background: Although atomoxetine demonstrates efficacy in individuals with attention-deficit hyperactivity disorder, its treatment effects on brain resting-state functional connectivity remain unknown. Therefore, we aimed to investigate major brain functional networks in medication-naïve adults with attention-deficit hyperactivity disorder and the efficacy of atomoxetine treatment on resting-state functional connectivity. Methods: After collecting baseline resting-state functional MRI scans from 24 adults with attention-deficit hyperactivity disorder (aged 18–52 years) and 24 healthy controls (matched in demographic characteristics), the participants with attention-deficit hyperactivity disorder were randomly assigned to atomoxetine (n=12) and placebo (n=12) arms in an 8-week, double-blind, placebo-controlled trial. The primary outcome was functional connectivity assessed by a resting-state functional MRI. Seed-based functional connectivity was calculated and compared for the affective, attention, default, and cognitive control networks. Results: At baseline, we found atypical cross talk between the default, cognitive control, and dorsal attention networks and hypoconnectivity within the dorsal attention and default networks in adults with attention-deficit hyperactivity disorder. Our first-ever placebo-controlled clinical trial incorporating resting-state functional MRI showed that treatment with atomoxetine strengthened an anticorrelated relationship between the default and task-positive networks and modulated all major brain networks. The strengthened anticorrelations were associated with improving clinical symptoms in the atomoxetine-treated adults. Conclusions: Our results support the idea that atypical default mode network task-positive network interaction plays an important role in the pathophysiology of adult attention-deficit hyperactivity disorder. Strengthening this atypical relationship following atomoxetine treatment suggests an important pathway to treat attention-deficit hyperactivity disorder. PMID:26377368

Atomoxetine Treatment Strengthens an Anti-Correlated Relationship between Functional Brain Networks in Medication-Naïve Adults with Attention-Deficit Hyperactivity Disorder: A Randomized Double-Blind Placebo-Controlled Clinical Trial.

PubMed

Lin, Hsiang-Yuan; Gau, Susan Shur-Fen

2015-09-16

Although atomoxetine demonstrates efficacy in individuals with attention-deficit hyperactivity disorder, its treatment effects on brain resting-state functional connectivity remain unknown. Therefore, we aimed to investigate major brain functional networks in medication-naïve adults with attention-deficit hyperactivity disorder and the efficacy of atomoxetine treatment on resting-state functional connectivity. After collecting baseline resting-state functional MRI scans from 24 adults with attention-deficit hyperactivity disorder (aged 18-52 years) and 24 healthy controls (matched in demographic characteristics), the participants with attention-deficit hyperactivity disorder were randomly assigned to atomoxetine (n=12) and placebo (n=12) arms in an 8-week, double-blind, placebo-controlled trial. The primary outcome was functional connectivity assessed by a resting-state functional MRI. Seed-based functional connectivity was calculated and compared for the affective, attention, default, and cognitive control networks. At baseline, we found atypical cross talk between the default, cognitive control, and dorsal attention networks and hypoconnectivity within the dorsal attention and default networks in adults with attention-deficit hyperactivity disorder. Our first-ever placebo-controlled clinical trial incorporating resting-state functional MRI showed that treatment with atomoxetine strengthened an anticorrelated relationship between the default and task-positive networks and modulated all major brain networks. The strengthened anticorrelations were associated with improving clinical symptoms in the atomoxetine-treated adults. Our results support the idea that atypical default mode network task-positive network interaction plays an important role in the pathophysiology of adult attention-deficit hyperactivity disorder. Strengthening this atypical relationship following atomoxetine treatment suggests an important pathway to treat attention-deficit hyperactivity disorder. © The Author 2015. Published by Oxford University Press on behalf of CINP.

Structure of a randomly grown 2-d network.

PubMed

Ajazi, Fioralba; Napolitano, George M; Turova, Tatyana; Zaurbek, Izbassar

2015-10-01

We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes in time different phases of the structure. We conclude with a possible explanation of some empirical data on the connections between neurons. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Effects of topology on network evolution

NASA Astrophysics Data System (ADS)

Oikonomou, Panos; Cluzel, Philippe

2006-08-01

The ubiquity of scale-free topology in nature raises the question of whether this particular network design confers an evolutionary advantage. A series of studies has identified key principles controlling the growth and the dynamics of scale-free networks. Here, we use neuron-based networks of boolean components as a framework for modelling a large class of dynamical behaviours in both natural and artificial systems. Applying a training algorithm, we characterize how networks with distinct topologies evolve towards a pre-established target function through a process of random mutations and selection. We find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. Whereas homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously. Remarkably, this latter property is robust to variations of the degree exponent. In contrast, homogeneous random networks require a specific tuning of their connectivity to optimize their ability to evolve. These results highlight an organizing principle that governs the evolution of complex networks and that can improve the design of engineered systems.

Mindfulness Meditation Training and Executive Control Network Resting State Functional Connectivity: A Randomized Controlled Trial.

PubMed

Taren, Adrienne A; Gianaros, Peter J; Greco, Carol M; Lindsay, Emily K; Fairgrieve, April; Brown, Kirk Warren; Rosen, Rhonda K; Ferris, Jennifer L; Julson, Erica; Marsland, Anna L; Creswell, J David

Mindfulness meditation training has been previously shown to enhance behavioral measures of executive control (e.g., attention, working memory, cognitive control), but the neural mechanisms underlying these improvements are largely unknown. Here, we test whether mindfulness training interventions foster executive control by strengthening functional connections between dorsolateral prefrontal cortex (dlPFC)-a hub of the executive control network-and frontoparietal regions that coordinate executive function. Thirty-five adults with elevated levels of psychological distress participated in a 3-day randomized controlled trial of intensive mindfulness meditation or relaxation training. Participants completed a resting state functional magnetic resonance imaging scan before and after the intervention. We tested whether mindfulness meditation training increased resting state functional connectivity (rsFC) between dlPFC and frontoparietal control network regions. Left dlPFC showed increased connectivity to the right inferior frontal gyrus (T = 3.74), right middle frontal gyrus (MFG) (T = 3.98), right supplementary eye field (T = 4.29), right parietal cortex (T = 4.44), and left middle temporal gyrus (T = 3.97, all p < .05) after mindfulness training relative to the relaxation control. Right dlPFC showed increased connectivity to right MFG (T = 4.97, p < .05). We report that mindfulness training increases rsFC between dlPFC and dorsal network (superior parietal lobule, supplementary eye field, MFG) and ventral network (right IFG, middle temporal/angular gyrus) regions. These findings extend previous work showing increased functional connectivity among brain regions associated with executive function during active meditation by identifying specific neural circuits in which rsFC is enhanced by a mindfulness intervention in individuals with high levels of psychological distress. Clinicaltrials.gov,NCT01628809.

Dynamic model of time-dependent complex networks.

PubMed

Hill, Scott A; Braha, Dan

2010-10-01

The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness against failures, vulnerability to deliberate attacks, and diffusion properties. However, recent empirical research of large dynamic networks (characterized by irregular connections that evolve rapidly) has demonstrated that there is little continuity in degree centrality of nodes over time, even when their degree distributions follow a power law. This unexpected dynamic centrality suggests that the connections in these systems are not driven by preferential attachment or other known mechanisms. We present an approach to explain real-world dynamic networks and qualitatively reproduce these dynamic centrality phenomena. This approach is based on a dynamic preferential attachment mechanism, which exhibits a sharp transition from a base pure random walk scheme.

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.

Schaffer Collateral Inputs to CA1 Excitatory and Inhibitory Neurons Follow Different Connectivity Rules.

PubMed

Kwon, Osung; Feng, Linqing; Druckmann, Shaul; Kim, Jinhyun

2018-05-30

Neural circuits, governed by a complex interplay between excitatory and inhibitory neurons, are the substrate for information processing, and the organization of synaptic connectivity in neural network is an important determinant of circuit function. Here, we analyzed the fine structure of connectivity in hippocampal CA1 excitatory and inhibitory neurons innervated by Schaffer collaterals (SCs) using mGRASP in male mice. Our previous study revealed spatially structured synaptic connectivity between CA3 and CA1 pyramidal cells (PCs). Surprisingly, parvalbumin-positive interneurons (PVs) showed a significantly more random pattern spatial structure. Notably, application of Peters' rule for synapse prediction by random overlap between axons and dendrites enhanced structured connectivity in PCs, but, by contrast, made the connectivity pattern in PVs more random. In addition, PCs in a deep sublayer of striatum pyramidale appeared more highly structured than PCs in superficial layers, and little or no sublayer specificity was found in PVs. Our results show that CA1 excitatory PCs and inhibitory PVs innervated by the same SC inputs follow different connectivity rules. The different organizations of fine scale structured connectivity in hippocampal excitatory and inhibitory neurons provide important insights into the development and functions of neural networks. SIGNIFICANCE STATEMENT Understanding how neural circuits generate behavior is one of the central goals of neuroscience. An important component of this endeavor is the mapping of fine-scale connection patterns that underlie, and help us infer, signal processing in the brain. Here, using our recently developed synapse detection technology (mGRASP and neuTube), we provide detailed profiles of synaptic connectivity in excitatory (CA1 pyramidal) and inhibitory (CA1 parvalbumin-positive) neurons innervated by the same presynaptic inputs (CA3 Schaffer collaterals). Our results reveal that these two types of CA1 neurons follow different connectivity patterns. Our new evidence for differently structured connectivity at a fine scale in hippocampal excitatory and inhibitory neurons provides a better understanding of hippocampal networks and will guide theoretical and experimental studies. Copyright © 2018 the authors 0270-6474/18/385140-13$15.00/0.

The positive effects of Xueshuan Xinmai tablets on brain functional connectivity in acute ischemic stroke: a placebo controlled randomized trial.

PubMed

Wei, Dongfeng; Xie, Daojun; Li, He; Chen, Yaojing; Qi, Di; Wang, Yujiao; Zhang, Yangjun; Chen, Kewei; Li, Chuanfu; Zhang, Zhanjun

2017-11-10

Through a placebo controlled randomized study, the purpose of this report was to investigate the effects of Xueshuan Xinmai tablets (XXMT) on neurologic deficits, quality of life and brain functional connectivity in acute ischemic stroke patients and to explore the mechanism of action of XXMT. In total, 44 acute ischemic stroke patients were randomly divided to the XXMT treatment group (n = 22) or the placebo group (n = 22) in a 2-week trial. Before and after the treatment, the neurological assessment and functional magnetic resonance imaging examinations were carried out. Compared to the placebo group, the scores of the National Institutes of Health Stroke Scale (NIHSS) and Stroke-Specific Quality of Life Scale (SSQOL) significantly improved in the treatment group. In addition, XXMT-treated patients demonstrated significantly enhanced functional connectivity within the default mode, frontal-parietal, and motor control networks. Furthermore, the changed connectivity in the left precuneus was positively correlated to the improvement of NIHSS and SSQOL scores. The present study indicated that XXMT treatment significantly improved the neurologic deficit and quality of life of acute ischemic stroke patients and that the therapeutic effect may be based on the modulation of XXMT on the functional connectivity of brain networks.

Sequentially switching cell assemblies in random inhibitory networks of spiking neurons in the striatum.

PubMed

Ponzi, Adam; Wickens, Jeff

2010-04-28

The striatum is composed of GABAergic medium spiny neurons with inhibitory collaterals forming a sparse random asymmetric network and receiving an excitatory glutamatergic cortical projection. Because the inhibitory collaterals are sparse and weak, their role in striatal network dynamics is puzzling. However, here we show by simulation of a striatal inhibitory network model composed of spiking neurons that cells form assemblies that fire in sequential coherent episodes and display complex identity-temporal spiking patterns even when cortical excitation is simply constant or fluctuating noisily. Strongly correlated large-scale firing rate fluctuations on slow behaviorally relevant timescales of hundreds of milliseconds are shown by members of the same assembly whereas members of different assemblies show strong negative correlation, and we show how randomly connected spiking networks can generate this activity. Cells display highly irregular spiking with high coefficients of variation, broadly distributed low firing rates, and interspike interval distributions that are consistent with exponentially tailed power laws. Although firing rates vary coherently on slow timescales, precise spiking synchronization is absent in general. Our model only requires the minimal but striatally realistic assumptions of sparse to intermediate random connectivity, weak inhibitory synapses, and sufficient cortical excitation so that some cells are depolarized above the firing threshold during up states. Our results are in good qualitative agreement with experimental studies, consistent with recently determined striatal anatomy and physiology, and support a new view of endogenously generated metastable state switching dynamics of the striatal network underlying its information processing operations.

Relaxation dynamics of maximally clustered networks

NASA Astrophysics Data System (ADS)

Klaise, Janis; Johnson, Samuel

2018-01-01

We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics—the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erdős-Rényi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erdős-Rényi phenomenology.

Phase synchronization of bursting neurons in clustered small-world networks

NASA Astrophysics Data System (ADS)

Batista, C. A. S.; Lameu, E. L.; Batista, A. M.; Lopes, S. R.; Pereira, T.; Zamora-López, G.; Kurths, J.; Viana, R. L.

2012-07-01

We investigate the collective dynamics of bursting neurons on clustered networks. The clustered network model is composed of subnetworks, each of them presenting the so-called small-world property. This model can also be regarded as a network of networks. In each subnetwork a neuron is connected to other ones with regular as well as random connections, the latter with a given intracluster probability. Moreover, in a given subnetwork each neuron has an intercluster probability to be connected to the other subnetworks. The local neuron dynamics has two time scales (fast and slow) and is modeled by a two-dimensional map. In such small-world network the neuron parameters are chosen to be slightly different such that, if the coupling strength is large enough, there may be synchronization of the bursting (slow) activity. We give bounds for the critical coupling strength to obtain global burst synchronization in terms of the network structure, that is, the probabilities of intracluster and intercluster connections. We find that, as the heterogeneity in the network is reduced, the network global synchronizability is improved. We show that the transitions to global synchrony may be abrupt or smooth depending on the intercluster probability.

Weighted Scaling in Non-growth Random Networks

NASA Astrophysics Data System (ADS)

Chen, Guang; Yang, Xu-Hua; Xu, Xin-Li

2012-09-01

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

Criticality in finite dynamical networks

NASA Astrophysics Data System (ADS)

Rohlf, Thimo; Gulbahce, Natali; Teuscher, Christof

2007-03-01

It has been shown analytically and experimentally that both random boolean and random threshold networks show a transition from ordered to chaotic dynamics at a critical average connectivity Kc in the thermodynamical limit [1]. By looking at the statistical distributions of damage spreading (damage sizes), we go beyond this extensively studied mean-field approximation. We study the scaling properties of damage size distributions as a function of system size N and initial perturbation size d(t=0). We present numerical evidence that another characteristic point, Kd exists for finite system sizes, where the expectation value of damage spreading in the network is independent of the system size N. Further, the probability to obtain critical networks is investigated for a given system size and average connectivity k. Our results suggest that, for finite size dynamical networks, phase space structure is very complex and may not exhibit a sharp order-disorder transition. Finally, we discuss the implications of our findings for evolutionary processes and learning applied to networks which solve specific computational tasks. [1] Derrida, B. and Pomeau, Y. (1986), Europhys. Lett., 1, 45-49

Synchronization invariance under network structural transformations

NASA Astrophysics Data System (ADS)

Arola-Fernández, Lluís; Díaz-Guilera, Albert; Arenas, Alex

2018-06-01

Synchronization processes are ubiquitous despite the many connectivity patterns that complex systems can show. Usually, the emergence of synchrony is a macroscopic observable; however, the microscopic details of the system, as, e.g., the underlying network of interactions, is many times partially or totally unknown. We already know that different interaction structures can give rise to a common functionality, understood as a common macroscopic observable. Building upon this fact, here we propose network transformations that keep the collective behavior of a large system of Kuramoto oscillators invariant. We derive a method based on information theory principles, that allows us to adjust the weights of the structural interactions to map random homogeneous in-degree networks into random heterogeneous networks and vice versa, keeping synchronization values invariant. The results of the proposed transformations reveal an interesting principle; heterogeneous networks can be mapped to homogeneous ones with local information, but the reverse process needs to exploit higher-order information. The formalism provides analytical insight to tackle real complex scenarios when dealing with uncertainty in the measurements of the underlying connectivity structure.

Multidimensional density shaping by sigmoids.

PubMed

Roth, Z; Baram, Y

1996-01-01

An estimate of the probability density function of a random vector is obtained by maximizing the output entropy of a feedforward network of sigmoidal units with respect to the input weights. Classification problems can be solved by selecting the class associated with the maximal estimated density. Newton's optimization method, applied to the estimated density, yields a recursive estimator for a random variable or a random sequence. A constrained connectivity structure yields a linear estimator, which is particularly suitable for "real time" prediction. A Gaussian nonlinearity yields a closed-form solution for the network's parameters, which may also be used for initializing the optimization algorithm when other nonlinearities are employed. A triangular connectivity between the neurons and the input, which is naturally suggested by the statistical setting, reduces the number of parameters. Applications to classification and forecasting problems are demonstrated.

The effects of neuron morphology on graph theoretic measures of network connectivity: the analysis of a two-level statistical model.

PubMed

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

2015-01-01

We developed a two-level statistical model that addresses the question of how properties of neurite morphology shape the large-scale network connectivity. We adopted a low-dimensional statistical description of neurites. From the neurite model description we derived the expected number of synapses, node degree, and the effective radius, the maximal distance between two neurons expected to form at least one synapse. We related these quantities to the network connectivity described using standard measures from graph theory, such as motif counts, clustering coefficient, minimal path length, and small-world coefficient. These measures are used in a neuroscience context to study phenomena from synaptic connectivity in the small neuronal networks to large scale functional connectivity in the cortex. For these measures we provide analytical solutions that clearly relate different model properties. Neurites that sparsely cover space lead to a small effective radius. If the effective radius is small compared to the overall neuron size the obtained networks share similarities with the uniform random networks as each neuron connects to a small number of distant neurons. Large neurites with densely packed branches lead to a large effective radius. If this effective radius is large compared to the neuron size, the obtained networks have many local connections. In between these extremes, the networks maximize the variability of connection repertoires. The presented approach connects the properties of neuron morphology with large scale network properties without requiring heavy simulations with many model parameters. The two-steps procedure provides an easier interpretation of the role of each modeled parameter. The model is flexible and each of its components can be further expanded. We identified a range of model parameters that maximizes variability in network connectivity, the property that might affect network capacity to exhibit different dynamical regimes.

Efficient randomization of biological networks while preserving functional characterization of individual nodes.

PubMed

Iorio, Francesco; Bernardo-Faura, Marti; Gobbi, Andrea; Cokelaer, Thomas; Jurman, Giuseppe; Saez-Rodriguez, Julio

2016-12-20

Networks are popular and powerful tools to describe and model biological processes. Many computational methods have been developed to infer biological networks from literature, high-throughput experiments, and combinations of both. Additionally, a wide range of tools has been developed to map experimental data onto reference biological networks, in order to extract meaningful modules. Many of these methods assess results' significance against null distributions of randomized networks. However, these standard unconstrained randomizations do not preserve the functional characterization of the nodes in the reference networks (i.e. their degrees and connection signs), hence including potential biases in the assessment. Building on our previous work about rewiring bipartite networks, we propose a method for rewiring any type of unweighted networks. In particular we formally demonstrate that the problem of rewiring a signed and directed network preserving its functional connectivity (F-rewiring) reduces to the problem of rewiring two induced bipartite networks. Additionally, we reformulate the lower bound to the iterations' number of the switching-algorithm to make it suitable for the F-rewiring of networks of any size. Finally, we present BiRewire3, an open-source Bioconductor package enabling the F-rewiring of any type of unweighted network. We illustrate its application to a case study about the identification of modules from gene expression data mapped on protein interaction networks, and a second one focused on building logic models from more complex signed-directed reference signaling networks and phosphoproteomic data. BiRewire3 it is freely available at https://www.bioconductor.org/packages/BiRewire/ , and it should have a broad application as it allows an efficient and analytically derived statistical assessment of results from any network biology tool.

Coherent periodic activity in excitatory Erdös-Renyi neural networks: the role of network connectivity.

PubMed

Tattini, Lorenzo; Olmi, Simona; Torcini, Alessandro

2012-06-01

In this article, we investigate the role of connectivity in promoting coherent activity in excitatory neural networks. In particular, we would like to understand if the onset of collective oscillations can be related to a minimal average connectivity and how this critical connectivity depends on the number of neurons in the networks. For these purposes, we consider an excitatory random network of leaky integrate-and-fire pulse coupled neurons. The neurons are connected as in a directed Erdös-Renyi graph with average connectivity scaling as a power law with the number of neurons in the network. The scaling is controlled by a parameter γ, which allows to pass from massively connected to sparse networks and therefore to modify the topology of the system. At a macroscopic level, we observe two distinct dynamical phases: an asynchronous state corresponding to a desynchronized dynamics of the neurons and a regime of partial synchronization (PS) associated with a coherent periodic activity of the network. At low connectivity, the system is in an asynchronous state, while PS emerges above a certain critical average connectivity (c). For sufficiently large networks, (c) saturates to a constant value suggesting that a minimal average connectivity is sufficient to observe coherent activity in systems of any size irrespectively of the kind of considered network: sparse or massively connected. However, this value depends on the nature of the synapses: reliable or unreliable. For unreliable synapses, the critical value required to observe the onset of macroscopic behaviors is noticeably smaller than for reliable synaptic transmission. Due to the disorder present in the system, for finite number of neurons we have inhomogeneities in the neuronal behaviors, inducing a weak form of chaos, which vanishes in the thermodynamic limit. In such a limit, the disordered systems exhibit regular (non chaotic) dynamics and their properties correspond to that of a homogeneous fully connected network for any γ-value. Apart for the peculiar exception of sparse networks, which remain intrinsically inhomogeneous at any system size.

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.

Application of stochastic processes in random growth and evolutionary dynamics

NASA Astrophysics Data System (ADS)

Oikonomou, Panagiotis

We study the effect of power-law distributed randomness on the dynamical behavior of processes such as stochastic growth patterns and evolution. First, we examine the geometrical properties of random shapes produced by a generalized stochastic Loewner Evolution driven by a superposition of a Brownian motion and a stable Levy process. The situation is defined by the usual stochastic Loewner Evolution parameter, kappa, as well as alpha which defines the power-law tail of the stable Levy distribution. We show that the properties of these patterns change qualitatively and singularly at critical values of kappa and alpha. It is reasonable to call such changes "phase transitions". These transitions occur as kappa passes through four and as alpha passes through one. Numerical simulations are used to explore the global scaling behavior of these patterns in each "phase". We show both analytically and numerically that the growth continues indefinitely in the vertical direction for alpha greater than 1, goes as logarithmically with time for alpha equals to 1, and saturates for alpha smaller than 1. The probability density has two different scales corresponding to directions along and perpendicular to the boundary. Scaling functions for the probability density are given for various limiting cases. Second, we study the effect of the architecture of biological networks on their evolutionary dynamics. In recent years, studies of the architecture of large networks have unveiled a common topology, called scale-free, in which a majority of the elements are poorly connected except for a small fraction of highly connected components. We ask how networks with distinct topologies can evolve towards a pre-established target phenotype through a process of random mutations and selection. We use networks of Boolean components as a framework to model a large class of phenotypes. Within this approach, we find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. While homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously towards the target phenotype. Moreover, we show that scale-free networks always evolve faster than homogeneous random networks; remarkably, this property does not depend on the precise value of the topological parameter. By contrast, homogeneous random networks require a specific tuning of their topological parameter in order to optimize their fitness. This model suggests that the evolutionary paths of biological networks, punctuated or continuous, may solely be determined by the network topology.

Analysis of random drop for gateway congestion control. M.S. Thesis

NASA Technical Reports Server (NTRS)

Hashem, Emam Salaheddin

1989-01-01

Lately, the growing demand on the Internet has prompted the need for more effective congestion control policies. Currently No Gateway Policy is used to relieve and signal congestion, which leads to unfair service to the individual users and a degradation of overall network performance. Network simulation was used to illustrate the character of Internet congestion and its causes. A newly proposed gateway congestion control policy, called Random Drop, was considered as a promising solution to the pressing problem. Random Drop relieves resource congestion upon buffer overflow by choosing a random packet from the service queue to be dropped. The random choice should result in a drop distribution proportional to the bandwidth distribution among all contending TCP connections, thus applying the necessary fairness. Nonetheless, the simulation experiments demonstrate several shortcomings with this policy. Because Random Drop is a congestion control policy, which is not applied until congestion has already occurred, it usually results in a high drop rate that hurts too many connections including well-behaved ones. Even though the number of packets dropped is different from one connection to another depending on the buffer utilization upon overflow, the TCP recovery overhead is high enough to neutralize these differences, causing unfair congestion penalties. Besides, the drop distribution itself is an inaccurate representation of the average bandwidth distribution, missing much important information about the bandwidth utilization between buffer overflow events. A modification of Random Drop to do congestion avoidance by applying the policy early was also proposed. Early Random Drop has the advantage of avoiding the high drop rate of buffer overflow. The early application of the policy removes the pressure of congestion relief and allows more accurate signaling of congestion. To be used effectively, algorithms for the dynamic adjustment of the parameters of Early Random Drop to suite the current network load must still be developed.

The 'wired' universe of organic chemistry.

PubMed

Grzybowski, Bartosz A; Bishop, Kyle J M; Kowalczyk, Bartlomiej; Wilmer, Christopher E

2009-04-01

The millions of reactions performed and compounds synthesized by organic chemists over the past two centuries connect to form a network larger than the metabolic networks of higher organisms and rivalling the complexity of the World Wide Web. Despite its apparent randomness, the network of chemistry has a well-defined, modular architecture. The network evolves in time according to trends that have not changed since the inception of the discipline, and thus project into chemistry's future. Analysis of organic chemistry using the tools of network theory enables the identification of most 'central' organic molecules, and for the prediction of which and how many molecules will be made in the future. Statistical analyses based on network connectivity are useful in optimizing parallel syntheses, in estimating chemical reactivity, and more.

How plants connect pollination and herbivory networks and their contribution to community stability.

PubMed

Sauve, Alix M C; Thébault, Elisa; Pocock, Michael J O; Fontaine, Colin

2016-04-01

Pollination and herbivory networks have mainly been studied separately, highlighting their distinct structural characteristics and the related processes and dynamics. However, most plants interact with both pollinators and herbivores, and there is evidence that both types of interaction affect each other. Here we investigated the way plants connect these mutualistic and antagonistic networks together, and the consequences for community stability. Using an empirical data set, we show that the way plants connect pollination and herbivory networks is not random and promotes community stability. Analyses of the structure of binary and quantitative networks show different results: the plants' generalism with regard to pollinators is positively correlated to their generalism with regard to herbivores when considering binary interactions, but not when considering quantitative interactions. We also show that plants that share the same pollinators do not share the same herbivores. However, the way plants connect pollination and herbivory networks promotes stability for both binary and quantitative networks. Our results highlight the relevance of considering the diversity of interaction types in ecological communities, and stress the need to better quantify the costs and benefits of interactions, as well as to develop new metrics characterizing the way different interaction types are combined within ecological networks.

Compensatory Motor Network Connectivity is Associated with Motor Sequence Learning after Subcortical Stroke

PubMed Central

Wadden, Katie P.; Woodward, Todd S.; Metzak, Paul D.; Lavigne, Katie M.; Lakhani, Bimal; Auriat, Angela M.; Boyd, Lara A.

2015-01-01

Following stroke, functional networks reorganize and the brain demonstrates widespread alterations in cortical activity. Implicit motor learning is preserved after stroke. However the manner in which brain reorganization occurs, and how it supports behaviour within the damaged brain remains unclear. In this functional magnetic resonance imaging (fMRI) study, we evaluated whole brain patterns of functional connectivity during the performance of an implicit tracking task at baseline and retention, following 5 days of practice. Following motor practice, a significant difference in connectivity within a motor network, consisting of bihemispheric activation of the sensory and motor cortices, parietal lobules, cerebellar and occipital lobules, was observed at retention. Healthy subjects demonstrated greater activity within this motor network during sequence learning compared to random practice. The stroke group did not show the same level of functional network integration, presumably due to the heterogeneity of functional reorganization following stroke. In a secondary analysis, a binary mask of the functional network activated from the aforementioned whole brain analyses was created to assess within-network connectivity, decreasing the spatial distribution and large variability of activation that exists within the lesioned brain. The stroke group demonstrated reduced clusters of connectivity within the masked brain regions as compared to the whole brain approach. Connectivity within this smaller motor network correlated with repeated sequence performance on the retention test. Increased functional integration within the motor network may be an important neurophysiological predictor of motor learning-related change in individuals with stroke. PMID:25757996

Will electrical cyber-physical interdependent networks undergo first-order transition under random attacks?

NASA Astrophysics Data System (ADS)

Ji, Xingpei; Wang, Bo; Liu, Dichen; Dong, Zhaoyang; Chen, Guo; Zhu, Zhenshan; Zhu, Xuedong; Wang, Xunting

2016-10-01

Whether the realistic electrical cyber-physical interdependent networks will undergo first-order transition under random failures still remains a question. To reflect the reality of Chinese electrical cyber-physical system, the "partial one-to-one correspondence" interdependent networks model is proposed and the connectivity vulnerabilities of three realistic electrical cyber-physical interdependent networks are analyzed. The simulation results show that due to the service demands of power system the topologies of power grid and its cyber network are highly inter-similar which can effectively avoid the first-order transition. By comparing the vulnerability curves between electrical cyber-physical interdependent networks and its single-layer network, we find that complex network theory is still useful in the vulnerability analysis of electrical cyber-physical interdependent networks.

Disordered configurations of the Glauber model in two-dimensional networks

NASA Astrophysics Data System (ADS)

Bačić, Iva; Franović, Igor; Perc, Matjaž

2017-12-01

We analyze the ordering efficiency and the structure of disordered configurations for the zero-temperature Glauber model on Watts-Strogatz networks obtained by rewiring 2D regular square lattices. In the small-world regime, the dynamics fails to reach the ordered state in the thermodynamic limit. Due to the interplay of the perturbed regular topology and the energy neutral stochastic state transitions, the stationary state consists of two intertwined domains, manifested as multiclustered states on the original lattice. Moreover, for intermediate rewiring probabilities, one finds an additional source of disorder due to the low connectivity degree, which gives rise to small isolated droplets of spins. We also examine the ordering process in paradigmatic two-layer networks with heterogeneous rewiring probabilities. Comparing the cases of a multiplex network and the corresponding network with random inter-layer connectivity, we demonstrate that the character of the final state qualitatively depends on the type of inter-layer connections.

Project Connect Online: Randomized Trial of an Internet-Based Program to Chronicle the Cancer Experience and Facilitate Communication

PubMed Central

Stanton, Annette L.; Thompson, Elizabeth H.; Crespi, Catherine M.; Link, John S.; Waisman, James R.

2013-01-01

Purpose Evidence suggests that expressing emotions related to cancer and receiving interpersonal support can promote psychological and physical health in women diagnosed with breast cancer. However, adaptive expression of feelings and communication with one's social network can pose challenges for patients with cancer. We report on a randomized controlled trial of an intervention, Project Connect Online, for patients with breast cancer to create personal Web sites to chronicle their experience and communicate with their social network. Patients and Methods Women (N = 88) diagnosed with breast cancer (any stage, any interval since diagnosis) were randomly assigned to participate in a 3-hour workshop for hands-on creation of personal Web sites with a follow-up call to facilitate Web site use, or to a waiting-list control. Assessed before randomization and 6 months after the intervention, dependent variables included depressive symptoms, positive and negative mood, cancer-related intrusive thoughts, and perceived cancer-related benefits in life appreciation and strengthened relationships. Results Relative to control participants, women randomly assigned to Project Connect Online evidenced significant benefit 6 months later on depressive symptoms, positive mood, and life appreciation, but not negative mood, perceived strengthened relationships, or intrusive thoughts. Treatment status moderated the intervention effects, such that women currently undergoing medical treatment for cancer benefitted significantly more from the intervention on depressive symptoms and positive mood than did women not receiving treatment. Conclusion Findings suggest the promise of an intervention to facilitate the ability of women diagnosed with breast cancer to chronicle their experience and communicate with their social network via the Internet. PMID:23940228

Project connect online: randomized trial of an internet-based program to chronicle the cancer experience and facilitate communication.

PubMed

Stanton, Annette L; Thompson, Elizabeth H; Crespi, Catherine M; Link, John S; Waisman, James R

2013-09-20

Evidence suggests that expressing emotions related to cancer and receiving interpersonal support can promote psychological and physical health in women diagnosed with breast cancer. However, adaptive expression of feelings and communication with one's social network can pose challenges for patients with cancer. We report on a randomized controlled trial of an intervention, Project Connect Online, for patients with breast cancer to create personal Web sites to chronicle their experience and communicate with their social network. Women (N = 88) diagnosed with breast cancer (any stage, any interval since diagnosis) were randomly assigned to participate in a 3-hour workshop for hands-on creation of personal Web sites with a follow-up call to facilitate Web site use, or to a waiting-list control. Assessed before randomization and 6 months after the intervention, dependent variables included depressive symptoms, positive and negative mood, cancer-related intrusive thoughts, and perceived cancer-related benefits in life appreciation and strengthened relationships. Relative to control participants, women randomly assigned to Project Connect Online evidenced significant benefit 6 months later on depressive symptoms, positive mood, and life appreciation, but not negative mood, perceived strengthened relationships, or intrusive thoughts. Treatment status moderated the intervention effects, such that women currently undergoing medical treatment for cancer benefitted significantly more from the intervention on depressive symptoms and positive mood than did women not receiving treatment. Findings suggest the promise of an intervention to facilitate the ability of women diagnosed with breast cancer to chronicle their experience and communicate with their social network via the Internet.

How Fast Can Networks Synchronize? A Random Matrix Theory Approach

NASA Astrophysics Data System (ADS)

Timme, Marc; Wolf, Fred; Geisel, Theo

2004-03-01

Pulse-coupled oscillators constitute a paradigmatic class of dynamical systems interacting on networks because they model a variety of biological systems including flashing fireflies and chirping crickets as well as pacemaker cells of the heart and neural networks. Synchronization is one of the most simple and most prevailing kinds of collective dynamics on such networks. Here we study collective synchronization [1] of pulse-coupled oscillators interacting on asymmetric random networks. Using random matrix theory we analytically determine the speed of synchronization in such networks in dependence on the dynamical and network parameters [2]. The speed of synchronization increases with increasing coupling strengths. Surprisingly, however, it stays finite even for infinitely strong interactions. The results indicate that the speed of synchronization is limited by the connectivity of the network. We discuss the relevance of our findings to general equilibration processes on complex networks. [5mm] [1] M. Timme, F. Wolf, T. Geisel, Phys. Rev. Lett. 89:258701 (2002). [2] M. Timme, F. Wolf, T. Geisel, cond-mat/0306512 (2003).

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

Phenotypic Graphs and Evolution Unfold the Standard Genetic Code as the Optimal

NASA Astrophysics Data System (ADS)

Zamudio, Gabriel S.; José, Marco V.

2018-03-01

In this work, we explicitly consider the evolution of the Standard Genetic Code (SGC) by assuming two evolutionary stages, to wit, the primeval RNY code and two intermediate codes in between. We used network theory and graph theory to measure the connectivity of each phenotypic graph. The connectivity values are compared to the values of the codes under different randomization scenarios. An error-correcting optimal code is one in which the algebraic connectivity is minimized. We show that the SGC is optimal in regard to its robustness and error-tolerance when compared to all random codes under different assumptions.

Network Analysis in Disorders of Consciousness: Four Problems and One Proposed Solution (Exponential Random Graph Models)

PubMed Central

Dell'Italia, John; Johnson, Micah A.; Vespa, Paul M.; Monti, Martin M.

2018-01-01

In recent years, the study of the neural basis of consciousness, particularly in the context of patients recovering from severe brain injury, has greatly benefited from the application of sophisticated network analysis techniques to functional brain data. Yet, current graph theoretic approaches, as employed in the neuroimaging literature, suffer from four important shortcomings. First, they require arbitrary fixing of the number of connections (i.e., density) across networks which are likely to have different “natural” (i.e., stable) density (e.g., patients vs. controls, vegetative state vs. minimally conscious state patients). Second, when describing networks, they do not control for the fact that many characteristics are interrelated, particularly some of the most popular metrics employed (e.g., nodal degree, clustering coefficient)—which can lead to spurious results. Third, in the clinical domain of disorders of consciousness, there currently are no methods for incorporating structural connectivity in the characterization of functional networks which clouds the interpretation of functional differences across groups with different underlying pathology as well as in longitudinal approaches where structural reorganization processes might be operating. Finally, current methods do not allow assessing the dynamics of network change over time. We present a different framework for network analysis, based on Exponential Random Graph Models, which overcomes the above limitations and is thus particularly well suited for clinical populations with disorders of consciousness. We demonstrate this approach in the context of the longitudinal study of recovery from coma. First, our data show that throughout recovery from coma, brain graphs vary in their natural level of connectivity (from 10.4 to 14.5%), which conflicts with the standard approach of imposing arbitrary and equal density thresholds across networks (e.g., time-points, subjects, groups). Second, we show that failure to consider the interrelation between network measures does lead to spurious characterization of both inter- and intra-regional brain connectivity. Finally, we show that Separable Temporal ERGM can be employed to describe network dynamics over time revealing the specific pattern of formation and dissolution of connectivity that accompany recovery from coma. PMID:29946293

Robustness of a network formed by n interdependent networks with a one-to-one correspondence of dependent nodes.

PubMed

Gao, Jianxi; Buldyrev, S V; Havlin, S; Stanley, H E

2012-06-01

Many real-world networks interact with and depend upon other networks. We develop an analytical framework for studying a network formed by n fully interdependent randomly connected networks, each composed of the same number of nodes N. The dependency links connecting nodes from different networks establish a unique one-to-one correspondence between the nodes of one network and the nodes of the other network. We study the dynamics of the cascades of failures in such a network of networks (NON) caused by a random initial attack on one of the networks, after which a fraction p of its nodes survives. We find for the fully interdependent loopless NON that the final state of the NON does not depend on the dynamics of the cascades but is determined by a uniquely defined mutual giant component of the NON, which generalizes both the giant component of regular percolation of a single network (n=1) and the recently studied case of the mutual giant component of two interdependent networks (n=2). We also find that the mutual giant component does not depend on the topology of the NON and express it in terms of generating functions of the degree distributions of the network. Our results show that, for any n≥2 there exists a critical p=p(c)>0 below which the mutual giant component abruptly collapses from a finite nonzero value for p≥p(c) to zero for p2, a RR NON is stable for any n with p(c)<1). This results arises from the critical role played by singly connected nodes which exist in an ER NON and enhance the cascading failures, but do not exist in a RR NON.

A simple model of global cascades on random networks

NASA Astrophysics Data System (ADS)

Watts, Duncan J.

2002-04-01

The origin of large but rare cascades that are triggered by small initial shocks is a phenomenon that manifests itself as diversely as cultural fads, collective action, the diffusion of norms and innovations, and cascading failures in infrastructure and organizational networks. This paper presents a possible explanation of this phenomenon in terms of a sparse, random network of interacting agents whose decisions are determined by the actions of their neighbors according to a simple threshold rule. Two regimes are identified in which the network is susceptible to very large cascadesherein called global cascadesthat occur very rarely. When cascade propagation is limited by the connectivity of the network, a power law distribution of cascade sizes is observed, analogous to the cluster size distribution in standard percolation theory and avalanches in self-organized criticality. But when the network is highly connected, cascade propagation is limited instead by the local stability of the nodes themselves, and the size distribution of cascades is bimodal, implying a more extreme kind of instability that is correspondingly harder to anticipate. In the first regime, where the distribution of network neighbors is highly skewed, it is found that the most connected nodes are far more likely than average nodes to trigger cascades, but not in the second regime. Finally, it is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but an increasingly heterogeneous degree distribution makes it less vulnerable.

The value of less connected agents in Boolean networks

NASA Astrophysics Data System (ADS)

Epstein, Daniel; Bazzan, Ana L. C.

2013-11-01

In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality that help to see how agents are organized.

Structural disconnection is responsible for increased functional connectivity in multiple sclerosis.

PubMed

Patel, Kevin R; Tobyne, Sean; Porter, Daria; Bireley, John Daniel; Smith, Victoria; Klawiter, Eric

2018-06-01

Increased synchrony within neuroanatomical networks is often observed in neurophysiologic studies of human brain disease. Most often, this phenomenon is ascribed to a compensatory process in the face of injury, though evidence supporting such accounts is limited. Given the known dependence of resting-state functional connectivity (rsFC) on underlying structural connectivity (SC), we examine an alternative hypothesis: that topographical changes in SC, specifically particular patterns of disconnection, contribute to increased network rsFC. We obtain measures of rsFC using fMRI and SC using probabilistic tractography in 50 healthy and 28 multiple sclerosis subjects. Using a computational model of neuronal dynamics, we simulate BOLD using healthy subject SC to couple regions. We find that altering the model by introducing structural disconnection patterns observed in those multiple sclerosis subjects with high network rsFC generates simulations with high rsFC as well, suggesting that disconnection itself plays a role in producing high network functional connectivity. We then examine SC data in individuals. In multiple sclerosis subjects with high network rsFC, we find a preferential disconnection between the relevant network and wider system. We examine the significance of such network isolation by introducing random disconnection into the model. As observed empirically, simulated network rsFC increases with removal of connections bridging a community with the remainder of the brain. We thus show that structural disconnection known to occur in multiple sclerosis contributes to network rsFC changes in multiple sclerosis and further that community isolation is responsible for elevated network functional connectivity.

Emergence of robustness in networks of networks

NASA Astrophysics Data System (ADS)

Roth, Kevin; Morone, Flaviano; Min, Byungjoon; Makse, Hernán A.

2017-06-01

A model of interdependent networks of networks (NONs) was introduced recently [Proc. Natl. Acad. Sci. (USA) 114, 3849 (2017), 10.1073/pnas.1620808114] in the context of brain activation to identify the neural collective influencers in the brain NON. Here we investigate the emergence of robustness in such a model, and we develop an approach to derive an exact expression for the random percolation transition in Erdös-Rényi NONs of this kind. Analytical calculations are in agreement with numerical simulations, and highlight the robustness of the NON against random node failures, which thus presents a new robust universality class of NONs. The key aspect of this robust NON model is that a node can be activated even if it does not belong to the giant mutually connected component, thus allowing the NON to be built from below the percolation threshold, which is not possible in previous models of interdependent networks. Interestingly, the phase diagram of the model unveils particular patterns of interconnectivity for which the NON is most vulnerable, thereby marking the boundary above which the robustness of the system improves with increasing dependency connections.

Electric Current Flow Through Two-Dimensional Networks

NASA Astrophysics Data System (ADS)

Gaspard, Mallory

In modern nanotechnology, two-dimensional atomic network structures boast promising applications as nanoscale circuit boards to serve as the building blocks of more sustainable and efficient, electronic devices. However, properties associated with the network connectivity can be beneficial or deleterious to the current flow. Taking a computational approach, we will study large uniform networks, as well as large random networks using Kirchhoff's Equations in conjunction with graph theoretical measures of network connectedness and flows, to understand how network connectivity affects overall ability for successful current flow throughout a network. By understanding how connectedness affects flow, we may develop new ways to design more efficient two-dimensional materials for the next generation of nanoscale electronic devices, and we will gain a deeper insight into the intricate balance between order and chaos in the universe. Rensselaer Polytechnic Institute, SURP Institutional Grant.

An improved sampling method of complex network

NASA Astrophysics Data System (ADS)

Gao, Qi; Ding, Xintong; Pan, Feng; Li, Weixing

2014-12-01

Sampling subnet is an important topic of complex network research. Sampling methods influence the structure and characteristics of subnet. Random multiple snowball with Cohen (RMSC) process sampling which combines the advantages of random sampling and snowball sampling is proposed in this paper. It has the ability to explore global information and discover the local structure at the same time. The experiments indicate that this novel sampling method could keep the similarity between sampling subnet and original network on degree distribution, connectivity rate and average shortest path. This method is applicable to the situation where the prior knowledge about degree distribution of original network is not sufficient.

Dynamics of tax evasion through an epidemic-like model

NASA Astrophysics Data System (ADS)

Brum, Rafael M.; Crokidakis, Nuno

In this work, we study a model of tax evasion. We considered a fixed population divided in three compartments, namely honest tax payers, tax evaders and a third class between the mentioned two, which we call susceptibles to become evaders. The transitions among those compartments are ruled by probabilities, similarly to a model of epidemic spreading. These probabilities model social interactions among the individuals, as well as the government’s fiscalization. We simulate the model on fully-connected graphs, as well as on scale-free and random complex networks. For the fully-connected and random graph cases, we observe that the emergence of tax evaders in the population is associated with an active-absorbing nonequilibrium phase transition, that is absent in scale-free networks.

Oscillations and chaos in neural networks: an exactly solvable model.

PubMed Central

Wang, L P; Pichler, E E; Ross, J

1990-01-01

We consider a randomly diluted higher-order network with noise, consisting of McCulloch-Pitts neurons that interact by Hebbian-type connections. For this model, exact dynamical equations are derived and solved for both parallel and random sequential updating algorithms. For parallel dynamics, we find a rich spectrum of different behaviors including static retrieving and oscillatory and chaotic phenomena in different parts of the parameter space. The bifurcation parameters include first- and second-order neuronal interaction coefficients and a rescaled noise level, which represents the combined effects of the random synaptic dilution, interference between stored patterns, and additional background noise. We show that a marked difference in terms of the occurrence of oscillations or chaos exists between neural networks with parallel and random sequential dynamics. Images PMID:2251287

Modeling and optimization of Quality of Service routing in Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Rafsanjani, Marjan Kuchaki; Fatemidokht, Hamideh; Balas, Valentina Emilia

2016-01-01

Mobile ad hoc networks (MANETs) are a group of mobile nodes that are connected without using a fixed infrastructure. In these networks, nodes communicate with each other by forming a single-hop or multi-hop network. To design effective mobile ad hoc networks, it is important to evaluate the performance of multi-hop paths. In this paper, we present a mathematical model for a routing protocol under energy consumption and packet delivery ratio of multi-hop paths. In this model, we use geometric random graphs rather than random graphs. Our proposed model finds effective paths that minimize the energy consumption and maximizes the packet delivery ratio of the network. Validation of the mathematical model is performed through simulation.

Network diffusion accurately models the relationship between structural and functional brain connectivity networks

PubMed Central

Abdelnour, Farras; Voss, Henning U.; Raj, Ashish

2014-01-01

The relationship between anatomic connectivity of large-scale brain networks and their functional connectivity is of immense importance and an area of active research. Previous attempts have required complex simulations which model the dynamics of each cortical region, and explore the coupling between regions as derived by anatomic connections. While much insight is gained from these non-linear simulations, they can be computationally taxing tools for predicting functional from anatomic connectivities. Little attention has been paid to linear models. Here we show that a properly designed linear model appears to be superior to previous non-linear approaches in capturing the brain’s long-range second order correlation structure that governs the relationship between anatomic and functional connectivities. We derive a linear network of brain dynamics based on graph diffusion, whereby the diffusing quantity undergoes a random walk on a graph. We test our model using subjects who underwent diffusion MRI and resting state fMRI. The network diffusion model applied to the structural networks largely predicts the correlation structures derived from their fMRI data, to a greater extent than other approaches. The utility of the proposed approach is that it can routinely be used to infer functional correlation from anatomic connectivity. And since it is linear, anatomic connectivity can also be inferred from functional data. The success of our model confirms the linearity of ensemble average signals in the brain, and implies that their long-range correlation structure may percolate within the brain via purely mechanistic processes enacted on its structural connectivity pathways. PMID:24384152

Intergranular degradation assessment via random grain boundary network analysis

DOEpatents

Kumar, Mukul; Schwartz, Adam J.; King, Wayne E.

2002-01-01

A method is disclosed for determining the resistance of polycrystalline materials to intergranular degradation or failure (IGDF), by analyzing the random grain boundary network connectivity (RGBNC) microstructure. Analysis of the disruption of the RGBNC microstructure may be assess the effectiveness of materials processing in increasing IGDF resistance. Comparison of the RGBNC microstructures of materials exposed to extreme operating conditions to unexposed materials may be used to diagnose and predict possible onset of material failure due to

Diffusion in random networks

DOE PAGES

Zhang, Duan Z.; Padrino, Juan C.

2017-06-01

The ensemble averaging technique is applied to model mass transport by diffusion in random networks. The system consists of an ensemble of random networks, where each network is made of pockets connected by tortuous channels. Inside a channel, fluid transport is assumed to be governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pocket mass density. The so-called dual-porosity model is found to be equivalent to the leading order approximation of the integration kernel when the diffusion time scale inside the channels is small compared to the macroscopic time scale. As a test problem,more » we consider the one-dimensional mass diffusion in a semi-infinite domain. Because of the required time to establish the linear concentration profile inside a channel, for early times the similarity variable is xt $-$1/4 rather than xt $-$1/2 as in the traditional theory. We found this early time similarity can be explained by random walk theory through the network.« less

Charting epilepsy by searching for intelligence in network space with the help of evolving autonomous agents.

PubMed

Ohayon, Elan L; Kalitzin, Stiliyan; Suffczynski, Piotr; Jin, Frank Y; Tsang, Paul W; Borrett, Donald S; Burnham, W McIntyre; Kwan, Hon C

2004-01-01

The problem of demarcating neural network space is formidable. A simple fully connected recurrent network of five units (binary activations, synaptic weight resolution of 10) has 3.2 *10(26) possible initial states. The problem increases drastically with scaling. Here we consider three complementary approaches to help direct the exploration to distinguish epileptic from healthy networks. [1] First, we perform a gross mapping of the space of five-unit continuous recurrent networks using randomized weights and initial activations. The majority of weight patterns (>70%) were found to result in neural assemblies exhibiting periodic limit-cycle oscillatory behavior. [2] Next we examine the activation space of non-periodic networks demonstrating that the emergence of paroxysmal activity does not require changes in connectivity. [3] The next challenge is to focus the search of network space to identify networks with more complex dynamics. Here we rely on a major available indicator critical to clinical assessment but largely ignored by epilepsy modelers, namely: behavioral states. To this end, we connected the above network layout to an external robot in which interactive states were evolved. The first random generation showed a distribution in line with approach [1]. That is, the predominate phenotypes were fixed-point or oscillatory with seizure-like motor output. As evolution progressed the profile changed markedly. Within 20 generations the entire population was able to navigate a simple environment with all individuals exhibiting multiply-stable behaviors with no cases of default locked limit-cycle oscillatory motor behavior. The resultant population may thus afford us a view of the architectural principles demarcating healthy biological networks from the pathological. The approach has an advantage over other epilepsy modeling techniques in providing a way to clarify whether observed dynamics or suggested therapies are pointing to computational viability or dead space.

Disease Surveillance on Complex Social Networks.

PubMed

Herrera, Jose L; Srinivasan, Ravi; Brownstein, John S; Galvani, Alison P; Meyers, Lauren Ancel

2016-07-01

As infectious disease surveillance systems expand to include digital, crowd-sourced, and social network data, public health agencies are gaining unprecedented access to high-resolution data and have an opportunity to selectively monitor informative individuals. Contact networks, which are the webs of interaction through which diseases spread, determine whether and when individuals become infected, and thus who might serve as early and accurate surveillance sensors. Here, we evaluate three strategies for selecting sensors-sampling the most connected, random, and friends of random individuals-in three complex social networks-a simple scale-free network, an empirical Venezuelan college student network, and an empirical Montreal wireless hotspot usage network. Across five different surveillance goals-early and accurate detection of epidemic emergence and peak, and general situational awareness-we find that the optimal choice of sensors depends on the public health goal, the underlying network and the reproduction number of the disease (R0). For diseases with a low R0, the most connected individuals provide the earliest and most accurate information about both the onset and peak of an outbreak. However, identifying network hubs is often impractical, and they can be misleading if monitored for general situational awareness, if the underlying network has significant community structure, or if R0 is high or unknown. Taking a theoretical approach, we also derive the optimal surveillance system for early outbreak detection but find that real-world identification of such sensors would be nearly impossible. By contrast, the friends-of-random strategy offers a more practical and robust alternative. It can be readily implemented without prior knowledge of the network, and by identifying sensors with higher than average, but not the highest, epidemiological risk, it provides reasonably early and accurate information.

Graph Theoretic and Motif Analyses of the Hippocampal Neuron Type Potential Connectome.

PubMed

Rees, Christopher L; Wheeler, Diek W; Hamilton, David J; White, Charise M; Komendantov, Alexander O; Ascoli, Giorgio A

2016-01-01

We computed the potential connectivity map of all known neuron types in the rodent hippocampal formation by supplementing scantly available synaptic data with spatial distributions of axons and dendrites from the open-access knowledge base Hippocampome.org. The network that results from this endeavor, the broadest and most complete for a mammalian cortical region at the neuron-type level to date, contains more than 3200 connections among 122 neuron types across six subregions. Analyses of these data using graph theory metrics unveil the fundamental architectural principles of the hippocampal circuit. Globally, we identify a highly specialized topology minimizing communication cost; a modular structure underscoring the prominence of the trisynaptic loop; a core set of neuron types serving as information-processing hubs as well as a distinct group of particular antihub neurons; a nested, two-tier rich club managing much of the network traffic; and an innate resilience to random perturbations. At the local level, we uncover the basic building blocks, or connectivity patterns, that combine to produce complex global functionality, and we benchmark their utilization in the circuit relative to random networks. Taken together, these results provide a comprehensive connectivity profile of the hippocampus, yielding novel insights on its functional operations at the computationally crucial level of neuron types.

Increased functional connectivity within memory networks following memory rehabilitation in multiple sclerosis.

PubMed

Leavitt, Victoria M; Wylie, Glenn R; Girgis, Peter A; DeLuca, John; Chiaravalloti, Nancy D

2014-09-01

Identifying effective behavioral treatments to improve memory in persons with learning and memory impairment is a primary goal for neurorehabilitation researchers. Memory deficits are the most common cognitive symptom in multiple sclerosis (MS), and hold negative professional and personal consequences for people who are often in the prime of their lives when diagnosed. A 10-session behavioral treatment, the modified Story Memory Technique (mSMT), was studied in a randomized, placebo-controlled clinical trial. Behavioral improvements and increased fMRI activation were shown after treatment. Here, connectivity within the neural networks underlying memory function was examined with resting-state functional connectivity (RSFC) in a subset of participants from the clinical trial. We hypothesized that the treatment would result in increased integrity of connections within two primary memory networks of the brain, the hippocampal memory network, and the default network (DN). Seeds were placed in left and right hippocampus, and the posterior cingulate cortex. Increased connectivity was found between left hippocampus and cortical regions specifically involved in memory for visual imagery, as well as among critical hubs of the DN. These results represent the first evidence for efficacy of a behavioral intervention to impact the integrity of neural networks subserving memory functions in persons with MS.

Very long transients, irregular firing, and chaotic dynamics in networks of randomly connected inhibitory integrate-and-fire neurons.

PubMed

Zillmer, Rüdiger; Brunel, Nicolas; Hansel, David

2009-03-01

We present results of an extensive numerical study of the dynamics of networks of integrate-and-fire neurons connected randomly through inhibitory interactions. We first consider delayed interactions with infinitely fast rise and decay. Depending on the parameters, the network displays transients which are short or exponentially long in the network size. At the end of these transients, the dynamics settle on a periodic attractor. If the number of connections per neuron is large ( approximately 1000) , this attractor is a cluster state with a short period. In contrast, if the number of connections per neuron is small ( approximately 100) , the attractor has complex dynamics and very long period. During the long transients the neurons fire in a highly irregular manner. They can be viewed as quasistationary states in which, depending on the coupling strength, the pattern of activity is asynchronous or displays population oscillations. In the first case, the average firing rates and the variability of the single-neuron activity are well described by a mean-field theory valid in the thermodynamic limit. Bifurcations of the long transient dynamics from asynchronous to synchronous activity are also well predicted by this theory. The transient dynamics display features reminiscent of stable chaos. In particular, despite being linearly stable, the trajectories of the transient dynamics are destabilized by finite perturbations as small as O(1/N) . We further show that stable chaos is also observed for postsynaptic currents with finite decay time. However, we report in this type of network that chaotic dynamics characterized by positive Lyapunov exponents can also be observed. We show in fact that chaos occurs when the decay time of the synaptic currents is long compared to the synaptic delay, provided that the network is sufficiently large.

Hierarchical coefficient of a multifractal based network

NASA Astrophysics Data System (ADS)

Moreira, Darlan A.; Lucena, Liacir dos Santos; Corso, Gilberto

2014-02-01

The hierarchical property for a general class of networks stands for a power-law relation between clustering coefficient, CC and connectivity k: CC∝kβ. This relation is empirically verified in several biologic and social networks, as well as in random and deterministic network models, in special for hierarchical networks. In this work we show that the hierarchical property is also present in a Lucena network. To create a Lucena network we use the dual of a multifractal lattice ML, the vertices are the sites of the ML and links are established between neighbouring lattices, therefore this network is space filling and planar. Besides a Lucena network shows a scale-free distribution of connectivity. We deduce a relation for the maximal local clustering coefficient CCimax of a vertex i in a planar graph. This condition expresses that the number of links among neighbour, N△, of a vertex i is equal to its connectivity ki, that means: N△=ki. The Lucena network fulfils the condition N△≃ki independent of ki and the anisotropy of ML. In addition, CCmax implies the threshold β=1 for the hierarchical property for any scale-free planar network.

Quantum connectivity optimization algorithms for entanglement source deployment in a quantum multi-hop network

NASA Astrophysics Data System (ADS)

Zou, Zhen-Zhen; Yu, Xu-Tao; Zhang, Zai-Chen

2018-04-01

At first, the entanglement source deployment problem is studied in a quantum multi-hop network, which has a significant influence on quantum connectivity. Two optimization algorithms are introduced with limited entanglement sources in this paper. A deployment algorithm based on node position (DNP) improves connectivity by guaranteeing that all overlapping areas of the distribution ranges of the entanglement sources contain nodes. In addition, a deployment algorithm based on an improved genetic algorithm (DIGA) is implemented by dividing the region into grids. From the simulation results, DNP and DIGA improve quantum connectivity by 213.73% and 248.83% compared to random deployment, respectively, and the latter performs better in terms of connectivity. However, DNP is more flexible and adaptive to change, as it stops running when all nodes are covered.

Offdiagonal complexity: A computationally quick complexity measure for graphs and networks

NASA Astrophysics Data System (ADS)

Claussen, Jens Christian

2007-02-01

A vast variety of biological, social, and economical networks shows topologies drastically differing from random graphs; yet the quantitative characterization remains unsatisfactory from a conceptual point of view. Motivated from the discussion of small scale-free networks, a biased link distribution entropy is defined, which takes an extremum for a power-law distribution. This approach is extended to the node-node link cross-distribution, whose nondiagonal elements characterize the graph structure beyond link distribution, cluster coefficient and average path length. From here a simple (and computationally cheap) complexity measure can be defined. This offdiagonal complexity (OdC) is proposed as a novel measure to characterize the complexity of an undirected graph, or network. While both for regular lattices and fully connected networks OdC is zero, it takes a moderately low value for a random graph and shows high values for apparently complex structures as scale-free networks and hierarchical trees. The OdC approach is applied to the Helicobacter pylori protein interaction network and randomly rewired surrogates.

T-cell movement on the reticular network.

PubMed

Donovan, Graham M; Lythe, Grant

2012-02-21

The idea that the apparently random motion of T cells in lymph nodes is a result of movement on a reticular network (RN) has received support from dynamic imaging experiments and theoretical studies. We present a mathematical representation of the RN consisting of edges connecting vertices that are randomly distributed in three-dimensional space, and models of lymphocyte movement on such networks including constant speed motion along edges and Brownian motion, not in three-dimensions, but only along edges. The simplest model, in which a cell moves with a constant speed along edges, is consistent with mean-squared displacement proportional to time over intervals long enough to include several changes of direction. A non-random distribution of turning angles is one consequence of motion on a preformed network. Confining cell movement to a network does not, in itself, increase the frequency of cell-cell encounters. Copyright © 2011 Elsevier Ltd. All rights reserved.

Changes in Neural Connectivity and Memory Following a Yoga Intervention for Older Adults: A Pilot Study.

PubMed

Eyre, Harris A; Acevedo, Bianca; Yang, Hongyu; Siddarth, Prabha; Van Dyk, Kathleen; Ercoli, Linda; Leaver, Amber M; Cyr, Natalie St; Narr, Katherine; Baune, Bernhard T; Khalsa, Dharma S; Lavretsky, Helen

2016-01-01

No study has explored the effect of yoga on cognitive decline and resting-state functional connectivity. This study explored the relationship between performance on memory tests and resting-state functional connectivity before and after a yoga intervention versus active control for subjects with mild cognitive impairment (MCI). Participants ( ≥ 55 y) with MCI were randomized to receive a yoga intervention or active "gold-standard" control (i.e., memory enhancement training (MET)) for 12 weeks. Resting-state functional magnetic resonance imaging was used to map correlations between brain networks and memory performance changes over time. Default mode networks (DMN), language and superior parietal networks were chosen as networks of interest to analyze the association with changes in verbal and visuospatial memory performance. Fourteen yoga and 11 MET participants completed the study. The yoga group demonstrated a statistically significant improvement in depression and visuospatial memory. We observed improved verbal memory performance correlated with increased connectivity between the DMN and frontal medial cortex, pregenual anterior cingulate cortex, right middle frontal cortex, posterior cingulate cortex, and left lateral occipital cortex. Improved verbal memory performance positively correlated with increased connectivity between the language processing network and the left inferior frontal gyrus. Improved visuospatial memory performance correlated inversely with connectivity between the superior parietal network and the medial parietal cortex. Yoga may be as effective as MET in improving functional connectivity in relation to verbal memory performance. These findings should be confirmed in larger prospective studies.

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

PubMed

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

2010-03-01

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

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

Disease Surveillance on Complex Social Networks

PubMed Central

Herrera, Jose L.; Srinivasan, Ravi; Brownstein, John S.; Galvani, Alison P.; Meyers, Lauren Ancel

2016-01-01

As infectious disease surveillance systems expand to include digital, crowd-sourced, and social network data, public health agencies are gaining unprecedented access to high-resolution data and have an opportunity to selectively monitor informative individuals. Contact networks, which are the webs of interaction through which diseases spread, determine whether and when individuals become infected, and thus who might serve as early and accurate surveillance sensors. Here, we evaluate three strategies for selecting sensors—sampling the most connected, random, and friends of random individuals—in three complex social networks—a simple scale-free network, an empirical Venezuelan college student network, and an empirical Montreal wireless hotspot usage network. Across five different surveillance goals—early and accurate detection of epidemic emergence and peak, and general situational awareness—we find that the optimal choice of sensors depends on the public health goal, the underlying network and the reproduction number of the disease (R0). For diseases with a low R0, the most connected individuals provide the earliest and most accurate information about both the onset and peak of an outbreak. However, identifying network hubs is often impractical, and they can be misleading if monitored for general situational awareness, if the underlying network has significant community structure, or if R0 is high or unknown. Taking a theoretical approach, we also derive the optimal surveillance system for early outbreak detection but find that real-world identification of such sensors would be nearly impossible. By contrast, the friends-of-random strategy offers a more practical and robust alternative. It can be readily implemented without prior knowledge of the network, and by identifying sensors with higher than average, but not the highest, epidemiological risk, it provides reasonably early and accurate information. PMID:27415615

Brain modularity controls the critical behavior of spontaneous activity.

PubMed

Russo, R; Herrmann, H J; de Arcangelis, L

2014-03-13

The human brain exhibits a complex structure made of scale-free highly connected modules loosely interconnected by weaker links to form a small-world network. These features appear in healthy patients whereas neurological diseases often modify this structure. An important open question concerns the role of brain modularity in sustaining the critical behaviour of spontaneous activity. Here we analyse the neuronal activity of a model, successful in reproducing on non-modular networks the scaling behaviour observed in experimental data, on a modular network implementing the main statistical features measured in human brain. We show that on a modular network, regardless the strength of the synaptic connections or the modular size and number, activity is never fully scale-free. Neuronal avalanches can invade different modules which results in an activity depression, hindering further avalanche propagation. Critical behaviour is solely recovered if inter-module connections are added, modifying the modular into a more random structure.

Hox repertoires for motor neuron diversity and connectivity gated by a single accessory factor, FoxP1.

PubMed

Dasen, Jeremy S; De Camilli, Alessandro; Wang, Bin; Tucker, Philip W; Jessell, Thomas M

2008-07-25

The precision with which motor neurons innervate target muscles depends on a regulatory network of Hox transcription factors that translates neuronal identity into patterns of connectivity. We show that a single transcription factor, FoxP1, coordinates motor neuron subtype identity and connectivity through its activity as a Hox accessory factor. FoxP1 is expressed in Hox-sensitive motor columns and acts as a dose-dependent determinant of columnar fate. Inactivation of Foxp1 abolishes the output of the motor neuron Hox network, reverting the spinal motor system to an ancestral state. The loss of FoxP1 also changes the pattern of motor neuron connectivity, and in the limb motor axons appear to select their trajectories and muscle targets at random. Our findings show that FoxP1 is a crucial determinant of motor neuron diversification and connectivity, and clarify how this Hox regulatory network controls the formation of a topographic neural map.

A spatially resolved network spike in model neuronal cultures reveals nucleation centers, circular traveling waves and drifting spiral waves.

PubMed

Paraskevov, A V; Zendrikov, D K

2017-03-23

We show that in model neuronal cultures, where the probability of interneuronal connection formation decreases exponentially with increasing distance between the neurons, there exists a small number of spatial nucleation centers of a network spike, from where the synchronous spiking activity starts propagating in the network typically in the form of circular traveling waves. The number of nucleation centers and their spatial locations are unique and unchanged for a given realization of neuronal network but are different for different networks. In contrast, if the probability of interneuronal connection formation is independent of the distance between neurons, then the nucleation centers do not arise and the synchronization of spiking activity during a network spike occurs spatially uniform throughout the network. Therefore one can conclude that spatial proximity of connections between neurons is important for the formation of nucleation centers. It is also shown that fluctuations of the spatial density of neurons at their random homogeneous distribution typical for the experiments in vitro do not determine the locations of the nucleation centers. The simulation results are qualitatively consistent with the experimental observations.

A spatially resolved network spike in model neuronal cultures reveals nucleation centers, circular traveling waves and drifting spiral waves

NASA Astrophysics Data System (ADS)

Paraskevov, A. V.; Zendrikov, D. K.

2017-04-01

We show that in model neuronal cultures, where the probability of interneuronal connection formation decreases exponentially with increasing distance between the neurons, there exists a small number of spatial nucleation centers of a network spike, from where the synchronous spiking activity starts propagating in the network typically in the form of circular traveling waves. The number of nucleation centers and their spatial locations are unique and unchanged for a given realization of neuronal network but are different for different networks. In contrast, if the probability of interneuronal connection formation is independent of the distance between neurons, then the nucleation centers do not arise and the synchronization of spiking activity during a network spike occurs spatially uniform throughout the network. Therefore one can conclude that spatial proximity of connections between neurons is important for the formation of nucleation centers. It is also shown that fluctuations of the spatial density of neurons at their random homogeneous distribution typical for the experiments in vitro do not determine the locations of the nucleation centers. The simulation results are qualitatively consistent with the experimental observations.

Small Modifications to Network Topology Can Induce Stochastic Bistable Spiking Dynamics in a Balanced Cortical Model

PubMed Central

McDonnell, Mark D.; Ward, Lawrence M.

2014-01-01

Abstract Directed random graph models frequently are used successfully in modeling the population dynamics of networks of cortical neurons connected by chemical synapses. Experimental results consistently reveal that neuronal network topology is complex, however, in the sense that it differs statistically from a random network, and differs for classes of neurons that are physiologically different. This suggests that complex network models whose subnetworks have distinct topological structure may be a useful, and more biologically realistic, alternative to random networks. Here we demonstrate that the balanced excitation and inhibition frequently observed in small cortical regions can transiently disappear in otherwise standard neuronal-scale models of fluctuation-driven dynamics, solely because the random network topology was replaced by a complex clustered one, whilst not changing the in-degree of any neurons. In this network, a small subset of cells whose inhibition comes only from outside their local cluster are the cause of bistable population dynamics, where different clusters of these cells irregularly switch back and forth from a sparsely firing state to a highly active state. Transitions to the highly active state occur when a cluster of these cells spikes sufficiently often to cause strong unbalanced positive feedback to each other. Transitions back to the sparsely firing state rely on occasional large fluctuations in the amount of non-local inhibition received. Neurons in the model are homogeneous in their intrinsic dynamics and in-degrees, but differ in the abundance of various directed feedback motifs in which they participate. Our findings suggest that (i) models and simulations should take into account complex structure that varies for neuron and synapse classes; (ii) differences in the dynamics of neurons with similar intrinsic properties may be caused by their membership in distinctive local networks; (iii) it is important to identify neurons that share physiological properties and location, but differ in their connectivity. PMID:24743633

Dimensionless, Scale Invariant, Edge Weight Metric for the Study of Complex Structural Networks

PubMed Central

Colon-Perez, Luis M.; Spindler, Caitlin; Goicochea, Shelby; Triplett, William; Parekh, Mansi; Montie, Eric; Carney, Paul R.; Price, Catherine; Mareci, Thomas H.

2015-01-01

High spatial and angular resolution diffusion weighted imaging (DWI) with network analysis provides a unique framework for the study of brain structure in vivo. DWI-derived brain connectivity patterns are best characterized with graph theory using an edge weight to quantify the strength of white matter connections between gray matter nodes. Here a dimensionless, scale-invariant edge weight is introduced to measure node connectivity. This edge weight metric provides reasonable and consistent values over any size scale (e.g. rodents to humans) used to quantify the strength of connection. Firstly, simulations were used to assess the effects of tractography seed point density and random errors in the estimated fiber orientations; with sufficient signal-to-noise ratio (SNR), edge weight estimates improve as the seed density increases. Secondly to evaluate the application of the edge weight in the human brain, ten repeated measures of DWI in the same healthy human subject were analyzed. Mean edge weight values within the cingulum and corpus callosum were consistent and showed low variability. Thirdly, using excised rat brains to study the effects of spatial resolution, the weight of edges connecting major structures in the temporal lobe were used to characterize connectivity in this local network. The results indicate that with adequate resolution and SNR, connections between network nodes are characterized well by this edge weight metric. Therefore this new dimensionless, scale-invariant edge weight metric provides a robust measure of network connectivity that can be applied in any size regime. PMID:26173147

Dimensionless, Scale Invariant, Edge Weight Metric for the Study of Complex Structural Networks.

PubMed

Colon-Perez, Luis M; Spindler, Caitlin; Goicochea, Shelby; Triplett, William; Parekh, Mansi; Montie, Eric; Carney, Paul R; Price, Catherine; Mareci, Thomas H

2015-01-01

High spatial and angular resolution diffusion weighted imaging (DWI) with network analysis provides a unique framework for the study of brain structure in vivo. DWI-derived brain connectivity patterns are best characterized with graph theory using an edge weight to quantify the strength of white matter connections between gray matter nodes. Here a dimensionless, scale-invariant edge weight is introduced to measure node connectivity. This edge weight metric provides reasonable and consistent values over any size scale (e.g. rodents to humans) used to quantify the strength of connection. Firstly, simulations were used to assess the effects of tractography seed point density and random errors in the estimated fiber orientations; with sufficient signal-to-noise ratio (SNR), edge weight estimates improve as the seed density increases. Secondly to evaluate the application of the edge weight in the human brain, ten repeated measures of DWI in the same healthy human subject were analyzed. Mean edge weight values within the cingulum and corpus callosum were consistent and showed low variability. Thirdly, using excised rat brains to study the effects of spatial resolution, the weight of edges connecting major structures in the temporal lobe were used to characterize connectivity in this local network. The results indicate that with adequate resolution and SNR, connections between network nodes are characterized well by this edge weight metric. Therefore this new dimensionless, scale-invariant edge weight metric provides a robust measure of network connectivity that can be applied in any size regime.

PeerShield: determining control and resilience criticality of collaborative cyber assets in networks

NASA Astrophysics Data System (ADS)

Cam, Hasan

2012-06-01

As attackers get more coordinated and advanced in cyber attacks, cyber assets are required to have much more resilience, control effectiveness, and collaboration in networks. Such a requirement makes it essential to take a comprehensive and objective approach for measuring the individual and relative performances of cyber security assets in network nodes. To this end, this paper presents four techniques as to how the relative importance of cyber assets can be measured more comprehensively and objectively by considering together the main variables of risk assessment (e.g., threats, vulnerabilities), multiple attributes (e.g., resilience, control, and influence), network connectivity and controllability among collaborative cyber assets in networks. In the first technique, a Bayesian network is used to include the random variables for control, recovery, and resilience attributes of nodes, in addition to the random variables of threats, vulnerabilities, and risk. The second technique shows how graph matching and coloring can be utilized to form collaborative pairs of nodes to shield together against threats and vulnerabilities. The third technique ranks the security assets of nodes by incorporating multiple weights and thresholds of attributes into a decision-making algorithm. In the fourth technique, the hierarchically well-separated tree is enhanced to first identify critical nodes of a network with respect to their attributes and network connectivity, and then selecting some nodes as driver nodes for network controllability.

A neural network construction method for surrogate modeling of physics-based analysis

NASA Astrophysics Data System (ADS)

Sung, Woong Je

In this thesis existing methodologies related to the developmental methods of neural networks have been surveyed and their approaches to network sizing and structuring are carefully observed. This literature review covers the constructive methods, the pruning methods, and the evolutionary methods and questions about the basic assumption intrinsic to the conventional neural network learning paradigm, which is primarily devoted to optimization of connection weights (or synaptic strengths) for the pre-determined connection structure of the network. The main research hypothesis governing this thesis is that, without breaking a prevailing dichotomy between weights and connectivity of the network during learning phase, the efficient design of a task-specific neural network is hard to achieve because, as long as connectivity and weights are searched by separate means, a structural optimization of the neural network requires either repetitive re-training procedures or computationally expensive topological meta-search cycles. The main contribution of this thesis is designing and testing a novel learning mechanism which efficiently learns not only weight parameters but also connection structure from a given training data set, and positioning this learning mechanism within the surrogate modeling practice. In this work, a simple and straightforward extension to the conventional error Back-Propagation (BP) algorithm has been formulated to enable a simultaneous learning for both connectivity and weights of the Generalized Multilayer Perceptron (GMLP) in supervised learning tasks. A particular objective is to achieve a task-specific network having reasonable generalization performance with a minimal training time. The dichotomy between architectural design and weight optimization is reconciled by a mechanism establishing a new connection for a neuron pair which has potentially higher error-gradient than one of the existing connections. Interpreting an instance of the absence of connection as a zero-weight connection, the potential contribution to training error reduction of any present or absent connection can readily be evaluated using the BP algorithm. Instead of being broken, the connections that contribute less remain frozen with constant weight values optimized to that point but they are excluded from further weight optimization until reselected. In this way, a selective weight optimization is executed only for the dynamically maintained pool of high gradient connections. By searching the rapidly changing weights and concentrating optimization resources on them, the learning process is accelerated without either a significant increase in computational cost or a need for re-training. This results in a more task-adapted network connection structure. Combined with another important criterion for the division of a neuron which adds a new computational unit to a network, a highly fitted network can be grown out of the minimal random structure. This particular learning strategy can belong to a more broad class of the variable connectivity learning scheme and the devised algorithm has been named Optimal Brain Growth (OBG). The OBG algorithm has been tested on two canonical problems; a regression analysis using the Complicated Interaction Regression Function and a classification of the Two-Spiral Problem. A comparative study with conventional Multilayer Perceptrons (MLPs) consisting of single- and double-hidden layers shows that OBG is less sensitive to random initial conditions and generalizes better with only a minimal increase in computational time. This partially proves that a variable connectivity learning scheme has great potential to enhance computational efficiency and reduce efforts to select proper network architecture. To investigate the applicability of the OBG to more practical surrogate modeling tasks, the geometry-to-pressure mapping of a particular class of airfoils in the transonic flow regime has been sought using both the conventional MLP networks with pre-defined architecture and the OBG-developed networks started from the same initial MLP networks. Considering wide variety in airfoil geometry and diversity of flow conditions distributed over a range of flow Mach numbers and angles of attack, the new method shows a great potential to capture fundamentally nonlinear flow phenomena especially related to the occurrence of shock waves on airfoil surfaces in transonic flow regime. (Abstract shortened by UMI.).

Efficacy and Social Validity of Peer Network Interventions for High School Students with Severe Disabilities

ERIC Educational Resources Information Center

Asmus, Jennifer M.; Carter, Erik W.; Moss, Colleen K.; Biggs, Elizabeth E.; Bolt, Daniel M.; Born, Tiffany L.; Bottema-Beutel, Kristen; Brock, Matthew E.; Cattey, Gillian N.; Cooney, Molly; Fesperman, Ethan S.; Hochman, Julia M.; Huber, Heartley B.; Lequia, Jenna L.; Lyons, Gregory L.; Vincent, Lori B.; Weir, Katie

2017-01-01

This randomized controlled trial examined the efficacy of peer network interventions to improve the social connections of 47 high school students with severe disabilities. School staff invited, trained, and supported 192 peers without disabilities to participate in individualized social groups that met throughout one semester. Compared to…

Metal-superconductor transition in low-dimensional superconducting clusters embedded in two-dimensional electron systems

NASA Astrophysics Data System (ADS)

Bucheli, D.; Caprara, S.; Castellani, C.; Grilli, M.

2013-02-01

Motivated by recent experimental data on thin film superconductors and oxide interfaces, we propose a random-resistor network apt to describe the occurrence of a metal-superconductor transition in a two-dimensional electron system with disorder on the mesoscopic scale. We consider low-dimensional (e.g. filamentary) structures of a superconducting cluster embedded in the two-dimensional network and we explore the separate effects and the interplay of the superconducting structure and of the statistical distribution of local critical temperatures. The thermal evolution of the resistivity is determined by a numerical calculation of the random-resistor network and, for comparison, a mean-field approach called effective medium theory (EMT). Our calculations reveal the relevance of the distribution of critical temperatures for clusters with low connectivity. In addition, we show that the presence of spatial correlations requires a modification of standard EMT to give qualitative agreement with the numerical results. Applying the present approach to an LaTiO3/SrTiO3 oxide interface, we find that the measured resistivity curves are compatible with a network of spatially dense but loosely connected superconducting islands.

The Impact of Aerobic Exercise on Fronto-Parietal Network Connectivity and Its Relation to Mobility: An Exploratory Analysis of a 6-Month Randomized Controlled Trial.

PubMed

Hsu, Chun L; Best, John R; Wang, Shirley; Voss, Michelle W; Hsiung, Robin G Y; Munkacsy, Michelle; Cheung, Winnie; Handy, Todd C; Liu-Ambrose, Teresa

2017-01-01

Impaired mobility is a major concern for older adults and has significant consequences. While the widely accepted belief is that improved physical function underlies the effectiveness of targeted exercise training in improving mobility and reducing falls, recent evidence suggests cognitive and neural benefits gained through exercise may also play an important role in promoting mobility. However, the underlying neural mechanisms of this relationship are currently unclear. Thus, we hypothesize that 6 months of progressive aerobic exercise training would alter frontoparietal network (FPN) connectivity during a motor task among older adults with mild subcortical ischemic vascular cognitive impairment (SIVCI)-and exercise-induced changes in FPN connectivity would correlate with changes in mobility. We focused on the FPN as it is involved in top-down attentional control as well as motor planning and motor execution. Participants were randomized either to usual-care (CON), which included monthly educational materials about VCI and healthy diet; or thrice-weekly aerobic training (AT), which was walking outdoors with progressive intensity. Functional magnetic resonance imaging was acquired at baseline and trial completion, where the participants were instructed to perform bilateral finger tapping task. At trial completion, compared with AT, CON showed significantly increased FPN connectivity strength during right finger tapping ( p < 0.05). Across the participants, reduced FPN connectivity was associated with greater cardiovascular capacity ( p = 0.05). In the AT group, reduced FPN connectivity was significantly associated with improved mobility performance, as measured by the Timed-Up-and-Go test ( r = 0.67, p = 0.02). These results suggest progressive AT may improve mobility in older adults with SIVCI via maintaining intra-network connectivity of the FPN.

Griffiths effects of the susceptible-infected-susceptible epidemic model on random power-law networks.

PubMed

Cota, Wesley; Ferreira, Silvio C; Ódor, Géza

2016-03-01

We provide numerical evidence for slow dynamics of the susceptible-infected-susceptible model evolving on finite-size random networks with power-law degree distributions. Extensive simulations were done by averaging the activity density over many realizations of networks. We investigated the effects of outliers in both highly fluctuating (natural cutoff) and nonfluctuating (hard cutoff) most connected vertices. Logarithmic and power-law decays in time were found for natural and hard cutoffs, respectively. This happens in extended regions of the control parameter space λ(1)<λ<λ(2), suggesting Griffiths effects, induced by the topological inhomogeneities. Optimal fluctuation theory considering sample-to-sample fluctuations of the pseudothresholds is presented to explain the observed slow dynamics. A quasistationary analysis shows that response functions remain bounded at λ(2). We argue these to be signals of a smeared transition. However, in the thermodynamic limit the Griffiths effects loose their relevancy and have a conventional critical point at λ(c)=0. Since many real networks are composed by heterogeneous and weakly connected modules, the slow dynamics found in our analysis of independent and finite networks can play an important role for the deeper understanding of such systems.

Network topology and functional connectivity disturbances precede the onset of Huntington’s disease

PubMed Central

Harrington, Deborah L.; Rubinov, Mikail; Durgerian, Sally; Mourany, Lyla; Reece, Christine; Koenig, Katherine; Bullmore, Ed; Long, Jeffrey D.; Paulsen, Jane S.

2015-01-01

Cognitive, motor and psychiatric changes in prodromal Huntington’s disease have nurtured the emergent need for early interventions. Preventive clinical trials for Huntington’s disease, however, are limited by a shortage of suitable measures that could serve as surrogate outcomes. Measures of intrinsic functional connectivity from resting-state functional magnetic resonance imaging are of keen interest. Yet recent studies suggest circumscribed abnormalities in resting-state functional magnetic resonance imaging connectivity in prodromal Huntington’s disease, despite the spectrum of behavioural changes preceding a manifest diagnosis. The present study used two complementary analytical approaches to examine whole-brain resting-state functional magnetic resonance imaging connectivity in prodromal Huntington’s disease. Network topology was studied using graph theory and simple functional connectivity amongst brain regions was explored using the network-based statistic. Participants consisted of gene-negative controls (n = 16) and prodromal Huntington’s disease individuals (n = 48) with various stages of disease progression to examine the influence of disease burden on intrinsic connectivity. Graph theory analyses showed that global network interconnectivity approximated a random network topology as proximity to diagnosis neared and this was associated with decreased connectivity amongst highly-connected rich-club network hubs, which integrate processing from diverse brain regions. However, functional segregation within the global network (average clustering) was preserved. Functional segregation was also largely maintained at the local level, except for the notable decrease in the diversity of anterior insula intermodular-interconnections (participation coefficient), irrespective of disease burden. In contrast, network-based statistic analyses revealed patterns of weakened frontostriatal connections and strengthened frontal-posterior connections that evolved as disease burden increased. These disturbances were often related to long-range connections involving peripheral nodes and interhemispheric connections. A strong association was found between weaker connectivity and decreased rich-club organization, indicating that whole-brain simple connectivity partially expressed disturbances in the communication of highly-connected hubs. However, network topology and network-based statistic connectivity metrics did not correlate with key markers of executive dysfunction (Stroop Test, Trail Making Test) in prodromal Huntington’s disease, which instead were related to whole-brain connectivity disturbances in nodes (right inferior parietal, right thalamus, left anterior cingulate) that exhibited multiple aberrant connections and that mediate executive control. Altogether, our results show for the first time a largely disease burden-dependent functional reorganization of whole-brain networks in prodromal Huntington’s disease. Both analytic approaches provided a unique window into brain reorganization that was not related to brain atrophy or motor symptoms. Longitudinal studies currently in progress will chart the course of functional changes to determine the most sensitive markers of disease progression. PMID:26059655

Network topology and functional connectivity disturbances precede the onset of Huntington's disease.

PubMed

Harrington, Deborah L; Rubinov, Mikail; Durgerian, Sally; Mourany, Lyla; Reece, Christine; Koenig, Katherine; Bullmore, Ed; Long, Jeffrey D; Paulsen, Jane S; Rao, Stephen M

2015-08-01

Cognitive, motor and psychiatric changes in prodromal Huntington's disease have nurtured the emergent need for early interventions. Preventive clinical trials for Huntington's disease, however, are limited by a shortage of suitable measures that could serve as surrogate outcomes. Measures of intrinsic functional connectivity from resting-state functional magnetic resonance imaging are of keen interest. Yet recent studies suggest circumscribed abnormalities in resting-state functional magnetic resonance imaging connectivity in prodromal Huntington's disease, despite the spectrum of behavioural changes preceding a manifest diagnosis. The present study used two complementary analytical approaches to examine whole-brain resting-state functional magnetic resonance imaging connectivity in prodromal Huntington's disease. Network topology was studied using graph theory and simple functional connectivity amongst brain regions was explored using the network-based statistic. Participants consisted of gene-negative controls (n = 16) and prodromal Huntington's disease individuals (n = 48) with various stages of disease progression to examine the influence of disease burden on intrinsic connectivity. Graph theory analyses showed that global network interconnectivity approximated a random network topology as proximity to diagnosis neared and this was associated with decreased connectivity amongst highly-connected rich-club network hubs, which integrate processing from diverse brain regions. However, functional segregation within the global network (average clustering) was preserved. Functional segregation was also largely maintained at the local level, except for the notable decrease in the diversity of anterior insula intermodular-interconnections (participation coefficient), irrespective of disease burden. In contrast, network-based statistic analyses revealed patterns of weakened frontostriatal connections and strengthened frontal-posterior connections that evolved as disease burden increased. These disturbances were often related to long-range connections involving peripheral nodes and interhemispheric connections. A strong association was found between weaker connectivity and decreased rich-club organization, indicating that whole-brain simple connectivity partially expressed disturbances in the communication of highly-connected hubs. However, network topology and network-based statistic connectivity metrics did not correlate with key markers of executive dysfunction (Stroop Test, Trail Making Test) in prodromal Huntington's disease, which instead were related to whole-brain connectivity disturbances in nodes (right inferior parietal, right thalamus, left anterior cingulate) that exhibited multiple aberrant connections and that mediate executive control. Altogether, our results show for the first time a largely disease burden-dependent functional reorganization of whole-brain networks in prodromal Huntington's disease. Both analytic approaches provided a unique window into brain reorganization that was not related to brain atrophy or motor symptoms. Longitudinal studies currently in progress will chart the course of functional changes to determine the most sensitive markers of disease progression. © The Author (2015). Published by Oxford University Press on behalf of the Guarantors of Brain. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Changes in Neural Connectivity and Memory Following a Yoga Intervention for Older Adults: A Pilot Study

PubMed Central

Eyre, Harris A.; Acevedo, Bianca; Yang, Hongyu; Siddarth, Prabha; Van Dyk, Kathleen; Ercoli, Linda; Leaver, Amber M.; Cyr, Natalie St.; Narr, Katherine; Baune, Bernhard T.; Khalsa, Dharma S.; Lavretsky, Helen

2016-01-01

Background: No study has explored the effect of yoga on cognitive decline and resting-state functional connectivity. Objectives: This study explored the relationship between performance on memory tests and resting-state functional connectivity before and after a yoga intervention versus active control for subjects with mild cognitive impairment (MCI). Methods: Participants ( ≥ 55 y) with MCI were randomized to receive a yoga intervention or active “gold-standard” control (i.e., memory enhancement training (MET)) for 12 weeks. Resting-state functional magnetic resonance imaging was used to map correlations between brain networks and memory performance changes over time. Default mode networks (DMN), language and superior parietal networks were chosen as networks of interest to analyze the association with changes in verbal and visuospatial memory performance. Results: Fourteen yoga and 11 MET participants completed the study. The yoga group demonstrated a statistically significant improvement in depression and visuospatial memory. We observed improved verbal memory performance correlated with increased connectivity between the DMN and frontal medial cortex, pregenual anterior cingulate cortex, right middle frontal cortex, posterior cingulate cortex, and left lateral occipital cortex. Improved verbal memory performance positively correlated with increased connectivity between the language processing network and the left inferior frontal gyrus. Improved visuospatial memory performance correlated inversely with connectivity between the superior parietal network and the medial parietal cortex. Conclusion:Yoga may be as effective as MET in improving functional connectivity in relation to verbal memory performance. These findings should be confirmed in larger prospective studies. PMID:27060939

Short-term memory capacity in networks via the restricted isometry property.

PubMed

Charles, Adam S; Yap, Han Lun; Rozell, Christopher J

2014-06-01

Cortical networks are hypothesized to rely on transient network activity to support short-term memory (STM). In this letter, we study the capacity of randomly connected recurrent linear networks for performing STM when the input signals are approximately sparse in some basis. We leverage results from compressed sensing to provide rigorous nonasymptotic recovery guarantees, quantifying the impact of the input sparsity level, the input sparsity basis, and the network characteristics on the system capacity. Our analysis demonstrates that network memory capacities can scale superlinearly with the number of nodes and in some situations can achieve STM capacities that are much larger than the network size. We provide perfect recovery guarantees for finite sequences and recovery bounds for infinite sequences. The latter analysis predicts that network STM systems may have an optimal recovery length that balances errors due to omission and recall mistakes. Furthermore, we show that the conditions yielding optimal STM capacity can be embodied in several network topologies, including networks with sparse or dense connectivities.

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

Model-Free Reconstruction of Excitatory Neuronal Connectivity from Calcium Imaging Signals

PubMed Central

Stetter, Olav; Battaglia, Demian; Soriano, Jordi; Geisel, Theo

2012-01-01

A systematic assessment of global neural network connectivity through direct electrophysiological assays has remained technically infeasible, even in simpler systems like dissociated neuronal cultures. We introduce an improved algorithmic approach based on Transfer Entropy to reconstruct structural connectivity from network activity monitored through calcium imaging. We focus in this study on the inference of excitatory synaptic links. Based on information theory, our method requires no prior assumptions on the statistics of neuronal firing and neuronal connections. The performance of our algorithm is benchmarked on surrogate time series of calcium fluorescence generated by the simulated dynamics of a network with known ground-truth topology. We find that the functional network topology revealed by Transfer Entropy depends qualitatively on the time-dependent dynamic state of the network (bursting or non-bursting). Thus by conditioning with respect to the global mean activity, we improve the performance of our method. This allows us to focus the analysis to specific dynamical regimes of the network in which the inferred functional connectivity is shaped by monosynaptic excitatory connections, rather than by collective synchrony. Our method can discriminate between actual causal influences between neurons and spurious non-causal correlations due to light scattering artifacts, which inherently affect the quality of fluorescence imaging. Compared to other reconstruction strategies such as cross-correlation or Granger Causality methods, our method based on improved Transfer Entropy is remarkably more accurate. In particular, it provides a good estimation of the excitatory network clustering coefficient, allowing for discrimination between weakly and strongly clustered topologies. Finally, we demonstrate the applicability of our method to analyses of real recordings of in vitro disinhibited cortical cultures where we suggest that excitatory connections are characterized by an elevated level of clustering compared to a random graph (although not extreme) and can be markedly non-local. PMID:22927808

Scale-free models for the structure of business firm networks

NASA Astrophysics Data System (ADS)

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

2010-03-01

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

Predicting the cumulative effect of multiple disturbances on seagrass connectivity.

PubMed

Grech, Alana; Hanert, Emmanuel; McKenzie, Len; Rasheed, Michael; Thomas, Christopher; Tol, Samantha; Wang, Mingzhu; Waycott, Michelle; Wolter, Jolan; Coles, Rob

2018-03-15

The rate of exchange, or connectivity, among populations effects their ability to recover after disturbance events. However, there is limited information on the extent to which populations are connected or how multiple disturbances affect connectivity, especially in coastal and marine ecosystems. We used network analysis and the outputs of a biophysical model to measure potential functional connectivity and predict the impact of multiple disturbances on seagrasses in the central Great Barrier Reef World Heritage Area (GBRWHA), Australia. The seagrass networks were densely connected, indicating that seagrasses are resilient to the random loss of meadows. Our analysis identified discrete meadows that are important sources of seagrass propagules and that serve as stepping stones connecting various different parts of the network. Several of these meadows were close to urban areas or ports and likely to be at risk from coastal development. Deep water meadows were highly connected to coastal meadows and may function as a refuge, but only for non-foundation species. We evaluated changes to the structure and functioning of the seagrass networks when one or more discrete meadows were removed due to multiple disturbance events. The scale of disturbance required to disconnect the seagrass networks into two or more components was on average >245 km, about half the length of the metapopulation. The densely connected seagrass meadows of the central GBRWHA are not limited by the supply of propagules; therefore, management should focus on improving environmental conditions that support natural seagrass recruitment and recovery processes. Our study provides a new framework for assessing the impact of global change on the connectivity and persistence of coastal and marine ecosystems. Without this knowledge, management actions, including coastal restoration, may prove unnecessary and be unsuccessful. © 2018 John Wiley & Sons Ltd.

Plasticity-Driven Self-Organization under Topological Constraints Accounts for Non-random Features of Cortical Synaptic Wiring

PubMed Central

Miner, Daniel; Triesch, Jochen

2016-01-01

Understanding the structure and dynamics of cortical connectivity is vital to understanding cortical function. Experimental data strongly suggest that local recurrent connectivity in the cortex is significantly non-random, exhibiting, for example, above-chance bidirectionality and an overrepresentation of certain triangular motifs. Additional evidence suggests a significant distance dependency to connectivity over a local scale of a few hundred microns, and particular patterns of synaptic turnover dynamics, including a heavy-tailed distribution of synaptic efficacies, a power law distribution of synaptic lifetimes, and a tendency for stronger synapses to be more stable over time. Understanding how many of these non-random features simultaneously arise would provide valuable insights into the development and function of the cortex. While previous work has modeled some of the individual features of local cortical wiring, there is no model that begins to comprehensively account for all of them. We present a spiking network model of a rodent Layer 5 cortical slice which, via the interactions of a few simple biologically motivated intrinsic, synaptic, and structural plasticity mechanisms, qualitatively reproduces these non-random effects when combined with simple topological constraints. Our model suggests that mechanisms of self-organization arising from a small number of plasticity rules provide a parsimonious explanation for numerous experimentally observed non-random features of recurrent cortical wiring. Interestingly, similar mechanisms have been shown to endow recurrent networks with powerful learning abilities, suggesting that these mechanism are central to understanding both structure and function of cortical synaptic wiring. PMID:26866369

Cognitive Enhancement Therapy Improves Resting-State Functional Connectivity in Early Course Schizophrenia

PubMed Central

Eack, Shaun M.; Newhill, Christina E.; Keshavan, Matcheri S.

2016-01-01

Objective Cognitive remediation is emerging as an effective psychosocial intervention for addressing untreated cognitive and functional impairments in persons with schizophrenia, and might achieve its benefits through neuroplastic changes in brain connectivity. This study seeks to examine the effects of cognitive enhancement therapy (CET) on fronto-temporal brain connectivity in a randomized controlled trial with individuals in the early course of schizophrenia. Method Stabilized, early course outpatients with schizophrenia or schizoaffective disorder (N = 41) were randomly assigned to CET (n = 25) or an active enriched supportive therapy (EST) control (n = 16) and treated for 2 years. Functional MRI data were collected annually, and pseudo resting-state functional connectivity analysis was used to examine differential changes in fronto-temporal connectivity between those treated with CET compared with EST. Results Individuals receiving CET evidenced significantly less functional connectivity loss between the resting-state network and the left dorsolateral prefrontal cortex as well as significantly increased connectivity with the right insular cortex compared to EST (all corrected p < .01). These neural networks are involved in emotion processing and problem-solving. Increased connectivity with the right insula significantly mediated CET effects on improved emotion perception (z′ = −1.96, p = .021), and increased connectivity with the left dorsolateral prefrontal cortex mediated CET-related improvements in emotion regulation (z′ = −1.71, p = .052). Conclusions These findings provide preliminary evidence that CET, a psychosocial cognitive remediation intervention, may enhance connectivity between frontal and temporal brain regions implicated in problem-solving and emotion processing in service of cognitive enhancement in schizophrenia. PMID:27713804

Dynamical influence processes on networks: general theory and applications to social contagion.

PubMed

Harris, Kameron Decker; Danforth, Christopher M; Dodds, Peter Sheridan

2013-08-01

We study binary state dynamics on a network where each node acts in response to the average state of its neighborhood. By allowing varying amounts of stochasticity in both the network and node responses, we find different outcomes in random and deterministic versions of the model. In the limit of a large, dense network, however, we show that these dynamics coincide. We construct a general mean-field theory for random networks and show this predicts that the dynamics on the network is a smoothed version of the average response function dynamics. Thus, the behavior of the system can range from steady state to chaotic depending on the response functions, network connectivity, and update synchronicity. As a specific example, we model the competing tendencies of imitation and nonconformity by incorporating an off-threshold into standard threshold models of social contagion. In this way, we attempt to capture important aspects of fashions and societal trends. We compare our theory to extensive simulations of this "limited imitation contagion" model on Poisson random graphs, finding agreement between the mean-field theory and stochastic simulations.

Research on Some Bus Transport Networks with Random Overlapping Clique Structure

NASA Astrophysics Data System (ADS)

Yang, Xu-Hua; Wang, Bo; Wang, Wan-Liang; Sun, You-Xian

2008-11-01

On the basis of investigating the statistical data of bus transport networks of three big cities in China, we propose that each bus route is a clique (maximal complete subgraph) and a bus transport network (BTN) consists of a lot of cliques, which intensively connect and overlap with each other. We study the network properties, which include the degree distribution, multiple edges' overlapping time distribution, distribution of the overlap size between any two overlapping cliques, distribution of the number of cliques that a node belongs to. Naturally, the cliques also constitute a network, with the overlapping nodes being their multiple links. We also research its network properties such as degree distribution, clustering, average path length, and so on. We propose that a BTN has the properties of random clique increment and random overlapping clique, at the same time, a BTN is a small-world network with highly clique-clustered and highly clique-overlapped. Finally, we introduce a BTN evolution model, whose simulation results agree well with the statistical laws that emerge in real BTNs.

Connecting to young adults: an online social network survey of beliefs and attitudes associated with prescription opioid misuse among college students.

PubMed

Lord, Sarah; Brevard, Julie; Budman, Simon

2011-01-01

A survey of motives and attitudes associated with patterns of nonmedical prescription opioid medication use among college students was conducted on Facebook, a popular online social networking Web site. Response metrics for a 2-week random advertisement post, targeting students who had misused prescription medications, surpassed typical benchmarks for online marketing campaigns and yielded 527 valid surveys. Respondent characteristics, substance use patterns, and use motives were consistent with other surveys of prescription opioid use among college populations. Results support the potential of online social networks to serve as powerful vehicles to connect with college-aged populations about their drug use. Limitations of the study are noted.

A mixing evolution model for bidirectional microblog user networks

NASA Astrophysics Data System (ADS)

Yuan, Wei-Guo; Liu, Yun

2015-08-01

Microblogs have been widely used as a new form of online social networking. Based on the user profile data collected from Sina Weibo, we find that the number of microblog user bidirectional friends approximately corresponds with the lognormal distribution. We then build two microblog user networks with real bidirectional relationships, both of which have not only small-world and scale-free but also some special properties, such as double power-law degree distribution, disassortative network, hierarchical and rich-club structure. Moreover, by detecting the community structures of the two real networks, we find both of their community scales follow an exponential distribution. Based on the empirical analysis, we present a novel evolution network model with mixed connection rules, including lognormal fitness preferential and random attachment, nearest neighbor interconnected in the same community, and global random associations in different communities. The simulation results show that our model is consistent with real network in many topology features.

Random Time Identity Based Firewall In Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Suman, Patel, R. B.; Singh, Parvinder

2010-11-01

A mobile ad hoc network (MANET) is a self-organizing network of mobile routers and associated hosts connected by wireless links. MANETs are highly flexible and adaptable but at the same time are highly prone to security risks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized control. Firewall is an effective means of protecting a local network from network-based security threats and forms a key component in MANET security architecture. This paper presents a review of firewall implementation techniques in MANETs and their relative merits and demerits. A new approach is proposed to select MANET nodes at random for firewall implementation. This approach randomly select a new node as firewall after fixed time and based on critical value of certain parameters like power backup. This approach effectively balances power and resource utilization of entire MANET because responsibility of implementing firewall is equally shared among all the nodes. At the same time it ensures improved security for MANETs from outside attacks as intruder will not be able to find out the entry point in MANET due to the random selection of nodes for firewall implementation.

Food-web structure and network theory: The role of connectance and size

PubMed Central

Dunne, Jennifer A.; Williams, Richard J.; Martinez, Neo D.

2002-01-01

Networks from a wide range of physical, biological, and social systems have been recently described as “small-world” and “scale-free.” However, studies disagree whether ecological networks called food webs possess the characteristic path lengths, clustering coefficients, and degree distributions required for membership in these classes of networks. Our analysis suggests that the disagreements are based on selective use of relatively few food webs, as well as analytical decisions that obscure important variability in the data. We analyze a broad range of 16 high-quality food webs, with 25–172 nodes, from a variety of aquatic and terrestrial ecosystems. Food webs generally have much higher complexity, measured as connectance (the fraction of all possible links that are realized in a network), and much smaller size than other networks studied, which have important implications for network topology. Our results resolve prior conflicts by demonstrating that although some food webs have small-world and scale-free structure, most do not if they exceed a relatively low level of connectance. Although food-web degree distributions do not display a universal functional form, observed distributions are systematically related to network connectance and size. Also, although food webs often lack small-world structure because of low clustering, we identify a continuum of real-world networks including food webs whose ratios of observed to random clustering coefficients increase as a power–law function of network size over 7 orders of magnitude. Although food webs are generally not small-world, scale-free networks, food-web topology is consistent with patterns found within those classes of networks. PMID:12235364

Evaluating the Connectivity of a Protected Areas' Network under the Prism of Global Change: The Efficiency of the European Natura 2000 Network for Four Birds of Prey

PubMed Central

Mazaris, Antonios D.; Papanikolaou, Alexandra D.; Barbet-Massin, Morgane; Kallimanis, Athanasios S.; Jiguet, Frédéric; Schmeller, Dirk S.; Pantis, John D.

2013-01-01

Climate and land use changes are major threats to biodiversity. To preserve biodiversity, networks of protected areas have been established worldwide, like the Natura 2000 network across the European Union (EU). Currently, this reserve network consists of more than 26000 sites covering more than 17% of EU terrestrial territory. Its efficiency to mitigate the detrimental effects of land use and climate change remains an open research question. Here, we examined the potential current and future geographical ranges of four birds of prey under scenarios of both land use and climate changes. By using graph theory, we examined how the current Natura 2000 network will perform in regard to the conservation of these species. This approach determines the importance of a site in regard to the total network and its connectivity. We found that sites becoming unsuitable due to climate change are not a random sample of the network, but are less connected and contribute less to the overall connectivity than the average site and thus their loss does not disrupt the full network. Hence, the connectivity of the remaining network changed only slightly from present day conditions. Our findings highlight the need to establish species-specific management plans with flexible conservation strategies ensuring protection under potential future range expansions. Aquila pomarina is predicted to disappear from the southern part of its range and to become restricted to northeastern Europe. Gyps fulvus, Aquila chrysaetos, and Neophron percnopterus are predicted to locally lose some suitable sites; hence, some isolated small populations may become extinct. However, their geographical range and metapopulation structure will remain relatively unaffected throughout Europe. These species would benefit more from an improved habitat quality and management of the existing network of protected areas than from increased connectivity or assisted migration. PMID:23527237

Non-Hermitian localization in biological networks.

PubMed

Amir, Ariel; Hatano, Naomichi; Nelson, David R

2016-04-01

We explore the spectra and localization properties of the N-site banded one-dimensional non-Hermitian random matrices that arise naturally in sparse neural networks. Approximately equal numbers of random excitatory and inhibitory connections lead to spatially localized eigenfunctions and an intricate eigenvalue spectrum in the complex plane that controls the spontaneous activity and induced response. A finite fraction of the eigenvalues condense onto the real or imaginary axes. For large N, the spectrum has remarkable symmetries not only with respect to reflections across the real and imaginary axes but also with respect to 90^{∘} rotations, with an unusual anisotropic divergence in the localization length near the origin. When chains with periodic boundary conditions become directed, with a systematic directional bias superimposed on the randomness, a hole centered on the origin opens up in the density-of-states in the complex plane. All states are extended on the rim of this hole, while the localized eigenvalues outside the hole are unchanged. The bias-dependent shape of this hole tracks the bias-independent contours of constant localization length. We treat the large-N limit by a combination of direct numerical diagonalization and using transfer matrices, an approach that allows us to exploit an electrostatic analogy connecting the "charges" embodied in the eigenvalue distribution with the contours of constant localization length. We show that similar results are obtained for more realistic neural networks that obey "Dale's law" (each site is purely excitatory or inhibitory) and conclude with perturbation theory results that describe the limit of large directional bias, when all states are extended. Related problems arise in random ecological networks and in chains of artificial cells with randomly coupled gene expression patterns.

Non-Hermitian localization in biological networks

NASA Astrophysics Data System (ADS)

Amir, Ariel; Hatano, Naomichi; Nelson, David R.

2016-04-01

We explore the spectra and localization properties of the N -site banded one-dimensional non-Hermitian random matrices that arise naturally in sparse neural networks. Approximately equal numbers of random excitatory and inhibitory connections lead to spatially localized eigenfunctions and an intricate eigenvalue spectrum in the complex plane that controls the spontaneous activity and induced response. A finite fraction of the eigenvalues condense onto the real or imaginary axes. For large N , the spectrum has remarkable symmetries not only with respect to reflections across the real and imaginary axes but also with respect to 90∘ rotations, with an unusual anisotropic divergence in the localization length near the origin. When chains with periodic boundary conditions become directed, with a systematic directional bias superimposed on the randomness, a hole centered on the origin opens up in the density-of-states in the complex plane. All states are extended on the rim of this hole, while the localized eigenvalues outside the hole are unchanged. The bias-dependent shape of this hole tracks the bias-independent contours of constant localization length. We treat the large-N limit by a combination of direct numerical diagonalization and using transfer matrices, an approach that allows us to exploit an electrostatic analogy connecting the "charges" embodied in the eigenvalue distribution with the contours of constant localization length. We show that similar results are obtained for more realistic neural networks that obey "Dale's law" (each site is purely excitatory or inhibitory) and conclude with perturbation theory results that describe the limit of large directional bias, when all states are extended. Related problems arise in random ecological networks and in chains of artificial cells with randomly coupled gene expression patterns.

Phase-space networks of geometrically frustrated systems.

PubMed

Han, Yilong

2009-11-01

We illustrate a network approach to the phase-space study by using two geometrical frustration models: antiferromagnet on triangular lattice and square ice. Their highly degenerated ground states are mapped as discrete networks such that the quantitative network analysis can be applied to phase-space studies. The resulting phase spaces share some comon features and establish a class of complex networks with unique Gaussian spectral densities. Although phase-space networks are heterogeneously connected, the systems are still ergodic due to the random Poisson processes. This network approach can be generalized to phase spaces of some other complex systems.

Spatiotemporal discrimination in neural networks with short-term synaptic plasticity

NASA Astrophysics Data System (ADS)

Shlaer, Benjamin; Miller, Paul

2015-03-01

Cells in recurrently connected neural networks exhibit bistability, which allows for stimulus information to persist in a circuit even after stimulus offset, i.e. short-term memory. However, such a system does not have enough hysteresis to encode temporal information about the stimuli. The biophysically described phenomenon of synaptic depression decreases synaptic transmission strengths due to increased presynaptic activity. This short-term reduction in synaptic strengths can destabilize attractor states in excitatory recurrent neural networks, causing the network to move along stimulus dependent dynamical trajectories. Such a network can successfully separate amplitudes and durations of stimuli from the number of successive stimuli. Stimulus number, duration and intensity encoding in randomly connected attractor networks with synaptic depression. Front. Comput. Neurosci. 7:59., and so provides a strong candidate network for the encoding of spatiotemporal information. Here we explicitly demonstrate the capability of a recurrent neural network with short-term synaptic depression to discriminate between the temporal sequences in which spatial stimuli are presented.

On the Simulation-Based Reliability of Complex Emergency Logistics Networks in Post-Accident Rescues.

PubMed

Wang, Wei; Huang, Li; Liang, Xuedong

2018-01-06

This paper investigates the reliability of complex emergency logistics networks, as reliability is crucial to reducing environmental and public health losses in post-accident emergency rescues. Such networks' statistical characteristics are analyzed first. After the connected reliability and evaluation indices for complex emergency logistics networks are effectively defined, simulation analyses of network reliability are conducted under two different attack modes using a particular emergency logistics network as an example. The simulation analyses obtain the varying trends in emergency supply times and the ratio of effective nodes and validates the effects of network characteristics and different types of attacks on network reliability. The results demonstrate that this emergency logistics network is both a small-world and a scale-free network. When facing random attacks, the emergency logistics network steadily changes, whereas it is very fragile when facing selective attacks. Therefore, special attention should be paid to the protection of supply nodes and nodes with high connectivity. The simulation method provides a new tool for studying emergency logistics networks and a reference for similar studies.

Robust Network Architecture Against Random Threats in WMD Environments: Theoretical Limits and Recovery Strategies

DTIC Science & Technology

2017-08-01

green energy sources such as the Photovoltaic (PV) and Wind Turbine (WT). All those devices are equipped with Intelligent Electronic Devices (IEDs...equivalent to the connectivity in the wired networks, which is used as a prerequisite to evaluate the functionality of the network applications. Moreover, a...using different access technologies, including wired and wireless, on licensed and unlicensed frequency bands. The objectives can be two-fold in general

Non-linear blend coding in the moth antennal lobe emerges from random glomerular networks

PubMed Central

Capurro, Alberto; Baroni, Fabiano; Olsson, Shannon B.; Kuebler, Linda S.; Karout, Salah; Hansson, Bill S.; Pearce, Timothy C.

2012-01-01

Neural responses to odor blends often exhibit non-linear interactions to blend components. The first olfactory processing center in insects, the antennal lobe (AL), exhibits a complex network connectivity. We attempt to determine if non-linear blend interactions can arise purely as a function of the AL network connectivity itself, without necessitating additional factors such as competitive ligand binding at the periphery or intrinsic cellular properties. To assess this, we compared blend interactions among responses from single neurons recorded intracellularly in the AL of the moth Manduca sexta with those generated using a population-based computational model constructed from the morphologically based connectivity pattern of projection neurons (PNs) and local interneurons (LNs) with randomized connection probabilities from which we excluded detailed intrinsic neuronal properties. The model accurately predicted most of the proportions of blend interaction types observed in the physiological data. Our simulations also indicate that input from LNs is important in establishing both the type of blend interaction and the nature of the neuronal response (excitation or inhibition) exhibited by AL neurons. For LNs, the only input that significantly impacted the blend interaction type was received from other LNs, while for PNs the input from olfactory sensory neurons and other PNs contributed agonistically with the LN input to shape the AL output. Our results demonstrate that non-linear blend interactions can be a natural consequence of AL connectivity, and highlight the importance of lateral inhibition as a key feature of blend coding to be addressed in future experimental and computational studies. PMID:22529799

Percolation of spatially constrained Erdős-Rényi networks with degree correlations.

PubMed

Schmeltzer, C; Soriano, J; Sokolov, I M; Rüdiger, S

2014-01-01

Motivated by experiments on activity in neuronal cultures [ J. Soriano, M. Rodríguez Martínez, T. Tlusty and E. Moses Proc. Natl. Acad. Sci. 105 13758 (2008)], we investigate the percolation transition and critical exponents of spatially embedded Erdős-Rényi networks with degree correlations. In our model networks, nodes are randomly distributed in a two-dimensional spatial domain, and the connection probability depends on Euclidian link length by a power law as well as on the degrees of linked nodes. Generally, spatial constraints lead to higher percolation thresholds in the sense that more links are needed to achieve global connectivity. However, degree correlations favor or do not favor percolation depending on the connectivity rules. We employ two construction methods to introduce degree correlations. In the first one, nodes stay homogeneously distributed and are connected via a distance- and degree-dependent probability. We observe that assortativity in the resulting network leads to a decrease of the percolation threshold. In the second construction methods, nodes are first spatially segregated depending on their degree and afterwards connected with a distance-dependent probability. In this segregated model, we find a threshold increase that accompanies the rising assortativity. Additionally, when the network is constructed in a disassortative way, we observe that this property has little effect on the percolation transition.

Hidden Connectivity in Networks with Vulnerable Classes of Nodes

NASA Astrophysics Data System (ADS)

Krause, Sebastian M.; Danziger, Michael M.; Zlatić, Vinko

2016-10-01

In many complex systems representable as networks, nodes can be separated into different classes. Often these classes can be linked to a mutually shared vulnerability. Shared vulnerabilities may be due to a shared eavesdropper or correlated failures. In this paper, we show the impact of shared vulnerabilities on robust connectivity and how the heterogeneity of node classes can be exploited to maintain functionality by utilizing multiple paths. Percolation is the field of statistical physics that is generally used to analyze connectivity in complex networks, but in its existing forms, it cannot treat the heterogeneity of multiple vulnerable classes. To analyze the connectivity under these constraints, we describe each class as a color and develop a "color-avoiding" percolation. We present an analytic theory for random networks and a numerical algorithm for all networks, with which we can determine which nodes are color-avoiding connected and whether the maximal set percolates in the system. We find that the interaction of topology and color distribution implies a rich critical behavior, with critical values and critical exponents depending both on the topology and on the color distribution. Applying our physics-based theory to the Internet, we show how color-avoiding percolation can be used as the basis for new topologically aware secure communication protocols. Beyond applications to cybersecurity, our framework reveals a new layer of hidden structure in a wide range of natural and technological systems.

A Deep Stochastic Model for Detecting Community in Complex Networks

NASA Astrophysics Data System (ADS)

Fu, Jingcheng; Wu, Jianliang

2017-01-01

Discovering community structures is an important step to understanding the structure and dynamics of real-world networks in social science, biology and technology. In this paper, we develop a deep stochastic model based on non-negative matrix factorization to identify communities, in which there are two sets of parameters. One is the community membership matrix, of which the elements in a row correspond to the probabilities of the given node belongs to each of the given number of communities in our model, another is the community-community connection matrix, of which the element in the i-th row and j-th column represents the probability of there being an edge between a randomly chosen node from the i-th community and a randomly chosen node from the j-th community. The parameters can be evaluated by an efficient updating rule, and its convergence can be guaranteed. The community-community connection matrix in our model is more precise than the community-community connection matrix in traditional non-negative matrix factorization methods. Furthermore, the method called symmetric nonnegative matrix factorization, is a special case of our model. Finally, based on the experiments on both synthetic and real-world networks data, it can be demonstrated that our algorithm is highly effective in detecting communities.

Robustness of Controllability for Networks Based on Edge-Attack

PubMed Central

Nie, Sen; Wang, Xuwen; Zhang, Haifeng; Li, Qilang; Wang, Binghong

2014-01-01

We study the controllability of networks in the process of cascading failures under two different attacking strategies, random and intentional attack, respectively. For the highest-load edge attack, it is found that the controllability of Erdős-Rényi network, that with moderate average degree, is less robust, whereas the Scale-free network with moderate power-law exponent shows strong robustness of controllability under the same attack strategy. The vulnerability of controllability under random and intentional attacks behave differently with the increasing of removal fraction, especially, we find that the robustness of control has important role in cascades for large removal fraction. The simulation results show that for Scale-free networks with various power-law exponents, the network has larger scale of cascades do not mean that there will be more increments of driver nodes. Meanwhile, the number of driver nodes in cascading failures is also related to the edges amount in strongly connected components. PMID:24586507

Robustness of controllability for networks based on edge-attack.

PubMed

Nie, Sen; Wang, Xuwen; Zhang, Haifeng; Li, Qilang; Wang, Binghong

2014-01-01

We study the controllability of networks in the process of cascading failures under two different attacking strategies, random and intentional attack, respectively. For the highest-load edge attack, it is found that the controllability of Erdős-Rényi network, that with moderate average degree, is less robust, whereas the Scale-free network with moderate power-law exponent shows strong robustness of controllability under the same attack strategy. The vulnerability of controllability under random and intentional attacks behave differently with the increasing of removal fraction, especially, we find that the robustness of control has important role in cascades for large removal fraction. The simulation results show that for Scale-free networks with various power-law exponents, the network has larger scale of cascades do not mean that there will be more increments of driver nodes. Meanwhile, the number of driver nodes in cascading failures is also related to the edges amount in strongly connected components.

Selective pinning control of the average disease transmissibility in an HIV contact network

NASA Astrophysics Data System (ADS)

du Toit, E. F.; Craig, I. K.

2015-07-01

Medication is applied to the HIV-infected nodes of high-risk contact networks with the aim of controlling the spread of disease to a predetermined maximum level. This intervention, known as pinning control, is performed both selectively and randomly in the network. These strategies are applied to 300 independent realizations per reference level of incidence on connected undirectional networks without isolated components and varying in size from 100 to 10 000 nodes per network. It is shown that a selective on-off pinning control strategy can control the networks studied with limited steady-state error and, comparing the medians of the doses from both strategies, uses 51.3% less medication than random pinning of all infected nodes. Selective pinning could possibly be used by public health specialists to identify the maximum level of HIV incidence in a population that can be achieved in a constrained funding environment.

Tests of peak flow scaling in simulated self-similar river networks

USGS Publications Warehouse

Menabde, M.; Veitzer, S.; Gupta, V.; Sivapalan, M.

2001-01-01

The effect of linear flow routing incorporating attenuation and network topology on peak flow scaling exponent is investigated for an instantaneously applied uniform runoff on simulated deterministic and random self-similar channel networks. The flow routing is modelled by a linear mass conservation equation for a discrete set of channel links connected in parallel and series, and having the same topology as the channel network. A quasi-analytical solution for the unit hydrograph is obtained in terms of recursion relations. The analysis of this solution shows that the peak flow has an asymptotically scaling dependence on the drainage area for deterministic Mandelbrot-Vicsek (MV) and Peano networks, as well as for a subclass of random self-similar channel networks. However, the scaling exponent is shown to be different from that predicted by the scaling properties of the maxima of the width functions. ?? 2001 Elsevier Science Ltd. All rights reserved.

Directed Random Markets: Connectivity Determines Money

NASA Astrophysics Data System (ADS)

Martínez-Martínez, Ismael; López-Ruiz, Ricardo

2013-12-01

Boltzmann-Gibbs (BG) distribution arises as the statistical equilibrium probability distribution of money among the agents of a closed economic system where random and undirected exchanges are allowed. When considering a model with uniform savings in the exchanges, the final distribution is close to the gamma family. In this paper, we implement these exchange rules on networks and we find that these stationary probability distributions are robust and they are not affected by the topology of the underlying network. We introduce a new family of interactions: random but directed ones. In this case, it is found the topology to be determinant and the mean money per economic agent is related to the degree of the node representing the agent in the network. The relation between the mean money per economic agent and its degree is shown to be linear.

Eradicating catastrophic collapse in interdependent networks via reinforced nodes

PubMed Central

Yuan, Xin; Hu, Yanqing; Havlin, Shlomo

2017-01-01

In interdependent networks, it is usually assumed, based on percolation theory, that nodes become nonfunctional if they lose connection to the network giant component. However, in reality, some nodes, equipped with alternative resources, together with their connected neighbors can still be functioning after disconnected from the giant component. Here, we propose and study a generalized percolation model that introduces a fraction of reinforced nodes in the interdependent networks that can function and support their neighborhood. We analyze, both analytically and via simulations, the order parameter—the functioning component—comprising both the giant component and smaller components that include at least one reinforced node. Remarkably, it is found that, for interdependent networks, we need to reinforce only a small fraction of nodes to prevent abrupt catastrophic collapses. Moreover, we find that the universal upper bound of this fraction is 0.1756 for two interdependent Erdős–Rényi (ER) networks: regular random (RR) networks and scale-free (SF) networks with large average degrees. We also generalize our theory to interdependent networks of networks (NONs). These findings might yield insight for designing resilient interdependent infrastructure networks. PMID:28289204

On the Simulation-Based Reliability of Complex Emergency Logistics Networks in Post-Accident Rescues

PubMed Central

Wang, Wei; Huang, Li; Liang, Xuedong

2018-01-01

This paper investigates the reliability of complex emergency logistics networks, as reliability is crucial to reducing environmental and public health losses in post-accident emergency rescues. Such networks’ statistical characteristics are analyzed first. After the connected reliability and evaluation indices for complex emergency logistics networks are effectively defined, simulation analyses of network reliability are conducted under two different attack modes using a particular emergency logistics network as an example. The simulation analyses obtain the varying trends in emergency supply times and the ratio of effective nodes and validates the effects of network characteristics and different types of attacks on network reliability. The results demonstrate that this emergency logistics network is both a small-world and a scale-free network. When facing random attacks, the emergency logistics network steadily changes, whereas it is very fragile when facing selective attacks. Therefore, special attention should be paid to the protection of supply nodes and nodes with high connectivity. The simulation method provides a new tool for studying emergency logistics networks and a reference for similar studies. PMID:29316614

Self-consistent determination of the spike-train power spectrum in a neural network with sparse connectivity.

PubMed

Dummer, Benjamin; Wieland, Stefan; Lindner, Benjamin

2014-01-01

A major source of random variability in cortical networks is the quasi-random arrival of presynaptic action potentials from many other cells. In network studies as well as in the study of the response properties of single cells embedded in a network, synaptic background input is often approximated by Poissonian spike trains. However, the output statistics of the cells is in most cases far from being Poisson. This is inconsistent with the assumption of similar spike-train statistics for pre- and postsynaptic cells in a recurrent network. Here we tackle this problem for the popular class of integrate-and-fire neurons and study a self-consistent statistics of input and output spectra of neural spike trains. Instead of actually using a large network, we use an iterative scheme, in which we simulate a single neuron over several generations. In each of these generations, the neuron is stimulated with surrogate stochastic input that has a similar statistics as the output of the previous generation. For the surrogate input, we employ two distinct approximations: (i) a superposition of renewal spike trains with the same interspike interval density as observed in the previous generation and (ii) a Gaussian current with a power spectrum proportional to that observed in the previous generation. For input parameters that correspond to balanced input in the network, both the renewal and the Gaussian iteration procedure converge quickly and yield comparable results for the self-consistent spike-train power spectrum. We compare our results to large-scale simulations of a random sparsely connected network of leaky integrate-and-fire neurons (Brunel, 2000) and show that in the asynchronous regime close to a state of balanced synaptic input from the network, our iterative schemes provide an excellent approximations to the autocorrelation of spike trains in the recurrent network.

A random access memory immune to single event upset using a T-Resistor

DOEpatents

Ochoa, A. Jr.

1987-10-28

In a random access memory cell, a resistance ''T'' decoupling network in each leg of the cell reduces random errors caused by the interaction of energetic ions with the semiconductor material forming the cell. The cell comprises two parallel legs each containing a series pair of complementary MOS transistors having a common gate connected to the node between the transistors of the opposite leg. The decoupling network in each leg is formed by a series pair of resistors between the transistors together with a third resistor interconnecting the junction between the pair of resistors and the gate of the transistor pair forming the opposite leg of the cell. 4 figs.

Random access memory immune to single event upset using a T-resistor

DOEpatents

Ochoa, Jr., Agustin

1989-01-01

In a random access memory cell, a resistance "T" decoupling network in each leg of the cell reduces random errors caused by the interaction of energetic ions with the semiconductor material forming the cell. The cell comprises two parallel legs each containing a series pair of complementary MOS transistors having a common gate connected to the node between the transistors of the opposite leg. The decoupling network in each leg is formed by a series pair of resistors between the transistors together with a third resistor interconnecting the junction between the pair of resistors and the gate of the transistor pair forming the opposite leg of the cell.

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

Sparsely-synchronized brain rhythm in a small-world neural network

NASA Astrophysics Data System (ADS)

Kim, Sang-Yoon; Lim, Woochang

2013-07-01

Sparsely-synchronized cortical rhythms, associated with diverse cognitive functions, have been observed in electric recordings of brain activity. At the population level, cortical rhythms exhibit small-amplitude fast oscillations while at the cellular level, individual neurons show stochastic firings sparsely at a much lower rate than the population rate. We study the effect of network architecture on sparse synchronization in an inhibitory population of subthreshold Morris-Lecar neurons (which cannot fire spontaneously without noise). Previously, sparse synchronization was found to occur for cases of both global coupling ( i.e., regular all-to-all coupling) and random coupling. However, a real neural network is known to be non-regular and non-random. Here, we consider sparse Watts-Strogatz small-world networks which interpolate between a regular lattice and a random graph via rewiring. We start from a regular lattice with only short-range connections and then investigate the emergence of sparse synchronization by increasing the rewiring probability p for the short-range connections. For p = 0, the average synaptic path length between pairs of neurons becomes long; hence, only an unsynchronized population state exists because the global efficiency of information transfer is low. However, as p is increased, long-range connections begin to appear, and global effective communication between distant neurons may be available via shorter synaptic paths. Consequently, as p passes a threshold p th (}~ 0.044), sparsely-synchronized population rhythms emerge. However, with increasing p, longer axon wirings become expensive because of their material and energy costs. At an optimal value p* DE (}~ 0.24) of the rewiring probability, the ratio of the synchrony degree to the wiring cost is found to become maximal. In this way, an optimal sparse synchronization is found to occur at a minimal wiring cost in an economic small-world network through trade-off between synchrony and wiring cost.

Estimates of Storage Capacity of Multilayer Perceptron with Threshold Logic Hidden Units.

PubMed

Kowalczyk, Adam

1997-11-01

We estimate the storage capacity of multilayer perceptron with n inputs, h(1) threshold logic units in the first hidden layer and 1 output. We show that if the network can memorize 50% of all dichotomies of a randomly selected N-tuple of points of R(n) with probability 1, then N

Experimental Study of Quantum Graphs with Microwave Networks

NASA Astrophysics Data System (ADS)

Fu, Ziyuan; Koch, Trystan; Antonsen, Thomas; Ott, Edward; Anlage, Steven; Wave Chaos Team

An experimental setup consisting of microwave networks is used to simulate quantum graphs. The networks are constructed from coaxial cables connected by T junctions. The networks are built for operation both at room temperature and superconducting versions that operate at cryogenic temperatures. In the experiments, a phase shifter is connected to one of the network bonds to generate an ensemble of quantum graphs by varying the phase delay. The eigenvalue spectrum is found from S-parameter measurements on one-port graphs. With the experimental data, the nearest-neighbor spacing statistics and the impedance statistics of the graphs are examined. It is also demonstrated that time-reversal invariance for microwave propagation in the graphs can be broken without increasing dissipation significantly by making nodes with circulators. Random matrix theory (RMT) successfully describes universal statistical properties of the system. We acknowledge support under contract AFOSR COE Grant FA9550-15-1-0171.

Neural-Network Simulator

NASA Technical Reports Server (NTRS)

Mitchell, Paul H.

1991-01-01

F77NNS (FORTRAN 77 Neural Network Simulator) computer program simulates popular back-error-propagation neural network. Designed to take advantage of vectorization when used on computers having this capability, also used on any computer equipped with ANSI-77 FORTRAN Compiler. Problems involving matching of patterns or mathematical modeling of systems fit class of problems F77NNS designed to solve. Program has restart capability so neural network solved in stages suitable to user's resources and desires. Enables user to customize patterns of connections between layers of network. Size of neural network F77NNS applied to limited only by amount of random-access memory available to user.

The CB1 Neutral Antagonist Tetrahydrocannabivarin Reduces Default Mode Network and Increases Executive Control Network Resting State Functional Connectivity in Healthy Volunteers.

PubMed

Rzepa, Ewelina; Tudge, Luke; McCabe, Ciara

2015-09-10

The cannabinoid cannabinoid type 1 (CB1) neutral antagonist tetrahydrocannabivarin (THCv) has been suggested as a possible treatment for obesity, but without the depressogenic side-effects of inverse antagonists such as Rimonabant. However, how THCv might affect the resting state functional connectivity of the human brain is as yet unknown. We examined the effects of a single 10mg oral dose of THCv and placebo in 20 healthy volunteers in a randomized, within-subject, double-blind design. Using resting state functional magnetic resonance imaging and seed-based connectivity analyses, we selected the amygdala, insula, orbitofrontal cortex, and dorsal medial prefrontal cortex (dmPFC) as regions of interest. Mood and subjective experience were also measured before and after drug administration using self-report scales. Our results revealed, as expected, no significant differences in the subjective experience with a single dose of THCv. However, we found reduced resting state functional connectivity between the amygdala seed region and the default mode network and increased resting state functional connectivity between the amygdala seed region and the dorsal anterior cingulate cortex and between the dmPFC seed region and the inferior frontal gyrus/medial frontal gyrus. We also found a positive correlation under placebo for the amygdala-precuneus connectivity with the body mass index, although this correlation was not apparent under THCv. Our findings are the first to show that treatment with the CB1 neutral antagonist THCv decreases resting state functional connectivity in the default mode network and increases connectivity in the cognitive control network and dorsal visual stream network. This effect profile suggests possible therapeutic activity of THCv for obesity, where functional connectivity has been found to be altered in these regions. © The Author 2015. Published by Oxford University Press on behalf of CINP.

A framework for analyzing contagion in assortative banking networks

PubMed Central

Hurd, Thomas R.; Gleeson, James P.; Melnik, Sergey

2017-01-01

We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (i.e., a tendency for small banks to link to large banks). We analyze default cascades triggered by shocking the network and find that the cascade can be understood as an explicit iterated mapping on a set of edge probabilities that converges to a fixed point. We derive a cascade condition, analogous to the basic reproduction number R0 in epidemic modelling, that characterizes whether or not a single initially defaulted bank can trigger a cascade that extends to a finite fraction of the infinite network. This cascade condition is an easily computed measure of the systemic risk inherent in a given banking network topology. We use percolation theory for random networks to derive a formula for the frequency of global cascades. These analytical results are shown to provide limited quantitative agreement with Monte Carlo simulation studies of finite-sized networks. We show that edge-assortativity, the propensity of nodes to connect to similar nodes, can have a strong effect on the level of systemic risk as measured by the cascade condition. However, the effect of assortativity on systemic risk is subtle, and we propose a simple graph theoretic quantity, which we call the graph-assortativity coefficient, that can be used to assess systemic risk. PMID:28231324

A framework for analyzing contagion in assortative banking networks.

PubMed

Hurd, Thomas R; Gleeson, James P; Melnik, Sergey

2017-01-01

We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (i.e., a tendency for small banks to link to large banks). We analyze default cascades triggered by shocking the network and find that the cascade can be understood as an explicit iterated mapping on a set of edge probabilities that converges to a fixed point. We derive a cascade condition, analogous to the basic reproduction number R0 in epidemic modelling, that characterizes whether or not a single initially defaulted bank can trigger a cascade that extends to a finite fraction of the infinite network. This cascade condition is an easily computed measure of the systemic risk inherent in a given banking network topology. We use percolation theory for random networks to derive a formula for the frequency of global cascades. These analytical results are shown to provide limited quantitative agreement with Monte Carlo simulation studies of finite-sized networks. We show that edge-assortativity, the propensity of nodes to connect to similar nodes, can have a strong effect on the level of systemic risk as measured by the cascade condition. However, the effect of assortativity on systemic risk is subtle, and we propose a simple graph theoretic quantity, which we call the graph-assortativity coefficient, that can be used to assess systemic risk.

Popularity versus similarity in growing networks.

PubMed

Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, M Ángeles; Boguñá, Marián; Krioukov, Dmitri

2012-09-27

The principle that 'popularity is attractive' underlies preferential attachment, which is a common explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting distribution of the number of connections possessed by nodes follows power laws, as observed in many real networks. Preferential attachment has been directly validated for some real networks (including the Internet), and can be a consequence of different underlying processes based on node fitness, ranking, optimization, random walks or duplication. Here we show that popularity is just one dimension of attractiveness; another dimension is similarity. We develop a framework in which new connections optimize certain trade-offs between popularity and similarity, instead of simply preferring popular nodes. The framework has a geometric interpretation in which popularity preference emerges from local optimization. As opposed to preferential attachment, our optimization framework accurately describes the large-scale evolution of technological (the Internet), social (trust relationships between people) and biological (Escherichia coli metabolic) networks, predicting the probability of new links with high precision. The framework that we have developed can thus be used for predicting new links in evolving networks, and provides a different perspective on preferential attachment as an emergent phenomenon.

Naming games in two-dimensional and small-world-connected random geometric networks.

PubMed

Lu, Qiming; Korniss, G; Szymanski, B K

2008-01-01

We investigate a prototypical agent-based model, the naming game, on two-dimensional random geometric networks. The naming game [Baronchelli, J. Stat. Mech.: Theory Exp. (2006) P06014] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the naming games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case.

Connecting to Young Adults: An Online Social Network Survey of Beliefs and Attitudes Associated With Prescription Opioid Misuse Among College Students

PubMed Central

Lord, Sarah; Brevard, Julie; Budman, Simon

2011-01-01

A survey of motives and attitudes associated with patterns of nonmedical prescription opioid medication use among college students was conducted on Facebook, a popular online social networking Web site. Response metrics for a 2-week random advertisement post, targeting students who had misused prescription medications, surpassed typical benchmarks for online marketing campaigns and yielded 527 valid surveys. Respondent characteristics, substance use patterns, and use motives were consistent with other surveys of prescription opioid use among college populations. Results support the potential of online social networks to serve as powerful vehicles to connect with college-aged populations about their drug use. Limitations of the study are noted. PMID:21190407

Non-criticality of interaction network over system's crises: A percolation analysis.

PubMed

Shirazi, Amir Hossein; Saberi, Abbas Ali; Hosseiny, Ali; Amirzadeh, Ehsan; Toranj Simin, Pourya

2017-11-20

Extraction of interaction networks from multi-variate time-series is one of the topics of broad interest in complex systems. Although this method has a wide range of applications, most of the previous analyses have focused on the pairwise relations. Here we establish the potential of such a method to elicit aggregated behavior of the system by making a connection with the concepts from percolation theory. We study the dynamical interaction networks of a financial market extracted from the correlation network of indices, and build a weighted network. In correspondence with the percolation model, we find that away from financial crises the interaction network behaves like a critical random network of Erdős-Rényi, while close to a financial crisis, our model deviates from the critical random network and behaves differently at different size scales. We perform further analysis to clarify that our observation is not a simple consequence of the growth in correlations over the crises.

Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks

PubMed Central

Piraveenan, Mahendra; Prokopenko, Mikhail; Hossain, Liaquat

2013-01-01

A number of centrality measures are available to determine the relative importance of a node in a complex network, and betweenness is prominent among them. However, the existing centrality measures are not adequate in network percolation scenarios (such as during infection transmission in a social network of individuals, spreading of computer viruses on computer networks, or transmission of disease over a network of towns) because they do not account for the changing percolation states of individual nodes. We propose a new measure, percolation centrality, that quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states. The measure can be extended to include random walk based definitions, and its computational complexity is shown to be of the same order as that of betweenness centrality. We demonstrate the usage of percolation centrality by applying it to a canonical network as well as simulated and real world scale-free and random networks. PMID:23349699

Brain activity and connectivity changes in response to glucose ingestion.

PubMed

van Opstal, A M; Hafkemeijer, A; van den Berg-Huysmans, A A; Hoeksma, M; Blonk, C; Pijl, H; Rombouts, S A R B; van der Grond, J

2018-05-27

The regulatory role of the brain in directing eating behavior becomes increasingly recognized. Although many areas in the brain have been found to respond to food cues, very little data is available after actual caloric intake. The aim of this study was to determine normal whole brain functional responses to ingestion of glucose after an overnight fast. Twenty-five normal weight, adult males underwent functional MRI on two separate visits. In a single-blind randomized study setup, participants received either glucose solution (50 g/300 ml of water) or plain water. We studied changes in Blood Oxygen Level Dependent (BOLD) signal, voxel-based connectivity by Eigenvector Centrality Mapping, and functional network connectivity. Ingestion of glucose led to increased centrality in the thalamus and to decreases in BOLD signal in various brain areas. Decreases in connectivity in the sensory-motor and dorsal visual stream networks were found. Ingestion of water resulted in increased centrality across the brain, and increases in connectivity in the medial and lateral visual cortex network. Increased BOLD intensity was found in the intracalcarine and cingulate cortex. Our data show that ingestion of glucose leads to decreased activity and connectivity in brain areas and networks linked to energy seeking and satiation. In contrast, drinking plain water leads to increased connectivity probably associated with continued food seeking and unfulfilled reward. Trail registration: This study combines data of two studies registered at clinicaltrails.gov under numbers NCT03202342 and NCT03247114.

Synchronised firing patterns in a random network of adaptive exponential integrate-and-fire neuron model.

PubMed

Borges, F S; Protachevicz, P R; Lameu, E L; Bonetti, R C; Iarosz, K C; Caldas, I L; Baptista, M S; Batista, A M

2017-06-01

We have studied neuronal synchronisation in a random network of adaptive exponential integrate-and-fire neurons. We study how spiking or bursting synchronous behaviour appears as a function of the coupling strength and the probability of connections, by constructing parameter spaces that identify these synchronous behaviours from measurements of the inter-spike interval and the calculation of the order parameter. Moreover, we verify the robustness of synchronisation by applying an external perturbation to each neuron. The simulations show that bursting synchronisation is more robust than spike synchronisation. Copyright © 2017 Elsevier Ltd. All rights reserved.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Dynamic Evolution with Limited Learning Information on a Small-World Network

NASA Astrophysics Data System (ADS)

Dong, Lin-Rong

2010-09-01

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

Understanding regulatory networks requires more than computing a multitude of graph statistics. Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O.C. Martin et al.

NASA Astrophysics Data System (ADS)

Tkačik, Gašper

2016-07-01

The article by O. Martin and colleagues provides a much needed systematic review of a body of work that relates the topological structure of genetic regulatory networks to evolutionary selection for function. This connection is very important. Using the current wealth of genomic data, statistical features of regulatory networks (e.g., degree distributions, motif composition, etc.) can be quantified rather easily; it is, however, often unclear how to interpret the results. On a graph theoretic level the statistical significance of the results can be evaluated by comparing observed graphs to ;randomized; ones (bravely ignoring the issue of how precisely to randomize!) and comparing the frequency of appearance of a particular network structure relative to a randomized null expectation. While this is a convenient operational test for statistical significance, its biological meaning is questionable. In contrast, an in-silico genotype-to-phenotype model makes explicit the assumptions about the network function, and thus clearly defines the expected network structures that can be compared to the case of no selection for function and, ultimately, to data.

Collective dynamics of 'small-world' networks.

PubMed

Watts, D J; Strogatz, S H

1998-06-04

Networks of coupled dynamical systems have been used to model biological oscillators, Josephson junction arrays, excitable media, neural networks, spatial games, genetic control networks and many other self-organizing systems. Ordinarily, the connection topology is assumed to be either completely regular or completely random. But many biological, technological and social networks lie somewhere between these two extremes. Here we explore simple models of networks that can be tuned through this middle ground: regular networks 'rewired' to introduce increasing amounts of disorder. We find that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. We call them 'small-world' networks, by analogy with the small-world phenomenon (popularly known as six degrees of separation. The neural network of the worm Caenorhabditis elegans, the power grid of the western United States, and the collaboration graph of film actors are shown to be small-world networks. Models of dynamical systems with small-world coupling display enhanced signal-propagation speed, computational power, and synchronizability. In particular, infectious diseases spread more easily in small-world networks than in regular lattices.

Spike phase synchronization in multiplex cortical neural networks

NASA Astrophysics Data System (ADS)

Jalili, Mahdi

2017-01-01

In this paper we study synchronizability of two multiplex cortical networks: whole-cortex of hermaphrodite C. elegans and posterior cortex in male C. elegans. These networks are composed of two connection layers: network of chemical synapses and the one formed by gap junctions. This work studies the contribution of each layer on the phase synchronization of non-identical spiking Hindmarsh-Rose neurons. The network of male C. elegans shows higher phase synchronization than its randomized version, while it is not the case for hermaphrodite type. The random networks in each layer are constructed such that the nodes have the same degree as the original network, thus providing an unbiased comparison. In male C. elegans, although the gap junction network is sparser than the chemical network, it shows higher contribution in the synchronization phenomenon. This is not the case in hermaphrodite type, which is mainly due to significant less density of gap junction layer (0.013) as compared to chemical layer (0.028). Also, the gap junction network in this type has stronger community structure than the chemical network, and this is another driving factor for its weaker synchronizability.

Spreading of infection in a two species reaction-diffusion process in networks

NASA Astrophysics Data System (ADS)

Korosoglou, Paschalis; Kittas, Aristotelis; Argyrakis, Panos

2010-12-01

We study the dynamics of the infection of a two mobile species reaction from a single infected agent in a population of healthy agents. Historically, the main focus for infection propagation has been through spreading phenomena, where a random location of the system is initially infected and then propagates by successfully infecting its neighbor sites. Here both the infected and healthy agents are mobile, performing classical random walks. This may be a more realistic picture to such epidemiological models, such as the spread of a virus in communication networks of routers, where data travel in packets, the communication time of stations in ad hoc mobile networks, information spreading (such as rumor spreading) in social networks, etc. We monitor the density of healthy particles ρ(t) , which we find in all cases to be an exponential function in the long-time limit in two-dimensional and three-dimensional lattices and Erdős-Rényi (ER) and scale-free (SF) networks. We also investigate the scaling of the crossover time tc from short- to long-time exponential behavior, which we find to be a power law in lattices and ER networks. This crossover is shown to be absent in SF networks, where we reveal the role of the connectivity of the network in the infection process. We compare this behavior to ER networks and lattices and highlight the significance of various connectivity patterns, as well as the important differences of this process in the various underlying geometries, revealing a more complex behavior of ρ(t) .

Effects of Ganglioside on Working Memory and the Default Mode Network in Individuals with Subjective Cognitive Impairment: A Randomized Controlled Trial.

PubMed

Jeon, Yujin; Kim, Binna; Kim, Jieun E; Kim, Bori R; Ban, Soonhyun; Jeong, Jee Hyang; Kwon, Oran; Rhie, Sandy Jeong; Ahn, Chang-Won; Kim, Jong-Hoon; Jung, Sung Ug; Park, Soo-Hyun; Lyoo, In Kyoon; Yoon, Sujung

2016-01-01

This randomized, double-blind, placebo-controlled trial examined whether the administration of ganglioside, an active ingredient of deer bone extract, can improve working memory performance by increasing gray matter volume and functional connectivity in the default mode network (DMN) in individuals with subjective cognitive impairment. Seventy-five individuals with subjective cognitive impairment were chosen to receive either ganglioside (330[Formula: see text][Formula: see text]g/day or 660[Formula: see text][Formula: see text]g/day) or a placebo for 8 weeks. Changes in working memory performance with treatment of either ganglioside or placebo were assessed as cognitive outcome measures. Using voxel-based morphometry and functional connectivity analyses, changes in gray matter volume and functional connectivity in the DMN were also assessed as brain outcome measures. Improvement in working memory performance was greater in the ganglioside group than in the placebo group. The ganglioside group, relative to the placebo group, showed greater increases in gray matter volume and functional connectivity in the DMN. A significant relationship between increased functional connectivity of the precuneus and improved working memory performance was observed in the ganglioside group. The current findings suggest that ganglioside has cognitive-enhancing effects in individuals with subjective cognitive impairment. Ganglioside-induced increases in gray matter volume and functional connectivity in the DMN may partly be responsible for the potential nootropic effects of ganglioside. The clinical trial was registered with ClinicalTrials.gov (identifier: NCT02379481).

White Matter Microstructural Correlates of Superior Long-term Skill Gained Implicitly under Randomized Practice

PubMed Central

Song, Sunbin; Sharma, Nikhil; Buch, Ethan R.

2012-01-01

We value skills we have learned intentionally, but equally important are skills acquired incidentally without ability to describe how or what is learned, referred to as implicit. Randomized practice schedules are superior to grouped schedules for long-term skill gained intentionally, but its relevance for implicit learning is not known. In a parallel design, we studied healthy subjects who learned a motor sequence implicitly under randomized or grouped practice schedule and obtained diffusion-weighted images to identify white matter microstructural correlates of long-term skill. Randomized practice led to superior long-term skill compared with grouped practice. Whole-brain analyses relating interindividual variability in fractional anisotropy (FA) to long-term skill demonstrated that 1) skill in randomized learners correlated with FA within the corticostriatal tract connecting left sensorimotor cortex to posterior putamen, while 2) skill in grouped learners correlated with FA within the right forceps minor connecting homologous regions of the prefrontal cortex (PFC) and the corticostriatal tract connecting lateral PFC to anterior putamen. These results demonstrate first that randomized practice schedules improve long-term implicit skill more than grouped practice schedules and, second, that the superior skill acquired through randomized practice can be related to white matter microstructure in the sensorimotor corticostriatal network. PMID:21914632

Passive advection-dispersion in networks of pipes: Effect of connectivity and relationship to permeability

NASA Astrophysics Data System (ADS)

Bernabé, Y.; Wang, Y.; Qi, T.; Li, M.

2016-02-01

The main purpose of this work is to investigate the relationship between passive advection-dispersion and permeability in porous materials presumed to be statistically homogeneous at scales larger than the pore scale but smaller than the reservoir scale. We simulated fluid flow through pipe network realizations with different pipe radius distributions and different levels of connectivity. The flow simulations used periodic boundary conditions, allowing monitoring of the advective motion of solute particles in a large periodic array of identical network realizations. In order to simulate dispersion, we assumed that the solute particles obeyed Taylor dispersion in individual pipes. When a particle entered a pipe, a residence time consistent with local Taylor dispersion was randomly assigned to it. When exiting the pipe, the particle randomly proceeded into one of the pipes connected to the original one according to probabilities proportional to the outgoing volumetric flow in each pipe. For each simulation we tracked the motion of at least 6000 solute particles. The mean fluid velocity was 10-3 ms-1, and the distance traveled was on the order of 10 m. Macroscopic dispersion was quantified using the method of moments. Despite differences arising from using different types of lattices (simple cubic, body-centered cubic, and face-centered cubic), a number of general observations were made. Longitudinal dispersion was at least 1 order of magnitude greater than transverse dispersion, and both strongly increased with decreasing pore connectivity and/or pore size variability. In conditions of variable hydraulic radius and fixed pore connectivity and pore size variability, the simulated dispersivities increased as power laws of the hydraulic radius and, consequently, of permeability, in agreement with previously published experimental results. Based on these observations, we were able to resolve some of the complexity of the relationship between dispersivity and permeability.

Neurobiologically realistic determinants of self-organized criticality in networks of spiking neurons.

PubMed

Rubinov, Mikail; Sporns, Olaf; Thivierge, Jean-Philippe; Breakspear, Michael

2011-06-01

Self-organized criticality refers to the spontaneous emergence of self-similar dynamics in complex systems poised between order and randomness. The presence of self-organized critical dynamics in the brain is theoretically appealing and is supported by recent neurophysiological studies. Despite this, the neurobiological determinants of these dynamics have not been previously sought. Here, we systematically examined the influence of such determinants in hierarchically modular networks of leaky integrate-and-fire neurons with spike-timing-dependent synaptic plasticity and axonal conduction delays. We characterized emergent dynamics in our networks by distributions of active neuronal ensemble modules (neuronal avalanches) and rigorously assessed these distributions for power-law scaling. We found that spike-timing-dependent synaptic plasticity enabled a rapid phase transition from random subcritical dynamics to ordered supercritical dynamics. Importantly, modular connectivity and low wiring cost broadened this transition, and enabled a regime indicative of self-organized criticality. The regime only occurred when modular connectivity, low wiring cost and synaptic plasticity were simultaneously present, and the regime was most evident when between-module connection density scaled as a power-law. The regime was robust to variations in other neurobiologically relevant parameters and favored systems with low external drive and strong internal interactions. Increases in system size and connectivity facilitated internal interactions, permitting reductions in external drive and facilitating convergence of postsynaptic-response magnitude and synaptic-plasticity learning rate parameter values towards neurobiologically realistic levels. We hence infer a novel association between self-organized critical neuronal dynamics and several neurobiologically realistic features of structural connectivity. The central role of these features in our model may reflect their importance for neuronal information processing.

Fisher information at the edge of chaos in random Boolean networks.

PubMed

Wang, X Rosalind; Lizier, Joseph T; Prokopenko, Mikhail

2011-01-01

We study the order-chaos phase transition in random Boolean networks (RBNs), which have been used as models of gene regulatory networks. In particular we seek to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity). Fisher information, which measures how much system dynamics can reveal about the control parameters, offers a natural interpretation of the phase diagram in RBNs. We report that this measure is maximized near the order-chaos phase transitions in RBNs, since this is the region where the system is most sensitive to its parameters. Furthermore, we use this study of RBNs to clarify the relationship between Shannon and Fisher information measures.

Using Individualized Brain Network for Analyzing Structural Covariance of the Cerebral Cortex in Alzheimer's Patients.

PubMed

Kim, Hee-Jong; Shin, Jeong-Hyeon; Han, Cheol E; Kim, Hee Jin; Na, Duk L; Seo, Sang Won; Seong, Joon-Kyung

2016-01-01

Cortical thinning patterns in Alzheimer's disease (AD) have been widely reported through conventional regional analysis. In addition, the coordinated variance of cortical thickness in different brain regions has been investigated both at the individual and group network levels. In this study, we aim to investigate network architectural characteristics of a structural covariance network (SCN) in AD, and further to show that the structural covariance connectivity becomes disorganized across the brain regions in AD, while the normal control (NC) subjects maintain more clustered and consistent coordination in cortical atrophy variations. We generated SCNs directly from T1-weighted MR images of individual patients using surface-based cortical thickness data, with structural connectivity defined as similarity in cortical thickness within different brain regions. Individual SCNs were constructed using morphometric data from the Samsung Medical Center (SMC) dataset. The structural covariance connectivity showed higher clustering than randomly generated networks, as well as similar minimum path lengths, indicating that the SCNs are "small world." There were significant difference between NC and AD group in characteristic path lengths (z = -2.97, p < 0.01) and small-worldness values (z = 4.05, p < 0.01). Clustering coefficients in AD was smaller than that of NC but there was no significant difference (z = 1.81, not significant). We further observed that the AD patients had significantly disrupted structural connectivity. We also show that the coordinated variance of cortical thickness is distributed more randomly from one region to other regions in AD patients when compared to NC subjects. Our proposed SCN may provide surface-based measures for understanding interaction between two brain regions with co-atrophy of the cerebral cortex due to normal aging or AD. We applied our method to the AD Neuroimaging Initiative (ADNI) data to show consistency in results with the SMC dataset.

Network-based model of the growth of termite nests

NASA Astrophysics Data System (ADS)

Eom, Young-Ho; Perna, Andrea; Fortunato, Santo; Darrouzet, Eric; Theraulaz, Guy; Jost, Christian

2015-12-01

We present a model for the growth of the transportation network inside nests of the social insect subfamily Termitinae (Isoptera, termitidae). These nests consist of large chambers (nodes) connected by tunnels (edges). The model based on the empirical analysis of the real nest networks combined with pruning (edge removal, either random or weighted by betweenness centrality) and a memory effect (preferential growth from the latest added chambers) successfully predicts emergent nest properties (degree distribution, size of the largest connected component, average path lengths, backbone link ratios, and local graph redundancy). The two pruning alternatives can be associated with different genuses in the subfamily. A sensitivity analysis on the pruning and memory parameters indicates that Termitinae networks favor fast internal transportation over efficient defense strategies against ant predators. Our results provide an example of how complex network organization and efficient network properties can be generated from simple building rules based on local interactions and contribute to our understanding of the mechanisms that come into play for the formation of termite networks and of biological transportation networks in general.

Cascading failures mechanism based on betweenness-degree ratio distribution with different connecting preferences

NASA Astrophysics Data System (ADS)

Wang, Xiao Juan; Guo, Shi Ze; Jin, Lei; Chen, Mo

We study the structural robustness of the scale free network against the cascading failure induced by overload. In this paper, a failure mechanism based on betweenness-degree ratio distribution is proposed. In the cascading failure model we built the initial load of an edge which is proportional to the node betweenness of its ends. During the edge random deletion, we find a phase transition. Then based on the phase transition, we divide the process of the cascading failure into two parts: the robust area and the vulnerable area, and define the corresponding indicator to measure the performance of the networks in both areas. From derivation, we find that the vulnerability of the network is determined by the distribution of betweenness-degree ratio. After that we use the connection between the node ability coefficient and distribution of betweenness-degree ratio to explain the cascading failure mechanism. In simulations, we verify the correctness of our derivations. By changing connecting preferences, we find scale free networks with a slight assortativity, which performs better both in robust area and vulnerable area.

Resting-state theta-band connectivity and verbal memory in schizophrenia and in the high-risk state.

PubMed

Andreou, Christina; Leicht, Gregor; Nolte, Guido; Polomac, Nenad; Moritz, Steffen; Karow, Anne; Hanganu-Opatz, Ileana L; Engel, Andreas K; Mulert, Christoph

2015-02-01

Disturbed functional connectivity is assumed to underlie neurocognitive deficits in patients with schizophrenia. As neurocognitive deficits are already present in the high-risk state, identification of the neural networks involved in this core feature of schizophrenia is essential to our understanding of the disorder. Resting-state studies enable such investigations, while at the same time avoiding the known confounder of impaired task performance in patients. The aim of the present study was to investigate EEG resting-state connectivity in high-risk individuals (HR) compared to first episode patients with schizophrenia (SZ) and to healthy controls (HC), and its association with cognitive deficits. 64-channel resting-state EEG recordings (eyes closed) were obtained for 28 HR, 19 stable SZ, and 23 HC, matched for age, education, and parental education. The imaginary coherence-based multivariate interaction measure (MIM) was used as a measure of connectivity across 80 cortical regions and six frequency bands. Mean connectivity at each region was compared across groups using the non-parametric randomization approach. Additionally, the network-based statistic was applied to identify affected networks in patients. SZ displayed increased theta-band resting-state MIM connectivity across midline, sensorimotor, orbitofrontal regions and the left temporoparietal junction. HR displayed intermediate theta-band connectivity patterns that did not differ from either SZ or HC. Mean theta-band connectivity within the above network partially mediated verbal memory deficits in SZ and HR. Aberrant theta-band connectivity may represent a trait characteristic of schizophrenia associated with neurocognitive deficits. As such, it might constitute a promising target for novel treatment applications. Copyright © 2014 Elsevier B.V. All rights reserved.

Properties of networks with partially structured and partially random connectivity

NASA Astrophysics Data System (ADS)

Ahmadian, Yashar; Fumarola, Francesco; Miller, Kenneth D.

2015-01-01

Networks studied in many disciplines, including neuroscience and mathematical biology, have connectivity that may be stochastic about some underlying mean connectivity represented by a non-normal matrix. Furthermore, the stochasticity may not be independent and identically distributed (iid) across elements of the connectivity matrix. More generally, the problem of understanding the behavior of stochastic matrices with nontrivial mean structure and correlations arises in many settings. We address this by characterizing large random N ×N matrices of the form A =M +L J R , where M ,L , and R are arbitrary deterministic matrices and J is a random matrix of zero-mean iid elements. M can be non-normal, and L and R allow correlations that have separable dependence on row and column indices. We first provide a general formula for the eigenvalue density of A . For A non-normal, the eigenvalues do not suffice to specify the dynamics induced by A , so we also provide general formulas for the transient evolution of the magnitude of activity and frequency power spectrum in an N -dimensional linear dynamical system with a coupling matrix given by A . These quantities can also be thought of as characterizing the stability and the magnitude of the linear response of a nonlinear network to small perturbations about a fixed point. We derive these formulas and work them out analytically for some examples of M ,L , and R motivated by neurobiological models. We also argue that the persistence as N →∞ of a finite number of randomly distributed outlying eigenvalues outside the support of the eigenvalue density of A , as previously observed, arises in regions of the complex plane Ω where there are nonzero singular values of L-1(z 1 -M ) R-1 (for z ∈Ω ) that vanish as N →∞ . When such singular values do not exist and L and R are equal to the identity, there is a correspondence in the normalized Frobenius norm (but not in the operator norm) between the support of the spectrum of A for J of norm σ and the σ pseudospectrum of M .

A small-world network model of facial emotion recognition.

PubMed

Takehara, Takuma; Ochiai, Fumio; Suzuki, Naoto

2016-01-01

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

Prediction of protein tertiary structure from sequences using a very large back-propagation neural network

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

Liu, X.; Wilcox, G.L.

1993-12-31

We have implemented large scale back-propagation neural networks on a 544 node Connection Machine, CM-5, using the C language in MIMD mode. The program running on 512 processors performs backpropagation learning at 0.53 Gflops, which provides 76 million connection updates per second. We have applied the network to the prediction of protein tertiary structure from sequence information alone. A neural network with one hidden layer and 40 million connections is trained to learn the relationship between sequence and tertiary structure. The trained network yields predicted structures of some proteins on which it has not been trained given only their sequences.more » Presentation of the Fourier transform of the sequences accentuates periodicity in the sequence and yields good generalization with greatly increased training efficiency. Training simulations with a large, heterologous set of protein structures (111 proteins from CM-5 time) to solutions with under 2% RMS residual error within the training set (random responses give an RMS error of about 20%). Presentation of 15 sequences of related proteins in a testing set of 24 proteins yields predicted structures with less than 8% RMS residual error, indicating good apparent generalization.« less

Recognizing pedestrian's unsafe behaviors in far-infrared imagery at night

NASA Astrophysics Data System (ADS)

Lee, Eun Ju; Ko, Byoung Chul; Nam, Jae-Yeal

2016-05-01

Pedestrian behavior recognition is important work for early accident prevention in advanced driver assistance system (ADAS). In particular, because most pedestrian-vehicle crashes are occurred from late of night to early of dawn, our study focus on recognizing unsafe behavior of pedestrians using thermal image captured from moving vehicle at night. For recognizing unsafe behavior, this study uses convolutional neural network (CNN) which shows high quality of recognition performance. However, because traditional CNN requires the very expensive training time and memory, we design the light CNN consisted of two convolutional layers and two subsampling layers for real-time processing of vehicle applications. In addition, we combine light CNN with boosted random forest (Boosted RF) classifier so that the output of CNN is not fully connected with the classifier but randomly connected with Boosted random forest. We named this CNN as randomly connected CNN (RC-CNN). The proposed method was successfully applied to the pedestrian unsafe behavior (PUB) dataset captured from far-infrared camera at night and its behavior recognition accuracy is confirmed to be higher than that of some algorithms related to CNNs, with a shorter processing time.

Self Healing Percolation

NASA Astrophysics Data System (ADS)

Scala, Antonio

2015-03-01

We introduce the concept of self-healing in the field of complex networks modelling; in particular, self-healing capabilities are implemented through distributed communication protocols that exploit redundant links to recover the connectivity of the system. Self-healing is a crucial in implementing the next generation of smart grids allowing to ensure a high quality of service to the users. We then map our self-healing procedure in a percolation problem and analyse the interplay between redundancies and topology in improving the resilience of networked infrastructures to multiple failures. We find exact results both for planar lattices and for random lattices, hinting the role of duality in the design of resilient networks. Finally, we introduce a cavity method approach to study the recovery of connectivity after damage in self-healing networks. CNR-PNR National Project ``Crisis-Lab,'' EU HOME/2013/CIPS/AG/4000005013 project CI2C and EU FET project MULTIPLEX nr.317532.

Mutualism supports biodiversity when the direct competition is weak

PubMed Central

Pascual-García, Alberto; Bastolla, Ugo

2017-01-01

A key question of theoretical ecology is which properties of ecosystems favour their stability and help maintaining biodiversity. This question recently reconsidered mutualistic systems, generating intense controversy about the role of mutualistic interactions and their network architecture. Here we show analytically and verify with simulations that reducing the effective interspecific competition and the propagation of perturbations positively influences structural stability against environmental perturbations, enhancing persistence. Noteworthy, mutualism reduces the effective interspecific competition only when the direct interspecific competition is weaker than a critical value. This critical competition is in almost all cases larger in pollinator networks than in random networks with the same connectance. Highly connected mutualistic networks reduce the propagation of environmental perturbations, a mechanism reminiscent of MacArthur’s proposal that ecosystem complexity enhances stability. Our analytic framework rationalizes previous contradictory results, and it gives valuable insight on the complex relationship between mutualism and biodiversity. PMID:28232740

On the capacity of ternary Hebbian networks

NASA Technical Reports Server (NTRS)

Baram, Yoram

1991-01-01

Networks of ternary neurons storing random vectors over the set -1,0,1 by the so-called Hebbian rule are considered. It is shown that the maximal number of stored patterns that are equilibrium states of the network with probability tending to one as N tends to infinity is at least on the order of (N exp 2-1/alpha)/K, where N is the number of neurons, K is the number of nonzero elements in a pattern, and t = alpha x K, alpha between 1/2 and 1, is the threshold in the neuron function. While, for small K, this bound is similar to that obtained for fully connected binary networks, the number of interneural connections required in the ternary case is considerably smaller. Similar bounds, incorporating error probabilities, are shown to guarantee, in the same probabilistic sense, the correction of errors in the nonzero elements and in the location of these elements.

Navigability of Random Geometric Graphs in the Universe and Other Spacetimes.

PubMed

Cunningham, William; Zuev, Konstantin; Krioukov, Dmitri

2017-08-18

Random geometric graphs in hyperbolic spaces explain many common structural and dynamical properties of real networks, yet they fail to predict the correct values of the exponents of power-law degree distributions observed in real networks. In that respect, random geometric graphs in asymptotically de Sitter spacetimes, such as the Lorentzian spacetime of our accelerating universe, are more attractive as their predictions are more consistent with observations in real networks. Yet another important property of hyperbolic graphs is their navigability, and it remains unclear if de Sitter graphs are as navigable as hyperbolic ones. Here we study the navigability of random geometric graphs in three Lorentzian manifolds corresponding to universes filled only with dark energy (de Sitter spacetime), only with matter, and with a mixture of dark energy and matter. We find these graphs are navigable only in the manifolds with dark energy. This result implies that, in terms of navigability, random geometric graphs in asymptotically de Sitter spacetimes are as good as random hyperbolic graphs. It also establishes a connection between the presence of dark energy and navigability of the discretized causal structure of spacetime, which provides a basis for a different approach to the dark energy problem in cosmology.

Shortcomings with Tree-Structured Edge Encodings for Neural Networks

NASA Technical Reports Server (NTRS)

Hornby, Gregory S.

2004-01-01

In evolutionary algorithms a common method for encoding neural networks is to use a tree structured assembly procedure for constructing them. Since node operators have difficulties in specifying edge weights and these operators are execution-order dependent, an alternative is to use edge operators. Here we identify three problems with edge operators: in the initialization phase most randomly created genotypes produce an incorrect number of inputs and outputs; variation operators can easily change the number of input/output (I/O) units; and units have a connectivity bias based on their order of creation. Instead of creating I/O nodes as part of the construction process we propose using parameterized operators to connect to preexisting I/O units. Results from experiments show that these parameterized operators greatly improve the probability of creating and maintaining networks with the correct number of I/O units, remove the connectivity bias with I/O units and produce better controllers for a goal-scoring task.

Graph fission in an evolving voter model

PubMed Central

Durrett, Richard; Gleeson, James P.; Lloyd, Alun L.; Mucha, Peter J.; Shi, Feng; Sivakoff, David; Socolar, Joshua E. S.; Varghese, Chris

2012-01-01

We consider a simplified model of a social network in which individuals have one of two opinions (called 0 and 1) and their opinions and the network connections coevolve. Edges are picked at random. If the two connected individuals hold different opinions then, with probability 1 - α, one imitates the opinion of the other; otherwise (i.e., with probability α), the link between them is broken and one of them makes a new connection to an individual chosen at random (i) from those with the same opinion or (ii) from the network as a whole. The evolution of the system stops when there are no longer any discordant edges connecting individuals with different opinions. Letting ρ be the fraction of voters holding the minority opinion after the evolution stops, we are interested in how ρ depends on α and the initial fraction u of voters with opinion 1. In case (i), there is a critical value αc which does not depend on u, with ρ ≈ u for α > αc and ρ ≈ 0 for α < αc. In case (ii), the transition point αc(u) depends on the initial density u. For α > αc(u), ρ ≈ u, but for α < αc(u), we have ρ(α,u) = ρ(α,1/2). Using simulations and approximate calculations, we explain why these two nearly identical models have such dramatically different phase transitions. PMID:22355142

Early Development of Functional Network Segregation Revealed by Connectomic Analysis of the Preterm Human Brain.

PubMed

Cao, Miao; He, Yong; Dai, Zhengjia; Liao, Xuhong; Jeon, Tina; Ouyang, Minhui; Chalak, Lina; Bi, Yanchao; Rollins, Nancy; Dong, Qi; Huang, Hao

2017-03-01

Human brain functional networks are topologically organized with nontrivial connectivity characteristics such as small-worldness and densely linked hubs to support highly segregated and integrated information processing. However, how they emerge and change at very early developmental phases remains poorly understood. Here, we used resting-state functional MRI and voxel-based graph theory analysis to systematically investigate the topological organization of whole-brain networks in 40 infants aged around 31 to 42 postmenstrual weeks. The functional connectivity strength and heterogeneity increased significantly in primary motor, somatosensory, visual, and auditory regions, but much less in high-order default-mode and executive-control regions. The hub and rich-club structures in primary regions were already present at around 31 postmenstrual weeks and exhibited remarkable expansions with age, accompanied by increased local clustering and shortest path length, indicating a transition from a relatively random to a more organized configuration. Moreover, multivariate pattern analysis using support vector regression revealed that individual brain maturity of preterm babies could be predicted by the network connectivity patterns. Collectively, we highlighted a gradually enhanced functional network segregation manner in the third trimester, which is primarily driven by the rapid increases of functional connectivity of the primary regions, providing crucial insights into the topological development patterns prior to birth. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Model for disease dynamics of a waterborne pathogen on a random network.

PubMed

Li, Meili; Ma, Junling; van den Driessche, P

2015-10-01

A network epidemic SIWR model for cholera and other diseases that can be transmitted via the environment is developed and analyzed. The person-to-person contacts are modeled by a random contact network, and the contagious environment is modeled by an external node that connects to every individual. The model is adapted from the Miller network SIR model, and in the homogeneous mixing limit becomes the Tien and Earn deterministic cholera model without births and deaths. The dynamics of our model shows excellent agreement with stochastic simulations. The basic reproduction number [Formula: see text] is computed, and on a Poisson network shown to be the sum of the basic reproduction numbers of the person-to-person and person-to-water-to-person transmission pathways. However, on other networks, [Formula: see text] depends nonlinearly on the transmission along the two pathways. Type reproduction numbers are computed and quantify measures to control the disease. Equations giving the final epidemic size are obtained.

Estimation of effective connectivity using multi-layer perceptron artificial neural network.

PubMed

Talebi, Nasibeh; Nasrabadi, Ali Motie; Mohammad-Rezazadeh, Iman

2018-02-01

Studies on interactions between brain regions estimate effective connectivity, (usually) based on the causality inferences made on the basis of temporal precedence. In this study, the causal relationship is modeled by a multi-layer perceptron feed-forward artificial neural network, because of the ANN's ability to generate appropriate input-output mapping and to learn from training examples without the need of detailed knowledge of the underlying system. At any time instant, the past samples of data are placed in the network input, and the subsequent values are predicted at its output. To estimate the strength of interactions, the measure of " Causality coefficient " is defined based on the network structure, the connecting weights and the parameters of hidden layer activation function. Simulation analysis demonstrates that the method, called "CREANN" (Causal Relationship Estimation by Artificial Neural Network), can estimate time-invariant and time-varying effective connectivity in terms of MVAR coefficients. The method shows robustness with respect to noise level of data. Furthermore, the estimations are not significantly influenced by the model order (considered time-lag), and the different initial conditions (initial random weights and parameters of the network). CREANN is also applied to EEG data collected during a memory recognition task. The results implicate that it can show changes in the information flow between brain regions, involving in the episodic memory retrieval process. These convincing results emphasize that CREANN can be used as an appropriate method to estimate the causal relationship among brain signals.

Suppressing epidemics on networks by exploiting observer nodes.

PubMed

Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

2014-07-01

To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Suppressing epidemics on networks by exploiting observer nodes

NASA Astrophysics Data System (ADS)

Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

2014-07-01

To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

A genotype network reveals homoplastic cycles of convergent evolution in influenza A (H3N2) haemagglutinin.

PubMed

Wagner, Andreas

2014-07-07

Networks of evolving genotypes can be constructed from the worldwide time-resolved genotyping of pathogens like influenza viruses. Such genotype networks are graphs where neighbouring vertices (viral strains) differ in a single nucleotide or amino acid. A rich trove of network analysis methods can help understand the evolutionary dynamics reflected in the structure of these networks. Here, I analyse a genotype network comprising hundreds of influenza A (H3N2) haemagglutinin genes. The network is rife with cycles that reflect non-random parallel or convergent (homoplastic) evolution. These cycles also show patterns of sequence change characteristic for strong and local evolutionary constraints, positive selection and mutation-limited evolution. Such cycles would not be visible on a phylogenetic tree, illustrating that genotype network analysis can complement phylogenetic analyses. The network also shows a distinct modular or community structure that reflects temporal more than spatial proximity of viral strains, where lowly connected bridge strains connect different modules. These and other organizational patterns illustrate that genotype networks can help us study evolution in action at an unprecedented level of resolution. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Greedy Gossip With Eavesdropping

NASA Astrophysics Data System (ADS)

Ustebay, Deniz; Oreshkin, Boris N.; Coates, Mark J.; Rabbat, Michael G.

2010-07-01

This paper presents greedy gossip with eavesdropping (GGE), a novel randomized gossip algorithm for distributed computation of the average consensus problem. In gossip algorithms, nodes in the network randomly communicate with their neighbors and exchange information iteratively. The algorithms are simple and decentralized, making them attractive for wireless network applications. In general, gossip algorithms are robust to unreliable wireless conditions and time varying network topologies. In this paper we introduce GGE and demonstrate that greedy updates lead to rapid convergence. We do not require nodes to have any location information. Instead, greedy updates are made possible by exploiting the broadcast nature of wireless communications. During the operation of GGE, when a node decides to gossip, instead of choosing one of its neighbors at random, it makes a greedy selection, choosing the node which has the value most different from its own. In order to make this selection, nodes need to know their neighbors' values. Therefore, we assume that all transmissions are wireless broadcasts and nodes keep track of their neighbors' values by eavesdropping on their communications. We show that the convergence of GGE is guaranteed for connected network topologies. We also study the rates of convergence and illustrate, through theoretical bounds and numerical simulations, that GGE consistently outperforms randomized gossip and performs comparably to geographic gossip on moderate-sized random geometric graph topologies.

The robustness of multiplex networks under layer node-based attack

PubMed Central

Zhao, Da-wei; Wang, Lian-hai; Zhi, Yong-feng; Zhang, Jun; Wang, Zhen

2016-01-01

From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers. Network robustness, as one of the most successful application areas of complex networks, has attracted great interest in a myriad of research realms. In this regard, how multiplex networks respond to potential attack is still an open issue. Here we study the robustness of multiplex networks under layer node-based random or targeted attack, which means that nodes just suffer attacks in a given layer yet no additional influence to their connections beyond this layer. A theoretical analysis framework is proposed to calculate the critical threshold and the size of giant component of multiplex networks when nodes are removed randomly or intentionally. Via numerous simulations, it is unveiled that the theoretical method can accurately predict the threshold and the size of giant component, irrespective of attack strategies. Moreover, we also compare the robustness of multiplex networks under multiplex node-based attack and layer node-based attack, and find that layer node-based attack makes multiplex networks more vulnerable, regardless of average degree and underlying topology. PMID:27075870

The robustness of multiplex networks under layer node-based attack.

PubMed

Zhao, Da-wei; Wang, Lian-hai; Zhi, Yong-feng; Zhang, Jun; Wang, Zhen

2016-04-14

From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers. Network robustness, as one of the most successful application areas of complex networks, has attracted great interest in a myriad of research realms. In this regard, how multiplex networks respond to potential attack is still an open issue. Here we study the robustness of multiplex networks under layer node-based random or targeted attack, which means that nodes just suffer attacks in a given layer yet no additional influence to their connections beyond this layer. A theoretical analysis framework is proposed to calculate the critical threshold and the size of giant component of multiplex networks when nodes are removed randomly or intentionally. Via numerous simulations, it is unveiled that the theoretical method can accurately predict the threshold and the size of giant component, irrespective of attack strategies. Moreover, we also compare the robustness of multiplex networks under multiplex node-based attack and layer node-based attack, and find that layer node-based attack makes multiplex networks more vulnerable, regardless of average degree and underlying topology.

Evidence for Transcript Networks Composed of Chimeric RNAs in Human Cells

PubMed Central

Borel, Christelle; Mudge, Jonathan M.; Howald, Cédric; Foissac, Sylvain; Ucla, Catherine; Chrast, Jacqueline; Ribeca, Paolo; Martin, David; Murray, Ryan R.; Yang, Xinping; Ghamsari, Lila; Lin, Chenwei; Bell, Ian; Dumais, Erica; Drenkow, Jorg; Tress, Michael L.; Gelpí, Josep Lluís; Orozco, Modesto; Valencia, Alfonso; van Berkum, Nynke L.; Lajoie, Bryan R.; Vidal, Marc; Stamatoyannopoulos, John; Batut, Philippe; Dobin, Alex; Harrow, Jennifer; Hubbard, Tim; Dekker, Job; Frankish, Adam; Salehi-Ashtiani, Kourosh; Reymond, Alexandre; Antonarakis, Stylianos E.; Guigó, Roderic; Gingeras, Thomas R.

2012-01-01

The classic organization of a gene structure has followed the Jacob and Monod bacterial gene model proposed more than 50 years ago. Since then, empirical determinations of the complexity of the transcriptomes found in yeast to human has blurred the definition and physical boundaries of genes. Using multiple analysis approaches we have characterized individual gene boundaries mapping on human chromosomes 21 and 22. Analyses of the locations of the 5′ and 3′ transcriptional termini of 492 protein coding genes revealed that for 85% of these genes the boundaries extend beyond the current annotated termini, most often connecting with exons of transcripts from other well annotated genes. The biological and evolutionary importance of these chimeric transcripts is underscored by (1) the non-random interconnections of genes involved, (2) the greater phylogenetic depth of the genes involved in many chimeric interactions, (3) the coordination of the expression of connected genes and (4) the close in vivo and three dimensional proximity of the genomic regions being transcribed and contributing to parts of the chimeric RNAs. The non-random nature of the connection of the genes involved suggest that chimeric transcripts should not be studied in isolation, but together, as an RNA network. PMID:22238572

Modeling structure and resilience of the dark network.

PubMed

De Domenico, Manlio; Arenas, Alex

2017-02-01

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

Analysis of the error of the developed method of determination the active conductivity reducing the insulation level between one phase of the network and ground, and insulation parameters in a non-symmetric network with isolated neutral with voltage above 1000 V

NASA Astrophysics Data System (ADS)

Utegulov, B. B.

2018-02-01

In the work the study of the developed method was carried out for reliability by analyzing the error in indirect determination of the insulation parameters in an asymmetric network with an isolated neutral voltage above 1000 V. The conducted studies of the random relative mean square errors show that the accuracy of indirect measurements in the developed method can be effectively regulated not only by selecting a capacitive additional conductivity, which are connected between phases of the electrical network and the ground, but also by the selection of measuring instruments according to the accuracy class. When choosing meters with accuracy class of 0.5 with the correct selection of capacitive additional conductivity that are connected between the phases of the electrical network and the ground, the errors in measuring the insulation parameters will not exceed 10%.

Modeling structure and resilience of the dark network

NASA Astrophysics Data System (ADS)

De Domenico, Manlio; Arenas, Alex

2017-02-01

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

BRAPH: A graph theory software for the analysis of brain connectivity

PubMed Central

Mijalkov, Mite; Kakaei, Ehsan; Pereira, Joana B.; Westman, Eric; Volpe, Giovanni

2017-01-01

The brain is a large-scale complex network whose workings rely on the interaction between its various regions. In the past few years, the organization of the human brain network has been studied extensively using concepts from graph theory, where the brain is represented as a set of nodes connected by edges. This representation of the brain as a connectome can be used to assess important measures that reflect its topological architecture. We have developed a freeware MatLab-based software (BRAPH–BRain Analysis using graPH theory) for connectivity analysis of brain networks derived from structural magnetic resonance imaging (MRI), functional MRI (fMRI), positron emission tomography (PET) and electroencephalogram (EEG) data. BRAPH allows building connectivity matrices, calculating global and local network measures, performing non-parametric permutations for group comparisons, assessing the modules in the network, and comparing the results to random networks. By contrast to other toolboxes, it allows performing longitudinal comparisons of the same patients across different points in time. Furthermore, even though a user-friendly interface is provided, the architecture of the program is modular (object-oriented) so that it can be easily expanded and customized. To demonstrate the abilities of BRAPH, we performed structural and functional graph theory analyses in two separate studies. In the first study, using MRI data, we assessed the differences in global and nodal network topology in healthy controls, patients with amnestic mild cognitive impairment, and patients with Alzheimer’s disease. In the second study, using resting-state fMRI data, we compared healthy controls and Parkinson’s patients with mild cognitive impairment. PMID:28763447

BRAPH: A graph theory software for the analysis of brain connectivity.

PubMed

Mijalkov, Mite; Kakaei, Ehsan; Pereira, Joana B; Westman, Eric; Volpe, Giovanni

2017-01-01

The brain is a large-scale complex network whose workings rely on the interaction between its various regions. In the past few years, the organization of the human brain network has been studied extensively using concepts from graph theory, where the brain is represented as a set of nodes connected by edges. This representation of the brain as a connectome can be used to assess important measures that reflect its topological architecture. We have developed a freeware MatLab-based software (BRAPH-BRain Analysis using graPH theory) for connectivity analysis of brain networks derived from structural magnetic resonance imaging (MRI), functional MRI (fMRI), positron emission tomography (PET) and electroencephalogram (EEG) data. BRAPH allows building connectivity matrices, calculating global and local network measures, performing non-parametric permutations for group comparisons, assessing the modules in the network, and comparing the results to random networks. By contrast to other toolboxes, it allows performing longitudinal comparisons of the same patients across different points in time. Furthermore, even though a user-friendly interface is provided, the architecture of the program is modular (object-oriented) so that it can be easily expanded and customized. To demonstrate the abilities of BRAPH, we performed structural and functional graph theory analyses in two separate studies. In the first study, using MRI data, we assessed the differences in global and nodal network topology in healthy controls, patients with amnestic mild cognitive impairment, and patients with Alzheimer's disease. In the second study, using resting-state fMRI data, we compared healthy controls and Parkinson's patients with mild cognitive impairment.

Connectomics and neuroticism: an altered functional network organization.

PubMed

Servaas, Michelle N; Geerligs, Linda; Renken, Remco J; Marsman, Jan-Bernard C; Ormel, Johan; Riese, Harriëtte; Aleman, André

2015-01-01

The personality trait neuroticism is a potent risk marker for psychopathology. Although the neurobiological basis remains unclear, studies have suggested that alterations in connectivity may underlie it. Therefore, the aim of the current study was to shed more light on the functional network organization in neuroticism. To this end, we applied graph theory on resting-state functional magnetic resonance imaging (fMRI) data in 120 women selected based on their neuroticism score. Binary and weighted brain-wide graphs were constructed to examine changes in the functional network structure and functional connectivity strength. Furthermore, graphs were partitioned into modules to specifically investigate connectivity within and between functional subnetworks related to emotion processing and cognitive control. Subsequently, complex network measures (ie, efficiency and modularity) were calculated on the brain-wide graphs and modules, and correlated with neuroticism scores. Compared with low neurotic individuals, high neurotic individuals exhibited a whole-brain network structure resembling more that of a random network and had overall weaker functional connections. Furthermore, in these high neurotic individuals, functional subnetworks could be delineated less clearly and the majority of these subnetworks showed lower efficiency, while the affective subnetwork showed higher efficiency. In addition, the cingulo-operculum subnetwork demonstrated more ties with other functional subnetworks in association with neuroticism. In conclusion, the 'neurotic brain' has a less than optimal functional network organization and shows signs of functional disconnectivity. Moreover, in high compared with low neurotic individuals, emotion and salience subnetworks have a more prominent role in the information exchange, while sensory(-motor) and cognitive control subnetworks have a less prominent role.

Epidemic Threshold in Structured Scale-Free Networks

NASA Astrophysics Data System (ADS)

EguíLuz, VíCtor M.; Klemm, Konstantin

2002-08-01

We analyze the spreading of viruses in scale-free networks with high clustering and degree correlations, as found in the Internet graph. For the susceptible-infected-susceptible model of epidemics the prevalence undergoes a phase transition at a finite threshold of the transmission probability. Comparing with the absence of a finite threshold in networks with purely random wiring, our result suggests that high clustering (modularity) and degree correlations protect scale-free networks against the spreading of viruses. We introduce and verify a quantitative description of the epidemic threshold based on the connectivity of the neighborhoods of the hubs.

The community structure of the global corporate network.

PubMed

Vitali, Stefania; Battiston, Stefano

2014-01-01

We investigate the community structure of the global ownership network of transnational corporations. We find a pronounced organization in communities that cannot be explained by randomness. Despite the global character of this network, communities reflect first of all the geographical location of firms, while the industrial sector plays only a marginal role. We also analyze the meta-network in which the nodes are the communities and the links are obtained by aggregating the links among firms belonging to pairs of communities. We analyze the network centrality of the top 50 communities and we provide a quantitative assessment of the financial sector role in connecting the global economy.

Robustness of networks formed from interdependent correlated networks under intentional attacks

NASA Astrophysics Data System (ADS)

Liu, Long; Meng, Ke; Dong, Zhaoyang

2018-02-01

We study the problem of intentional attacks targeting to interdependent networks generated with known degree distribution (in-degree oriented model) or distribution of interlinks (out-degree oriented model). In both models, each node's degree is correlated with the number of its links that connect to the other network. For both models, varying the correlation coefficient has a significant effect on the robustness of a system undergoing random attacks or attacks targeting nodes with low degree. For a system with an assortative relationship between in-degree and out-degree, reducing the broadness of networks' degree distributions can increase the resistance of systems against intentional attacks.

The Community Structure of the Global Corporate Network

PubMed Central

Vitali, Stefania; Battiston, Stefano

2014-01-01

We investigate the community structure of the global ownership network of transnational corporations. We find a pronounced organization in communities that cannot be explained by randomness. Despite the global character of this network, communities reflect first of all the geographical location of firms, while the industrial sector plays only a marginal role. We also analyze the meta-network in which the nodes are the communities and the links are obtained by aggregating the links among firms belonging to pairs of communities. We analyze the network centrality of the top 50 communities and we provide a quantitative assessment of the financial sector role in connecting the global economy. PMID:25126722

A descriptive model of resting-state networks using Markov chains.

PubMed

Xie, H; Pal, R; Mitra, S

2016-08-01

Resting-state functional connectivity (RSFC) studies considering pairwise linear correlations have attracted great interests while the underlying functional network structure still remains poorly understood. To further our understanding of RSFC, this paper presents an analysis of the resting-state networks (RSNs) based on the steady-state distributions and provides a novel angle to investigate the RSFC of multiple functional nodes. This paper evaluates the consistency of two networks based on the Hellinger distance between the steady-state distributions of the inferred Markov chain models. The results show that generated steady-state distributions of default mode network have higher consistency across subjects than random nodes from various RSNs.

An agenda-based routing protocol in delay tolerant mobile sensor networks.

PubMed

Wang, Xiao-Min; Zhu, Jin-Qi; Liu, Ming; Gong, Hai-Gang

2010-01-01

Routing in delay tolerant mobile sensor networks (DTMSNs) is challenging due to the networks' intermittent connectivity. Most existing routing protocols for DTMSNs use simplistic random mobility models for algorithm design and performance evaluation. In the real world, however, due to the unique characteristics of human mobility, currently existing random mobility models may not work well in environments where mobile sensor units are carried (such as DTMSNs). Taking a person's social activities into consideration, in this paper, we seek to improve DTMSN routing in terms of social structure and propose an agenda based routing protocol (ARP). In ARP, humans are classified based on their agendas and data transmission is made according to sensor nodes' transmission rankings. The effectiveness of ARP is demonstrated through comprehensive simulation studies.

Dendritic growth model of multilevel marketing

NASA Astrophysics Data System (ADS)

Pang, James Christopher S.; Monterola, Christopher P.

2017-02-01

Biologically inspired dendritic network growth is utilized to model the evolving connections of a multilevel marketing (MLM) enterprise. Starting from agents at random spatial locations, a network is formed by minimizing a distance cost function controlled by a parameter, termed the balancing factor bf, that weighs the wiring and the path length costs of connection. The paradigm is compared to an actual MLM membership data and is shown to be successful in statistically capturing the membership distribution, better than the previously reported agent based preferential attachment or analytic branching process models. Moreover, it recovers the known empirical statistics of previously studied MLM, specifically: (i) a membership distribution characterized by the existence of peak levels indicating limited growth, and (ii) an income distribution obeying the 80 - 20 Pareto principle. Extensive types of income distributions from uniform to Pareto to a "winner-take-all" kind are also modeled by varying bf. Finally, the robustness of our dendritic growth paradigm to random agent removals is explored and its implications to MLM income distributions are discussed.

Massive-scale gene co-expression network construction and robustness testing using random matrix theory.

PubMed

Gibson, Scott M; Ficklin, Stephen P; Isaacson, Sven; Luo, Feng; Feltus, Frank A; Smith, Melissa C

2013-01-01

The study of gene relationships and their effect on biological function and phenotype is a focal point in systems biology. Gene co-expression networks built using microarray expression profiles are one technique for discovering and interpreting gene relationships. A knowledge-independent thresholding technique, such as Random Matrix Theory (RMT), is useful for identifying meaningful relationships. Highly connected genes in the thresholded network are then grouped into modules that provide insight into their collective functionality. While it has been shown that co-expression networks are biologically relevant, it has not been determined to what extent any given network is functionally robust given perturbations in the input sample set. For such a test, hundreds of networks are needed and hence a tool to rapidly construct these networks. To examine functional robustness of networks with varying input, we enhanced an existing RMT implementation for improved scalability and tested functional robustness of human (Homo sapiens), rice (Oryza sativa) and budding yeast (Saccharomyces cerevisiae). We demonstrate dramatic decrease in network construction time and computational requirements and show that despite some variation in global properties between networks, functional similarity remains high. Moreover, the biological function captured by co-expression networks thresholded by RMT is highly robust.

On the mixing time of geographical threshold graphs

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

Bradonjic, Milan

In this paper, we study the mixing time of random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Wemore » specifically study the mixing times of random walks on 2-dimensional GTGs near the connectivity threshold. We provide a set of criteria on the distribution of vertex weights that guarantees that the mixing time is {Theta}(n log n).« less

A scheme for synchronizing clocks connected by a packet communication network

NASA Astrophysics Data System (ADS)

dos Santos, R. V.; Monteiro, L. H. A.

2012-07-01

Consider a communication system in which a transmitter equipment sends fixed-size packets of data at a uniform rate to a receiver equipment. Consider also that these equipments are connected by a packet-switched network, which introduces a random delay to each packet. Here we propose an adaptive clock recovery scheme able of synchronizing the frequencies and the phases of these devices, within specified limits of precision. This scheme for achieving frequency and phase synchronization is based on measurements of the packet arrival times at the receiver, which are used to control the dynamics of a digital phase-locked loop. The scheme performance is evaluated via numerical simulations performed by using realistic parameter values.

Stochastic Modeling of Sediment Connectivity for Reconstructing Sand Fluxes and Origins in the Unmonitored Se Kong, Se San, and Sre Pok Tributaries of the Mekong River

NASA Astrophysics Data System (ADS)

Schmitt, R. J. P.; Bizzi, S.; Castelletti, A. F.; Kondolf, G. M.

2018-01-01

Sediment supply to rivers, subsequent fluvial transport, and the resulting sediment connectivity on network scales are often sparsely monitored and subject to major uncertainty. We propose to approach that uncertainty by adopting a stochastic method for modeling network sediment connectivity, which we present for the Se Kong, Se San, and Sre Pok (3S) tributaries of the Mekong. We quantify how unknown properties of sand sources translate into uncertainty regarding network connectivity by running the CASCADE (CAtchment Sediment Connectivity And DElivery) modeling framework in a Monte Carlo approach for 7,500 random realizations. Only a small ensemble of realizations reproduces downstream observations of sand transport. This ensemble presents an inverse stochastic approximation of the magnitude and variability of transport capacity, sediment flux, and grain size distribution of the sediment transported in the network (i.e., upscaling point observations to the entire network). The approximated magnitude of sand delivered from each tributary to the Mekong is controlled by reaches of low transport capacity ("bottlenecks"). These bottlenecks limit the ability to predict transport in the upper parts of the catchment through inverse stochastic approximation, a limitation that could be addressed by targeted monitoring upstream of identified bottlenecks. Nonetheless, bottlenecks also allow a clear partitioning of natural sand deliveries from the 3S to the Mekong, with the Se Kong delivering less (1.9 Mt/yr) and coarser (median grain size: 0.4 mm) sand than the Se San (5.3 Mt/yr, 0.22 mm) and Sre Pok (11 Mt/yr, 0.19 mm).

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

Distinctive Structural and Effective Connectivity Changes of Semantic Cognition Network across Left and Right Mesial Temporal Lobe Epilepsy Patients.

PubMed

Fan, Xiaotong; Yan, Hao; Shan, Yi; Shang, Kun; Wang, Xiaocui; Wang, Peipei; Shan, Yongzhi; Lu, Jie; Zhao, Guoguang

2016-01-01

Occurrence of language impairment in mesial temporal lobe epilepsy (mTLE) patients is common and left mTLE patients always exhibit a primary problem with access to names. To explore different neuropsychological profiles between left and right mTLE patients, the study investigated both structural and effective functional connectivity changes within the semantic cognition network between these two groups and those from normal controls. We found that gray matter atrophy of left mTLE patients was more severe than that of right mTLE patients in the whole brain and especially within the semantic cognition network in their contralateral hemisphere. It suggested that seizure attacks were rather targeted than random for patients with hippocampal sclerosis (HS) in the dominant hemisphere. Functional connectivity analysis during resting state fMRI revealed that subregions of the anterior temporal lobe (ATL) in the left HS patients were no longer effectively connected. Further, we found that, unlike in right HS patients, increased causal linking between ipsilateral regions in the left HS epilepsy patients cannot make up for their decreased contralateral interaction. It suggested that weakened contralateral connection and disrupted effective interaction between subregions of the unitary, transmodal hub of the ATL may be the primary cause of anomia in the left HS patients.

Distinctive Structural and Effective Connectivity Changes of Semantic Cognition Network across Left and Right Mesial Temporal Lobe Epilepsy Patients

PubMed Central

Fan, Xiaotong; Shang, Kun; Wang, Xiaocui; Wang, Peipei; Shan, Yongzhi; Lu, Jie

2016-01-01

Occurrence of language impairment in mesial temporal lobe epilepsy (mTLE) patients is common and left mTLE patients always exhibit a primary problem with access to names. To explore different neuropsychological profiles between left and right mTLE patients, the study investigated both structural and effective functional connectivity changes within the semantic cognition network between these two groups and those from normal controls. We found that gray matter atrophy of left mTLE patients was more severe than that of right mTLE patients in the whole brain and especially within the semantic cognition network in their contralateral hemisphere. It suggested that seizure attacks were rather targeted than random for patients with hippocampal sclerosis (HS) in the dominant hemisphere. Functional connectivity analysis during resting state fMRI revealed that subregions of the anterior temporal lobe (ATL) in the left HS patients were no longer effectively connected. Further, we found that, unlike in right HS patients, increased causal linking between ipsilateral regions in the left HS epilepsy patients cannot make up for their decreased contralateral interaction. It suggested that weakened contralateral connection and disrupted effective interaction between subregions of the unitary, transmodal hub of the ATL may be the primary cause of anomia in the left HS patients. PMID:28018680

Network analysis reveals disrupted functional brain circuitry in drug-naive social anxiety disorder.

PubMed

Yang, Xun; Liu, Jin; Meng, Yajing; Xia, Mingrui; Cui, Zaixu; Wu, Xi; Hu, Xinyu; Zhang, Wei; Gong, Gaolang; Gong, Qiyong; Sweeney, John A; He, Yong

2017-12-07

Social anxiety disorder (SAD) is a common and disabling condition characterized by excessive fear and avoidance of public scrutiny. Psychoradiology studies have suggested that the emotional and behavior deficits in SAD are associated with abnormalities in regional brain function and functional connectivity. However, little is known about whether intrinsic functional brain networks in patients with SAD are topologically disrupted. Here, we collected resting-state fMRI data from 33 drug-naive patients with SAD and 32 healthy controls (HC), constructed functional networks with 34 predefined regions based on previous meta-analytic research with task-based fMRI in SAD, and performed network-based statistic and graph-theory analyses. The network-based statistic analysis revealed a single connected abnormal circuitry including the frontolimbic circuit (termed the "fear circuit", including the dorsolateral prefrontal cortex, ventral medial prefrontal cortex and insula) and posterior cingulate/occipital areas supporting perceptual processing. In this single altered network, patients with SAD had higher functional connectivity than HC. At the global level, graph-theory analysis revealed that the patients exhibited a lower normalized characteristic path length than HC, which suggests a disorder-related shift of network topology toward randomized configurations. SAD-related deficits in nodal degree, efficiency and participation coefficient were detected in the parahippocampal gyrus, posterior cingulate cortex, dorsolateral prefrontal cortex, insula and the calcarine sulcus. Aspects of abnormal connectivity were associated with anxiety symptoms. These findings highlight the aberrant topological organization of functional brain network organization in SAD, which provides insights into the neural mechanisms underlying excessive fear and avoidance of social interactions in patients with debilitating social anxiety. Copyright © 2017. Published by Elsevier Inc.

Asynchronous Communication Scheme For Hypercube Computer

NASA Technical Reports Server (NTRS)

Madan, Herb S.

1988-01-01

Scheme devised for asynchronous-message communication system for Mark III hypercube concurrent-processor network. Network consists of up to 1,024 processing elements connected electrically as though were at corners of 10-dimensional cube. Each node contains two Motorola 68020 processors along with Motorola 68881 floating-point processor utilizing up to 4 megabytes of shared dynamic random-access memory. Scheme intended to support applications requiring passage of both polled or solicited and unsolicited messages.

Simulation of Consensus Model of Deffuant et al. on a BARABÁSI-ALBERT Network

NASA Astrophysics Data System (ADS)

Stauffer, D.; Meyer-Ortmanns, H.

In the consensus model with bounded confidence, studied by Deffuant et al. (2000), two randomly selected people who differ not too much in their opinion both shift their opinions towards each other. Now we restrict this exchange of information to people connected by a scale-free network. As a result, the number of different final opinions (when no complete consensus is formed) is proportional to the number of people.

Experimental demonstration of the optical multi-mesh hypercube: scaleable interconnection network for multiprocessors and multicomputers.

PubMed

Louri, A; Furlonge, S; Neocleous, C

1996-12-10

A prototype of a novel topology for scaleable optical interconnection networks called the optical multi-mesh hypercube (OMMH) is experimentally demonstrated to as high as a 150-Mbit/s data rate (2(7) - 1 nonreturn-to-zero pseudo-random data pattern) at a bit error rate of 10(-13)/link by the use of commercially available devices. OMMH is a scaleable network [Appl. Opt. 33, 7558 (1994); J. Lightwave Technol. 12, 704 (1994)] architecture that combines the positive features of the hypercube (small diameter, connectivity, symmetry, simple routing, and fault tolerance) and the mesh (constant node degree and size scaleability). The optical implementation method is divided into two levels: high-density local connections for the hypercube modules, and high-bit-rate, low-density, long connections for the mesh links connecting the hypercube modules. Free-space imaging systems utilizing vertical-cavity surface-emitting laser (VCSEL) arrays, lenslet arrays, space-invariant holographic techniques, and photodiode arrays are demonstrated for the local connections. Optobus fiber interconnects from Motorola are used for the long-distance connections. The OMMH was optimized to operate at the data rate of Motorola's Optobus (10-bit-wide, VCSEL-based bidirectional data interconnects at 150 Mbits/s). Difficulties encountered included the varying fan-out efficiencies of the different orders of the hologram, misalignment sensitivity of the free-space links, low power (1 mW) of the individual VCSEL's, and noise.

Emergence of encounter networks due to human mobility.

PubMed

Riascos, A P; Mateos, José L

2017-01-01

There is a burst of work on human mobility and encounter networks. However, the connection between these two important fields just begun recently. It is clear that both are closely related: Mobility generates encounters, and these encounters might give rise to contagion phenomena or even friendship. We model a set of random walkers that visit locations in space following a strategy akin to Lévy flights. We measure the encounters in space and time and establish a link between walkers after they coincide several times. This generates a temporal network that is characterized by global quantities. We compare this dynamics with real data for two cities: New York City and Tokyo. We use data from the location-based social network Foursquare and obtain the emergent temporal encounter network, for these two cities, that we compare with our model. We found long-range (Lévy-like) distributions for traveled distances and time intervals that characterize the emergent social network due to human mobility. Studying this connection is important for several fields like epidemics, social influence, voting, contagion models, behavioral adoption and diffusion of ideas.

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

NASA Astrophysics Data System (ADS)

Türker, İlker

2018-05-01

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

Evidence for dynamically organized modularity in the yeast protein-protein interaction network

NASA Astrophysics Data System (ADS)

Han, Jing-Dong J.; Bertin, Nicolas; Hao, Tong; Goldberg, Debra S.; Berriz, Gabriel F.; Zhang, Lan V.; Dupuy, Denis; Walhout, Albertha J. M.; Cusick, Michael E.; Roth, Frederick P.; Vidal, Marc

2004-07-01

In apparently scale-free protein-protein interaction networks, or `interactome' networks, most proteins interact with few partners, whereas a small but significant proportion of proteins, the `hubs', interact with many partners. Both biological and non-biological scale-free networks are particularly resistant to random node removal but are extremely sensitive to the targeted removal of hubs. A link between the potential scale-free topology of interactome networks and genetic robustness seems to exist, because knockouts of yeast genes encoding hubs are approximately threefold more likely to confer lethality than those of non-hubs. Here we investigate how hubs might contribute to robustness and other cellular properties for protein-protein interactions dynamically regulated both in time and in space. We uncovered two types of hub: `party' hubs, which interact with most of their partners simultaneously, and `date' hubs, which bind their different partners at different times or locations. Both in silico studies of network connectivity and genetic interactions described in vivo support a model of organized modularity in which date hubs organize the proteome, connecting biological processes-or modules -to each other, whereas party hubs function inside modules.

Effect of resource constraints on intersimilar coupled networks.

PubMed

Shai, S; Dobson, S

2012-12-01

Most real-world networks do not live in isolation but are often coupled together within a larger system. Recent studies have shown that intersimilarity between coupled networks increases the connectivity of the overall system. However, unlike connected nodes in a single network, coupled nodes often share resources, like time, energy, and memory, which can impede flow processes through contention when intersimilarly coupled. We study a model of a constrained susceptible-infected-recovered (SIR) process on a system consisting of two random networks sharing the same set of nodes, where nodes are limited to interact with (and therefore infect) a maximum number of neighbors at each epidemic time step. We obtain that, in agreement with previous studies, when no limit exists (regular SIR model), positively correlated (intersimilar) coupling results in a lower epidemic threshold than negatively correlated (interdissimilar) coupling. However, in the case of the constrained SIR model, the obtained epidemic threshold is lower with negatively correlated coupling. The latter finding differentiates our work from previous studies and provides another step towards revealing the qualitative differences between single and coupled networks.

Effect of resource constraints on intersimilar coupled networks

NASA Astrophysics Data System (ADS)

Shai, S.; Dobson, S.

2012-12-01

Most real-world networks do not live in isolation but are often coupled together within a larger system. Recent studies have shown that intersimilarity between coupled networks increases the connectivity of the overall system. However, unlike connected nodes in a single network, coupled nodes often share resources, like time, energy, and memory, which can impede flow processes through contention when intersimilarly coupled. We study a model of a constrained susceptible-infected-recovered (SIR) process on a system consisting of two random networks sharing the same set of nodes, where nodes are limited to interact with (and therefore infect) a maximum number of neighbors at each epidemic time step. We obtain that, in agreement with previous studies, when no limit exists (regular SIR model), positively correlated (intersimilar) coupling results in a lower epidemic threshold than negatively correlated (interdissimilar) coupling. However, in the case of the constrained SIR model, the obtained epidemic threshold is lower with negatively correlated coupling. The latter finding differentiates our work from previous studies and provides another step towards revealing the qualitative differences between single and coupled networks.

In-silico studies of neutral drift for functional protein interaction networks

NASA Astrophysics Data System (ADS)

Ali, Md Zulfikar; Wingreen, Ned S.; Mukhopadhyay, Ranjan

We have developed a minimal physically-motivated model of protein-protein interaction networks. Our system consists of two classes of enzymes, activators (e.g. kinases) and deactivators (e.g. phosphatases), and the enzyme-mediated activation/deactivation rates are determined by sequence-dependent binding strengths between enzymes and their targets. The network is evolved by introducing random point mutations in the binding sequences where we assume that each new mutation is either fixed or entirely lost. We apply this model to studies of neutral drift in networks that yield oscillatory dynamics, where we start, for example, with a relatively simple network and allow it to evolve by adding nodes and connections while requiring that dynamics be conserved. Our studies demonstrate both the importance of employing a sequence-based evolutionary scheme and the relative rapidity (in evolutionary time) for the redistribution of function over new nodes via neutral drift. Surprisingly, in addition to this redistribution time we discovered another much slower timescale for network evolution, reflecting hidden order in sequence space that we interpret in terms of sparsely connected domains.

Functional Connectivity Evidence of Cortico-Cortico Inhibition in Temporal Lobe Epilepsy

PubMed Central

Tracy, Joseph I.; Osipowicz, Karol; Spechler, Philip; Sharan, Ashwini; Skidmore, Christopher; Doucet, Gaelle; Sperling, Michael R.

2012-01-01

Epileptic seizures can initiate a neural circuit and lead to aberrant neural communication with brain areas outside the epileptogenic region. We focus on interictal activity in focal temporal lobe epilepsy and evaluate functional connectivity differences that emerge as function of bilateral versus strictly unilateral epileptiform activity. We assess the strength of functional connectivity at rest between the ictal and non-ictal temporal lobes, in addition to whole brain connectivity with the ictal temporal lobe. Results revealed strong connectivity between the temporal lobes for both patient groups, but this did not vary as a function of unilateral versus bilateral interictal status. Both the left and right unilateral temporal lobe groups showed significant anti-correlated activity in regions outside the epileptogenic temporal lobe, primarily involving the contralateral (non-ictal/non-pathologic) hemisphere, with precuneus involvement prominent. The bilateral groups did not show this contralateral anti-correlated activity. This anti-correlated connectivity may represent a form of protective and adaptive inhibition, helping to constrain epileptiform activity to the pathologic temporal lobe. The absence of this activity in the bilateral groups may be indicative of flawed inhibitory mechanisms, helping to explain their more widespread epileptiform activity. Our data suggest that the location and build up of epilepsy networks in the brain are not truly random, and are not limited to the formation of strictly epileptogenic networks. Functional networks may develop to take advantage of the regulatory function of structures such as the precuneus to instantiate an anti-correlated network, generating protective cortico-cortico inhibition for the purpose of limiting seizure spread or epileptogenesis. PMID:22987774

Age-Related Decline in the Variation of Dynamic Functional Connectivity: A Resting State Analysis.

PubMed

Chen, Yuanyuan; Wang, Weiwei; Zhao, Xin; Sha, Miao; Liu, Ya'nan; Zhang, Xiong; Ma, Jianguo; Ni, Hongyan; Ming, Dong

2017-01-01

Normal aging is typically characterized by abnormal resting-state functional connectivity (FC), including decreasing connectivity within networks and increasing connectivity between networks, under the assumption that the FC over the scan time was stationary. In fact, the resting-state FC has been shown in recent years to vary over time even within minutes, thus showing the great potential of intrinsic interactions and organization of the brain. In this article, we assumed that the dynamic FC consisted of an intrinsic dynamic balance in the resting brain and was altered with increasing age. Two groups of individuals ( N = 36, ages 20-25 for the young group; N = 32, ages 60-85 for the senior group) were recruited from the public data of the Nathan Kline Institute. Phase randomization was first used to examine the reliability of the dynamic FC. Next, the variation in the dynamic FC and the energy ratio of the dynamic FC fluctuations within a higher frequency band were calculated and further checked for differences between groups by non-parametric permutation tests. The results robustly showed modularization of the dynamic FC variation, which declined with aging; moreover, the FC variation of the inter-network connections, which mainly consisted of the frontal-parietal network-associated and occipital-associated connections, decreased. In addition, a higher energy ratio in the higher FC fluctuation frequency band was observed in the senior group, which indicated the frequency interactions in the FC fluctuations. These results highly supported the basis of abnormality and compensation in the aging brain and might provide new insights into both aging and relevant compensatory mechanisms.

Rescue of endemic states in interconnected networks with adaptive coupling

NASA Astrophysics Data System (ADS)

Vazquez, F.; Serrano, M. Ángeles; Miguel, M. San

2016-07-01

We study the Susceptible-Infected-Susceptible model of epidemic spreading on two layers of networks interconnected by adaptive links, which are rewired at random to avoid contacts between infected and susceptible nodes at the interlayer. We find that the rewiring reduces the effective connectivity for the transmission of the disease between layers, and may even totally decouple the networks. Weak endemic states, in which the epidemics spreads when the two layers are interconnected but not in each layer separately, show a transition from the endemic to the healthy phase when the rewiring overcomes a threshold value that depends on the infection rate, the strength of the coupling and the mean connectivity of the networks. In the strong endemic scenario, in which the epidemics is able to spread on each separate network -and therefore on the interconnected system- the prevalence in each layer decreases when increasing the rewiring, arriving to single network values only in the limit of infinitely fast rewiring. We also find that rewiring amplifies finite-size effects, preventing the disease transmission between finite networks, as there is a non zero probability that the epidemics stays confined in only one network during its lifetime.

A host-endoparasite network of Neotropical marine fish: are there organizational patterns?

PubMed

Bellay, Sybelle; Lima, Dilermando P; Takemoto, Ricardo M; Luque, José L

2011-12-01

Properties of ecological networks facilitate the understanding of interaction patterns in host-parasite systems as well as the importance of each species in the interaction structure of a community. The present study evaluates the network structure, functional role of all species and patterns of parasite co-occurrence in a host-parasite network to determine the organization level of a host-parasite system consisting of 170 taxa of gastrointestinal metazoans of 39 marine fish species on the coast of Brazil. The network proved to be nested and modular, with a low degree of connectance. Host-parasite interactions were influenced by host phylogeny. Randomness in parasite co-occurrence was observed in most modules and component communities, although species segregation patterns were also observed. The low degree of connectance in the network may be the cause of properties such as nestedness and modularity, which indicate the presence of a high number of peripheral species. Segregation patterns among parasite species in modules underscore the role of host specificity. Knowledge of ecological networks allows detection of keystone species for the maintenance of biodiversity and the conduction of further studies on the stability of networks in relation to frequent environmental changes.

Rescue of endemic states in interconnected networks with adaptive coupling

PubMed Central

Vazquez, F.; Serrano, M. Ángeles; Miguel, M. San

2016-01-01

We study the Susceptible-Infected-Susceptible model of epidemic spreading on two layers of networks interconnected by adaptive links, which are rewired at random to avoid contacts between infected and susceptible nodes at the interlayer. We find that the rewiring reduces the effective connectivity for the transmission of the disease between layers, and may even totally decouple the networks. Weak endemic states, in which the epidemics spreads when the two layers are interconnected but not in each layer separately, show a transition from the endemic to the healthy phase when the rewiring overcomes a threshold value that depends on the infection rate, the strength of the coupling and the mean connectivity of the networks. In the strong endemic scenario, in which the epidemics is able to spread on each separate network –and therefore on the interconnected system– the prevalence in each layer decreases when increasing the rewiring, arriving to single network values only in the limit of infinitely fast rewiring. We also find that rewiring amplifies finite-size effects, preventing the disease transmission between finite networks, as there is a non zero probability that the epidemics stays confined in only one network during its lifetime. PMID:27380771

Experimental evolution of protein–protein interaction networks

PubMed Central

Kaçar, Betül; Gaucher, Eric A.

2013-01-01

The modern synthesis of evolutionary theory and genetics has enabled us to discover underlying molecular mechanisms of organismal evolution. We know that in order to maximize an organism's fitness in a particular environment, individual interactions among components of protein and nucleic acid networks need to be optimized by natural selection, or sometimes through random processes, as the organism responds to changes and/or challenges in the environment. Despite the significant role of molecular networks in determining an organism's adaptation to its environment, we still do not know how such inter- and intra-molecular interactions within networks change over time and contribute to an organism's evolvability while maintaining overall network functions. One way to address this challenge is to identify connections between molecular networks and their host organisms, to manipulate these connections, and then attempt to understand how such perturbations influence molecular dynamics of the network and thus influence evolutionary paths and organismal fitness. In the present review, we discuss how integrating evolutionary history with experimental systems that combine tools drawn from molecular evolution, synthetic biology and biochemistry allow us to identify the underlying mechanisms of organismal evolution, particularly from the perspective of protein interaction networks. PMID:23849056

Structural and functional connectivity underlying grey matter covariance: impact of developmental insult.

PubMed

Paquola, Casey; Bennett, Maxwell; Lagopoulos, Jim

2018-05-15

Structural covariance networks (SCNs) may offer unique insights into the developmental impact of childhood maltreatment because they are thought to reflect coordinated maturation of distinct grey matter regions. T1-weighted magnetic resonance images were acquired from 121 young people with emerging mental illness. Diffusion weighted and resting state functional imaging was also acquired from a random subset of the participants (n=62). Ten study-specific SCNs were identified using a whole brain grey matter independent component analysis. The effects of childhood maltreatment and age on average grey matter density and the expression of each SCN were calculated. Childhood maltreatment was linked to age-related decreases in grey matter density across a SCN that overlapped with the default mode and fronto-parietal networks. Resting state functional connectivity and structural connectivity were calculated in the study-specific SCN and across the whole brain. Grey matter covariance was significantly correlated with rsFC across the SCN, and rsFC fully mediated the relationship between grey matter covariance and structural connectivity in the non-maltreated group. A unique association of grey matter covariance with structural connectivity was detected amongst individuals with a history of childhood maltreatment. Perturbation of grey matter development across the default mode and fronto-parietal networks following childhood maltreatment may have significant implications for mental well-being, given the networks' roles in self-referential activity. Cross-modal comparisons suggest reduced grey matter following childhood maltreatment could arise from deficient functional activity earlier in life.

Synaptic Scaling in Combination with Many Generic Plasticity Mechanisms Stabilizes Circuit Connectivity

PubMed Central

Tetzlaff, Christian; Kolodziejski, Christoph; Timme, Marc; Wörgötter, Florentin

2011-01-01

Synaptic scaling is a slow process that modifies synapses, keeping the firing rate of neural circuits in specific regimes. Together with other processes, such as conventional synaptic plasticity in the form of long term depression and potentiation, synaptic scaling changes the synaptic patterns in a network, ensuring diverse, functionally relevant, stable, and input-dependent connectivity. How synaptic patterns are generated and stabilized, however, is largely unknown. Here we formally describe and analyze synaptic scaling based on results from experimental studies and demonstrate that the combination of different conventional plasticity mechanisms and synaptic scaling provides a powerful general framework for regulating network connectivity. In addition, we design several simple models that reproduce experimentally observed synaptic distributions as well as the observed synaptic modifications during sustained activity changes. These models predict that the combination of plasticity with scaling generates globally stable, input-controlled synaptic patterns, also in recurrent networks. Thus, in combination with other forms of plasticity, synaptic scaling can robustly yield neuronal circuits with high synaptic diversity, which potentially enables robust dynamic storage of complex activation patterns. This mechanism is even more pronounced when considering networks with a realistic degree of inhibition. Synaptic scaling combined with plasticity could thus be the basis for learning structured behavior even in initially random networks. PMID:22203799

Dopamine precursor depletion impairs structure and efficiency of resting state brain functional networks.

PubMed

Carbonell, Felix; Nagano-Saito, Atsuko; Leyton, Marco; Cisek, Paul; Benkelfat, Chawki; He, Yong; Dagher, Alain

2014-09-01

Spatial patterns of functional connectivity derived from resting brain activity may be used to elucidate the topological properties of brain networks. Such networks are amenable to study using graph theory, which shows that they possess small world properties and can be used to differentiate healthy subjects and patient populations. Of particular interest is the possibility that some of these differences are related to alterations in the dopamine system. To investigate the role of dopamine in the topological organization of brain networks at rest, we tested the effects of reducing dopamine synthesis in 13 healthy subjects undergoing functional magnetic resonance imaging. All subjects were scanned twice, in a resting state, following ingestion of one of two amino acid drinks in a randomized, double-blind manner. One drink was a nutritionally balanced amino acid mixture, and the other was tyrosine and phenylalanine deficient. Functional connectivity between 90 cortical and subcortical regions was estimated for each individual subject under each dopaminergic condition. The lowered dopamine state caused the following network changes: reduced global and local efficiency of the whole brain network, reduced regional efficiency in limbic areas, reduced modularity of brain networks, and greater connection between the normally anti-correlated task-positive and default-mode networks. We conclude that dopamine plays a role in maintaining the efficient small-world properties and high modularity of functional brain networks, and in segregating the task-positive and default-mode networks. This article is part of the Special Issue Section entitled 'Neuroimaging in Neuropharmacology'. Copyright © 2014 Elsevier Ltd. All rights reserved.

Development of structural correlations and synchronization from adaptive rewiring in networks of Kuramoto oscillators

NASA Astrophysics Data System (ADS)

Papadopoulos, Lia; Kim, Jason Z.; Kurths, Jürgen; Bassett, Danielle S.

2017-07-01

Synchronization of non-identical oscillators coupled through complex networks is an important example of collective behavior, and it is interesting to ask how the structural organization of network interactions influences this process. Several studies have explored and uncovered optimal topologies for synchronization by making purposeful alterations to a network. On the other hand, the connectivity patterns of many natural systems are often not static, but are rather modulated over time according to their dynamics. However, this co-evolution and the extent to which the dynamics of the individual units can shape the organization of the network itself are less well understood. Here, we study initially randomly connected but locally adaptive networks of Kuramoto oscillators. In particular, the system employs a co-evolutionary rewiring strategy that depends only on the instantaneous, pairwise phase differences of neighboring oscillators, and that conserves the total number of edges, allowing the effects of local reorganization to be isolated. We find that a simple rule—which preserves connections between more out-of-phase oscillators while rewiring connections between more in-phase oscillators—can cause initially disordered networks to organize into more structured topologies that support enhanced synchronization dynamics. We examine how this process unfolds over time, finding a dependence on the intrinsic frequencies of the oscillators, the global coupling, and the network density, in terms of how the adaptive mechanism reorganizes the network and influences the dynamics. Importantly, for large enough coupling and after sufficient adaptation, the resulting networks exhibit interesting characteristics, including degree-frequency and frequency-neighbor frequency correlations. These properties have previously been associated with optimal synchronization or explosive transitions in which the networks were constructed using global information. On the contrary, by considering a time-dependent interplay between structure and dynamics, this work offers a mechanism through which emergent phenomena and organization can arise in complex systems utilizing local rules.

Topology for Dominance for Network of Multi-Agent System

NASA Astrophysics Data System (ADS)

Szeto, K. Y.

2007-05-01

The resource allocation problem in evolving two-dimensional point patterns is investigated for the existence of good strategies for the construction of initial configuration that leads to fast dominance of the pattern by one single species, which can be interpreted as market dominance by a company in the context of multi-agent systems in econophysics. For hexagonal lattice, certain special topological arrangements of the resource in two-dimensions, such as rings, lines and clusters have higher probability of dominance, compared to random pattern. For more complex networks, a systematic way to search for a stable and dominant strategy of resource allocation in the changing environment is found by means of genetic algorithm. Five typical features can be summarized by means of the distribution function for the local neighborhood of friends and enemies as well as the local clustering coefficients: (1) The winner has more triangles than the loser has. (2) The winner likes to form clusters as the winner tends to connect with other winner rather than with losers; while the loser tends to connect with winners rather than losers. (3) The distribution function of friends as well as enemies for the winner is broader than the corresponding distribution function for the loser. (4) The connectivity at which the peak of the distribution of friends for the winner occurs is larger than that of the loser; while the peak values for friends for winners is lower. (5) The connectivity at which the peak of the distribution of enemies for the winner occurs is smaller than that of the loser; while the peak values for enemies for winners is lower. These five features appear to be general, at least in the context of two-dimensional hexagonal lattices of various sizes, hierarchical lattice, Voronoi diagrams, as well as high-dimensional random networks. These general local topological properties of networks are relevant to strategists aiming at dominance in evolving patterns when the interaction between the agents is local.

Molecular association of pathogenetic contributors to pre-eclampsia (pre-eclampsia associome)

PubMed Central

2015-01-01

Background Pre-eclampsia is the most common complication occurring during pregnancy. In the majority of cases, it is concurrent with other pathologies in a comorbid manner (frequent co-occurrences in patients), such as diabetes mellitus, gestational diabetes and obesity. Providing bronchial asthma, pulmonary tuberculosis, certain neurodegenerative diseases and cancers as examples, we have shown previously that pairs of inversely comorbid pathologies (rare co-occurrences in patients) are more closely related to each other at the molecular genetic level compared with randomly generated pairs of diseases. Data in the literature concerning the causes of pre-eclampsia are abundant. However, the key mechanisms triggering this disease that are initiated by other pathological processes are thus far unknown. The aim of this work was to analyse the characteristic features of genetic networks that describe interactions between comorbid diseases, using pre-eclampsia as a case in point. Results The use of ANDSystem, Pathway Studio and STRING computer tools based on text-mining and database-mining approaches allowed us to reconstruct associative networks, representing molecular genetic interactions between genes, associated concurrently with comorbid disease pairs, including pre-eclampsia, diabetes mellitus, gestational diabetes and obesity. It was found that these associative networks statistically differed in the number of genes and interactions between them from those built for randomly chosen pairs of diseases. The associative network connecting all four diseases was composed of 16 genes (PLAT, ADIPOQ, ADRB3, LEPR, HP, TGFB1, TNFA, INS, CRP, CSRP1, IGFBP1, MBL2, ACE, ESR1, SHBG, ADA). Such an analysis allowed us to reveal differential gene risk factors for these diseases, and to propose certain, most probable, theoretical mechanisms of pre-eclampsia development in pregnant women. The mechanisms may include the following pathways: [TGFB1 or TNFA]-[IL1B]-[pre-eclampsia]; [TNFA or INS]-[NOS3]-[pre-eclampsia]; [INS]-[HSPA4 or CLU]-[pre-eclampsia]; [ACE]-[MTHFR]-[pre-eclampsia]. Conclusions For pre-eclampsia, diabetes mellitus, gestational diabetes and obesity, we showed that the size and connectivity of the associative molecular genetic networks, which describe interactions between comorbid diseases, statistically exceeded the size and connectivity of those built for randomly chosen pairs of diseases. Recently, we have shown a similar result for inversely comorbid diseases. This suggests that comorbid and inversely comorbid diseases have common features concerning structural organization of associative molecular genetic networks. PMID:25879409

Intermittent θ burst stimulation modulates resting-state functional connectivity in the attention network and promotes behavioral recovery in patients with visual spatial neglect.

PubMed

Cao, Lei; Fu, Wei; Zhang, Yanming; Huo, Su; Du, JuBao; Zhu, Lin; Song, Weiqun

2016-12-07

Functional connectivity changes in the attention network are viewed as a physiological signature of visual spatial neglect (VSN). The left dorsal lateral prefrontal cortex (LDLPFC) is known to initiate and monitor top-down attentional control and dynamically adjust behavioral performance. This study aimed to investigate whether increasing the activity of the LDLPFC through intermittent θ burst stimulation (iTBS) could modulate the resting-state functional connectivity in the attention network and facilitate recovery from VSN. Patients with right hemisphere stroke and VSN were randomly assigned to two groups matched for clinical characteristics and given a 10-day treatment. On each day, all patients underwent visual scanning training and motor function training and received iTBS over the LDLPFC either at 80% resting motor threshold (RMT) or at 40% RMT before the trainings. MRI, the line bisection test, and the star cancelation test were performed before and after treatment. Patients who received iTBS at 80% RMT showed a large-scale reduction in the resting-state functional connectivity extent, largely in the right attention network, and more significant improvement of behavioral performance compared with patients who received iTBS at 40% RMT. These results support that the LDLPFC potentially plays a key role in the modulation of attention networks in neglect. Increasing the activity of the LDPLPFC through iTBS can facilitate recovery from VSN in patients with stroke.

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.

Sensitivity of directed networks to the addition and pruning of edges and vertices

NASA Astrophysics Data System (ADS)

Goltsev, A. V.; Timár, G.; Mendes, J. F. F.

2017-08-01

Directed networks have various topologically different extensive components, in contrast to a single giant component in undirected networks. We study the sensitivity (response) of the sizes of these extensive components in directed complex networks to the addition and pruning of edges and vertices. We introduce the susceptibility, which quantifies this sensitivity. We show that topologically different parts of a directed network have different sensitivity to the addition and pruning of edges and vertices and, therefore, they are characterized by different susceptibilities. These susceptibilities diverge at the critical point of the directed percolation transition, signaling the appearance (or disappearance) of the giant strongly connected component in the infinite size limit. We demonstrate this behavior in randomly damaged real and synthetic directed complex networks, such as the World Wide Web, Twitter, the Caenorhabditis elegans neural network, directed Erdős-Rényi graphs, and others. We reveal a nonmonotonic dependence of the sensitivity to random pruning of edges or vertices in the case of C. elegans and Twitter that manifests specific structural peculiarities of these networks. We propose the measurements of the susceptibilities during the addition or pruning of edges and vertices as a new method for studying structural peculiarities of directed networks.

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

NASA Astrophysics Data System (ADS)

Ma, Fei; Yao, Bing

2018-02-01

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

Filamentary structures that self-organize due to adhesion

NASA Astrophysics Data System (ADS)

Sengab, A.; Picu, R. C.

2018-03-01

We study the self-organization of random collections of elastic filaments that interact adhesively. The evolution from an initial fully random quasi-two-dimensional state is controlled by filament elasticity, adhesion and interfilament friction, and excluded volume. Three outcomes are possible: the system may remain locked in the initial state, may organize into isolated fiber bundles, or may form a stable, connected network of bundles. The range of system parameters leading to each of these states is identified. The network of bundles is subisostatic and is stabilized by prestressed triangular features forming at bundle-to-bundle nodes, similar to the situation in foams. Interfiber friction promotes locking and expands the parametric range of nonevolving systems.

Voter dynamics on an adaptive network with finite average connectivity

NASA Astrophysics Data System (ADS)

Mukhopadhyay, Abhishek; Schmittmann, Beate

2009-03-01

We study a simple model for voter dynamics in a two-party system. The opinion formation process is implemented in a random network of agents in which interactions are not restricted by geographical distance. In addition, we incorporate the rapidly changing nature of the interpersonal relations in the model. At each time step, agents can update their relationships, so that there is no history dependence in the model. This update is determined by their own opinion, and by their preference to make connections with individuals sharing the same opinion and with opponents. Using simulations and analytic arguments, we determine the final steady states and the relaxation into these states for different system sizes. In contrast to earlier studies, the average connectivity (``degree'') of each agent is constant here, independent of the system size. This has significant consequences for the long-time behavior of the model.

Diffusion in random networks: Asymptotic properties, and numerical and engineering approximations

NASA Astrophysics Data System (ADS)

Padrino, Juan C.; Zhang, Duan Z.

2016-11-01

The ensemble phase averaging technique is applied to model mass transport by diffusion in random networks. The system consists of an ensemble of random networks, where each network is made of a set of pockets connected by tortuous channels. Inside a channel, we assume that fluid transport is governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pores mass density. The so-called dual porosity model is found to be equivalent to the leading order approximation of the integration kernel when the diffusion time scale inside the channels is small compared to the macroscopic time scale. As a test problem, we consider the one-dimensional mass diffusion in a semi-infinite domain, whose solution is sought numerically. Because of the required time to establish the linear concentration profile inside a channel, for early times the similarity variable is xt- 1 / 4 rather than xt- 1 / 2 as in the traditional theory. This early time sub-diffusive similarity can be explained by random walk theory through the network. In addition, by applying concepts of fractional calculus, we show that, for small time, the governing equation reduces to a fractional diffusion equation with known solution. We recast this solution in terms of special functions easier to compute. Comparison of the numerical and exact solutions shows excellent agreement.

Risk perception in epidemic modeling

NASA Astrophysics Data System (ADS)

Bagnoli, Franco; Liò, Pietro; Sguanci, Luca

2007-12-01

We investigate the effects of risk perception in a simple model of epidemic spreading. We assume that the perception of the risk of being infected depends on the fraction of neighbors that are ill. The effect of this factor is to decrease the infectivity, that therefore becomes a dynamical component of the model. We study the problem in the mean-field approximation and by numerical simulations for regular, random, and scale-free networks. We show that for homogeneous and random networks, there is always a value of perception that stops the epidemics. In the “worst-case” scenario of a scale-free network with diverging input connectivity, a linear perception cannot stop the epidemics; however, we show that a nonlinear increase of the perception risk may lead to the extinction of the disease. This transition is discontinuous, and is not predicted by the mean-field analysis.

Pre-configured polyhedron based protection against multi-link failures in optical mesh networks.

PubMed

Huang, Shanguo; Guo, Bingli; Li, Xin; Zhang, Jie; Zhao, Yongli; Gu, Wanyi

2014-02-10

This paper focuses on random multi-link failures protection in optical mesh networks, instead of single, the dual or sequential failures of previous studies. Spare resource efficiency and failure robustness are major concerns in link protection strategy designing and a k-regular and k-edge connected structure is proved to be one of the optimal solutions for link protection network. Based on this, a novel pre-configured polyhedron based protection structure is proposed, and it could provide protection for both simultaneous and sequential random link failures with improved spare resource efficiency. Its performance is evaluated in terms of spare resource consumption, recovery rate and average recovery path length, as well as compared with ring based and subgraph protection under probabilistic link failure scenarios. Results show the proposed novel link protection approach has better performance than previous works.

Nestedness across biological scales

PubMed Central

Marquitti, Flavia M. D.; Raimundo, Rafael L. G.; Sebastián-González, Esther; Coltri, Patricia P.; Perez, S. Ivan; Brandt, Débora Y. C.; Nunes, Kelly; Daura-Jorge, Fábio G.; Floeter, Sergio R.; Guimarães, Paulo R.

2017-01-01

Biological networks pervade nature. They describe systems throughout all levels of biological organization, from molecules regulating metabolism to species interactions that shape ecosystem dynamics. The network thinking revealed recurrent organizational patterns in complex biological systems, such as the formation of semi-independent groups of connected elements (modularity) and non-random distributions of interactions among elements. Other structural patterns, such as nestedness, have been primarily assessed in ecological networks formed by two non-overlapping sets of elements; information on its occurrence on other levels of organization is lacking. Nestedness occurs when interactions of less connected elements form proper subsets of the interactions of more connected elements. Only recently these properties began to be appreciated in one-mode networks (where all elements can interact) which describe a much wider variety of biological phenomena. Here, we compute nestedness in a diverse collection of one-mode networked systems from six different levels of biological organization depicting gene and protein interactions, complex phenotypes, animal societies, metapopulations, food webs and vertebrate metacommunities. Our findings suggest that nestedness emerge independently of interaction type or biological scale and reveal that disparate systems can share nested organization features characterized by inclusive subsets of interacting elements with decreasing connectedness. We primarily explore the implications of a nested structure for each of these studied systems, then theorize on how nested networks are assembled. We hypothesize that nestedness emerges across scales due to processes that, although system-dependent, may share a general compromise between two features: specificity (the number of interactions the elements of the system can have) and affinity (how these elements can be connected to each other). Our findings suggesting occurrence of nestedness throughout biological scales can stimulate the debate on how pervasive nestedness may be in nature, while the theoretical emergent principles can aid further research on commonalities of biological networks. PMID:28166284

The impact of network characteristics on the diffusion of innovations

NASA Astrophysics Data System (ADS)

Peres, Renana

2014-05-01

This paper studies the influence of network topology on the speed and reach of new product diffusion. While previous research has focused on comparing network types, this paper explores explicitly the relationship between topology and measurements of diffusion effectiveness. We study simultaneously the effect of three network metrics: the average degree, the relative degree of social hubs (i.e., the ratio of the average degree of highly-connected individuals to the average degree of the entire population), and the clustering coefficient. A novel network-generation procedure based on random graphs with a planted partition is used to generate 160 networks with a wide range of values for these topological metrics. Using an agent-based model, we simulate diffusion on these networks and check the dependence of the net present value (NPV) of the number of adopters over time on the network metrics. We find that the average degree and the relative degree of social hubs have a positive influence on diffusion. This result emphasizes the importance of high network connectivity and strong hubs. The clustering coefficient has a negative impact on diffusion, a finding that contributes to the ongoing controversy on the benefits and disadvantages of transitivity. These results hold for both monopolistic and duopolistic markets, and were also tested on a sample of 12 real networks.

Stability and Topology of Scale-Free Networks under Attack and Defense Strategies

NASA Astrophysics Data System (ADS)

Gallos, Lazaros K.; Cohen, Reuven; Argyrakis, Panos; Bunde, Armin; Havlin, Shlomo

2005-05-01

We study tolerance and topology of random scale-free networks under attack and defense strategies that depend on the degree k of the nodes. This situation occurs, for example, when the robustness of a node depends on its degree or in an intentional attack with insufficient knowledge of the network. We determine, for all strategies, the critical fraction pc of nodes that must be removed for disintegrating the network. We find that, for an intentional attack, little knowledge of the well-connected sites is sufficient to strongly reduce pc. At criticality, the topology of the network depends on the removal strategy, implying that different strategies may lead to different kinds of percolation transitions.

Change of Brain Functional Connectivity in Patients With Spinal Cord Injury: Graph Theory Based Approach.

PubMed

Min, Yu-Sun; Chang, Yongmin; Park, Jang Woo; Lee, Jong-Min; Cha, Jungho; Yang, Jin-Ju; Kim, Chul-Hyun; Hwang, Jong-Moon; Yoo, Ji-Na; Jung, Tae-Du

2015-06-01

To investigate the global functional reorganization of the brain following spinal cord injury with graph theory based approach by creating whole brain functional connectivity networks from resting state-functional magnetic resonance imaging (rs-fMRI), characterizing the reorganization of these networks using graph theoretical metrics and to compare these metrics between patients with spinal cord injury (SCI) and age-matched controls. Twenty patients with incomplete cervical SCI (14 males, 6 females; age, 55±14.1 years) and 20 healthy subjects (10 males, 10 females; age, 52.9±13.6 years) participated in this study. To analyze the characteristics of the whole brain network constructed with functional connectivity using rs-fMRI, graph theoretical measures were calculated including clustering coefficient, characteristic path length, global efficiency and small-worldness. Clustering coefficient, global efficiency and small-worldness did not show any difference between controls and SCIs in all density ranges. The normalized characteristic path length to random network was higher in SCI patients than in controls and reached statistical significance at 12%-13% of density (p<0.05, uncorrected). The graph theoretical approach in brain functional connectivity might be helpful to reveal the information processing after SCI. These findings imply that patients with SCI can build on preserved competent brain control. Further analyses, such as topological rearrangement and hub region identification, will be needed for better understanding of neuroplasticity in patients with SCI.

Motor network disruption in essential tremor: a functional and effective connectivity study.

PubMed

Buijink, Arthur W G; van der Stouwe, A M Madelein; Broersma, Marja; Sharifi, Sarvi; Groot, Paul F C; Speelman, Johannes D; Maurits, Natasha M; van Rootselaar, Anne-Fleur

2015-10-01

Although involvement of the cerebello-thalamo-cortical network has often been suggested in essential tremor, the source of oscillatory activity remains largely unknown. To elucidate mechanisms of tremor generation, it is of crucial importance to study the dynamics within the cerebello-thalamo-cortical network. Using a combination of electromyography and functional magnetic resonance imaging, it is possible to record the peripheral manifestation of tremor simultaneously with brain activity related to tremor generation. Our first aim was to study the intrinsic activity of regions within the cerebello-thalamo-cortical network using dynamic causal modelling to estimate effective connectivity driven by the concurrently recorded tremor signal. Our second aim was to objectify how the functional integrity of the cerebello-thalamo-cortical network is affected in essential tremor. We investigated the functional connectivity between cerebellar and cortical motor regions showing activations during a motor task. Twenty-two essential tremor patients and 22 healthy controls were analysed. For the effective connectivity analysis, a network of tremor-signal related regions was constructed, consisting of the left primary motor cortex, premotor cortex, supplementary motor area, left thalamus, and right cerebellar motor regions lobule V and lobule VIII. A measure of variation in tremor severity over time, derived from the electromyogram, was included as modulatory input on intrinsic connections and on the extrinsic cerebello-thalamic connections, giving a total of 128 models. Bayesian model selection and random effects Bayesian model averaging were used. Separate seed-based functional connectivity analyses for the left primary motor cortex, left supplementary motor area and right cerebellar lobules IV, V, VI and VIII were performed. We report two novel findings that support an important role for the cerebellar system in the pathophysiology of essential tremor. First, in the effective connectivity analysis, tremor variation during the motor task has an excitatory effect on both the extrinsic connection from cerebellar lobule V to the thalamus, and the intrinsic activity of cerebellar lobule V and thalamus. Second, the functional integrity of the motor network is affected in essential tremor, with a decrease in functional connectivity between cortical and cerebellar motor regions. This decrease in functional connectivity, related to the motor task, correlates with an increase in clinical tremor severity. Interestingly, increased functional connectivity between right cerebellar lobules I-IV and the left thalamus correlates with an increase in clinical tremor severity. In conclusion, our findings suggest that cerebello-dentato-thalamic activity and cerebello-cortical connectivity is disturbed in essential tremor, supporting previous evidence of functional cerebellar changes in essential tremor. © The Author (2015). Published by Oxford University Press on behalf of the Guarantors of Brain. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Clustering in complex directed networks

NASA Astrophysics Data System (ADS)

Fagiolo, Giorgio

2007-08-01

Many empirical networks display an inherent tendency to cluster, i.e., to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC). The CC, originally introduced for binary, undirected graphs, has been recently generalized to weighted, undirected networks. Here we extend the CC to the case of (binary and weighted) directed networks and we compute its expected value for random graphs. We distinguish between CCs that count all directed triangles in the graph (independently of the direction of their edges) and CCs that only consider particular types of directed triangles (e.g., cycles). The main concepts are illustrated by employing empirical data on world-trade flows.

Predicting non-linear dynamics by stable local learning in a recurrent spiking neural network.

PubMed

Gilra, Aditya; Gerstner, Wulfram

2017-11-27

The brain needs to predict how the body reacts to motor commands, but how a network of spiking neurons can learn non-linear body dynamics using local, online and stable learning rules is unclear. Here, we present a supervised learning scheme for the feedforward and recurrent connections in a network of heterogeneous spiking neurons. The error in the output is fed back through fixed random connections with a negative gain, causing the network to follow the desired dynamics. The rule for Feedback-based Online Local Learning Of Weights (FOLLOW) is local in the sense that weight changes depend on the presynaptic activity and the error signal projected onto the postsynaptic neuron. We provide examples of learning linear, non-linear and chaotic dynamics, as well as the dynamics of a two-link arm. Under reasonable approximations, we show, using the Lyapunov method, that FOLLOW learning is uniformly stable, with the error going to zero asymptotically.

Predicting non-linear dynamics by stable local learning in a recurrent spiking neural network

PubMed Central

Gerstner, Wulfram

2017-01-01

The brain needs to predict how the body reacts to motor commands, but how a network of spiking neurons can learn non-linear body dynamics using local, online and stable learning rules is unclear. Here, we present a supervised learning scheme for the feedforward and recurrent connections in a network of heterogeneous spiking neurons. The error in the output is fed back through fixed random connections with a negative gain, causing the network to follow the desired dynamics. The rule for Feedback-based Online Local Learning Of Weights (FOLLOW) is local in the sense that weight changes depend on the presynaptic activity and the error signal projected onto the postsynaptic neuron. We provide examples of learning linear, non-linear and chaotic dynamics, as well as the dynamics of a two-link arm. Under reasonable approximations, we show, using the Lyapunov method, that FOLLOW learning is uniformly stable, with the error going to zero asymptotically. PMID:29173280

A Hybrid Key Management Scheme for WSNs Based on PPBR and a Tree-Based Path Key Establishment Method

PubMed Central

Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Chen, Wei

2016-01-01

With the development of wireless sensor networks (WSNs), in most application scenarios traditional WSNs with static sink nodes will be gradually replaced by Mobile Sinks (MSs), and the corresponding application requires a secure communication environment. Current key management researches pay less attention to the security of sensor networks with MS. This paper proposes a hybrid key management schemes based on a Polynomial Pool-based key pre-distribution and Basic Random key pre-distribution (PPBR) to be used in WSNs with MS. The scheme takes full advantages of these two kinds of methods to improve the cracking difficulty of the key system. The storage effectiveness and the network resilience can be significantly enhanced as well. The tree-based path key establishment method is introduced to effectively solve the problem of communication link connectivity. Simulation clearly shows that the proposed scheme performs better in terms of network resilience, connectivity and storage effectiveness compared to other widely used schemes. PMID:27070624

Bilateral Transcranial Direct Current Stimulation Reshapes Resting-State Brain Networks: A Magnetoencephalography Assessment

PubMed Central

Turco, Cristina; Di Pino, Giovanni; Arcara, Giorgio

2018-01-01

Transcranial direct current stimulation (tDCS) can noninvasively induce brain plasticity, and it is potentially useful to treat patients affected by neurological conditions. However, little is known about tDCS effects on resting-state brain networks, which are largely involved in brain physiological functions and in diseases. In this randomized, sham-controlled, double-blind study on healthy subjects, we have assessed the effect of bilateral tDCS applied over the sensorimotor cortices on brain and network activity using a whole-head magnetoencephalography system. Bilateral tDCS, with the cathode (−) centered over C4 and the anode (+) centered over C3, reshapes brain networks in a nonfocal fashion. Compared to sham stimulation, tDCS reduces left frontal alpha, beta, and gamma power and increases global connectivity, especially in delta, alpha, beta, and gamma frequencies. The increase of connectivity is consistent across bands and widespread. These results shed new light on the effects of tDCS and may be of help in personalizing treatments in neurological disorders. PMID:29593782

The effects of music on brain functional networks: a network analysis.

PubMed

Wu, J; Zhang, J; Ding, X; Li, R; Zhou, C

2013-10-10

The human brain can dynamically adapt to the changing surroundings. To explore this issue, we adopted graph theoretical tools to examine changes in electroencephalography (EEG) functional networks while listening to music. Three different excerpts of Chinese Guqin music were played to 16 non-musician subjects. For the main frequency intervals, synchronizations between all pair-wise combinations of EEG electrodes were evaluated with phase lag index (PLI). Then, weighted connectivity networks were created and their organizations were characterized in terms of an average clustering coefficient and characteristic path length. We found an enhanced synchronization level in the alpha2 band during music listening. Music perception showed a decrease of both normalized clustering coefficient and path length in the alpha2 band. Moreover, differences in network measures were not observed between musical excerpts. These experimental results demonstrate an increase of functional connectivity as well as a more random network structure in the alpha2 band during music perception. The present study offers support for the effects of music on human brain functional networks with a trend toward a more efficient but less economical architecture. Copyright © 2013 IBRO. Published by Elsevier Ltd. All rights reserved.

Complex network structure of musical compositions: Algorithmic generation of appealing music

NASA Astrophysics Data System (ADS)

Liu, Xiao Fan; Tse, Chi K.; Small, Michael

2010-01-01

In this paper we construct networks for music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes and their co-occurring connections. We analyze classical music from Bach, Mozart, Chopin, as well as other types of music such as Chinese pop music. We observe remarkably similar properties in all networks constructed from the selected compositions. We conjecture that preserving the universal network properties is a necessary step in artificial composition of music. Power-law exponents of node degree, node strength and/or edge weight distributions, mean degrees, clustering coefficients, mean geodesic distances, etc. are reported. With the network constructed, music can be composed artificially using a controlled random walk algorithm, which begins with a randomly chosen note and selects the subsequent notes according to a simple set of rules that compares the weights of the edges, weights of the nodes, and/or the degrees of nodes. By generating a large number of compositions, we find that this algorithm generates music which has the necessary qualities to be subjectively judged as appealing.

Abnormal functional connectivity of EEG gamma band in patients with depression during emotional face processing.

PubMed

Li, Yingjie; Cao, Dan; Wei, Ling; Tang, Yingying; Wang, Jijun

2015-11-01

This paper evaluates the large-scale structure of functional brain networks using graph theoretical concepts and investigates the difference in brain functional networks between patients with depression and healthy controls while they were processing emotional stimuli. Electroencephalography (EEG) activities were recorded from 16 patients with depression and 14 healthy controls when they performed a spatial search task for facial expressions. Correlations between all possible pairs of 59 electrodes were determined by coherence, and the coherence matrices were calculated in delta, theta, alpha, beta, and gamma bands (low gamma: 30-50Hz and high gamma: 50-80Hz, respectively). Graph theoretical analysis was applied to these matrices by using two indexes: the clustering coefficient and the characteristic path length. The global EEG coherence of patients with depression was significantly higher than that of healthy controls in both gamma bands, especially in the high gamma band. The global coherence in both gamma bands from healthy controls appeared higher in negative conditions than in positive conditions. All the brain networks were found to hold a regular and ordered topology during emotion processing. However, the brain network of patients with depression appeared randomized compared with the normal one. The abnormal network topology of patients with depression was detected in both the prefrontal and occipital regions. The negative bias from healthy controls occurred in both gamma bands during emotion processing, while it disappeared in patients with depression. The proposed work studied abnormally increased connectivity of brain functional networks in patients with depression. By combing the clustering coefficient and the characteristic path length, we found that the brain networks of patients with depression and healthy controls had regular networks during emotion processing. Yet the brain networks of the depressed group presented randomization trends. Moreover, negative bias was detected in the healthy controls during emotion processing, while it was not detected in patients with depression, which might be related to the types of negative stimuli used in this study. The brain networks from both patients with depression and healthy controls were found to hold a regular and ordered topology. Yet the brain networks of patients with depression had randomization trends. Copyright © 2015 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

EEG-based research on brain functional networks in cognition.

PubMed

Wang, Niannian; Zhang, Li; Liu, Guozhong

2015-01-01

Recently, exploring the cognitive functions of the brain by establishing a network model to understand the working mechanism of the brain has become a popular research topic in the field of neuroscience. In this study, electroencephalography (EEG) was used to collect data from subjects given four different mathematical cognitive tasks: recite numbers clockwise and counter-clockwise, and letters clockwise and counter-clockwise to build a complex brain function network (BFN). By studying the connectivity features and parameters of those brain functional networks, it was found that the average clustering coefficient is much larger than its corresponding random network and the average shortest path length is similar to the corresponding random networks, which clearly shows the characteristics of the small-world network. The brain regions stimulated during the experiment are consistent with traditional cognitive science regarding learning, memory, comprehension, and other rational judgment results. The new method of complex networking involves studying the mathematical cognitive process of reciting, providing an effective research foundation for exploring the relationship between brain cognition and human learning skills and memory. This could help detect memory deficits early in young and mentally handicapped children, and help scientists understand the causes of cognitive brain disorders.

Massive-Scale Gene Co-Expression Network Construction and Robustness Testing Using Random Matrix Theory

PubMed Central

Isaacson, Sven; Luo, Feng; Feltus, Frank A.; Smith, Melissa C.

2013-01-01

The study of gene relationships and their effect on biological function and phenotype is a focal point in systems biology. Gene co-expression networks built using microarray expression profiles are one technique for discovering and interpreting gene relationships. A knowledge-independent thresholding technique, such as Random Matrix Theory (RMT), is useful for identifying meaningful relationships. Highly connected genes in the thresholded network are then grouped into modules that provide insight into their collective functionality. While it has been shown that co-expression networks are biologically relevant, it has not been determined to what extent any given network is functionally robust given perturbations in the input sample set. For such a test, hundreds of networks are needed and hence a tool to rapidly construct these networks. To examine functional robustness of networks with varying input, we enhanced an existing RMT implementation for improved scalability and tested functional robustness of human (Homo sapiens), rice (Oryza sativa) and budding yeast (Saccharomyces cerevisiae). We demonstrate dramatic decrease in network construction time and computational requirements and show that despite some variation in global properties between networks, functional similarity remains high. Moreover, the biological function captured by co-expression networks thresholded by RMT is highly robust. PMID:23409071

Research on cascading failure in multilayer network with different coupling preference

NASA Astrophysics Data System (ADS)

Zhang, Yong; Jin, Lei; Wang, Xiao Juan

This paper is aimed at constructing robust multilayer networks against cascading failure. Considering link protection strategies in reality, we design a cascading failure model based on load distribution and extend it to multilayer. We use the cascading failure model to deduce the scale of the largest connected component after cascading failure, from which we can find that the performance of four kinds of load distribution strategies associates with the load ratio of the current edge to its adjacent edge. Coupling preference is a typical characteristic in multilayer networks which corresponds to the network robustness. The coupling preference of multilayer networks is divided into two forms: the coupling preference in layers and the coupling preference between layers. To analyze the relationship between the coupling preference and the multilayer network robustness, we design a construction algorithm to generate multilayer networks with different coupling preferences. Simulation results show that the load distribution based on the node betweenness performs the best. When the coupling coefficient in layers is zero, the scale-free network is the most robust. In the random network, the assortative coupling in layers is more robust than the disassortative coupling. For the coupling preference between layers, the assortative coupling between layers is more robust than the disassortative coupling both in the scale free network and the random network.

Integration and Analysis of Neighbor Discovery and Link Quality Estimation in Wireless Sensor Networks

PubMed Central

Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Abd Razak, Shukor

2014-01-01

Network connectivity and link quality information are the fundamental requirements of wireless sensor network protocols to perform their desired functionality. Most of the existing discovery protocols have only focused on the neighbor discovery problem, while a few number of them provide an integrated neighbor search and link estimation. As these protocols require a careful parameter adjustment before network deployment, they cannot provide scalable and accurate network initialization in large-scale dense wireless sensor networks with random topology. Furthermore, performance of these protocols has not entirely been evaluated yet. In this paper, we perform a comprehensive simulation study on the efficiency of employing adaptive protocols compared to the existing nonadaptive protocols for initializing sensor networks with random topology. In this regard, we propose adaptive network initialization protocols which integrate the initial neighbor discovery with link quality estimation process to initialize large-scale dense wireless sensor networks without requiring any parameter adjustment before network deployment. To the best of our knowledge, this work is the first attempt to provide a detailed simulation study on the performance of integrated neighbor discovery and link quality estimation protocols for initializing sensor networks. This study can help system designers to determine the most appropriate approach for different applications. PMID:24678277

Epidemic threshold in directed networks.

PubMed

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

2013-12-01

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

Epidemic threshold in directed networks

NASA Astrophysics Data System (ADS)

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

2013-12-01

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

Bistability and up/down state alternations in inhibition-dominated randomly connected networks of LIF neurons.

PubMed

Tartaglia, Elisa M; Brunel, Nicolas

2017-09-20

Electrophysiological recordings in cortex in vivo have revealed a rich variety of dynamical regimes ranging from irregular asynchronous states to a diversity of synchronized states, depending on species, anesthesia, and external stimulation. The average population firing rate in these states is typically low. We study analytically and numerically a network of sparsely connected excitatory and inhibitory integrate-and-fire neurons in the inhibition-dominated, low firing rate regime. For sufficiently high values of the external input, the network exhibits an asynchronous low firing frequency state (L). Depending on synaptic time constants, we show that two scenarios may occur when external inputs are decreased: (1) the L state can destabilize through a Hopf bifucation as the external input is decreased, leading to synchronized oscillations spanning d δ to β frequencies; (2) the network can reach a bistable region, between the low firing frequency network state (L) and a quiescent one (Q). Adding an adaptation current to excitatory neurons leads to spontaneous alternations between L and Q states, similar to experimental observations on UP and DOWN states alternations.

Electron percolation in realistic models of carbon nanotube networks

NASA Astrophysics Data System (ADS)

Simoneau, Louis-Philippe; Villeneuve, Jérémie; Rochefort, Alain

2015-09-01

The influence of penetrable and curved carbon nanotubes (CNT) on the charge percolation in three-dimensional disordered CNT networks have been studied with Monte-Carlo simulations. By considering carbon nanotubes as solid objects but where the overlap between their electron cloud can be controlled, we observed that the structural characteristics of networks containing lower aspect ratio CNT are highly sensitive to the degree of penetration between crossed nanotubes. Following our efficient strategy to displace CNT to different positions to create more realistic statistical models, we conclude that the connectivity between objects increases with the hard-core/soft-shell radii ratio. In contrast, the presence of curved CNT in the random networks leads to an increasing percolation threshold and to a decreasing electrical conductivity at saturation. The waviness of CNT decreases the effective distance between the nanotube extremities, hence reducing their connectivity and degrading their electrical properties. We present the results of our simulation in terms of thickness of the CNT network from which simple structural parameters such as the volume fraction or the carbon nanotube density can be accurately evaluated with our more realistic models.

Value of peripheral nodes in controlling multilayer scale-free networks

NASA Astrophysics Data System (ADS)

Zhang, Yan; Garas, Antonios; Schweitzer, Frank

2016-01-01

We analyze the controllability of a two-layer network, where driver nodes can be chosen randomly only from one layer. Each layer contains a scale-free network with directed links and the node dynamics depends on the incoming links from other nodes. We combine the in-degree and out-degree values to assign an importance value w to each node, and distinguish between peripheral nodes with low w and central nodes with high w . Based on numerical simulations, we find that the controllable part of the network is larger when choosing low w nodes to connect the two layers. The control is as efficient when peripheral nodes are driver nodes as it is for the case of more central nodes. However, if we assume a cost to utilize nodes that is proportional to their overall degree, utilizing peripheral nodes to connect the two layers or to act as driver nodes is not only the most cost-efficient solution, it is also the one that performs best in controlling the two-layer network among the different interconnecting strategies we have tested.

The Effects of Sacred Value Networks Within an Evolutionary, Adversarial Game

NASA Astrophysics Data System (ADS)

McCalla, Scott G.; Short, Martin B.; Brantingham, P. Jeffrey

2013-05-01

The effects of personal relationships and shared ideologies on levels of crime and the formation of criminal coalitions are studied within the context of an adversarial, evolutionary game first introduced in Short et al. (Phys. Rev. E 82:066114, 2010). Here, we interpret these relationships as connections on a graph of N players. These connections are then used in a variety of ways to define each player's "sacred value network"—groups of individuals that are subject to special consideration or treatment by that player. We explore the effects on the dynamics of the system that these networks introduce, through various forms of protection from both victimization and punishment. Under local protection, these networks introduce a new fixed point within the game dynamics, which we find through a continuum approximation of the discrete game. Under more complicated, extended protection, we numerically observe the emergence of criminal coalitions, or "gangs". We also find that a high-crime steady state is much more frequent in the context of extended protection networks, in both the case of Erdős-Rényi and small world random graphs.

Functional Connectivity Substrates for tDCS Response in Minimally Conscious State Patients

PubMed Central

Cavaliere, Carlo; Aiello, Marco; Di Perri, Carol; Amico, Enrico; Martial, Charlotte; Thibaut, Aurore; Laureys, Steven; Soddu, Andrea

2016-01-01

Transcranial direct current stimulation (tDCS) is a non-invasive technique recently employed in disorders of consciousness, and determining a transitory recovery of signs of consciousness in almost half of minimally conscious state (MCS) patients. Although the rising evidences about its possible role in the treatment of many neurological and psychiatric conditions exist, no evidences exist about brain functional connectivity substrates underlying tDCS response. We retrospectively evaluated resting state functional Magnetic Resonance Imaging (fMRI) of 16 sub-acute and chronic MCS patients (6 tDCS responders) who successively received a single left dorsolateral prefrontal cortex (DLPFC) tDCS in a double-blind randomized cross-over trial. A seed-based approach for regions of left extrinsic control network (ECN) and default-mode network (DMN) was performed. tDCS responders showed an increased left intra-network connectivity for regions co-activated with left DLPFC, and significantly with left inferior frontal gyrus. Non-responders (NR) MCS patients showed an increased connectivity between left DLPFC and midline cortical structures, including anterior cingulate cortex and precuneus. Our findings suggest that a prior high connectivity with regions belonging to ECN can facilitate transitory recovery of consciousness in a subgroup of MCS patients that underwent tDCS treatment. Therefore, resting state-fMRI could be very valuable in detecting the neuronal conditions necessary for tDCS to improve behavior in MCS. PMID:27857682

Functional Connectivity Substrates for tDCS Response in Minimally Conscious State Patients.

PubMed

Cavaliere, Carlo; Aiello, Marco; Di Perri, Carol; Amico, Enrico; Martial, Charlotte; Thibaut, Aurore; Laureys, Steven; Soddu, Andrea

2016-01-01

Transcranial direct current stimulation (tDCS) is a non-invasive technique recently employed in disorders of consciousness, and determining a transitory recovery of signs of consciousness in almost half of minimally conscious state (MCS) patients. Although the rising evidences about its possible role in the treatment of many neurological and psychiatric conditions exist, no evidences exist about brain functional connectivity substrates underlying tDCS response. We retrospectively evaluated resting state functional Magnetic Resonance Imaging (fMRI) of 16 sub-acute and chronic MCS patients (6 tDCS responders) who successively received a single left dorsolateral prefrontal cortex (DLPFC) tDCS in a double-blind randomized cross-over trial. A seed-based approach for regions of left extrinsic control network (ECN) and default-mode network (DMN) was performed. tDCS responders showed an increased left intra-network connectivity for regions co-activated with left DLPFC, and significantly with left inferior frontal gyrus. Non-responders (NR) MCS patients showed an increased connectivity between left DLPFC and midline cortical structures, including anterior cingulate cortex and precuneus. Our findings suggest that a prior high connectivity with regions belonging to ECN can facilitate transitory recovery of consciousness in a subgroup of MCS patients that underwent tDCS treatment. Therefore, resting state-fMRI could be very valuable in detecting the neuronal conditions necessary for tDCS to improve behavior in MCS.

Human brain mapping: A systematic comparison of parcellation methods for the human cerebral cortex.

PubMed

Arslan, Salim; Ktena, Sofia Ira; Makropoulos, Antonios; Robinson, Emma C; Rueckert, Daniel; Parisot, Sarah

2018-04-15

The macro-connectome elucidates the pathways through which brain regions are structurally connected or functionally coupled to perform a specific cognitive task. It embodies the notion of representing and understanding all connections within the brain as a network, while the subdivision of the brain into interacting functional units is inherent in its architecture. As a result, the definition of network nodes is one of the most critical steps in connectivity network analysis. Although brain atlases obtained from cytoarchitecture or anatomy have long been used for this task, connectivity-driven methods have arisen only recently, aiming to delineate more homogeneous and functionally coherent regions. This study provides a systematic comparison between anatomical, connectivity-driven and random parcellation methods proposed in the thriving field of brain parcellation. Using resting-state functional MRI data from the Human Connectome Project and a plethora of quantitative evaluation techniques investigated in the literature, we evaluate 10 subject-level and 24 groupwise parcellation methods at different resolutions. We assess the accuracy of parcellations from four different aspects: (1) reproducibility across different acquisitions and groups, (2) fidelity to the underlying connectivity data, (3) agreement with fMRI task activation, myelin maps, and cytoarchitectural areas, and (4) network analysis. This extensive evaluation of different parcellations generated at the subject and group level highlights the strengths and shortcomings of the various methods and aims to provide a guideline for the choice of parcellation technique and resolution according to the task at hand. The results obtained in this study suggest that there is no optimal method able to address all the challenges faced in this endeavour simultaneously. Copyright © 2017 Elsevier Inc. All rights reserved.

Age-Related Decline in the Variation of Dynamic Functional Connectivity: A Resting State Analysis

PubMed Central

Chen, Yuanyuan; Wang, Weiwei; Zhao, Xin; Sha, Miao; Liu, Ya’nan; Zhang, Xiong; Ma, Jianguo; Ni, Hongyan; Ming, Dong

2017-01-01

Normal aging is typically characterized by abnormal resting-state functional connectivity (FC), including decreasing connectivity within networks and increasing connectivity between networks, under the assumption that the FC over the scan time was stationary. In fact, the resting-state FC has been shown in recent years to vary over time even within minutes, thus showing the great potential of intrinsic interactions and organization of the brain. In this article, we assumed that the dynamic FC consisted of an intrinsic dynamic balance in the resting brain and was altered with increasing age. Two groups of individuals (N = 36, ages 20–25 for the young group; N = 32, ages 60–85 for the senior group) were recruited from the public data of the Nathan Kline Institute. Phase randomization was first used to examine the reliability of the dynamic FC. Next, the variation in the dynamic FC and the energy ratio of the dynamic FC fluctuations within a higher frequency band were calculated and further checked for differences between groups by non-parametric permutation tests. The results robustly showed modularization of the dynamic FC variation, which declined with aging; moreover, the FC variation of the inter-network connections, which mainly consisted of the frontal-parietal network-associated and occipital-associated connections, decreased. In addition, a higher energy ratio in the higher FC fluctuation frequency band was observed in the senior group, which indicated the frequency interactions in the FC fluctuations. These results highly supported the basis of abnormality and compensation in the aging brain and might provide new insights into both aging and relevant compensatory mechanisms. PMID:28713261

Estimating network parameters from combined dynamics of firing rate and irregularity of single neurons.

PubMed

Hamaguchi, Kosuke; Riehle, Alexa; Brunel, Nicolas

2011-01-01

High firing irregularity is a hallmark of cortical neurons in vivo, and modeling studies suggest a balance of excitation and inhibition is necessary to explain this high irregularity. Such a balance must be generated, at least partly, from local interconnected networks of excitatory and inhibitory neurons, but the details of the local network structure are largely unknown. The dynamics of the neural activity depends on the local network structure; this in turn suggests the possibility of estimating network structure from the dynamics of the firing statistics. Here we report a new method to estimate properties of the local cortical network from the instantaneous firing rate and irregularity (CV(2)) under the assumption that recorded neurons are a part of a randomly connected sparse network. The firing irregularity, measured in monkey motor cortex, exhibits two features; many neurons show relatively stable firing irregularity in time and across different task conditions; the time-averaged CV(2) is widely distributed from quasi-regular to irregular (CV(2) = 0.3-1.0). For each recorded neuron, we estimate the three parameters of a local network [balance of local excitation-inhibition, number of recurrent connections per neuron, and excitatory postsynaptic potential (EPSP) size] that best describe the dynamics of the measured firing rates and irregularities. Our analysis shows that optimal parameter sets form a two-dimensional manifold in the three-dimensional parameter space that is confined for most of the neurons to the inhibition-dominated region. High irregularity neurons tend to be more strongly connected to the local network, either in terms of larger EPSP and inhibitory PSP size or larger number of recurrent connections, compared with the low irregularity neurons, for a given excitatory/inhibitory balance. Incorporating either synaptic short-term depression or conductance-based synapses leads many low CV(2) neurons to move to the excitation-dominated region as well as to an increase of EPSP size.

Network complexity as a measure of information processing across resting-state networks: evidence from the Human Connectome Project

PubMed Central

McDonough, Ian M.; Nashiro, Kaoru

2014-01-01

An emerging field of research focused on fluctuations in brain signals has provided evidence that the complexity of those signals, as measured by entropy, conveys important information about network dynamics (e.g., local and distributed processing). While much research has focused on how neural complexity differs in populations with different age groups or clinical disorders, substantially less research has focused on the basic understanding of neural complexity in populations with young and healthy brain states. The present study used resting-state fMRI data from the Human Connectome Project (Van Essen et al., 2013) to test the extent that neural complexity in the BOLD signal, as measured by multiscale entropy (1) would differ from random noise, (2) would differ between four major resting-state networks previously associated with higher-order cognition, and (3) would be associated with the strength and extent of functional connectivity—a complementary method of estimating information processing. We found that complexity in the BOLD signal exhibited different patterns of complexity from white, pink, and red noise and that neural complexity was differentially expressed between resting-state networks, including the default mode, cingulo-opercular, left and right frontoparietal networks. Lastly, neural complexity across all networks was negatively associated with functional connectivity at fine scales, but was positively associated with functional connectivity at coarse scales. The present study is the first to characterize neural complexity in BOLD signals at a high temporal resolution and across different networks and might help clarify the inconsistencies between neural complexity and functional connectivity, thus informing the mechanisms underlying neural complexity. PMID:24959130

Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?

PubMed Central

Czégel, Dániel; Palla, Gergely

2015-01-01

Signs of hierarchy are prevalent in a wide range of systems in nature and society. One of the key problems is quantifying the importance of hierarchical organisation in the structure of the network representing the interactions or connections between the fundamental units of the studied system. Although a number of notable methods are already available, their vast majority is treating all directed acyclic graphs as already maximally hierarchical. Here we propose a hierarchy measure based on random walks on the network. The novelty of our approach is that directed trees corresponding to multi level pyramidal structures obtain higher hierarchy scores compared to directed chains and directed stars. Furthermore, in the thermodynamic limit the hierarchy measure of regular trees is converging to a well defined limit depending only on the branching number. When applied to real networks, our method is computationally very effective, as the result can be evaluated with arbitrary precision by subsequent multiplications of the transition matrix describing the random walk process. In addition, the tests on real world networks provided very intuitive results, e.g., the trophic levels obtained from our approach on a food web were highly consistent with former results from ecology. PMID:26657012

Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?

NASA Astrophysics Data System (ADS)

Czégel, Dániel; Palla, Gergely

2015-12-01

Signs of hierarchy are prevalent in a wide range of systems in nature and society. One of the key problems is quantifying the importance of hierarchical organisation in the structure of the network representing the interactions or connections between the fundamental units of the studied system. Although a number of notable methods are already available, their vast majority is treating all directed acyclic graphs as already maximally hierarchical. Here we propose a hierarchy measure based on random walks on the network. The novelty of our approach is that directed trees corresponding to multi level pyramidal structures obtain higher hierarchy scores compared to directed chains and directed stars. Furthermore, in the thermodynamic limit the hierarchy measure of regular trees is converging to a well defined limit depending only on the branching number. When applied to real networks, our method is computationally very effective, as the result can be evaluated with arbitrary precision by subsequent multiplications of the transition matrix describing the random walk process. In addition, the tests on real world networks provided very intuitive results, e.g., the trophic levels obtained from our approach on a food web were highly consistent with former results from ecology.

Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?

PubMed

Czégel, Dániel; Palla, Gergely

2015-12-10

Signs of hierarchy are prevalent in a wide range of systems in nature and society. One of the key problems is quantifying the importance of hierarchical organisation in the structure of the network representing the interactions or connections between the fundamental units of the studied system. Although a number of notable methods are already available, their vast majority is treating all directed acyclic graphs as already maximally hierarchical. Here we propose a hierarchy measure based on random walks on the network. The novelty of our approach is that directed trees corresponding to multi level pyramidal structures obtain higher hierarchy scores compared to directed chains and directed stars. Furthermore, in the thermodynamic limit the hierarchy measure of regular trees is converging to a well defined limit depending only on the branching number. When applied to real networks, our method is computationally very effective, as the result can be evaluated with arbitrary precision by subsequent multiplications of the transition matrix describing the random walk process. In addition, the tests on real world networks provided very intuitive results, e.g., the trophic levels obtained from our approach on a food web were highly consistent with former results from ecology.

Functional connectivity evidence of cortico-cortico inhibition in temporal lobe epilepsy.

PubMed

Tracy, Joseph I; Osipowicz, Karol; Spechler, Philip; Sharan, Ashwini; Skidmore, Christopher; Doucet, Gaelle; Sperling, Michael R

2014-01-01

Epileptic seizures can initiate a neural circuit and lead to aberrant neural communication with brain areas outside the epileptogenic region. We focus on interictal activity in focal temporal lobe epilepsy and evaluate functional connectivity (FC) differences that emerge as function of bilateral versus strictly unilateral epileptiform activity. We assess the strength of FC at rest between the ictal and non-ictal temporal lobes, in addition to whole brain connectivity with the ictal temporal lobe. Results revealed strong connectivity between the temporal lobes for both patient groups, but this did not vary as a function of unilateral versus bilateral interictal status. Both the left and right unilateral temporal lobe groups showed significant anti-correlated activity in regions outside the epileptogenic temporal lobe, primarily involving the contralateral (non-ictal/non-pathologic) hemisphere, with precuneus involvement prominent. The bilateral groups did not show this contralateral anti-correlated activity. This anti-correlated connectivity may represent a form of protective and adaptive inhibition, helping to constrain epileptiform activity to the pathologic temporal lobe. The absence of this activity in the bilateral groups may be indicative of flawed inhibitory mechanisms, helping to explain their more widespread epileptiform activity. Our data suggest that the location and build up of epilepsy networks in the brain are not truly random, and are not limited to the formation of strictly epileptogenic networks. Functional networks may develop to take advantage of the regulatory function of structures such as the precuneus to instantiate an anti-correlated network, generating protective cortico-cortico inhibition for the purpose of limiting seizure spread or epileptogenesis. Copyright © 2012 Wiley Periodicals, Inc.

Application of hierarchical dissociated neural network in closed-loop hybrid system integrating biological and mechanical intelligence.

PubMed

Li, Yongcheng; Sun, Rong; Zhang, Bin; Wang, Yuechao; Li, Hongyi

2015-01-01

Neural networks are considered the origin of intelligence in organisms. In this paper, a new design of an intelligent system merging biological intelligence with artificial intelligence was created. It was based on a neural controller bidirectionally connected to an actual mobile robot to implement a novel vehicle. Two types of experimental preparations were utilized as the neural controller including 'random' and '4Q' (cultured neurons artificially divided into four interconnected parts) neural network. Compared to the random cultures, the '4Q' cultures presented absolutely different activities, and the robot controlled by the '4Q' network presented better capabilities in search tasks. Our results showed that neural cultures could be successfully employed to control an artificial agent; the robot performed better and better with the stimulus because of the short-term plasticity. A new framework is provided to investigate the bidirectional biological-artificial interface and develop new strategies for a future intelligent system using these simplified model systems.

Altered Insula Connectivity under MDMA.

PubMed

Walpola, Ishan C; Nest, Timothy; Roseman, Leor; Erritzoe, David; Feilding, Amanda; Nutt, David J; Carhart-Harris, Robin L

2017-10-01

Recent work with noninvasive human brain imaging has started to investigate the effects of 3,4-methylenedioxymethamphetamine (MDMA) on large-scale patterns of brain activity. MDMA, a potent monoamine-releaser with particularly pronounced serotonin- releasing properties, has unique subjective effects that include: marked positive mood, pleasant/unusual bodily sensations and pro-social, empathic feelings. However, the neurobiological basis for these effects is not properly understood, and the present analysis sought to address this knowledge gap. To do this, we administered MDMA-HCl (100 mg p.o.) and, separately, placebo (ascorbic acid) in a randomized, double-blind, repeated-measures design with twenty-five healthy volunteers undergoing fMRI scanning. We then employed a measure of global resting-state functional brain connectivity and follow-up seed-to-voxel analysis to the fMRI data we acquired. Results revealed decreased right insula/salience network functional connectivity under MDMA. Furthermore, these decreases in right insula/salience network connectivity correlated with baseline trait anxiety and acute experiences of altered bodily sensations under MDMA. The present findings highlight insular disintegration (ie, compromised salience network membership) as a neurobiological signature of the MDMA experience, and relate this brain effect to trait anxiety and acutely altered bodily sensations-both of which are known to be associated with insular functioning.

Topology determines force distributions in one-dimensional random spring networks.

PubMed

Heidemann, Knut M; Sageman-Furnas, Andrew O; Sharma, Abhinav; Rehfeldt, Florian; Schmidt, Christoph F; Wardetzky, Max

2018-02-01

Networks of elastic fibers are ubiquitous in biological systems and often provide mechanical stability to cells and tissues. Fiber-reinforced materials are also common in technology. An important characteristic of such materials is their resistance to failure under load. Rupture occurs when fibers break under excessive force and when that failure propagates. Therefore, it is crucial to understand force distributions. Force distributions within such networks are typically highly inhomogeneous and are not well understood. Here we construct a simple one-dimensional model system with periodic boundary conditions by randomly placing linear springs on a circle. We consider ensembles of such networks that consist of N nodes and have an average degree of connectivity z but vary in topology. Using a graph-theoretical approach that accounts for the full topology of each network in the ensemble, we show that, surprisingly, the force distributions can be fully characterized in terms of the parameters (N,z). Despite the universal properties of such (N,z) ensembles, our analysis further reveals that a classical mean-field approach fails to capture force distributions correctly. We demonstrate that network topology is a crucial determinant of force distributions in elastic spring networks.

Topology determines force distributions in one-dimensional random spring networks

NASA Astrophysics Data System (ADS)

Heidemann, Knut M.; Sageman-Furnas, Andrew O.; Sharma, Abhinav; Rehfeldt, Florian; Schmidt, Christoph F.; Wardetzky, Max

2018-02-01

Networks of elastic fibers are ubiquitous in biological systems and often provide mechanical stability to cells and tissues. Fiber-reinforced materials are also common in technology. An important characteristic of such materials is their resistance to failure under load. Rupture occurs when fibers break under excessive force and when that failure propagates. Therefore, it is crucial to understand force distributions. Force distributions within such networks are typically highly inhomogeneous and are not well understood. Here we construct a simple one-dimensional model system with periodic boundary conditions by randomly placing linear springs on a circle. We consider ensembles of such networks that consist of N nodes and have an average degree of connectivity z but vary in topology. Using a graph-theoretical approach that accounts for the full topology of each network in the ensemble, we show that, surprisingly, the force distributions can be fully characterized in terms of the parameters (N ,z ) . Despite the universal properties of such (N ,z ) ensembles, our analysis further reveals that a classical mean-field approach fails to capture force distributions correctly. We demonstrate that network topology is a crucial determinant of force distributions in elastic spring networks.

Relative Differences in Resting-State Brain Connectivity Associated with Long Term Intensive Lifestyle Intervention

PubMed Central

Casanova, Ramon; Hayasaka, Satoru; Saldana, Santiago; Bryan, Nick R.; Demos, Kathryn E.; Desiderio, Lisa; Erickson, Kirk I.; Espeland, Mark A.; Nasrallah, Ilya M.; Wadden, Thomas; Laurienti, Paul J.

2016-01-01

A number of studies have reported that type 2 diabetes mellitus (T2DM) is associated with alterations in resting-state activity and connectivity in the brain. There is also evidence that interventions involving physical activity and weight loss may affect brain functional connectivity. In this study, we examined the effects of nearly 10 years of an intensive lifestyle intervention (ILI), designed to induce and sustain weight loss through lower caloric intake and increased physical activity, on resting-state networks in adults with T2DM. We performed a cross-sectional comparison of global and local characteristics from functional brain networks between individuals who had been randomly assigned to ILI or a control condition of health education and support. Upon examining brain networks from 312 participants (average age: 68.8 for ILI and 67.9 for controls), we found that ILI participants (N=160) had attenuated local efficiency at the network-level compared with controls (N=152). Although there was no group difference in the network-level global efficiency, we found that, among ILI participants, nodal global efficiency was elevated in left fusiform gyrus, right middle frontal gyrus, and pars opercularis of right inferior frontal gyrus. These effects were age-dependent, with more pronounced effects for older participants. Overall these results indicate that the individuals assigned to the ILI had brain networks with less regional and more global connectivity, particularly involving frontal lobes. Such patterns would support greater distributed information processing. Future studies are needed to determine if these differences are associated with age-related compensatory function in the ILI group or worse pathology in the control group. PMID:27685338

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

PubMed

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

2015-04-28

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

Dynamical Response of Networks Under External Perturbations: Exact Results

NASA Astrophysics Data System (ADS)

Chinellato, David D.; Epstein, Irving R.; Braha, Dan; Bar-Yam, Yaneer; de Aguiar, Marcus A. M.

2015-04-01

We give exact statistical distributions for the dynamic response of influence networks subjected to external perturbations. We consider networks whose nodes have two internal states labeled 0 and 1. We let nodes be frozen in state 0, in state 1, and the remaining nodes change by adopting the state of a connected node with a fixed probability per time step. The frozen nodes can be interpreted as external perturbations to the subnetwork of free nodes. Analytically extending and to be smaller than 1 enables modeling the case of weak coupling. We solve the dynamical equations exactly for fully connected networks, obtaining the equilibrium distribution, transition probabilities between any two states and the characteristic time to equilibration. Our exact results are excellent approximations for other topologies, including random, regular lattice, scale-free and small world networks, when the numbers of fixed nodes are adjusted to take account of the effect of topology on coupling to the environment. This model can describe a variety of complex systems, from magnetic spins to social networks to population genetics, and was recently applied as a framework for early warning signals for real-world self-organized economic market crises.

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

PubMed Central

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

2015-01-01

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

Effective-medium theory of elastic waves in random networks of rods.

PubMed

Katz, J I; Hoffman, J J; Conradi, M S; Miller, J G

2012-06-01

We formulate an effective medium (mean field) theory of a material consisting of randomly distributed nodes connected by straight slender rods, hinged at the nodes. Defining wavelength-dependent effective elastic moduli, we calculate both the static moduli and the dispersion relations of ultrasonic longitudinal and transverse elastic waves. At finite wave vector k the waves are dispersive, with phase and group velocities decreasing with increasing wave vector. These results are directly applicable to networks with empty pore space. They also describe the solid matrix in two-component (Biot) theories of fluid-filled porous media. We suggest the possibility of low density materials with higher ratios of stiffness and strength to density than those of foams, aerogels, or trabecular bone.

Vertex centralities in input-output networks reveal the structure of modern economies

NASA Astrophysics Data System (ADS)

Blöchl, Florian; Theis, Fabian J.; Vega-Redondo, Fernando; Fisher, Eric O.'N.

2011-04-01

Input-output tables describe the flows of goods and services between the sectors of an economy. These tables can be interpreted as weighted directed networks. At the usual level of aggregation, they contain nodes with strong self-loops and are almost completely connected. We derive two measures of node centrality that are well suited for such networks. Both are based on random walks and have interpretations as the propagation of supply shocks through the economy. Random walk centrality reveals the vertices most immediately affected by a shock. Counting betweenness identifies the nodes where a shock lingers longest. The two measures differ in how they treat self-loops. We apply both to data from a wide set of countries and uncover salient characteristics of the structures of these national economies. We further validate our indices by clustering according to sectors’ centralities. This analysis reveals geographical proximity and similar developmental status.

Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication

NASA Astrophysics Data System (ADS)

Jakovetic, Dusan; Xavier, João; Moura, José M. F.

2011-08-01

We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-MG (augmented Lagrangian multi neighbor gossiping) and AL-BG (augmented Lagrangian broadcast gossiping.) The AL-G algorithm is based on the augmented Lagrangian dual function. Dual variables are updated by the standard method of multipliers, at a slow time scale. To update the primal variables, we propose a novel, Gauss-Seidel type, randomized algorithm, at a fast time scale. AL-G uses unidirectional gossip communication, only between immediate neighbors in the network and is resilient to random link failures. For networks with reliable communication (i.e., no failures,) the simplified, AL-BG (augmented Lagrangian broadcast gossiping) algorithm reduces communication, computation and data storage cost. We prove convergence for all proposed algorithms and demonstrate by simulations the effectiveness on two applications: l_1-regularized logistic regression for classification and cooperative spectrum sensing for cognitive radio networks.

Oxytocin differentially alters resting state functional connectivity between amygdala subregions and emotional control networks: Inverse correlation with depressive traits.

PubMed

Eckstein, Monika; Markett, Sebastian; Kendrick, Keith M; Ditzen, Beate; Liu, Fang; Hurlemann, Rene; Becker, Benjamin

2017-04-01

The hypothalamic neuropeptide oxytocin (OT) has received increasing attention for its role in modulating social-emotional processes across species. Previous studies on using intranasal-OT in humans point to a crucial engagement of the amygdala in the observed neuromodulatory effects of OT under task and rest conditions. However, the amygdala is not a single homogenous structure, but rather a set of structurally and functionally heterogeneous nuclei that show distinct patterns of connectivity with limbic and frontal emotion-processing regions. To determine potential differential effects of OT on functional connectivity of the amygdala subregions, 79 male participants underwent resting-state fMRI following randomized intranasal-OT or placebo administration. In line with previous studies OT increased the connectivity of the total amygdala with dorso-medial prefrontal regions engaged in emotion regulation. In addition, OT enhanced coupling of the total amygdala with cerebellar regions. Importantly, OT differentially altered the connectivity of amygdala subregions with distinct up-stream cortical nodes, particularly prefrontal/parietal, and cerebellar down-stream regions. OT-induced increased connectivity with cerebellar regions were largely driven by effects on the centromedial and basolateral subregions, whereas increased connectivity with prefrontal regions were largely mediated by right superficial and basolateral subregions. OT decreased connectivity of the centromedial subregions with core hubs of the emotional face processing network in temporal, occipital and parietal regions. Preliminary findings suggest that effects on the superficial amygdala-prefrontal pathway were inversely associated with levels of subclinical depression, possibly indicating that OT modulation may be blunted in the context of increased pathological load. Together, the present findings suggest a subregional-specific modulatory role of OT on amygdala-centered emotion processing networks in humans. Copyright © 2017 Elsevier Inc. All rights reserved.

Sexual Networks of Racially Diverse Young MSM Differ in Racial Homophily But Not Concurrency.

PubMed

Janulis, Patrick; Phillips, Gregory; Birkett, Michelle; Mustanski, Brian

2018-04-15

Substantial racial disparities exist in HIV infection among young men who have sex with men (YMSM). However, evidence suggests black YMSM do not engage in greater levels of risk behavior. Sexual networks may help explain this paradox. This study used egocentric exponential random graph models to examine variation in concurrency (ie, 2 or more simultaneous partners) and homophily (ie, same race/ethnicity partners) across race/ethnicity groups in a diverse sample of YMSM. Data for this study come from a longitudinal cohort study of YMSM. Participants (n = 1012) provided data regarding their sexual contacts during the 6 months before their first study visit. A series of egocentric exponential random graph models examined how providing separate estimates for homophily and concurrency parameters across race/ethnicity improved the fit of these models. Networks were simulated using these parameters to examine how local network characteristics impact risk at the whole network level. Results indicated that homophily, but not concurrency, varied across race/ethnicity. Black participants witnessed significantly higher race/ethnicity homophily compared with white and Latino peers. Extrapolating from these models, black individuals were more likely to be in a connected component with an HIV-positive individual and closer to HIV-positive individuals. However, white individuals were more likely to be in large connected components. These findings suggest that high racial homophily combined with existing disparities in HIV help perpetuate the spread of HIV among black YMSM. Nonetheless, additional work is required to understand these disparities given that homophily alone cannot sustain them indefinitely.

Weak signal transmission in complex networks and its application in detecting connectivity.

PubMed

Liang, Xiaoming; Liu, Zonghua; Li, Baowen

2009-10-01

We present a network model of coupled oscillators to study how a weak signal is transmitted in complex networks. Through both theoretical analysis and numerical simulations, we find that the response of other nodes to the weak signal decays exponentially with their topological distance to the signal source and the coupling strength between two neighboring nodes can be figured out by the responses. This finding can be conveniently used to detect the topology of unknown network, such as the degree distribution, clustering coefficient and community structure, etc., by repeatedly choosing different nodes as the signal source. Through four typical networks, i.e., the regular one dimensional, small world, random, and scale-free networks, we show that the features of network can be approximately given by investigating many fewer nodes than the network size, thus our approach to detect the topology of unknown network may be efficient in practical situations with large network size.

Synchronous behaviour in network model based on human cortico-cortical connections.

PubMed

Protachevicz, Paulo Ricardo; Borges, Rafael Ribaski; Reis, Adriane da Silva; Borges, Fernando da Silva; Iarosz, Kelly Cristina; Caldas, Ibere Luiz; Lameu, Ewandson Luiz; Macau, Elbert Einstein Nehrer; Viana, Ricardo Luiz; Sokolov, Igor M; Ferrari, Fabiano A S; Kurths, Jürgen; Batista, Antonio Marcos

2018-06-22

We consider a network topology according to the cortico-cortical connec- tion network of the human brain, where each cortical area is composed of a random network of adaptive exponential integrate-and-fire neurons. Depending on the parameters, this neuron model can exhibit spike or burst patterns. As a diagnostic tool to identify spike and burst patterns we utilise the coefficient of variation of the neuronal inter-spike interval. In our neuronal network, we verify the existence of spike and burst synchronisation in different cortical areas. Our simulations show that the network arrangement, i.e., its rich-club organisation, plays an important role in the transition of the areas from desynchronous to synchronous behaviours. © 2018 Institute of Physics and Engineering in Medicine.

Vaccination intervention on epidemic dynamics in networks

NASA Astrophysics Data System (ADS)

Peng, Xiao-Long; Xu, Xin-Jian; Fu, Xinchu; Zhou, Tao

2013-02-01

Vaccination is an important measure available for preventing or reducing the spread of infectious diseases. In this paper, an epidemic model including susceptible, infected, and imperfectly vaccinated compartments is studied on Watts-Strogatz small-world, Barabási-Albert scale-free, and random scale-free networks. The epidemic threshold and prevalence are analyzed. For small-world networks, the effective vaccination intervention is suggested and its influence on the threshold and prevalence is analyzed. For scale-free networks, the threshold is found to be strongly dependent both on the effective vaccination rate and on the connectivity distribution. Moreover, so long as vaccination is effective, it can linearly decrease the epidemic prevalence in small-world networks, whereas for scale-free networks it acts exponentially. These results can help in adopting pragmatic treatment upon diseases in structured populations.

Structurally Dynamic Spin Market Networks

NASA Astrophysics Data System (ADS)

Horváth, Denis; Kuscsik, Zoltán

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

Hopping in the Crowd to Unveil Network Topology.

PubMed

Asllani, Malbor; Carletti, Timoteo; Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

2018-04-13

We introduce a nonlinear operator to model diffusion on a complex undirected network under crowded conditions. We show that the asymptotic distribution of diffusing agents is a nonlinear function of the nodes' degree and saturates to a constant value for sufficiently large connectivities, at variance with standard diffusion in the absence of excluded-volume effects. Building on this observation, we define and solve an inverse problem, aimed at reconstructing the a priori unknown connectivity distribution. The method gathers all the necessary information by repeating a limited number of independent measurements of the asymptotic density at a single node, which can be chosen randomly. The technique is successfully tested against both synthetic and real data and is also shown to estimate with great accuracy the total number of nodes.

Hopping in the Crowd to Unveil Network Topology

NASA Astrophysics Data System (ADS)

Asllani, Malbor; Carletti, Timoteo; Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

2018-04-01

We introduce a nonlinear operator to model diffusion on a complex undirected network under crowded conditions. We show that the asymptotic distribution of diffusing agents is a nonlinear function of the nodes' degree and saturates to a constant value for sufficiently large connectivities, at variance with standard diffusion in the absence of excluded-volume effects. Building on this observation, we define and solve an inverse problem, aimed at reconstructing the a priori unknown connectivity distribution. The method gathers all the necessary information by repeating a limited number of independent measurements of the asymptotic density at a single node, which can be chosen randomly. The technique is successfully tested against both synthetic and real data and is also shown to estimate with great accuracy the total number of nodes.

Characterization of emergent synaptic topologies in noisy neural networks

NASA Astrophysics Data System (ADS)

Miller, Aaron James

Learned behaviors are one of the key contributors to an animal's ultimate survival. It is widely believed that the brain's microcircuitry undergoes structural changes when a new behavior is learned. In particular, motor learning, during which an animal learns a sequence of muscular movements, often requires precisely-timed coordination between muscles and becomes very natural once ingrained. Experiments show that neurons in the motor cortex exhibit precisely-timed spike activity when performing a learned motor behavior, and constituent stereotypical elements of the behavior can last several hundred milliseconds. The subject of this manuscript concerns how organized synaptic structures that produce stereotypical spike sequences emerge from random, dynamical networks. After a brief introduction in Chapter 1, we begin Chapter 2 by introducing a spike-timing-dependent plasticity (STDP) rule that defines how the activity of the network drives changes in network topology. The rule is then applied to idealized networks of leaky integrate-and-fire neurons (LIF). These neurons are not subjected to the variability that typically characterize neurons in vivo. In noiseless networks, synapses develop closed loops of strong connectivity that reproduce stereotypical, precisely-timed spike patterns from an initially random network. We demonstrate the characteristics of the asymptotic synaptic configuration are dependent on the statistics of the initial random network. The spike timings of the neurons simulated in Chapter 2 are generated exactly by a computationally economical, nonlinear mapping which is extended to LIF neurons injected with fluctuating current in Chapter 3. Development of an economical mapping that incorporates noise provides a practical solution to the long simulation times required to produce asymptotic synaptic topologies in networks with STDP in the presence of realistic neuronal variability. The mapping relies on generating numerical solutions to the dynamics of a LIF neuron subjected to Gaussian white noise (GWN). The system reduces to the Ornstein-Uhlenbeck first passage time problem, the solution of which we build into the mapping method of Chapter 2. We demonstrate that simulations using the stochastic mapping have reduced computation time compared to traditional Runge-Kutta methods by more than a factor of 150. In Chapter 4, we use the stochastic mapping to study the dynamics of emerging synaptic topologies in noisy networks. With the addition of membrane noise, networks with dynamical synapses can admit states in which the distribution of the synaptic weights is static under spontaneous activity, but the random connectivity between neurons is dynamical. The widely cited problem of instabilities in networks with STDP is avoided with the implementation of a synaptic decay and an activation threshold on each synapse. When such networks are presented with stimulus modeled by a focused excitatory current, chain-like networks can emerge with the addition of an axon-remodeling plasticity rule, a topological constraint on the connectivity modeling the finite resources available to each neuron. The emergent topologies are the result of an iterative stochastic process. The dynamics of the growth process suggest a strong interplay between the network topology and the spike sequences they produce during development. Namely, the existence of an embedded spike sequence alters the distribution of synaptic weights through the entire network. The roles of model parameters that affect the interplay between network structure and activity are elucidated. Finally, we propose two mathematical growth models, which are complementary, that capture the essence of the growth dynamics observed in simulations. In Chapter 5, we present an extension of the stochastic mapping that allows the possibility of neuronal cooperation. We demonstrate that synaptic topologies admitting stereotypical sequences can emerge in yet higher, biologically realistic levels of membrane potential variability when neurons cooperate to innervate shared targets. The structure that is most robust to the variability is that of a synfire chain. The principles of growth dynamics detailed in Chapter 4 are the same that sculpt the emergent synfire topologies. We conclude by discussing avenues for extensions of these results.

An investigation of emotion dynamics in major depressive disorder patients and healthy persons using sparse longitudinal networks.

PubMed

de Vos, Stijn; Wardenaar, Klaas J; Bos, Elisabeth H; Wit, Ernst C; Bouwmans, Mara E J; de Jonge, Peter

2017-01-01

Differences in within-person emotion dynamics may be an important source of heterogeneity in depression. To investigate these dynamics, researchers have previously combined multilevel regression analyses with network representations. However, sparse network methods, specifically developed for longitudinal network analyses, have not been applied. Therefore, this study used this approach to investigate population-level and individual-level emotion dynamics in healthy and depressed persons and compared this method with the multilevel approach. Time-series data were collected in pair-matched healthy persons and major depressive disorder (MDD) patients (n = 54). Seven positive affect (PA) and seven negative affect (NA) items were administered electronically at 90 times (30 days; thrice per day). The population-level (healthy vs. MDD) and individual-level time series were analyzed using a sparse longitudinal network model based on vector autoregression. The population-level model was also estimated with a multilevel approach. Effects of different preprocessing steps were evaluated as well. The characteristics of the longitudinal networks were investigated to gain insight into the emotion dynamics. In the population-level networks, longitudinal network connectivity was strongest in the healthy group, with nodes showing more and stronger longitudinal associations with each other. Individually estimated networks varied strongly across individuals. Individual variations in network connectivity were unrelated to baseline characteristics (depression status, neuroticism, severity). A multilevel approach applied to the same data showed higher connectivity in the MDD group, which seemed partly related to the preprocessing approach. The sparse network approach can be useful for the estimation of networks with multiple nodes, where overparameterization is an issue, and for individual-level networks. However, its current inability to model random effects makes it less useful as a population-level approach in case of large heterogeneity. Different preprocessing strategies appeared to strongly influence the results, complicating inferences about network density.

Resource Optimization Scheme for Multimedia-Enabled Wireless Mesh Networks

PubMed Central

Ali, Amjad; Ahmed, Muhammad Ejaz; Piran, Md. Jalil; Suh, Doug Young

2014-01-01

Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutilization problem. Moreover, random topology deployment leads to have some unused network resources. Therefore, resource optimization is one of the most critical design issues in multi-hop, multi-radio WMNs enabled with multimedia applications. Resource optimization has been studied extensively in the literature for wireless Ad Hoc and sensor networks, but existing studies have not considered resource underutilization issues caused by QoS provisioning routing and random topology deployment. Finding a QoS-provisioned path in wireless mesh networks is an NP complete problem. In this paper, we propose a novel Integer Linear Programming (ILP) optimization model to reconstruct the optimal connected mesh backbone topology with a minimum number of links and relay nodes which satisfies the given end-to-end QoS demands for multimedia traffic and identification of extra resources, while maintaining redundancy. We further propose a polynomial time heuristic algorithm called Link and Node Removal Considering Residual Capacity and Traffic Demands (LNR-RCTD). Simulation studies prove that our heuristic algorithm provides near-optimal results and saves about 20% of resources from being wasted by QoS provisioning routing and random topology deployment. PMID:25111241

Resource optimization scheme for multimedia-enabled wireless mesh networks.

PubMed

Ali, Amjad; Ahmed, Muhammad Ejaz; Piran, Md Jalil; Suh, Doug Young

2014-08-08

Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutilization problem. Moreover, random topology deployment leads to have some unused network resources. Therefore, resource optimization is one of the most critical design issues in multi-hop, multi-radio WMNs enabled with multimedia applications. Resource optimization has been studied extensively in the literature for wireless Ad Hoc and sensor networks, but existing studies have not considered resource underutilization issues caused by QoS provisioning routing and random topology deployment. Finding a QoS-provisioned path in wireless mesh networks is an NP complete problem. In this paper, we propose a novel Integer Linear Programming (ILP) optimization model to reconstruct the optimal connected mesh backbone topology with a minimum number of links and relay nodes which satisfies the given end-to-end QoS demands for multimedia traffic and identification of extra resources, while maintaining redundancy. We further propose a polynomial time heuristic algorithm called Link and Node Removal Considering Residual Capacity and Traffic Demands (LNR-RCTD). Simulation studies prove that our heuristic algorithm provides near-optimal results and saves about 20% of resources from being wasted by QoS provisioning routing and random topology deployment.

Spatial embedding of structural similarity in the cerebral cortex

PubMed Central

Song, H. Francis; Kennedy, Henry; Wang, Xiao-Jing

2014-01-01

Recent anatomical tracing studies have yielded substantial amounts of data on the areal connectivity underlying distributed processing in cortex, yet the fundamental principles that govern the large-scale organization of cortex remain unknown. Here we show that functional similarity between areas as defined by the pattern of shared inputs or outputs is a key to understanding the areal network of cortex. In particular, we report a systematic relation in the monkey, human, and mouse cortex between the occurrence of connections from one area to another and their similarity distance. This characteristic relation is rooted in the wiring distance dependence of connections in the brain. We introduce a weighted, spatially embedded random network model that robustly gives rise to this structure, as well as many other spatial and topological properties observed in cortex. These include features that were not accounted for in any previous model, such as the wide range of interareal connection weights. Connections in the model emerge from an underlying distribution of spatially embedded axons, thereby integrating the two scales of cortical connectivity—individual axons and interareal pathways—into a common geometric framework. These results provide insights into the origin of large-scale connectivity in cortex and have important implications for theories of cortical organization. PMID:25368200

Long-Term Oil Contamination Alters the Molecular Ecological Networks of Soil Microbial Functional Genes

PubMed Central

Liang, Yuting; Zhao, Huihui; Deng, Ye; Zhou, Jizhong; Li, Guanghe; Sun, Bo

2016-01-01

With knowledge on microbial composition and diversity, investigation of within-community interactions is a further step to elucidate microbial ecological functions, such as the biodegradation of hazardous contaminants. In this work, microbial functional molecular ecological networks were studied in both contaminated and uncontaminated soils to determine the possible influences of oil contamination on microbial interactions and potential functions. Soil samples were obtained from an oil-exploring site located in South China, and the microbial functional genes were analyzed with GeoChip, a high-throughput functional microarray. By building random networks based on null model, we demonstrated that overall network structures and properties were significantly different between contaminated and uncontaminated soils (P < 0.001). Network connectivity, module numbers, and modularity were all reduced with contamination. Moreover, the topological roles of the genes (module hub and connectors) were altered with oil contamination. Subnetworks of genes involved in alkane and polycyclic aromatic hydrocarbon degradation were also constructed. Negative co-occurrence patterns prevailed among functional genes, thereby indicating probable competition relationships. The potential “keystone” genes, defined as either “hubs” or genes with highest connectivities in the network, were further identified. The network constructed in this study predicted the potential effects of anthropogenic contamination on microbial community co-occurrence interactions. PMID:26870020

Structure, Function, and Propagation of Information across Living Two, Four, and Eight Node Degree Topologies.

PubMed

Alagapan, Sankaraleengam; Franca, Eric; Pan, Liangbin; Leondopulos, Stathis; Wheeler, Bruce C; DeMarse, Thomas B

2016-01-01

In this study, we created four network topologies composed of living cortical neurons and compared resultant structural-functional dynamics including the nature and quality of information transmission. Each living network was composed of living cortical neurons and were created using microstamping of adhesion promoting molecules and each was "designed" with different levels of convergence embedded within each structure. Networks were cultured over a grid of electrodes that permitted detailed measurements of neural activity at each node in the network. Of the topologies we tested, the "Random" networks in which neurons connect based on their own intrinsic properties transmitted information embedded within their spike trains with higher fidelity relative to any other topology we tested. Within our patterned topologies in which we explicitly manipulated structure, the effect of convergence on fidelity was dependent on both topology and time-scale (rate vs. temporal coding). A more detailed examination using tools from network analysis revealed that these changes in fidelity were also associated with a number of other structural properties including a node's degree, degree-degree correlations, path length, and clustering coefficients. Whereas information transmission was apparent among nodes with few connections, the greatest transmission fidelity was achieved among the few nodes possessing the highest number of connections (high degree nodes or putative hubs). These results provide a unique view into the relationship between structure and its affect on transmission fidelity, at least within these small neural populations with defined network topology. They also highlight the potential role of tools such as microstamp printing and microelectrode array recordings to construct and record from arbitrary network topologies to provide a new direction in which to advance the study of structure-function relationships.

Beta-Band Functional Connectivity Influences Audiovisual Integration in Older Age: An EEG Study

PubMed Central

Wang, Luyao; Wang, Wenhui; Yan, Tianyi; Song, Jiayong; Yang, Weiping; Wang, Bin; Go, Ritsu; Huang, Qiang; Wu, Jinglong

2017-01-01

Audiovisual integration occurs frequently and has been shown to exhibit age-related differences via behavior experiments or time-frequency analyses. In the present study, we examined whether functional connectivity influences audiovisual integration during normal aging. Visual, auditory, and audiovisual stimuli were randomly presented peripherally; during this time, participants were asked to respond immediately to the target stimulus. Electroencephalography recordings captured visual, auditory, and audiovisual processing in 12 old (60–78 years) and 12 young (22–28 years) male adults. For non-target stimuli, we focused on alpha (8–13 Hz), beta (13–30 Hz), and gamma (30–50 Hz) bands. We applied the Phase Lag Index to study the dynamics of functional connectivity. Then, the network topology parameters, which included the clustering coefficient, path length, small-worldness global efficiency, local efficiency and degree, were calculated for each condition. For the target stimulus, a race model was used to analyze the response time. Then, a Pearson correlation was used to test the relationship between each network topology parameters and response time. The results showed that old adults activated stronger connections during audiovisual processing in the beta band. The relationship between network topology parameters and the performance of audiovisual integration was detected only in old adults. Thus, we concluded that old adults who have a higher load during audiovisual integration need more cognitive resources. Furthermore, increased beta band functional connectivity influences the performance of audiovisual integration during normal aging. PMID:28824411

Beta-Band Functional Connectivity Influences Audiovisual Integration in Older Age: An EEG Study.

PubMed

Wang, Luyao; Wang, Wenhui; Yan, Tianyi; Song, Jiayong; Yang, Weiping; Wang, Bin; Go, Ritsu; Huang, Qiang; Wu, Jinglong

2017-01-01

Audiovisual integration occurs frequently and has been shown to exhibit age-related differences via behavior experiments or time-frequency analyses. In the present study, we examined whether functional connectivity influences audiovisual integration during normal aging. Visual, auditory, and audiovisual stimuli were randomly presented peripherally; during this time, participants were asked to respond immediately to the target stimulus. Electroencephalography recordings captured visual, auditory, and audiovisual processing in 12 old (60-78 years) and 12 young (22-28 years) male adults. For non-target stimuli, we focused on alpha (8-13 Hz), beta (13-30 Hz), and gamma (30-50 Hz) bands. We applied the Phase Lag Index to study the dynamics of functional connectivity. Then, the network topology parameters, which included the clustering coefficient, path length, small-worldness global efficiency, local efficiency and degree, were calculated for each condition. For the target stimulus, a race model was used to analyze the response time. Then, a Pearson correlation was used to test the relationship between each network topology parameters and response time. The results showed that old adults activated stronger connections during audiovisual processing in the beta band. The relationship between network topology parameters and the performance of audiovisual integration was detected only in old adults. Thus, we concluded that old adults who have a higher load during audiovisual integration need more cognitive resources. Furthermore, increased beta band functional connectivity influences the performance of audiovisual integration during normal aging.

Evolution of regulatory networks towards adaptability and stability in a changing environment

NASA Astrophysics Data System (ADS)

Lee, Deok-Sun

2014-11-01

Diverse biological networks exhibit universal features distinguished from those of random networks, calling much attention to their origins and implications. Here we propose a minimal evolution model of Boolean regulatory networks, which evolve by selectively rewiring links towards enhancing adaptability to a changing environment and stability against dynamical perturbations. We find that sparse and heterogeneous connectivity patterns emerge, which show qualitative agreement with real transcriptional regulatory networks and metabolic networks. The characteristic scaling behavior of stability reflects the balance between robustness and flexibility. The scaling of fluctuation in the perturbation spread shows a dynamic crossover, which is analyzed by investigating separately the stochasticity of internal dynamics and the network structure differences depending on the evolution pathways. Our study delineates how the ambivalent pressure of evolution shapes biological networks, which can be helpful for studying general complex systems interacting with environments.

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.

Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine

NASA Technical Reports Server (NTRS)

Rogers, David

1988-01-01

The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed.

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.

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.

Finite-time scaling at the Anderson transition for vibrations in solids

NASA Astrophysics Data System (ADS)

Beltukov, Y. M.; Skipetrov, S. E.

2017-11-01

A model in which a three-dimensional elastic medium is represented by a network of identical masses connected by springs of random strengths and allowed to vibrate only along a selected axis of the reference frame exhibits an Anderson localization transition. To study this transition, we assume that the dynamical matrix of the network is given by a product of a sparse random matrix with real, independent, Gaussian-distributed nonzero entries and its transpose. A finite-time scaling analysis of the system's response to an initial excitation allows us to estimate the critical parameters of the localization transition. The critical exponent is found to be ν =1.57 ±0.02 , in agreement with previous studies of the Anderson transition belonging to the three-dimensional orthogonal universality class.

Computational Account of Spontaneous Activity as a Signature of Predictive Coding

PubMed Central

Koren, Veronika

2017-01-01

Spontaneous activity is commonly observed in a variety of cortical states. Experimental evidence suggested that neural assemblies undergo slow oscillations with Up ad Down states even when the network is isolated from the rest of the brain. Here we show that these spontaneous events can be generated by the recurrent connections within the network and understood as signatures of neural circuits that are correcting their internal representation. A noiseless spiking neural network can represent its input signals most accurately when excitatory and inhibitory currents are as strong and as tightly balanced as possible. However, in the presence of realistic neural noise and synaptic delays, this may result in prohibitively large spike counts. An optimal working regime can be found by considering terms that control firing rates in the objective function from which the network is derived and then minimizing simultaneously the coding error and the cost of neural activity. In biological terms, this is equivalent to tuning neural thresholds and after-spike hyperpolarization. In suboptimal working regimes, we observe spontaneous activity even in the absence of feed-forward inputs. In an all-to-all randomly connected network, the entire population is involved in Up states. In spatially organized networks with local connectivity, Up states spread through local connections between neurons of similar selectivity and take the form of a traveling wave. Up states are observed for a wide range of parameters and have similar statistical properties in both active and quiescent state. In the optimal working regime, Up states are vanishing, leaving place to asynchronous activity, suggesting that this working regime is a signature of maximally efficient coding. Although they result in a massive increase in the firing activity, the read-out of spontaneous Up states is in fact orthogonal to the stimulus representation, therefore interfering minimally with the network function. PMID:28114353

Peer influence processes for youth delinquency and depression.

PubMed

Reynolds, Andrew D; Crea, Thomas M

2015-08-01

This study explores the multiple factors that account for peer influence processes of adolescent delinquency and depression using data from Waves I and II of the National Longitudinal Study of Adolescent to Adult Health (Add Health). Random-effects longitudinal negative binomial models were used to predict depression and delinquency, controlling for social connection variables to account for selection bias. Findings suggest peer depression and delinquency are both predictive of youth delinquency, while peer influences of depression are much more modest. Youth who are more connected to parents and communities and who are more popular within their networks are more susceptible to peer influence, while self-regulating youth are less susceptible. We find support for theories of popularity-socialization as well as weak-ties in explaining social network factors that amplify or constrain peer influence. We argue that practitioners working with youth should consider network-informed interventions to improve program efficacy and avoid iatrogenic effects. Copyright © 2015 The Foundation for Professionals in Services for Adolescents. Published by Elsevier Ltd. All rights reserved.

Resonant spatiotemporal learning in large random recurrent networks.

PubMed

Daucé, Emmanuel; Quoy, Mathias; Doyon, Bernard

2002-09-01

Taking a global analogy with the structure of perceptual biological systems, we present a system composed of two layers of real-valued sigmoidal neurons. The primary layer receives stimulating spatiotemporal signals, and the secondary layer is a fully connected random recurrent network. This secondary layer spontaneously displays complex chaotic dynamics. All connections have a constant time delay. We use for our experiments a Hebbian (covariance) learning rule. This rule slowly modifies the weights under the influence of a periodic stimulus. The effect of learning is twofold: (i) it simplifies the secondary-layer dynamics, which eventually stabilizes to a periodic orbit; and (ii) it connects the secondary layer to the primary layer, and realizes a feedback from the secondary to the primary layer. This feedback signal is added to the incoming signal, and matches it (i.e., the secondary layer performs a one-step prediction of the forthcoming stimulus). After learning, a resonant behavior can be observed: the system resonates with familiar stimuli, which activates a feedback signal. In particular, this resonance allows the recognition and retrieval of partial signals, and dynamic maintenance of the memory of past stimuli. This resonance is highly sensitive to the temporal relationships and to the periodicity of the presented stimuli. When we present stimuli which do not match in time or space, the feedback remains silent. The number of different stimuli for which resonant behavior can be learned is analyzed. As with Hopfield networks, the capacity is proportional to the size of the second, recurrent layer. Moreover, the high capacity displayed allows the implementation of our model on real-time systems interacting with their environment. Such an implementation is reported in the case of a simple behavior-based recognition task on a mobile robot. Finally, we present some functional analogies with biological systems in terms of autonomy and dynamic binding, and present some hypotheses on the computational role of feedback connections.

Spreading Effect of tDCS in Individuals with Attention-Deficit/Hyperactivity Disorder as Shown by Functional Cortical Networks: A Randomized, Double-Blind, Sham-Controlled Trial.

PubMed

Cosmo, Camila; Ferreira, Cândida; Miranda, José Garcia Vivas; do Rosário, Raphael Silva; Baptista, Abrahão Fontes; Montoya, Pedro; de Sena, Eduardo Pondé

2015-01-01

Transcranial direct current stimulation (tDCS) is known to modulate spontaneous neural network excitability. The cognitive improvement observed in previous trials raises the potential of this technique as a possible therapeutic tool for use in attention-deficit/hyperactivity disorder (ADHD) population. However, to explore the potential of this technique as a treatment approach, the functional parameters of brain connectivity and the extent of its effects need to be more fully investigated. The aim of this study was to investigate a functional cortical network (FCN) model based on electroencephalographic activity for studying the dynamic patterns of brain connectivity modulated by tDCS and the distribution of its effects in individuals with ADHD. Sixty ADHD patients participated in a parallel, randomized, double-blind, sham-controlled trial. Individuals underwent a single session of sham or anodal tDCS at 1 mA of current intensity over the left dorsolateral prefrontal cortex for 20 min. The acute effects of stimulation on brain connectivity were assessed using the FCN model based on electroencephalography activity. Comparing the weighted node degree within groups prior to and following the intervention, a statistically significant difference was found in the electrodes located on the target and correlated areas in the active group (p < 0.05), while no statistically significant results were found in the sham group (p ≥ 0.05; paired-sample Wilcoxon signed-rank test). Anodal tDCS increased functional brain connectivity in individuals with ADHD compared to data recorded in the baseline resting state. In addition, although some studies have suggested that the effects of tDCS are selective, the present findings show that its modulatory activity spreads. Further studies need to be performed to investigate the dynamic patterns and physiological mechanisms underlying the modulatory effects of tDCS. ClinicalTrials.gov NCT01968512.

Percolation Pore Network Study on the Residue Gas Saturation of Dry Reservoir Rocks

NASA Astrophysics Data System (ADS)

Cheng, T.; Tang, Y. B.; Zou, G. Y.; Jiang, K.; Li, M.

2014-12-01

We tried to model the effect of pore size heterogeneity and pore connectivity on the residue gas saturation for dry gas reservoir rocks. If we consider that snap-off does not exist and only piston displacement takes place in all pores with the same size during imbibition process, in the extreme case, the residue gas saturation will be equal to zero. Thus we can suppose that the residue gas saturation of dry rocks is mainly controlled by the pore size distribution. To verify the assumption, percolation pore networks (i.e., three-dimensional simple cubic (SC) and body-center cubic (BCC)) were used in the study. The connectivity and the pore size distribution in percolation pore network could be changed randomly. The concept of water phase connectivity zw(i.e., water coordination number) and gas phase connectivity zg (i.e., gas coordination number) was introduced here. zw and zg will change during simulation and can be estimated numerically from the results of simulations through gradually saturated networks by water. The Simulation results show that when zg less than or equal to 1.5 during water quasi - static imbibition, the gas will be trapped in rock pores. Network simulation results also shows that the residue gas saturation Srg follows a power law relationship (i.e.,Srg∝σrα, where σr is normalized standard deviation of the pore radius distribution, and exponent α is a function of coordination number). This indicates that the residue gas saturation has no explicit relationship with porosity and permeability as it should have in light of previous study, pore radius distribution is the principal factor in determining the residue gas saturation of dry reservoir rocks.

On the origins of hierarchy in complex networks

PubMed Central

Corominas-Murtra, Bernat; Goñi, Joaquín; Solé, Ricard V.; Rodríguez-Caso, Carlos

2013-01-01

Hierarchy seems to pervade complexity in both living and artificial systems. Despite its relevance, no general theory that captures all features of hierarchy and its origins has been proposed yet. Here we present a formal approach resulting from the convergence of theoretical morphology and network theory that allows constructing a 3D morphospace of hierarchies and hence comparing the hierarchical organization of ecological, cellular, technological, and social networks. Embedded within large voids in the morphospace of all possible hierarchies, four major groups are identified. Two of them match the expected from random networks with similar connectivity, thus suggesting that nonadaptive factors are at work. Ecological and gene networks define the other two, indicating that their topological order is the result of functional constraints. These results are consistent with an exploration of the morphospace, using in silico evolved networks. PMID:23898177

Self-organized network of fractal-shaped components coupled through statistical interaction.

PubMed

Ugajin, R

2001-09-01

A dissipative dynamics is introduced to generate self-organized networks of interacting objects, which we call coupled-fractal networks. The growth model is constructed based on a growth hypothesis in which the growth rate of each object is a product of the probability of receiving source materials from faraway and the probability of receiving adhesives from other grown objects, where each object grows to be a random fractal if isolated, but connects with others if glued. The network is governed by the statistical interaction between fractal-shaped components, which can only be identified in a statistical manner over ensembles. This interaction is investigated using the degree of correlation between fractal-shaped components, enabling us to determine whether it is attractive or repulsive.

Normal Stresses, Contraction, and Stiffening in Sheared Elastic Networks

NASA Astrophysics Data System (ADS)

Baumgarten, Karsten; Tighe, Brian P.

2018-04-01

When elastic solids are sheared, a nonlinear effect named after Poynting gives rise to normal stresses or changes in volume. We provide a novel relation between the Poynting effect and the microscopic Grüneisen parameter, which quantifies how stretching shifts vibrational modes. By applying this relation to random spring networks, a minimal model for, e.g., biopolymer gels and solid foams, we find that networks contract or develop tension because they vibrate faster when stretched. The amplitude of the Poynting effect is sensitive to the network's linear elastic moduli, which can be tuned via its preparation protocol and connectivity. Finally, we show that the Poynting effect can be used to predict the finite strain scale where the material stiffens under shear.

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

Entangling mobility and interactions in social media.

PubMed

Grabowicz, Przemyslaw A; Ramasco, José J; Gonçalves, Bruno; Eguíluz, Víctor M

2014-01-01

Daily interactions naturally define social circles. Individuals tend to be friends with the people they spend time with and they choose to spend time with their friends, inextricably entangling physical location and social relationships. As a result, it is possible to predict not only someone's location from their friends' locations but also friendship from spatial and temporal co-occurrence. While several models have been developed to separately describe mobility and the evolution of social networks, there is a lack of studies coupling social interactions and mobility. In this work, we introduce a model that bridges this gap by explicitly considering the feedback of mobility on the formation of social ties. Data coming from three online social networks (Twitter, Gowalla and Brightkite) is used for validation. Our model reproduces various topological and physical properties of the networks not captured by models uncoupling mobility and social interactions such as: i) the total size of the connected components, ii) the distance distribution between connected users, iii) the dependence of the reciprocity on the distance, iv) the variation of the social overlap and the clustering with the distance. Besides numerical simulations, a mean-field approach is also used to study analytically the main statistical features of the networks generated by a simplified version of our model. The robustness of the results to changes in the model parameters is explored, finding that a balance between friend visits and long-range random connections is essential to reproduce the geographical features of the empirical networks.

Exploring the Social Impact of Being a Typical Peer Model for Included Children with Autism Spectrum Disorder

PubMed Central

Locke, Jill; Fuller, Erin Rotheram; Kasari, Connie

2014-01-01

This study examined the social impact of being a typical peer model as part of a social skills intervention for children with autism spectrum disorder (ASD). Participants were drawn from a randomized-controlled-treatment trial that examined the effects of targeted interventions on the social networks of 60 elementary-aged children with ASD. Results demonstrated that typical peer models had higher social network centrality, received friendships, friendship quality, and less loneliness than non-peer models. Peer models were also more likely to be connected with children with ASD than non-peer models at baseline and exit. These results suggest that typical peers can be socially connected to children with ASD, as well as other classmates, and maintain a strong and positive role within the classroom. PMID:22215436

Hybrid Percolation Transition in Cluster Merging Processes: Continuously Varying Exponents

NASA Astrophysics Data System (ADS)

Cho, Y. S.; Lee, J. S.; Herrmann, H. J.; Kahng, B.

2016-01-01

Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of g fraction of the entire population in the smallest clusters. Here we show that this simple strategy for improving connection exhibits a more unusual phase transition, namely a hybrid percolation transition exhibiting the properties of both first-order and second-order phase transitions. The cluster size distribution of finite clusters at a transition point exhibits power-law behavior with a continuously varying exponent τ in the range 2 <τ (g )≤2.5 . This pattern reveals a necessary condition for a hybrid transition in cluster aggregation processes, which is comparable to the power-law behavior of the avalanche size distribution arising in models with link-deleting processes in interdependent networks.

Continuous theta-burst stimulation may improve visuospatial neglect via modulating the attention network: a randomized controlled study.

PubMed

Fu, Wei; Cao, Lei; Zhang, Yanming; Huo, Su; Du, JuBao; Zhu, Lin; Song, Weiqun

2017-05-01

Visuospatial neglect (VSN) is devastating and common after stroke, and is thought to involve functional disturbance of the attention network. Non-invasive theta-burst stimulation (TBS) may help restore the normal function of attention network, therefore facilitating recovery from VSN. This study investigated the effects of continuous TBS on resting-state functional connectivity (RSFC) in the attention network, and behavioral performances of patients with VSN after stroke. Twelve patients were randomly assigned to receive 10-day cTBS of the left posterior parietal cortex delivered at 80% (the cTBS group), or 40% (the active control group) of the resting motor threshold. Both groups received daily visual scanning training and motor function treatment. Resting-state functional MRI (fMRI) and behavioral tests including line bisection test and star cancelation test were conducted at baseline and after the treatment. At baseline, the two groups showed comparable results in the resting-state fMRI experiments and behavioral tests. After treatment, the cTBS group showed lower functional connectivity between right temporoparietal junction (TPJ) and right anterior insula, and between right superior temporal sulcus and right anterior insula, as compared with the active control group; both groups showed improvement in the behavioral tests, with the cTBS group showing larger changes from baseline than the active control group. cTBS of the left posterior parietal cortex in patients with VSN may induce changes in inter-regional RSFC in the right ventral attention network. These changes may be associated with improved recovery of behavioral deficits after behavioral training. The TPJ and superior temporal sulcus may play crucial roles in recovery from VSN.

Information processing in echo state networks at the edge of chaos.

PubMed

Boedecker, Joschka; Obst, Oliver; Lizier, Joseph T; Mayer, N Michael; Asada, Minoru

2012-09-01

We investigate information processing in randomly connected recurrent neural networks. It has been shown previously that the computational capabilities of these networks are maximized when the recurrent layer is close to the border between a stable and an unstable dynamics regime, the so called edge of chaos. The reasons, however, for this maximized performance are not completely understood. We adopt an information-theoretical framework and are for the first time able to quantify the computational capabilities between elements of these networks directly as they undergo the phase transition to chaos. Specifically, we present evidence that both information transfer and storage in the recurrent layer are maximized close to this phase transition, providing an explanation for why guiding the recurrent layer toward the edge of chaos is computationally useful. As a consequence, our study suggests self-organized ways of improving performance in recurrent neural networks, driven by input data. Moreover, the networks we study share important features with biological systems such as feedback connections and online computation on input streams. A key example is the cerebral cortex, which was shown to also operate close to the edge of chaos. Consequently, the behavior of model systems as studied here is likely to shed light on reasons why biological systems are tuned into this specific regime.

Optimal balance of the striatal medium spiny neuron network.

PubMed

Ponzi, Adam; Wickens, Jeffery R

2013-04-01

Slowly varying activity in the striatum, the main Basal Ganglia input structure, is important for the learning and execution of movement sequences. Striatal medium spiny neurons (MSNs) form cell assemblies whose population firing rates vary coherently on slow behaviourally relevant timescales. It has been shown that such activity emerges in a model of a local MSN network but only at realistic connectivities of 10 ~ 20% and only when MSN generated inhibitory post-synaptic potentials (IPSPs) are realistically sized. Here we suggest a reason for this. We investigate how MSN network generated population activity interacts with temporally varying cortical driving activity, as would occur in a behavioural task. We find that at unrealistically high connectivity a stable winners-take-all type regime is found where network activity separates into fixed stimulus dependent regularly firing and quiescent components. In this regime only a small number of population firing rate components interact with cortical stimulus variations. Around 15% connectivity a transition to a more dynamically active regime occurs where all cells constantly switch between activity and quiescence. In this low connectivity regime, MSN population components wander randomly and here too are independent of variations in cortical driving. Only in the transition regime do weak changes in cortical driving interact with many population components so that sequential cell assemblies are reproducibly activated for many hundreds of milliseconds after stimulus onset and peri-stimulus time histograms display strong stimulus and temporal specificity. We show that, remarkably, this activity is maximized at striatally realistic connectivities and IPSP sizes. Thus, we suggest the local MSN network has optimal characteristics - it is neither too stable to respond in a dynamically complex temporally extended way to cortical variations, nor is it too unstable to respond in a consistent repeatable way. Rather, it is optimized to generate stimulus dependent activity patterns for long periods after variations in cortical excitation.

Optimal Balance of the Striatal Medium Spiny Neuron Network

PubMed Central

Ponzi, Adam; Wickens, Jeffery R.

2013-01-01

Slowly varying activity in the striatum, the main Basal Ganglia input structure, is important for the learning and execution of movement sequences. Striatal medium spiny neurons (MSNs) form cell assemblies whose population firing rates vary coherently on slow behaviourally relevant timescales. It has been shown that such activity emerges in a model of a local MSN network but only at realistic connectivities of and only when MSN generated inhibitory post-synaptic potentials (IPSPs) are realistically sized. Here we suggest a reason for this. We investigate how MSN network generated population activity interacts with temporally varying cortical driving activity, as would occur in a behavioural task. We find that at unrealistically high connectivity a stable winners-take-all type regime is found where network activity separates into fixed stimulus dependent regularly firing and quiescent components. In this regime only a small number of population firing rate components interact with cortical stimulus variations. Around connectivity a transition to a more dynamically active regime occurs where all cells constantly switch between activity and quiescence. In this low connectivity regime, MSN population components wander randomly and here too are independent of variations in cortical driving. Only in the transition regime do weak changes in cortical driving interact with many population components so that sequential cell assemblies are reproducibly activated for many hundreds of milliseconds after stimulus onset and peri-stimulus time histograms display strong stimulus and temporal specificity. We show that, remarkably, this activity is maximized at striatally realistic connectivities and IPSP sizes. Thus, we suggest the local MSN network has optimal characteristics – it is neither too stable to respond in a dynamically complex temporally extended way to cortical variations, nor is it too unstable to respond in a consistent repeatable way. Rather, it is optimized to generate stimulus dependent activity patterns for long periods after variations in cortical excitation. PMID:23592954

Topology Counts: Force Distributions in Circular Spring Networks.

PubMed

Heidemann, Knut M; Sageman-Furnas, Andrew O; Sharma, Abhinav; Rehfeldt, Florian; Schmidt, Christoph F; Wardetzky, Max

2018-02-09

Filamentous polymer networks govern the mechanical properties of many biological materials. Force distributions within these networks are typically highly inhomogeneous, and, although the importance of force distributions for structural properties is well recognized, they are far from being understood quantitatively. Using a combination of probabilistic and graph-theoretical techniques, we derive force distributions in a model system consisting of ensembles of random linear spring networks on a circle. We show that characteristic quantities, such as the mean and variance of the force supported by individual springs, can be derived explicitly in terms of only two parameters: (i) average connectivity and (ii) number of nodes. Our analysis shows that a classical mean-field approach fails to capture these characteristic quantities correctly. In contrast, we demonstrate that network topology is a crucial determinant of force distributions in an elastic spring network. Our results for 1D linear spring networks readily generalize to arbitrary dimensions.

Maximizing synchronizability of duplex networks

NASA Astrophysics Data System (ADS)

Wei, Xiang; Emenheiser, Jeffrey; Wu, Xiaoqun; Lu, Jun-an; D'Souza, Raissa M.

2018-01-01

We study the synchronizability of duplex networks formed by two randomly generated network layers with different patterns of interlayer node connections. According to the master stability function, we use the smallest nonzero eigenvalue and the eigenratio between the largest and the second smallest eigenvalues of supra-Laplacian matrices to characterize synchronizability on various duplexes. We find that the interlayer linking weight and linking fraction have a profound impact on synchronizability of duplex networks. The increasingly large inter-layer coupling weight is found to cause either decreasing or constant synchronizability for different classes of network dynamics. In addition, negative node degree correlation across interlayer links outperforms positive degree correlation when most interlayer links are present. The reverse is true when a few interlayer links are present. The numerical results and understanding based on these representative duplex networks are illustrative and instructive for building insights into maximizing synchronizability of more realistic multiplex networks.

An FPGA Implementation of a Polychronous Spiking Neural Network with Delay Adaptation.

PubMed

Wang, Runchun; Cohen, Gregory; Stiefel, Klaus M; Hamilton, Tara Julia; Tapson, Jonathan; van Schaik, André

2013-01-01

We present an FPGA implementation of a re-configurable, polychronous spiking neural network with a large capacity for spatial-temporal patterns. The proposed neural network generates delay paths de novo, so that only connections that actually appear in the training patterns will be created. This allows the proposed network to use all the axons (variables) to store information. Spike Timing Dependent Delay Plasticity is used to fine-tune and add dynamics to the network. We use a time multiplexing approach allowing us to achieve 4096 (4k) neurons and up to 1.15 million programmable delay axons on a Virtex 6 FPGA. Test results show that the proposed neural network is capable of successfully recalling more than 95% of all spikes for 96% of the stored patterns. The tests also show that the neural network is robust to noise from random input spikes.

Contagion on complex networks with persuasion

NASA Astrophysics Data System (ADS)

Huang, Wei-Min; Zhang, Li-Jie; Xu, Xin-Jian; Fu, Xinchu

2016-03-01

The threshold model has been widely adopted as a classic model for studying contagion processes on social networks. We consider asymmetric individual interactions in social networks and introduce a persuasion mechanism into the threshold model. Specifically, we study a combination of adoption and persuasion in cascading processes on complex networks. It is found that with the introduction of the persuasion mechanism, the system may become more vulnerable to global cascades, and the effects of persuasion tend to be more significant in heterogeneous networks than those in homogeneous networks: a comparison between heterogeneous and homogeneous networks shows that under weak persuasion, heterogeneous networks tend to be more robust against random shocks than homogeneous networks; whereas under strong persuasion, homogeneous networks are more stable. Finally, we study the effects of adoption and persuasion threshold heterogeneity on systemic stability. Though both heterogeneities give rise to global cascades, the adoption heterogeneity has an overwhelmingly stronger impact than the persuasion heterogeneity when the network connectivity is sufficiently dense.

Contagion on complex networks with persuasion

PubMed Central

Huang, Wei-Min; Zhang, Li-Jie; Xu, Xin-Jian; Fu, Xinchu

2016-01-01

The threshold model has been widely adopted as a classic model for studying contagion processes on social networks. We consider asymmetric individual interactions in social networks and introduce a persuasion mechanism into the threshold model. Specifically, we study a combination of adoption and persuasion in cascading processes on complex networks. It is found that with the introduction of the persuasion mechanism, the system may become more vulnerable to global cascades, and the effects of persuasion tend to be more significant in heterogeneous networks than those in homogeneous networks: a comparison between heterogeneous and homogeneous networks shows that under weak persuasion, heterogeneous networks tend to be more robust against random shocks than homogeneous networks; whereas under strong persuasion, homogeneous networks are more stable. Finally, we study the effects of adoption and persuasion threshold heterogeneity on systemic stability. Though both heterogeneities give rise to global cascades, the adoption heterogeneity has an overwhelmingly stronger impact than the persuasion heterogeneity when the network connectivity is sufficiently dense. PMID:27029498

Contagion on complex networks with persuasion.

PubMed

Huang, Wei-Min; Zhang, Li-Jie; Xu, Xin-Jian; Fu, Xinchu

2016-03-31

The threshold model has been widely adopted as a classic model for studying contagion processes on social networks. We consider asymmetric individual interactions in social networks and introduce a persuasion mechanism into the threshold model. Specifically, we study a combination of adoption and persuasion in cascading processes on complex networks. It is found that with the introduction of the persuasion mechanism, the system may become more vulnerable to global cascades, and the effects of persuasion tend to be more significant in heterogeneous networks than those in homogeneous networks: a comparison between heterogeneous and homogeneous networks shows that under weak persuasion, heterogeneous networks tend to be more robust against random shocks than homogeneous networks; whereas under strong persuasion, homogeneous networks are more stable. Finally, we study the effects of adoption and persuasion threshold heterogeneity on systemic stability. Though both heterogeneities give rise to global cascades, the adoption heterogeneity has an overwhelmingly stronger impact than the persuasion heterogeneity when the network connectivity is sufficiently dense.

CROSS-DISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: The Fractal Dimensions of Complex Networks

NASA Astrophysics Data System (ADS)

Guo, Long; Cai, XU

2009-08-01

It is shown that many real complex networks share distinctive features, such as the small-world effect and the heterogeneous property of connectivity of vertices, which are different from random networks and regular lattices. Although these features capture the important characteristics of complex networks, their applicability depends on the style of networks. To unravel the universal characteristics many complex networks have in common, we study the fractal dimensions of complex networks using the method introduced by Shanker. We find that the average 'density' (ρ(r)) of complex networks follows a better power-law function as a function of distance r with the exponent df, which is defined as the fractal dimension, in some real complex networks. Furthermore, we study the relation between df and the shortcuts Nadd in small-world networks and the size N in regular lattices. Our present work provides a new perspective to understand the dependence of the fractal dimension df on the complex network structure.

Connectomic markers of disease expression, genetic risk and resilience in bipolar disorder

PubMed Central

Dima, D; Roberts, R E; Frangou, S

2016-01-01

Bipolar disorder (BD) is characterized by emotional dysregulation and cognitive deficits associated with abnormal connectivity between subcortical—primarily emotional processing regions—and prefrontal regulatory areas. Given the significant contribution of genetic factors to BD, studies in unaffected first-degree relatives can identify neural mechanisms of genetic risk but also resilience, thus paving the way for preventive interventions. Dynamic causal modeling (DCM) and random-effects Bayesian model selection were used to define and assess connectomic phenotypes linked to facial affect processing and working memory in a demographically matched sample of first-degree relatives carefully selected for resilience (n=25), euthymic patients with BD (n=41) and unrelated healthy controls (n=46). During facial affect processing, patients and relatives showed similarly increased frontolimbic connectivity; resilient relatives, however, evidenced additional adaptive hyperconnectivity within the ventral visual stream. During working memory processing, patients displayed widespread hypoconnectivity within the corresponding network. In contrast, working memory network connectivity in resilient relatives was comparable to that of controls. Our results indicate that frontolimbic dysfunction during affect processing could represent a marker of genetic risk to BD, and diffuse hypoconnectivity within the working memory network a marker of disease expression. The association of hyperconnectivity within the affect-processing network with resilience to BD suggests adaptive plasticity that allows for compensatory changes and encourages further investigation of this phenotype in genetic and early intervention studies. PMID:26731443

Connectomic markers of disease expression, genetic risk and resilience in bipolar disorder.

PubMed

Dima, D; Roberts, R E; Frangou, S

2016-01-05

Bipolar disorder (BD) is characterized by emotional dysregulation and cognitive deficits associated with abnormal connectivity between subcortical-primarily emotional processing regions-and prefrontal regulatory areas. Given the significant contribution of genetic factors to BD, studies in unaffected first-degree relatives can identify neural mechanisms of genetic risk but also resilience, thus paving the way for preventive interventions. Dynamic causal modeling (DCM) and random-effects Bayesian model selection were used to define and assess connectomic phenotypes linked to facial affect processing and working memory in a demographically matched sample of first-degree relatives carefully selected for resilience (n=25), euthymic patients with BD (n=41) and unrelated healthy controls (n=46). During facial affect processing, patients and relatives showed similarly increased frontolimbic connectivity; resilient relatives, however, evidenced additional adaptive hyperconnectivity within the ventral visual stream. During working memory processing, patients displayed widespread hypoconnectivity within the corresponding network. In contrast, working memory network connectivity in resilient relatives was comparable to that of controls. Our results indicate that frontolimbic dysfunction during affect processing could represent a marker of genetic risk to BD, and diffuse hypoconnectivity within the working memory network a marker of disease expression. The association of hyperconnectivity within the affect-processing network with resilience to BD suggests adaptive plasticity that allows for compensatory changes and encourages further investigation of this phenotype in genetic and early intervention studies.

Do all roads lead to Rome? A comparison of brain networks derived from inter-subject volumetric and metabolic covariance and moment-to-moment hemodynamic correlations in old individuals.

PubMed

Di, Xin; Gohel, Suril; Thielcke, Andre; Wehrl, Hans F; Biswal, Bharat B

2017-11-01

Relationships between spatially remote brain regions in human have typically been estimated by moment-to-moment correlations of blood-oxygen-level dependent signals in resting-state using functional MRI (fMRI). Recently, studies using subject-to-subject covariance of anatomical volumes, cortical thickness, and metabolic activity are becoming increasingly popular. However, question remains on whether these measures reflect the same inter-region connectivity and brain network organizations. In the current study, we systematically analyzed inter-subject volumetric covariance from anatomical MRI images, metabolic covariance from fluorodeoxyglucose positron emission tomography images from 193 healthy subjects, and resting-state moment-to-moment correlations from fMRI images of a subset of 44 subjects. The correlation matrices calculated from the three methods were found to be minimally correlated, with higher correlation in the range of 0.31, as well as limited proportion of overlapping connections. The volumetric network showed the highest global efficiency and lowest mean clustering coefficient, leaning toward random-like network, while the metabolic and resting-state networks conveyed properties more resembling small-world networks. Community structures of the volumetric and metabolic networks did not reflect known functional organizations, which could be observed in resting-state network. The current results suggested that inter-subject volumetric and metabolic covariance do not necessarily reflect the inter-regional relationships and network organizations as resting-state correlations, thus calling for cautions on interpreting results of inter-subject covariance networks.

Low-rank network decomposition reveals structural characteristics of small-world networks

NASA Astrophysics Data System (ADS)

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

2015-12-01

Small-world networks occur naturally throughout biological, technological, and social systems. With their prevalence, it is particularly important to prudently identify small-world networks and further characterize their unique connection structure with respect to network function. In this work we develop a formalism for classifying networks and identifying small-world structure using a decomposition of network connectivity matrices into low-rank and sparse components, corresponding to connections within clusters of highly connected nodes and sparse interconnections between clusters, respectively. We show that the network decomposition is independent of node indexing and define associated bounded measures of connectivity structure, which provide insight into the clustering and regularity of network connections. While many existing network characterizations rely on constructing benchmark networks for comparison or fail to describe the structural properties of relatively densely connected networks, our classification relies only on the intrinsic network structure and is quite robust with respect to changes in connection density, producing stable results across network realizations. Using this framework, we analyze several real-world networks and reveal new structural properties, which are often indiscernible by previously established characterizations of network connectivity.

Network Sampling with Memory: A proposal for more efficient sampling from social networks.

PubMed

Mouw, Ted; Verdery, Ashton M

2012-08-01

Techniques for sampling from networks have grown into an important area of research across several fields. For sociologists, the possibility of sampling from a network is appealing for two reasons: (1) A network sample can yield substantively interesting data about network structures and social interactions, and (2) it is useful in situations where study populations are difficult or impossible to survey with traditional sampling approaches because of the lack of a sampling frame. Despite its appeal, methodological concerns about the precision and accuracy of network-based sampling methods remain. In particular, recent research has shown that sampling from a network using a random walk based approach such as Respondent Driven Sampling (RDS) can result in high design effects (DE)-the ratio of the sampling variance to the sampling variance of simple random sampling (SRS). A high design effect means that more cases must be collected to achieve the same level of precision as SRS. In this paper we propose an alternative strategy, Network Sampling with Memory (NSM), which collects network data from respondents in order to reduce design effects and, correspondingly, the number of interviews needed to achieve a given level of statistical power. NSM combines a "List" mode, where all individuals on the revealed network list are sampled with the same cumulative probability, with a "Search" mode, which gives priority to bridge nodes connecting the current sample to unexplored parts of the network. We test the relative efficiency of NSM compared to RDS and SRS on 162 school and university networks from Add Health and Facebook that range in size from 110 to 16,278 nodes. The results show that the average design effect for NSM on these 162 networks is 1.16, which is very close to the efficiency of a simple random sample (DE=1), and 98.5% lower than the average DE we observed for RDS.

Network Sampling with Memory: A proposal for more efficient sampling from social networks

PubMed Central

Mouw, Ted; Verdery, Ashton M.

2013-01-01

Techniques for sampling from networks have grown into an important area of research across several fields. For sociologists, the possibility of sampling from a network is appealing for two reasons: (1) A network sample can yield substantively interesting data about network structures and social interactions, and (2) it is useful in situations where study populations are difficult or impossible to survey with traditional sampling approaches because of the lack of a sampling frame. Despite its appeal, methodological concerns about the precision and accuracy of network-based sampling methods remain. In particular, recent research has shown that sampling from a network using a random walk based approach such as Respondent Driven Sampling (RDS) can result in high design effects (DE)—the ratio of the sampling variance to the sampling variance of simple random sampling (SRS). A high design effect means that more cases must be collected to achieve the same level of precision as SRS. In this paper we propose an alternative strategy, Network Sampling with Memory (NSM), which collects network data from respondents in order to reduce design effects and, correspondingly, the number of interviews needed to achieve a given level of statistical power. NSM combines a “List” mode, where all individuals on the revealed network list are sampled with the same cumulative probability, with a “Search” mode, which gives priority to bridge nodes connecting the current sample to unexplored parts of the network. We test the relative efficiency of NSM compared to RDS and SRS on 162 school and university networks from Add Health and Facebook that range in size from 110 to 16,278 nodes. The results show that the average design effect for NSM on these 162 networks is 1.16, which is very close to the efficiency of a simple random sample (DE=1), and 98.5% lower than the average DE we observed for RDS. PMID:24159246

Atomoxetine restores the response inhibition network in Parkinson’s disease

PubMed Central

Rae, Charlotte L.; Nombela, Cristina; Rodríguez, Patricia Vázquez; Ye, Zheng; Hughes, Laura E.; Jones, P. Simon; Ham, Timothy; Rittman, Timothy; Coyle-Gilchrist, Ian; Regenthal, Ralf; Sahakian, Barbara J.; Barker, Roger A.; Robbins, Trevor W.

2016-01-01

Abstract Parkinson’s disease impairs the inhibition of responses, and whilst impulsivity is mild for some patients, severe impulse control disorders affect ∼10% of cases. Based on preclinical models we proposed that noradrenergic denervation contributes to the impairment of response inhibition, via changes in the prefrontal cortex and its subcortical connections. Previous work in Parkinson’s disease found that the selective noradrenaline reuptake inhibitor atomoxetine could improve response inhibition, gambling decisions and reflection impulsivity. Here we tested the hypotheses that atomoxetine can restore functional brain networks for response inhibition in Parkinson’s disease, and that both structural and functional connectivity determine the behavioural effect. In a randomized, double-blind placebo-controlled crossover study, 19 patients with mild-to-moderate idiopathic Parkinson’s disease underwent functional magnetic resonance imaging during a stop-signal task, while on their usual dopaminergic therapy. Patients received 40 mg atomoxetine or placebo, orally. This regimen anticipates that noradrenergic therapies for behavioural symptoms would be adjunctive to, not a replacement for, dopaminergic therapy. Twenty matched control participants provided normative data. Arterial spin labelling identified no significant changes in regional perfusion. We assessed functional interactions between key frontal and subcortical brain areas for response inhibition, by comparing 20 dynamic causal models of the response inhibition network, inverted to the functional magnetic resonance imaging data and compared using random effects model selection. We found that the normal interaction between pre-supplementary motor cortex and the inferior frontal gyrus was absent in Parkinson’s disease patients on placebo (despite dopaminergic therapy), but this connection was restored by atomoxetine. The behavioural change in response inhibition (improvement indicated by reduced stop-signal reaction time) following atomoxetine correlated with structural connectivity as measured by the fractional anisotropy in the white matter underlying the inferior frontal gyrus. Using multiple regression models, we examined the factors that influenced the individual differences in the response to atomoxetine: the reduction in stop-signal reaction time correlated with structural connectivity and baseline performance, while disease severity and drug plasma level predicted the change in fronto-striatal effective connectivity following atomoxetine. These results suggest that (i) atomoxetine increases sensitivity of the inferior frontal gyrus to afferent inputs from the pre-supplementary motor cortex; (ii) atomoxetine can enhance downstream modulation of frontal-subcortical connections for response inhibition; and (iii) the behavioural consequences of treatment are dependent on fronto-striatal structural connections. The individual differences in behavioural responses to atomoxetine highlight the need for patient stratification in future clinical trials of noradrenergic therapies for Parkinson’s disease. PMID:27343257

Structural connectivity in schizophrenia and its impact on the dynamics of spontaneous functional networks

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

Cabral, Joana; Department of Psychiatry, University of Oxford, Oxford OX3 7JX; Fernandes, Henrique M.

The neuropathology of schizophrenia remains unclear. Some insight has come from modern neuroimaging techniques, which offer an unparalleled opportunity to explore in vivo the structure and function of the brain. Using functional magnetic resonance imaging, it has been found that the large-scale resting-state functional connectivity (rsFC) in schizophrenia — measured as the temporal correlations of the blood-oxygen-level-dependent (BOLD) signal — exhibit altered network topology, with lower small-world index. The origin of these rsFC alterations and link with the underlying structural connectivity remain unclear. In this work, we used a computational model of spontaneous large-scale brain activity to explore the rolemore » of the structural connectivity in the large-scale dynamics of the brain in health and schizophrenia. The structural connectomes from 15 adolescent patients with early-onset schizophrenia and 15 age- and gender-matched controls were built from diffusion tensor imaging data to detect the white matter tracts between 90 brain areas. Brain areas, simulated using a reduced dynamic mean-field model, receive excitatory input from other areas in proportion to the number of fibre tracts between them. The simulated mean field activity was transformed into BOLD signal, and the properties of the simulated functional networks were analyzed. Our results suggest that the functional alterations observed in schizophrenia are not directly linked to alterations in the structural topology. Instead, subtly randomized and less small-world functional networks appear when the brain operates with lower global coupling, which shifts the dynamics from the optimal healthy regime.« less

Structural connectivity in schizophrenia and its impact on the dynamics of spontaneous functional networks

NASA Astrophysics Data System (ADS)

Cabral, Joana; Fernandes, Henrique M.; Van Hartevelt, Tim J.; James, Anthony C.; Kringelbach, Morten L.; Deco, Gustavo

2013-12-01

The neuropathology of schizophrenia remains unclear. Some insight has come from modern neuroimaging techniques, which offer an unparalleled opportunity to explore in vivo the structure and function of the brain. Using functional magnetic resonance imaging, it has been found that the large-scale resting-state functional connectivity (rsFC) in schizophrenia — measured as the temporal correlations of the blood-oxygen-level-dependent (BOLD) signal — exhibit altered network topology, with lower small-world index. The origin of these rsFC alterations and link with the underlying structural connectivity remain unclear. In this work, we used a computational model of spontaneous large-scale brain activity to explore the role of the structural connectivity in the large-scale dynamics of the brain in health and schizophrenia. The structural connectomes from 15 adolescent patients with early-onset schizophrenia and 15 age- and gender-matched controls were built from diffusion tensor imaging data to detect the white matter tracts between 90 brain areas. Brain areas, simulated using a reduced dynamic mean-field model, receive excitatory input from other areas in proportion to the number of fibre tracts between them. The simulated mean field activity was transformed into BOLD signal, and the properties of the simulated functional networks were analyzed. Our results suggest that the functional alterations observed in schizophrenia are not directly linked to alterations in the structural topology. Instead, subtly randomized and less small-world functional networks appear when the brain operates with lower global coupling, which shifts the dynamics from the optimal healthy regime.

Social network analysis for assessment of avian influenza spread and trading patterns of backyard chickens in Nakhon Pathom, Suphan Buri and Ratchaburi, Thailand.

PubMed

Poolkhet, C; Chairatanayuth, P; Thongratsakul, S; Yatbantoong, N; Kasemsuwan, S; Damchoey, D; Rukkwamsuk, T

2013-09-01

The aim of this study is to explain the social networks of the backyard chicken in Ratchaburi, Suphan Buri and Nakhon Pathom Provinces. In this study, we designed the nodes as groups of persons or places involved in activities relating to backyard chickens. The ties are all activities related to the nodes. The study applied a partial network approach to assess the spreading pattern of avian influenza. From 557 questionnaires collected from the nodes, the researchers found that the degree (the numbers of ties that a node has) and closeness (the distance from one node to the others) centralities of Nakhon Pathom were significantly higher than those of the others (P<0.001). The results show that compared with the remaining areas, this area is more quickly connected to many links. If the avian influenza virus subtype H5N1 was released into the network, the disease would spread throughout this province more rapidly than in Ratchaburi and Suphan Buri. The betweenness centrality in each of these provinces showed no differences (P>0.05). In this study, the nodes that play an important role in all networks are farmers who raise consumable chicken, farmers who raise both consumable chicken and fighting cocks, farmers' households that connect with dominant nodes, and the owners and observers of fighting cocks at arenas and training fields. In this study, we did not find cut points or blocks in the network. Moreover, we detected a random network in all provinces. Thus, connectivity between the nodes covers long or short distances, with less predictable behaviour. Finally, this study suggests that activities between the important nodes must receive special attention for disease control during future disease outbreaks. © 2012 Blackwell Verlag GmbH.

Transition to Chaos in Random Neuronal Networks

NASA Astrophysics Data System (ADS)

Kadmon, Jonathan; Sompolinsky, Haim

2015-10-01

Firing patterns in the central nervous system often exhibit strong temporal irregularity and considerable heterogeneity in time-averaged response properties. Previous studies suggested that these properties are the outcome of the intrinsic chaotic dynamics of the neural circuits. Indeed, simplified rate-based neuronal networks with synaptic connections drawn from Gaussian distribution and sigmoidal nonlinearity are known to exhibit chaotic dynamics when the synaptic gain (i.e., connection variance) is sufficiently large. In the limit of an infinitely large network, there is a sharp transition from a fixed point to chaos, as the synaptic gain reaches a critical value. Near the onset, chaotic fluctuations are slow, analogous to the ubiquitous, slow irregular fluctuations observed in the firing rates of many cortical circuits. However, the existence of a transition from a fixed point to chaos in neuronal circuit models with more realistic architectures and firing dynamics has not been established. In this work, we investigate rate-based dynamics of neuronal circuits composed of several subpopulations with randomly diluted connections. Nonzero connections are either positive for excitatory neurons or negative for inhibitory ones, while single neuron output is strictly positive with output rates rising as a power law above threshold, in line with known constraints in many biological systems. Using dynamic mean field theory, we find the phase diagram depicting the regimes of stable fixed-point, unstable-dynamic, and chaotic-rate fluctuations. We focus on the latter and characterize the properties of systems near this transition. We show that dilute excitatory-inhibitory architectures exhibit the same onset to chaos as the single population with Gaussian connectivity. In these architectures, the large mean excitatory and inhibitory inputs dynamically balance each other, amplifying the effect of the residual fluctuations. Importantly, the existence of a transition to chaos and its critical properties depend on the shape of the single-neuron nonlinear input-output transfer function, near firing threshold. In particular, for nonlinear transfer functions with a sharp rise near threshold, the transition to chaos disappears in the limit of a large network; instead, the system exhibits chaotic fluctuations even for small synaptic gain. Finally, we investigate transition to chaos in network models with spiking dynamics. We show that when synaptic time constants are slow relative to the mean inverse firing rates, the network undergoes a transition from fast spiking fluctuations with constant rates to a state where the firing rates exhibit chaotic fluctuations, similar to the transition predicted by rate-based dynamics. Systems with finite synaptic time constants and firing rates exhibit a smooth transition from a regime dominated by stationary firing rates to a regime of slow rate fluctuations. This smooth crossover obeys scaling properties, similar to crossover phenomena in statistical mechanics. The theoretical results are supported by computer simulations of several neuronal architectures and dynamics. Consequences for cortical circuit dynamics are discussed. These results advance our understanding of the properties of intrinsic dynamics in realistic neuronal networks and their functional consequences.

Characterization of known protein complexes using k-connectivity and other topological measures

PubMed Central

Gallagher, Suzanne R; Goldberg, Debra S

2015-01-01

Many protein complexes are densely packed, so proteins within complexes often interact with several other proteins in the complex. Steric constraints prevent most proteins from simultaneously binding more than a handful of other proteins, regardless of the number of proteins in the complex. Because of this, as complex size increases, several measures of the complex decrease within protein-protein interaction networks. However, k-connectivity, the number of vertices or edges that need to be removed in order to disconnect a graph, may be consistently high for protein complexes. The property of k-connectivity has been little used previously in the investigation of protein-protein interactions. To understand the discriminative power of k-connectivity and other topological measures for identifying unknown protein complexes, we characterized these properties in known Saccharomyces cerevisiae protein complexes in networks generated both from highly accurate X-ray crystallography experiments which give an accurate model of each complex, and also as the complexes appear in high-throughput yeast 2-hybrid studies in which new complexes may be discovered. We also computed these properties for appropriate random subgraphs.We found that clustering coefficient, mutual clustering coefficient, and k-connectivity are better indicators of known protein complexes than edge density, degree, or betweenness. This suggests new directions for future protein complex-finding algorithms. PMID:26913183

Signal propagation and logic gating in networks of integrate-and-fire neurons.

PubMed

Vogels, Tim P; Abbott, L F

2005-11-16

Transmission of signals within the brain is essential for cognitive function, but it is not clear how neural circuits support reliable and accurate signal propagation over a sufficiently large dynamic range. Two modes of propagation have been studied: synfire chains, in which synchronous activity travels through feedforward layers of a neuronal network, and the propagation of fluctuations in firing rate across these layers. In both cases, a sufficient amount of noise, which was added to previous models from an external source, had to be included to support stable propagation. Sparse, randomly connected networks of spiking model neurons can generate chaotic patterns of activity. We investigate whether this activity, which is a more realistic noise source, is sufficient to allow for signal transmission. We find that, for rate-coded signals but not for synfire chains, such networks support robust and accurate signal reproduction through up to six layers if appropriate adjustments are made in synaptic strengths. We investigate the factors affecting transmission and show that multiple signals can propagate simultaneously along different pathways. Using this feature, we show how different types of logic gates can arise within the architecture of the random network through the strengthening of specific synapses.

Non-consensus opinion model with a neutral view on complex networks

NASA Astrophysics Data System (ADS)

Tian, Zihao; Dong, Gaogao; Du, Ruijin; Ma, Jing

2016-05-01

A nonconsensus opinion (NCO) model was introduced recently, which allows the stable coexistence of minority and majority opinions. However, due ​to disparities in the knowledge, experiences, and personality or self-protection of agents, they often remain ​neutral when faced with some opinions in real scenarios. ​To address this issue, we propose a general non-consensus opinion model with neutral view (NCON) ​and we define the dynamic opinion ​change process. We applied the NCON model to different topological networks and studied the formation of opinion clusters. In the case of random graphs, random regular networks, and scale-free (SF) networks, we found that the system moved from a continuous phase transition to a discontinuous phase transition as the connectivity density and exponent of the SF network λ ​decreased and increased in the steady state, respectively. Moreover, the initial proportions of neutral opinions were found to have little effect on the proportional structure of opinions at the steady state. These results suggest that the majority choice between positive and negative opinions depends on the initial proportion of each opinion. The NCON model may have potential applications for decision makers.

Spatial Light Modulators as Optical Crossbar Switches

NASA Technical Reports Server (NTRS)

Juday, Richard

2003-01-01

A proposed method of implementing cross connections in an optical communication network is based on the use of a spatial light modulator (SLM) to form controlled diffraction patterns that connect inputs (light sources) and outputs (light sinks). Sources would typically include optical fibers and/or light-emitting diodes; sinks would typically include optical fibers and/or photodetectors. The sources and/or sinks could be distributed in two dimensions; that is, on planes. Alternatively or in addition, sources and/or sinks could be distributed in three dimensions -- for example, on curved surfaces or in more complex (including random) three-dimensional patterns.

A stochastic Markov chain model to describe lung cancer growth and metastasis.

PubMed

Newton, Paul K; Mason, Jeremy; Bethel, Kelly; Bazhenova, Lyudmila A; Nieva, Jorge; Kuhn, Peter

2012-01-01

A stochastic Markov chain model for metastatic progression is developed for primary lung cancer based on a network construction of metastatic sites with dynamics modeled as an ensemble of random walkers on the network. We calculate a transition matrix, with entries (transition probabilities) interpreted as random variables, and use it to construct a circular bi-directional network of primary and metastatic locations based on postmortem tissue analysis of 3827 autopsies on untreated patients documenting all primary tumor locations and metastatic sites from this population. The resulting 50 potential metastatic sites are connected by directed edges with distributed weightings, where the site connections and weightings are obtained by calculating the entries of an ensemble of transition matrices so that the steady-state distribution obtained from the long-time limit of the Markov chain dynamical system corresponds to the ensemble metastatic distribution obtained from the autopsy data set. We condition our search for a transition matrix on an initial distribution of metastatic tumors obtained from the data set. Through an iterative numerical search procedure, we adjust the entries of a sequence of approximations until a transition matrix with the correct steady-state is found (up to a numerical threshold). Since this constrained linear optimization problem is underdetermined, we characterize the statistical variance of the ensemble of transition matrices calculated using the means and variances of their singular value distributions as a diagnostic tool. We interpret the ensemble averaged transition probabilities as (approximately) normally distributed random variables. The model allows us to simulate and quantify disease progression pathways and timescales of progression from the lung position to other sites and we highlight several key findings based on the model.

Topological and organizational properties of the products of house-keeping and tissue-specific genes in protein-protein interaction networks.

PubMed

Lin, Wen-Hsien; Liu, Wei-Chung; Hwang, Ming-Jing

2009-03-11

Human cells of various tissue types differ greatly in morphology despite having the same set of genetic information. Some genes are expressed in all cell types to perform house-keeping functions, while some are selectively expressed to perform tissue-specific functions. In this study, we wished to elucidate how proteins encoded by human house-keeping genes and tissue-specific genes are organized in human protein-protein interaction networks. We constructed protein-protein interaction networks for different tissue types using two gene expression datasets and one protein-protein interaction database. We then calculated three network indices of topological importance, the degree, closeness, and betweenness centralities, to measure the network position of proteins encoded by house-keeping and tissue-specific genes, and quantified their local connectivity structure. Compared to a random selection of proteins, house-keeping gene-encoded proteins tended to have a greater number of directly interacting neighbors and occupy network positions in several shortest paths of interaction between protein pairs, whereas tissue-specific gene-encoded proteins did not. In addition, house-keeping gene-encoded proteins tended to connect with other house-keeping gene-encoded proteins in all tissue types, whereas tissue-specific gene-encoded proteins also tended to connect with other tissue-specific gene-encoded proteins, but only in approximately half of the tissue types examined. Our analysis showed that house-keeping gene-encoded proteins tend to occupy important network positions, while those encoded by tissue-specific genes do not. The biological implications of our findings were discussed and we proposed a hypothesis regarding how cells organize their protein tools in protein-protein interaction networks. Our results led us to speculate that house-keeping gene-encoded proteins might form a core in human protein-protein interaction networks, while clusters of tissue-specific gene-encoded proteins are attached to the core at more peripheral positions of the networks.

Competition in a Social Structure

NASA Astrophysics Data System (ADS)

Legara, Erika Fille; Longjas, Anthony; Batac, Rene

Complex adaptive agents develop strategies in the presence of competition. In modern human societies, there is an inherent sense of locality when describing inter-agent dynamics because of its network structure. One then wonders whether the traditional advertising schemes that are globally publicized and target random individuals are as effective in attracting a larger portion of the population as those that take advantage of local neighborhoods, such as "word-of-mouth" marketing schemes. Here, we demonstrate using a differential equation model that schemes targeting local cliques within the network are more successful at gaining a larger share of the population than those that target users randomly at a global scale (e.g., television commercials, print ads, etc.). This suggests that success in the competition is dependent not only on the number of individuals in the population but also on how they are connected in the network. We further show that the model is general in nature by considering examples of competition dynamics, particularly those of business competition and language death.

Spontaneous symmetry breaking and phase coexistence in two-color networks

NASA Astrophysics Data System (ADS)

Avetisov, V.; Gorsky, A.; Nechaev, S.; Valba, O.

2016-01-01

We consider an equilibrium ensemble of large Erdős-Renyi topological random networks with fixed vertex degree and two types of vertices, black and white, prepared randomly with the bond connection probability p . The network energy is a sum of all unicolor triples (either black or white), weighted with chemical potential of triples μ . Minimizing the system energy, we see for some positive μ the formation of two predominantly unicolor clusters, linked by a string of Nb w black-white bonds. We have demonstrated that the system exhibits critical behavior manifested in the emergence of a wide plateau on the Nb w(μ ) curve, which is relevant to a spinodal decomposition in first-order phase transitions. In terms of a string theory, the plateau formation can be interpreted as an entanglement between baby universes in two-dimensional gravity. We conjecture that the observed classical phenomenon can be considered as a toy model for the chiral condensate formation in quantum chromodynamics.

Spontaneous symmetry breaking and phase coexistence in two-color networks.

PubMed

Avetisov, V; Gorsky, A; Nechaev, S; Valba, O

2016-01-01

We consider an equilibrium ensemble of large Erdős-Renyi topological random networks with fixed vertex degree and two types of vertices, black and white, prepared randomly with the bond connection probability p. The network energy is a sum of all unicolor triples (either black or white), weighted with chemical potential of triples μ. Minimizing the system energy, we see for some positive μ the formation of two predominantly unicolor clusters, linked by a string of N_{bw} black-white bonds. We have demonstrated that the system exhibits critical behavior manifested in the emergence of a wide plateau on the N_{bw}(μ) curve, which is relevant to a spinodal decomposition in first-order phase transitions. In terms of a string theory, the plateau formation can be interpreted as an entanglement between baby universes in two-dimensional gravity. We conjecture that the observed classical phenomenon can be considered as a toy model for the chiral condensate formation in quantum chromodynamics.

Dynamic social networks promote cooperation in experiments with humans

PubMed Central

Rand, David G.; Arbesman, Samuel; Christakis, Nicholas A.

2011-01-01

Human populations are both highly cooperative and highly organized. Human interactions are not random but rather are structured in social networks. Importantly, ties in these networks often are dynamic, changing in response to the behavior of one's social partners. This dynamic structure permits an important form of conditional action that has been explored theoretically but has received little empirical attention: People can respond to the cooperation and defection of those around them by making or breaking network links. Here, we present experimental evidence of the power of using strategic link formation and dissolution, and the network modification it entails, to stabilize cooperation in sizable groups. Our experiments explore large-scale cooperation, where subjects’ cooperative actions are equally beneficial to all those with whom they interact. Consistent with previous research, we find that cooperation decays over time when social networks are shuffled randomly every round or are fixed across all rounds. We also find that, when networks are dynamic but are updated only infrequently, cooperation again fails. However, when subjects can update their network connections frequently, we see a qualitatively different outcome: Cooperation is maintained at a high level through network rewiring. Subjects preferentially break links with defectors and form new links with cooperators, creating an incentive to cooperate and leading to substantial changes in network structure. Our experiments confirm the predictions of a set of evolutionary game theoretic models and demonstrate the important role that dynamic social networks can play in supporting large-scale human cooperation. PMID:22084103

Multiplexing topologies and time scales: The gains and losses of synchrony

NASA Astrophysics Data System (ADS)

Makovkin, Sergey; Kumar, Anil; Zaikin, Alexey; Jalan, Sarika; Ivanchenko, Mikhail

2017-11-01

Inspired by the recent interest in collective dynamics of biological neural networks immersed in the glial cell medium, we investigate the frequency and phase order, i.e., Kuramoto type of synchronization in a multiplex two-layer network of phase oscillators of different time scales and topologies. One of them has a long-range connectivity, exemplified by the Erdős-Rényi random network, and supports both kinds of synchrony. The other is a locally coupled two-dimensional lattice that can reach frequency synchronization but lacks phase order. Drastically different layer frequencies disentangle intra- and interlayer synchronization. We find that an indirect but sufficiently strong coupling through the regular layer can induce both phase order in the originally nonsynchronized random layer and global order, even when an isolated regular layer does not manifest it in principle. At the same time, the route to global synchronization is complex: an initial onset of (partial) synchrony in the regular layer, when its intra- and interlayer coupling is increased, provokes the loss of synchrony even in the originally synchronized random layer. Ultimately, a developed asynchronous dynamics in both layers is abruptly taken over by the global synchrony of both kinds.

Enhanced limbic/impaired cortical-loop connection onto the hippocampus of NHE rats: Application of resting-state functional connectivity in a preclinical ADHD model.

PubMed

Zoratto, F; Palombelli, G M; Ruocco, L A; Carboni, E; Laviola, G; Sadile, A G; Adriani, W; Canese, R

2017-08-30

Due to a hyperfunctioning mesocorticolimbic system, Naples-High-Excitability (NHE) rats have been proposed to model for the meso-cortical variant of attention deficit/hyperactivity disorder (ADHD). Compared to Naples Random-Bred (NRB) controls, NHE rats show hyperactivity, impaired non-selective attention (Aspide et al., 1998), and impaired selective spatial attention (Ruocco et al., 2009a, 2014). Alteration in limbic functions has been proposed; however, resulting unbalance among forebrain areas has not been assessed yet. By resting-state functional Magnetic-Resonance Imaging (fMRI) in vivo, we investigated the connectivity of neuronal networks belonging to limbic vs. cortical loops in NHE and NRB rats (n=10 each). Notably, resting-state fMRI was applied using a multi-slice sagittal, gradient-echo sequence. Voxel-wise connectivity maps at rest, based on temporal correlation among fMRI time-series, were computed by seeding the hippocampus (Hip), nucleus accumbens (NAcc), dorsal striatum (dStr), amygdala (Amy) and dorsal/medial prefrontal cortex (PFC), both hemispheres. To summarize patterns of altered connection, clearly directional connectivity was evident within the cortical loop: bilaterally and specularly, from orbital and dorsal PFCs through dStr and hence towards Hip. Such network communication was reduced in NHE rats (also, with less mesencephalic/pontine innervation). Conversely, enhanced network activity emerged within the limbic loop of NHE rats: from left PFC, both through the NAcc and directly, to the Hip (all of which received greater ventral tegmental innervation, likely dopamine). Together with tuned-down cortical loop, this potentiated limbic loop may serve a major role in controlling ADHD-like behavioral symptoms in NHE rats. Copyright © 2017 Elsevier B.V. All rights reserved.

Lateral Prefrontal Cortex Contributes to Fluid Intelligence Through Multinetwork Connectivity.

PubMed

Cole, Michael W; Ito, Takuya; Braver, Todd S

2015-10-01

Our ability to effectively adapt to novel circumstances--as measured by general fluid intelligence--has recently been tied to the global connectivity of lateral prefrontal cortex (LPFC). Global connectivity is a broad measure that summarizes both within-network connectivity and across-network connectivity. We used additional graph theoretical measures to better characterize the nature of LPFC connectivity and its relationship with fluid intelligence. We specifically hypothesized that LPFC is a connector hub with an across-network connectivity that contributes to fluid intelligence independent of within-network connectivity. We verified that LPFC was in the top 10% of brain regions in terms of across-network connectivity, suggesting it is a strong connector hub. Importantly, we found that the LPFC across-network connectivity predicted individuals' fluid intelligence and this correlation remained statistically significant when controlling for global connectivity (which includes within-network connectivity). This supports the conclusion that across-network connectivity independently contributes to the relationship between LPFC connectivity and intelligence. These results suggest that LPFC contributes to fluid intelligence by being a connector hub with a truly global multisystem connectivity throughout the brain.

Geometry of complex networks and topological centrality

NASA Astrophysics Data System (ADS)

Ranjan, Gyan; Zhang, Zhi-Li

2013-09-01

We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian (L). The squared distance of a node i to the origin in this n-dimensional space (lii+), yields a topological centrality index, defined as C∗(i)=1/lii+. In turn, the sum of reciprocals of individual node centralities, ∑i1/C∗(i)=∑ilii+, or the trace of L, yields the well-known Kirchhoff index (K), an overall structural descriptor for the network. To put into context this geometric definition of centrality, we provide alternative interpretations of the proposed indices that connect them to meaningful topological characteristics - first, as forced detour overheads and frequency of recurrences in random walks that has an interesting analogy to voltage distributions in the equivalent electrical network; and then as the average connectedness of i in all the bi-partitions of the graph. These interpretations respectively help establish the topological centrality (C∗(i)) of node i as a measure of its overall position as well as its overall connectedness in the network; thus reflecting the robustness of i to random multiple edge failures. Through empirical evaluations using synthetic and real world networks, we demonstrate how the topological centrality is better able to distinguish nodes in terms of their structural roles in the network and, along with Kirchhoff index, is appropriately sensitive to perturbations/re-wirings in the network.

Modeling a secular trend by Monte Carlo simulation of height biased migration in a spatial network.

PubMed

Groth, Detlef

2017-04-01

Background: In a recent Monte Carlo simulation, the clustering of body height of Swiss military conscripts within a spatial network with characteristic features of the natural Swiss geography was investigated. In this study I examined the effect of migration of tall individuals into network hubs on the dynamics of body height within the whole spatial network. The aim of this study was to simulate height trends. Material and methods: Three networks were used for modeling, a regular rectangular fishing net like network, a real world example based on the geographic map of Switzerland, and a random network. All networks contained between 144 and 148 districts and between 265-307 road connections. Around 100,000 agents were initially released with average height of 170 cm, and height standard deviation of 6.5 cm. The simulation was started with the a priori assumption that height variation within a district is limited and also depends on height of neighboring districts (community effect on height). In addition to a neighborhood influence factor, which simulates a community effect, body height dependent migration of conscripts between adjacent districts in each Monte Carlo simulation was used to re-calculate next generation body heights. In order to determine the direction of migration for taller individuals, various centrality measures for the evaluation of district importance within the spatial network were applied. Taller individuals were favored to migrate more into network hubs, backward migration using the same number of individuals was random, not biased towards body height. Network hubs were defined by the importance of a district within the spatial network. The importance of a district was evaluated by various centrality measures. In the null model there were no road connections, height information could not be delivered between the districts. Results: Due to the favored migration of tall individuals into network hubs, average body height of the hubs, and later, of the whole network increased by up to 0.1 cm per iteration depending on the network model. The general increase in height within the network depended on connectedness and on the amount of height information that was exchanged between neighboring districts. If higher amounts of neighborhood height information were exchanged, the general increase in height within the network was large (strong secular trend). The trend in the homogeneous fishnet like network was lowest, the trend in the random network was highest. Yet, some network properties, such as the heteroscedasticity and autocorrelations of the migration simulation models differed greatly from the natural features observed in Swiss military conscript networks. Autocorrelations of district heights for instance, were much higher in the migration models. Conclusion: This study confirmed that secular height trends can be modeled by preferred migration of tall individuals into network hubs. However, basic network properties of the migration simulation models differed greatly from the natural features observed in Swiss military conscripts. Similar network-based data from other countries should be explored to better investigate height trends with Monte Carlo migration approach.

Differential Occurrence of Interactions and Interaction Domains in Proteins Containing Homopolymeric Amino Acid Repeats

PubMed Central

Pelassa, Ilaria; Fiumara, Ferdinando

2015-01-01

Homopolymeric amino acids repeats (AARs), which are widespread in proteomes, have often been viewed simply as spacers between protein domains, or even as “junk” sequences with no obvious function but with a potential to cause harm upon expansion as in genetic diseases associated with polyglutamine or polyalanine expansions, including Huntington disease and cleidocranial dysplasia. A growing body of evidence indicates however that at least some AARs can form organized, functional protein structures, and can regulate protein function. In particular, certain AARs can mediate protein-protein interactions, either through homotypic AAR-AAR contacts or through heterotypic contacts with other protein domains. It is still unclear however, whether AARs may have a generalized, proteome-wide role in shaping protein-protein interaction networks. Therefore, we have undertaken here a bioinformatics screening of the human proteome and interactome in search of quantitative evidence of such a role. We first identified the sets of proteins that contain repeats of any one of the 20 amino acids, as well as control sets of proteins chosen at random in the proteome. We then analyzed the connectivity between the proteins of the AAR-containing protein sets and we compared it with that observed in the corresponding control networks. We find evidence for different degrees of connectivity in the different AAR-containing protein networks. Indeed, networks of proteins containing polyglutamine, polyglutamate, polyproline, and other AARs show significantly increased levels of connectivity, whereas networks containing polyleucine and other hydrophobic repeats show lower degrees of connectivity. Furthermore, we observed that numerous protein-protein, -nucleic acid, and -lipid interaction domains are significantly enriched in specific AAR protein groups. These findings support the notion of a generalized, combinatorial role of AARs, together with conventional protein interaction domains, in shaping the interaction networks of the human proteome, and define proteome-wide knowledge that may guide the informed biological exploration of the role of AARs in protein interactions. PMID:26734058

Graph theoretical model of a sensorimotor connectome in zebrafish.

PubMed

Stobb, Michael; Peterson, Joshua M; Mazzag, Borbala; Gahtan, Ethan

2012-01-01

Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

Statistical mechanics of the international trade network.

PubMed

Fronczak, Agata; Fronczak, Piotr

2012-05-01

Analyzing real data on international trade covering the time interval 1950-2000, we show that in each year over the analyzed period the network is a typical representative of the ensemble of maximally random weighted networks, whose directed connections (bilateral trade volumes) are only characterized by the product of the trading countries' GDPs. It means that time evolution of this network may be considered as a continuous sequence of equilibrium states, i.e., a quasistatic process. This, in turn, allows one to apply the linear response theory to make (and also verify) simple predictions about the network. In particular, we show that bilateral trade fulfills a fluctuation-response theorem, which states that the average relative change in imports (exports) between two countries is a sum of the relative changes in their GDPs. Yearly changes in trade volumes prove that the theorem is valid.

Statistical mechanics of the international trade network

NASA Astrophysics Data System (ADS)

Fronczak, Agata; Fronczak, Piotr

2012-05-01

Analyzing real data on international trade covering the time interval 1950-2000, we show that in each year over the analyzed period the network is a typical representative of the ensemble of maximally random weighted networks, whose directed connections (bilateral trade volumes) are only characterized by the product of the trading countries' GDPs. It means that time evolution of this network may be considered as a continuous sequence of equilibrium states, i.e., a quasistatic process. This, in turn, allows one to apply the linear response theory to make (and also verify) simple predictions about the network. In particular, we show that bilateral trade fulfills a fluctuation-response theorem, which states that the average relative change in imports (exports) between two countries is a sum of the relative changes in their GDPs. Yearly changes in trade volumes prove that the theorem is valid.

A high-capacity model for one shot association learning in the brain

PubMed Central

Einarsson, Hafsteinn; Lengler, Johannes; Steger, Angelika

2014-01-01

We present a high-capacity model for one-shot association learning (hetero-associative memory) in sparse networks. We assume that basic patterns are pre-learned in networks and associations between two patterns are presented only once and have to be learned immediately. The model is a combination of an Amit-Fusi like network sparsely connected to a Willshaw type network. The learning procedure is palimpsest and comes from earlier work on one-shot pattern learning. However, in our setup we can enhance the capacity of the network by iterative retrieval. This yields a model for sparse brain-like networks in which populations of a few thousand neurons are capable of learning hundreds of associations even if they are presented only once. The analysis of the model is based on a novel result by Janson et al. on bootstrap percolation in random graphs. PMID:25426060

A high-capacity model for one shot association learning in the brain.

PubMed

Einarsson, Hafsteinn; Lengler, Johannes; Steger, Angelika

2014-01-01

We present a high-capacity model for one-shot association learning (hetero-associative memory) in sparse networks. We assume that basic patterns are pre-learned in networks and associations between two patterns are presented only once and have to be learned immediately. The model is a combination of an Amit-Fusi like network sparsely connected to a Willshaw type network. The learning procedure is palimpsest and comes from earlier work on one-shot pattern learning. However, in our setup we can enhance the capacity of the network by iterative retrieval. This yields a model for sparse brain-like networks in which populations of a few thousand neurons are capable of learning hundreds of associations even if they are presented only once. The analysis of the model is based on a novel result by Janson et al. on bootstrap percolation in random graphs.

Clustering promotes switching dynamics in networks of noisy neurons

NASA Astrophysics Data System (ADS)

Franović, Igor; Klinshov, Vladimir

2018-02-01

Macroscopic variability is an emergent property of neural networks, typically manifested in spontaneous switching between the episodes of elevated neuronal activity and the quiescent episodes. We investigate the conditions that facilitate switching dynamics, focusing on the interplay between the different sources of noise and heterogeneity of the network topology. We consider clustered networks of rate-based neurons subjected to external and intrinsic noise and derive an effective model where the network dynamics is described by a set of coupled second-order stochastic mean-field systems representing each of the clusters. The model provides an insight into the different contributions to effective macroscopic noise and qualitatively indicates the parameter domains where switching dynamics may occur. By analyzing the mean-field model in the thermodynamic limit, we demonstrate that clustering promotes multistability, which gives rise to switching dynamics in a considerably wider parameter region compared to the case of a non-clustered network with sparse random connection topology.

Modelling conflicts with cluster dynamics in networks

NASA Astrophysics Data System (ADS)

Tadić, Bosiljka; Rodgers, G. J.

2010-12-01

We introduce cluster dynamical models of conflicts in which only the largest cluster can be involved in an action. This mimics the situations in which an attack is planned by a central body, and the largest attack force is used. We study the model in its annealed random graph version, on a fixed network, and on a network evolving through the actions. The sizes of actions are distributed with a power-law tail, however, the exponent is non-universal and depends on the frequency of actions and sparseness of the available connections between units. Allowing the network reconstruction over time in a self-organized manner, e.g., by adding the links based on previous liaisons between units, we find that the power-law exponent depends on the evolution time of the network. Its lower limit is given by the universal value 5/2, derived analytically for the case of random fragmentation processes. In the temporal patterns behind the size of actions we find long-range correlations in the time series of the number of clusters and the non-trivial distribution of time that a unit waits between two actions. In the case of an evolving network the distribution develops a power-law tail, indicating that through repeated actions, the system develops an internal structure with a hierarchy of units.

Abnormal functional network connectivity among resting-state networks in children with frontal lobe epilepsy.

PubMed

Widjaja, E; Zamyadi, M; Raybaud, C; Snead, O C; Smith, M L

2013-12-01

Epilepsy is considered a disorder of neural networks. The aims of this study were to assess functional connectivity within resting-state networks and functional network connectivity across resting-state networks by use of resting-state fMRI in children with frontal lobe epilepsy and to relate changes in resting-state networks with neuropsychological function. Fifteen patients with frontal lobe epilepsy and normal MR imaging and 14 healthy control subjects were recruited. Spatial independent component analysis was used to identify the resting-state networks, including frontal, attention, default mode network, sensorimotor, visual, and auditory networks. The Z-maps of resting-state networks were compared between patients and control subjects. The relation between abnormal connectivity and neuropsychological function was assessed. Correlations from all pair-wise combinations of independent components were performed for each group and compared between groups. The frontal network was the only network that showed reduced connectivity in patients relative to control subjects. The remaining 5 networks demonstrated both reduced and increased functional connectivity within resting-state networks in patients. There was a weak association between connectivity in frontal network and executive function (P = .029) and a significant association between sensorimotor network and fine motor function (P = .004). Control subjects had 79 pair-wise independent components that showed significant temporal coherence across all resting-state networks except for default mode network-auditory network. Patients had 66 pairs of independent components that showed significant temporal coherence across all resting-state networks. Group comparison showed reduced functional network connectivity between default mode network-attention, frontal-sensorimotor, and frontal-visual networks and increased functional network connectivity between frontal-attention, default mode network-sensorimotor, and frontal-visual networks in patients relative to control subjects. We found abnormal functional connectivity within and across resting-state networks in children with frontal lobe epilepsy. Impairment in functional connectivity was associated with impaired neuropsychological function.

The effect of nanowire length and diameter on the properties of transparent, conducting nanowire films

NASA Astrophysics Data System (ADS)

Bergin, Stephen M.; Chen, Yu-Hui; Rathmell, Aaron R.; Charbonneau, Patrick; Li, Zhi-Yuan; Wiley, Benjamin J.

2012-03-01

This article describes how the dimensions of nanowires affect the transmittance and sheet resistance of a random nanowire network. Silver nanowires with independently controlled lengths and diameters were synthesized with a gram-scale polyol synthesis by controlling the reaction temperature and time. Characterization of films composed of nanowires of different lengths but the same diameter enabled the quantification of the effect of length on the conductance and transmittance of silver nanowire films. Finite-difference time-domain calculations were used to determine the effect of nanowire diameter, overlap, and hole size on the transmittance of a nanowire network. For individual nanowires with diameters greater than 50 nm, increasing diameter increases the electrical conductance to optical extinction ratio, but the opposite is true for nanowires with diameters less than this size. Calculations and experimental data show that for a random network of nanowires, decreasing nanowire diameter increases the number density of nanowires at a given transmittance, leading to improved connectivity and conductivity at high transmittance (>90%). This information will facilitate the design of transparent, conducting nanowire films for flexible displays, organic light emitting diodes and thin-film solar cells.This article describes how the dimensions of nanowires affect the transmittance and sheet resistance of a random nanowire network. Silver nanowires with independently controlled lengths and diameters were synthesized with a gram-scale polyol synthesis by controlling the reaction temperature and time. Characterization of films composed of nanowires of different lengths but the same diameter enabled the quantification of the effect of length on the conductance and transmittance of silver nanowire films. Finite-difference time-domain calculations were used to determine the effect of nanowire diameter, overlap, and hole size on the transmittance of a nanowire network. For individual nanowires with diameters greater than 50 nm, increasing diameter increases the electrical conductance to optical extinction ratio, but the opposite is true for nanowires with diameters less than this size. Calculations and experimental data show that for a random network of nanowires, decreasing nanowire diameter increases the number density of nanowires at a given transmittance, leading to improved connectivity and conductivity at high transmittance (>90%). This information will facilitate the design of transparent, conducting nanowire films for flexible displays, organic light emitting diodes and thin-film solar cells. Electronic supplementary information (ESI) available: Includes methods and transmission spectra of nanowire films. See DOI: 10.1039/c2nr30126a

Network connectivity value.

PubMed

Dragicevic, Arnaud; Boulanger, Vincent; Bruciamacchie, Max; Chauchard, Sandrine; Dupouey, Jean-Luc; Stenger, Anne

2017-04-21

In order to unveil the value of network connectivity, we formalize the construction of ecological networks in forest environments as an optimal control dynamic graph-theoretic problem. The network is based on a set of bioreserves and patches linked by ecological corridors. The node dynamics, built upon the consensus protocol, form a time evolutive Mahalanobis distance weighted by the opportunity costs of timber production. We consider a case of complete graph, where the ecological network is fully connected, and a case of incomplete graph, where the ecological network is partially connected. The results show that the network equilibrium depends on the size of the reception zone, while the network connectivity depends on the environmental compatibility between the ecological areas. Through shadow prices, we find that securing connectivity in partially connected networks is more expensive than in fully connected networks, but should be undertaken when the opportunity costs are significant. Copyright © 2017 Elsevier Ltd. All rights reserved.

Finite Energy and Bounded Attacks on Control System Sensor Signals

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

Djouadi, Seddik M; Melin, Alexander M; Ferragut, Erik M

Control system networks are increasingly being connected to enterprise level networks. These connections leave critical industrial controls systems vulnerable to cyber-attacks. Most of the effort in protecting these cyber-physical systems (CPS) has been in securing the networks using information security techniques and protection and reliability concerns at the control system level against random hardware and software failures. However, besides these failures the inability of information security techniques to protect against all intrusions means that the control system must be resilient to various signal attacks for which new analysis and detection methods need to be developed. In this paper, sensor signalmore » attacks are analyzed for observer-based controlled systems. The threat surface for sensor signal attacks is subdivided into denial of service, finite energy, and bounded attacks. In particular, the error signals between states of attack free systems and systems subject to these attacks are quantified. Optimal sensor and actuator signal attacks for the finite and infinite horizon linear quadratic (LQ) control in terms of maximizing the corresponding cost functions are computed. The closed-loop system under optimal signal attacks are provided. Illustrative numerical examples are provided together with an application to a power network with distributed LQ controllers.« less

Effects of fear factors in disease propagation

NASA Astrophysics Data System (ADS)

Wang, Yubo; Xiao, Gaoxi; Wong, Limsoon; Fu, Xiuju; Ma, Stefan; Hiang Cheng, Tee

2011-09-01

Upon an outbreak of a dangerous infectious disease, people generally tend to reduce their contacts with others in fear of getting infected. Such typical actions apparently help slow down the spreading of infection. Thanks to today's broad public media coverage, the fear factor may even contribute to preventing an outbreak from happening. We are motivated to study such effects by adopting a complex network approach. First we evaluate the simple case where connections between individuals are randomly removed due to the fear factor. Then we consider a different case where each individual keeps at least a few connections after contact reduction. Such a case is arguably more realistic since people may choose to keep a few social contacts, e.g., with their family members and closest friends, at any cost. Finally, a study is conducted on the case where connection removals are carried out dynamically while the infection is spreading out. Analytical and simulation results show that the fear factor may not easily prevent an epidemic outbreak from happening in scale-free networks. However, it significantly reduces the fraction of the nodes ever getting infected during the outbreak.

Circuit theory and model-based inference for landscape connectivity

USGS Publications Warehouse

Hanks, Ephraim M.; Hooten, Mevin B.

2013-01-01

Circuit theory has seen extensive recent use in the field of ecology, where it is often applied to study functional connectivity. The landscape is typically represented by a network of nodes and resistors, with the resistance between nodes a function of landscape characteristics. The effective distance between two locations on a landscape is represented by the resistance distance between the nodes in the network. Circuit theory has been applied to many other scientific fields for exploratory analyses, but parametric models for circuits are not common in the scientific literature. To model circuits explicitly, we demonstrate a link between Gaussian Markov random fields and contemporary circuit theory using a covariance structure that induces the necessary resistance distance. This provides a parametric model for second-order observations from such a system. In the landscape ecology setting, the proposed model provides a simple framework where inference can be obtained for effects that landscape features have on functional connectivity. We illustrate the approach through a landscape genetics study linking gene flow in alpine chamois (Rupicapra rupicapra) to the underlying landscape.

Hard-to-reach? Using health access status as a way to more effectively target segments of the Latino audience.

PubMed

Wilkin, Holley A; Ball-Rokeach, Sandra J

2011-04-01

Health issues disproportionately affect Latinos, but variations within this ethnic group may mean that some Latinos are harder to reach with health messages than others. This paper introduces a methodology grounded in communication infrastructure theory to better target 'hard-to-reach' audiences. A random digit dialing telephone survey of 739 Latinos living in two Los Angeles communities was conducted. The relationships between health access difficulties and connections to an integrated storytelling network as well as individual health communication source connections were explored. Findings suggest that Latinos who are connected to an integrated storytelling network report marginally greater ease finding healthcare, despite not being any more likely to have insurance or a regular place for healthcare. Latinos who have health access problems tended to rely more upon Spanish-language television for health information. In addition, those without healthcare access problems are more likely to indicate that they use health professionals, the Internet, mainstream TV and printed materials like health pamphlets for health information. The theoretical and methodological contributions of this work, its major findings, implications, limitations and policy guidelines are discussed.

Methods for Generating Complex Networks with Selected Structural Properties for Simulations: A Review and Tutorial for Neuroscientists

PubMed Central

Prettejohn, Brenton J.; Berryman, Matthew J.; McDonnell, Mark D.

2011-01-01

Many simulations of networks in computational neuroscience assume completely homogenous random networks of the Erdös–Rényi type, or regular networks, despite it being recognized for some time that anatomical brain networks are more complex in their connectivity and can, for example, exhibit the “scale-free” and “small-world” properties. We review the most well known algorithms for constructing networks with given non-homogeneous statistical properties and provide simple pseudo-code for reproducing such networks in software simulations. We also review some useful mathematical results and approximations associated with the statistics that describe these network models, including degree distribution, average path length, and clustering coefficient. We demonstrate how such results can be used as partial verification and validation of implementations. Finally, we discuss a sometimes overlooked modeling choice that can be crucially important for the properties of simulated networks: that of network directedness. The most well known network algorithms produce undirected networks, and we emphasize this point by highlighting how simple adaptations can instead produce directed networks. PMID:21441986

Default network connectivity as a vulnerability marker for obsessive compulsive disorder.

PubMed

Peng, Z W; Xu, T; He, Q H; Shi, C Z; Wei, Z; Miao, G D; Jing, J; Lim, K O; Zuo, X N; Chan, R C K

2014-05-01

Aberrant functional connectivity within the default network is generally assumed to be involved in the pathophysiology of obsessive compulsive disorder (OCD); however, the genetic risk of default network connectivity in OCD remains largely unknown. Here, we systematically investigated default network connectivity in 15 OCD patients, 15 paired unaffected siblings and 28 healthy controls. We sought to examine the profiles of default network connectivity in OCD patients and their siblings, exploring the correlation between abnormal default network connectivity and genetic risk for this population. Compared with healthy controls, OCD patients exhibited reduced strength of default network functional connectivity with the posterior cingulate cortex (PCC), and increased functional connectivity in the right inferior frontal lobe, insula, superior parietal cortex and superior temporal cortex, while their unaffected first-degree siblings only showed reduced local connectivity in the PCC. These findings suggest that the disruptions of default network functional connectivity might be associated with family history of OCD. The decreased default network connectivity in both OCD patients and their unaffected siblings may serve as a potential marker of OCD.

Effects of Creatine Monohydrate Augmentation on Brain Metabolic and Network Outcome Measures in Women With Major Depressive Disorder.

PubMed

Yoon, Sujung; Kim, Jieun E; Hwang, Jaeuk; Kim, Tae-Suk; Kang, Hee Jin; Namgung, Eun; Ban, Soonhyun; Oh, Subin; Yang, Jeongwon; Renshaw, Perry F; Lyoo, In Kyoon

2016-09-15

Creatine monohydrate (creatine) augmentation has the potential to accelerate the clinical responses to and enhance the overall efficacy of selective serotonin reuptake inhibitor treatment in women with major depressive disorder (MDD). Although it has been suggested that creatine augmentation may involve the restoration of brain energy metabolism, the mechanisms underlying its antidepressant efficacy are unknown. In a randomized, double-blind, placebo-controlled trial, 52 women with MDD were assigned to receive either creatine augmentation or placebo augmentation of escitalopram; 34 subjects participated in multimodal neuroimaging assessments at baseline and week 8. Age-matched healthy women (n = 39) were also assessed twice at the same intervals. Metabolic and network outcomes were measured for changes in prefrontal N-acetylaspartate and changes in rich club hub connections of the structural brain network using proton magnetic resonance spectroscopy and diffusion tensor imaging, respectively. We found MDD-related metabolic and network dysfunction at baseline. Improvement in depressive symptoms was greater in patients receiving creatine augmentation relative to placebo augmentation. After 8 weeks of treatment, prefrontal N-acetylaspartate levels increased significantly in the creatine augmentation group compared with the placebo augmentation group. Increment in rich club hub connections was also greater in the creatine augmentation group than in the placebo augmentation group. N-acetylaspartate levels and rich club connections increased after creatine augmentation of selective serotonin reuptake inhibitor treatment. Effects of creatine administration on brain energy metabolism and network organization may partly underlie its efficacy in treating women with MDD. Copyright © 2016 Society of Biological Psychiatry. Published by Elsevier Inc. All rights reserved.

Fractional quantum mechanics on networks: Long-range dynamics and quantum transport

NASA Astrophysics Data System (ADS)

Riascos, A. P.; Mateos, José L.

2015-11-01

In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.

Fractional quantum mechanics on networks: Long-range dynamics and quantum transport.

PubMed

Riascos, A P; Mateos, José L

2015-11-01

In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.

Transcranial Direct Current Stimulation Modulates Neuronal Networks in Attention Deficit Hyperactivity Disorder.

PubMed

Sotnikova, Anna; Soff, Cornelia; Tagliazucchi, Enzo; Becker, Katja; Siniatchkin, Michael

2017-09-01

Anodal transcranial direct current stimulation (tDCS) of the prefrontal cortex has been repeatedly shown to improve working memory (WM). Since patients with attention deficit hyperactivity disorder (ADHD) are characterized by both underactivation of the prefrontal cortex and deficits in WM, the modulation of prefrontal activity with tDCS in ADHD patients may increase their WM performance as well as improve the activation and connectivity of the WM network. In the present study, this hypothesis was tested using a double-blind sham-controlled experimental design. After randomization, sixteen adolescents with ADHD underwent either anodal tDCS over the left dorsolateral prefrontal cortex (DLPFC, 1 mA, 20 min) or sham stimulation with simultaneous fMRI during n-back WM task. Both in one-back and two-back conditions, tDCS led to a greater activation (compared with sham stimulation) of the left DLPFC (under the electrode), left premotor cortex, left supplementary motor cortex, and precuneus. The effects of tDCS were long-lasting and influenced resting state functional connectivity even 20 min after the stimulation, with patterns of strengthened DLPFC connectivity after tDCS outlining the WM network. In summary, anodal tDCS caused increased neuronal activation and connectivity, not only in the brain area under the stimulating electrode (i.e. left DLPFC) but also in other, more remote brain regions. Because of moderate behavioral effects of tDCS, the significance of this technique for ADHD treatment has to be investigated in further studies.

Identifying a system of predominant negative symptoms: Network analysis of three randomized clinical trials.

PubMed

Levine, Stephen Z; Leucht, Stefan

2016-12-01

Reasons for the recent mixed success of research into negative symptoms may be informed by conceptualizing negative symptoms as a system that is identifiable from network analysis. We aimed to identify: (I) negative symptom systems; (I) central negative symptoms within each system; and (III) differences between the systems, based on network analysis of negative symptoms for baseline, endpoint and change. Patients with chronic schizophrenia and predominant negative symptoms participated in three clinical trials that compared placebo and amisulpride to 60days (n=487). Networks analyses were computed from the Scale for the Assessment of Negative Symptoms (SANS) scores for baseline and endpoint for severity, and estimated change based on mixed models. Central symptoms to each network were identified. The networks were contrasted for connectivity with permutation tests. Network analysis showed that the baseline and endpoint symptom severity systems formed symptom groups of Affect, Poor responsiveness, Lack of interest, and Apathy-inattentiveness. The baseline and endpoint networks did not significantly differ in terms of connectivity, but both significantly (P<0.05) differed to the change network. In the change network the apathy-inattentiveness symptom group split into three other groups. The most central symptoms were Decreased Spontaneous Movements at baseline and endpoint, and Poverty of Speech for estimated change. Results provide preliminary evidence for: (I) a replicable negative symptom severity system; and (II) symptoms with high centrality (e.g., Decreased Spontaneous Movement), that may be future treatment targets following replication to ensure the curent results generalize to other samples. Copyright © 2016 Elsevier B.V. All rights reserved.

Protein complexes and functional modules in molecular networks

NASA Astrophysics Data System (ADS)

Spirin, Victor; Mirny, Leonid A.

2003-10-01

Proteins, nucleic acids, and small molecules form a dense network of molecular interactions in a cell. Molecules are nodes of this network, and the interactions between them are edges. The architecture of molecular networks can reveal important principles of cellular organization and function, similarly to the way that protein structure tells us about the function and organization of a protein. Computational analysis of molecular networks has been primarily concerned with node degree [Wagner, A. & Fell, D. A. (2001) Proc. R. Soc. London Ser. B 268, 1803-1810; Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N. & Barabasi, A. L. (2000) Nature 407, 651-654] or degree correlation [Maslov, S. & Sneppen, K. (2002) Science 296, 910-913], and hence focused on single/two-body properties of these networks. Here, by analyzing the multibody structure of the network of protein-protein interactions, we discovered molecular modules that are densely connected within themselves but sparsely connected with the rest of the network. Comparison with experimental data and functional annotation of genes showed two types of modules: (i) protein complexes (splicing machinery, transcription factors, etc.) and (ii) dynamic functional units (signaling cascades, cell-cycle regulation, etc.). Discovered modules are highly statistically significant, as is evident from comparison with random graphs, and are robust to noise in the data. Our results provide strong support for the network modularity principle introduced by Hartwell et al. [Hartwell, L. H., Hopfield, J. J., Leibler, S. & Murray, A. W. (1999) Nature 402, C47-C52], suggesting that found modules constitute the "building blocks" of molecular networks.

A method of examining the structure and topological properties of public-transport networks

NASA Astrophysics Data System (ADS)

Dimitrov, Stavri Dimitri; Ceder, Avishai (Avi)

2016-06-01

This work presents a new method of examining the structure of public-transport networks (PTNs) and analyzes their topological properties through a combination of computer programming, statistical data and large-network analyses. In order to automate the extraction, processing and exporting of data, a software program was developed allowing to extract the needed data from General Transit Feed Specification, thus overcoming difficulties occurring in accessing and collecting data. The proposed method was applied to a real-life PTN in Auckland, New Zealand, with the purpose of examining whether it showed characteristics of scale-free networks and exhibited features of ;small-world; networks. As a result, new regression equations were derived analytically describing observed, strong, non-linear relationships among the probabilities of randomly chosen stops in the PTN to be serviced by a given number of routes. The established dependence is best fitted by an exponential rather than a power-law function, showing that the PTN examined is neither random nor scale-free, but a mixture of the two. This finding explains the presence of hubs that are not typical of exponential networks and simultaneously not highly connected to the other nodes as is the case with scale-free networks. On the other hand, the observed values of the topological properties of the network show that although it is highly clustered, owing to its representation as a directed graph, it differs slightly from ;small-world; networks, which are characterized by strong clustering and a short average path length.

Disconnection and hyper-connectivity underlie reorganization after TBI: A rodent functional connectomic analysis

PubMed Central

Harris, N.G.; Verley, D.R.; Gutman, B.A.; Thompson, P.M.; Yeh, H.J.; Brown, J.A.

2016-01-01

While past neuroimaging methods have contributed greatly to our understanding of brain function after traumatic brain injury (TBI), resting state functional MRI (rsfMRI) connectivity methods have more recently provided a far more unbiased approach with which to monitor brain circuitry compared to task-based approaches. However, current knowledge on the physiologic underpinnings of the correlated blood oxygen level dependent signal, and how changes in functional connectivity relate to reorganizational processes that occur following injury is limited. The degree and extent of this relationship remain to be determined in order that rsfMRI methods can be fully adapted for determining the optimal timing and type of rehabilitative interventions that can be used post-TBI to achieve the best outcome. Very few rsfMRI studies exist after experimental TBI and therefore we chose to acquire rsfMRI data before and at 7, 14 and 28 days after experimental TBI using a well-known, clinically-relevant, unilateral controlled cortical impact injury (CCI) adult rat model of TBI. This model was chosen since it has widespread axonal injury, a well-defined time-course of reorganization including spine, dendrite, axonal and cortical map changes, as well as spontaneous recovery of sensorimotor function by 28 d post-injury from which to interpret alterations in functional connectivity. Data were co-registered to a parcellated rat template to generate adjacency matrices for network analysis by graph theory. Making no assumptions about direction of change, we used two-tailed statistical analysis over multiple brain regions in a data-driven approach to access global and regional changes in network topology in order to assess brain connectivity in an unbiased way. Our main hypothesis was that deficits in functional connectivity would become apparent in regions known to be structurally altered or deficient in axonal connectivity in this model. The data show the loss of functional connectivity predicted by the structural deficits, not only within the primary sensorimotor injury site and pericontused regions, but the normally connected homotopic cortex, as well as subcortical regions, all of which persisted chronically. Especially novel in this study is the unanticipated finding of widespread increases in connection strength that dwarf both the degree and extent of the functional disconnections, and which persist chronically in some sensorimotor and subcortically connected regions. Exploratory global network analysis showed changes in network parameters indicative of possible acutely increased random connectivity and temporary reductions in modularity that were matched by local increases in connectedness and increased efficiency among more weakly connected regions. The global network parameters: shortest path-length, clustering coefficient and modularity that were most affected by trauma also scaled with the severity of injury, so that the corresponding regional measures were correlated to the injury severity most notably at 7 and 14 days and especially within, but not limited to, the contralateral cortex. These changes in functional network parameters are discussed in relation to the known time-course of physiologic and anatomic data that underlie structural and functional reorganization in this experiment model of TBI. PMID:26730520

Disconnection and hyper-connectivity underlie reorganization after TBI: A rodent functional connectomic analysis.

PubMed

Harris, N G; Verley, D R; Gutman, B A; Thompson, P M; Yeh, H J; Brown, J A

2016-03-01

While past neuroimaging methods have contributed greatly to our understanding of brain function after traumatic brain injury (TBI), resting state functional MRI (rsfMRI) connectivity methods have more recently provided a far more unbiased approach with which to monitor brain circuitry compared to task-based approaches. However, current knowledge on the physiologic underpinnings of the correlated blood oxygen level dependent signal, and how changes in functional connectivity relate to reorganizational processes that occur following injury is limited. The degree and extent of this relationship remain to be determined in order that rsfMRI methods can be fully adapted for determining the optimal timing and type of rehabilitative interventions that can be used post-TBI to achieve the best outcome. Very few rsfMRI studies exist after experimental TBI and therefore we chose to acquire rsfMRI data before and at 7, 14 and 28 days after experimental TBI using a well-known, clinically-relevant, unilateral controlled cortical impact injury (CCI) adult rat model of TBI. This model was chosen since it has widespread axonal injury, a well-defined time-course of reorganization including spine, dendrite, axonal and cortical map changes, as well as spontaneous recovery of sensorimotor function by 28 d post-injury from which to interpret alterations in functional connectivity. Data were co-registered to a parcellated rat template to generate adjacency matrices for network analysis by graph theory. Making no assumptions about direction of change, we used two-tailed statistical analysis over multiple brain regions in a data-driven approach to access global and regional changes in network topology in order to assess brain connectivity in an unbiased way. Our main hypothesis was that deficits in functional connectivity would become apparent in regions known to be structurally altered or deficient in axonal connectivity in this model. The data show the loss of functional connectivity predicted by the structural deficits, not only within the primary sensorimotor injury site and pericontused regions, but the normally connected homotopic cortex, as well as subcortical regions, all of which persisted chronically. Especially novel in this study is the unanticipated finding of widespread increases in connection strength that dwarf both the degree and extent of the functional disconnections, and which persist chronically in some sensorimotor and subcortically connected regions. Exploratory global network analysis showed changes in network parameters indicative of possible acutely increased random connectivity and temporary reductions in modularity that were matched by local increases in connectedness and increased efficiency among more weakly connected regions. The global network parameters: shortest path-length, clustering coefficient and modularity that were most affected by trauma also scaled with the severity of injury, so that the corresponding regional measures were correlated to the injury severity most notably at 7 and 14 days and especially within, but not limited to, the contralateral cortex. These changes in functional network parameters are discussed in relation to the known time-course of physiologic and anatomic data that underlie structural and functional reorganization in this experiment model of TBI. Copyright © 2015 Elsevier Inc. All rights reserved.

Closed-loop control of a fragile network: application to seizure-like dynamics of an epilepsy model

PubMed Central

Ehrens, Daniel; Sritharan, Duluxan; Sarma, Sridevi V.

2015-01-01

It has recently been proposed that the epileptic cortex is fragile in the sense that seizures manifest through small perturbations in the synaptic connections that render the entire cortical network unstable. Closed-loop therapy could therefore entail detecting when the network goes unstable, and then stimulating with an exogenous current to stabilize the network. In this study, a non-linear stochastic model of a neuronal network was used to simulate both seizure and non-seizure activity. In particular, synaptic weights between neurons were chosen such that the network's fixed point is stable during non-seizure periods, and a subset of these connections (the most fragile) were perturbed to make the same fixed point unstable to model seizure events; and, the model randomly transitions between these two modes. The goal of this study was to measure spike train observations from this epileptic network and then apply a feedback controller that (i) detects when the network goes unstable, and then (ii) applies a state-feedback gain control input to the network to stabilize it. The stability detector is based on a 2-state (stable, unstable) hidden Markov model (HMM) of the network, and detects the transition from the stable mode to the unstable mode from using the firing rate of the most fragile node in the network (which is the output of the HMM). When the unstable mode is detected, a state-feedback gain is applied to generate a control input to the fragile node bringing the network back to the stable mode. Finally, when the network is detected as stable again, the feedback control input is switched off. High performance was achieved for the stability detector, and feedback control suppressed seizures within 2 s after onset. PMID:25784851

Routing and wavelength assignment based on normalized resource and constraints for all-optical network

NASA Astrophysics Data System (ADS)

Joo, Seong-Soon; Nam, Hyun-Soon; Lim, Chang-Kyu

2003-08-01

With the rapid growth of the Optical Internet, high capacity pipes is finally destined to support end-to-end IP on the WDM optical network. Newly launched 2D MEMS optical switching module in the market supports that expectations of upcoming a transparent optical cross-connect in the network have encouraged the field applicable research on establishing real all-optical transparent network. To open up a customer-driven bandwidth services, design of the optical transport network becomes more challenging task in terms of optimal network resource usage. This paper presents a practical approach to finding a route and wavelength assignment for wavelength routed all-optical network, which has λ-plane OXC switches and wavelength converters, and supports that optical paths are randomly set up and released by dynamic wavelength provisioning to create bandwidth between end users with timescales on the order of seconds or milliseconds. We suggest three constraints to make the RWA problem become more practical one on deployment for wavelength routed all-optical network in network view: limitation on maximum hop of a route within bearable optical network impairments, limitation on minimum hops to travel before converting a wavelength, and limitation on calculation time to find all routes for connections requested at once. We design the NRCD (Normalized Resource and Constraints for All-Optical Network RWA Design) algorithm for the Tera OXC: network resource for a route is calculated by the number of internal switching paths established in each OXC nodes on the route, and is normalized by ratio of number of paths established and number of paths equipped in a node. We show that it fits for the RWA algorithm of the wavelength routed all-optical network through real experiments on the distributed objects platform.

Network Theory: A Primer and Questions for Air Transportation Systems Applications

NASA Technical Reports Server (NTRS)

Holmes, Bruce J.

2004-01-01

A new understanding (with potential applications to air transportation systems) has emerged in the past five years in the scientific field of networks. This development emerges in large part because we now have a new laboratory for developing theories about complex networks: The Internet. The premise of this new understanding is that most complex networks of interest, both of nature and of human contrivance, exhibit a fundamentally different behavior than thought for over two hundred years under classical graph theory. Classical theory held that networks exhibited random behavior, characterized by normal, (e.g., Gaussian or Poisson) degree distributions of the connectivity between nodes by links. The new understanding turns this idea on its head: networks of interest exhibit scale-free (or small world) degree distributions of connectivity, characterized by power law distributions. The implications of scale-free behavior for air transportation systems include the potential that some behaviors of complex system architectures might be analyzed through relatively simple approximations of local elements of the system. For air transportation applications, this presentation proposes a framework for constructing topologies (architectures) that represent the relationships between mobility, flight operations, aircraft requirements, and airspace capacity, and the related externalities in airspace procedures and architectures. The proposed architectures or topologies may serve as a framework for posing comparative and combinative analyses of performance, cost, security, environmental, and related metrics.

Communication about childhood obesity on Twitter.

PubMed

Harris, Jenine K; Moreland-Russell, Sarah; Tabak, Rachel G; Ruhr, Lindsay R; Maier, Ryan C

2014-07-01

Little is known about the use of social media as a tool for health communication. We used a mixed-methods design to examine communication about childhood obesity on Twitter. NodeXL was used to collect tweets sent in June 2013 containing the hashtag #childhoodobesity. Tweets were coded for content; tweeters were classified by sector and health focus. Data were also collected on the network of follower connections among the tweeters. We used descriptive statistics and exponential random graph modeling to examine tweet content, characteristics of tweeters, and the composition and structure of the network of connections facilitating communication among tweeters. We collected 1110 tweets originating from 576 unique Twitter users. More individuals (65.6%) than organizations (32.9%) tweeted. More tweets focused on individual behavior than environment or policy. Few government and educational tweeters were in the network, but they were more likely than private individuals to be followed by others. There is an opportunity to better disseminate evidence-based information to a broad audience through Twitter by increasing the presence of credible sources in the #childhoodobesity conversation and focusing the content of tweets on scientific evidence.

Finite element generation of arbitrary 3-D fracture networks for flow analysis in complicated discrete fracture networks

NASA Astrophysics Data System (ADS)

Zhang, Qi-Hua

2015-10-01

Finite element generation of complicated fracture networks is the core issue and source of technical difficulty in three-dimensional (3-D) discrete fracture network (DFN) flow models. Due to the randomness and uncertainty in the configuration of a DFN, the intersection lines (traces) are arbitrarily distributed in each face (fracture and other surfaces). Hence, subdivision of the fractures is an issue relating to subdivision of two-dimensional (2-D) domains with arbitrarily-distributed constraints. When the DFN configuration is very complicated, the well-known approaches (e.g. Voronoi Delaunay-based methods and advancing-front techniques) cannot operate properly. This paper proposes an algorithm to implement end-to-end connection between traces to subdivide 2-D domains into closed loops. The compositions of the vertices in the common edges between adjacent loops (which may belong to a single fracture or two connected fractures) are thus ensured to be topologically identical. The paper then proposes an approach for triangulating arbitrary loops which does not add any nodes to ensure consistency of the meshes at the common edges. In addition, several techniques relating to tolerance control and improving code robustness are discussed. Finally, the equivalent permeability of the rock mass is calculated for some very complicated DFNs (the DFN may contain 1272 fractures, 633 connected fractures, and 16,270 closed loops). The results are compared with other approaches to demonstrate the veracity and efficiency of the approach proposed in this paper.

Evolution of a Modified Binomial Random Graph by Agglomeration

NASA Astrophysics Data System (ADS)

Kang, Mihyun; Pachon, Angelica; Rodríguez, Pablo M.

2018-02-01

In the classical Erdős-Rényi random graph G( n, p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G( n, p) is homogeneous in the sense that all vertices have the same characteristics. On the other hand, numerous real-world networks are inhomogeneous in this respect. Such an inhomogeneity of vertices may influence the connection probability between pairs of vertices. The purpose of this paper is to propose a new inhomogeneous random graph model which is obtained in a constructive way from the Erdős-Rényi random graph G( n, p). Given a configuration of n vertices arranged in N subsets of vertices (we call each subset a super-vertex), we define a random graph with N super-vertices by letting two super-vertices be connected if and only if there is at least one edge between them in G( n, p). Our main result concerns the threshold for connectedness. We also analyze the phase transition for the emergence of the giant component and the degree distribution. Even though our model begins with G( n, p), it assumes the existence of some community structure encoded in the configuration. Furthermore, under certain conditions it exhibits a power law degree distribution. Both properties are important for real-world applications.

Network analysis of translocated Takahe populations to identify disease surveillance targets.

PubMed

Grange, Zoë L; VAN Andel, Mary; French, Nigel P; Gartrell, Brett D

2014-04-01

Social network analysis is being increasingly used in epidemiology and disease modeling in humans, domestic animals, and wildlife. We investigated this tool in describing a translocation network (area that allows movement of animals between geographically isolated locations) used for the conservation of an endangered flightless rail, the Takahe (Porphyrio hochstetteri). We collated records of Takahe translocations within New Zealand and used social network principles to describe the connectivity of the translocation network. That is, networks were constructed and analyzed using adjacency matrices with values based on the tie weights between nodes. Five annual network matrices were created using the Takahe data set, each incremental year included records of previous years. Weights of movements between connected locations were assigned by the number of Takahe moved. We calculated the number of nodes (i(total)) and the number of ties (t(total)) between the nodes. To quantify the small-world character of the networks, we compared the real networks to random graphs of the equivalent size, weighting, and node strength. Descriptive analysis of cumulative annual Takahe movement networks involved determination of node-level characteristics, including centrality descriptors of relevance to disease modeling such as weighted measures of in degree (k(i)(in)), out degree (k(i)(out)), and betweenness (B(i)). Key players were assigned according to the highest node measure of k(i)(in), k(i)(out), and B(i) per network. Networks increased in size throughout the time frame considered. The network had some degree small-world characteristics. Nodes with the highest cumulative tie weights connecting them were the captive breeding center, the Murchison Mountains and 2 offshore islands. The key player fluctuated between the captive breeding center and the Murchison Mountains. The cumulative networks identified the captive breeding center every year as the hub of the network until the final network in 2011. Likewise, the wild Murchison Mountains population was consistently the sink of the network. Other nodes, such as the offshore islands and the wildlife hospital, varied in importance over time. Common network descriptors and measures of centrality identified key locations for targeting disease surveillance. The visual representation of movements of animals in a population that this technique provides can aid decision makers when they evaluate translocation proposals or attempt to control a disease outbreak. © 2014 Society for Conservation Biology.

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.

The timescales of global surface-ocean connectivity.

PubMed

Jönsson, Bror F; Watson, James R

2016-04-19

Planktonic communities are shaped through a balance of local evolutionary adaptation and ecological succession driven in large part by migration. The timescales over which these processes operate are still largely unresolved. Here we use Lagrangian particle tracking and network theory to quantify the timescale over which surface currents connect different regions of the global ocean. We find that the fastest path between two patches--each randomly located anywhere in the surface ocean--is, on average, less than a decade. These results suggest that marine planktonic communities may keep pace with climate change--increasing temperatures, ocean acidification and changes in stratification over decadal timescales--through the advection of resilient types.

The timescales of global surface-ocean connectivity

PubMed Central

Jönsson, Bror F.; Watson, James R.

2016-01-01

Planktonic communities are shaped through a balance of local evolutionary adaptation and ecological succession driven in large part by migration. The timescales over which these processes operate are still largely unresolved. Here we use Lagrangian particle tracking and network theory to quantify the timescale over which surface currents connect different regions of the global ocean. We find that the fastest path between two patches—each randomly located anywhere in the surface ocean—is, on average, less than a decade. These results suggest that marine planktonic communities may keep pace with climate change—increasing temperatures, ocean acidification and changes in stratification over decadal timescales—through the advection of resilient types. PMID:27093522

Balance of Interactions Determines Optimal Survival in Multi-Species Communities.

PubMed

Choudhary, Anshul; Sinha, Sudeshna

2015-01-01

We consider a multi-species community modelled as a complex network of populations, where the links are given by a random asymmetric connectivity matrix J, with fraction 1 - C of zero entries, where C reflects the over-all connectivity of the system. The non-zero elements of J are drawn from a Gaussian distribution with mean μ and standard deviation σ. The signs of the elements Jij reflect the nature of density-dependent interactions, such as predatory-prey, mutualism or competition, and their magnitudes reflect the strength of the interaction. In this study we try to uncover the broad features of the inter-species interactions that determine the global robustness of this network, as indicated by the average number of active nodes (i.e. non-extinct species) in the network, and the total population, reflecting the biomass yield. We find that the network transitions from a completely extinct system to one where all nodes are active, as the mean interaction strength goes from negative to positive, with the transition getting sharper for increasing C and decreasing σ. We also find that the total population, displays distinct non-monotonic scaling behaviour with respect to the product μC, implying that survival is dependent not merely on the number of links, but rather on the combination of the sparseness of the connectivity matrix and the net interaction strength. Interestingly, in an intermediate window of positive μC, the total population is maximal, indicating that too little or too much positive interactions is detrimental to survival. Rather, the total population levels are optimal when the network has intermediate net positive connection strengths. At the local level we observe marked qualitative changes in dynamical patterns, ranging from anti-phase clusters of period 2 cycles and chaotic bands, to fixed points, under the variation of mean μ of the interaction strengths. We also study the correlation between synchronization and survival, and find that synchronization does not necessarily lead to extinction. Lastly, we propose an effective low dimensional map to capture the behavior of the entire network, and this provides a broad understanding of the interplay of the local dynamical patterns and the global robustness trends in the network.

Socialising Health Burden Through Different Network Topologies: A Simulation Study.

PubMed

Peacock, Adrian; Cheung, Anthony; Kim, Peter; Poon, Simon K

2017-01-01

An aging population and the expectation of premium quality health services combined with the increasing economic burden of the healthcare system requires a paradigm shift toward patient oriented healthcare. The guardian angel theory described by Szolovits [1] explores the notion of enlisting patients as primary providers of information and motivation to patients with similar clinical history through social connections. In this study, an agent based model was developed to simulate to explore how individuals are affected through their levels of intrinsic positivity. Ring, point-to-point (paired buddy), and random networks were modelled, with individuals able to send messages to each other given their levels of variables positivity and motivation. Of the 3 modelled networks it is apparent that the ring network provides the most equal, collective improvement in positivity and motivation for all users. Further study into other network topologies should be undertaken in the future.

Effective distances for epidemics spreading on complex networks.

PubMed

Iannelli, Flavio; Koher, Andreas; Brockmann, Dirk; Hövel, Philipp; Sokolov, Igor M

2017-01-01

We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic transportation data we perform numerical experiments to compare the infection arrival time with this alternative metric that is obtained by accounting for multiple walks instead of only the most probable path. The comparison with direct simulations reveals a higher correlation compared to the shortest-path approach used previously. In addition our method allows to connect fundamental observables in epidemic spreading with the cumulant-generating function of the hitting time for a Markov chain. Our results provides a general and computationally efficient approach using only algebraic methods.

Effective distances for epidemics spreading on complex networks

NASA Astrophysics Data System (ADS)

Iannelli, Flavio; Koher, Andreas; Brockmann, Dirk; Hövel, Philipp; Sokolov, Igor M.

2017-01-01

We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic transportation data we perform numerical experiments to compare the infection arrival time with this alternative metric that is obtained by accounting for multiple walks instead of only the most probable path. The comparison with direct simulations reveals a higher correlation compared to the shortest-path approach used previously. In addition our method allows to connect fundamental observables in epidemic spreading with the cumulant-generating function of the hitting time for a Markov chain. Our results provides a general and computationally efficient approach using only algebraic methods.

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.

Small Worldness in Dense and Weighted Connectomes

NASA Astrophysics Data System (ADS)

Colon-Perez, Luis; Couret, Michelle; Triplett, William; Price, Catherine; Mareci, Thomas

2016-05-01

The human brain is a heterogeneous network of connected functional regions; however, most brain network studies assume that all brain connections can be described in a framework of binary connections. The brain is a complex structure of white matter tracts connected by a wide range of tract sizes, which suggests a broad range of connection strengths. Therefore, the assumption that the connections are binary yields an incomplete picture of the brain. Various thresholding methods have been used to remove spurious connections and reduce the graph density in binary networks. But these thresholds are arbitrary and make problematic the comparison of networks created at different thresholds. The heterogeneity of connection strengths can be represented in graph theory by applying weights to the network edges. Using our recently introduced edge weight parameter, we estimated the topological brain network organization using a complimentary weighted connectivity framework to the traditional framework of a binary network. To examine the reproducibility of brain networks in a controlled condition, we studied the topological network organization of a single healthy individual by acquiring 10 repeated diffusion-weighted magnetic resonance image datasets, over a one-month period on the same scanner, and analyzing these networks with deterministic tractography. We applied a threshold to both the binary and weighted networks and determined that the extra degree of freedom that comes with the framework of weighting network connectivity provides a robust result as any threshold level. The proposed weighted connectivity framework provides a stable result and is able to demonstrate the small world property of brain networks in situations where the binary framework is inadequate and unable to demonstrate this network property.

Dynamic effective connectivity in cortically embedded systems of recurrently coupled synfire chains.

PubMed

Trengove, Chris; Diesmann, Markus; van Leeuwen, Cees

2016-02-01

As a candidate mechanism of neural representation, large numbers of synfire chains can efficiently be embedded in a balanced recurrent cortical network model. Here we study a model in which multiple synfire chains of variable strength are randomly coupled together to form a recurrent system. The system can be implemented both as a large-scale network of integrate-and-fire neurons and as a reduced model. The latter has binary-state pools as basic units but is otherwise isomorphic to the large-scale model, and provides an efficient tool for studying its behavior. Both the large-scale system and its reduced counterpart are able to sustain ongoing endogenous activity in the form of synfire waves, the proliferation of which is regulated by negative feedback caused by collateral noise. Within this equilibrium, diverse repertoires of ongoing activity are observed, including meta-stability and multiple steady states. These states arise in concert with an effective connectivity structure (ECS). The ECS admits a family of effective connectivity graphs (ECGs), parametrized by the mean global activity level. Of these graphs, the strongly connected components and their associated out-components account to a large extent for the observed steady states of the system. These results imply a notion of dynamic effective connectivity as governing neural computation with synfire chains, and related forms of cortical circuitry with complex topologies.

High-Degree Neurons Feed Cortical Computations

PubMed Central

Timme, Nicholas M.; Ito, Shinya; Shimono, Masanori; Yeh, Fang-Chin; Litke, Alan M.; Beggs, John M.

2016-01-01

Recent work has shown that functional connectivity among cortical neurons is highly varied, with a small percentage of neurons having many more connections than others. Also, recent theoretical developments now make it possible to quantify how neurons modify information from the connections they receive. Therefore, it is now possible to investigate how information modification, or computation, depends on the number of connections a neuron receives (in-degree) or sends out (out-degree). To do this, we recorded the simultaneous spiking activity of hundreds of neurons in cortico-hippocampal slice cultures using a high-density 512-electrode array. This preparation and recording method combination produced large numbers of neurons recorded at temporal and spatial resolutions that are not currently available in any in vivo recording system. We utilized transfer entropy (a well-established method for detecting linear and nonlinear interactions in time series) and the partial information decomposition (a powerful, recently developed tool for dissecting multivariate information processing into distinct parts) to quantify computation between neurons where information flows converged. We found that computations did not occur equally in all neurons throughout the networks. Surprisingly, neurons that computed large amounts of information tended to receive connections from high out-degree neurons. However, the in-degree of a neuron was not related to the amount of information it computed. To gain insight into these findings, we developed a simple feedforward network model. We found that a degree-modified Hebbian wiring rule best reproduced the pattern of computation and degree correlation results seen in the real data. Interestingly, this rule also maximized signal propagation in the presence of network-wide correlations, suggesting a mechanism by which cortex could deal with common random background input. These are the first results to show that the extent to which a neuron modifies incoming information streams depends on its topological location in the surrounding functional network. PMID:27159884

Local Neighbourhoods for First-Passage Percolation on the Configuration Model

NASA Astrophysics Data System (ADS)

Dereich, Steffen; Ortgiese, Marcel

2018-04-01

We consider first-passage percolation on the configuration model. Once the network has been generated each edge is assigned an i.i.d. weight modeling the passage time of a message along this edge. Then independently two vertices are chosen uniformly at random, a sender and a recipient, and all edges along the geodesic connecting the two vertices are coloured in red (in the case that both vertices are in the same component). In this article we prove local limit theorems for the coloured graph around the recipient in the spirit of Benjamini and Schramm. We consider the explosive regime, in which case the random distances are of finite order, and the Malthusian regime, in which case the random distances are of logarithmic order.

Modular networks with delayed coupling: Synchronization and frequency control

NASA Astrophysics Data System (ADS)

Maslennikov, Oleg V.; Nekorkin, Vladimir I.

2014-07-01

We study the collective dynamics of modular networks consisting of map-based neurons which generate irregular spike sequences. Three types of intramodule topology are considered: a random Erdös-Rényi network, a small-world Watts-Strogatz network, and a scale-free Barabási-Albert network. The interaction between the neurons of different modules is organized by relatively sparse connections with time delay. For all the types of the network topology considered, we found that with increasing delay two regimes of module synchronization alternate with each other: inphase and antiphase. At the same time, the average rate of collective oscillations decreases within each of the time-delay intervals corresponding to a particular synchronization regime. A dual role of the time delay is thus established: controlling a synchronization mode and degree and controlling an average network frequency. Furthermore, we investigate the influence on the modular synchronization by other parameters: the strength of intermodule coupling and the individual firing rate.

Frailty effects in networks: comparison and identification of individual heterogeneity versus preferential attachment in evolving networks

PubMed Central

de Blasio, Birgitte Freiesleben; Seierstad, Taral Guldahl; Aalen, Odd O

2011-01-01

Preferential attachment is a proportionate growth process in networks, where nodes receive new links in proportion to their current degree. Preferential attachment is a popular generative mechanism to explain the widespread observation of power-law-distributed networks. An alternative explanation for the phenomenon is a randomly grown network with large individual variation in growth rates among the nodes (frailty). We derive analytically the distribution of individual rates, which will reproduce the connectivity distribution that is obtained from a general preferential attachment process (Yule process), and the structural differences between the two types of graphs are examined by simulations. We present a statistical test to distinguish the two generative mechanisms from each other and we apply the test to both simulated data and two real data sets of scientific citation and sexual partner networks. The findings from the latter analyses argue for frailty effects as an important mechanism underlying the dynamics of complex networks. PMID:21572513

Resting-State Functional Connectivity in Individuals with Down Syndrome and Williams Syndrome Compared with Typically Developing Controls.

PubMed

Vega, Jennifer N; Hohman, Timothy J; Pryweller, Jennifer R; Dykens, Elisabeth M; Thornton-Wells, Tricia A

2015-10-01

The emergence of resting-state functional connectivity (rsFC) analysis, which examines temporal correlations of low-frequency (<0.1 Hz) blood oxygen level-dependent signal fluctuations between brain regions, has dramatically improved our understanding of the functional architecture of the typically developing (TD) human brain. This study examined rsFC in Down syndrome (DS) compared with another neurodevelopmental disorder, Williams syndrome (WS), and TD. Ten subjects with DS, 18 subjects with WS, and 40 subjects with TD each participated in a 3-Tesla MRI scan. We tested for group differences (DS vs. TD, DS vs. WS, and WS vs. TD) in between- and within-network rsFC connectivity for seven functional networks. For the DS group, we also examined associations between rsFC and other cognitive and genetic risk factors. In DS compared with TD, we observed higher levels of between-network connectivity in 6 out 21 network pairs but no differences in within-network connectivity. Participants with WS showed lower levels of within-network connectivity and no significant differences in between-network connectivity relative to DS. Finally, our comparison between WS and TD controls revealed lower within-network connectivity in multiple networks and higher between-network connectivity in one network pair relative to TD controls. While preliminary due to modest sample sizes, our findings suggest a global difference in between-network connectivity in individuals with neurodevelopmental disorders compared with controls and that such a difference is exacerbated across many brain regions in DS. However, this alteration in DS does not appear to extend to within-network connections, and therefore, the altered between-network connectivity must be interpreted within the framework of an intact intra-network pattern of activity. In contrast, WS shows markedly lower levels of within-network connectivity in the default mode network and somatomotor network relative to controls. These findings warrant further investigation using a task-based procedure that may help disentangle the relationship between brain function and cognitive performance across the spectrum of neurodevelopmental disorders.

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.

Social network models predict movement and connectivity in ecological landscapes

USGS Publications Warehouse

Fletcher, R.J.; Acevedo, M.A.; Reichert, Brian E.; Pias, Kyle E.; Kitchens, W.M.

2011-01-01

Network analysis is on the rise across scientific disciplines because of its ability to reveal complex, and often emergent, patterns and dynamics. Nonetheless, a growing concern in network analysis is the use of limited data for constructing networks. This concern is strikingly relevant to ecology and conservation biology, where network analysis is used to infer connectivity across landscapes. In this context, movement among patches is the crucial parameter for interpreting connectivity but because of the difficulty of collecting reliable movement data, most network analysis proceeds with only indirect information on movement across landscapes rather than using observed movement to construct networks. Statistical models developed for social networks provide promising alternatives for landscape network construction because they can leverage limited movement information to predict linkages. Using two mark-recapture datasets on individual movement and connectivity across landscapes, we test whether commonly used network constructions for interpreting connectivity can predict actual linkages and network structure, and we contrast these approaches to social network models. We find that currently applied network constructions for assessing connectivity consistently, and substantially, overpredict actual connectivity, resulting in considerable overestimation of metapopulation lifetime. Furthermore, social network models provide accurate predictions of network structure, and can do so with remarkably limited data on movement. Social network models offer a flexible and powerful way for not only understanding the factors influencing connectivity but also for providing more reliable estimates of connectivity and metapopulation persistence in the face of limited data.

Discovering the hidden sub-network component in a ranked list of genes or proteins derived from genomic experiments

PubMed Central

García-Alonso, Luz; Alonso, Roberto; Vidal, Enrique; Amadoz, Alicia; de María, Alejandro; Minguez, Pablo; Medina, Ignacio; Dopazo, Joaquín

2012-01-01

Genomic experiments (e.g. differential gene expression, single-nucleotide polymorphism association) typically produce ranked list of genes. We present a simple but powerful approach which uses protein–protein interaction data to detect sub-networks within such ranked lists of genes or proteins. We performed an exhaustive study of network parameters that allowed us concluding that the average number of components and the average number of nodes per component are the parameters that best discriminate between real and random networks. A novel aspect that increases the efficiency of this strategy in finding sub-networks is that, in addition to direct connections, also connections mediated by intermediate nodes are considered to build up the sub-networks. The possibility of using of such intermediate nodes makes this approach more robust to noise. It also overcomes some limitations intrinsic to experimental designs based on differential expression, in which some nodes are invariant across conditions. The proposed approach can also be used for candidate disease-gene prioritization. Here, we demonstrate the usefulness of the approach by means of several case examples that include a differential expression analysis in Fanconi Anemia, a genome-wide association study of bipolar disorder and a genome-scale study of essentiality in cancer genes. An efficient and easy-to-use web interface (available at http://www.babelomics.org) based on HTML5 technologies is also provided to run the algorithm and represent the network. PMID:22844098

Coarse-Grained Descriptions of Dynamics for Networks with Both Intrinsic and Structural Heterogeneities

PubMed Central

Bertalan, Tom; Wu, Yan; Laing, Carlo; Gear, C. William; Kevrekidis, Ioannis G.

2017-01-01

Finding accurate reduced descriptions for large, complex, dynamically evolving networks is a crucial enabler to their simulation, analysis, and ultimately design. Here, we propose and illustrate a systematic and powerful approach to obtaining good collective coarse-grained observables—variables successfully summarizing the detailed state of such networks. Finding such variables can naturally lead to successful reduced dynamic models for the networks. The main premise enabling our approach is the assumption that the behavior of a node in the network depends (after a short initial transient) on the node identity: a set of descriptors that quantify the node properties, whether intrinsic (e.g., parameters in the node evolution equations) or structural (imparted to the node by its connectivity in the particular network structure). The approach creates a natural link with modeling and “computational enabling technology” developed in the context of Uncertainty Quantification. In our case, however, we will not focus on ensembles of different realizations of a problem, each with parameters randomly selected from a distribution. We will instead study many coupled heterogeneous units, each characterized by randomly assigned (heterogeneous) parameter value(s). One could then coin the term Heterogeneity Quantification for this approach, which we illustrate through a model dynamic network consisting of coupled oscillators with one intrinsic heterogeneity (oscillator individual frequency) and one structural heterogeneity (oscillator degree in the undirected network). The computational implementation of the approach, its shortcomings and possible extensions are also discussed. PMID:28659781

Degree and wealth distribution in a network induced by wealth

NASA Astrophysics Data System (ADS)

Lee, Gyemin; Kim, Gwang Il

2007-09-01

A network induced by wealth is a social network model in which wealth induces individuals to participate as nodes, and every node in the network produces and accumulates wealth utilizing its links. More specifically, at every time step a new node is added to the network, and a link is created between one of the existing nodes and the new node. Innate wealth-producing ability is randomly assigned to every new node, and the node to be connected to the new node is chosen randomly, with odds proportional to the accumulated wealth of each existing node. Analyzing this network using the mean value and continuous flow approaches, we derive a relation between the conditional expectations of the degree and the accumulated wealth of each node. From this relation, we show that the degree distribution of the network induced by wealth is scale-free. We also show that the wealth distribution has a power-law tail and satisfies the 80/20 rule. We also show that, over the whole range, the cumulative wealth distribution exhibits the same topological characteristics as the wealth distributions of several networks based on the Bouchaud-Mèzard model, even though the mechanism for producing wealth is quite different in our model. Further, we show that the cumulative wealth distribution for the poor and middle class seems likely to follow by a log-normal distribution, while for the richest, the cumulative wealth distribution has a power-law behavior.

Cooperation and Contagion in Web-Based, Networked Public Goods Experiments

PubMed Central

Suri, Siddharth; Watts, Duncan J.

2011-01-01

A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs. PMID:21412431

Cooperation and contagion in web-based, networked public goods experiments.

PubMed

Suri, Siddharth; Watts, Duncan J

2011-03-11

A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs.

Phase transitions in Ising models on directed networks

NASA Astrophysics Data System (ADS)

Lipowski, Adam; Ferreira, António Luis; Lipowska, Dorota; Gontarek, Krzysztof

2015-11-01

We examine Ising models with heat-bath dynamics on directed networks. Our simulations show that Ising models on directed triangular and simple cubic lattices undergo a phase transition that most likely belongs to the Ising universality class. On the directed square lattice the model remains paramagnetic at any positive temperature as already reported in some previous studies. We also examine random directed graphs and show that contrary to undirected ones, percolation of directed bonds does not guarantee ferromagnetic ordering. Only above a certain threshold can a random directed graph support finite-temperature ferromagnetic ordering. Such behavior is found also for out-homogeneous random graphs, but in this case the analysis of magnetic and percolative properties can be done exactly. Directed random graphs also differ from undirected ones with respect to zero-temperature freezing. Only at low connectivity do they remain trapped in a disordered configuration. Above a certain threshold, however, the zero-temperature dynamics quickly drives the model toward a broken symmetry (magnetized) state. Only above this threshold, which is almost twice as large as the percolation threshold, do we expect the Ising model to have a positive critical temperature. With a very good accuracy, the behavior on directed random graphs is reproduced within a certain approximate scheme.

Are randomly grown graphs really random?

PubMed

Callaway, D S; Hopcroft, J E; Kleinberg, J M; Newman, M E; Strogatz, S H

2001-10-01

We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time steps. In the limit of large t, the resulting graph displays surprisingly rich characteristics. In particular, a giant component emerges in an infinite-order phase transition at delta=1/8. At the transition, the average component size jumps discontinuously but remains finite. In contrast, a static random graph with the same degree distribution exhibits a second-order phase transition at delta=1/4, and the average component size diverges there. These dramatic differences between grown and static random graphs stem from a positive correlation between the degrees of connected vertices in the grown graph-older vertices tend to have higher degree, and to link with other high-degree vertices, merely by virtue of their age. We conclude that grown graphs, however randomly they are constructed, are fundamentally different from their static random graph counterparts.

Hybrid ICA-Bayesian network approach reveals distinct effective connectivity differences in schizophrenia.

PubMed

Kim, D; Burge, J; Lane, T; Pearlson, G D; Kiehl, K A; Calhoun, V D

2008-10-01

We utilized a discrete dynamic Bayesian network (dDBN) approach (Burge, J., Lane, T., Link, H., Qiu, S., Clark, V.P., 2007. Discrete dynamic Bayesian network analysis of fMRI data. Hum Brain Mapp.) to determine differences in brain regions between patients with schizophrenia and healthy controls on a measure of effective connectivity, termed the approximate conditional likelihood score (ACL) (Burge, J., Lane, T., 2005. Learning Class-Discriminative Dynamic Bayesian Networks. Proceedings of the International Conference on Machine Learning, Bonn, Germany, pp. 97-104.). The ACL score represents a class-discriminative measure of effective connectivity by measuring the relative likelihood of the correlation between brain regions in one group versus another. The algorithm is capable of finding non-linear relationships between brain regions because it uses discrete rather than continuous values and attempts to model temporal relationships with a first-order Markov and stationary assumption constraint (Papoulis, A., 1991. Probability, random variables, and stochastic processes. McGraw-Hill, New York.). Since Bayesian networks are overly sensitive to noisy data, we introduced an independent component analysis (ICA) filtering approach that attempted to reduce the noise found in fMRI data by unmixing the raw datasets into a set of independent spatial component maps. Components that represented noise were removed and the remaining components reconstructed into the dimensions of the original fMRI datasets. We applied the dDBN algorithm to a group of 35 patients with schizophrenia and 35 matched healthy controls using an ICA filtered and unfiltered approach. We determined that filtering the data significantly improved the magnitude of the ACL score. Patients showed the greatest ACL scores in several regions, most markedly the cerebellar vermis and hemispheres. Our findings suggest that schizophrenia patients exhibit weaker connectivity than healthy controls in multiple regions, including bilateral temporal, frontal, and cerebellar regions during an auditory paradigm.

Continuous Attractor Network Model for Conjunctive Position-by-Velocity Tuning of Grid Cells

PubMed Central

Si, Bailu; Romani, Sandro; Tsodyks, Misha

2014-01-01

The spatial responses of many of the cells recorded in layer II of rodent medial entorhinal cortex (MEC) show a triangular grid pattern, which appears to provide an accurate population code for animal spatial position. In layer III, V and VI of the rat MEC, grid cells are also selective to head-direction and are modulated by the speed of the animal. Several putative mechanisms of grid-like maps were proposed, including attractor network dynamics, interactions with theta oscillations or single-unit mechanisms such as firing rate adaptation. In this paper, we present a new attractor network model that accounts for the conjunctive position-by-velocity selectivity of grid cells. Our network model is able to perform robust path integration even when the recurrent connections are subject to random perturbations. PMID:24743341

Age differences in the functional interactions among the default, frontoparietal control, and dorsal attention networks.

PubMed

Grady, Cheryl; Sarraf, Saman; Saverino, Cristina; Campbell, Karen

2016-05-01

Older adults typically show weaker functional connectivity (FC) within brain networks compared with young adults, but stronger functional connections between networks. Our primary aim here was to use a graph theoretical approach to identify age differences in the FC of 3 networks-default mode network (DMN), dorsal attention network, and frontoparietal control (FPC)-during rest and task conditions and test the hypothesis that age differences in the FPC would influence age differences in the other networks, consistent with its role as a cognitive "switch." At rest, older adults showed lower clustering values compared with the young, and both groups showed more between-network connections involving the FPC than the other 2 networks, but this difference was greater in the older adults. Connectivity within the DMN was reduced in older compared with younger adults. Consistent with our hypothesis, between-network connections of the FPC at rest predicted the age-related reduction in connectivity within the DMN. There was no age difference in within-network FC during the task (after removing the specific task effect), but between-network connections were greater in older adults than in young adults for the FPC and dorsal attention network. In addition, age reductions were found in almost all the graph metrics during the task condition, including clustering and modularity. Finally, age differences in between-network connectivity of the FPC during both rest and task predicted cognitive performance. These findings provide additional evidence of less within-network but greater between-network FC in older adults during rest but also show that these age differences can be altered by the residual influence of task demands on background connectivity. Our results also support a role for the FPC as the regulator of other brain networks in the service of cognition. Critically, the link between age differences in inter-network connections of the FPC and DMN connectivity, and the link between FPC connectivity and performance, support the hypothesis that FC of the FPC influences the expression of age differences in other networks, as well as differences in cognitive function. Copyright © 2016 Elsevier Inc. 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

Spreading Effect in Industrial Complex Network Based on Revised Structural Holes Theory

PubMed Central

Ye, Qing; Guan, Jun

2016-01-01

This paper analyzed the spreading effect of industrial sectors with complex network model under perspective of econophysics. Input-output analysis, as an important research tool, focuses more on static analysis. However, the fundamental aim of industry analysis is to figure out how interaction between different industries makes impacts on economic development, which turns out to be a dynamic process. Thus, industrial complex network based on input-output tables from WIOD is proposed to be a bridge connecting accurate static quantitative analysis and comparable dynamic one. With application of revised structural holes theory, flow betweenness and random walk centrality were respectively chosen to evaluate industrial sectors’ long-term and short-term spreading effect process in this paper. It shows that industries with higher flow betweenness or random walk centrality would bring about more intensive industrial spreading effect to the industrial chains they stands in, because value stream transmission of industrial sectors depends on how many products or services it can get from the other ones, and they are regarded as brokers with bigger information superiority and more intermediate interests. PMID:27218468

Spreading Effect in Industrial Complex Network Based on Revised Structural Holes Theory.

PubMed

Xing, Lizhi; Ye, Qing; Guan, Jun

2016-01-01

This paper analyzed the spreading effect of industrial sectors with complex network model under perspective of econophysics. Input-output analysis, as an important research tool, focuses more on static analysis. However, the fundamental aim of industry analysis is to figure out how interaction between different industries makes impacts on economic development, which turns out to be a dynamic process. Thus, industrial complex network based on input-output tables from WIOD is proposed to be a bridge connecting accurate static quantitative analysis and comparable dynamic one. With application of revised structural holes theory, flow betweenness and random walk centrality were respectively chosen to evaluate industrial sectors' long-term and short-term spreading effect process in this paper. It shows that industries with higher flow betweenness or random walk centrality would bring about more intensive industrial spreading effect to the industrial chains they stands in, because value stream transmission of industrial sectors depends on how many products or services it can get from the other ones, and they are regarded as brokers with bigger information superiority and more intermediate interests.

Shakeout: A New Approach to Regularized Deep Neural Network Training.

PubMed

Kang, Guoliang; Li, Jun; Tao, Dacheng

2018-05-01

Recent years have witnessed the success of deep neural networks in dealing with a plenty of practical problems. Dropout has played an essential role in many successful deep neural networks, by inducing regularization in the model training. In this paper, we present a new regularized training approach: Shakeout. Instead of randomly discarding units as Dropout does at the training stage, Shakeout randomly chooses to enhance or reverse each unit's contribution to the next layer. This minor modification of Dropout has the statistical trait: the regularizer induced by Shakeout adaptively combines , and regularization terms. Our classification experiments with representative deep architectures on image datasets MNIST, CIFAR-10 and ImageNet show that Shakeout deals with over-fitting effectively and outperforms Dropout. We empirically demonstrate that Shakeout leads to sparser weights under both unsupervised and supervised settings. Shakeout also leads to the grouping effect of the input units in a layer. Considering the weights in reflecting the importance of connections, Shakeout is superior to Dropout, which is valuable for the deep model compression. Moreover, we demonstrate that Shakeout can effectively reduce the instability of the training process of the deep architecture.

Opinion dynamics on an adaptive random network

NASA Astrophysics Data System (ADS)

Benczik, I. J.; Benczik, S. Z.; Schmittmann, B.; Zia, R. K. P.

2009-04-01

We revisit the classical model for voter dynamics in a two-party system with two basic modifications. In contrast to the original voter model studied in regular lattices, we implement the opinion formation process in a random network of agents in which interactions are no longer restricted by geographical distance. In addition, we incorporate the rapidly changing nature of the interpersonal relations in the model. At each time step, agents can update their relationships. This update is determined by their own opinion, and by their preference to make connections with individuals sharing the same opinion, or rather with opponents. In this way, the network is built in an adaptive manner, in the sense that its structure is correlated and evolves with the dynamics of the agents. The simplicity of the model allows us to examine several issues analytically. We establish criteria to determine whether consensus or polarization will be the outcome of the dynamics and on what time scales these states will be reached. In finite systems consensus is typical, while in infinite systems a disordered metastable state can emerge and persist for infinitely long time before consensus is reached.

Genesis of interictal spikes in the CA1: a computational investigation

PubMed Central

Ratnadurai-Giridharan, Shivakeshavan; Stefanescu, Roxana A.; Khargonekar, Pramod P.; Carney, Paul R.; Talathi, Sachin S.

2014-01-01

Interictal spikes (IISs) are spontaneous high amplitude, short time duration <400 ms events often observed in electroencephalographs (EEG) of epileptic patients. In vitro analysis of resected mesial temporal lobe tissue from patients with refractory temporal lobe epilepsy has revealed the presence of IIS in the CA1 subfield. In this paper, we develop a biophysically relevant network model of the CA1 subfield and investigate how changes in the network properties influence the susceptibility of CA1 to exhibit an IIS. We present a novel template based approach to identify conditions under which synchronization of paroxysmal depolarization shift (PDS) events evoked in CA1 pyramidal (Py) cells can trigger an IIS. The results from this analysis are used to identify the synaptic parameters of a minimal network model that is capable of generating PDS in response to afferent synaptic input. The minimal network model parameters are then incorporated into a detailed network model of the CA1 subfield in order to address the following questions: (1) How does the formation of an IIS in the CA1 depend on the degree of sprouting (recurrent connections) between the CA1 Py cells and the fraction of CA3 Shaffer collateral (SC) connections onto the CA1 Py cells? and (2) Is synchronous afferent input from the SC essential for the CA1 to exhibit IIS? Our results suggest that the CA1 subfield with low recurrent connectivity (absence of sprouting), mimicking the topology of a normal brain, has a very low probability of producing an IIS except when a large fraction of CA1 neurons (>80%) receives a barrage of quasi-synchronous afferent input (input occurring within a temporal window of ≤24 ms) via the SC. However, as we increase the recurrent connectivity of the CA1 (Psprout > 40); mimicking sprouting in a pathological CA1 network, the CA1 can exhibit IIS even in the absence of a barrage of quasi-synchronous afferents from the SC (input occurring within temporal window >80 ms) and a low fraction of CA1 Py cells (≈30%) receiving SC input. Furthermore, we find that in the presence of Poisson distributed random input via SC, the CA1 network is able to generate spontaneous periodic IISs (≈3 Hz) for high degrees of recurrent Py connectivity (Psprout > 70). We investigate the conditions necessary for this phenomenon and find that spontaneous IISs closely depend on the degree of the network's intrinsic excitability. PMID:24478636

Genesis of interictal spikes in the CA1: a computational investigation.

PubMed

Ratnadurai-Giridharan, Shivakeshavan; Stefanescu, Roxana A; Khargonekar, Pramod P; Carney, Paul R; Talathi, Sachin S

2014-01-01

Interictal spikes (IISs) are spontaneous high amplitude, short time duration <400 ms events often observed in electroencephalographs (EEG) of epileptic patients. In vitro analysis of resected mesial temporal lobe tissue from patients with refractory temporal lobe epilepsy has revealed the presence of IIS in the CA1 subfield. In this paper, we develop a biophysically relevant network model of the CA1 subfield and investigate how changes in the network properties influence the susceptibility of CA1 to exhibit an IIS. We present a novel template based approach to identify conditions under which synchronization of paroxysmal depolarization shift (PDS) events evoked in CA1 pyramidal (Py) cells can trigger an IIS. The results from this analysis are used to identify the synaptic parameters of a minimal network model that is capable of generating PDS in response to afferent synaptic input. The minimal network model parameters are then incorporated into a detailed network model of the CA1 subfield in order to address the following questions: (1) How does the formation of an IIS in the CA1 depend on the degree of sprouting (recurrent connections) between the CA1 Py cells and the fraction of CA3 Shaffer collateral (SC) connections onto the CA1 Py cells? and (2) Is synchronous afferent input from the SC essential for the CA1 to exhibit IIS? Our results suggest that the CA1 subfield with low recurrent connectivity (absence of sprouting), mimicking the topology of a normal brain, has a very low probability of producing an IIS except when a large fraction of CA1 neurons (>80%) receives a barrage of quasi-synchronous afferent input (input occurring within a temporal window of ≤24 ms) via the SC. However, as we increase the recurrent connectivity of the CA1 (P sprout > 40); mimicking sprouting in a pathological CA1 network, the CA1 can exhibit IIS even in the absence of a barrage of quasi-synchronous afferents from the SC (input occurring within temporal window >80 ms) and a low fraction of CA1 Py cells (≈30%) receiving SC input. Furthermore, we find that in the presence of Poisson distributed random input via SC, the CA1 network is able to generate spontaneous periodic IISs (≈3 Hz) for high degrees of recurrent Py connectivity (P sprout > 70). We investigate the conditions necessary for this phenomenon and find that spontaneous IISs closely depend on the degree of the network's intrinsic excitability.

Sediment connectivity evolution on an alpine catchment undergoing glacier retreat

NASA Astrophysics Data System (ADS)

Goldin, Beatrice; Rudaz, Benjamin; Bardou, Eric

2014-05-01

Climate changes can result in a wide range of variations of natural environment including retreating glaciers. Melting from glaciers will have a significant impact on the sediment transport characteristics of glacierized alpine catchments that can affect downstream channel network. Sediment connectivity assessment, i.e. the degree of connections that controls sediment fluxes between different segments of a landscape, can be useful in order to address management activity on sediment fluxes changes of alpine streams. Through the spatial characterization of the connectivity patterns of a catchment and its potential evolution it is possible to both define sediment transport pathways and estimate different contributions of the sub-catchment as sediment sources. In this study, a topography based index (Cavalli et al., 2013) has been applied to assess spatial sediment connectivity in the Navisence catchment (35 km2), an alpine basin located in the southern Walliser Alps (Switzerland) characterized by a complex glacier system with well-developed lateral moraines on glacier margins already crossed by several lateral channels. Glacier retreat of the main glacial edifice will provide a new connectivity pattern. At present the glacier disconnects lateral slopes from the main talweg: it is expected that its retreat will experience an increased connectivity. In order to study this evolution, two high resolution (2 m) digital terrain models (DTMs) describing respectively the terrain before and after glacier retreat have been analyzed. The current DTM was obtained from high resolution photogrammetry (2 m resolution). The future DTM was derived from application of the sloping local base level (SLBL) routine (Jaboyedoff et al., 2004) on the current glacier system, allowing to remove the ice body by reconstituting a U-shaped polynomial bedrock surface. From this new surface a coherent river network was drawn and slight random noise was added. Finally the river network was burned into the rough surface of the SLBL results. The impact of sediment dynamic changes on the study catchment due to glacier retreat has been assessed by comparing predictions deriving from model application on different scenarios. Simulations allowed the analysis of sediment connectivity evolution over decade scales suggesting an increase of potential sediment transfer and connections in areas close to the main channel network. References: Cavalli, M., Trevisani, S., Comiti, F., Marchi, L., 2013. Geomorphometric assessment of spatial sediment connectivity in small Alpine catchments. Geomorphology 188, 31-41. Jaboyedoff M., Bardou E., Derron M.-H. 2004. Sloping local base level: a tool to estimate potential erodible volume and infilling alluvial sediment of glacial valleys. Swiss Geo-Scientists meeting, November 2004, Lausanne.

Decreased functional connectivity to posterior cingulate cortex in major depressive disorder.

PubMed

Yang, Rui; Gao, Chengge; Wu, Xiaoping; Yang, Junle; Li, Shengbin; Cheng, Hu

2016-09-30

The default mode network (DMN) and its interaction with other key networks such as the salience network and executive network are keys to understand psychiatric and neurological disorders including major depressive disorder (MDD). In this study, we combined independent component analysis and seed based connectivity analysis to study the posterior default mode network between 20 patients with MDD and 25 normal controls, as well as pre-treatment and post-treatment conditions of the patients. Both correlated and anti-correlated networks centered at the posterior cingulate cortex (PCC) were examined (PCC+ and PCC-). Our results showed aberrant functional connectivity of the PCC+ and PCC- networks between patients and normal controls. Specifically, normal controls exhibited significantly higher connectivity between the PCC and frontal/temporal regions for the PCC+ network and stronger connectivity strength between the PCC and the insula/middle frontal cortex for the PCC- network. The overall connectivity strength of the PCC+ and PCC- networks was also significantly lower in MDD. Because the PCC is a hub in the DMN that interacts with other networks, our result suggested a stronger interaction between the DMN and the salience network but a weak interaction between the DMN and the executive network in MDD. The treatment using sertraline did increase the functional connectivity strength, especially in the PCC+ network. Despite a large inter-subject variability in the overall connectivity strengths and change of the PCC network in response to the treatment, a high correlation between change of connectivity strength and the Hamilton depression score was observed for both the PCC+ and PCC- network. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.