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

Science.gov (United States)

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

2010-07-01

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

Detecting the overlapping and hierarchical community structure in complex networks

International Nuclear Information System (INIS)

Lancichinetti, Andrea; Fortunato, Santo; Kertesz, Janos

2009-01-01

Many networks in nature, society and technology are characterized by a mesoscopic level of organization, with groups of nodes forming tightly connected units, called communities or modules, that are only weakly linked to each other. Uncovering this community structure is one of the most important problems in the field of complex networks. Networks often show a hierarchical organization, with communities embedded within other communities; moreover, nodes can be shared between different communities. Here, we present the first algorithm that finds both overlapping communities and the hierarchical structure. The method is based on the local optimization of a fitness function. Community structure is revealed by peaks in the fitness histogram. The resolution can be tuned by a parameter enabling different hierarchical levels of organization to be investigated. Tests on real and artificial networks give excellent results.

Immunization of networks with community structure

International Nuclear Information System (INIS)

Masuda, Naoki

2009-01-01

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

Characterization and detection of thermoacoustic combustion oscillations based on statistical complexity and complex-network theory

Science.gov (United States)

Murayama, Shogo; Kinugawa, Hikaru; Tokuda, Isao T.; Gotoda, Hiroshi

2018-02-01

We present an experimental study on the characterization of dynamic behavior of flow velocity field during thermoacoustic combustion oscillations in a turbulent confined combustor from the viewpoints of statistical complexity and complex-network theory, involving detection of a precursor of thermoacoustic combustion oscillations. The multiscale complexity-entropy causality plane clearly shows the possible presence of two dynamics, noisy periodic oscillations and noisy chaos, in the shear layer regions (1) between the outer recirculation region in the dump plate and a recirculation flow in the wake of the centerbody and (2) between the outer recirculation region in the dump plate and a vortex breakdown bubble away from the centerbody. The vertex strength in the turbulence network and the community structure of the vorticity field can identify the vortical interactions during thermoacoustic combustion oscillations. Sequential horizontal visibility graph motifs are useful for capturing a precursor of themoacoustic combustion oscillations.

Epidemic spreading in weighted scale-free networks with community structure

International Nuclear Information System (INIS)

Chu, Xiangwei; Guan, Jihong; Zhang, Zhongzhi; Zhou, Shuigeng

2009-01-01

Many empirical studies reveal that the weights and community structure are ubiquitous in various natural and artificial networks. In this paper, based on the SI disease model, we investigate the epidemic spreading in weighted scale-free networks with community structure. Two exponents, α and β, are introduced to weight the internal edges and external edges, respectively; and a tunable probability parameter q is also introduced to adjust the strength of community structure. We find the external weighting exponent β plays a much more important role in slackening the epidemic spreading and reducing the danger brought by the epidemic than the internal weighting exponent α. Moreover, a novel result we find is that the strong community structure is no longer helpful for slackening the danger brought by the epidemic in the weighted cases. In addition, we show the hierarchical dynamics of the epidemic spreading in the weighted scale-free networks with communities which is also displayed in the famous BA scale-free networks

How optimal synchronization of oscillators depends on the network structure and the individual dynamical properties of the oscillators

International Nuclear Information System (INIS)

Markovic, R; Gosak, M; Marhl, M

2013-01-01

The problem of making a network of dynamical systems synchronize onto a common evolution is the subject of much ongoing research in several scientific disciplines. It is nowadays a well-known fact that the synchronization processes are gradually influenced by the interaction topology between the dynamically interacting units. A complex coupling configuration can significantly affect the synchronization abilities of a networked system. However, the question arises what is the optimal network topology that provides enhancement of the synchronization features under given circumstances. In order to address this issue we make use of a network model in which we can smoothly tune the topology from a highly heterogeneous and efficient scale-free network to a homogeneous and less efficient network. The network is then populated with Poincaré oscillators, a paradigmatic model for limit-cycle oscillations. This oscillator model exhibits a parameter that enables changes of the limit cycle attraction and is thus immediately related to flexibility/rigidity properties of the oscillator. Our results reveal that for weak attractions of the limit cycle, intermediate homogeneous topology ensures maximal synchronization, whereas highly heterogeneous scale-free topology ensures maximal synchronization for strong attractions of the limit cycle. We argue that the flexibility/rigidity of individual nodes of the networks defines the topology, where maximal global coherence is achieved.

Spatially structured oscillations in a two-dimensional excitatory neuronal network with synaptic depression

KAUST Repository

Kilpatrick, Zachary P.

2009-10-29

We study the spatiotemporal dynamics of a two-dimensional excitatory neuronal network with synaptic depression. Coupling between populations of neurons is taken to be nonlocal, while depression is taken to be local and presynaptic. We show that the network supports a wide range of spatially structured oscillations, which are suggestive of phenomena seen in cortical slice experiments and in vivo. The particular form of the oscillations depends on initial conditions and the level of background noise. Given an initial, spatially localized stimulus, activity evolves to a spatially localized oscillating core that periodically emits target waves. Low levels of noise can spontaneously generate several pockets of oscillatory activity that interact via their target patterns. Periodic activity in space can also organize into spiral waves, provided that there is some source of rotational symmetry breaking due to external stimuli or noise. In the high gain limit, no oscillatory behavior exists, but a transient stimulus can lead to a single, outward propagating target wave. © Springer Science + Business Media, LLC 2009.

Spatially structured oscillations in a two-dimensional excitatory neuronal network with synaptic depression

KAUST Repository

Kilpatrick, Zachary P.; Bressloff, Paul C.

2009-01-01

We study the spatiotemporal dynamics of a two-dimensional excitatory neuronal network with synaptic depression. Coupling between populations of neurons is taken to be nonlocal, while depression is taken to be local and presynaptic. We show that the network supports a wide range of spatially structured oscillations, which are suggestive of phenomena seen in cortical slice experiments and in vivo. The particular form of the oscillations depends on initial conditions and the level of background noise. Given an initial, spatially localized stimulus, activity evolves to a spatially localized oscillating core that periodically emits target waves. Low levels of noise can spontaneously generate several pockets of oscillatory activity that interact via their target patterns. Periodic activity in space can also organize into spiral waves, provided that there is some source of rotational symmetry breaking due to external stimuli or noise. In the high gain limit, no oscillatory behavior exists, but a transient stimulus can lead to a single, outward propagating target wave. © Springer Science + Business Media, LLC 2009.

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

Science.gov (United States)

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

2015-02-01

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

Synchronization in complex networks with a modular structure.

Science.gov (United States)

Park, Kwangho; Lai, Ying-Cheng; Gupte, Saurabh; Kim, Jong-Won

2006-03-01

Networks with a community (or modular) structure arise in social and biological sciences. In such a network individuals tend to form local communities, each having dense internal connections. The linkage among the communities is, however, much more sparse. The dynamics on modular networks, for instance synchronization, may be of great social or biological interest. (Here by synchronization we mean some synchronous behavior among the nodes in the network, not, for example, partially synchronous behavior in the network or the synchronizability of the network with some external dynamics.) By using a recent theoretical framework, the master-stability approach originally introduced by Pecora and Carroll in the context of synchronization in coupled nonlinear oscillators, we address synchronization in complex modular networks. We use a prototype model and develop scaling relations for the network synchronizability with respect to variations of some key network structural parameters. Our results indicate that random, long-range links among distant modules is the key to synchronization. As an application we suggest a viable strategy to achieve synchronous behavior in social networks.

Sampling from complex networks with high community structures.

Science.gov (United States)

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

2012-06-01

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

Perturbation analysis of complete synchronization in networks of phase oscillators.

Science.gov (United States)

Tönjes, Ralf; Blasius, Bernd

2009-08-01

The behavior of weakly coupled self-sustained oscillators can often be well described by phase equations. Here we use the paradigm of Kuramoto phase oscillators which are coupled in a network to calculate first- and second-order corrections to the frequency of the fully synchronized state for nonidentical oscillators. The topology of the underlying coupling network is reflected in the eigenvalues and eigenvectors of the network Laplacian which influence the synchronization frequency in a particular way. They characterize the importance of nodes in a network and the relations between them. Expected values for the synchronization frequency are obtained for oscillators with quenched random frequencies on a class of scale-free random networks and for a Erdös-Rényi random network. We briefly discuss an application of the perturbation theory in the second order to network structural analysis.

Community detection for networks with unipartite and bipartite structure

Science.gov (United States)

Chang, Chang; Tang, Chao

2014-09-01

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

Exponential random graph models for networks with community structure.

Science.gov (United States)

Fronczak, Piotr; Fronczak, Agata; Bujok, Maksymilian

2013-09-01

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

Comparison and validation of community structures in complex networks

Science.gov (United States)

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

2006-07-01

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

Community Structure in Online Collegiate Social Networks

Science.gov (United States)

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

2009-03-01

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

Broad-scale small-world network topology induces optimal synchronization of flexible oscillators

International Nuclear Information System (INIS)

Markovič, Rene; Gosak, Marko; Marhl, Marko

2014-01-01

The discovery of small-world and scale-free properties of many man-made and natural complex networks has attracted increasing attention. Of particular interest is how the structural properties of a network facilitate and constrain its dynamical behavior. In this paper we study the synchronization of weakly coupled limit-cycle oscillators in dependence on the network topology as well as the dynamical features of individual oscillators. We show that flexible oscillators, characterized by near zero values of divergence, express maximal correlation in broad-scale small-world networks, whereas the non-flexible (rigid) oscillators are best correlated in more heterogeneous scale-free networks. We found that the synchronization behavior is governed by the interplay between the networks global efficiency and the mutual frequency adaptation. The latter differs for flexible and rigid oscillators. The results are discussed in terms of evolutionary advantages of broad-scale small-world networks in biological systems

Synchronization of Phase Oscillators in Networks with Certain Frequency Sequence

International Nuclear Information System (INIS)

Feng Yuan-Yuan; Wu Liang; Zhu Shi-Qun

2014-01-01

Synchronization of Kuramoto phase oscillators arranged in real complex neural networks is investigated. It is shown that the synchronization greatly depends on the sets of natural frequencies of the involved oscillators. The influence of network connectivity heterogeneity on synchronization depends particularly on the correlation between natural frequencies and node degrees. This finding implies a potential application that inhibiting the effects caused by the changes of network structure can be balanced out nicely by choosing the correlation parameter appropriately. (general)

Control of coupled oscillator networks with application to microgrid technologies

Science.gov (United States)

Arenas, Alex

The control of complex systems and network-coupled dynamical systems is a topic of vital theoretical importance in mathematics and physics with a wide range of applications in engineering and various other sciences. Motivated by recent research into smart grid technologies, we study the control of synchronization and consider the important case of networks of coupled phase oscillators with nonlinear interactions-a paradigmatic example that has guided our understanding of self-organization for decades. We develop a method for control based on identifying and stabilizing problematic oscillators, resulting in a stable spectrum of eigenvalues, and in turn a linearly stable syn- chronized state. The amount of control, that is, number of oscillators, required to stabilize the network is primarily dictated by the coupling strength, dynamical heterogeneity, and mean degree of the network, and depends little on the structural heterogeneity of the network itself.

Control of coupled oscillator networks with application to microgrid technologies.

Science.gov (United States)

Skardal, Per Sebastian; Arenas, Alex

2015-08-01

The control of complex systems and network-coupled dynamical systems is a topic of vital theoretical importance in mathematics and physics with a wide range of applications in engineering and various other sciences. Motivated by recent research into smart grid technologies, we study the control of synchronization and consider the important case of networks of coupled phase oscillators with nonlinear interactions-a paradigmatic example that has guided our understanding of self-organization for decades. We develop a method for control based on identifying and stabilizing problematic oscillators, resulting in a stable spectrum of eigenvalues, and in turn a linearly stable synchronized state. The amount of control, that is, number of oscillators, required to stabilize the network is primarily dictated by the coupling strength, dynamical heterogeneity, and mean degree of the network, and depends little on the structural heterogeneity of the network itself.

Clusters in nonsmooth oscillator networks

Science.gov (United States)

Nicks, Rachel; Chambon, Lucie; Coombes, Stephen

2018-03-01

For coupled oscillator networks with Laplacian coupling, the master stability function (MSF) has proven a particularly powerful tool for assessing the stability of the synchronous state. Using tools from group theory, this approach has recently been extended to treat more general cluster states. However, the MSF and its generalizations require the determination of a set of Floquet multipliers from variational equations obtained by linearization around a periodic orbit. Since closed form solutions for periodic orbits are invariably hard to come by, the framework is often explored using numerical techniques. Here, we show that further insight into network dynamics can be obtained by focusing on piecewise linear (PWL) oscillator models. Not only do these allow for the explicit construction of periodic orbits, their variational analysis can also be explicitly performed. The price for adopting such nonsmooth systems is that many of the notions from smooth dynamical systems, and in particular linear stability, need to be modified to take into account possible jumps in the components of Jacobians. This is naturally accommodated with the use of saltation matrices. By augmenting the variational approach for studying smooth dynamical systems with such matrices we show that, for a wide variety of networks that have been used as models of biological systems, cluster states can be explicitly investigated. By way of illustration, we analyze an integrate-and-fire network model with event-driven synaptic coupling as well as a diffusively coupled network built from planar PWL nodes, including a reduction of the popular Morris-Lecar neuron model. We use these examples to emphasize that the stability of network cluster states can depend as much on the choice of single node dynamics as it does on the form of network structural connectivity. Importantly, the procedure that we present here, for understanding cluster synchronization in networks, is valid for a wide variety of systems in

Global and local targeted immunization in networks with community structure

International Nuclear Information System (INIS)

Yan, Shu; Tang, Shaoting; Pei, Sen; Zheng, Zhiming; Fang, Wenyi

2015-01-01

Immunization plays an important role in the field of epidemic spreading in complex networks. In previous studies, targeted immunization has been proved to be an effective strategy. However, when extended to networks with community structure, it is unknown whether the superior strategy is to vaccinate the nodes who have the most connections in the entire network (global strategy), or those in the original community where epidemic starts to spread (local strategy). In this work, by using both analytic approaches and simulations, we observe that the answer depends on the closeness between communities. If communities are tied closely, the global strategy is superior to the local strategy. Otherwise, the local targeted immunization is advantageous. The existence of a transitional value of closeness implies that we should adopt different strategies. Furthermore, we extend our investigation from two-community networks to multi-community networks. We consider the mode of community connection and the location of community where epidemic starts to spread. Both simulation results and theoretical predictions show that local strategy is a better option for immunization in most cases. But if the epidemic begins from a core community, global strategy is superior in some cases. (paper)

Spectral methods for the detection of network community structure: a comparative analysis

International Nuclear Information System (INIS)

Shen, Hua-Wei; Cheng, Xue-Qi

2010-01-01

Spectral analysis has been successfully applied to the detection of community structure of networks, respectively being based on the adjacency matrix, the standard Laplacian matrix, the normalized Laplacian matrix, the modularity matrix, the correlation matrix and several other variants of these matrices. However, the comparison between these spectral methods is less reported. More importantly, it is still unclear which matrix is more appropriate for the detection of community structure. This paper answers the question by evaluating the effectiveness of these five matrices against benchmark networks with heterogeneous distributions of node degree and community size. Test results demonstrate that the normalized Laplacian matrix and the correlation matrix significantly outperform the other three matrices at identifying the community structure of networks. This indicates that it is crucial to take into account the heterogeneous distribution of node degree when using spectral analysis for the detection of community structure. In addition, to our surprise, the modularity matrix exhibits very similar performance to the adjacency matrix, which indicates that the modularity matrix does not gain benefits from using the configuration model as a reference network with the consideration of the node degree heterogeneity

Friendship Concept and Community Network Structure among Elementary School and University Students.

Science.gov (United States)

Hernández-Hernández, Ana María; Viga-de Alva, Dolores; Huerta-Quintanilla, Rodrigo; Canto-Lugo, Efrain; Laviada-Molina, Hugo; Molina-Segui, Fernanda

2016-01-01

We use complex network theory to study the differences between the friendship concepts in elementary school and university students. Four friendship networks were identified from surveys. Three of these networks are from elementary schools; two are located in the rural area of Yucatán and the other is in the urban area of Mérida, Yucatán. We analyzed the structure and the communities of these friendship networks and found significant differences among those at the elementary schools compared with those at the university. In elementary schools, the students make friends mainly in the same classroom, but there are also links among different classrooms because of the presence of siblings and relatives in the schools. These kinds of links (sibling-friend or relative-friend) are called, in this work, "mixed links". The classification of the communities is based on their similarity with the classroom composition. If the community is composed principally of students in different classrooms, the community is classified as heterogeneous. These kinds of communities appear in the elementary school friendship networks mainly because of the presence of relatives and siblings. Once the links between siblings and relatives are removed, the communities resembled the classroom composition. On the other hand, the university students are more selective in choosing friends and therefore, even when they have friends in the same classroom, those communities are quite different to the classroom composition. Also, in the university network, we found heterogeneous communities even when the presence of sibling and relatives is negligible. These differences made up a topological structure quite different at different academic levels. We also found differences in the network characteristics. Once these differences are understood, the topological structure of the friendship network and the communities shaped in an elementary school could be predicted if we know the total number of students

Intermittent and sustained periodic windows in networked chaotic Rössler oscillators

International Nuclear Information System (INIS)

He, Zhiwei; Sun, Yong; Zhan, Meng

2013-01-01

Route to chaos (or periodicity) in dynamical systems is one of fundamental problems. Here, dynamical behaviors of coupled chaotic Rössler oscillators on complex networks are investigated and two different types of periodic windows with the variation of coupling strength are found. Under a moderate coupling, the periodic window is intermittent, and the attractors within the window extremely sensitively depend on the initial conditions, coupling parameter, and topology of the network. Therefore, after adding or removing one edge of network, the periodic attractor can be destroyed and substituted by a chaotic one, or vice versa. In contrast, under an extremely weak coupling, another type of periodic window appears, which insensitively depends on the initial conditions, coupling parameter, and network. It is sustained and unchanged for different types of network structure. It is also found that the phase differences of the oscillators are almost discrete and randomly distributed except that directly linked oscillators more likely have different phases. These dynamical behaviors have also been generally observed in other networked chaotic oscillators

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

Directory of Open Access Journals (Sweden)

Rutger Goekoop

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

Convergent evolution of modularity in metabolic networks through different community structures

Directory of Open Access Journals (Sweden)

Zhou Wanding

2012-09-01

Full Text Available Abstract Background It has been reported that the modularity of metabolic networks of bacteria is closely related to the variability of their living habitats. However, given the dependency of the modularity score on the community structure, it remains unknown whether organisms achieve certain modularity via similar or different community structures. Results In this work, we studied the relationship between similarities in modularity scores and similarities in community structures of the metabolic networks of 1021 species. Both similarities are then compared against the genetic distances. We revisited the association between modularity and variability of the microbial living environments and extended the analysis to other aspects of their life style such as temperature and oxygen requirements. We also tested both topological and biological intuition of the community structures identified and investigated the extent of their conservation with respect to the taxomony. Conclusions We find that similar modularities are realized by different community structures. We find that such convergent evolution of modularity is closely associated with the number of (distinct enzymes in the organism’s metabolome, a consequence of different life styles of the species. We find that the order of modularity is the same as the order of the number of the enzymes under the classification based on the temperature preference but not on the oxygen requirement. Besides, inspection of modularity-based communities reveals that these communities are graph-theoretically meaningful yet not reflective of specific biological functions. From an evolutionary perspective, we find that the community structures are conserved only at the level of kingdoms. Our results call for more investigation into the interplay between evolution and modularity: how evolution shapes modularity, and how modularity affects evolution (mainly in terms of fitness and evolvability. Further, our results

Convergent evolution of modularity in metabolic networks through different community structures.

Science.gov (United States)

Zhou, Wanding; Nakhleh, Luay

2012-09-14

It has been reported that the modularity of metabolic networks of bacteria is closely related to the variability of their living habitats. However, given the dependency of the modularity score on the community structure, it remains unknown whether organisms achieve certain modularity via similar or different community structures. In this work, we studied the relationship between similarities in modularity scores and similarities in community structures of the metabolic networks of 1021 species. Both similarities are then compared against the genetic distances. We revisited the association between modularity and variability of the microbial living environments and extended the analysis to other aspects of their life style such as temperature and oxygen requirements. We also tested both topological and biological intuition of the community structures identified and investigated the extent of their conservation with respect to the taxonomy. We find that similar modularities are realized by different community structures. We find that such convergent evolution of modularity is closely associated with the number of (distinct) enzymes in the organism's metabolome, a consequence of different life styles of the species. We find that the order of modularity is the same as the order of the number of the enzymes under the classification based on the temperature preference but not on the oxygen requirement. Besides, inspection of modularity-based communities reveals that these communities are graph-theoretically meaningful yet not reflective of specific biological functions. From an evolutionary perspective, we find that the community structures are conserved only at the level of kingdoms. Our results call for more investigation into the interplay between evolution and modularity: how evolution shapes modularity, and how modularity affects evolution (mainly in terms of fitness and evolvability). Further, our results call for exploring new measures of modularity and network

Eigenspaces of networks reveal the overlapping and hierarchical community structure more precisely

International Nuclear Information System (INIS)

Ma, Xiaoke; Gao, Lin; Yong, Xuerong

2010-01-01

Identifying community structure is fundamental for revealing the structure–functionality relationship in complex networks, and spectral algorithms have been shown to be powerful for this purpose. In a traditional spectral algorithm, each vertex of a network is embedded into a spectral space by making use of the eigenvectors of the adjacency matrix or Laplacian matrix of the graph. In this paper, a novel spectral approach for revealing the overlapping and hierarchical community structure of complex networks is proposed by not only using the eigenvalues and eigenvectors but also the properties of eigenspaces of the networks involved. This gives us a better characterization of community. We first show that the communicability between a pair of vertices can be rewritten in term of eigenspaces of a network. An agglomerative clustering algorithm is then presented to discover the hierarchical communities using the communicability matrix. Finally, these overlapping vertices are discovered with the corresponding eigenspaces, based on the fact that the vertices more densely connected amongst one another are more likely to be linked through short cycles. Compared with the traditional spectral algorithms, our algorithm can identify both the overlapping and hierarchical community without increasing the time complexity O(n 3 ), where n is the size of the network. Furthermore, our algorithm can also distinguish the overlapping vertices from bridges. The method is tested by applying it to some computer-generated and real-world networks. The experimental results indicate that our algorithm can reveal community structure more precisely than the traditional spectral approaches

Virality Prediction and Community Structure in Social Networks

Science.gov (United States)

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

2013-08-01

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

Discrete particle swarm optimization for identifying community structures in signed social networks.

Science.gov (United States)

Cai, Qing; Gong, Maoguo; Shen, Bo; Ma, Lijia; Jiao, Licheng

2014-10-01

Modern science of networks has facilitated us with enormous convenience to the understanding of complex systems. Community structure is believed to be one of the notable features of complex networks representing real complicated systems. Very often, uncovering community structures in networks can be regarded as an optimization problem, thus, many evolutionary algorithms based approaches have been put forward. Particle swarm optimization (PSO) is an artificial intelligent algorithm originated from social behavior such as birds flocking and fish schooling. PSO has been proved to be an effective optimization technique. However, PSO was originally designed for continuous optimization which confounds its applications to discrete contexts. In this paper, a novel discrete PSO algorithm is suggested for identifying community structures in signed networks. In the suggested method, particles' status has been redesigned in discrete form so as to make PSO proper for discrete scenarios, and particles' updating rules have been reformulated by making use of the topology of the signed network. Extensive experiments compared with three state-of-the-art approaches on both synthetic and real-world signed networks demonstrate that the proposed method is effective and promising. Copyright © 2014 Elsevier Ltd. All rights reserved.

Transition from amplitude to oscillation death in a network of oscillators

International Nuclear Information System (INIS)

Nandan, Mauparna; Hens, C. R.; Dana, Syamal K.; Pal, Pinaki

2014-01-01

We report a transition from a homogeneous steady state (HSS) to inhomogeneous steady states (IHSSs) in a network of globally coupled identical oscillators. We perturb a synchronized population of oscillators in the network with a few local negative or repulsive mean field links. The whole population splits into two clusters for a certain number of repulsive mean field links and a range of coupling strength. For further increase of the strength of interaction, these clusters collapse into a HSS followed by a transition to IHSSs where all the oscillators populate either of the two stable steady states. We analytically determine the origin of HSS and its transition to IHSS in relation to the number of repulsive mean-field links and the strength of interaction using a reductionism approach to the model network. We verify the results with numerical examples of the paradigmatic Landau-Stuart limit cycle system and the chaotic Rössler oscillator as dynamical nodes. During the transition from HSS to IHSSs, the network follows the Turing type symmetry breaking pitchfork or transcritical bifurcation depending upon the system dynamics

Transition from amplitude to oscillation death in a network of oscillators

Energy Technology Data Exchange (ETDEWEB)

Nandan, Mauparna [Dr. B. C. Roy Engineering College, Durgapur 713206 (India); Department of Mathematics, National Institute of Technology, Durgapur 713209 (India); Hens, C. R.; Dana, Syamal K. [CSIR-Indian Institute of Chemical Biology, Jadavpur, Kolkata 700032 (India); Pal, Pinaki [Department of Mathematics, National Institute of Technology, Durgapur 713209 (India)

2014-12-01

We report a transition from a homogeneous steady state (HSS) to inhomogeneous steady states (IHSSs) in a network of globally coupled identical oscillators. We perturb a synchronized population of oscillators in the network with a few local negative or repulsive mean field links. The whole population splits into two clusters for a certain number of repulsive mean field links and a range of coupling strength. For further increase of the strength of interaction, these clusters collapse into a HSS followed by a transition to IHSSs where all the oscillators populate either of the two stable steady states. We analytically determine the origin of HSS and its transition to IHSS in relation to the number of repulsive mean-field links and the strength of interaction using a reductionism approach to the model network. We verify the results with numerical examples of the paradigmatic Landau-Stuart limit cycle system and the chaotic Rössler oscillator as dynamical nodes. During the transition from HSS to IHSSs, the network follows the Turing type symmetry breaking pitchfork or transcritical bifurcation depending upon the system dynamics.

Identifying the community structure of the food-trade international multi-network

Science.gov (United States)

Torreggiani, S.; Mangioni, G.; Puma, M. J.; Fagiolo, G.

2018-05-01

Achieving international food security requires improved understanding of how international trade networks connect countries around the world through the import-export flows of food commodities. The properties of international food trade networks are still poorly documented, especially from a multi-network perspective. In particular, nothing is known about the multi-network’s community structure. Here we find that the individual crop-specific layers of the multi-network have densely connected trading groups, a consistent characteristic over the period 2001–2011. Further, the multi-network is characterized by low variability over this period but with substantial heterogeneity across layers in each year. In particular, the layers are mostly assortative: more-intensively connected countries tend to import from and export to countries that are themselves more connected. We also fit econometric models to identify social, economic and geographic factors explaining the probability that any two countries are co-present in the same community. Our estimates indicate that the probability of country pairs belonging to the same food trade community depends more on geopolitical and economic factors—such as geographical proximity and trade-agreement co-membership—than on country economic size and/or income. These community-structure findings of the multi-network are especially valuable for efforts to understand past and emerging dynamics in the global food system, especially those that examine potential ‘shocks’ to global food trade.

Leveraging disjoint communities for detecting overlapping community structure

International Nuclear Information System (INIS)

Chakraborty, Tanmoy

2015-01-01

Network communities represent mesoscopic structure for understanding the organization of real-world networks, where nodes often belong to multiple communities and form overlapping community structure in the network. Due to non-triviality in finding the exact boundary of such overlapping communities, this problem has become challenging, and therefore huge effort has been devoted to detect overlapping communities from the network.In this paper, we present PVOC (Permanence based Vertex-replication algorithm for Overlapping Community detection), a two-stage framework to detect overlapping community structure. We build on a novel observation that non-overlapping community structure detected by a standard disjoint community detection algorithm from a network has high resemblance with its actual overlapping community structure, except the overlapping part. Based on this observation, we posit that there is perhaps no need of building yet another overlapping community finding algorithm; but one can efficiently manipulate the output of any existing disjoint community finding algorithm to obtain the required overlapping structure. We propose a new post-processing technique that by combining with any existing disjoint community detection algorithm, can suitably process each vertex using a new vertex-based metric, called permanence, and thereby finds out overlapping candidates with their community memberships. Experimental results on both synthetic and large real-world networks show that PVOC significantly outperforms six state-of-the-art overlapping community detection algorithms in terms of high similarity of the output with the ground-truth structure. Thus our framework not only finds meaningful overlapping communities from the network, but also allows us to put an end to the constant effort of building yet another overlapping community detection algorithm. (paper)

Chaos in generically coupled phase oscillator networks with nonpairwise interactions.

Science.gov (United States)

Bick, Christian; Ashwin, Peter; Rodrigues, Ana

2016-09-01

The Kuramoto-Sakaguchi system of coupled phase oscillators, where interaction between oscillators is determined by a single harmonic of phase differences of pairs of oscillators, has very simple emergent dynamics in the case of identical oscillators that are globally coupled: there is a variational structure that means the only attractors are full synchrony (in-phase) or splay phase (rotating wave/full asynchrony) oscillations and the bifurcation between these states is highly degenerate. Here we show that nonpairwise coupling-including three and four-way interactions of the oscillator phases-that appears generically at the next order in normal-form based calculations can give rise to complex emergent dynamics in symmetric phase oscillator networks. In particular, we show that chaos can appear in the smallest possible dimension of four coupled phase oscillators for a range of parameter values.

Chaos in generically coupled phase oscillator networks with nonpairwise interactions

Energy Technology Data Exchange (ETDEWEB)

Bick, Christian; Ashwin, Peter; Rodrigues, Ana [Centre for Systems, Dynamics and Control and Department of Mathematics, University of Exeter, Exeter EX4 4QF (United Kingdom)

2016-09-15

The Kuramoto–Sakaguchi system of coupled phase oscillators, where interaction between oscillators is determined by a single harmonic of phase differences of pairs of oscillators, has very simple emergent dynamics in the case of identical oscillators that are globally coupled: there is a variational structure that means the only attractors are full synchrony (in-phase) or splay phase (rotating wave/full asynchrony) oscillations and the bifurcation between these states is highly degenerate. Here we show that nonpairwise coupling—including three and four-way interactions of the oscillator phases—that appears generically at the next order in normal-form based calculations can give rise to complex emergent dynamics in symmetric phase oscillator networks. In particular, we show that chaos can appear in the smallest possible dimension of four coupled phase oscillators for a range of parameter values.

Synchrony-optimized networks of non-identical Kuramoto oscillators

International Nuclear Information System (INIS)

Brede, Markus

2008-01-01

In this Letter we discuss a method for generating synchrony-optimized coupling architectures of Kuramoto oscillators with a heterogeneous distribution of native frequencies. The method allows us to relate the properties of the coupling network to its synchronizability. These relations were previously only established from a linear stability analysis of the identical oscillator case. We further demonstrate that the heterogeneity in the oscillator population produces heterogeneity in the optimal coupling network as well. Two rules for enhancing the synchronizability of a given network by a suitable placement of oscillators are given: (i) native frequencies of adjacent oscillators must be anti-correlated and (ii) frequency magnitudes should positively correlate with the degree of the node they are placed at

Creation and perturbation of planar networks of chemical oscillators

Science.gov (United States)

Tompkins, Nathan; Cambria, Matthew Carl; Wang, Adam L.; Heymann, Michael; Fraden, Seth

2015-01-01

Methods for creating custom planar networks of diffusively coupled chemical oscillators and perturbing individual oscillators within the network are presented. The oscillators consist of the Belousov-Zhabotinsky (BZ) reaction contained in an emulsion. Networks of drops of the BZ reaction are created with either Dirichlet (constant-concentration) or Neumann (no-flux) boundary conditions in a custom planar configuration using programmable illumination for the perturbations. The differences between the observed network dynamics for each boundary condition are described. Using light, we demonstrate the ability to control the initial conditions of the network and to cause individual oscillators within the network to undergo sustained period elongation or a one-time phase delay. PMID:26117136

Synchronization in Complex Oscillator Networks and Smart Grids

Energy Technology Data Exchange (ETDEWEB)

Dorfler, Florian [Los Alamos National Laboratory; Chertkov, Michael [Los Alamos National Laboratory; Bullo, Francesco [Center for Control, Dynamical Systems and Computation, University of California at Santa Babara, Santa Barbara CA

2012-07-24

The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing the interaction among them. It is known that a strongly coupled and sufficiently homogeneous network synchronizes, but the exact threshold from incoherence to synchrony is unknown. Here we present a novel, concise, and closed-form condition for synchronization of the fully nonlinear, non-equilibrium, and dynamic network. Our synchronization condition can be stated elegantly in terms of the network topology and parameters, or equivalently in terms of an intuitive, linear, and static auxiliary system. Our results significantly improve upon the existing conditions advocated thus far, they are provably exact for various interesting network topologies and parameters, they are statistically correct for almost all networks, and they can be applied equally to synchronization phenomena arising in physics and biology as well as in engineered oscillator networks such as electric power networks. We illustrate the validity, the accuracy, and the practical applicability of our results in complex networks scenarios and in smart grid applications.

Sustained Activity in Hierarchical Modular Neural Networks: Self-Organized Criticality and Oscillations

Science.gov (United States)

Wang, Sheng-Jun; Hilgetag, Claus C.; Zhou, Changsong

2010-01-01

Cerebral cortical brain networks possess a number of conspicuous features of structure and dynamics. First, these networks have an intricate, non-random organization. In particular, they are structured in a hierarchical modular fashion, from large-scale regions of the whole brain, via cortical areas and area subcompartments organized as structural and functional maps to cortical columns, and finally circuits made up of individual neurons. Second, the networks display self-organized sustained activity, which is persistent in the absence of external stimuli. At the systems level, such activity is characterized by complex rhythmical oscillations over a broadband background, while at the cellular level, neuronal discharges have been observed to display avalanches, indicating that cortical networks are at the state of self-organized criticality (SOC). We explored the relationship between hierarchical neural network organization and sustained dynamics using large-scale network modeling. Previously, it was shown that sparse random networks with balanced excitation and inhibition can sustain neural activity without external stimulation. We found that a hierarchical modular architecture can generate sustained activity better than random networks. Moreover, the system can simultaneously support rhythmical oscillations and SOC, which are not present in the respective random networks. The mechanism underlying the sustained activity is that each dense module cannot sustain activity on its own, but displays SOC in the presence of weak perturbations. Therefore, the hierarchical modular networks provide the coupling among subsystems with SOC. These results imply that the hierarchical modular architecture of cortical networks plays an important role in shaping the ongoing spontaneous activity of the brain, potentially allowing the system to take advantage of both the sensitivity of critical states and the predictability and timing of oscillations for efficient information

Sustained activity in hierarchical modular neural networks: self-organized criticality and oscillations

Directory of Open Access Journals (Sweden)

Sheng-Jun Wang

2011-06-01

Full Text Available Cerebral cortical brain networks possess a number of conspicuous features of structure and dynamics. First, these networks have an intricate, non-random organization. They are structured in a hierarchical modular fashion, from large-scale regions of the whole brain, via cortical areas and area subcompartments organized as structural and functional maps to cortical columns, and finally circuits made up of individual neurons. Second, the networks display self-organized sustained activity, which is persistent in the absence of external stimuli. At the systems level, such activity is characterized by complex rhythmical oscillations over a broadband background, while at the cellular level, neuronal discharges have been observed to display avalanches, indicating that cortical networks are at the state of self-organized criticality. We explored the relationship between hierarchical neural network organization and sustained dynamics using large-scale network modeling. It was shown that sparse random networks with balanced excitation and inhibition can sustain neural activity without external stimulation. We find that a hierarchical modular architecture can generate sustained activity better than random networks. Moreover, the system can simultaneously support rhythmical oscillations and self-organized criticality, which are not present in the respective random networks. The underlying mechanism is that each dense module cannot sustain activity on its own, but displays self-organized criticality in the presence of weak perturbations. The hierarchical modular networks provide the coupling among subsystems with self-organized criticality. These results imply that the hierarchical modular architecture of cortical networks plays an important role in shaping the ongoing spontaneous activity of the brain, potentially allowing the system to take advantage of both the sensitivityof critical state and predictability and timing of oscillations for efficient

Fragmentation alters stream fish community structure in dendritic ecological networks.

Science.gov (United States)

Perkin, Joshuah S; Gido, Keith B

2012-12-01

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

Exploring anti-community structure in networks with application to incompatibility of traditional Chinese medicine

Science.gov (United States)

Zhu, Jiajing; Liu, Yongguo; Zhang, Yun; Liu, Xiaofeng; Xiao, Yonghua; Wang, Shidong; Wu, Xindong

2017-11-01

Community structure is one of the most important properties in networks, in which a node shares its most connections with the others in the same community. On the contrary, the anti-community structure means the nodes in the same group have few or no connections with each other. In Traditional Chinese Medicine (TCM), the incompatibility problem of herbs is a challenge to the clinical medication safety. In this paper, we propose a new anti-community detection algorithm, Random non-nEighboring nOde expansioN (REON), to find anti-communities in networks, in which a new evaluation criterion, anti-modularity, is designed to measure the quality of the obtained anti-community structure. In order to establish anti-communities in REON, we expand the node set by non-neighboring node expansion and regard the node set with the highest anti-modularity as an anti-community. Inspired by the phenomenon that the node with higher degree has greater contribution to the anti-modularity, an improved algorithm called REONI is developed by expanding node set by the non-neighboring node with the maximum degree, which greatly enhances the efficiency of REON. Experiments on synthetic and real-world networks demonstrate the superiority of the proposed algorithms over the existing methods. In addition, by applying REONI to the herb network, we find that it can discover incompatible herb combinations.

Error and attack tolerance of synchronization in Hindmarsh–Rose neural networks with community structure

International Nuclear Information System (INIS)

Li, Chun-Hsien; Yang, Suh-Yuh

2014-01-01

Synchronization is one of the most important features observed in large-scale complex networks of interacting dynamical systems. As is well known, there is a close relation between the network topology and the network synchronizability. Using the coupled Hindmarsh–Rose neurons with community structure as a model network, in this paper we explore how failures of the nodes due to random errors or intentional attacks affect the synchronizability of community networks. The intentional attacks are realized by removing a fraction of the nodes with high values in some centrality measure such as the centralities of degree, eigenvector, betweenness and closeness. According to the master stability function method, we employ the algebraic connectivity of the considered community network as an indicator to examine the network synchronizability. Numerical evidences show that the node failure strategy based on the betweenness centrality has the most influence on the synchronizability of community networks. With this node failure strategy for a given network with a fixed number of communities, we find that the larger the degree of communities, the worse the network synchronizability; however, for a given network with a fixed degree of communities, we observe that the more the number of communities, the better the network synchronizability.

Mass media influence spreading in social networks with community structure

Science.gov (United States)

Candia, Julián; Mazzitello, Karina I.

2008-07-01

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

Detecting overlapping community structure of networks based on vertex–vertex correlations

International Nuclear Information System (INIS)

Zarei, Mina; Izadi, Dena; Samani, Keivan Aghababaei

2009-01-01

Using the NMF (non-negative matrix factorization) method, the structure of overlapping communities in complex networks is investigated. For the feature matrix of the NMF method we introduce a vertex–vertex correlation matrix. The method is applied to some computer-generated and real-world networks. Simulations show that this feature matrix gives more reasonable results

Finding overlapping communities in multilayer networks.

Science.gov (United States)

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

2018-01-01

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

LP-LPA: A link influence-based label propagation algorithm for discovering community structures in networks

Science.gov (United States)

Berahmand, Kamal; Bouyer, Asgarali

2018-03-01

Community detection is an essential approach for analyzing the structural and functional properties of complex networks. Although many community detection algorithms have been recently presented, most of them are weak and limited in different ways. Label Propagation Algorithm (LPA) is a well-known and efficient community detection technique which is characterized by the merits of nearly-linear running time and easy implementation. However, LPA has some significant problems such as instability, randomness, and monster community detection. In this paper, an algorithm, namely node’s label influence policy for label propagation algorithm (LP-LPA) was proposed for detecting efficient community structures. LP-LPA measures link strength value for edges and nodes’ label influence value for nodes in a new label propagation strategy with preference on link strength and for initial nodes selection, avoid of random behavior in tiebreak states, and efficient updating order and rule update. These procedures can sort out the randomness issue in an original LPA and stabilize the discovered communities in all runs of the same network. Experiments on synthetic networks and a wide range of real-world social networks indicated that the proposed method achieves significant accuracy and high stability. Indeed, it can obviously solve monster community problem with regard to detecting communities in networks.

Chimera States in Mechanical Oscillator Networks

OpenAIRE

Martens, Erik Andreas; Thutupalli, Shashi; Fourrière, Antoine; Hallatschek, Oskar

2013-01-01

The synchronization of coupled oscillators is a fascinating manifestation of self-organization that nature uses to orchestrate essential processes of life, such as the beating of the heart. Although it was long thought that synchrony and disorder were mutually exclusive steady states for a network of identical oscillators, numerous theoretical studies in recent years have revealed the intriguing possibility of “chimera states,” in which the symmetry of the oscillator population is broken into...

A divisive spectral method for network community detection

International Nuclear Information System (INIS)

Cheng, Jianjun; Li, Longjie; Yao, Yukai; Chen, Xiaoyun; Leng, Mingwei; Lu, Weiguo

2016-01-01

Community detection is a fundamental problem in the domain of complex network analysis. It has received great attention, and many community detection methods have been proposed in the last decade. In this paper, we propose a divisive spectral method for identifying community structures from networks which utilizes a sparsification operation to pre-process the networks first, and then uses a repeated bisection spectral algorithm to partition the networks into communities. The sparsification operation makes the community boundaries clearer and sharper, so that the repeated spectral bisection algorithm extract high-quality community structures accurately from the sparsified networks. Experiments show that the combination of network sparsification and a spectral bisection algorithm is highly successful, the proposed method is more effective in detecting community structures from networks than the others. (paper: interdisciplinary statistical mechanics)

Paradoxes of Social Networking in a Structured Web 2.0 Language Learning Community

Science.gov (United States)

Loiseau, Mathieu; Zourou, Katerina

2012-01-01

This paper critically inquires into social networking as a set of mechanisms and associated practices developed in a structured Web 2.0 language learning community. This type of community can be roughly described as learning spaces featuring (more or less) structured language learning resources displaying at least some notions of language learning…

Detection of stable community structures within gut microbiota co-occurrence networks from different human populations.

Science.gov (United States)

Jackson, Matthew A; Bonder, Marc Jan; Kuncheva, Zhana; Zierer, Jonas; Fu, Jingyuan; Kurilshikov, Alexander; Wijmenga, Cisca; Zhernakova, Alexandra; Bell, Jordana T; Spector, Tim D; Steves, Claire J

2018-01-01

Microbes in the gut microbiome form sub-communities based on shared niche specialisations and specific interactions between individual taxa. The inter-microbial relationships that define these communities can be inferred from the co-occurrence of taxa across multiple samples. Here, we present an approach to identify comparable communities within different gut microbiota co-occurrence networks, and demonstrate its use by comparing the gut microbiota community structures of three geographically diverse populations. We combine gut microbiota profiles from 2,764 British, 1,023 Dutch, and 639 Israeli individuals, derive co-occurrence networks between their operational taxonomic units, and detect comparable communities within them. Comparing populations we find that community structure is significantly more similar between datasets than expected by chance. Mapping communities across the datasets, we also show that communities can have similar associations to host phenotypes in different populations. This study shows that the community structure within the gut microbiota is stable across populations, and describes a novel approach that facilitates comparative community-centric microbiome analyses.

Explosive death of conjugate coupled Van der Pol oscillators on networks

Science.gov (United States)

Zhao, Nannan; Sun, Zhongkui; Yang, Xiaoli; Xu, Wei

2018-06-01

Explosive death phenomenon has been gradually gaining attention of researchers due to the research boom of explosive synchronization, and it has been observed recently for the identical or nonidentical coupled systems in all-to-all network. In this work, we investigate the emergence of explosive death in networked Van der Pol (VdP) oscillators with conjugate variables coupling. It is demonstrated that the network structures play a crucial role in identifying the types of explosive death behaviors. We also observe that the damping coefficient of the VdP system not only can determine whether the explosive death state is generated but also can adjust the forward transition point. We further show that the backward transition point is independent of the network topologies and the damping coefficient, which is well confirmed by theoretical analysis. Our results reveal the generality of explosive death phenomenon in different network topologies and are propitious to promote a better comprehension for the oscillation quenching behaviors.

Oscillations in the bistable regime of neuronal networks.

Science.gov (United States)

Roxin, Alex; Compte, Albert

2016-07-01

Bistability between attracting fixed points in neuronal networks has been hypothesized to underlie persistent activity observed in several cortical areas during working memory tasks. In network models this kind of bistability arises due to strong recurrent excitation, sufficient to generate a state of high activity created in a saddle-node (SN) bifurcation. On the other hand, canonical network models of excitatory and inhibitory neurons (E-I networks) robustly produce oscillatory states via a Hopf (H) bifurcation due to the E-I loop. This mechanism for generating oscillations has been invoked to explain the emergence of brain rhythms in the β to γ bands. Although both bistability and oscillatory activity have been intensively studied in network models, there has not been much focus on the coincidence of the two. Here we show that when oscillations emerge in E-I networks in the bistable regime, their phenomenology can be explained to a large extent by considering coincident SN and H bifurcations, known as a codimension two Takens-Bogdanov bifurcation. In particular, we find that such oscillations are not composed of a stable limit cycle, but rather are due to noise-driven oscillatory fluctuations. Furthermore, oscillations in the bistable regime can, in principle, have arbitrarily low frequency.

Pinning Control Strategy of Multicommunity Structure Networks

Directory of Open Access Journals (Sweden)

Chao Ding

2017-01-01

Full Text Available In order to investigate the effects of community structure on synchronization, a pinning control strategy is researched in a class of complex networks with community structure in this paper. A feedback control law is designed based on the network community structure information. The stability condition is given and proved by using Lyapunov stability theory. Our research shows that as to community structure networks, there being a threshold hT≈5, when coupling strength bellows this threshold, the stronger coupling strength corresponds to higher synchronizability; vice versa, the stronger coupling strength brings lower synchronizability. In addition the synchronizability of overlapping and nonoverlapping community structure networks was simulated and analyzed; while the nodes were controlled randomly and intensively, the results show that intensive control strategy is better than the random one. The network will reach synchronization easily when the node with largest betweenness was controlled. Furthermore, four difference networks’ synchronizability, such as Barabási-Albert network, Watts-Strogatz network, Erdös-Rényi network, and community structure network, are simulated; the research shows that the community structure network is more easily synchronized under the same control strength.

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

Science.gov (United States)

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

2009-12-04

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

Hyperbolic geometry of Kuramoto oscillator networks

Science.gov (United States)

Chen, Bolun; Engelbrecht, Jan R.; Mirollo, Renato

2017-09-01

Kuramoto oscillator networks have the special property that their trajectories are constrained to lie on the (at most) 3D orbits of the Möbius group acting on the state space T N (the N-fold torus). This result has been used to explain the existence of the N-3 constants of motion discovered by Watanabe and Strogatz for Kuramoto oscillator networks. In this work we investigate geometric consequences of this Möbius group action. The dynamics of Kuramoto phase models can be further reduced to 2D reduced group orbits, which have a natural geometry equivalent to the unit disk \

Detecting community structure using label propagation with consensus weight in complex network

International Nuclear Information System (INIS)

Liang Zong-Wen; Li Jian-Ping; Yang Fan; Petropulu Athina

2014-01-01

Community detection is a fundamental work to analyse the structural and functional properties of complex networks. The label propagation algorithm (LPA) is a near linear time algorithm to find a good community structure. Despite various subsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the basic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these consensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the edge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number of partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps, by computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter to adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an approach named the label propagation algorithm with consensus weight (LPAcw), and the experimental results showed that the LPAcw could enhance considerably both the stability and the accuracy of community partitions. (interdisciplinary physics and related areas of science and technology)

The community structure of the European network of interlocking directorates 2005-2010.

Directory of Open Access Journals (Sweden)

Eelke M Heemskerk

Full Text Available The boards of directors at large European companies overlap with each other to a sizable extent both within and across national borders. This could have important economic, political and management consequences. In this work we study in detail the topological structure of the networks that arise from this phenomenon. Using a comprehensive information database, we reconstruct the implicit networks of shared directorates among the top 300 European firms in 2005 and 2010, and suggest a number of novel ways to explore the trans-nationality of such business elite networks. Powerful community detection heuristics indicate that geography still plays an important role: there exist clear communities and they have a distinct national character. Nonetheless, from 2005 to 2010 we observe a densification of the boards interlocks network and a larger transnational orientation in its communities. Together with central actors and assortativity analyses, we provide statistical evidence that, at the level of corporate governance, Europe is getting closer.

The community structure of the European network of interlocking directorates 2005-2010.

Science.gov (United States)

Heemskerk, Eelke M; Daolio, Fabio; Tomassini, Marco

2013-01-01

The boards of directors at large European companies overlap with each other to a sizable extent both within and across national borders. This could have important economic, political and management consequences. In this work we study in detail the topological structure of the networks that arise from this phenomenon. Using a comprehensive information database, we reconstruct the implicit networks of shared directorates among the top 300 European firms in 2005 and 2010, and suggest a number of novel ways to explore the trans-nationality of such business elite networks. Powerful community detection heuristics indicate that geography still plays an important role: there exist clear communities and they have a distinct national character. Nonetheless, from 2005 to 2010 we observe a densification of the boards interlocks network and a larger transnational orientation in its communities. Together with central actors and assortativity analyses, we provide statistical evidence that, at the level of corporate governance, Europe is getting closer.

Perfect synchronization in networks of phase-frustrated oscillators

Science.gov (United States)

Kundu, Prosenjit; Hens, Chittaranjan; Barzel, Baruch; Pal, Pinaki

2017-11-01

Synchronizing phase-frustrated Kuramoto oscillators, a challenge that has found applications from neuronal networks to the power grid, is an eluding problem, as even small phase lags cause the oscillators to avoid synchronization. Here we show, constructively, how to strategically select the optimal frequency set, capturing the natural frequencies of all oscillators, for a given network and phase lags, that will ensure perfect synchronization. We find that high levels of synchronization are sustained in the vicinity of the optimal set, allowing for some level of deviation in the frequencies without significant degradation of synchronization. Demonstrating our results on first- and second-order phase-frustrated Kuramoto dynamics, we implement them on both model and real power grid networks, showing how to achieve synchronization in a phase-frustrated environment.

Community Structure Analysis of Gene Interaction Networks in Duchenne Muscular Dystrophy.

Directory of Open Access Journals (Sweden)

Tejaswini Narayanan

Full Text Available Duchenne Muscular Dystrophy (DMD is an important pathology associated with the human skeletal muscle and has been studied extensively. Gene expression measurements on skeletal muscle of patients afflicted with DMD provides the opportunity to understand the underlying mechanisms that lead to the pathology. Community structure analysis is a useful computational technique for understanding and modeling genetic interaction networks. In this paper, we leverage this technique in combination with gene expression measurements from normal and DMD patient skeletal muscle tissue to study the structure of genetic interactions in the context of DMD. We define a novel framework for transforming a raw dataset of gene expression measurements into an interaction network, and subsequently apply algorithms for community structure analysis for the extraction of topological communities. The emergent communities are analyzed from a biological standpoint in terms of their constituent biological pathways, and an interpretation that draws correlations between functional and structural organization of the genetic interactions is presented. We also compare these communities and associated functions in pathology against those in normal human skeletal muscle. In particular, differential enhancements are observed in the following pathways between pathological and normal cases: Metabolic, Focal adhesion, Regulation of actin cytoskeleton and Cell adhesion, and implication of these mechanisms are supported by prior work. Furthermore, our study also includes a gene-level analysis to identify genes that are involved in the coupling between the pathways of interest. We believe that our results serve to highlight important distinguishing features in the structural/functional organization of constituent biological pathways, as it relates to normal and DMD cases, and provide the mechanistic basis for further biological investigations into specific pathways differently regulated

Synchronization of oscillators in complex networks

Indian Academy of Sciences (India)

Abstract. Theory of identical or complete synchronization of identical oscillators in arbitrary networks is introduced. In addition, several graph theory concepts and results that augment the synchronization theory and a tie in closely to random, semirandom, and regular networks are introduced. Combined theories are used to ...

Synchronization of oscillators in complex networks

Indian Academy of Sciences (India)

Theory of identical or complete synchronization of identical oscillators in arbitrary networks is introduced. In addition, several graph theory concepts and results that augment the synchronization theory and a tie in closely to random, semirandom, and regular networks are introduced. Combined theories are used to explore ...

A novel community detection method in bipartite networks

Science.gov (United States)

Zhou, Cangqi; Feng, Liang; Zhao, Qianchuan

2018-02-01

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

Global competition and local cooperation in a network of neural oscillators

Science.gov (United States)

Terman, David; Wang, DeLiang

An architecture of locally excitatory, globally inhibitory oscillator networks is proposed and investigated both analytically and by computer simulation. The model for each oscillator corresponds to a standard relaxation oscillator with two time scales. Oscillators are locally coupled by a scheme that resembles excitatory synaptic coupling, and each oscillator also inhibits other oscillators through a common inhibitor. Oscillators are driven to be oscillatory by external stimulation. The network exhibits a mechanism of selective gating, whereby an oscillator jumping up to its active phase rapidly recruits the oscillators stimulated by the same pattern, while preventing the other oscillators from jumping up. We show analytically that with the selective gating mechanism, the network rapidly achieves both synchronization within blocks of oscillators that are stimulated by connected regions and desynchronization between different blocks. Computer simulations demonstrate the model's promising ability for segmenting multiple input patterns in real time. This model lays a physical foundation for the oscillatory correlation theory of feature binding and may provide an effective computational framework for scene segmentation and figure/ ground segregation.

Quantifying the dynamics of coupled networks of switches and oscillators.

Directory of Open Access Journals (Sweden)

Matthew R Francis

Full Text Available Complex network dynamics have been analyzed with models of systems of coupled switches or systems of coupled oscillators. However, many complex systems are composed of components with diverse dynamics whose interactions drive the system's evolution. We, therefore, introduce a new modeling framework that describes the dynamics of networks composed of both oscillators and switches. Both oscillator synchronization and switch stability are preserved in these heterogeneous, coupled networks. Furthermore, this model recapitulates the qualitative dynamics for the yeast cell cycle consistent with the hypothesized dynamics resulting from decomposition of the regulatory network into dynamic motifs. Introducing feedback into the cell-cycle network induces qualitative dynamics analogous to limitless replicative potential that is a hallmark of cancer. As a result, the proposed model of switch and oscillator coupling provides the ability to incorporate mechanisms that underlie the synchronized stimulus response ubiquitous in biochemical systems.

New type of chimera structures in a ring of bistable FitzHugh–Nagumo oscillators with nonlocal interaction

Energy Technology Data Exchange (ETDEWEB)

Shepelev, I.A., E-mail: igor_sar@li.ru; Vadivasova, T.E., E-mail: vadivasovate@yandex.ru; Bukh, A.V., E-mail: buh.andrey@yandex.ru; Strelkova, G.I., E-mail: strelkovagi@info.sgu.ru; Anishchenko, V.S., E-mail: wadim@info.sgu.ru

2017-04-25

We study the spatiotemporal dynamics of a ring of nonlocally coupled FitzHugh–Nagumo oscillators in the bistable regime. A new type of chimera patterns has been found in the noise-free network and when isolated elements do not oscillate. The region of existence of these structures has been explored when the coupling range and the coupling strength between the network elements are varied. - Highlights: • Dynamics of a ring of nonlocally coupled FitzHugh–Nagumo oscillators in the bistable regime is studied. • A new type of chimera patterns has been found in the noise-free network. • The region of existence of new structures has been explored when varying the coupling parameters.

Detecting the Community Structure and Activity Patterns of Temporal Networks: A Non-Negative Tensor Factorization Approach

Science.gov (United States)

Gauvin, Laetitia; Panisson, André; Cattuto, Ciro

2014-01-01

The increasing availability of temporal network data is calling for more research on extracting and characterizing mesoscopic structures in temporal networks and on relating such structure to specific functions or properties of the system. An outstanding challenge is the extension of the results achieved for static networks to time-varying networks, where the topological structure of the system and the temporal activity patterns of its components are intertwined. Here we investigate the use of a latent factor decomposition technique, non-negative tensor factorization, to extract the community-activity structure of temporal networks. The method is intrinsically temporal and allows to simultaneously identify communities and to track their activity over time. We represent the time-varying adjacency matrix of a temporal network as a three-way tensor and approximate this tensor as a sum of terms that can be interpreted as communities of nodes with an associated activity time series. We summarize known computational techniques for tensor decomposition and discuss some quality metrics that can be used to tune the complexity of the factorized representation. We subsequently apply tensor factorization to a temporal network for which a ground truth is available for both the community structure and the temporal activity patterns. The data we use describe the social interactions of students in a school, the associations between students and school classes, and the spatio-temporal trajectories of students over time. We show that non-negative tensor factorization is capable of recovering the class structure with high accuracy. In particular, the extracted tensor components can be validated either as known school classes, or in terms of correlated activity patterns, i.e., of spatial and temporal coincidences that are determined by the known school activity schedule. PMID:24497935

Estimation of airway smooth muscle stiffness changes due to length oscillation using artificial neural network.

Science.gov (United States)

Al-Jumaily, Ahmed; Chen, Leizhi

2012-10-07

This paper presents a novel approach to estimate stiffness changes in airway smooth muscles due to external oscillation. Artificial neural networks are used to model the stiffness changes due to cyclic stretches of the smooth muscles. The nonlinear relationship between stiffness ratios and oscillation frequencies is modeled by a feed-forward neural network (FNN) model. The structure of the FNN is selected through the training and validation using literature data from 11 experiments with different muscle lengths, muscle masses, oscillation frequencies and amplitudes. Data pre-processing methods are used to improve the robustness of the neural network model to match the non-linearity. The validation results show that the FNN model can predict the stiffness ratio changes with a mean square error of 0.0042. Copyright © 2012 Elsevier Ltd. All rights reserved.

How adaptation shapes spike rate oscillations in recurrent neuronal networks

Directory of Open Access Journals (Sweden)

Moritz eAugustin

2013-02-01

Full Text Available Neural mass signals from in-vivo recordings often show oscillations with frequencies ranging from <1 Hz to 100 Hz. Fast rhythmic activity in the beta and gamma range can be generated by network based mechanisms such as recurrent synaptic excitation-inhibition loops. Slower oscillations might instead depend on neuronal adaptation currents whose timescales range from tens of milliseconds to seconds. Here we investigate how the dynamics of such adaptation currents contribute to spike rate oscillations and resonance properties in recurrent networks of excitatory and inhibitory neurons. Based on a network of sparsely coupled spiking model neurons with two types of adaptation current and conductance based synapses with heterogeneous strengths and delays we use a mean-field approach to analyze oscillatory network activity. For constant external input, we find that spike-triggered adaptation currents provide a mechanism to generate slow oscillations over a wide range of adaptation timescales as long as recurrent synaptic excitation is sufficiently strong. Faster rhythms occur when recurrent inhibition is slower than excitation and oscillation frequency increases with the strength of inhibition. Adaptation facilitates such network based oscillations for fast synaptic inhibition and leads to decreased frequencies. For oscillatory external input, adaptation currents amplify a narrow band of frequencies and cause phase advances for low frequencies in addition to phase delays at higher frequencies. Our results therefore identify the different key roles of neuronal adaptation dynamics for rhythmogenesis and selective signal propagation in recurrent networks.

Generating macroscopic chaos in a network of globally coupled phase oscillators

Science.gov (United States)

So, Paul; Barreto, Ernest

2011-01-01

We consider an infinite network of globally coupled phase oscillators in which the natural frequencies of the oscillators are drawn from a symmetric bimodal distribution. We demonstrate that macroscopic chaos can occur in this system when the coupling strength varies periodically in time. We identify period-doubling cascades to chaos, attractor crises, and horseshoe dynamics for the macroscopic mean field. Based on recent work that clarified the bifurcation structure of the static bimodal Kuramoto system, we qualitatively describe the mechanism for the generation of such complicated behavior in the time varying case. PMID:21974662

Synchronization of mobile chaotic oscillator networks

Energy Technology Data Exchange (ETDEWEB)

Fujiwara, Naoya, E-mail: fujiwara@csis.u-tokyo.ac.jp [Center for Spatial Information Science, The University of Tokyo, 277-8568 Chiba (Japan); Kurths, Jürgen [Potsdam Institute for Climate Impact Research (PIK), 14473 Potsdam, Germany and Institute for Complex Systems and Mathematical Biology, University of Aberdeen, Aberdeen (United Kingdom); Díaz-Guilera, Albert [Departament de Física de la Matèria Condensada, Universitat de Barcelona, Martí i Franquès 1, 08028 Barcelona, Spain and Universitat de Barcelona Institute of Complex Systems (UBICS), Universitat de Barcelona, Barcelona (Spain)

2016-09-15

We study synchronization of systems in which agents holding chaotic oscillators move in a two-dimensional plane and interact with nearby ones forming a time dependent network. Due to the uncertainty in observing other agents' states, we assume that the interaction contains a certain amount of noise that turns out to be relevant for chaotic dynamics. We find that a synchronization transition takes place by changing a control parameter. But this transition depends on the relative dynamic scale of motion and interaction. When the topology change is slow, we observe an intermittent switching between laminar and burst states close to the transition due to small noise. This novel type of synchronization transition and intermittency can happen even when complete synchronization is linearly stable in the absence of noise. We show that the linear stability of the synchronized state is not a sufficient condition for its stability due to strong fluctuations of the transverse Lyapunov exponent associated with a slow network topology change. Since this effect can be observed within the linearized dynamics, we can expect such an effect in the temporal networks with noisy chaotic oscillators, irrespective of the details of the oscillator dynamics. When the topology change is fast, a linearized approximation describes well the dynamics towards synchrony. These results imply that the fluctuations of the finite-time transverse Lyapunov exponent should also be taken into account to estimate synchronization of the mobile contact networks.

Synchronization of mobile chaotic oscillator networks

International Nuclear Information System (INIS)

Fujiwara, Naoya; Kurths, Jürgen; Díaz-Guilera, Albert

2016-01-01

We study synchronization of systems in which agents holding chaotic oscillators move in a two-dimensional plane and interact with nearby ones forming a time dependent network. Due to the uncertainty in observing other agents' states, we assume that the interaction contains a certain amount of noise that turns out to be relevant for chaotic dynamics. We find that a synchronization transition takes place by changing a control parameter. But this transition depends on the relative dynamic scale of motion and interaction. When the topology change is slow, we observe an intermittent switching between laminar and burst states close to the transition due to small noise. This novel type of synchronization transition and intermittency can happen even when complete synchronization is linearly stable in the absence of noise. We show that the linear stability of the synchronized state is not a sufficient condition for its stability due to strong fluctuations of the transverse Lyapunov exponent associated with a slow network topology change. Since this effect can be observed within the linearized dynamics, we can expect such an effect in the temporal networks with noisy chaotic oscillators, irrespective of the details of the oscillator dynamics. When the topology change is fast, a linearized approximation describes well the dynamics towards synchrony. These results imply that the fluctuations of the finite-time transverse Lyapunov exponent should also be taken into account to estimate synchronization of the mobile contact networks.

Synchronization of mobile chaotic oscillator networks.

Science.gov (United States)

Fujiwara, Naoya; Kurths, Jürgen; Díaz-Guilera, Albert

2016-09-01

We study synchronization of systems in which agents holding chaotic oscillators move in a two-dimensional plane and interact with nearby ones forming a time dependent network. Due to the uncertainty in observing other agents' states, we assume that the interaction contains a certain amount of noise that turns out to be relevant for chaotic dynamics. We find that a synchronization transition takes place by changing a control parameter. But this transition depends on the relative dynamic scale of motion and interaction. When the topology change is slow, we observe an intermittent switching between laminar and burst states close to the transition due to small noise. This novel type of synchronization transition and intermittency can happen even when complete synchronization is linearly stable in the absence of noise. We show that the linear stability of the synchronized state is not a sufficient condition for its stability due to strong fluctuations of the transverse Lyapunov exponent associated with a slow network topology change. Since this effect can be observed within the linearized dynamics, we can expect such an effect in the temporal networks with noisy chaotic oscillators, irrespective of the details of the oscillator dynamics. When the topology change is fast, a linearized approximation describes well the dynamics towards synchrony. These results imply that the fluctuations of the finite-time transverse Lyapunov exponent should also be taken into account to estimate synchronization of the mobile contact networks.

A game theoretic algorithm to detect overlapping community structure in networks

Science.gov (United States)

Zhou, Xu; Zhao, Xiaohui; Liu, Yanheng; Sun, Geng

2018-04-01

Community detection can be used as an important technique for product and personalized service recommendation. A game theory based approach to detect overlapping community structure is introduced in this paper. The process of the community formation is converted into a game, when all agents (nodes) cannot improve their own utility, the game process will be terminated. The utility function is composed of a gain and a loss function and we present a new gain function in this paper. In addition, different from choosing action randomly among join, quit and switch for each agent to get new label, two new strategies for each agent to update its label are designed during the game, and the strategies are also evaluated and compared for each agent in order to find its best result. The overlapping community structure is naturally presented when the stop criterion is satisfied. The experimental results demonstrate that the proposed algorithm outperforms other similar algorithms for detecting overlapping communities in networks.

The Community Structure of the European Network of Interlocking Directorates 2005–2010

Science.gov (United States)

Heemskerk, Eelke M.; Daolio, Fabio; Tomassini, Marco

2013-01-01

The boards of directors at large European companies overlap with each other to a sizable extent both within and across national borders. This could have important economic, political and management consequences. In this work we study in detail the topological structure of the networks that arise from this phenomenon. Using a comprehensive information database, we reconstruct the implicit networks of shared directorates among the top 300 European firms in 2005 and 2010, and suggest a number of novel ways to explore the trans-nationality of such business elite networks. Powerful community detection heuristics indicate that geography still plays an important role: there exist clear communities and they have a distinct national character. Nonetheless, from 2005 to 2010 we observe a densification of the boards interlocks network and a larger transnational orientation in its communities. Together with central actors and assortativity analyses, we provide statistical evidence that, at the level of corporate governance, Europe is getting closer. PMID:23894318

Controlled perturbation-induced switching in pulse-coupled oscillator networks

International Nuclear Information System (INIS)

Schittler Neves, Fabio; Timme, Marc

2009-01-01

Pulse-coupled systems such as spiking neural networks exhibit nontrivial invariant sets in the form of attracting yet unstable saddle periodic orbits where units are synchronized into groups. Heteroclinic connections between such orbits may in principle support switching processes in these networks and enable novel kinds of neural computations. For small networks of coupled oscillators, we here investigate under which conditions and how system symmetry enforces or forbids certain switching transitions that may be induced by perturbations. For networks of five oscillators, we derive explicit transition rules that for two cluster symmetries deviate from those known from oscillators coupled continuously in time. A third symmetry yields heteroclinic networks that consist of sets of all unstable attractors with that symmetry and the connections between them. Our results indicate that pulse-coupled systems can reliably generate well-defined sets of complex spatiotemporal patterns that conform to specific transition rules. We briefly discuss possible implications for computation with spiking neural systems.

Controlled perturbation-induced switching in pulse-coupled oscillator networks

Energy Technology Data Exchange (ETDEWEB)

Schittler Neves, Fabio; Timme, Marc [Network Dynamics Group, Max Planck Institute for Dynamics and Self-Organization, Goettingen, D-37073 (Germany); Bernstein Center for Computational Neuroscience (BCCN), Goettingen (Germany)], E-mail: neves@nld.ds.mpg.de, E-mail: timme@nld.ds.mpg.de

2009-08-28

Pulse-coupled systems such as spiking neural networks exhibit nontrivial invariant sets in the form of attracting yet unstable saddle periodic orbits where units are synchronized into groups. Heteroclinic connections between such orbits may in principle support switching processes in these networks and enable novel kinds of neural computations. For small networks of coupled oscillators, we here investigate under which conditions and how system symmetry enforces or forbids certain switching transitions that may be induced by perturbations. For networks of five oscillators, we derive explicit transition rules that for two cluster symmetries deviate from those known from oscillators coupled continuously in time. A third symmetry yields heteroclinic networks that consist of sets of all unstable attractors with that symmetry and the connections between them. Our results indicate that pulse-coupled systems can reliably generate well-defined sets of complex spatiotemporal patterns that conform to specific transition rules. We briefly discuss possible implications for computation with spiking neural systems.

Enhancing community detection by using local structural information

International Nuclear Information System (INIS)

Xiang, Ju; Bao, Mei-Hua; Tang, Liang; Li, Jian-Ming; Hu, Ke; Chen, Benyan; Hu, Jing-Bo; Zhang, Yan; Tang, Yan-Ni; Gao, Yuan-Yuan

2016-01-01

Many real-world networks, such as gene networks, protein–protein interaction networks and metabolic networks, exhibit community structures, meaning the existence of groups of densely connected vertices in the networks. Many local similarity measures in the networks are closely related to the concept of the community structures, and may have a positive effect on community detection in the networks. Here, various local similarity measures are used to extract local structural information, which is then applied to community detection in the networks by using the edge-reweighting strategy. The effect of the local similarity measures on community detection is carefully investigated and compared in various networks. The experimental results show that the local similarity measures are crucial for the improvement of community detection methods, while the positive effect of the local similarity measures is closely related to the networks under study and applied community detection methods. (paper: interdisciplinary statistical mechanics)

Restoration of oscillation in network of oscillators in presence of direct and indirect interactions

Energy Technology Data Exchange (ETDEWEB)

Majhi, Soumen; Bera, Bidesh K. [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata-700108 (India); Bhowmick, Sourav K. [Department of Electronics, Asutosh College, Kolkata-700026 (India); Ghosh, Dibakar, E-mail: diba.ghosh@gmail.com [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata-700108 (India)

2016-10-23

The suppression of oscillations in coupled systems may lead to several unwanted situations, which requires a suitable treatment to overcome the suppression. In this paper, we show that the environmental coupling in the presence of direct interaction, which can suppress oscillation even in a network of identical oscillators, can be modified by introducing a feedback factor in the coupling scheme in order to restore the oscillation. We inspect how the introduction of the feedback factor helps to resurrect oscillation from various kinds of death states. We numerically verify the resurrection of oscillations for two paradigmatic limit cycle systems, namely Landau–Stuart and Van der Pol oscillators and also in generic chaotic Lorenz oscillator. We also study the effect of parameter mismatch in the process of restoring oscillation for coupled oscillators. - Highlights: • Amplitude death is observed using direct and indirect coupling. • Revival of oscillation using feedback parameter is discussed. • Restoration of oscillation is observed in limit cycle and chaotic systems.

Synchronization and desynchronization in a network of locally coupled Wilson-Cowan oscillators.

Science.gov (United States)

Campbell, S; Wang, D

1996-01-01

A network of Wilson-Cowan (WC) oscillators is constructed, and its emergent properties of synchronization and desynchronization are investigated by both computer simulation and formal analysis. The network is a 2D matrix, where each oscillator is coupled only to its neighbors. We show analytically that a chain of locally coupled oscillators (the piecewise linear approximation to the WC oscillator) synchronizes, and we present a technique to rapidly entrain finite numbers of oscillators. The coupling strengths change on a fast time scale based on a Hebbian rule. A global separator is introduced which receives input from and sends feedback to each oscillator in the matrix. The global separator is used to desynchronize different oscillator groups. Unlike many other models, the properties of this network emerge from local connections that preserve spatial relationships among components and are critical for encoding Gestalt principles of feature grouping. The ability to synchronize and desynchronize oscillator groups within this network offers a promising approach for pattern segmentation and figure/ground segregation based on oscillatory correlation.

Multilabel user classification using the community structure of online networks.

Science.gov (United States)

Rizos, Georgios; Papadopoulos, Symeon; Kompatsiaris, Yiannis

2017-01-01

We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE), an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user's graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score.

Multilabel user classification using the community structure of online networks.

Directory of Open Access Journals (Sweden)

Georgios Rizos

Full Text Available We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE, an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user's graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score.

Network communities within and across borders.

Science.gov (United States)

Cerina, Federica; Chessa, Alessandro; Pammolli, Fabio; Riccaboni, Massimo

2014-04-01

We investigate the impact of borders on the topology of spatially embedded networks. Indeed territorial subdivisions and geographical borders significantly hamper the geographical span of networks thus playing a key role in the formation of network communities. This is especially important in scientific and technological policy-making, highlighting the interplay between pressure for the internationalization to lead towards a global innovation system and the administrative borders imposed by the national and regional institutions. In this study we introduce an outreach index to quantify the impact of borders on the community structure and apply it to the case of the European and US patent co-inventors networks. We find that (a) the US connectivity decays as a power of distance, whereas we observe a faster exponential decay for Europe; (b) European network communities essentially correspond to nations and contiguous regions while US communities span multiple states across the whole country without any characteristic geographic scale. We confirm our findings by means of a set of simulations aimed at exploring the relationship between different patterns of cross-border community structures and the outreach index.

Oscillations, complex spatiotemporal behavior, and information transport in networks of excitatory and inhibitory neurons

International Nuclear Information System (INIS)

Destexhe, A.

1994-01-01

Various types of spatiotemporal behavior are described for two-dimensional networks of excitatory and inhibitory neurons with time delayed interactions. It is described how the network behaves as several structural parameters are varied, such as the number of neurons, the connectivity, and the values of synaptic weights. A transition from spatially uniform oscillations to spatiotemporal chaos via intermittentlike behavior is observed. The properties of spatiotemporally chaotic solutions are investigated by evaluating the largest positive Lyapunov exponent and the loss of correlation with distance. Finally, properties of information transport are evaluated during uniform oscillations and spatiotemporal chaos. It is shown that the diffusion coefficient increases significantly in the spatiotemporal phase similar to the increase of transport coefficients at the onset of fluid turbulence. It is proposed that such a property should be seen in other media, such as chemical turbulence or networks of oscillators. The possibility of measuring information transport from appropriate experiments is also discussed

Pacemaker-driven stochastic resonance on diffusive and complex networks of bistable oscillators

Energy Technology Data Exchange (ETDEWEB)

Perc, Matjaz; Gosak, Marko [Department of Physics, Faculty of Natural Sciences and Mathematics, University of Maribor, Koroska cesta 160, SI-2000 Maribor (Slovenia)], E-mail: matjaz.perc@uni-mb.si

2008-05-15

We study the phenomenon of stochastic resonance on diffusive, small-world and scale-free networks consisting of bistable overdamped oscillators. Important thereby is the fact that the external subthreshold periodic forcing is introduced only to a single oscillator of the network. Hence, the forcing acts as a pacemaker trying to impose its rhythm on the whole network through the unit to which it is introduced. Without the addition of additive spatiotemporal noise, however, the whole network, including the unit that is directly exposed to the pacemaker, remains trapped forever in one of the two stable steady states of the local dynamics. We show that the correlation between the frequency of subthreshold pacemaker activity and the response of the network is resonantly dependent on the intensity of additive noise. The reported pacemaker-driven stochastic resonance depends most significantly on the coupling strength and the underlying network structure. Namely, the outreach of the pacemaker obeys the classic diffusion law in the case of nearest-neighbor interactions, thus being proportional to the square root of the coupling strength, whereas it becomes superdiffusive by an appropriate small-world or scale-free topology of the interaction network. In particular, the scale-free topology is identified as being optimal for the dissemination of localized rhythmic activity across the whole network. Also, we show that the ratio between the clustering coefficient and the characteristic path length is the crucial quantity defining the ability of a small-world network to facilitate the outreach of the pacemaker-emitted subthreshold rhythm. We additionally confirm these findings by using the FitzHugh-Nagumo excitable system as an alternative to the bistable overdamped oscillator.

Pacemaker-driven stochastic resonance on diffusive and complex networks of bistable oscillators

International Nuclear Information System (INIS)

Perc, Matjaz; Gosak, Marko

2008-01-01

We study the phenomenon of stochastic resonance on diffusive, small-world and scale-free networks consisting of bistable overdamped oscillators. Important thereby is the fact that the external subthreshold periodic forcing is introduced only to a single oscillator of the network. Hence, the forcing acts as a pacemaker trying to impose its rhythm on the whole network through the unit to which it is introduced. Without the addition of additive spatiotemporal noise, however, the whole network, including the unit that is directly exposed to the pacemaker, remains trapped forever in one of the two stable steady states of the local dynamics. We show that the correlation between the frequency of subthreshold pacemaker activity and the response of the network is resonantly dependent on the intensity of additive noise. The reported pacemaker-driven stochastic resonance depends most significantly on the coupling strength and the underlying network structure. Namely, the outreach of the pacemaker obeys the classic diffusion law in the case of nearest-neighbor interactions, thus being proportional to the square root of the coupling strength, whereas it becomes superdiffusive by an appropriate small-world or scale-free topology of the interaction network. In particular, the scale-free topology is identified as being optimal for the dissemination of localized rhythmic activity across the whole network. Also, we show that the ratio between the clustering coefficient and the characteristic path length is the crucial quantity defining the ability of a small-world network to facilitate the outreach of the pacemaker-emitted subthreshold rhythm. We additionally confirm these findings by using the FitzHugh-Nagumo excitable system as an alternative to the bistable overdamped oscillator

A Weighted Evolving Network with Community Size Preferential Attachment

International Nuclear Information System (INIS)

Zhuo Zhiwei; Shan Erfang

2010-01-01

Community structure is an important characteristic in real complex network. It is a network consists of groups of nodes within which links are dense but among which links are sparse. In this paper, the evolving network include node, link and community growth and we apply the community size preferential attachment and strength preferential attachment to a growing weighted network model and utilize weight assigning mechanism from BBV model. The resulting network reflects the intrinsic community structure with generalized power-law distributions of nodes' degrees and strengths.

Spontaneous oscillations in microfluidic networks

Science.gov (United States)

Case, Daniel; Angilella, Jean-Regis; Motter, Adilson

2017-11-01

Precisely controlling flows within microfluidic systems is often difficult which typically results in systems being heavily reliant on numerous external pumps and computers. Here, I present a simple microfluidic network that exhibits flow rate switching, bistablity, and spontaneous oscillations controlled by a single pressure. That is, by solely changing the driving pressure, it is possible to switch between an oscillating and steady flow state. Such functionality does not rely on external hardware and may even serve as an on-chip memory or timing mechanism. I use an analytic model and rigorous fluid dynamics simulations to show these results.

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

Science.gov (United States)

Eagle, Michael; Johnson, Matthew; Barnes, Tiffany

2012-01-01

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

Resumption of dynamism in damaged networks of coupled oscillators

Science.gov (United States)

Kundu, Srilena; Majhi, Soumen; Ghosh, Dibakar

2018-05-01

Deterioration in dynamical activities may come up naturally or due to environmental influences in a massive portion of biological and physical systems. Such dynamical degradation may have outright effect on the substantive network performance. This requires us to provide some proper prescriptions to overcome undesired circumstances. In this paper, we present a scheme based on external feedback that can efficiently revive dynamism in damaged networks of active and inactive oscillators and thus enhance the network survivability. Both numerical and analytical investigations are performed in order to verify our claim. We also provide a comparative study on the effectiveness of this mechanism for feedbacks to the inactive group or to the active group only. Most importantly, resurrection of dynamical activity is realized even in time-delayed damaged networks, which are considered to be less persistent against deterioration in the form of inactivity in the oscillators. Furthermore, prominence in our approach is substantiated by providing evidence of enhanced network persistence in complex network topologies taking small-world and scale-free architectures, which makes the proposed remedy quite general. Besides the study in the network of Stuart-Landau oscillators, affirmative influence of external feedback has been justified in the network of chaotic Rössler systems as well.

Effects of multiple spreaders in community networks

Science.gov (United States)

Hu, Zhao-Long; Ren, Zhuo-Ming; Yang, Guang-Yong; Liu, Jian-Guo

2014-12-01

Human contact networks exhibit the community structure. Understanding how such community structure affects the epidemic spreading could provide insights for preventing the spreading of epidemics between communities. In this paper, we explore the spreading of multiple spreaders in community networks. A network based on the clustering preferential mechanism is evolved, whose communities are detected by the Girvan-Newman (GN) algorithm. We investigate the spreading effectiveness by selecting the nodes as spreaders in the following ways: nodes with the largest degree in each community (community hubs), the same number of nodes with the largest degree from the global network (global large-degree) and randomly selected one node within each community (community random). The experimental results on the SIR model show that the spreading effectiveness based on the global large-degree and community hubs methods is the same in the early stage of the infection and the method of community random is the worst. However, when the infection rate exceeds the critical value, the global large-degree method embodies the worst spreading effectiveness. Furthermore, the discrepancy of effectiveness for the three methods will decrease as the infection rate increases. Therefore, we should immunize the hubs in each community rather than those hubs in the global network to prevent the outbreak of epidemics.

Locally excitatory, globally inhibitory oscillator networks: theory and application to scene segmentation

Science.gov (United States)

Wang, DeLiang; Terman, David

1995-01-01

A novel class of locally excitatory, globally inhibitory oscillator networks (LEGION) is proposed and investigated analytically and by computer simulation. The model of each oscillator corresponds to a standard relaxation oscillator with two time scales. The network exhibits a mechanism of selective gating, whereby an oscillator jumping up to its active phase rapidly recruits the oscillators stimulated by the same pattern, while preventing other oscillators from jumping up. We show analytically that with the selective gating mechanism the network rapidly achieves both synchronization within blocks of oscillators that are stimulated by connected regions and desynchronization between different blocks. Computer simulations demonstrate LEGION's promising ability for segmenting multiple input patterns in real time. This model lays a physical foundation for the oscillatory correlation theory of feature binding, and may provide an effective computational framework for scene segmentation and figure/ground segregation.

Chimera states in mechanical oscillator networks.

Science.gov (United States)

Martens, Erik Andreas; Thutupalli, Shashi; Fourrière, Antoine; Hallatschek, Oskar

2013-06-25

The synchronization of coupled oscillators is a fascinating manifestation of self-organization that nature uses to orchestrate essential processes of life, such as the beating of the heart. Although it was long thought that synchrony and disorder were mutually exclusive steady states for a network of identical oscillators, numerous theoretical studies in recent years have revealed the intriguing possibility of "chimera states," in which the symmetry of the oscillator population is broken into a synchronous part and an asynchronous part. However, a striking lack of empirical evidence raises the question of whether chimeras are indeed characteristic of natural systems. This calls for a palpable realization of chimera states without any fine-tuning, from which physical mechanisms underlying their emergence can be uncovered. Here, we devise a simple experiment with mechanical oscillators coupled in a hierarchical network to show that chimeras emerge naturally from a competition between two antagonistic synchronization patterns. We identify a wide spectrum of complex states, encompassing and extending the set of previously described chimeras. Our mathematical model shows that the self-organization observed in our experiments is controlled by elementary dynamical equations from mechanics that are ubiquitous in many natural and technological systems. The symmetry-breaking mechanism revealed by our experiments may thus be prevalent in systems exhibiting collective behavior, such as power grids, optomechanical crystals, or cells communicating via quorum sensing in microbial populations.

Oscillating systems with cointegrated phase processes

DEFF Research Database (Denmark)

Østergaard, Jacob; Rahbek, Anders; Ditlevsen, Susanne

2017-01-01

We present cointegration analysis as a method to infer the network structure of a linearly phase coupled oscillating system. By defining a class of oscillating systems with interacting phases, we derive a data generating process where we can specify the coupling structure of a network...... that resembles biological processes. In particular we study a network of Winfree oscillators, for which we present a statistical analysis of various simulated networks, where we conclude on the coupling structure: the direction of feedback in the phase processes and proportional coupling strength between...... individual components of the system. We show that we can correctly classify the network structure for such a system by cointegration analysis, for various types of coupling, including uni-/bi-directional and all-to-all coupling. Finally, we analyze a set of EEG recordings and discuss the current...

Topic-oriented community detection of rating-based social networks

Directory of Open Access Journals (Sweden)

Ali Reihanian

2016-07-01

Full Text Available Nowadays, real world social networks contain a vast range of information including shared objects, comments, following information, etc. Finding meaningful communities in this kind of networks is an interesting research area and has attracted the attention of many researchers. The community structure of complex networks reveals both their organization and hidden relations among their constituents. Most of the researches in the field of community detection mainly focus on the topological structure of the network without performing any content analysis. In recent years, a number of researches have proposed approaches which consider both the contents that are interchanged in networks, and the topological structures of the networks in order to find more meaningful communities. In this research, the effect of topic analysis in finding more meaningful communities in social networking sites in which the users express their feelings toward different objects (like movies by means of rating is demonstrated by performing extensive experiments.

Community detection using preference networks

Science.gov (United States)

Tasgin, Mursel; Bingol, Haluk O.

2018-04-01

Community detection is the task of identifying clusters or groups of nodes in a network where nodes within the same group are more connected with each other than with nodes in different groups. It has practical uses in identifying similar functions or roles of nodes in many biological, social and computer networks. With the availability of very large networks in recent years, performance and scalability of community detection algorithms become crucial, i.e. if time complexity of an algorithm is high, it cannot run on large networks. In this paper, we propose a new community detection algorithm, which has a local approach and is able to run on large networks. It has a simple and effective method; given a network, algorithm constructs a preference network of nodes where each node has a single outgoing edge showing its preferred node to be in the same community with. In such a preference network, each connected component is a community. Selection of the preferred node is performed using similarity based metrics of nodes. We use two alternatives for this purpose which can be calculated in 1-neighborhood of nodes, i.e. number of common neighbors of selector node and its neighbors and, the spread capability of neighbors around the selector node which is calculated by the gossip algorithm of Lind et.al. Our algorithm is tested on both computer generated LFR networks and real-life networks with ground-truth community structure. It can identify communities accurately in a fast way. It is local, scalable and suitable for distributed execution on large networks.

Incorporating profile information in community detection for online social networks

Science.gov (United States)

Fan, W.; Yeung, K. H.

2014-07-01

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

A model for evolution of overlapping community networks

Science.gov (United States)

Karan, Rituraj; Biswal, Bibhu

2017-05-01

A model is proposed for the evolution of network topology in social networks with overlapping community structure. Starting from an initial community structure that is defined in terms of group affiliations, the model postulates that the subsequent growth and loss of connections is similar to the Hebbian learning and unlearning in the brain and is governed by two dominant factors: the strength and frequency of interaction between the members, and the degree of overlap between different communities. The temporal evolution from an initial community structure to the current network topology can be described based on these two parameters. It is possible to quantify the growth occurred so far and predict the final stationary state to which the network is likely to evolve. Applications in epidemiology or the spread of email virus in a computer network as well as finding specific target nodes to control it are envisaged. While facing the challenge of collecting and analyzing large-scale time-resolved data on social groups and communities one faces the most basic questions: how do communities evolve in time? This work aims to address this issue by developing a mathematical model for the evolution of community networks and studying it through computer simulation.

Regulating Cortical Oscillations in an Inhibition-Stabilized Network.

Science.gov (United States)

Jadi, Monika P; Sejnowski, Terrence J

2014-04-21

Understanding the anatomical and functional architecture of the brain is essential for designing neurally inspired intelligent systems. Theoretical and empirical studies suggest a role for narrowband oscillations in shaping the functional architecture of the brain through their role in coding and communication of information. Such oscillations are ubiquitous signals in the electrical activity recorded from the brain. In the cortex, oscillations detected in the gamma range (30-80 Hz) are modulated by behavioral states and sensory features in complex ways. How is this regulation achieved? Although several underlying principles for the genesis of these oscillations have been proposed, a unifying account for their regulation has remained elusive. In a network of excitatory and inhibitory neurons operating in an inhibition-stabilized regime, we show that strongly superlinear responses of inhibitory neurons facilitate bidirectional regulation of oscillation frequency and power. In such a network, the balance of drives to the excitatory and inhibitory populations determines how the power and frequency of oscillations are modulated. The model accounts for the puzzling increase in their frequency with the salience of visual stimuli, and a decrease with their size. Oscillations in our model grow stronger as the mean firing level is reduced, accounting for the size dependence of visually evoked gamma rhythms, and suggesting a role for oscillations in improving the signal-to-noise ratio (SNR) of signals in the brain. Empirically testing such predictions is still challenging, and implementing the proposed coding and communication strategies in neuromorphic systems could assist in our understanding of the biological system.

Epidemic spreading in time-varying community networks.

Science.gov (United States)

Ren, Guangming; Wang, Xingyuan

2014-06-01

The spreading processes of many infectious diseases have comparable time scale as the network evolution. Here, we present a simple networks model with time-varying community structure, and investigate susceptible-infected-susceptible epidemic spreading processes in this model. By both theoretic analysis and numerical simulations, we show that the efficiency of epidemic spreading in this model depends intensively on the mobility rate q of the individuals among communities. We also find that there exists a mobility rate threshold qc. The epidemic will survive when q > qc and die when q epidemic spreading in complex networks with community structure.

New type of chimera structures in a ring of bistable FitzHugh-Nagumo oscillators with nonlocal interaction

Science.gov (United States)

Shepelev, I. A.; Vadivasova, T. E.; Bukh, A. V.; Strelkova, G. I.; Anishchenko, V. S.

2017-04-01

We study the spatiotemporal dynamics of a ring of nonlocally coupled FitzHugh-Nagumo oscillators in the bistable regime. A new type of chimera patterns has been found in the noise-free network and when isolated elements do not oscillate. The region of existence of these structures has been explored when the coupling range and the coupling strength between the network elements are varied.

Learning Latent Structure in Complex Networks

DEFF Research Database (Denmark)

Mørup, Morten; Hansen, Lars Kai

such as the Modularity, it has recently been shown that latent structure in complex networks is learnable by Bayesian generative link distribution models (Airoldi et al., 2008, Hofman and Wiggins, 2008). In this paper we propose a new generative model that allows representation of latent community structure......Latent structure in complex networks, e.g., in the form of community structure, can help understand network dynamics, identify heterogeneities in network properties, and predict ‘missing’ links. While most community detection algorithms are based on optimizing heuristic clustering objectives...... as in the previous Bayesian approaches and in addition allows learning of node specific link properties similar to that in the modularity objective. We employ a new relaxation method for efficient inference in these generative models that allows us to learn the behavior of very large networks. We compare the link...

Emergence of amplitude death scenario in a network of oscillators under repulsive delay interaction

Energy Technology Data Exchange (ETDEWEB)

Bera, Bidesh K., E-mail: bideshbera18@gmail.com [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata 700108 (India); Hens, Chittaranjan, E-mail: chittaranjanhens@gmail.com [Department of Mathematics, Bar-Ilan University, Ramat Gan 52900 (Israel); Ghosh, Dibakar, E-mail: dibakar@isical.ac.in [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata 700108 (India)

2016-07-15

Highlights: • Amplitude death is observed using repulsive mean coupling. • Analytical conditions for amplitude death are derived. • Effect of asymmetry time delay coupling for death is discussed. - Abstract: We report the existence of amplitude death in a network of identical oscillators under repulsive mean coupling. Amplitude death appears in a globally coupled network of identical oscillators with instantaneous repulsive mean coupling only when the number of oscillators is more than two. We further investigate that, amplitude death may emerge even in two coupled oscillators as well as network of oscillators if we introduce delay time in the repulsive mean coupling. We have analytically derived the region of amplitude death island and find out how strength of delay controls the death regime in two coupled or a large network of coupled oscillators. We have verified our results on network of delayed Mackey–Glass systems where parameters are set in hyperchaotic regime. We have also tested our coupling approach in two paradigmatic limit cycle oscillators: Stuart–Landau and Van der Pol oscillators.

Emergence of amplitude death scenario in a network of oscillators under repulsive delay interaction

International Nuclear Information System (INIS)

Bera, Bidesh K.; Hens, Chittaranjan; Ghosh, Dibakar

2016-01-01

Highlights: • Amplitude death is observed using repulsive mean coupling. • Analytical conditions for amplitude death are derived. • Effect of asymmetry time delay coupling for death is discussed. - Abstract: We report the existence of amplitude death in a network of identical oscillators under repulsive mean coupling. Amplitude death appears in a globally coupled network of identical oscillators with instantaneous repulsive mean coupling only when the number of oscillators is more than two. We further investigate that, amplitude death may emerge even in two coupled oscillators as well as network of oscillators if we introduce delay time in the repulsive mean coupling. We have analytically derived the region of amplitude death island and find out how strength of delay controls the death regime in two coupled or a large network of coupled oscillators. We have verified our results on network of delayed Mackey–Glass systems where parameters are set in hyperchaotic regime. We have also tested our coupling approach in two paradigmatic limit cycle oscillators: Stuart–Landau and Van der Pol oscillators.

Interactions between neural networks: a mechanism for tuning chaos and oscillations.

Science.gov (United States)

Wang, Lipo

2007-06-01

We show that chaos and oscillations in a higher-order binary neural network can be tuned effectively using interactions between neural networks. Our results suggest that network interactions may be useful as a means of adjusting the level of dynamic activities in systems that employ chaos and oscillations for information processing, or as a means of suppressing oscillatory behaviors in systems that require stability.

Nonstationary oscillation of gyrotron backward wave oscillators with cylindrical interaction structure

International Nuclear Information System (INIS)

Chen, Shih-Hung; Chen, Liu

2013-01-01

The nonstationary oscillation of the gyrotron backward wave oscillator (gyro-BWO) with cylindrical interaction structure was studied utilizing both steady-state analyses and time-dependent simulations. Comparisons of the numerical results reveal that the gyro-BWO becomes nonstationary when the trailing field structure completely forms due to the dephasing energetic electrons. The backward propagation of radiated waves with a lower resonant frequency from the trailing field structure interferes with the main internal feedback loop, thereby inducing the nonstationary oscillation of the gyro-BWO. The nonstationary gyro-BWO exhibits the same spectral pattern of modulated oscillations with a constant frequency separation between the central frequency and sidebands throughout the whole system. The frequency separation is found to be scaled with the square root of the maximum field amplitude, thus further demonstrating that the nonstationary oscillation of the gyro-BWO is associated with the beam-wave resonance detuning

Mixture models with entropy regularization for community detection in networks

Science.gov (United States)

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

2018-04-01

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

Chimera states in mechanical oscillator networks

DEFF Research Database (Denmark)

Martens, Erik Andreas; Thutupalli, Shashi; Fourrière, Antoine

2013-01-01

of identical oscillators, numerous theoretical studies in recent years have revealed the intriguing possibility of "chimera states," in which the symmetry of the oscillator population is broken into a synchronous part and an asynchronous part. However, a striking lack of empirical evidence raises the question...... of whether chimeras are indeed characteristic of natural systems. This calls for a palpable realization of chimera states without any fine-tuning, from which physical mechanisms underlying their emergence can be uncovered. Here, we devise a simple experiment with mechanical oscillators coupled...... in a hierarchical network to show that chimeras emerge naturally from a competition between two antagonistic synchronization patterns. We identify a wide spectrum of complex states, encompassing and extending the set of previously described chimeras. Our mathematical model shows that the self-organization observed...

The Relationship Between Low-Frequency Motions and Community Structure of Residue Network in Protein Molecules.

Science.gov (United States)

Sun, Weitao

2018-01-01

The global shape of a protein molecule is believed to be dominant in determining low-frequency deformational motions. However, how structure dynamics relies on residue interactions remains largely unknown. The global residue community structure and the local residue interactions are two important coexisting factors imposing significant effects on low-frequency normal modes. In this work, an algorithm for community structure partition is proposed by integrating Miyazawa-Jernigan empirical potential energy as edge weight. A sensitivity parameter is defined to measure the effect of local residue interaction on low-frequency movement. We show that community structure is a more fundamental feature of residue contact networks. Moreover, we surprisingly find that low-frequency normal mode eigenvectors are sensitive to some local critical residue interaction pairs (CRIPs). A fair amount of CRIPs act as bridges and hold distributed structure components into a unified tertiary structure by bonding nearby communities. Community structure analysis and CRIP detection of 116 catalytic proteins reveal that breaking up of a CRIP can cause low-frequency allosteric movement of a residue at the far side of protein structure. The results imply that community structure and CRIP may be the structural basis for low-frequency motions.

Chimeralike states in networks of bistable time-delayed feedback oscillators coupled via the mean field.

Science.gov (United States)

Ponomarenko, V I; Kulminskiy, D D; Prokhorov, M D

2017-08-01

We study the collective dynamics of oscillators in a network of identical bistable time-delayed feedback systems globally coupled via the mean field. The influence of delay and inertial properties of the mean field on the collective behavior of globally coupled oscillators is investigated. A variety of oscillation regimes in the network results from the presence of bistable states with substantially different frequencies in coupled oscillators. In the physical experiment and numerical simulation we demonstrate the existence of chimeralike states, in which some of the oscillators in the network exhibit synchronous oscillations, while all other oscillators remain asynchronous.

Weighted Evolving Networks with Self-organized Communities

International Nuclear Information System (INIS)

Xie Zhou; Wang Xiaofan; Li Xiang

2008-01-01

In order to describe the self-organization of communities in the evolution of weighted networks, we propose a new evolving model for weighted community-structured networks with the preferential mechanisms functioned in different levels according to community sizes and node strengths, respectively. Theoretical analyses and numerical simulations show that our model captures power-law distributions of community sizes, node strengths, and link weights, with tunable exponents of ν ≥ 1, γ > 2, and α > 2, respectively, sharing large clustering coefficients and scaling clustering spectra, and covering the range from disassortative networks to assortative networks. Finally, we apply our new model to the scientific co-authorship networks with both their weighted and unweighted datasets to verify its effectiveness

Identification of hybrid node and link communities in complex networks.

Science.gov (United States)

He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong

2015-03-02

Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.

Identification of hybrid node and link communities in complex networks

Science.gov (United States)

He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong

2015-03-01

Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.

Adaptive multi-resolution Modularity for detecting communities in networks

Science.gov (United States)

Chen, Shi; Wang, Zhi-Zhong; Bao, Mei-Hua; Tang, Liang; Zhou, Ji; Xiang, Ju; Li, Jian-Ming; Yi, Chen-He

2018-02-01

Community structure is a common topological property of complex networks, which attracted much attention from various fields. Optimizing quality functions for community structures is a kind of popular strategy for community detection, such as Modularity optimization. Here, we introduce a general definition of Modularity, by which several classical (multi-resolution) Modularity can be derived, and then propose a kind of adaptive (multi-resolution) Modularity that can combine the advantages of different Modularity. By applying the Modularity to various synthetic and real-world networks, we study the behaviors of the methods, showing the validity and advantages of the multi-resolution Modularity in community detection. The adaptive Modularity, as a kind of multi-resolution method, can naturally solve the first-type limit of Modularity and detect communities at different scales; it can quicken the disconnecting of communities and delay the breakup of communities in heterogeneous networks; and thus it is expected to generate the stable community structures in networks more effectively and have stronger tolerance against the second-type limit of Modularity.

Interactive network configuration maintains bacterioplankton community structure under elevated CO2 in a eutrophic coastal mesocosm experiment

Science.gov (United States)

Lin, Xin; Huang, Ruiping; Li, Yan; Li, Futian; Wu, Yaping; Hutchins, David A.; Dai, Minhan; Gao, Kunshan

2018-01-01

There is increasing concern about the effects of ocean acidification on marine biogeochemical and ecological processes and the organisms that drive them, including marine bacteria. Here, we examine the effects of elevated CO2 on the bacterioplankton community during a mesocosm experiment using an artificial phytoplankton community in subtropical, eutrophic coastal waters of Xiamen, southern China. Through sequencing the bacterial 16S rRNA gene V3-V4 region, we found that the bacterioplankton community in this high-nutrient coastal environment was relatively resilient to changes in seawater carbonate chemistry. Based on comparative ecological network analysis, we found that elevated CO2 hardly altered the network structure of high-abundance bacterioplankton taxa but appeared to reassemble the community network of low abundance taxa. This led to relatively high resilience of the whole bacterioplankton community to the elevated CO2 level and associated chemical changes. We also observed that the Flavobacteria group, which plays an important role in the microbial carbon pump, showed higher relative abundance under the elevated CO2 condition during the early stage of the phytoplankton bloom in the mesocosms. Our results provide new insights into how elevated CO2 may influence bacterioplankton community structure.

Phase reduction and synchronization of a network of coupled dynamical elements exhibiting collective oscillations

Science.gov (United States)

Nakao, Hiroya; Yasui, Sho; Ota, Masashi; Arai, Kensuke; Kawamura, Yoji

2018-04-01

A general phase reduction method for a network of coupled dynamical elements exhibiting collective oscillations, which is applicable to arbitrary networks of heterogeneous dynamical elements, is developed. A set of coupled adjoint equations for phase sensitivity functions, which characterize the phase response of the collective oscillation to small perturbations applied to individual elements, is derived. Using the phase sensitivity functions, collective oscillation of the network under weak perturbation can be described approximately by a one-dimensional phase equation. As an example, mutual synchronization between a pair of collectively oscillating networks of excitable and oscillatory FitzHugh-Nagumo elements with random coupling is studied.

Coherent and intermittent ensemble oscillations emerge from networks of irregular spiking neurons.

Science.gov (United States)

Hoseini, Mahmood S; Wessel, Ralf

2016-01-01

Local field potential (LFP) recordings from spatially distant cortical circuits reveal episodes of coherent gamma oscillations that are intermittent, and of variable peak frequency and duration. Concurrently, single neuron spiking remains largely irregular and of low rate. The underlying potential mechanisms of this emergent network activity have long been debated. Here we reproduce such intermittent ensemble oscillations in a model network, consisting of excitatory and inhibitory model neurons with the characteristics of regular-spiking (RS) pyramidal neurons, and fast-spiking (FS) and low-threshold spiking (LTS) interneurons. We find that fluctuations in the external inputs trigger reciprocally connected and irregularly spiking RS and FS neurons in episodes of ensemble oscillations, which are terminated by the recruitment of the LTS population with concurrent accumulation of inhibitory conductance in both RS and FS neurons. The model qualitatively reproduces experimentally observed phase drift, oscillation episode duration distributions, variation in the peak frequency, and the concurrent irregular single-neuron spiking at low rate. Furthermore, consistent with previous experimental studies using optogenetic manipulation, periodic activation of FS, but not RS, model neurons causes enhancement of gamma oscillations. In addition, increasing the coupling between two model networks from low to high reveals a transition from independent intermittent oscillations to coherent intermittent oscillations. In conclusion, the model network suggests biologically plausible mechanisms for the generation of episodes of coherent intermittent ensemble oscillations with irregular spiking neurons in cortical circuits. Copyright © 2016 the American Physiological Society.

SYNCHRONIZATION OF HETEROGENEOUS OSCILLATORS UNDER NETWORK MODIFICATIONS: PERTURBATION AND OPTIMIZATION OF THE SYNCHRONY ALIGNMENT FUNCTION

Science.gov (United States)

Taylor, Dane; Skardal, Per Sebastian; Sun, Jie

2016-01-01

Synchronization is central to many complex systems in engineering physics (e.g., the power-grid, Josephson junction circuits, and electro-chemical oscillators) and biology (e.g., neuronal, circadian, and cardiac rhythms). Despite these widespread applications—for which proper functionality depends sensitively on the extent of synchronization—there remains a lack of understanding for how systems can best evolve and adapt to enhance or inhibit synchronization. We study how network modifications affect the synchronization properties of network-coupled dynamical systems that have heterogeneous node dynamics (e.g., phase oscillators with non-identical frequencies), which is often the case for real-world systems. Our approach relies on a synchrony alignment function (SAF) that quantifies the interplay between heterogeneity of the network and of the oscillators and provides an objective measure for a system’s ability to synchronize. We conduct a spectral perturbation analysis of the SAF for structural network modifications including the addition and removal of edges, which subsequently ranks the edges according to their importance to synchronization. Based on this analysis, we develop gradient-descent algorithms to efficiently solve optimization problems that aim to maximize phase synchronization via network modifications. We support these and other results with numerical experiments. PMID:27872501

The Lyapunov-Krasovskii theorem and a sufficient criterion for local stability of isochronal synchronization in networks of delay-coupled oscillators

Science.gov (United States)

Grzybowski, J. M. V.; Macau, E. E. N.; Yoneyama, T.

2017-05-01

This paper presents a self-contained framework for the stability assessment of isochronal synchronization in networks of chaotic and limit-cycle oscillators. The results were based on the Lyapunov-Krasovskii theorem and they establish a sufficient condition for local synchronization stability of as a function of the system and network parameters. With this in mind, a network of mutually delay-coupled oscillators subject to direct self-coupling is considered and then the resulting error equations are block-diagonalized for the purpose of studying their stability. These error equations are evaluated by means of analytical stability results derived from the Lyapunov-Krasovskii theorem. The proposed approach is shown to be a feasible option for the investigation of local stability of isochronal synchronization for a variety of oscillators coupled through linear functions of the state variables under a given undirected graph structure. This ultimately permits the systematic identification of stability regions within the high-dimensionality of the network parameter space. Examples of applications of the results to a number of networks of delay-coupled chaotic and limit-cycle oscillators are provided, such as Lorenz, Rössler, Cubic Chua's circuit, Van der Pol oscillator and the Hindmarsh-Rose neuron.

Epidemic Wave Dynamics Attributable to Urban Community Structure: A Theoretical Characterization of Disease Transmission in a Large Network

Science.gov (United States)

Eggo, Rosalind M; Lenczner, Michael

2015-01-01

Background Multiple waves of transmission during infectious disease epidemics represent a major public health challenge, but the ecological and behavioral drivers of epidemic resurgence are poorly understood. In theory, community structure—aggregation into highly intraconnected and loosely interconnected social groups—within human populations may lead to punctuated outbreaks as diseases progress from one community to the next. However, this explanation has been largely overlooked in favor of temporal shifts in environmental conditions and human behavior and because of the difficulties associated with estimating large-scale contact patterns. Objective The aim was to characterize naturally arising patterns of human contact that are capable of producing simulated epidemics with multiple wave structures. Methods We used an extensive dataset of proximal physical contacts between users of a public Wi-Fi Internet system to evaluate the epidemiological implications of an empirical urban contact network. We characterized the modularity (community structure) of the network and then estimated epidemic dynamics under a percolation-based model of infectious disease spread on the network. We classified simulated epidemics as multiwave using a novel metric and we identified network structures that were critical to the network’s ability to produce multiwave epidemics. Results We identified robust community structure in a large, empirical urban contact network from which multiwave epidemics may emerge naturally. This pattern was fueled by a special kind of insularity in which locally popular individuals were not the ones forging contacts with more distant social groups. Conclusions Our results suggest that ordinary contact patterns can produce multiwave epidemics at the scale of a single urban area without the temporal shifts that are usually assumed to be responsible. Understanding the role of community structure in epidemic dynamics allows officials to anticipate epidemic

Epidemic spreading in time-varying community networks

Energy Technology Data Exchange (ETDEWEB)

Ren, Guangming, E-mail: wangxy@dlut.edu.cn, E-mail: ren-guang-ming@163.com [School of Electronic and Information, Guangdong Polytechnic Normal University, Guangzhou 510665 (China); Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian 116024 (China); Wang, Xingyuan, E-mail: wangxy@dlut.edu.cn, E-mail: ren-guang-ming@163.com [Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian 116024 (China)

2014-06-15

The spreading processes of many infectious diseases have comparable time scale as the network evolution. Here, we present a simple networks model with time-varying community structure, and investigate susceptible-infected-susceptible epidemic spreading processes in this model. By both theoretic analysis and numerical simulations, we show that the efficiency of epidemic spreading in this model depends intensively on the mobility rate q of the individuals among communities. We also find that there exists a mobility rate threshold q{sub c}. The epidemic will survive when q > q{sub c} and die when q < q{sub c}. These results can help understanding the impacts of human travel on the epidemic spreading in complex networks with community structure.

Epidemic spreading in time-varying community networks

International Nuclear Information System (INIS)

Ren, Guangming; Wang, Xingyuan

2014-01-01

The spreading processes of many infectious diseases have comparable time scale as the network evolution. Here, we present a simple networks model with time-varying community structure, and investigate susceptible-infected-susceptible epidemic spreading processes in this model. By both theoretic analysis and numerical simulations, we show that the efficiency of epidemic spreading in this model depends intensively on the mobility rate q of the individuals among communities. We also find that there exists a mobility rate threshold q c . The epidemic will survive when q > q c and die when q  c . These results can help understanding the impacts of human travel on the epidemic spreading in complex networks with community structure

Overlapping community detection in networks with positive and negative links

International Nuclear Information System (INIS)

Chen, Y; Wang, X L; Yuan, B; Tang, B Z

2014-01-01

Complex networks considering both positive and negative links have gained considerable attention during the past several years. Community detection is one of the main challenges for complex network analysis. Most of the existing algorithms for community detection in a signed network aim at providing a hard-partition of the network where any node should belong to a community or not. However, they cannot detect overlapping communities where a node is allowed to belong to multiple communities. The overlapping communities widely exist in many real-world networks. In this paper, we propose a signed probabilistic mixture (SPM) model for overlapping community detection in signed networks. Compared with the existing models, the advantages of our methodology are (i) providing soft-partition solutions for signed networks; (ii) providing soft memberships of nodes. Experiments on a number of signed networks show that our SPM model: (i) can identify assortative structures or disassortative structures as the same as other state-of-the-art models; (ii) can detect overlapping communities; (iii) outperforms other state-of-the-art models at shedding light on the community detection in synthetic signed networks. (paper)

Cluster synchronization in community network with hybrid coupling

International Nuclear Information System (INIS)

Yang, Lixin; Jiang, Jun; Liu, Xiaojun

2016-01-01

Highlights: • A community network model with hybrid coupling is proposed. • Control scheme is designed via combining adaptive external coupling strength and feedback control. • The influence of topology structure on synchronization of community network is discussed. - Abstract: A general model of community network with hybrid coupling is proposed in this paper. In the community network model with hybrid coupling, the inner connections are in the same type of coupling within the same community and in different types of coupling in different communities. The connections between different pair of communities are also nonidentical. Cluster synchronization of community network with hybrid coupling is investigated via adaptive couplings control scheme. Effective controllers are designed for constructing an effective control scheme and adjusting automatically the adaptive external coupling strength by taking external coupling strength as adaptive variables on a small fraction of network edges. Moreover, the impact of the topology on the synchronizability of community network is investigated. The numerical results reveal that the number of links between communities and the degree of the connector nodes have significant effects on the synchronization performance.

Joint community and anomaly tracking in dynamic networks

OpenAIRE

Baingana, Brian; Giannakis, Georgios B.

2015-01-01

Most real-world networks exhibit community structure, a phenomenon characterized by existence of node clusters whose intra-edge connectivity is stronger than edge connectivities between nodes belonging to different clusters. In addition to facilitating a better understanding of network behavior, community detection finds many practical applications in diverse settings. Communities in online social networks are indicative of shared functional roles, or affiliation to a common socio-economic st...

Enhanced Detectability of Community Structure in Multilayer Networks through Layer Aggregation.

Science.gov (United States)

Taylor, Dane; Shai, Saray; Stanley, Natalie; Mucha, Peter J

2016-06-03

Many systems are naturally represented by a multilayer network in which edges exist in multiple layers that encode different, but potentially related, types of interactions, and it is important to understand limitations on the detectability of community structure in these networks. Using random matrix theory, we analyze detectability limitations for multilayer (specifically, multiplex) stochastic block models (SBMs) in which L layers are derived from a common SBM. We study the effect of layer aggregation on detectability for several aggregation methods, including summation of the layers' adjacency matrices for which we show the detectability limit vanishes as O(L^{-1/2}) with increasing number of layers, L. Importantly, we find a similar scaling behavior when the summation is thresholded at an optimal value, providing insight into the common-but not well understood-practice of thresholding pairwise-interaction data to obtain sparse network representations.

Large-scale network dynamics of beta-band oscillations underlie auditory perceptual decision-making

Directory of Open Access Journals (Sweden)

Mohsen Alavash

2017-06-01

Full Text Available Perceptual decisions vary in the speed at which we make them. Evidence suggests that translating sensory information into perceptual decisions relies on distributed interacting neural populations, with decision speed hinging on power modulations of the neural oscillations. Yet the dependence of perceptual decisions on the large-scale network organization of coupled neural oscillations has remained elusive. We measured magnetoencephalographic signals in human listeners who judged acoustic stimuli composed of carefully titrated clouds of tone sweeps. These stimuli were used in two task contexts, in which the participants judged the overall pitch or direction of the tone sweeps. We traced the large-scale network dynamics of the source-projected neural oscillations on a trial-by-trial basis using power-envelope correlations and graph-theoretical network discovery. In both tasks, faster decisions were predicted by higher segregation and lower integration of coupled beta-band (∼16–28 Hz oscillations. We also uncovered the brain network states that promoted faster decisions in either lower-order auditory or higher-order control brain areas. Specifically, decision speed in judging the tone sweep direction critically relied on the nodal network configurations of anterior temporal, cingulate, and middle frontal cortices. Our findings suggest that global network communication during perceptual decision-making is implemented in the human brain by large-scale couplings between beta-band neural oscillations. The speed at which we make perceptual decisions varies. This translation of sensory information into perceptual decisions hinges on dynamic changes in neural oscillatory activity. However, the large-scale neural-network embodiment supporting perceptual decision-making is unclear. We addressed this question by experimenting two auditory perceptual decision-making situations. Using graph-theoretical network discovery, we traced the large-scale network

Chimera states in two-dimensional networks of locally coupled oscillators

Science.gov (United States)

Kundu, Srilena; Majhi, Soumen; Bera, Bidesh K.; Ghosh, Dibakar; Lakshmanan, M.

2018-02-01

Chimera state is defined as a mixed type of collective state in which synchronized and desynchronized subpopulations of a network of coupled oscillators coexist and the appearance of such anomalous behavior has strong connection to diverse neuronal developments. Most of the previous studies on chimera states are not extensively done in two-dimensional ensembles of coupled oscillators by taking neuronal systems with nonlinear coupling function into account while such ensembles of oscillators are more realistic from a neurobiological point of view. In this paper, we report the emergence and existence of chimera states by considering locally coupled two-dimensional networks of identical oscillators where each node is interacting through nonlinear coupling function. This is in contrast with the existence of chimera states in two-dimensional nonlocally coupled oscillators with rectangular kernel in the coupling function. We find that the presence of nonlinearity in the coupling function plays a key role to produce chimera states in two-dimensional locally coupled oscillators. We analytically verify explicitly in the case of a network of coupled Stuart-Landau oscillators in two dimensions that the obtained results using Ott-Antonsen approach and our analytical finding very well matches with the numerical results. Next, we consider another type of important nonlinear coupling function which exists in neuronal systems, namely chemical synaptic function, through which the nearest-neighbor (locally coupled) neurons interact with each other. It is shown that such synaptic interacting function promotes the emergence of chimera states in two-dimensional lattices of locally coupled neuronal oscillators. In numerical simulations, we consider two paradigmatic neuronal oscillators, namely Hindmarsh-Rose neuron model and Rulkov map for each node which exhibit bursting dynamics. By associating various spatiotemporal behaviors and snapshots at particular times, we study the chimera

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

Science.gov (United States)

Li, Angsheng; Li, Jiankou; Pan, Yicheng

2015-02-01

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

Fast unfolding of communities in large networks

International Nuclear Information System (INIS)

Blondel, Vincent D; Guillaume, Jean-Loup; Lambiotte, Renaud; Lefebvre, Etienne

2008-01-01

We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection methods in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2 million customers and by analysing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad hoc modular networks

Bifurcation and category learning in network models of oscillating cortex

Science.gov (United States)

Baird, Bill

1990-06-01

A genetic model of oscillating cortex, which assumes “minimal” coupling justified by known anatomy, is shown to function as an associative memory, using previously developed theory. The network has explicit excitatory neurons with local inhibitory interneuron feedback that forms a set of nonlinear oscillators coupled only by long-range excitatory connections. Using a local Hebb-like learning rule for primary and higher-order synapses at the ends of the long-range connections, the system learns to store the kinds of oscillation amplitude patterns observed in olfactory and visual cortex. In olfaction, these patterns “emerge” during respiration by a pattern forming phase transition which we characterize in the model as a multiple Hopf bifurcation. We argue that these bifurcations play an important role in the operation of real digital computers and neural networks, and we use bifurcation theory to derive learning rules which analytically guarantee CAM storage of continuous periodic sequences-capacity: N/2 Fourier components for an N-node network-no “spurious” attractors.

An Overlapping Communities Detection Algorithm via Maxing Modularity in Opportunistic Networks

Directory of Open Access Journals (Sweden)

Gao Zhi-Peng

2016-01-01

Full Text Available Community detection in opportunistic networks has been a significant and hot issue, which is used to understand characteristics of networks through analyzing structure of it. Community is used to represent a group of nodes in a network where nodes inside the community have more internal connections than external connections. However, most of the existing community detection algorithms focus on binary networks or disjoint community detection. In this paper, we propose a novel algorithm via maxing modularity of communities (MMCto find overlapping community structure in opportunistic networks. It utilizes contact history of nodes to calculate the relation intensity between nodes. It finds nodes with high relation intensity as the initial community and extend the community with nodes of higher belong degree. The algorithm achieves a rapid and efficient overlapping community detection method by maxing the modularity of community continuously. The experiments prove that MMC is effective for uncovering overlapping communities and it achieves better performance than COPRA and Conductance.

Understanding the structure of community collaboration: the case of one Canadian health promotion network.

Science.gov (United States)

Barnes, Martha; Maclean, Joanne; Cousens, Laura

2010-06-01

In 2004, over 6.8 million Canadians were considered overweight, with an additional 2.4 million labeled clinically obese. Due to these escalating levels of obesity in Canada, physical activity is being championed by politicians, physicians, educators and community members as a means to address this health crisis. In doing so, many organizations are being called upon to provide essential physical activity services and programs to combat rising obesity rates. Yet, strategies for achieving these organizations' mandates, which invariably involve stretching already scarce resources, are difficult to implement and sustain. One strategy for improving the health and physical activity levels of people in communities has been the creation of inter-organizational networks of service providers. Yet, little is known about whether networks are effective in addressing policy issues in non-clinical health settings. The purpose of this investigation was 2-fold; to use whole network analysis to determine the structure of one health promotion network in Canada, and to identify the types of ties shared by actors in the health network. Findings revealed a network wherein information sharing constituted the basis for collaboration, whereas efforts related to sharing resources, marketing and/or fundraising endeavors were less evident.

Hippocampal network oscillations in APP/APLP2-deficient mice.

Directory of Open Access Journals (Sweden)

Xiaomin Zhang

Full Text Available The physiological function of amyloid precursor protein (APP and its two homologues APP-like protein 1 (APLP1 and 2 (APLP2 is largely unknown. Previous work suggests that lack of APP or APLP2 impairs synaptic plasticity and spatial learning. There is, however, almost no data on the role of APP or APLP at the network level which forms a critical interface between cellular functions and behavior. We have therefore investigated memory-related synaptic and network functions in hippocampal slices from three lines of transgenic mice: APPsα-KI (mice expressing extracellular fragment of APP, corresponding to the secreted APPsα ectodomain, APLP2-KO, and combined APPsα-KI/APLP2-KO (APPsα-DM for "double mutants". We analyzed two prominent patterns of network activity, gamma oscillations and sharp-wave ripple complexes (SPW-R. Both patterns were generally preserved in all strains. We find, however, a significantly reduced frequency of gamma oscillations in CA3 of APLP2-KO mice in comparison to APPsα-KI and WT mice. Network activity, basic synaptic transmission and short-term plasticity were unaltered in the combined mutants (APPsα-DM which showed, however, reduced long-term potentiation (LTP. Together, our data indicate that APLP2 and the intracellular domain of APP are not essential for coherent activity patterns in the hippocampus, but have subtle effects on synaptic plasticity and fine-tuning of network oscillations.

Energy Spectral Behaviors of Communication Networks of Open-Source Communities.

Directory of Open Access Journals (Sweden)

Jianmei Yang

Full Text Available Large-scale online collaborative production activities in open-source communities must be accompanied by large-scale communication activities. Nowadays, the production activities of open-source communities, especially their communication activities, have been more and more concerned. Take CodePlex C # community for example, this paper constructs the complex network models of 12 periods of communication structures of the community based on real data; then discusses the basic concepts of quantum mapping of complex networks, and points out that the purpose of the mapping is to study the structures of complex networks according to the idea of quantum mechanism in studying the structures of large molecules; finally, according to this idea, analyzes and compares the fractal features of the spectra in different quantum mappings of the networks, and concludes that there are multiple self-similarity and criticality in the communication structures of the community. In addition, this paper discusses the insights and application conditions of different quantum mappings in revealing the characteristics of the structures. The proposed quantum mapping method can also be applied to the structural studies of other large-scale organizations.

Chaotic itinerancy within the coupled dynamics between a physical body and neural oscillator networks.

Science.gov (United States)

Park, Jihoon; Mori, Hiroki; Okuyama, Yuji; Asada, Minoru

2017-01-01

Chaotic itinerancy is a phenomenon in which the state of a nonlinear dynamical system spontaneously explores and attracts certain states in a state space. From this perspective, the diverse behavior of animals and its spontaneous transitions lead to a complex coupled dynamical system, including a physical body and a brain. Herein, a series of simulations using different types of non-linear oscillator networks (i.e., regular, small-world, scale-free, random) with a musculoskeletal model (i.e., a snake-like robot) as a physical body are conducted to understand how the chaotic itinerancy of bodily behavior emerges from the coupled dynamics between the body and the brain. A behavior analysis (behavior clustering) and network analysis for the classified behavior are then applied. The former consists of feature vector extraction from the motions and classification of the movement patterns that emerged from the coupled dynamics. The network structures behind the classified movement patterns are revealed by estimating the "information networks" different from the given non-linear oscillator networks based on the transfer entropy which finds the information flow among neurons. The experimental results show that: (1) the number of movement patterns and their duration depend on the sensor ratio to control the balance of strength between the body and the brain dynamics and on the type of the given non-linear oscillator networks; and (2) two kinds of information networks are found behind two kinds movement patterns with different durations by utilizing the complex network measures, clustering coefficient and the shortest path length with a negative and a positive relationship with the duration periods of movement patterns. The current results seem promising for a future extension of the method to a more complicated body and environment. Several requirements are also discussed.

Chaotic itinerancy within the coupled dynamics between a physical body and neural oscillator networks.

Directory of Open Access Journals (Sweden)

Jihoon Park

Full Text Available Chaotic itinerancy is a phenomenon in which the state of a nonlinear dynamical system spontaneously explores and attracts certain states in a state space. From this perspective, the diverse behavior of animals and its spontaneous transitions lead to a complex coupled dynamical system, including a physical body and a brain. Herein, a series of simulations using different types of non-linear oscillator networks (i.e., regular, small-world, scale-free, random with a musculoskeletal model (i.e., a snake-like robot as a physical body are conducted to understand how the chaotic itinerancy of bodily behavior emerges from the coupled dynamics between the body and the brain. A behavior analysis (behavior clustering and network analysis for the classified behavior are then applied. The former consists of feature vector extraction from the motions and classification of the movement patterns that emerged from the coupled dynamics. The network structures behind the classified movement patterns are revealed by estimating the "information networks" different from the given non-linear oscillator networks based on the transfer entropy which finds the information flow among neurons. The experimental results show that: (1 the number of movement patterns and their duration depend on the sensor ratio to control the balance of strength between the body and the brain dynamics and on the type of the given non-linear oscillator networks; and (2 two kinds of information networks are found behind two kinds movement patterns with different durations by utilizing the complex network measures, clustering coefficient and the shortest path length with a negative and a positive relationship with the duration periods of movement patterns. The current results seem promising for a future extension of the method to a more complicated body and environment. Several requirements are also discussed.

Network Community Detection on Metric Space

Directory of Open Access Journals (Sweden)

Suman Saha

2015-08-01

Full Text Available Community detection in a complex network is an important problem of much interest in recent years. In general, a community detection algorithm chooses an objective function and captures the communities of the network by optimizing the objective function, and then, one uses various heuristics to solve the optimization problem to extract the interesting communities for the user. In this article, we demonstrate the procedure to transform a graph into points of a metric space and develop the methods of community detection with the help of a metric defined for a pair of points. We have also studied and analyzed the community structure of the network therein. The results obtained with our approach are very competitive with most of the well-known algorithms in the literature, and this is justified over the large collection of datasets. On the other hand, it can be observed that time taken by our algorithm is quite less compared to other methods and justifies the theoretical findings.

Detecting and evaluating communities in complex human and biological networks

Science.gov (United States)

Morrison, Greg; Mahadevan, L.

2012-02-01

We develop a simple method for detecting the community structure in a network can by utilizing a measure of closeness between nodes. This approach readily leads to a method of coarse graining the network, which allows the detection of the natural hierarchy (or hierarchies) of community structure without appealing to an unknown resolution parameter. The closeness measure can also be used to evaluate the robustness of an individual node's assignment to its community (rather than evaluating only the quality of the global structure). Each of these methods in community detection and evaluation are illustrated using a variety of real world networks of either biological or sociological importance and illustrate the power and flexibility of the approach.

Community Core Evolution in Mobile Social Networks

Directory of Open Access Journals (Sweden)

Hao Xu

2013-01-01

Full Text Available Community detection in social networks attracts a lot of attention in the recent years. Existing methods always depict the relationship of two nodes using the temporary connection. However, these temporary connections cannot be fully recognized as the real relationships when the history connections among nodes are considered. For example, a casual visit in Facebook cannot be seen as an establishment of friendship. Hence, our question is the following: how to cluster the real friends in mobile social networks? In this paper, we study the problem of detecting the stable community core in mobile social networks. The cumulative stable contact is proposed to depict the relationship among nodes. The whole process is divided into timestamps. Nodes and their connections can be added or removed at each timestamp, and historical contacts are considered when detecting the community core. Also, community cores can be tracked through the incremental computing, which can help to recognize the evolving of community structure. Empirical studies on real-world social networks demonstrate that our proposed method can effectively detect stable community cores in mobile social networks.

Community core evolution in mobile social networks.

Science.gov (United States)

Xu, Hao; Xiao, Weidong; Tang, Daquan; Tang, Jiuyang; Wang, Zhenwen

2013-01-01

Community detection in social networks attracts a lot of attention in the recent years. Existing methods always depict the relationship of two nodes using the temporary connection. However, these temporary connections cannot be fully recognized as the real relationships when the history connections among nodes are considered. For example, a casual visit in Facebook cannot be seen as an establishment of friendship. Hence, our question is the following: how to cluster the real friends in mobile social networks? In this paper, we study the problem of detecting the stable community core in mobile social networks. The cumulative stable contact is proposed to depict the relationship among nodes. The whole process is divided into timestamps. Nodes and their connections can be added or removed at each timestamp, and historical contacts are considered when detecting the community core. Also, community cores can be tracked through the incremental computing, which can help to recognize the evolving of community structure. Empirical studies on real-world social networks demonstrate that our proposed method can effectively detect stable community cores in mobile social networks.

Network structure detection and analysis of Shanghai stock market

Directory of Open Access Journals (Sweden)

Sen Wu

2015-04-01

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

Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions

Science.gov (United States)

Bick, Christian; Sebek, Michael; Kiss, István Z.

2017-10-01

We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.

An Efficient Hierarchy Algorithm for Community Detection in Complex Networks

Directory of Open Access Journals (Sweden)

Lili Zhang

2014-01-01

Full Text Available Community structure is one of the most fundamental and important topology characteristics of complex networks. The research on community structure has wide applications and is very important for analyzing the topology structure, understanding the functions, finding the hidden properties, and forecasting the time-varying of the networks. This paper analyzes some related algorithms and proposes a new algorithm—CN agglomerative algorithm based on graph theory and the local connectedness of network to find communities in network. We show this algorithm is distributed and polynomial; meanwhile the simulations show it is accurate and fine-grained. Furthermore, we modify this algorithm to get one modified CN algorithm and apply it to dynamic complex networks, and the simulations also verify that the modified CN algorithm has high accuracy too.

Metacommunity theory as a multispecies, multiscale framework for studying the influence of river network structure on riverine communities and ecosystems

Science.gov (United States)

Brown, B.L.; Swan, C.M.; Auerbach, D.A.; Campbell, Grant E.H.; Hitt, N.P.; Maloney, K.O.; Patrick, C.

2011-01-01

Explaining the mechanisms underlying patterns of species diversity and composition in riverine networks is challenging. Historically, community ecologists have conceived of communities as largely isolated entities and have focused on local environmental factors and interspecific interactions as the major forces determining species composition. However, stream ecologists have long embraced a multiscale approach to studying riverine ecosystems and have studied both local factors and larger-scale regional factors, such as dispersal and disturbance. River networks exhibit a dendritic spatial structure that can constrain aquatic organisms when their dispersal is influenced by or confined to the river network. We contend that the principles of metacommunity theory would help stream ecologists to understand how the complex spatial structure of river networks mediates the relative influences of local and regional control on species composition. From a basic ecological perspective, the concept is attractive because new evidence suggests that the importance of regional processes (dispersal) depends on spatial structure of habitat and on connection to the regional species pool. The role of local factors relative to regional factors will vary with spatial position in a river network. From an applied perspective, the long-standing view in ecology that local community composition is an indicator of habitat quality may not be uniformly applicable across a river network, but the strength of such bioassessment approaches probably will depend on spatial position in the network. The principles of metacommunity theory are broadly applicable across taxa and systems but seem of particular consequence to stream ecology given the unique spatial structure of riverine systems. By explicitly embracing processes at multiple spatial scales, metacommunity theory provides a foundation on which to build a richer understanding of stream communities.

Distributed detection of communities in complex networks using synthetic coordinates

International Nuclear Information System (INIS)

Papadakis, H; Fragopoulou, P; Panagiotakis, C

2014-01-01

Various applications like finding Web communities, detecting the structure of social networks, and even analyzing a graph’s structure to uncover Internet attacks are just some of the applications for which community detection is important. In this paper, we propose an algorithm that finds the entire community structure of a network, on the basis of local interactions between neighboring nodes and an unsupervised distributed hierarchical clustering algorithm. The novelty of the proposed approach, named SCCD (standing for synthetic coordinate community detection), lies in the fact that the algorithm is based on the use of Vivaldi synthetic network coordinates computed by a distributed algorithm. The current paper not only presents an efficient distributed community finding algorithm, but also demonstrates that synthetic network coordinates could be used to derive efficient solutions to a variety of problems. Experimental results and comparisons with other methods from the literature are presented for a variety of benchmark graphs with known community structure, derived from varying a number of graph parameters and real data set graphs. The experimental results and comparisons to existing methods with similar computation cost on real and synthetic data sets demonstrate the high performance and robustness of the proposed scheme. (paper)

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

Science.gov (United States)

Darmon, David; Omodei, Elisa; Garland, Joshua

2015-01-01

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

Pacemaker neuron and network oscillations depend on a neuromodulator-regulated linear current

Directory of Open Access Journals (Sweden)

Shunbing Zhao

2010-05-01

Full Text Available Linear leak currents have been implicated in the regulation of neuronal excitability, generation of neuronal and network oscillations, and network state transitions. Yet, few studies have directly tested the dependence of network oscillations on leak currents or explored the role of leak currents on network activity. In the oscillatory pyloric network of decapod crustaceans neuromodulatory inputs are necessary for pacemaker activity. A large subset of neuromodulators is known to activate a single voltage-gated inward current IMI, which has been shown to regulate the rhythmic activity of the network and its pacemaker neurons. Using the dynamic clamp technique, we show that the crucial component of IMI for the generation of oscillatory activity is only a close-to-linear portion of the current-voltage relationship. The nature of this conductance is such that the presence or the absence of neuromodulators effectively regulates the amount of leak current and the input resistance in the pacemaker neurons. When deprived of neuromodulatory inputs, pyloric oscillations are disrupted; yet, a linear reduction of the total conductance in a single neuron within the pacemaker group recovers not only the pacemaker activity in that neuron, but also leads to a recovery of oscillations in the entire pyloric network. The recovered activity produces proper frequency and phasing that is similar to that induced by neuromodulators. These results show that the passive properties of pacemaker neurons can significantly affect their capacity to generate and regulate the oscillatory activity of an entire network, and that this feature is exploited by neuromodulatory inputs.

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

Science.gov (United States)

Yang, Jin-Xuan; Zhang, Xiao-Dong

2017-08-01

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

Emergence of communities and diversity in social networks.

Science.gov (United States)

Han, Xiao; Cao, Shinan; Shen, Zhesi; Zhang, Boyu; Wang, Wen-Xu; Cressman, Ross; Stanley, H Eugene

2017-03-14

Communities are common in complex networks and play a significant role in the functioning of social, biological, economic, and technological systems. Despite widespread interest in detecting community structures in complex networks and exploring the effect of communities on collective dynamics, a deep understanding of the emergence and prevalence of communities in social networks is still lacking. Addressing this fundamental problem is of paramount importance in understanding, predicting, and controlling a variety of collective behaviors in society. An elusive question is how communities with common internal properties arise in social networks with great individual diversity. Here, we answer this question using the ultimatum game, which has been a paradigm for characterizing altruism and fairness. We experimentally show that stable local communities with different internal agreements emerge spontaneously and induce social diversity into networks, which is in sharp contrast to populations with random interactions. Diverse communities and social norms come from the interaction between responders with inherent heterogeneous demands and rational proposers via local connections, where the former eventually become the community leaders. This result indicates that networks are significant in the emergence and stabilization of communities and social diversity. Our experimental results also provide valuable information about strategies for developing network models and theories of evolutionary games and social dynamics.

Traveling salesman problems with PageRank Distance on complex networks reveal community structure

Science.gov (United States)

Jiang, Zhongzhou; Liu, Jing; Wang, Shuai

2016-12-01

In this paper, we propose a new algorithm for community detection problems (CDPs) based on traveling salesman problems (TSPs), labeled as TSP-CDA. Since TSPs need to find a tour with minimum cost, cities close to each other are usually clustered in the tour. This inspired us to model CDPs as TSPs by taking each vertex as a city. Then, in the final tour, the vertices in the same community tend to cluster together, and the community structure can be obtained by cutting the tour into a couple of paths. There are two challenges. The first is to define a suitable distance between each pair of vertices which can reflect the probability that they belong to the same community. The second is to design a suitable strategy to cut the final tour into paths which can form communities. In TSP-CDA, we deal with these two challenges by defining a PageRank Distance and an automatic threshold-based cutting strategy. The PageRank Distance is designed with the intrinsic properties of CDPs in mind, and can be calculated efficiently. In the experiments, benchmark networks with 1000-10,000 nodes and varying structures are used to test the performance of TSP-CDA. A comparison is also made between TSP-CDA and two well-established community detection algorithms. The results show that TSP-CDA can find accurate community structure efficiently and outperforms the two existing algorithms.

Global Electricity Trade Network: Structures and Implications

Science.gov (United States)

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

2016-01-01

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

Complex networks from experimental horizontal oil–water flows: Community structure detection versus flow pattern discrimination

International Nuclear Information System (INIS)

Gao, Zhong-Ke; Fang, Peng-Cheng; Ding, Mei-Shuang; Yang, Dan; Jin, Ning-De

2015-01-01

We propose a complex network-based method to distinguish complex patterns arising from experimental horizontal oil–water two-phase flow. We first use the adaptive optimal kernel time–frequency representation (AOK TFR) to characterize flow pattern behaviors from the energy and frequency point of view. Then, we infer two-phase flow complex networks from experimental measurements and detect the community structures associated with flow patterns. The results suggest that the community detection in two-phase flow complex network allows objectively discriminating complex horizontal oil–water flow patterns, especially for the segregated and dispersed flow patterns, a task that existing method based on AOK TFR fails to work. - Highlights: • We combine time–frequency analysis and complex network to identify flow patterns. • We explore the transitional flow behaviors in terms of betweenness centrality. • Our analysis provides a novel way for recognizing complex flow patterns. • Broader applicability of our method is demonstrated and articulated

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

Science.gov (United States)

Zhu, Zhenyu; Wang, Rubin; Zhu, Fengyun

2018-01-01

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

Modeling information diffusion in time-varying community networks

Science.gov (United States)

Cui, Xuelian; Zhao, Narisa

2017-12-01

Social networks are rarely static, and they typically have time-varying network topologies. A great number of studies have modeled temporal networks and explored social contagion processes within these models; however, few of these studies have considered community structure variations. In this paper, we present a study of how the time-varying property of a modular structure influences the information dissemination. First, we propose a continuous-time Markov model of information diffusion where two parameters, mobility rate and community attractiveness, are introduced to address the time-varying nature of the community structure. The basic reproduction number is derived, and the accuracy of this model is evaluated by comparing the simulation and theoretical results. Furthermore, numerical results illustrate that generally both the mobility rate and community attractiveness significantly promote the information diffusion process, especially in the initial outbreak stage. Moreover, the strength of this promotion effect is much stronger when the modularity is higher. Counterintuitively, it is found that when all communities have the same attractiveness, social mobility no longer accelerates the diffusion process. In addition, we show that the local spreading in the advantage group has been greatly enhanced due to the agglomeration effect caused by the social mobility and community attractiveness difference, which thus increases the global spreading.

Synchronization and symmetry-breaking bifurcations in constructive networks of coupled chaotic oscillators

International Nuclear Information System (INIS)

Jiang Yu; Lozada-Cassou, M.; Vinet, A.

2003-01-01

The spatiotemporal dynamics of networks based on a ring of coupled oscillators with regular shortcuts beyond the nearest-neighbor couplings is studied by using master stability equations and numerical simulations. The generic criterion for dynamic synchronization has been extended to arbitrary network topologies with zero row-sum. The symmetry-breaking oscillation patterns that resulted from the Hopf bifurcation from synchronous states are analyzed by the symmetry group theory

Dependence of synchronization frequency of Kuramoto oscillators on symmetry of intrinsic frequency in ring network

Science.gov (United States)

Saha, Arindam; Amritkar, R. E.

2014-12-01

Kuramoto oscillators have been proposed earlier as a model for interacting systems that exhibit synchronisation. In this article we study the difference between networks with symmetric and asymmetric distribution of natural frequencies. We first indicate that the synchronisation frequency of the oscillators is independent of the natural frequency distribution for a completely connected network. Further we analyse the case of oscillators in a directed ring-network where asymmetry in the natural frequency distribution is seen to shift the synchronisation frequency of the network. We also present an estimate of the shift in the frequencies for slightly asymmetric distributions.

Finding Community Structures In Social Activity Data

KAUST Repository

Peng, Chengbin

2015-01-01

Social activity data sets are increasing in number and volume. Finding community structure in such data is valuable in many applications. For example, understand- ing the community structure of social networks may reduce the spread of epidemics

Explosive transitions to synchronization in networks of phase oscillators.

Science.gov (United States)

Leyva, I; Navas, A; Sendiña-Nadal, I; Almendral, J A; Buldú, J M; Zanin, M; Papo, D; Boccaletti, S

2013-01-01

The emergence of dynamical abrupt transitions in the macroscopic state of a system is currently a subject of the utmost interest. The occurrence of a first-order phase transition to synchronization of an ensemble of networked phase oscillators was reported, so far, for very particular network architectures. Here, we show how a sharp, discontinuous transition can occur, instead, as a generic feature of networks of phase oscillators. Precisely, we set conditions for the transition from unsynchronized to synchronized states to be first-order, and demonstrate how these conditions can be attained in a very wide spectrum of situations. We then show how the occurrence of such transitions is always accompanied by the spontaneous setting of frequency-degree correlation features. Third, we show that the conditions for abrupt transitions can be even softened in several cases. Finally, we discuss, as a possible application, the use of this phenomenon to express magnetic-like states of synchronization.

Braess's paradox in oscillator networks, desynchronization and power outage

International Nuclear Information System (INIS)

Witthaut, Dirk; Timme, Marc

2012-01-01

Robust synchronization is essential to ensure the stable operation of many complex networked systems such as electric power grids. Increasing energy demands and more strongly distributing power sources raise the question of where to add new connection lines to the already existing grid. Here we study how the addition of individual links impacts the emergence of synchrony in oscillator networks that model power grids on coarse scales. We reveal that adding new links may not only promote but also destroy synchrony and link this counter-intuitive phenomenon to Braess's paradox known for traffic networks. We analytically uncover its underlying mechanism in an elementary grid example, trace its origin to geometric frustration in phase oscillators, and show that it generically occurs across a wide range of systems. As an important consequence, upgrading the grid requires particular care when adding new connections because some may destabilize the synchronization of the grid—and thus induce power outages. (paper)

Noise promotes independent control of gamma oscillations and grid firing within recurrent attractor networks

Science.gov (United States)

Solanka, Lukas; van Rossum, Mark CW; Nolan, Matthew F

2015-01-01

Neural computations underlying cognitive functions require calibration of the strength of excitatory and inhibitory synaptic connections and are associated with modulation of gamma frequency oscillations in network activity. However, principles relating gamma oscillations, synaptic strength and circuit computations are unclear. We address this in attractor network models that account for grid firing and theta-nested gamma oscillations in the medial entorhinal cortex. We show that moderate intrinsic noise massively increases the range of synaptic strengths supporting gamma oscillations and grid computation. With moderate noise, variation in excitatory or inhibitory synaptic strength tunes the amplitude and frequency of gamma activity without disrupting grid firing. This beneficial role for noise results from disruption of epileptic-like network states. Thus, moderate noise promotes independent control of multiplexed firing rate- and gamma-based computational mechanisms. Our results have implications for tuning of normal circuit function and for disorders associated with changes in gamma oscillations and synaptic strength. DOI: http://dx.doi.org/10.7554/eLife.06444.001 PMID:26146940

Finding Community Structures In Social Activity Data

KAUST Repository

Peng, Chengbin

2015-05-19

Social activity data sets are increasing in number and volume. Finding community structure in such data is valuable in many applications. For example, understand- ing the community structure of social networks may reduce the spread of epidemics or boost advertising revenue; discovering partitions in tra c networks can help to optimize routing and to reduce congestion; finding a group of users with common interests can allow a system to recommend useful items. Among many aspects, qual- ity of inference and e ciency in finding community structures in such data sets are of paramount concern. In this thesis, we propose several approaches to improve com- munity detection in these aspects. The first approach utilizes the concept of K-cores to reduce the size of the problem. The K-core of a graph is the largest subgraph within which each node has at least K connections. We propose a framework that accelerates community detection. It first applies a traditional algorithm that is relatively slow to the K-core, and then uses a fast heuristic to infer community labels for the remaining nodes. The second approach is to scale the algorithm to multi-processor systems. We de- vise a scalable community detection algorithm for large networks based on stochastic block models. It is an alternating iterative algorithm using a maximum likelihood ap- proach. Compared with traditional inference algorithms for stochastic block models, our algorithm can scale to large networks and run on multi-processor systems. The time complexity is linear in the number of edges of the input network. The third approach is to improve the quality. We propose a framework for non- negative matrix factorization that allows the imposition of linear or approximately linear constraints on each factor. An example of the applications is to find community structures in bipartite networks, which is useful in recommender systems. Our algorithms are compared with the results in recent papers and their quality and e

Identifying and characterizing key nodes among communities based on electrical-circuit networks.

Science.gov (United States)

Zhu, Fenghui; Wang, Wenxu; Di, Zengru; Fan, Ying

2014-01-01

Complex networks with community structures are ubiquitous in the real world. Despite many approaches developed for detecting communities, we continue to lack tools for identifying overlapping and bridging nodes that play crucial roles in the interactions and communications among communities in complex networks. Here we develop an algorithm based on the local flow conservation to effectively and efficiently identify and distinguish the two types of nodes. Our method is applicable in both undirected and directed networks without a priori knowledge of the community structure. Our method bypasses the extremely challenging problem of partitioning communities in the presence of overlapping nodes that may belong to multiple communities. Due to the fact that overlapping and bridging nodes are of paramount importance in maintaining the function of many social and biological networks, our tools open new avenues towards understanding and controlling real complex networks with communities accompanied with the key nodes.

Exploring network structure, dynamics, and function using networkx

Energy Technology Data Exchange (ETDEWEB)

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

2008-01-01

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

The relations between network-operation and topological-property in a scale-free and small-world network with community structure

Science.gov (United States)

Ma, Fei; Yao, Bing

2017-10-01

It is always an open, demanding and difficult task for generating available model to simulate dynamical functions and reveal inner principles from complex systems and networks. In this article, due to lots of real-life and artificial networks are built from series of simple and small groups (components), we discuss some interesting and helpful network-operation to generate more realistic network models. In view of community structure (modular topology), we present a class of sparse network models N(t , m) . At the moment, we capture the fact the N(t , 4) has not only scale-free feature, which means that the probability that a randomly selected vertex with degree k decays as a power-law, following P(k) ∼k-γ, where γ is the degree exponent, but also small-world property, which indicates that the typical distance between two uniform randomly chosen vertices grows proportionally to logarithm of the order of N(t , 4) , namely, relatively shorter diameter and lower average path length, simultaneously displays higher clustering coefficient. Next, as a new topological parameter correlating to reliability, synchronization capability and diffusion properties of networks, the number of spanning trees over a network is studied in more detail, an exact analytical solution for the number of spanning trees of the N(t , 4) is obtained. Based on the network-operation, part hub-vertex linking with each other will be helpful for structuring various network models and investigating the rules related with real-life networks.

Experimental synchronization of chaos in a large ring of mutually coupled single-transistor oscillators: Phase, amplitude, and clustering effects

Energy Technology Data Exchange (ETDEWEB)

Minati, Ludovico, E-mail: lminati@ieee.org, E-mail: ludovico.minati@unitn.it [MR-Lab, Center for Mind/Brain Science, University of Trento, Italy and Scientific Department, Fondazione IRCCS Istituto Neurologico Carlo Besta, Milan (Italy)

2014-12-01

In this paper, experimental evidence of multiple synchronization phenomena in a large (n = 30) ring of chaotic oscillators is presented. Each node consists of an elementary circuit, generating spikes of irregular amplitude and comprising one bipolar junction transistor, one capacitor, two inductors, and one biasing resistor. The nodes are mutually coupled to their neighbours via additional variable resistors. As coupling resistance is decreased, phase synchronization followed by complete synchronization is observed, and onset of synchronization is associated with partial synchronization, i.e., emergence of communities (clusters). While component tolerances affect community structure, the general synchronization properties are maintained across three prototypes and in numerical simulations. The clusters are destroyed by adding long distance connections with distant notes, but are otherwise relatively stable with respect to structural connectivity changes. The study provides evidence that several fundamental synchronization phenomena can be reliably observed in a network of elementary single-transistor oscillators, demonstrating their generative potential and opening way to potential applications of this undemanding setup in experimental modelling of the relationship between network structure, synchronization, and dynamical properties.

Experimental synchronization of chaos in a large ring of mutually coupled single-transistor oscillators: Phase, amplitude, and clustering effects

International Nuclear Information System (INIS)

Minati, Ludovico

2014-01-01

In this paper, experimental evidence of multiple synchronization phenomena in a large (n = 30) ring of chaotic oscillators is presented. Each node consists of an elementary circuit, generating spikes of irregular amplitude and comprising one bipolar junction transistor, one capacitor, two inductors, and one biasing resistor. The nodes are mutually coupled to their neighbours via additional variable resistors. As coupling resistance is decreased, phase synchronization followed by complete synchronization is observed, and onset of synchronization is associated with partial synchronization, i.e., emergence of communities (clusters). While component tolerances affect community structure, the general synchronization properties are maintained across three prototypes and in numerical simulations. The clusters are destroyed by adding long distance connections with distant notes, but are otherwise relatively stable with respect to structural connectivity changes. The study provides evidence that several fundamental synchronization phenomena can be reliably observed in a network of elementary single-transistor oscillators, demonstrating their generative potential and opening way to potential applications of this undemanding setup in experimental modelling of the relationship between network structure, synchronization, and dynamical properties

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

Directory of Open Access Journals (Sweden)

Yu Sun

2017-11-01

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

Tuning the synchronization of a network of weakly coupled self-oscillating gels via capacitors

Science.gov (United States)

Fang, Yan; Yashin, Victor V.; Dickerson, Samuel J.; Balazs, Anna C.

2018-05-01

We consider a network of coupled oscillating units, where each unit comprises a self-oscillating polymer gel undergoing the Belousov-Zhabotinsky (BZ) reaction and an overlaying piezoelectric (PZ) cantilever. Through chemo-mechano-electrical coupling, the oscillations of the networked BZ-PZ units achieve in-phase or anti-phase synchronization, enabling, for example, the storage of information within the system. Herein, we develop numerical and computational models to show that the introduction of capacitors into the BZ-PZ system enhances the dynamical behavior of the oscillating network by yielding additional stable synchronization modes. We specifically show that the capacitors lead to a redistribution of charge in the system and alteration of the force that the PZ cantilevers apply to the underlying gel. Hence, the capacitors modify the strength of the coupling between the oscillators in the network. We utilize a linear stability analysis to determine the phase behavior of BZ-PZ networks encompassing different capacitances, force polarities, and number of units and then verify our findings with numerical simulations. Thus, through analytical calculations and numerical simulations, we determine the impact of the capacitors on the existence of the synchronization modes, their stability, and the rate of synchronization within these complex dynamical systems. The findings from our study can be used to design robotic materials that harness the materials' intrinsic, responsive properties to perform such functions as sensing, actuation, and information storage.

Mesoscopic structure conditions the emergence of cooperation on social networks.

Directory of Open Access Journals (Sweden)

Sergi Lozano

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

Mesoscopic structure conditions the emergence of cooperation on social networks

Energy Technology Data Exchange (ETDEWEB)

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

2008-12-01

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

Urban ecological stewardship: understanding the structure, function and network of community-based urban land management

Science.gov (United States)

Erika s. Svendsen; Lindsay K. Campbell

2008-01-01

Urban environmental stewardship activities are on the rise in cities throughout the Northeast. Groups participating in stewardship activities range in age, size, and geography and represent an increasingly complex and dynamic arrangement of civil society, government and business sectors. To better understand the structure, function and network of these community-based...

Heuristic Artificial Bee Colony Algorithm for Uncovering Community in Complex Networks

Directory of Open Access Journals (Sweden)

Yuquan Guo

2017-01-01

Full Text Available Community structure is important for us to understand the functions and structure of the complex networks. In this paper, Heuristic Artificial Bee Colony (HABC algorithm based on swarm intelligence is proposed for uncovering community. The proposed HABC includes initialization, employed bee searching, onlooker searching, and scout bee searching. In initialization stage, the nectar sources with simple community structure are generated through network dynamic algorithm associated with complete subgraph. In employed bee searching and onlooker searching stages, the searching function is redefined to address the community problem. The efficiency of searching progress can be improved by a heuristic function which is an average agglomerate probability of two neighbor communities. Experiments are carried out on artificial and real world networks, and the results demonstrate that HABC will have better performance in terms of comparing with the state-of-the-art algorithms.

Global Exponential Stability of Periodic Oscillation for Nonautonomous BAM Neural Networks with Distributed Delay

Directory of Open Access Journals (Sweden)

Hongli Liu

2009-01-01

Full Text Available We derive a new criterion for checking the global stability of periodic oscillation of bidirectional associative memory (BAM neural networks with periodic coefficients and distributed delay, and find that the criterion relies on the Lipschitz constants of the signal transmission functions, weights of the neural network, and delay kernels. The proposed model transforms the original interacting network into matrix analysis problem which is easy to check, thereby significantly reducing the computational complexity and making analysis of periodic oscillation for even large-scale networks.

Game theory and extremal optimization for community detection in complex dynamic networks.

Science.gov (United States)

Lung, Rodica Ioana; Chira, Camelia; Andreica, Anca

2014-01-01

The detection of evolving communities in dynamic complex networks is a challenging problem that recently received attention from the research community. Dynamics clearly add another complexity dimension to the difficult task of community detection. Methods should be able to detect changes in the network structure and produce a set of community structures corresponding to different timestamps and reflecting the evolution in time of network data. We propose a novel approach based on game theory elements and extremal optimization to address dynamic communities detection. Thus, the problem is formulated as a mathematical game in which nodes take the role of players that seek to choose a community that maximizes their profit viewed as a fitness function. Numerical results obtained for both synthetic and real-world networks illustrate the competitive performance of this game theoretical approach.

Effect of size heterogeneity on community identification in complex networks

Energy Technology Data Exchange (ETDEWEB)

Danon, L.; Diaz-Guilera, A.; Arenas, A.

2008-01-01

Identifying community structure can be a potent tool in the analysis and understanding of the structure of complex networks. Up to now, methods for evaluating the performance of identification algorithms use ad-hoc networks with communities of equal size. We show that inhomogeneities in community sizes can and do affect the performance of algorithms considerably, and propose an alternative method which takes these factors into account. Furthermore, we propose a simple modification of the algorithm proposed by Newman for community detection (Phys. Rev. E 69 066133) which treats communities of different sizes on an equal footing, and show that it outperforms the original algorithm while retaining its speed.

Extracting weights from edge directions to find communities in directed networks

International Nuclear Information System (INIS)

Lai, Darong; Lu, Hongtao; Nardini, Christine

2010-01-01

Community structures are found to exist ubiquitously in real-world complex networks. We address here the problem of community detection in directed networks. Most of the previous literature ignores edge directions and applies methods designed for community detection in undirected networks, which discards valuable information and often fails when different communities are defined on the basis of incoming and outgoing edges. We suggest extracting information about edge directions using a PageRank random walk and translating such information into edge weights. After extraction we obtain a new weighted directed network in which edge directions can then be safely ignored. We thus transform community detection in directed networks into community detection in reweighted undirected networks. Such an approach can benefit directly from the large volume of algorithms for the detection of communities in undirected networks already developed, since it is not obvious how to extend these algorithms to account for directed networks and the procedure is often difficult. Validations on synthetic and real-world networks demonstrate that the proposed framework can effectively detect communities in directed networks

Building research infrastructure in community health centers: a Community Health Applied Research Network (CHARN) report.

Science.gov (United States)

Likumahuwa, Sonja; Song, Hui; Singal, Robbie; Weir, Rosy Chang; Crane, Heidi; Muench, John; Sim, Shao-Chee; DeVoe, Jennifer E

2013-01-01

This article introduces the Community Health Applied Research Network (CHARN), a practice-based research network of community health centers (CHCs). Established by the Health Resources and Services Administration in 2010, CHARN is a network of 4 community research nodes, each with multiple affiliated CHCs and an academic center. The four nodes (18 individual CHCs and 4 academic partners in 9 states) are supported by a data coordinating center. Here we provide case studies detailing how CHARN is building research infrastructure and capacity in CHCs, with a particular focus on how community practice-academic partnerships were facilitated by the CHARN structure. The examples provided by the CHARN nodes include many of the building blocks of research capacity: communication capacity and "matchmaking" between providers and researchers; technology transfer; research methods tailored to community practice settings; and community institutional review board infrastructure to enable community oversight. We draw lessons learned from these case studies that we hope will serve as examples for other networks, with special relevance for community-based networks seeking to build research infrastructure in primary care settings.

Stationary oscillation for nonautonomous bidirectional associative memory neural networks with impulse

International Nuclear Information System (INIS)

Zhang Yinping

2009-01-01

In this paper, we study the existence, uniqueness and global stability of periodic solution (i.e. stationary oscillation) for general bidirectional associative memory neural networks with impulses. Some sufficient conditions are obtained for stationary oscillation of the nonautonomous bidirectional associative memory neural networks with impulses. It is derived by using a new method which is different from those of previous literatures, and a assumption in previous results does not required. The model considered is more general and some previous results are extended and improved. An illustrative example is given to demonstrate the effectiveness and less conservativeness of the obtained results.

A cooperative game framework for detecting overlapping communities in social networks

Science.gov (United States)

Jonnalagadda, Annapurna; Kuppusamy, Lakshmanan

2018-02-01

Community detection in social networks is a challenging and complex task, which received much attention from researchers of multiple domains in recent years. The evolution of communities in social networks happens merely due to the self-interest of the nodes. The interesting feature of community structure in social networks is the multi membership of the nodes resulting in overlapping communities. Assuming the nodes of the social network as self-interested players, the dynamics of community formation can be captured in the form of a game. In this paper, we propose a greedy algorithm, namely, Weighted Graph Community Game (WGCG), in order to model the interactions among the self-interested nodes of the social network. The proposed algorithm employs the Shapley value mechanism to discover the inherent communities of the underlying social network. The experimental evaluation on the real-world and synthetic benchmark networks demonstrates that the performance of the proposed algorithm is superior to the state-of-the-art overlapping community detection algorithms.

The slow oscillation in cortical and thalamic networks: mechanisms and functions

Directory of Open Access Journals (Sweden)

Garrett T. Neske

2016-01-01

Full Text Available During even the most quiescent behavioral periods, the cortex and thalamus express rich spontaneous activity in the form of slow (<1 Hz, synchronous network state transitions. Throughout this so-called slow oscillation, cortical and thalamic neurons fluctuate between periods of intense synaptic activity (Up states and almost complete silence (Down states. The two decades since the original characterization of the slow oscillation in the cortex and thalamus have seen considerable advances in deciphering the cellular and network mechanisms associated with this pervasive phenomenon. There are, nevertheless, many questions regarding the slow oscillation that await more thorough illumination, particularly the mechanisms by which Up states initiate and terminate, the functional role of the rhythmic activity cycles in unconscious or minimally conscious states, and the precise relation between Up states and the activated states associated with waking behavior. Given the substantial advances in multineuronal recording and imaging methods in both in vivo and in vitro preparations, the time is ripe to take stock of our current understanding of the slow oscillation and pave the way for future investigations of its mechanisms and functions. My aim in this Review is to provide a comprehensive account of the mechanisms and functions of the slow oscillation, and to suggest avenues for further exploration.

Information dynamics algorithm for detecting communities in networks

Science.gov (United States)

Massaro, Emanuele; Bagnoli, Franco; Guazzini, Andrea; Lió, Pietro

2012-11-01

The problem of community detection is relevant in many scientific disciplines, from social science to statistical physics. Given the impact of community detection in many areas, such as psychology and social sciences, we have addressed the issue of modifying existing well performing algorithms by incorporating elements of the domain application fields, i.e. domain-inspired. We have focused on a psychology and social network-inspired approach which may be useful for further strengthening the link between social network studies and mathematics of community detection. Here we introduce a community-detection algorithm derived from the van Dongen's Markov Cluster algorithm (MCL) method [4] by considering networks' nodes as agents capable to take decisions. In this framework we have introduced a memory factor to mimic a typical human behavior such as the oblivion effect. The method is based on information diffusion and it includes a non-linear processing phase. We test our method on two classical community benchmark and on computer generated networks with known community structure. Our approach has three important features: the capacity of detecting overlapping communities, the capability of identifying communities from an individual point of view and the fine tuning the community detectability with respect to prior knowledge of the data. Finally we discuss how to use a Shannon entropy measure for parameter estimation in complex networks.

Entraining the topology and the dynamics of a network of phase oscillators

Science.gov (United States)

Sendiña-Nadal, I.; Leyva, I.; Buldú, J. M.; Almendral, J. A.; Boccaletti, S.

2009-04-01

We show that the topology and dynamics of a network of unsynchronized Kuramoto oscillators can be simultaneously controlled by means of a forcing mechanism which yields a phase locking of the oscillators to that of an external pacemaker in connection with the reshaping of the network’s degree distribution. The entrainment mechanism is based on the addition, at regular time intervals, of unidirectional links from oscillators that follow the dynamics of a pacemaker to oscillators in the pristine graph whose phases hold a prescribed phase relationship. Such a dynamically based rule in the attachment process leads to the emergence of a power-law shape in the final degree distribution of the graph whenever the network is entrained to the dynamics of the pacemaker. We show that the arousal of a scale-free distribution in connection with the success of the entrainment process is a robust feature, characterizing different networks’ initial configurations and parameters.

From Tree Structure to Interactive Network:A Preliminary Study on Transit-Oriented Spatial Development Patterns of Village-Town Communities

Institute of Scientific and Technical Information of China (English)

Jinyan; WANG; Shuhua; HE; Fang; QIAN

2014-01-01

Based on the relatively developed highway and road network in China’s eastern coastal provinces, the public transit-oriented development model(TOD) for village-town communities aims to create a network connecting the urban and rural public transportation system and the public service system, by selectively constructing 'urban-type' communities with bus stops, thus promoting the mobility of urban and rural factors and to optimize the public service system, so as to change the traditional top-down development mode with tree structure. Through the planning practice in Linyi County, Dezhou City, it is found that a TOD-based spatial development mode in village-town communities can provide references for new countryside planning and construction in China in terms of upgrading the urban-rural functional structure, satisfying local demands, optimizing local government decisions, improving the planning mode, etc.

A universal order parameter for synchrony in networks of limit cycle oscillators

Science.gov (United States)

Schröder, Malte; Timme, Marc; Witthaut, Dirk

2017-07-01

We analyze the properties of order parameters measuring synchronization and phase locking in complex oscillator networks. First, we review network order parameters previously introduced and reveal several shortcomings: none of the introduced order parameters capture all transitions from incoherence over phase locking to full synchrony for arbitrary, finite networks. We then introduce an alternative, universal order parameter that accurately tracks the degree of partial phase locking and synchronization, adapting the traditional definition to account for the network topology and its influence on the phase coherence of the oscillators. We rigorously prove that this order parameter is strictly monotonously increasing with the coupling strength in the phase locked state, directly reflecting the dynamic stability of the network. Furthermore, it indicates the onset of full phase locking by a diverging slope at the critical coupling strength. The order parameter may find applications across systems where different types of synchrony are possible, including biological networks and power grids.

Social networks and performance in distributed learning communities

OpenAIRE

Cadima, Rita; Ojeda Rodríguez, Jordi; Monguet Fierro, José María

2012-01-01

Social networks play an essential role in learning environments as a key channel for knowledge sharing and students' support. In distributed learning communities, knowledge sharing does not occur as spontaneously as when a working group shares the same physical space; knowledge sharing depends even more on student informal connections. In this study we analyse two distributed learning communities' social networks in order to understand how characteristics of the social structure can enhance s...

Community Clustering Algorithm in Complex Networks Based on Microcommunity Fusion

Directory of Open Access Journals (Sweden)

Jin Qi

2015-01-01

Full Text Available With the further research on physical meaning and digital features of the community structure in complex networks in recent years, the improvement of effectiveness and efficiency of the community mining algorithms in complex networks has become an important subject in this area. This paper puts forward a concept of the microcommunity and gets final mining results of communities through fusing different microcommunities. This paper starts with the basic definition of the network community and applies Expansion to the microcommunity clustering which provides prerequisites for the microcommunity fusion. The proposed algorithm is more efficient and has higher solution quality compared with other similar algorithms through the analysis of test results based on network data set.

Identifying influential user communities on the social network

Science.gov (United States)

Hu, Weishu; Gong, Zhiguo; Hou U, Leong; Guo, Jingzhi

2015-10-01

Nowadays social network services have been popularly used in electronic commerce systems. Users on the social network can develop different relationships based on their common interests and activities. In order to promote the business, it is interesting to explore hidden relationships among users developed on the social network. Such knowledge can be used to locate target users for different advertisements and to provide effective product recommendations. In this paper, we define and study a novel community detection problem that is to discover the hidden community structure in large social networks based on their common interests. We observe that the users typically pay more attention to those users who share similar interests, which enable a way to partition the users into different communities according to their common interests. We propose two algorithms to detect influential communities using common interests in large social networks efficiently and effectively. We conduct our experimental evaluation using a data set from Epinions, which demonstrates that our method achieves 4-11.8% accuracy improvement over the state-of-the-art method.

Fast effects of glucocorticoids on memory-related network oscillations in the mouse hippocampus.

Science.gov (United States)

Weiss, E K; Krupka, N; Bähner, F; Both, M; Draguhn, A

2008-05-01

Transient or lasting increases in glucocorticoids accompany deficits in hippocampus-dependent memory formation. Recent data indicate that the formation and consolidation of declarative and spatial memory are mechanistically related to different patterns of hippocampal network oscillations. These include gamma oscillations during memory acquisition and the faster ripple oscillations (approximately 200 Hz) during subsequent memory consolidation. We therefore analysed the effects of acutely applied glucocorticoids on network activity in mouse hippocampal slices. Evoked field population spikes and paired-pulse responses were largely unaltered by corticosterone or cortisol, respectively, despite a slight increase in maximal population spike amplitude by 10 microm corticosterone. Several characteristics of sharp waves and superimposed ripple oscillations were affected by glucocorticoids, most prominently the frequency of spontaneously occurring sharp waves. At 0.1 microm, corticosterone increased this frequency, whereas maximal (10 microm) concentrations led to a reduction. In addition, gamma oscillations became slightly faster and less regular in the presence of high doses of corticosteroids. The present study describes acute effects of glucocorticoids on sharp wave-ripple complexes and gamma oscillations in mouse hippocampal slices, revealing a potential background for memory deficits in the presence of elevated levels of these hormones.

Computing with networks of nonlinear mechanical oscillators.

Directory of Open Access Journals (Sweden)

Jean C Coulombe

Full Text Available As it is getting increasingly difficult to achieve gains in the density and power efficiency of microelectronic computing devices because of lithographic techniques reaching fundamental physical limits, new approaches are required to maximize the benefits of distributed sensors, micro-robots or smart materials. Biologically-inspired devices, such as artificial neural networks, can process information with a high level of parallelism to efficiently solve difficult problems, even when implemented using conventional microelectronic technologies. We describe a mechanical device, which operates in a manner similar to artificial neural networks, to solve efficiently two difficult benchmark problems (computing the parity of a bit stream, and classifying spoken words. The device consists in a network of masses coupled by linear springs and attached to a substrate by non-linear springs, thus forming a network of anharmonic oscillators. As the masses can directly couple to forces applied on the device, this approach combines sensing and computing functions in a single power-efficient device with compact dimensions.

Accurate detection of hierarchical communities in complex networks based on nonlinear dynamical evolution

Science.gov (United States)

Zhuo, Zhao; Cai, Shi-Min; Tang, Ming; Lai, Ying-Cheng

2018-04-01

One of the most challenging problems in network science is to accurately detect communities at distinct hierarchical scales. Most existing methods are based on structural analysis and manipulation, which are NP-hard. We articulate an alternative, dynamical evolution-based approach to the problem. The basic principle is to computationally implement a nonlinear dynamical process on all nodes in the network with a general coupling scheme, creating a networked dynamical system. Under a proper system setting and with an adjustable control parameter, the community structure of the network would "come out" or emerge naturally from the dynamical evolution of the system. As the control parameter is systematically varied, the community hierarchies at different scales can be revealed. As a concrete example of this general principle, we exploit clustered synchronization as a dynamical mechanism through which the hierarchical community structure can be uncovered. In particular, for quite arbitrary choices of the nonlinear nodal dynamics and coupling scheme, decreasing the coupling parameter from the global synchronization regime, in which the dynamical states of all nodes are perfectly synchronized, can lead to a weaker type of synchronization organized as clusters. We demonstrate the existence of optimal choices of the coupling parameter for which the synchronization clusters encode accurate information about the hierarchical community structure of the network. We test and validate our method using a standard class of benchmark modular networks with two distinct hierarchies of communities and a number of empirical networks arising from the real world. Our method is computationally extremely efficient, eliminating completely the NP-hard difficulty associated with previous methods. The basic principle of exploiting dynamical evolution to uncover hidden community organizations at different scales represents a "game-change" type of approach to addressing the problem of community

Stylized facts in social networks: Community-based static modeling

Science.gov (United States)

Jo, Hang-Hyun; Murase, Yohsuke; Török, János; Kertész, János; Kaski, Kimmo

2018-06-01

The past analyses of datasets of social networks have enabled us to make empirical findings of a number of aspects of human society, which are commonly featured as stylized facts of social networks, such as broad distributions of network quantities, existence of communities, assortative mixing, and intensity-topology correlations. Since the understanding of the structure of these complex social networks is far from complete, for deeper insight into human society more comprehensive datasets and modeling of the stylized facts are needed. Although the existing dynamical and static models can generate some stylized facts, here we take an alternative approach by devising a community-based static model with heterogeneous community sizes and larger communities having smaller link density and weight. With these few assumptions we are able to generate realistic social networks that show most stylized facts for a wide range of parameters, as demonstrated numerically and analytically. Since our community-based static model is simple to implement and easily scalable, it can be used as a reference system, benchmark, or testbed for further applications.

A density-based clustering model for community detection in complex networks

Science.gov (United States)

Zhao, Xiang; Li, Yantao; Qu, Zehui

2018-04-01

Network clustering (or graph partitioning) is an important technique for uncovering the underlying community structures in complex networks, which has been widely applied in various fields including astronomy, bioinformatics, sociology, and bibliometric. In this paper, we propose a density-based clustering model for community detection in complex networks (DCCN). The key idea is to find group centers with a higher density than their neighbors and a relatively large integrated-distance from nodes with higher density. The experimental results indicate that our approach is efficient and effective for community detection of complex networks.

The function of communities in protein interaction networks at multiple scales

Directory of Open Access Journals (Sweden)

Jones Nick S

2010-07-01

Full Text Available Abstract Background If biology is modular then clusters, or communities, of proteins derived using only protein interaction network structure should define protein modules with similar biological roles. We investigate the link between biological modules and network communities in yeast and its relationship to the scale at which we probe the network. Results Our results demonstrate that the functional homogeneity of communities depends on the scale selected, and that almost all proteins lie in a functionally homogeneous community at some scale. We judge functional homogeneity using a novel test and three independent characterizations of protein function, and find a high degree of overlap between these measures. We show that a high mean clustering coefficient of a community can be used to identify those that are functionally homogeneous. By tracing the community membership of a protein through multiple scales we demonstrate how our approach could be useful to biologists focusing on a particular protein. Conclusions We show that there is no one scale of interest in the community structure of the yeast protein interaction network, but we can identify the range of resolution parameters that yield the most functionally coherent communities, and predict which communities are most likely to be functionally homogeneous.

Label Propagation with α-Degree Neighborhood Impact for Network Community Detection

Directory of Open Access Journals (Sweden)

Heli Sun

2014-01-01

Full Text Available Community detection is an important task for mining the structure and function of complex networks. In this paper, a novel label propagation approach with α-degree neighborhood impact is proposed for efficiently and effectively detecting communities in networks. Firstly, we calculate the neighborhood impact of each node in a network within the scope of its α-degree neighborhood network by using an iterative approach. To mitigate the problems of visiting order correlation and convergence difficulty when updating the node labels asynchronously, our method updates the labels in an ascending order on the α-degree neighborhood impact of all the nodes. The α-degree neighborhood impact is also taken as the updating weight value, where the parameter impact scope α can be set to a positive integer. Experimental results from several real-world and synthetic networks show that our method can reveal the community structure in networks rapidly and accurately. The performance of our method is better than other label propagation based methods.

Impulsive Cluster Synchronization in Community Network with Nonidentical Nodes

International Nuclear Information System (INIS)

Deng Liping; Wu Zhaoyan

2012-01-01

In this paper, cluster synchronization in community network with nonidentical nodes and impulsive effects is investigated. Community networks with two kinds of topological structure are investigated. Positive weighted network is considered first and external pinning controllers are designed for achieving cluster synchronization. Cooperative and competitive network under some assumptions is investigated as well and can achieve cluster synchronization with only impulsive controllers. Based on the stability analysis of impulsive differential equation and the Lyapunov stability theory, several simple and useful synchronization criteria are derived. Finally, numerical simulations are provided to verify the effectiveness of the derived results.

Network communities as a new form of social organization in conditions of postmodern

Directory of Open Access Journals (Sweden)

N. V. Burmaha

2016-03-01

Full Text Available This article deals with the approach to interpretation of essence of the network community concept in which we propose to consider it as a new form of social organization that is substantiated by the specificity of how our society is functioning in conditions of Postmodern. There were explored two main approaches to network communities studying: the first approach considers social networks in a classic, traditional interpretation of modernity as a special kind of social structure, and the second one represents social networks as a specific virtual formation, a social structure of virtual Internet reality. There were revealed some common features of a social organization and a network community: presence of permanent communication between members of the group, united by certain common interests and goals, as well as presence of the certain hierarchy among all members of the community, and the rules of conduct, implementation of communication. Distinctive features: network community is more informal, offers its members considerable leeway in the implementation of their own goals and satisfying the needs, full virtualization of communication absence of direct interaction during communication, under conditions where the main resource for the interchange in network communities is information. It was shown that in the process of emergence, development and distribution of network communities, the fundamental role is played by modern communications - namely, unification them in a stable set of interconnected networks and, in particular network communities.

Instabilities in RF-power amplifiers caused by a self-oscillation in the transistor bias network

DEFF Research Database (Denmark)

Vidkjær, Jens

1976-01-01

This paper describes a self-oscillation in the bias network of an amplifier which is commonly used for the output stage in mobile transmitters. It is demonstrated how some often observed spurious oscillations may be related to the self-oscillation and a method for stabilizing the amplifier...

Establishing a Statistical Link between Network Oscillations and Neural Synchrony.

Directory of Open Access Journals (Sweden)

Pengcheng Zhou

2015-10-01

Full Text Available Pairs of active neurons frequently fire action potentials or "spikes" nearly synchronously (i.e., within 5 ms of each other. This spike synchrony may occur by chance, based solely on the neurons' fluctuating firing patterns, or it may occur too frequently to be explicable by chance alone. When spike synchrony above chances levels is present, it may subserve computation for a specific cognitive process, or it could be an irrelevant byproduct of such computation. Either way, spike synchrony is a feature of neural data that should be explained. A point process regression framework has been developed previously for this purpose, using generalized linear models (GLMs. In this framework, the observed number of synchronous spikes is compared to the number predicted by chance under varying assumptions about the factors that affect each of the individual neuron's firing-rate functions. An important possible source of spike synchrony is network-wide oscillations, which may provide an essential mechanism of network information flow. To establish the statistical link between spike synchrony and network-wide oscillations, we have integrated oscillatory field potentials into our point process regression framework. We first extended a previously-published model of spike-field association and showed that we could recover phase relationships between oscillatory field potentials and firing rates. We then used this new framework to demonstrate the statistical relationship between oscillatory field potentials and spike synchrony in: 1 simulated neurons, 2 in vitro recordings of hippocampal CA1 pyramidal cells, and 3 in vivo recordings of neocortical V4 neurons. Our results provide a rigorous method for establishing a statistical link between network oscillations and neural synchrony.

GABAergic synapse properties may explain genetic variation in hippocampal network oscillations in mice

Directory of Open Access Journals (Sweden)

Tim S Heistek

2010-06-01

Full Text Available Cognitive ability and the properties of brain oscillation are highly heritable in humans. Genetic variation underlying oscillatory activity might give rise to differences in cognition and behavior. How genetic diversity translates into altered properties of oscillations and synchronization of neuronal activity is unknown. To address this issue, we investigated cellular and synaptic mechanisms of hippocampal fast network oscillations in eight genetically distinct inbred mouse strains. The frequency of carbachol-induced oscillations differed substantially between mouse strains. Since GABAergic inhibition sets oscillation frequency, we studied the properties of inhibitory synaptic inputs (IPSCs received by CA3 and CA1 pyramidal cells of three mouse strains that showed the highest, lowest and intermediate frequencies of oscillations. In CA3 pyramidal cells, the frequency of rhythmic IPSC input showed the same strain differences as the frequency of field oscillations. Furthermore, IPSC decay times in both CA1 and CA3 pyramidal cells were faster in mouse strains with higher oscillation frequencies than in mouse strains with lower oscillation frequency, suggesting that differences in GABAA-receptor subunit composition exist between these strains. Indeed, gene expression of GABAA-receptor β2 (Gabrb2 and β3 (Gabrb2 subunits was higher in mouse strains with faster decay kinetics compared with mouse strains with slower decay kinetics. Hippocampal pyramidal neurons in mouse strains with higher oscillation frequencies and faster decay kinetics fired action potential at higher frequencies. These data indicate that differences in genetic background may result in different GABAA-receptor subunit expression, which affects the rhythm of pyramidal neuron firing and fast network activity through GABA synapse kinetics.

Oscillator Neural Network Retrieving Sparsely Coded Phase Patterns

Science.gov (United States)

Aoyagi, Toshio; Nomura, Masaki

1999-08-01

Little is known theoretically about the associative memory capabilities of neural networks in which information is encoded not only in the mean firing rate but also in the timing of firings. Particularly, in the case of sparsely coded patterns, it is biologically important to consider the timings of firings and to study how such consideration influences storage capacities and quality of recalled patterns. For this purpose, we propose a simple extended model of oscillator neural networks to allow for expression of a nonfiring state. Analyzing both equilibrium states and dynamical properties in recalling processes, we find that the system possesses good associative memory.

Rational design of functional and tunable oscillating enzymatic networks

Science.gov (United States)

Semenov, Sergey N.; Wong, Albert S. Y.; van der Made, R. Martijn; Postma, Sjoerd G. J.; Groen, Joost; van Roekel, Hendrik W. H.; de Greef, Tom F. A.; Huck, Wilhelm T. S.

2015-02-01

Life is sustained by complex systems operating far from equilibrium and consisting of a multitude of enzymatic reaction networks. The operating principles of biology's regulatory networks are known, but the in vitro assembly of out-of-equilibrium enzymatic reaction networks has proved challenging, limiting the development of synthetic systems showing autonomous behaviour. Here, we present a strategy for the rational design of programmable functional reaction networks that exhibit dynamic behaviour. We demonstrate that a network built around autoactivation and delayed negative feedback of the enzyme trypsin is capable of producing sustained oscillating concentrations of active trypsin for over 65 h. Other functions, such as amplification, analog-to-digital conversion and periodic control over equilibrium systems, are obtained by linking multiple network modules in microfluidic flow reactors. The methodology developed here provides a general framework to construct dissipative, tunable and robust (bio)chemical reaction networks.

Temporal structure of neuronal population oscillations with empirical model decomposition

International Nuclear Information System (INIS)

Li Xiaoli

2006-01-01

Frequency analysis of neuronal oscillation is very important for understanding the neural information processing and mechanism of disorder in the brain. This Letter addresses a new method to analyze the neuronal population oscillations with empirical mode decomposition (EMD). Following EMD of neuronal oscillation, a series of intrinsic mode functions (IMFs) are obtained, then Hilbert transform of IMFs can be used to extract the instantaneous time frequency structure of neuronal oscillation. The method is applied to analyze the neuronal oscillation in the hippocampus of epileptic rats in vivo, the results show the neuronal oscillations have different descriptions during the pre-ictal, seizure onset and ictal periods of the epileptic EEG at the different frequency band. This new method is very helpful to provide a view for the temporal structure of neural oscillation

Patterns of cortical oscillations organize neural activity into whole-brain functional networks evident in the fMRI BOLD signal

Directory of Open Access Journals (Sweden)

Jennifer C Whitman

2013-03-01

Full Text Available Recent findings from electrophysiology and multimodal neuroimaging have elucidated the relationship between patterns of cortical oscillations evident in EEG / MEG and the functional brain networks evident in the BOLD signal. Much of the existing literature emphasized how high-frequency cortical oscillations are thought to coordinate neural activity locally, while low-frequency oscillations play a role in coordinating activity between more distant brain regions. However, the assignment of different frequencies to different spatial scales is an oversimplification. A more informative approach is to explore the arrangements by which these low- and high-frequency oscillations work in concert, coordinating neural activity into whole-brain functional networks. When relating such networks to the BOLD signal, we must consider how the patterns of cortical oscillations change at the same speed as cognitive states, which often last less than a second. Consequently, the slower BOLD signal may often reflect the summed neural activity of several transient network configurations. This temporal mismatch can be circumvented if we use spatial maps to assess correspondence between oscillatory networks and BOLD networks.

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

Science.gov (United States)

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

2018-07-01

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

Phase models and clustering in networks of oscillators with delayed coupling

Science.gov (United States)

Campbell, Sue Ann; Wang, Zhen

2018-01-01

We consider a general model for a network of oscillators with time delayed coupling where the coupling matrix is circulant. We use the theory of weakly coupled oscillators to reduce the system of delay differential equations to a phase model where the time delay enters as a phase shift. We use the phase model to determine model independent existence and stability results for symmetric cluster solutions. Our results extend previous work to systems with time delay and a more general coupling matrix. We show that the presence of the time delay can lead to the coexistence of multiple stable clustering solutions. We apply our analytical results to a network of Morris Lecar neurons and compare these results with numerical continuation and simulation studies.

Collective signaling behavior in a networked-oscillator model

Science.gov (United States)

Liu, Z.-H.; Hui, P. M.

2007-09-01

We propose and study the collective behavior of a model of networked signaling objects that incorporates several ingredients of real-life systems. These ingredients include spatial inhomogeneity with grouping of signaling objects, signal attenuation with distance, and delayed and impulsive coupling between non-identical signaling objects. Depending on the coupling strength and/or time-delay effect, the model exhibits completely, partially, and locally collective signaling behavior. In particular, a correlated signaling (CS) behavior is observed in which there exist time durations when nearly a constant fraction of oscillators in the system are in the signaling state. These time durations are much longer than the duration of a spike when a single oscillator signals, and they are separated by regular intervals in which nearly all oscillators are silent. Such CS behavior is similar to that observed in biological systems such as fireflies, cicadas, crickets, and frogs. The robustness of the CS behavior against noise is also studied. It is found that properly adjusting the coupling strength and noise level could enhance the correlated behavior.

Bistable Chimera Attractors on a Triangular Network of Oscillator Populations

DEFF Research Database (Denmark)

Martens, Erik Andreas

2010-01-01

. This triangular network is the simplest discretization of a continuous ring of oscillators. Yet it displays an unexpectedly different behavior: in contrast to the lone stable chimera observed in continuous rings of oscillators, we find that this system exhibits two coexisting stable chimeras. Both chimeras are......, as usual, born through a saddle-node bifurcation. As the coupling becomes increasingly local in nature they lose stability through a Hopf bifurcation, giving rise to breathing chimeras, which in turn get destroyed through a homoclinic bifurcation. Remarkably, one of the chimeras reemerges by a reversal...

Heterogeneity of time delays determines synchronization of coupled oscillators.

Science.gov (United States)

Petkoski, Spase; Spiegler, Andreas; Proix, Timothée; Aram, Parham; Temprado, Jean-Jacques; Jirsa, Viktor K

2016-07-01

Network couplings of oscillatory large-scale systems, such as the brain, have a space-time structure composed of connection strengths and signal transmission delays. We provide a theoretical framework, which allows treating the spatial distribution of time delays with regard to synchronization, by decomposing it into patterns and therefore reducing the stability analysis into the tractable problem of a finite set of delay-coupled differential equations. We analyze delay-structured networks of phase oscillators and we find that, depending on the heterogeneity of the delays, the oscillators group in phase-shifted, anti-phase, steady, and non-stationary clusters, and analytically compute their stability boundaries. These results find direct application in the study of brain oscillations.

On a new concept of community: social networks, personal communities and collective intelligence

Directory of Open Access Journals (Sweden)

Rogério da Costa

2006-01-01

Full Text Available This text essentially deals with the transmutation of the concept of "community" into "social networks". This change is due largely to the boom of virtual communities in cyberspace, a fact that has generated a number of studies not only on this new way of weaving a society, but also on the dynamic structure of communication networks. At the core of this transformation, concepts such as social capital, trust and partial sympathy are called upon, to enable us to think about the new forms of association that regulate human activity in our time.

Asymmetric intimacy and algorithm for detecting communities in bipartite networks

Science.gov (United States)

Wang, Xingyuan; Qin, Xiaomeng

2016-11-01

In this paper, an algorithm to choose a good partition in bipartite networks has been proposed. Bipartite networks have more theoretical significance and broader prospect of application. In view of distinctive structure of bipartite networks, in our method, two parameters are defined to show the relationships between the same type nodes and heterogeneous nodes respectively. Moreover, our algorithm employs a new method of finding and expanding the core communities in bipartite networks. Two kinds of nodes are handled separately and merged, and then the sub-communities are obtained. After that, objective communities will be found according to the merging rule. The proposed algorithm has been simulated in real-world networks and artificial networks, and the result verifies the accuracy and reliability of the parameters on intimacy for our algorithm. Eventually, comparisons with similar algorithms depict that the proposed algorithm has better performance.

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

Science.gov (United States)

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

2015-02-04

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

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

Science.gov (United States)

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

2018-02-01

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

Network-induced oscillatory behavior in material flow networks and irregular business cycles

Science.gov (United States)

Helbing, Dirk; Lämmer, Stefen; Witt, Ulrich; Brenner, Thomas

2004-11-01

Network theory is rapidly changing our understanding of complex systems, but the relevance of topological features for the dynamic behavior of metabolic networks, food webs, production systems, information networks, or cascade failures of power grids remains to be explored. Based on a simple model of supply networks, we offer an interpretation of instabilities and oscillations observed in biological, ecological, economic, and engineering systems. We find that most supply networks display damped oscillations, even when their units—and linear chains of these units—behave in a nonoscillatory way. Moreover, networks of damped oscillators tend to produce growing oscillations. This surprising behavior offers, for example, a different interpretation of business cycles and of oscillating or pulsating processes. The network structure of material flows itself turns out to be a source of instability, and cyclical variations are an inherent feature of decentralized adjustments.

Unifying Inference of Meso-Scale Structures in Networks.

Science.gov (United States)

Tunç, Birkan; Verma, Ragini

2015-01-01

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

Unifying Inference of Meso-Scale Structures in Networks.

Directory of Open Access Journals (Sweden)

Birkan Tunç

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

The Structure of Online Consumer Communication Networks

NARCIS (Netherlands)

B.G.C. Dellaert (Benedict); M.J.W. Harmsen-van Hout (Marjolein); P.J.J. Herings (Jean-Jacques)

2006-01-01

textabstractIn this paper we study the structure of the bilateral communication links within Online Consumer Communication Networks (OCCNs), such as virtual communities. Compared to the offline world, consumers in online networks are highly flexible to choose their communication partners and little

Interplay of intrinsic and synaptic conductances in the generation of high-frequency oscillations in interneuronal networks with irregular spiking.

Directory of Open Access Journals (Sweden)

Fabiano Baroni

2014-05-01

Full Text Available High-frequency oscillations (above 30 Hz have been observed in sensory and higher-order brain areas, and are believed to constitute a general hallmark of functional neuronal activation. Fast inhibition in interneuronal networks has been suggested as a general mechanism for the generation of high-frequency oscillations. Certain classes of interneurons exhibit subthreshold oscillations, but the effect of this intrinsic neuronal property on the population rhythm is not completely understood. We study the influence of intrinsic damped subthreshold oscillations in the emergence of collective high-frequency oscillations, and elucidate the dynamical mechanisms that underlie this phenomenon. We simulate neuronal networks composed of either Integrate-and-Fire (IF or Generalized Integrate-and-Fire (GIF neurons. The IF model displays purely passive subthreshold dynamics, while the GIF model exhibits subthreshold damped oscillations. Individual neurons receive inhibitory synaptic currents mediated by spiking activity in their neighbors as well as noisy synaptic bombardment, and fire irregularly at a lower rate than population frequency. We identify three factors that affect the influence of single-neuron properties on synchronization mediated by inhibition: i the firing rate response to the noisy background input, ii the membrane potential distribution, and iii the shape of Inhibitory Post-Synaptic Potentials (IPSPs. For hyperpolarizing inhibition, the GIF IPSP profile (factor iii exhibits post-inhibitory rebound, which induces a coherent spike-mediated depolarization across cells that greatly facilitates synchronous oscillations. This effect dominates the network dynamics, hence GIF networks display stronger oscillations than IF networks. However, the restorative current in the GIF neuron lowers firing rates and narrows the membrane potential distribution (factors i and ii, respectively, which tend to decrease synchrony. If inhibition is shunting instead

Interplay of intrinsic and synaptic conductances in the generation of high-frequency oscillations in interneuronal networks with irregular spiking.

Science.gov (United States)

Baroni, Fabiano; Burkitt, Anthony N; Grayden, David B

2014-05-01

High-frequency oscillations (above 30 Hz) have been observed in sensory and higher-order brain areas, and are believed to constitute a general hallmark of functional neuronal activation. Fast inhibition in interneuronal networks has been suggested as a general mechanism for the generation of high-frequency oscillations. Certain classes of interneurons exhibit subthreshold oscillations, but the effect of this intrinsic neuronal property on the population rhythm is not completely understood. We study the influence of intrinsic damped subthreshold oscillations in the emergence of collective high-frequency oscillations, and elucidate the dynamical mechanisms that underlie this phenomenon. We simulate neuronal networks composed of either Integrate-and-Fire (IF) or Generalized Integrate-and-Fire (GIF) neurons. The IF model displays purely passive subthreshold dynamics, while the GIF model exhibits subthreshold damped oscillations. Individual neurons receive inhibitory synaptic currents mediated by spiking activity in their neighbors as well as noisy synaptic bombardment, and fire irregularly at a lower rate than population frequency. We identify three factors that affect the influence of single-neuron properties on synchronization mediated by inhibition: i) the firing rate response to the noisy background input, ii) the membrane potential distribution, and iii) the shape of Inhibitory Post-Synaptic Potentials (IPSPs). For hyperpolarizing inhibition, the GIF IPSP profile (factor iii)) exhibits post-inhibitory rebound, which induces a coherent spike-mediated depolarization across cells that greatly facilitates synchronous oscillations. This effect dominates the network dynamics, hence GIF networks display stronger oscillations than IF networks. However, the restorative current in the GIF neuron lowers firing rates and narrows the membrane potential distribution (factors i) and ii), respectively), which tend to decrease synchrony. If inhibition is shunting instead of

Context-Aware Community Construction in Proximity-Based Mobile Networks

Directory of Open Access Journals (Sweden)

Na Yu

2015-01-01

Full Text Available Sensor-equipped mobile devices have allowed users to participate in various social networking services. We focus on proximity-based mobile social networking environments where users can share information obtained from different places via their mobile devices when they are in proximity. Since people are more likely to share information if they can benefit from the sharing or if they think the information is of interest to others, there might exist community structures where users who share information more often are grouped together. Communities in proximity-based mobile networks represent social groups where connections are built when people are in proximity. We consider information influence (i.e., specify who shares information with whom as the connection and the space and time related to the shared information as the contexts. To model the potential information influences, we construct an influence graph by integrating the space and time contexts into the proximity-based contacts of mobile users. Further, we propose a two-phase strategy to detect and track context-aware communities based on the influence graph and show how the context-aware community structure improves the performance of two types of mobile social applications.

Induction of Hopf bifurcation and oscillation death by delays in coupled networks

International Nuclear Information System (INIS)

Cheng, C.-Y.

2009-01-01

This work explores a system of two coupled networks that each has four nodes. Delayed effects of short-cuts in each network and the coupling between the two groups are considered. When the short-cut delay is fixed, the arising and death of oscillations are caused by the variational coupling delay.

High-Frequency Network Oscillations in Cerebellar Cortex

Science.gov (United States)

Middleton, Steven J.; Racca, Claudia; Cunningham, Mark O.; Traub, Roger D.; Monyer, Hannah; Knöpfel, Thomas; Schofield, Ian S.; Jenkins, Alistair; Whittington, Miles A.

2016-01-01

SUMMARY Both cerebellum and neocortex receive input from the somatosensory system. Interaction between these regions has been proposed to underpin the correct selection and execution of motor commands, but it is not clear how such interactions occur. In neocortex, inputs give rise to population rhythms, providing a spatiotemporal coding strategy for inputs and consequent outputs. Here, we show that similar patterns of rhythm generation occur in cerebellum during nicotinic receptor subtype activation. Both gamma oscillations (30–80 Hz) and very fast oscillations (VFOs, 80–160 Hz) were generated by intrinsic cerebellar cortical circuitry in the absence of functional glutamatergic connections. As in neocortex, gamma rhythms were dependent on GABAA receptor-mediated inhibition, whereas VFOs required only nonsynaptically connected intercellular networks. The ability of cerebellar cortex to generate population rhythms within the same frequency bands as neocortex suggests that they act as a common spatiotemporal code within which corticocerebellar dialog may occur. PMID:18549787

Local community detection as pattern restoration by attractor dynamics of recurrent neural networks.

Science.gov (United States)

Okamoto, Hiroshi

2016-08-01

Densely connected parts in networks are referred to as "communities". Community structure is a hallmark of a variety of real-world networks. Individual communities in networks form functional modules of complex systems described by networks. Therefore, finding communities in networks is essential to approaching and understanding complex systems described by networks. In fact, network science has made a great deal of effort to develop effective and efficient methods for detecting communities in networks. Here we put forward a type of community detection, which has been little examined so far but will be practically useful. Suppose that we are given a set of source nodes that includes some (but not all) of "true" members of a particular community; suppose also that the set includes some nodes that are not the members of this community (i.e., "false" members of the community). We propose to detect the community from this "imperfect" and "inaccurate" set of source nodes using attractor dynamics of recurrent neural networks. Community detection by the proposed method can be viewed as restoration of the original pattern from a deteriorated pattern, which is analogous to cue-triggered recall of short-term memory in the brain. We demonstrate the effectiveness of the proposed method using synthetic networks and real social networks for which correct communities are known. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Interaction of oscillations, and their suppression via deep brain stimulation, in a model of the cortico-basal ganglia network.

Science.gov (United States)

Kang, Guiyeom; Lowery, Madeleine M

2013-03-01

Growing evidence suggests that synchronized neural oscillations in the cortico-basal ganglia network may play a critical role in the pathophysiology of Parkinson's disease. In this study, a new model of the closed loop network is used to explore the generation and interaction of network oscillations and their suppression through deep brain stimulation (DBS). Under simulated dopamine depletion conditions, increased gain through the hyperdirect pathway resulted in the interaction of neural oscillations at different frequencies in the cortex and subthalamic nucleus (STN), leading to the emergence of synchronized oscillations at a new intermediate frequency. Further increases in synaptic gain resulted in the cortex driving synchronous oscillatory activity throughout the network. When DBS was added to the model a progressive reduction in STN power at the tremor and beta frequencies was observed as the frequency of stimulation was increased, with resonance effects occurring for low frequency DBS (40 Hz) in agreement with experimental observations. The results provide new insights into the mechanisms by which synchronous oscillations can arise within the network and how DBS may suppress unwanted oscillatory activity.

Optimal community structure for social contagions

Science.gov (United States)

Su, Zhen; Wang, Wei; Li, Lixiang; Stanley, H. Eugene; Braunstein, Lidia A.

2018-05-01

Community structure is an important factor in the behavior of real-world networks because it strongly affects the stability and thus the phase transition order of the spreading dynamics. We here propose a reversible social contagion model of community networks that includes the factor of social reinforcement. In our model an individual adopts a social contagion when the number of received units of information exceeds its adoption threshold. We use mean-field approximation to describe our proposed model, and the results agree with numerical simulations. The numerical simulations and theoretical analyses both indicate that there is a first-order phase transition in the spreading dynamics, and that a hysteresis loop emerges in the system when there is a variety of initially adopted seeds. We find an optimal community structure that maximizes spreading dynamics. We also find a rich phase diagram with a triple point that separates the no-diffusion phase from the two diffusion phases.

Numerical and analytical investigation of the chimera state excitation conditions in the Kuramoto-Sakaguchi oscillator network

Science.gov (United States)

Frolov, Nikita S.; Goremyko, Mikhail V.; Makarov, Vladimir V.; Maksimenko, Vladimir A.; Hramov, Alexander E.

2017-03-01

In this paper we study the conditions of chimera states excitation in ensemble of non-locally coupled Kuramoto-Sakaguchi (KS) oscillators. In the framework of current research we analyze the dynamics of the homogeneous network containing identical oscillators. We show the chimera state formation process is sensitive to the parameters of coupling kernel and to the KS network initial state. To perform the analysis we have used the Ott-Antonsen (OA) ansatz to consider the behavior of infinitely large KS network.

Finding and testing network communities by lumped Markov chains.

Science.gov (United States)

Piccardi, Carlo

2011-01-01

Identifying communities (or clusters), namely groups of nodes with comparatively strong internal connectivity, is a fundamental task for deeply understanding the structure and function of a network. Yet, there is a lack of formal criteria for defining communities and for testing their significance. We propose a sharp definition that is based on a quality threshold. By means of a lumped Markov chain model of a random walker, a quality measure called "persistence probability" is associated to a cluster, which is then defined as an "α-community" if such a probability is not smaller than α. Consistently, a partition composed of α-communities is an "α-partition." These definitions turn out to be very effective for finding and testing communities. If a set of candidate partitions is available, setting the desired α-level allows one to immediately select the α-partition with the finest decomposition. Simultaneously, the persistence probabilities quantify the quality of each single community. Given its ability in individually assessing each single cluster, this approach can also disclose single well-defined communities even in networks that overall do not possess a definite clusterized structure.

Finding and testing network communities by lumped Markov chains.

Directory of Open Access Journals (Sweden)

Carlo Piccardi

Full Text Available Identifying communities (or clusters, namely groups of nodes with comparatively strong internal connectivity, is a fundamental task for deeply understanding the structure and function of a network. Yet, there is a lack of formal criteria for defining communities and for testing their significance. We propose a sharp definition that is based on a quality threshold. By means of a lumped Markov chain model of a random walker, a quality measure called "persistence probability" is associated to a cluster, which is then defined as an "α-community" if such a probability is not smaller than α. Consistently, a partition composed of α-communities is an "α-partition." These definitions turn out to be very effective for finding and testing communities. If a set of candidate partitions is available, setting the desired α-level allows one to immediately select the α-partition with the finest decomposition. Simultaneously, the persistence probabilities quantify the quality of each single community. Given its ability in individually assessing each single cluster, this approach can also disclose single well-defined communities even in networks that overall do not possess a definite clusterized structure.

Searching for Communities in Bipartite Networks

OpenAIRE

Barber, Michael J.; Faria, Margarida; Streit, Ludwig; Strogan, Oleg

2008-01-01

Bipartite networks are a useful tool for representing and investigating interaction networks. We consider methods for identifying communities in bipartite networks. Intuitive notions of network community groups are made explicit using Newman's modularity measure. A specialized version of the modularity, adapted to be appropriate for bipartite networks, is presented; a corresponding algorithm is described for identifying community groups through maximizing this measure. The algorithm is applie...

Network-Based Community Brings forth Sustainable Society

Science.gov (United States)

Kikuchi, Toshiko

It has already been shown that an artificial society based on the three relations of social configuration (market, communal, and obligatory relations) functioning in balance with each other formed a sustainable society which the social reproduction is possible. In this artificial society model, communal relations exist in a network-based community with alternating members rather than a conventional community with cooperative mutual assistance practiced in some agricultural communities. In this paper, using the comparison between network-based communities with alternating members and conventional communities with fixed members, the significance of a network-based community is considered. In concrete terms, the difference in appearance rate for sustainable society, economic activity and asset inequality between network-based communities and conventional communities is analyzed. The appearance rate for a sustainable society of network-based community is higher than that of conventional community. Moreover, most of network-based communities had a larger total number of trade volume than conventional communities. But, the value of Gini coefficient in conventional community is smaller than that of network-based community. These results show that communal relations based on a network-based community is significant for the social reproduction and economic efficiency. However, in such an artificial society, the inequality is sacrificed.

The energy demand of fast neuronal network oscillations: insights from brain slice preparations

Directory of Open Access Journals (Sweden)

Oliver eKann

2012-01-01

Full Text Available Fast neuronal network oscillations in the gamma range (30-100 Hz in the cerebral cortex have been implicated in higher cognitive functions such as sensual perception, working memory, and, perhaps, consciousness. However, little is known about the energy demand of gamma oscillations. This is mainly caused by technical limitations that are associated with simultaneous recordings of neuronal activity and energy metabolism in small neuronal networks and at the level of mitochondria in vivo. Thus recent studies have focused on brain slice preparations to address the energy demand of gamma oscillations in vitro. Here, reports will be summarized and discussed that combined electrophysiological recordings, oxygen sensor microelectrodes and live-cell fluorescence imaging in acutely prepared slices and organotypic slice cultures of the hippocampus from both, mouse and rat. These reports consistently show that gamma oscillations can be reliably induced in hippocampal slice preparations by different pharmacological tools. They suggest that gamma oscillations are associated with high energy demand, requiring both rapid adaptation of oxidative energy metabolism and sufficient supply with oxygen and nutrients. These findings might help to explain the exceptional vulnerability of higher cognitive functions during pathological processes of the brain, such as circulatory disturbances, genetic mitochondrial diseases, and neurodegeneration.

Improvement of the SEP protocol based on community structure of node degree

Science.gov (United States)

Li, Donglin; Wei, Suyuan

2017-05-01

Analyzing the Stable election protocol (SEP) in wireless sensor networks and aiming at the problem of inhomogeneous cluster-heads distribution and unreasonable cluster-heads selectivity and single hop transmission in the SEP, a SEP Protocol based on community structure of node degree (SEP-CSND) is proposed. In this algorithm, network node deployed by using grid deployment model, and the connection between nodes established by setting up the communication threshold. The community structure constructed by node degree, then cluster head is elected in the community structure. On the basis of SEP, the node's residual energy and node degree is added in cluster-heads election. The information is transmitted with mode of multiple hops between network nodes. The simulation experiments showed that compared to the classical LEACH and SEP, this algorithm balances the energy consumption of the entire network and significantly prolongs network lifetime.

A Data Gathering Scheme in Wireless Sensor Networks Based on Synchronization of Chaotic Spiking Oscillator Networks

International Nuclear Information System (INIS)

Nakano, Hidehiro; Utani, Akihide; Miyauchi, Arata; Yamamoto, Hisao

2011-01-01

This paper studies chaos-based data gathering scheme in multiple sink wireless sensor networks. In the proposed scheme, each wireless sensor node has a simple chaotic oscillator. The oscillators generate spike signals with chaotic interspike intervals, and are impulsively coupled by the signals via wireless communication. Each wireless sensor node transmits and receives sensor information only in the timing of the couplings. The proposed scheme can exhibit various chaos synchronous phenomena and their breakdown phenomena, and can effectively gather sensor information with the significantly small number of transmissions and receptions compared with the conventional scheme. Also, the proposed scheme can flexibly adapt various wireless sensor networks not only with a single sink node but also with multiple sink nodes. This paper introduces our previous works. Through simulation experiments, we show effectiveness of the proposed scheme and discuss its development potential.

Alterations of cortical GABA neurons and network oscillations in schizophrenia.

Science.gov (United States)

Gonzalez-Burgos, Guillermo; Hashimoto, Takanori; Lewis, David A

2010-08-01

The hypothesis that alterations of cortical inhibitory gamma-aminobutyric acid (GABA) neurons are a central element in the pathology of schizophrenia has emerged from a series of postmortem studies. How such abnormalities may contribute to the clinical features of schizophrenia has been substantially informed by a convergence with basic neuroscience studies revealing complex details of GABA neuron function in the healthy brain. Importantly, activity of the parvalbumin-containing class of GABA neurons has been linked to the production of cortical network oscillations. Furthermore, growing knowledge supports the concept that gamma band oscillations (30-80 Hz) are an essential mechanism for cortical information transmission and processing. Herein we review recent studies further indicating that inhibition from parvalbumin-positive GABA neurons is necessary to produce gamma oscillations in cortical circuits; provide an update on postmortem studies documenting that deficits in the expression of glutamic acid decarboxylase67, which accounts for most GABA synthesis in the cortex, are widely observed in schizophrenia; and describe studies using novel, noninvasive approaches directly assessing potential relations between alterations in GABA, oscillations, and cognitive function in schizophrenia.

Vortex pinning vs superconducting wire network: origin of periodic oscillations induced by applied magnetic fields in superconducting films with arrays of nanomagnets

International Nuclear Information System (INIS)

Gomez, A; Del Valle, J; Gonzalez, E M; Vicent, J L; Chiliotte, C E; Carreira, S J; Bekeris, V; Prieto, J L; Schuller, Ivan K

2014-01-01

Hybrid magnetic arrays embedded in superconducting films are ideal systems to study the competition between different physical (such as the coherence length) and structural length scales such as are available in artificially produced structures. This interplay leads to oscillation in many magnetically dependent superconducting properties such as the critical currents, resistivity and magnetization. These effects are generally analyzed using two distinct models based on vortex pinning or wire network. In this work, we show that for magnetic dot arrays, as opposed to antidot (i.e. holes) arrays, vortex pinning is the main mechanism for field induced oscillations in resistance R(H), critical current I c (H), magnetization M(H) and ac-susceptibility χ ac (H) in a broad temperature range. Due to the coherence length divergence at T c , a crossover to wire network behaviour is experimentally found. While pinning occurs in a wide temperature range up to T c , wire network behaviour is only present in a very narrow temperature window close to T c . In this temperature interval, contributions from both mechanisms are operational but can be experimentally distinguished. (papers)

Liking and hyperlinking: Community detection in online child sexual exploitation networks.

Science.gov (United States)

Westlake, Bryce G; Bouchard, Martin

2016-09-01

The online sexual exploitation of children is facilitated by websites that form virtual communities, via hyperlinks, to distribute images, videos, and other material. However, how these communities form, are structured, and evolve over time is unknown. Collected using a custom-designed webcrawler, we begin from known child sexual exploitation (CE) seed websites and follow hyperlinks to connected, related, websites. Using a repeated measure design we analyze 10 networks of 300 + websites each - over 4.8 million unique webpages in total, over a period of 60 weeks. Community detection techniques reveal that CE-related networks were dominated by two large communities hosting varied material -not necessarily matching the seed website. Community stability, over 60 weeks, varied across networks. Reciprocity in hyperlinking between community members was substantially higher than within the full network, however, websites were not more likely to connect to homogeneous-content websites. Copyright © 2016 Elsevier Inc. All rights reserved.

Transfer of Knowledge on Agroforestry Management Practices: the Structure of Farmer Advice Networks

Directory of Open Access Journals (Sweden)

Marney E. Isaac

2007-12-01

Full Text Available Access to knowledge on farm management practices is essential for the maintenance of productive agroforestry systems. Farmers who lack the means to acquire farming knowledge from formal sources often rely on information within their informal social networks. However, little research has explored the explicit structure of farmer communication patterns. We examined advice network structures by using farmer attributes, i.e., kin relationships, community involvement, and imitation, to characterize structural positions and investigated the consequences of such structure on farming practices in cocoa agroforestry systems in Ghana, West Africa. Furthermore, we used a multicommunity approach; we constructed networks for four communities to increase replication and enhance the generality of our conclusions. A high density of advice ties occurred among a small group of farmers, indicating a core-periphery structure. Settler farmers composed 73% of core position members, suggesting that social proximity did not control the formation of informal advice structures. Because core farmers were highly participative in community activities, the promotion of community involvement may facilitate the movement of knowledge and social exchange to strengthen informal networks. Farmers in both core and peripheral structural positions indicated that they observed fellow farmers and subsequently adopted their practices. Of highly sought farmers, 84% used external information, predominately from government institutions, thus functioning as bridging links between formal and informal networks. Both external and farmer-derived sources of knowledge of agroforestry practices were transferred through informal advice networks, providing available information throughout the farming community, as well as a foundation for community-based adaptive management.

Extending a configuration model to find communities in complex networks

International Nuclear Information System (INIS)

Jin, Di; Hu, Qinghua; He, Dongxiao; Yang, Bo; Baquero, Carlos

2013-01-01

Discovery of communities in complex networks is a fundamental data analysis task in various domains. Generative models are a promising class of techniques for identifying modular properties from networks, which has been actively discussed recently. However, most of them cannot preserve the degree sequence of networks, which will distort the community detection results. Rather than using a blockmodel as most current works do, here we generalize a configuration model, namely, a null model of modularity, to solve this problem. Towards decomposing and combining sub-graphs according to the soft community memberships, our model incorporates the ability to describe community structures, something the original model does not have. Also, it has the property, as with the original model, that it fixes the expected degree sequence to be the same as that of the observed network. We combine both the community property and degree sequence preserving into a single unified model, which gives better community results compared with other models. Thereafter, we learn the model using a technique of nonnegative matrix factorization and determine the number of communities by applying consensus clustering. We test this approach both on synthetic benchmarks and on real-world networks, and compare it with two similar methods. The experimental results demonstrate the superior performance of our method over competing methods in detecting both disjoint and overlapping communities. (paper)

Dynamic robustness of knowledge collaboration network of open source product development community

Science.gov (United States)

Zhou, Hong-Li; Zhang, Xiao-Dong

2018-01-01

As an emergent innovative design style, open source product development communities are characterized by a self-organizing, mass collaborative, networked structure. The robustness of the community is critical to its performance. Using the complex network modeling method, the knowledge collaboration network of the community is formulated, and the robustness of the network is systematically and dynamically studied. The characteristics of the network along the development period determine that its robustness should be studied from three time stages: the start-up, development and mature stages of the network. Five kinds of user-loss pattern are designed, to assess the network's robustness under different situations in each of these three time stages. Two indexes - the largest connected component and the network efficiency - are used to evaluate the robustness of the community. The proposed approach is applied in an existing open source car design community. The results indicate that the knowledge collaboration networks show different levels of robustness in different stages and different user loss patterns. Such analysis can be applied to provide protection strategies for the key users involved in knowledge dissemination and knowledge contribution at different stages of the network, thereby promoting the sustainable and stable development of the open source community.

Endogenous Cortical Oscillations Constrain Neuromodulation by Weak Electric Fields

Science.gov (United States)

Schmidt, Stephen L.; Iyengar, Apoorva K.; Foulser, A. Alban; Boyle, Michael R.; Fröhlich, Flavio

2014-01-01

Background Transcranial alternating current stimulation (tACS) is a non-invasive brain stimulation modality that may modulate cognition by enhancing endogenous neocortical oscillations with the application of sine-wave electric fields. Yet, the role of endogenous network activity in enabling and shaping the effects of tACS has remained unclear. Objective We combined optogenetic stimulation and multichannel slice electrophysiology to elucidate how the effect of weak sine-wave electric field depends on the ongoing cortical oscillatory activity. We hypothesized that the structure of the response to stimulation depended on matching the stimulation frequency to the endogenous cortical oscillation. Methods We studied the effect of weak sine-wave electric fields on oscillatory activity in mouse neocortical slices. Optogenetic control of the network activity enabled the generation of in vivo like cortical oscillations for studying the temporal relationship between network activity and sine-wave electric field stimulation. Results Weak electric fields enhanced endogenous oscillations but failed to induce a frequency shift of the ongoing oscillation for stimulation frequencies that were not matched to the endogenous oscillation. This constraint on the effect of electric field stimulation imposed by endogenous network dynamics was limited to the case of weak electric fields targeting in vivo-like network dynamics. Together, these results suggest that the key mechanism of tACS may be enhancing but not overriding of intrinsic network dynamics. Conclusion Our results contribute to understanding the inconsistent tACS results from human studies and propose that stimulation precisely adjusted in frequency to the endogenous oscillations is key to rational design of non-invasive brain stimulation paradigms. PMID:25129402

Community structure informs species geographic distributions

KAUST Repository

Montesinos-Navarro, Alicia

2018-05-23

Understanding what determines species\\' geographic distributions is crucial for assessing global change threats to biodiversity. Measuring limits on distributions is usually, and necessarily, done with data at large geographic extents and coarse spatial resolution. However, survival of individuals is determined by processes that happen at small spatial scales. The relative abundance of coexisting species (i.e. \\'community structure\\') reflects assembly processes occurring at small scales, and are often available for relatively extensive areas, so could be useful for explaining species distributions. We demonstrate that Bayesian Network Inference (BNI) can overcome several challenges to including community structure into studies of species distributions, despite having been little used to date. We hypothesized that the relative abundance of coexisting species can improve predictions of species distributions. In 1570 assemblages of 68 Mediterranean woody plant species we used BNI to incorporate community structure into Species Distribution Models (SDMs), alongside environmental information. Information on species associations improved SDM predictions of community structure and species distributions moderately, though for some habitat specialists the deviance explained increased by up to 15%. We demonstrate that most species associations (95%) were positive and occurred between species with ecologically similar traits. This suggests that SDM improvement could be because species co-occurrences are a proxy for local ecological processes. Our study shows that Bayesian Networks, when interpreted carefully, can be used to include local conditions into measurements of species\\' large-scale distributions, and this information can improve the predictions of species distributions.

Using Social Network Analysis to Evaluate Community Capacity Building of a Regional Community Cancer Network

Science.gov (United States)

Luque, John; Tyson, Dinorah Martinez; Lee, Ji-Hyun; Gwede, Clement; Vadaparampil, Susan; Noel-Thomas, Shalewa; Meade, Cathy

2010-01-01

The Tampa Bay Community Cancer Network (TBCCN) is one of 25 Community Network Programs funded by the National Cancer Institute's (NCI's) Center to Reduce Cancer Health Disparities with the objectives to create a collaborative infrastructure of academic and community based organizations and to develop effective and sustainable interventions to…

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

Science.gov (United States)

Xi, Xian; An, Haizhong

2018-01-01

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

Complex network perspective on structure and function of ...

Indian Academy of Sciences (India)

of community social networks, which are dense node–node links within modules, but have sparser links between ... 3.2 Bow tie structure. The whole metabolic network of S. aureus is then decomposed into four parts based on the 'bow tie' structure (figure 2, table 2). It should be noted that most nodes in S, P and IS parts are ...

Stable amplitude chimera states in a network of locally coupled Stuart-Landau oscillators

Science.gov (United States)

Premalatha, K.; Chandrasekar, V. K.; Senthilvelan, M.; Lakshmanan, M.

2018-03-01

We investigate the occurrence of collective dynamical states such as transient amplitude chimera, stable amplitude chimera, and imperfect breathing chimera states in a locally coupled network of Stuart-Landau oscillators. In an imperfect breathing chimera state, the synchronized group of oscillators exhibits oscillations with large amplitudes, while the desynchronized group of oscillators oscillates with small amplitudes, and this behavior of coexistence of synchronized and desynchronized oscillations fluctuates with time. Then, we analyze the stability of the amplitude chimera states under various circumstances, including variations in system parameters and coupling strength, and perturbations in the initial states of the oscillators. For an increase in the value of the system parameter, namely, the nonisochronicity parameter, the transient chimera state becomes a stable chimera state for a sufficiently large value of coupling strength. In addition, we also analyze the stability of these states by perturbing the initial states of the oscillators. We find that while a small perturbation allows one to perturb a large number of oscillators resulting in a stable amplitude chimera state, a large perturbation allows one to perturb a small number of oscillators to get a stable amplitude chimera state. We also find the stability of the transient and stable amplitude chimera states and traveling wave states for an appropriate number of oscillators using Floquet theory. In addition, we also find the stability of the incoherent oscillation death states.

Interaction of chimera states in a multilayered network of nonlocally coupled oscillators

Science.gov (United States)

Goremyko, M. V.; Maksimenko, V. A.; Makarov, V. V.; Ghosh, D.; Bera, B.; Dana, S. K.; Hramov, A. E.

2017-08-01

The processes of formation and evolution of chimera states in the model of a multilayered network of nonlinear elements with complex coupling topology are studied. A two-layered network of nonlocally intralayer-coupled Kuramoto-Sakaguchi phase oscillators is taken as the object of investigation. Different modes implemented in this system upon variation of the degree of interlayer interaction are demonstrated.

Structure-function relationship in complex brain networks expressed by hierarchical synchronization

International Nuclear Information System (INIS)

Zhou Changsong; Zemanova, Lucia; Zamora-Lopez, Gorka; Hilgetag, Claus C; Kurths, Juergen

2007-01-01

The brain is one of the most complex systems in nature, with a structured complex connectivity. Recently, large-scale corticocortical connectivities, both structural and functional, have received a great deal of research attention, especially using the approach of complex network analysis. Understanding the relationship between structural and functional connectivity is of crucial importance in neuroscience. Here we try to illuminate this relationship by studying synchronization dynamics in a realistic anatomical network of cat cortical connectivity. We model the nodes (cortical areas) by a neural mass model (population model) or by a subnetwork of interacting excitable neurons (multilevel model). We show that if the dynamics is characterized by well-defined oscillations (neural mass model and subnetworks with strong couplings), the synchronization patterns are mainly determined by the node intensity (total input strengths of a node) and the detailed network topology is rather irrelevant. On the other hand, the multilevel model with weak couplings displays more irregular, biologically plausible dynamics, and the synchronization patterns reveal a hierarchical cluster organization in the network structure. The relationship between structural and functional connectivity at different levels of synchronization is explored. Thus, the study of synchronization in a multilevel complex network model of cortex can provide insights into the relationship between network topology and functional organization of complex brain networks

Structure-function relationship in complex brain networks expressed by hierarchical synchronization

Energy Technology Data Exchange (ETDEWEB)

Zhou Changsong [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany); Zemanova, Lucia [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany); Zamora-Lopez, Gorka [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany); Hilgetag, Claus C [Jacobs University Bremen, Campus Ring 6, Rm 116, D-28759 Bremen (Germany); Kurths, Juergen [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany)

2007-06-15

The brain is one of the most complex systems in nature, with a structured complex connectivity. Recently, large-scale corticocortical connectivities, both structural and functional, have received a great deal of research attention, especially using the approach of complex network analysis. Understanding the relationship between structural and functional connectivity is of crucial importance in neuroscience. Here we try to illuminate this relationship by studying synchronization dynamics in a realistic anatomical network of cat cortical connectivity. We model the nodes (cortical areas) by a neural mass model (population model) or by a subnetwork of interacting excitable neurons (multilevel model). We show that if the dynamics is characterized by well-defined oscillations (neural mass model and subnetworks with strong couplings), the synchronization patterns are mainly determined by the node intensity (total input strengths of a node) and the detailed network topology is rather irrelevant. On the other hand, the multilevel model with weak couplings displays more irregular, biologically plausible dynamics, and the synchronization patterns reveal a hierarchical cluster organization in the network structure. The relationship between structural and functional connectivity at different levels of synchronization is explored. Thus, the study of synchronization in a multilevel complex network model of cortex can provide insights into the relationship between network topology and functional organization of complex brain networks.

Social network community structure and the contact-mediated sharing of commensal E. coli among captive rhesus macaques (Macaca mulatta).

Science.gov (United States)

Balasubramaniam, Krishna; Beisner, Brianne; Guan, Jiahui; Vandeleest, Jessica; Fushing, Hsieh; Atwill, Edward; McCowan, Brenda

2018-01-01

depend on both individuals' direct connections and on secondary network pathways that define community structure. They lend support to the hypothesis that social network communities may act as bottlenecks to contain the spread of infectious agents, thereby encouraging disease control strategies to focus on multiple organizational scales. Future directions includeincreasing microbial sampling effort per individual to better-detect dyadic transmission events, and assessments of the co-evolutionary links between sociality, infectious agent risk, and host immune function.

Inference and Analysis of Population Structure Using Genetic Data and Network Theory.

Science.gov (United States)

Greenbaum, Gili; Templeton, Alan R; Bar-David, Shirli

2016-04-01

Clustering individuals to subpopulations based on genetic data has become commonplace in many genetic studies. Inference about population structure is most often done by applying model-based approaches, aided by visualization using distance-based approaches such as multidimensional scaling. While existing distance-based approaches suffer from a lack of statistical rigor, model-based approaches entail assumptions of prior conditions such as that the subpopulations are at Hardy-Weinberg equilibria. Here we present a distance-based approach for inference about population structure using genetic data by defining population structure using network theory terminology and methods. A network is constructed from a pairwise genetic-similarity matrix of all sampled individuals. The community partition, a partition of a network to dense subgraphs, is equated with population structure, a partition of the population to genetically related groups. Community-detection algorithms are used to partition the network into communities, interpreted as a partition of the population to subpopulations. The statistical significance of the structure can be estimated by using permutation tests to evaluate the significance of the partition's modularity, a network theory measure indicating the quality of community partitions. To further characterize population structure, a new measure of the strength of association (SA) for an individual to its assigned community is presented. The strength of association distribution (SAD) of the communities is analyzed to provide additional population structure characteristics, such as the relative amount of gene flow experienced by the different subpopulations and identification of hybrid individuals. Human genetic data and simulations are used to demonstrate the applicability of the analyses. The approach presented here provides a novel, computationally efficient model-free method for inference about population structure that does not entail assumption of

Model of community emergence in weighted social networks

Science.gov (United States)

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

2009-04-01

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

Creative Network Communities in the Translocal Space of Digital Networks

Directory of Open Access Journals (Sweden)

Rasa Smite

2013-01-01

Full Text Available What should sociological research be in the age of Web 2.0? Considering that the task of “network sociology” is not only empirical research but also the interpretation of tendencies of the network culture, this research explores the rise of network communities within Eastern and Western Europe in the early Internet era. I coined the term creative networks to distinguish these early creative and social activities from today’s popular social networking. Thus I aimed to interpret the meaning of social action; the motivation of creative community actors, their main fields of activities and social organization forms; and the potential that these early developments contain for the future sustainability of networks. Data comprise interviews with networking experts and founders and members of various networks. Investigating respondents’ motivations for creating online networks and communities, and interpreting those terms, allows for comparing the creative networks of the 1990s with today’s social networks and for drawing conclusions.

Gap junction networks can generate both ripple-like and fast ripple-like oscillations

Science.gov (United States)

Simon, Anna; Traub, Roger D.; Vladimirov, Nikita; Jenkins, Alistair; Nicholson, Claire; Whittaker, Roger G.; Schofield, Ian; Clowry, Gavin J.; Cunningham, Mark O.; Whittington, Miles A.

2014-01-01

Fast ripples (FRs) are network oscillations, defined variously as having frequencies of > 150 to > 250 Hz, with a controversial mechanism. FRs appear to indicate a propensity of cortical tissue to originate seizures. Here, we demonstrate field oscillations, at up to 400 Hz, in spontaneously epileptic human cortical tissue in vitro, and present a network model that could explain FRs themselves, and their relation to ‘ordinary’ (slower) ripples. We performed network simulations with model pyramidal neurons, having axons electrically coupled. Ripples ( 250 Hz, were sustained or interrupted, and had little jitter in the firing of individual axons. The form of model FR was similar to spontaneously occurring FRs in excised human epileptic tissue. In vitro, FRs were suppressed by a gap junction blocker. Our data suggest that a given network can produce ripples, FRs, or both, via gap junctions, and that FRs are favored by clusters of axonal gap junctions. If axonal gap junctions indeed occur in epileptic tissue, and are mediated by connexin 26 (recently shown to mediate coupling between immature neocortical pyramidal cells), then this prediction is testable. PMID:24118191

Fine-structure energy levels, oscillator strengths and lifetimes of ...

Indian Academy of Sciences (India)

with the experimental results compiled in the NIST Data Base. Many new ... Keywords. Relativistic fine-structure levels; oscillator strengths; lifetimes. ... have calculated oscillator strengths and lifetimes using the Briet–Pauli R-Matrix ..... [2] The Opacity Project Team, The Opacity Project (Institute of Physics Publishing,. Bristol ...

Improving the recommender algorithms with the detected communities in bipartite networks

Science.gov (United States)

Zhang, Peng; Wang, Duo; Xiao, Jinghua

2017-04-01

Recommender system offers a powerful tool to make information overload problem well solved and thus gains wide concerns of scholars and engineers. A key challenge is how to make recommendations more accurate and personalized. We notice that community structures widely exist in many real networks, which could significantly affect the recommendation results. By incorporating the information of detected communities in the recommendation algorithms, an improved recommendation approach for the networks with communities is proposed. The approach is examined in both artificial and real networks, the results show that the improvement on accuracy and diversity can be 20% and 7%, respectively. This reveals that it is beneficial to classify the nodes based on the inherent properties in recommender systems.

Detecting highly overlapping community structure by greedy clique expansion

OpenAIRE

Lee, Conrad; Reid, Fergal; McDaid, Aaron; Hurley, Neil

2010-01-01

In complex networks it is common for each node to belong to several communities, implying a highly overlapping community structure. Recent advances in benchmarking indicate that existing community assignment algorithms that are capable of detecting overlapping communities perform well only when the extent of community overlap is kept to modest levels. To overcome this limitation, we introduce a new community assignment algorithm called Greedy Clique Expansion (GCE). The algorithm identifies d...

Exploring the Impact of Network Structure and Demand Collaboration on the Dynamics of a Supply Chain Network Using a Robust Control Approach

Directory of Open Access Journals (Sweden)

Yongchang Wei

2015-01-01

uncertain environment. The impact of network structure and collaboration on the dynamics and robustness of supply chain network, however, remains to be explored. In this paper, a unified state space model for a two-layer supply chain network composed of multiple distributors and multiple retailers is developed. A robust control algorithm is advocated to reduce both order and demand fluctuations for unknown demand. Numerical simulations demonstrate that the robust control approach has the advantage to reduce both inventory and order fluctuations. In the simulation experiment, it is interesting to notice that complex network structure and collaborations might contribute to the reduction of inventory and order oscillations. This paper yields new insights into the overestimated bullwhip effect problem and helps us understand the complexities of supply chain networks.

Hermite Functional Link Neural Network for Solving the Van der Pol-Duffing Oscillator Equation.

Science.gov (United States)

Mall, Susmita; Chakraverty, S

2016-08-01

Hermite polynomial-based functional link artificial neural network (FLANN) is proposed here to solve the Van der Pol-Duffing oscillator equation. A single-layer hermite neural network (HeNN) model is used, where a hidden layer is replaced by expansion block of input pattern using Hermite orthogonal polynomials. A feedforward neural network model with the unsupervised error backpropagation principle is used for modifying the network parameters and minimizing the computed error function. The Van der Pol-Duffing and Duffing oscillator equations may not be solved exactly. Here, approximate solutions of these types of equations have been obtained by applying the HeNN model for the first time. Three mathematical example problems and two real-life application problems of Van der Pol-Duffing oscillator equation, extracting the features of early mechanical failure signal and weak signal detection problems, are solved using the proposed HeNN method. HeNN approximate solutions have been compared with results obtained by the well known Runge-Kutta method. Computed results are depicted in term of graphs. After training the HeNN model, we may use it as a black box to get numerical results at any arbitrary point in the domain. Thus, the proposed HeNN method is efficient. The results reveal that this method is reliable and can be applied to other nonlinear problems too.

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

Science.gov (United States)

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

2015-02-01

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

The macroecology of phylogenetically structured hummingbird-plant networks

DEFF Research Database (Denmark)

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

2015-01-01

Aim To investigate the association between hummingbird–plant network structure and species richness, phylogenetic signal on species' interaction pattern, insularity and historical and current climate. Location Fifty-four communities along a c. 10,000 km latitudinal gradient across the Americas (39...... approach, we examined the influence of species richness, phylogenetic signal, insularity and current and historical climate conditions on network structure (null-model-corrected specialization and modularity). Results Phylogenetically related species, especially plants, showed a tendency to interact...... with a similar array of mutualistic partners. The spatial variation in network structure exhibited a constant association with species phylogeny (R2 = 0.18–0.19); however, network structure showed the strongest association with species richness and environmental factors (R2 = 0.20–0.44 and R2 = 0...

Decoding communities in networks.

Science.gov (United States)

Radicchi, Filippo

2018-02-01

According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

Decoding communities in networks

Science.gov (United States)

Radicchi, Filippo

2018-02-01

According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

Partial synchronization in networks of non-linearly coupled oscillators: The Deserter Hubs Model

Energy Technology Data Exchange (ETDEWEB)

Freitas, Celso, E-mail: cbnfreitas@gmail.com; Macau, Elbert, E-mail: elbert.macau@inpe.br [Associate Laboratory for Computing and Applied Mathematics - LAC, Brazilian National Institute for Space Research - INPE (Brazil); Pikovsky, Arkady, E-mail: pikovsky@uni-potsdam.de [Department of Physics and Astronomy, University of Potsdam, Germany and Department of Control Theory, Nizhni Novgorod State University, Gagarin Av. 23, 606950, Nizhni Novgorod (Russian Federation)

2015-04-15

We study the Deserter Hubs Model: a Kuramoto-like model of coupled identical phase oscillators on a network, where attractive and repulsive couplings are balanced dynamically due to nonlinearity of interactions. Under weak force, an oscillator tends to follow the phase of its neighbors, but if an oscillator is compelled to follow its peers by a sufficient large number of cohesive neighbors, then it actually starts to act in the opposite manner, i.e., in anti-phase with the majority. Analytic results yield that if the repulsion parameter is small enough in comparison with the degree of the maximum hub, then the full synchronization state is locally stable. Numerical experiments are performed to explore the model beyond this threshold, where the overall cohesion is lost. We report in detail partially synchronous dynamical regimes, like stationary phase-locking, multistability, periodic and chaotic states. Via statistical analysis of different network organizations like tree, scale-free, and random ones, we found a measure allowing one to predict relative abundance of partially synchronous stationary states in comparison to time-dependent ones.

Community-centred Networks and Networking among Companies, Educational and Cultural Institutions and Research

DEFF Research Database (Denmark)

Konnerup, Ulla; Dirckinck-Holmfeld, Lone

2010-01-01

This article presents visions for community-centred networks and networking among companies, educational and cultural institutions and research based on blended on- and off-line collaboration and communication. Our point of departure is the general vision of networking between government, industry...... and research as formulated in the Triple Helix Model (Etzkowitz 2008). The article draws on a case study of NoEL, a network on e-learning among business, educational and cultural institutions and research, all in all 21 partners from all around Denmark. Focus is how networks and networking change character......’ in Networked Learning, Wenger et al. 2009; The analysis concerns the participation structure and how the network activities connect local work practices and research, and how technology and online communication contribute to a change from participation in offline and physical network activities into online...

A Markov random walk under constraint for discovering overlapping communities in complex networks

International Nuclear Information System (INIS)

Jin, Di; Yang, Bo; Liu, Dayou; He, Dongxiao; Liu, Jie; Baquero, Carlos

2011-01-01

The detection of overlapping communities in complex networks has motivated recent research in relevant fields. Aiming to address this problem, we propose a Markov-dynamics-based algorithm, called UEOC, which means 'unfold and extract overlapping communities'. In UEOC, when identifying each natural community that overlaps, a Markov random walk method combined with a constraint strategy, which is based on the corresponding annealed network (degree conserving random network), is performed to unfold the community. Then, a cutoff criterion with the aid of a local community function, called conductance, which can be thought of as the ratio between the number of edges inside the community and those leaving it, is presented to extract this emerged community from the entire network. The UEOC algorithm depends on only one parameter whose value can be easily set, and it requires no prior knowledge of the hidden community structures. The proposed UEOC has been evaluated both on synthetic benchmarks and on some real-world networks, and has been compared with a set of competing algorithms. The experimental result has shown that UEOC is highly effective and efficient for discovering overlapping communities

Emergence of a multilayer structure in adaptive networks of phase oscillators

International Nuclear Information System (INIS)

Makarov, V.V.; Koronovskii, A.A.; Maksimenko, V.A.; Hramov, A.E.; Moskalenko, O.I.; Buldú, J.M.; Boccaletti, S.

2016-01-01

We report on self-organization of adaptive networks, where topology and dynamics evolve in accordance to a competition between homophilic and homeostatic mechanisms, and where links are associated to a vector of weights. Under an appropriate balance between the intra- and inter- layer coupling strengths, we show that a multilayer structure emerges due to the adaptive evolution, resulting in different link weights at each layer, i.e. different components of the weights’ vector. In parallel, synchronized clusters at each layer are formed, which may overlap or not, depending on the values of the coupling strengths. Only when intra- and inter- layer coupling strengths are high enough, all layers reach identical final topologies, collapsing the system into, in fact, a monolayer network. The relationships between such steady state topologies and a set of dynamical network’s properties are discussed.

Cortical networks dynamically emerge with the interplay of slow and fast oscillations for memory of a natural scene.

Science.gov (United States)

Mizuhara, Hiroaki; Sato, Naoyuki; Yamaguchi, Yoko

2015-05-01

Neural oscillations are crucial for revealing dynamic cortical networks and for serving as a possible mechanism of inter-cortical communication, especially in association with mnemonic function. The interplay of the slow and fast oscillations might dynamically coordinate the mnemonic cortical circuits to rehearse stored items during working memory retention. We recorded simultaneous EEG-fMRI during a working memory task involving a natural scene to verify whether the cortical networks emerge with the neural oscillations for memory of the natural scene. The slow EEG power was enhanced in association with the better accuracy of working memory retention, and accompanied cortical activities in the mnemonic circuits for the natural scene. Fast oscillation showed a phase-amplitude coupling to the slow oscillation, and its power was tightly coupled with the cortical activities for representing the visual images of natural scenes. The mnemonic cortical circuit with the slow neural oscillations would rehearse the distributed natural scene representations with the fast oscillation for working memory retention. The coincidence of the natural scene representations could be obtained by the slow oscillation phase to create a coherent whole of the natural scene in the working memory. Copyright © 2015 Elsevier Inc. All rights reserved.

Chimera states in bipartite networks of FitzHugh-Nagumo oscillators

Science.gov (United States)

Wu, Zhi-Min; Cheng, Hong-Yan; Feng, Yuee; Li, Hai-Hong; Dai, Qiong-Lin; Yang, Jun-Zhong

2018-04-01

Chimera states consisting of spatially coherent and incoherent domains have been observed in different topologies such as rings, spheres, and complex networks. In this paper, we investigate bipartite networks of nonlocally coupled FitzHugh-Nagumo (FHN) oscillators in which the units are allocated evenly to two layers, and FHN units interact with each other only when they are in different layers. We report the existence of chimera states in bipartite networks. Owing to the interplay between chimera states in the two layers, many types of chimera states such as in-phase chimera states, antiphase chimera states, and out-of-phase chimera states are classified. Stability diagrams of several typical chimera states in the coupling strength-coupling radius plane, which show strong multistability of chimera states, are explored.

Power oscillation damping controller

DEFF Research Database (Denmark)

2012-01-01

A power oscillation damping controller is provided for a power generation device such as a wind turbine device. The power oscillation damping controller receives an oscillation indicating signal indicative of a power oscillation in an electricity network and provides an oscillation damping control...

Dynamic synchronization of a time-evolving optical network of chaotic oscillators.

Science.gov (United States)

Cohen, Adam B; Ravoori, Bhargava; Sorrentino, Francesco; Murphy, Thomas E; Ott, Edward; Roy, Rajarshi

2010-12-01

We present and experimentally demonstrate a technique for achieving and maintaining a global state of identical synchrony of an arbitrary network of chaotic oscillators even when the coupling strengths are unknown and time-varying. At each node an adaptive synchronization algorithm dynamically estimates the current strength of the net coupling signal to that node. We experimentally demonstrate this scheme in a network of three bidirectionally coupled chaotic optoelectronic feedback loops and we present numerical simulations showing its application in larger networks. The stability of the synchronous state for arbitrary coupling topologies is analyzed via a master stability function approach. © 2010 American Institute of Physics.

Efficient community-based control strategies in adaptive networks

International Nuclear Information System (INIS)

Yang Hui; Tang Ming; Zhang Haifeng

2012-01-01

Most studies on adaptive networks concentrate on the properties of steady state, but neglect transient dynamics. In this study, we pay attention to the emergence of community structure in the transient process and the effects of community-based control strategies on epidemic spreading. First, by normalizing the modularity, we investigate the evolution of community structure during the transient process, and find that a strong community structure is induced by the rewiring mechanism in the early stage of epidemic dynamics, which, remarkably, delays the outbreak of disease. We then study the effects of control strategies started at different stages on the prevalence. Both immunization and quarantine strategies indicate that it is not ‘the earlier, the better’ for the implementation of control measures. And the optimal control effect is obtained if control measures can be efficiently implemented in the period of a strong community structure. For the immunization strategy, immunizing the susceptible nodes on susceptible–infected links and immunizing susceptible nodes randomly have similar control effects. However, for the quarantine strategy, quarantining the infected nodes on susceptible–infected links can yield a far better result than quarantining infected nodes randomly. More significantly, the community-based quarantine strategy performs better than the community-based immunization strategy. This study may shed new light on the forecast and the prevention of epidemics among humans. (paper)

Community detection in complex networks using proximate support vector clustering

Science.gov (United States)

Wang, Feifan; Zhang, Baihai; Chai, Senchun; Xia, Yuanqing

2018-03-01

Community structure, one of the most attention attracting properties in complex networks, has been a cornerstone in advances of various scientific branches. A number of tools have been involved in recent studies concentrating on the community detection algorithms. In this paper, we propose a support vector clustering method based on a proximity graph, owing to which the introduced algorithm surpasses the traditional support vector approach both in accuracy and complexity. Results of extensive experiments undertaken on computer generated networks and real world data sets illustrate competent performances in comparison with the other counterparts.

Structure constrained by metadata in networks of chess players.

Science.gov (United States)

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

2017-11-09

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

Analysis of structural patterns in the brain with the complex network approach

Science.gov (United States)

Maksimenko, Vladimir A.; Makarov, Vladimir V.; Kharchenko, Alexander A.; Pavlov, Alexey N.; Khramova, Marina V.; Koronovskii, Alexey A.; Hramov, Alexander E.

2015-03-01

In this paper we study mechanisms of the phase synchronization in a model network of Van der Pol oscillators and in the neural network of the brain by consideration of macroscopic parameters of these networks. As the macroscopic characteristics of the model network we consider a summary signal produced by oscillators. Similar to the model simulations, we study EEG signals reflecting the macroscopic dynamics of neural network. We show that the appearance of the phase synchronization leads to an increased peak in the wavelet spectrum related to the dynamics of synchronized oscillators. The observed correlation between the phase relations of individual elements and the macroscopic characteristics of the whole network provides a way to detect phase synchronization in the neural networks in the cases of normal and pathological activity.

Oscillating water column structural model

Energy Technology Data Exchange (ETDEWEB)

Copeland, Guild [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Bull, Diana L [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Jepsen, Richard Alan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Gordon, Margaret Ellen [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2014-09-01

An oscillating water column (OWC) wave energy converter is a structure with an opening to the ocean below the free surface, i.e. a structure with a moonpool. Two structural models for a non-axisymmetric terminator design OWC, the Backward Bent Duct Buoy (BBDB) are discussed in this report. The results of this structural model design study are intended to inform experiments and modeling underway in support of the U.S. Department of Energy (DOE) initiated Reference Model Project (RMP). A detailed design developed by Re Vision Consulting used stiffeners and girders to stabilize the structure against the hydrostatic loads experienced by a BBDB device. Additional support plates were added to this structure to account for loads arising from the mooring line attachment points. A simplified structure was designed in a modular fashion. This simplified design allows easy alterations to the buoyancy chambers and uncomplicated analysis of resulting changes in buoyancy.

Self-sustained oscillations in blood flow through a honeycomb capillary network.

Science.gov (United States)

Davis, J M; Pozrikidis, C

2014-09-01

Numerical simulations of unsteady blood flow through a honeycomb network originating at multiple inlets and terminating at multiple outlets are presented and discussed under the assumption that blood behaves as a continuum with variable constitution. Unlike a tree network, the honeycomb network exhibits both diverging and converging bifurcations between branching capillary segments. Numerical results based on a finite difference method demonstrate that as in the case of tree networks considered in previous studies, the cell partitioning law at diverging bifurcations is an important parameter in both steady and unsteady flow. Specifically, a steady flow may spontaneously develop self-sustained oscillations at critical conditions by way of a Hopf bifurcation. Contrary to tree-like networks comprised entirely of diverging bifurcations, the critical parameters for instability in honeycomb networks depend weakly on the system size. The blockage of one or more network segments due to the presence of large cells or the occurrence of capillary constriction may cause flow reversal or trigger a transition to unsteady flow.

At the edge? HIV stigma and centrality in a community's social network in Namibia.

Science.gov (United States)

Smith, Rachel A; Baker, Michelle

2012-04-01

Social network analysis was used to examine the relationship between HIV/AIDS stigmatization, perceived risk, and centrality in the community network (via participation in community groups). The findings from respondents in Keetmanshoop, Namibia (N = 375) showed an interaction between stigma and risk perceptions\\hose who perceived higher HIV risk and stronger HIV stigma participated in fewer community groups and participated in groups with members who participated less widely across the network. In contrast, those who perceived higher HIV risk and weaker HIV stigma participated more, and were in community groups that are located on a greater share of the paths between entities in the network. Taboo, secrecy, resistance, knowing a person living with HIV/AIDS, and desire for diagnosis secrecy were also related to centrality. Findings suggest that the interaction of perceived HIV risk and HIV stigma are related to structural-level features of community networks based on participation in community groups.

Interest communities and flow roles in directed networks: the Twitter network of the UK riots.

Science.gov (United States)

Beguerisse-Díaz, Mariano; Garduño-Hernández, Guillermo; Vangelov, Borislav; Yaliraki, Sophia N; Barahona, Mauricio

2014-12-06

Directionality is a crucial ingredient in many complex networks in which information, energy or influence are transmitted. In such directed networks, analysing flows (and not only the strength of connections) is crucial to reveal important features of the network that might go undetected if the orientation of connections is ignored. We showcase here a flow-based approach for community detection through the study of the network of the most influential Twitter users during the 2011 riots in England. Firstly, we use directed Markov Stability to extract descriptions of the network at different levels of coarseness in terms of interest communities, i.e. groups of nodes within which flows of information are contained and reinforced. Such interest communities reveal user groupings according to location, profession, employer and topic. The study of flows also allows us to generate an interest distance, which affords a personalized view of the attention in the network as viewed from the vantage point of any given user. Secondly, we analyse the profiles of incoming and outgoing long-range flows with a combined approach of role-based similarity and the novel relaxed minimum spanning tree algorithm to reveal that the users in the network can be classified into five roles. These flow roles go beyond the standard leader/follower dichotomy and differ from classifications based on regular/structural equivalence. We then show that the interest communities fall into distinct informational organigrams characterized by a different mix of user roles reflecting the quality of dialogue within them. Our generic framework can be used to provide insight into how flows are generated, distributed, preserved and consumed in directed networks.

Finding local communities in protein networks.

Science.gov (United States)

Voevodski, Konstantin; Teng, Shang-Hua; Xia, Yu

2009-09-18

Protein-protein interactions (PPIs) play fundamental roles in nearly all biological processes, and provide major insights into the inner workings of cells. A vast amount of PPI data for various organisms is available from BioGRID and other sources. The identification of communities in PPI networks is of great interest because they often reveal previously unknown functional ties between proteins. A large number of global clustering algorithms have been applied to protein networks, where the entire network is partitioned into clusters. Here we take a different approach by looking for local communities in PPI networks. We develop a tool, named Local Protein Community Finder, which quickly finds a community close to a queried protein in any network available from BioGRID or specified by the user. Our tool uses two new local clustering algorithms Nibble and PageRank-Nibble, which look for a good cluster among the most popular destinations of a short random walk from the queried vertex. The quality of a cluster is determined by proportion of outgoing edges, known as conductance, which is a relative measure particularly useful in undersampled networks. We show that the two local clustering algorithms find communities that not only form excellent clusters, but are also likely to be biologically relevant functional components. We compare the performance of Nibble and PageRank-Nibble to other popular and effective graph partitioning algorithms, and show that they find better clusters in the graph. Moreover, Nibble and PageRank-Nibble find communities that are more functionally coherent. The Local Protein Community Finder, accessible at http://xialab.bu.edu/resources/lpcf, allows the user to quickly find a high-quality community close to a queried protein in any network available from BioGRID or specified by the user. We show that the communities found by our tool form good clusters and are functionally coherent, making our application useful for biologists who wish to

Finding local communities in protein networks

Directory of Open Access Journals (Sweden)

Teng Shang-Hua

2009-09-01

Full Text Available Abstract Background Protein-protein interactions (PPIs play fundamental roles in nearly all biological processes, and provide major insights into the inner workings of cells. A vast amount of PPI data for various organisms is available from BioGRID and other sources. The identification of communities in PPI networks is of great interest because they often reveal previously unknown functional ties between proteins. A large number of global clustering algorithms have been applied to protein networks, where the entire network is partitioned into clusters. Here we take a different approach by looking for local communities in PPI networks. Results We develop a tool, named Local Protein Community Finder, which quickly finds a community close to a queried protein in any network available from BioGRID or specified by the user. Our tool uses two new local clustering algorithms Nibble and PageRank-Nibble, which look for a good cluster among the most popular destinations of a short random walk from the queried vertex. The quality of a cluster is determined by proportion of outgoing edges, known as conductance, which is a relative measure particularly useful in undersampled networks. We show that the two local clustering algorithms find communities that not only form excellent clusters, but are also likely to be biologically relevant functional components. We compare the performance of Nibble and PageRank-Nibble to other popular and effective graph partitioning algorithms, and show that they find better clusters in the graph. Moreover, Nibble and PageRank-Nibble find communities that are more functionally coherent. Conclusion The Local Protein Community Finder, accessible at http://xialab.bu.edu/resources/lpcf, allows the user to quickly find a high-quality community close to a queried protein in any network available from BioGRID or specified by the user. We show that the communities found by our tool form good clusters and are functionally coherent

Multi-scale analysis of the European airspace using network community detection.

Directory of Open Access Journals (Sweden)

Gérald Gurtner

Full Text Available We show that the European airspace can be represented as a multi-scale traffic network whose nodes are airports, sectors, or navigation points and links are defined and weighted according to the traffic of flights between the nodes. By using a unique database of the air traffic in the European airspace, we investigate the architecture of these networks with a special emphasis on their community structure. We propose that unsupervised network community detection algorithms can be used to monitor the current use of the airspace and improve it by guiding the design of new ones. Specifically, we compare the performance of several community detection algorithms, both with fixed and variable resolution, and also by using a null model which takes into account the spatial distance between nodes, and we discuss their ability to find communities that could be used to define new control units of the airspace.

Basin stability measure of different steady states in coupled oscillators

Science.gov (United States)

Rakshit, Sarbendu; Bera, Bidesh K.; Majhi, Soumen; Hens, Chittaranjan; Ghosh, Dibakar

2017-04-01

In this report, we investigate the stabilization of saddle fixed points in coupled oscillators where individual oscillators exhibit the saddle fixed points. The coupled oscillators may have two structurally different types of suppressed states, namely amplitude death and oscillation death. The stabilization of saddle equilibrium point refers to the amplitude death state where oscillations are ceased and all the oscillators converge to the single stable steady state via inverse pitchfork bifurcation. Due to multistability features of oscillation death states, linear stability theory fails to analyze the stability of such states analytically, so we quantify all the states by basin stability measurement which is an universal nonlocal nonlinear concept and it interplays with the volume of basins of attractions. We also observe multi-clustered oscillation death states in a random network and measure them using basin stability framework. To explore such phenomena we choose a network of coupled Duffing-Holmes and Lorenz oscillators which are interacting through mean-field coupling. We investigate how basin stability for different steady states depends on mean-field density and coupling strength. We also analytically derive stability conditions for different steady states and confirm by rigorous bifurcation analysis.

A GABAergic Dysfunction in the Olivary–Cerebellar–Brainstem Network May Cause Eye Oscillations and Body Tremor. II. Model Simulations of Saccadic Eye Oscillations

Directory of Open Access Journals (Sweden)

Lance M. Optican

2017-08-01

Full Text Available Eye and body oscillations are shared features of several neurological diseases, yet their pathophysiology remains unclear. Recently, we published a report on two tennis players with a novel presentation of eye and body oscillations following self-administration of performance-enhancing substances. Opsoclonus/flutter and limb tremor were diagnosed in both patients. Common causes of opsoclonus/flutter were excluded. High-resolution eye movement recordings from one patient showed novel spindle-shaped, asymmetric saccadic oscillations (at ~3.6 Hz and ocular tremor (~40–60 Hz. Based on these findings, we proposed that the oscillations are the result of increased GABAA receptor sensitivity in a circuit involving the cerebellum (vermis and fastigial nuclei, the inferior olives, and the brainstem saccade premotor neurons (excitatory and inhibitory burst neurons, and omnipause neurons. We present a mathematical model of the saccadic system, showing that the proposed dysfunction in the network can reproduce the types of saccadic oscillations seen in these patients.

Social and place-focused communities in location-based online social networks

Science.gov (United States)

Brown, Chloë; Nicosia, Vincenzo; Scellato, Salvatore; Noulas, Anastasios; Mascolo, Cecilia

2013-06-01

Thanks to widely available, cheap Internet access and the ubiquity of smartphones, millions of people around the world now use online location-based social networking services. Understanding the structural properties of these systems and their dependence upon users' habits and mobility has many potential applications, including resource recommendation and link prediction. Here, we construct and characterise social and place-focused graphs by using longitudinal information about declared social relationships and about users' visits to physical places collected from a popular online location-based social service. We show that although the social and place-focused graphs are constructed from the same data set, they have quite different structural properties. We find that the social and location-focused graphs have different global and meso-scale structure, and in particular that social and place-focused communities have negligible overlap. Consequently, group inference based on community detection performed on the social graph alone fails to isolate place-focused groups, even though these do exist in the network. By studying the evolution of tie structure within communities, we show that the time period over which location data are aggregated has a substantial impact on the stability of place-focused communities, and that information about place-based groups may be more useful for user-centric applications than that obtained from the analysis of social communities alone.

Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics.

Directory of Open Access Journals (Sweden)

István A Kovács

Full Text Available BACKGROUND: Network communities help the functional organization and evolution of complex networks. However, the development of a method, which is both fast and accurate, provides modular overlaps and partitions of a heterogeneous network, has proven to be rather difficult. METHODOLOGY/PRINCIPAL FINDINGS: Here we introduce the novel concept of ModuLand, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases. As various adaptations of the method family, we developed several algorithms, which provide an efficient analysis of weighted and directed networks, and (1 determine persvasively overlapping modules with high resolution; (2 uncover a detailed hierarchical network structure allowing an efficient, zoom-in analysis of large networks; (3 allow the determination of key network nodes and (4 help to predict network dynamics. CONCLUSIONS/SIGNIFICANCE: The concept opens a wide range of possibilities to develop new approaches and applications including network routing, classification, comparison and prediction.

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

Science.gov (United States)

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

2015-03-01

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

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

Science.gov (United States)

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.

Assessing Community Informatics: A Review of Methodological Approaches for Evaluating Community Networks and Community Technology Centers.

Science.gov (United States)

O'Neil, Dara

2002-01-01

Analyzes the emerging community informatics evaluation literature to develop an understanding of the indicators used to gauge project impacts in community networks and community technology centers. The study finds that community networks and community technology center assessments fall into five key areas: strong democracy; social capital;…

Quasioptical Josephson oscillator

International Nuclear Information System (INIS)

Wengler, M.J.; Pance, A.; Liu, B.

1991-01-01

This paper discusses the authors' work with large 2-dimensional arrays of Josephson junctions for submillimeter power generation. The basic design of the Quasioptical Josephson Oscillator (QJO) is presented. The reasons for each design decision are discussed. Superconducting devices have not yet been fabricated, but scale models and computer simulations have been done. A method for characterizing array rf coupling structures is described, and initial results with this method are presented. Microwave scale models of the radiation structure are built and a series of measurements are made with a network analyzer

Density-based and transport-based core-periphery structures in networks.

Science.gov (United States)

Lee, Sang Hoon; Cucuringu, Mihai; Porter, Mason A

2014-03-01

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

Emergence of structured communities through evolutionary dynamics.

Science.gov (United States)

Shtilerman, Elad; Kessler, David A; Shnerb, Nadav M

2015-10-21

Species-rich communities, in which many competing species coexist in a single trophic level, are quite frequent in nature, but pose a formidable theoretical challenge. In particular, it is known that complex competitive systems become unstable and unfeasible when the number of species is large. Recently, many studies have attributed the stability of natural communities to the structure of the interspecific interaction network, yet the nature of such structures and the underlying mechanisms responsible for them remain open questions. Here we introduce an evolutionary model, based on the generic Lotka-Volterra competitive framework, from which a stable, structured, diverse community emerges spontaneously. The modular structure of the competition matrix reflects the phylogeny of the community, in agreement with the hierarchial taxonomic classification. Closely related species tend to have stronger niche overlap and weaker fitness differences, as opposed to pairs of species from different modules. The competitive-relatedness hypothesis and the idea of emergent neutrality are discussed in the context of this evolutionary model. Copyright © 2015 Elsevier Ltd. All rights reserved.

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

Energy Technology Data Exchange (ETDEWEB)

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

2007-02-26

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

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

International Nuclear Information System (INIS)

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

2007-01-01

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

Network Analysis in Community Psychology: Looking Back, Looking Forward

OpenAIRE

Neal, Zachary P.; Neal, Jennifer Watling

2017-01-01

Highlights Network analysis is ideally suited for community psychology research because it focuses on context. Use of network analysis in community psychology is growing. Network analysis in community psychology has employed some potentially problematic practices. Recommended practices are identified to improve network analysis in community psychology.

Multiplex social ecological network analysis reveals how social changes affect community robustness more than resource depletion.

Science.gov (United States)

Baggio, Jacopo A; BurnSilver, Shauna B; Arenas, Alex; Magdanz, James S; Kofinas, Gary P; De Domenico, Manlio

2016-11-29

Network analysis provides a powerful tool to analyze complex influences of social and ecological structures on community and household dynamics. Most network studies of social-ecological systems use simple, undirected, unweighted networks. We analyze multiplex, directed, and weighted networks of subsistence food flows collected in three small indigenous communities in Arctic Alaska potentially facing substantial economic and ecological changes. Our analysis of plausible future scenarios suggests that changes to social relations and key households have greater effects on community robustness than changes to specific wild food resources.

Community structure in networks of functional connectivity: resolving functional organization in the rat brain with pharmacological MRI.

Science.gov (United States)

Schwarz, Adam J; Gozzi, Alessandro; Bifone, Angelo

2009-08-01

In the study of functional connectivity, fMRI data can be represented mathematically as a network of nodes and links, where image voxels represent the nodes and the connections between them reflect a degree of correlation or similarity in their response. Here we show that, within this framework, functional imaging data can be partitioned into 'communities' of tightly interconnected voxels corresponding to maximum modularity within the overall network. We evaluated this approach systematically in application to networks constructed from pharmacological MRI (phMRI) of the rat brain in response to acute challenge with three different compounds with distinct mechanisms of action (d-amphetamine, fluoxetine, and nicotine) as well as vehicle (physiological saline). This approach resulted in bilaterally symmetric sub-networks corresponding to meaningful anatomical and functional connectivity pathways consistent with the purported mechanism of action of each drug. Interestingly, common features across all three networks revealed two groups of tightly coupled brain structures that responded as functional units independent of the specific neurotransmitter systems stimulated by the drug challenge, including a network involving the prefrontal cortex and sub-cortical regions extending from the striatum to the amygdala. This finding suggests that each of these networks includes general underlying features of the functional organization of the rat brain.

Study of pattern formation in multilayer adaptive network of phase oscillators in application to brain dynamics analysis

Science.gov (United States)

Kirsanov, Daniil V.; Nedaivozov, Vladimir O.; Makarov, Vladimir V.; Goremyko, Mikhail V.; Hramov, Alexander E.

2017-04-01

In the report we study the mechanisms of phase synchronization in the model of adaptive network of Kuramoto phase oscillators and discuss the possibility of the further application of the obtained results for the analysis of the neural network of brain. In our theoretical study the model network represents itself as the multilayer structure, in which the links between the elements belonging to the different layers are arranged according to the competitive rule. In order to analyze the dynamical states of the multilayer network we calculate and compare the values of local and global order parameter, which describe the degree of coherence between the neighboring nodes and the elements over whole network, respectively. We find that the global synchronous dynamics takes place for the large values of the coupling strength and are characterized by the identical topology of the interacting layers and a homogeneous distribution of the link strength within each layer. We also show that the partial (or cluster) synchronization, occurs for the small values of the coupling strength, lead to the emergence of the scale-free topology, within the layers.

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

Science.gov (United States)

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

2016-01-01

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

Value Co-creation and Co-innovation: Linking Networked Organisations and Customer Communities

Science.gov (United States)

Romero, David; Molina, Arturo

Strategic networks such as Collaborative Networked Organisations (CNOs) and Virtual Customer Communities (VCCs) show a high potential as drivers of value co-creation and collaborative innovation in today’s Networking Era. Both look at the network structures as a source of jointly value creation and open innovation through access to new skills, knowledge, markets and technologies by sharing risk and integrating complementary competencies. This collaborative endeavour has proven to be able to enhance the adaptability and flexibility of CNOs and VCCs value creating systems in order to react in response to external drivers such as collaborative (business) opportunities. This paper presents a reference framework for creating interface networks, also known as ‘experience-centric networks’, as enablers for linking networked organisations and customer communities in order to support the establishment of user-driven and collaborative innovation networks.

Community detection, link prediction, and layer interdependence in multilayer networks

Science.gov (United States)

De Bacco, Caterina; Power, Eleanor A.; Larremore, Daniel B.; Moore, Cristopher

2017-04-01

Complex systems are often characterized by distinct types of interactions between the same entities. These can be described as a multilayer network where each layer represents one type of interaction. These layers may be interdependent in complicated ways, revealing different kinds of structure in the network. In this work we present a generative model, and an efficient expectation-maximization algorithm, which allows us to perform inference tasks such as community detection and link prediction in this setting. Our model assumes overlapping communities that are common between the layers, while allowing these communities to affect each layer in a different way, including arbitrary mixtures of assortative, disassortative, or directed structure. It also gives us a mathematically principled way to define the interdependence between layers, by measuring how much information about one layer helps us predict links in another layer. In particular, this allows us to bundle layers together to compress redundant information and identify small groups of layers which suffice to predict the remaining layers accurately. We illustrate these findings by analyzing synthetic data and two real multilayer networks, one representing social support relationships among villagers in South India and the other representing shared genetic substring material between genes of the malaria parasite.

Networked Community Change: Understanding Community Systems Change through the Lens of Social Network Analysis.

Science.gov (United States)

Lawlor, Jennifer A; Neal, Zachary P

2016-06-01

Addressing complex problems in communities has become a key area of focus in recent years (Kania & Kramer, 2013, Stanford Social Innovation Review). Building on existing approaches to understanding and addressing problems, such as action research, several new approaches have emerged that shift the way communities solve problems (e.g., Burns, 2007, Systemic Action Research; Foth, 2006, Action Research, 4, 205; Kania & Kramer, 2011, Stanford Social Innovation Review, 1, 36). Seeking to bring clarity to the emerging literature on community change strategies, this article identifies the common features of the most widespread community change strategies and explores the conditions under which such strategies have the potential to be effective. We identify and describe five common features among the approaches to change. Then, using an agent-based model, we simulate network-building behavior among stakeholders participating in community change efforts using these approaches. We find that the emergent stakeholder networks are efficient when the processes are implemented under ideal conditions. © Society for Community Research and Action 2016.

Cooperation in the prisoner's dilemma game on tunable community networks

Science.gov (United States)

Liu, Penghui; Liu, Jing

2017-04-01

Community networks have attracted lots of attention as they widely exist in the real world and are essential to study properties of networks. As the game theory illustrates the competitive relationship among individuals, studying the iterated prisoner's dilemma games (PDG) on community networks is meaningful. In this paper, we focus on investigating the relationship between the cooperation level of community networks and that of their communities in the prisoner's dilemma games. With this purpose in mind, a type of tunable community networks whose communities inherit not only the scale-free property, but also the characteristic of adjustable cooperation level of Holme and Kim (HK) networks is designed. Both uniform and non-uniform community networks are investigated. We find out that cooperation enhancement of communities can improve the cooperation level of the whole networks. Moreover, simulation results indicate that a large community is a better choice than a small community to improve the cooperation level of the whole networks. Thus, improving the cooperation level of community networks can be divided into a number of sub-problems targeting at improving the cooperation level of individual communities, which can save the computation cost and deal with the problem of improving the cooperation level of huge community networks. Moreover, as the larger community is a better choice, it is reasonable to start with large communities, according to the greedy strategy when the number of nodes can participate in the enhancement is limited.

Community Based Networks and 5G

DEFF Research Database (Denmark)

Williams, Idongesit

2016-01-01

The deployment of previous wireless standards has provided more benefits for urban dwellers than rural dwellers. 5G deployment may not be different. This paper identifies that Community Based Networks as carriers that deserve recognition as potential 5G providers may change this. The argument....... The findings indicate that 5G connectivity can be extended to rural areas by these networks, via heterogenous networks. Hence the delivery of 5G data rates delivery via Wireless WAN in rural areas can be achieved by utilizing the causal factors of the identified models for Community Based Networks....

Acupuncture analgesia involves modulation of pain-induced gamma oscillations and cortical network connectivity.

Science.gov (United States)

Hauck, Michael; Schröder, Sven; Meyer-Hamme, Gesa; Lorenz, Jürgen; Friedrichs, Sunja; Nolte, Guido; Gerloff, Christian; Engel, Andreas K

2017-11-24

Recent studies support the view that cortical sensory, limbic and executive networks and the autonomic nervous system might interact in distinct manners under the influence of acupuncture to modulate pain. We performed a double-blind crossover design study to investigate subjective ratings, EEG and ECG following experimental laser pain under the influence of sham and verum acupuncture in 26 healthy volunteers. We analyzed neuronal oscillations and inter-regional coherence in the gamma band of 128-channel-EEG recordings as well as heart rate variability (HRV) on two experimental days. Pain ratings and pain-induced gamma oscillations together with vagally-mediated power in the high-frequency bandwidth (vmHF) of HRV decreased significantly stronger during verum than sham acupuncture. Gamma oscillations were localized in the prefrontal cortex (PFC), mid-cingulate cortex (MCC), primary somatosensory cortex and insula. Reductions of pain ratings and vmHF-power were significantly correlated with increase of connectivity between the insula and MCC. In contrast, connectivity between left and right PFC and between PFC and insula correlated positively with vmHF-power without a relationship to acupuncture analgesia. Overall, these findings highlight the influence of the insula in integrating activity in limbic-saliency networks with vagally mediated homeostatic control to mediate antinociception under the influence of acupuncture.

Bayesian community detection