Characterization and control of small-world networks.

PubMed

Pandit, S A; Amritkar, R E

1999-08-01

Recently, Watts and Strogatz [Nature (London) 393, 440 (1998)] offered an interesting model of small-world networks. Here we concretize the concept of a "faraway" connection in a network by defining a far edge. Our definition is algorithmic and independent of any external parameters such as topology of the underlying space of the network. We show that it is possible to control the spread of an epidemic by using the knowledge of far edges. We also suggest a model for better product advertisement using the far edges. Our findings indicate that the number of far edges can be a good intrinsic parameter to characterize small-world phenomena.

Characterization and control of small-world networks

NASA Astrophysics Data System (ADS)

Pandit, S. A.; Amritkar, R. E.

1999-08-01

Recently, Watts and Strogatz [Nature (London) 393, 440 (1998)] offered an interesting model of small-world networks. Here we concretize the concept of a ``faraway'' connection in a network by defining a far edge. Our definition is algorithmic and independent of any external parameters such as topology of the underlying space of the network. We show that it is possible to control the spread of an epidemic by using the knowledge of far edges. We also suggest a model for better product advertisement using the far edges. Our findings indicate that the number of far edges can be a good intrinsic parameter to characterize small-world phenomena.

The architecture of dynamic reservoir in the echo state network

NASA Astrophysics Data System (ADS)

Cui, Hongyan; Liu, Xiang; Li, Lixiang

2012-09-01

Echo state network (ESN) has recently attracted increasing interests because of its superior capability in modeling nonlinear dynamic systems. In the conventional echo state network model, its dynamic reservoir (DR) has a random and sparse topology, which is far from the real biological neural networks from both structural and functional perspectives. We hereby propose three novel types of echo state networks with new dynamic reservoir topologies based on complex network theory, i.e., with a small-world topology, a scale-free topology, and a mixture of small-world and scale-free topologies, respectively. We then analyze the relationship between the dynamic reservoir structure and its prediction capability. We utilize two commonly used time series to evaluate the prediction performance of the three proposed echo state networks and compare them to the conventional model. We also use independent and identically distributed time series to analyze the short-term memory and prediction precision of these echo state networks. Furthermore, we study the ratio of scale-free topology and the small-world topology in the mixed-topology network, and examine its influence on the performance of the echo state networks. Our simulation results show that the proposed echo state network models have better prediction capabilities, a wider spectral radius, but retain almost the same short-term memory capacity as compared to the conventional echo state network model. We also find that the smaller the ratio of the scale-free topology over the small-world topology, the better the memory capacities.

Critical behavior of the contact process on small-world networks

NASA Astrophysics Data System (ADS)

Ferreira, Ronan S.; Ferreira, Silvio C.

2013-11-01

We investigate the role of clustering on the critical behavior of the contact process (CP) on small-world networks using the Watts-Strogatz (WS) network model with an edge rewiring probability p. The critical point is well predicted by a homogeneous cluster-approximation for the limit of vanishing clustering ( p → 1). The critical exponents and dimensionless moment ratios of the CP are in agreement with those predicted by the mean-field theory for any p > 0. This independence on the network clustering shows that the small-world property is a sufficient condition for the mean-field theory to correctly predict the universality of the model. Moreover, we compare the CP dynamics on WS networks with rewiring probability p = 1 and random regular networks and show that the weak heterogeneity of the WS network slightly changes the critical point but does not alter other critical quantities of the model.

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

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

Zhang, Jianbao; Ma, Zhongjun, E-mail: mzj1234402@163.com; Chen, Guanrong

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding ormore » deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.« less

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

NASA Astrophysics Data System (ADS)

Zhang, Jianbao; Ma, Zhongjun; Chen, Guanrong

2014-06-01

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

A small-world network model of facial emotion recognition.

PubMed

Takehara, Takuma; Ochiai, Fumio; Suzuki, Naoto

2016-01-01

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

Percolation and epidemics in a two-dimensional small world

NASA Astrophysics Data System (ADS)

Newman, M. E.; Jensen, I.; Ziff, R. M.

2002-02-01

Percolation on two-dimensional small-world networks has been proposed as a model for the spread of plant diseases. In this paper we give an analytic solution of this model using a combination of generating function methods and high-order series expansion. Our solution gives accurate predictions for quantities such as the position of the percolation threshold and the typical size of disease outbreaks as a function of the density of ``shortcuts'' in the small-world network. Our results agree with scaling hypotheses and numerical simulations for the same model.

Damage spreading in spatial and small-world random Boolean networks

NASA Astrophysics Data System (ADS)

Lu, Qiming; Teuscher, Christof

2014-02-01

The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean networks (RBNs) are commonly used as a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other nonrandom connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the Hamming distance at very low connectivities (K¯≪1) and that the critical connectivity of stability Ks changes compared to random networks. At higher K¯, this scaling remains unchanged. We also show that the Hamming distance of spatially local networks scales with a power law as the system size N increases, but with a different exponent for local and small-world networks. The scaling arguments for small-world networks are obtained with respect to the system sizes and strength of spatially local connections. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

Scaling and percolation in the small-world network model

NASA Astrophysics Data System (ADS)

Newman, M. E. J.; Watts, D. J.

1999-12-01

In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one nontrivial length-scale in the model, analogous to the correlation length in other systems, which is well-defined in the limit of infinite system size and which diverges continuously as the randomness in the network tends to zero, giving a normal critical point in this limit. This length-scale governs the crossover from large- to small-world behavior in the model, as well as the number of vertices in a neighborhood of given radius on the network. We derive the value of the single critical exponent controlling behavior in the critical region and the finite size scaling form for the average vertex-vertex distance on the network, and, using series expansion and Padé approximants, find an approximate analytic form for the scaling function. We calculate the effective dimension of small-world graphs and show that this dimension varies as a function of the length-scale on which it is measured, in a manner reminiscent of multifractals. We also study the problem of site percolation on small-world networks as a simple model of disease propagation, and derive an approximate expression for the percolation probability at which a giant component of connected vertices first forms (in epidemiological terms, the point at which an epidemic occurs). The typical cluster radius satisfies the expected finite size scaling form with a cluster size exponent close to that for a random graph. All our analytic results are confirmed by extensive numerical simulations of the model.

Corona graphs as a model of small-world networks

NASA Astrophysics Data System (ADS)

Lv, Qian; Yi, Yuhao; Zhang, Zhongzhi

2015-11-01

We introduce recursive corona graphs as a model of small-world networks. We investigate analytically the critical characteristics of the model, including order and size, degree distribution, average path length, clustering coefficient, and the number of spanning trees, as well as Kirchhoff index. Furthermore, we study the spectra for the adjacency matrix and the Laplacian matrix for the model. We obtain explicit results for all the quantities of the recursive corona graphs, which are similar to those observed in real-life networks.

It's a small world after all: contrasting hierarchical and edge networks in a simulated intelligence analysis task.

PubMed

Stanton, Neville A; Walker, Guy H; Sorensen, Linda J

2012-01-01

This article presents the rationale behind an important enhancement to a socio-technical model of organisations and teams derived from military research. It combines this with empirical results which take advantage of these enhancements. In Part 1, a new theoretical legacy for the model is developed based on Ergonomics theories and insights. This allows team communications data to be plotted into the model and for it to demonstrate discriminate validity between alternative team structures. Part 2 presents multinational data from the Experimental Laboratory for Investigating Collaboration, Information-sharing, and Trust (ELICIT) community. It was surprising to see that teams in both traditional hierarchical command and control and networked 'peer-to-peer' organisations operate in broadly the same area of the model, a region occupied by networks of communication exhibiting 'small world' properties. Small world networks may be of considerable importance for the Ergonomics analysis of team organisation and performance. This article is themed around macro and systems Ergonomics, and examines the effects of command and control structures. Despite some differences in behaviour and measures of agility, when given the freedom to do so, participants organised themselves into a small world network. This network type has important and interesting implications for the Ergonomics design of teams and organisations.

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

NASA Astrophysics Data System (ADS)

Ma, Fei; Yao, Bing

2018-02-01

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

A fractal growth model: Exploring the connection pattern of hubs in complex networks

NASA Astrophysics Data System (ADS)

Li, Dongyan; Wang, Xingyuan; Huang, Penghe

2017-04-01

Fractal is ubiquitous in many real-world networks. Previous researches showed that the strong disassortativity between the hub-nodes on all length scales was the key principle that gave rise to the fractal architecture of networks. Although fractal property emerged in some models, there were few researches about the fractal growth model and quantitative analyses about the strength of the disassortativity for fractal model. In this paper, we proposed a novel inverse renormalization method, named Box-based Preferential Attachment (BPA), to build the fractal growth models in which the Preferential Attachment was performed at box level. The proposed models provided a new framework that demonstrated small-world-fractal transition. Also, we firstly demonstrated the statistical characteristic of connection patterns of the hubs in fractal networks. The experimental results showed that, given proper growing scale and added edges, the proposed models could clearly show pure small-world or pure fractal or both of them. It also showed that the hub connection ratio showed normal distribution in many real-world networks. At last, the comparisons of connection pattern between the proposed models and the biological and technical networks were performed. The results gave useful reference for exploring the growth principle and for modeling the connection patterns for real-world networks.

Network marketing on a small-world network

NASA Astrophysics Data System (ADS)

Kim, Beom Jun; Jun, Tackseung; Kim, Jeong-Yoo; Choi, M. Y.

2006-02-01

We investigate a dynamic model of network marketing in a small-world network structure artificially constructed similarly to the Watts-Strogatz network model. Different from the traditional marketing, consumers can also play the role of the manufacturer's selling agents in network marketing, which is stimulated by the referral fee the manufacturer offers. As the wiring probability α is increased from zero to unity, the network changes from the one-dimensional regular directed network to the star network where all but one player are connected to one consumer. The price p of the product and the referral fee r are used as free parameters to maximize the profit of the manufacturer. It is observed that at α=0 the maximized profit is constant independent of the network size N while at α≠0, it increases linearly with N. This is in parallel to the small-world transition. It is also revealed that while the optimal value of p stays at an almost constant level in a broad range of α, that of r is sensitive to a change in the network structure. The consumer surplus is also studied and discussed.

Combining the Finite Element Method with Structural Connectome-based Analysis for Modeling Neurotrauma: Connectome Neurotrauma Mechanics

DTIC Science & Technology

2012-08-16

threshold of 18% strain, 161 edges were removed. Watts and Strogatz [66] define the small-world network based on the clustering coefficient of the network and...NeuroImage 52: 1059–1069. 65. Latora V, Marchiori M (2001) Efficient behavior of small-world networks. Phys Rev Lett 87: 198701. 66. Watts DJ, Strogatz SH

Complex networks generated by the Penna bit-string model: Emergence of small-world and assortative mixing

NASA Astrophysics Data System (ADS)

Li, Chunguang; Maini, Philip K.

2005-10-01

The Penna bit-string model successfully encompasses many phenomena of population evolution, including inheritance, mutation, evolution, and aging. If we consider social interactions among individuals in the Penna model, the population will form a complex network. In this paper, we first modify the Verhulst factor to control only the birth rate, and introduce activity-based preferential reproduction of offspring in the Penna model. The social interactions among individuals are generated by both inheritance and activity-based preferential increase. Then we study the properties of the complex network generated by the modified Penna model. We find that the resulting complex network has a small-world effect and the assortative mixing property.

Modeling Epidemics with Dynamic Small-World Networks

NASA Astrophysics Data System (ADS)

Kaski, Kimmo; Saramäki, Jari

2005-06-01

In this presentation a minimal model for describing the spreading of an infectious disease, such as influenza, is discussed. Here it is assumed that spreading takes place on a dynamic small-world network comprising short- and long-range infection events. Approximate equations for the epidemic threshold as well as the spreading dynamics are derived and they agree well with numerical discrete time-step simulations. Also the dependence of the epidemic saturation time on the initial conditions is analysed and a comparison with real-world data is made.

Algebraic approach to small-world network models

NASA Astrophysics Data System (ADS)

Rudolph-Lilith, Michelle; Muller, Lyle E.

2014-01-01

We introduce an analytic model for directed Watts-Strogatz small-world graphs and deduce an algebraic expression of its defining adjacency matrix. The latter is then used to calculate the small-world digraph's asymmetry index and clustering coefficient in an analytically exact fashion, valid nonasymptotically for all graph sizes. The proposed approach is general and can be applied to all algebraically well-defined graph-theoretical measures, thus allowing for an analytical investigation of finite-size small-world graphs.

Phase synchronization of bursting neurons in clustered small-world networks

NASA Astrophysics Data System (ADS)

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

2012-07-01

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

Phase Transitions of an Epidemic Spreading Model in Small-World Networks

NASA Astrophysics Data System (ADS)

Hua, Da-Yin; Gao, Ke

2011-06-01

We propose a modified susceptible-infected-refractory-susceptible (SIRS) model to investigate the global oscillations of the epidemic spreading in Watts—Strogatz (WS) small-world networks. It is found that when an individual immunity does not change or decays slowly in an immune period, the system can exhibit complex transition from an infecting stationary state to a large amplitude sustained oscillation or an absorbing state with no infection. When the immunity decays rapidly in the immune period, the transition to the global oscillation disappears and there is no oscillation. Furthermore, based on the spatio-temporal evolution patterns and the phase diagram, it is disclosed that a long immunity period takes an important role in the emergence of the global oscillation in small-world networks.

Graph theoretical analysis of complex networks in the brain

PubMed Central

Stam, Cornelis J; Reijneveld, Jaap C

2007-01-01

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

Vaccination intervention on epidemic dynamics in networks

NASA Astrophysics Data System (ADS)

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

2013-02-01

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

Coevolutionary dynamics of opinion propagation and social balance: The key role of small-worldness

NASA Astrophysics Data System (ADS)

Chen, Yan; Chen, Lixue; Sun, Xian; Zhang, Kai; Zhang, Jie; Li, Ping

2014-03-01

The propagation of various opinions in social networks, which influences human inter-relationships and even social structure, and hence is a most important part of social life. We have incorporated social balance into opinion propagation in social networks are influenced by social balance. The edges in networks can represent both friendly or hostile relations, and change with the opinions of individual nodes. We introduce a model to characterize the coevolutionary dynamics of these two dynamical processes on Watts-Strogatz (WS) small-world network. We employ two distinct evolution rules (i) opinion renewal; and (ii) relation adjustment. By changing the rewiring probability, and thus the small-worldness of the WS network, we found that the time for the system to reach balanced states depends critically on both the average path length and clustering coefficient of the network, which is different than other networked process like epidemic spreading. In particular, the system equilibrates most quickly when the underlying network demonstrates strong small-worldness, i.e., small average path lengths and large clustering coefficient. We also find that opinion clusters emerge in the process of the network approaching the global equilibrium, and a measure of global contrariety is proposed to quantify the balanced state of a social network.

Network rewiring dynamics with convergence towards a star network

PubMed Central

Dick, G.; Parry, M.

2016-01-01

Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz (Nature 393, 440–442. (doi:10.1038/30918)). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach. PMID:27843396

Network rewiring dynamics with convergence towards a star network.

PubMed

Whigham, P A; Dick, G; Parry, M

2016-10-01

Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz ( Nature 393 , 440-442. (doi:10.1038/30918)). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach.

Critical behavior of the XY-rotor model on regular and small-world networks

NASA Astrophysics Data System (ADS)

De Nigris, Sarah; Leoncini, Xavier

2013-07-01

We study the XY rotors model on small networks whose number of links scales with the system size Nlinks˜Nγ, where 1≤γ≤2. We first focus on regular one-dimensional rings in the microcanonical ensemble. For γ<1.5 the model behaves like a short-range one and no phase transition occurs. For γ>1.5, the system equilibrium properties are found to be identical to the mean field, which displays a second-order phase transition at a critical energy density ɛ=E/N,ɛc=0.75. Moreover, for γc≃1.5 we find that a nontrivial state emerges, characterized by an infinite susceptibility. We then consider small-world networks, using the Watts-Strogatz mechanism on the regular networks parametrized by γ. We first analyze the topology and find that the small-world regime appears for rewiring probabilities which scale as pSW∝1/Nγ. Then considering the XY-rotors model on these networks, we find that a second-order phase transition occurs at a critical energy ɛc which logarithmically depends on the topological parameters p and γ. We also define a critical probability pMF, corresponding to the probability beyond which the mean field is quantitatively recovered, and we analyze its dependence on γ.

An Investigation of the Differences and Similarities between Generated Small-World Networks for Right- and Left-Hand Motor Imageries.

PubMed

Zhang, Jiang; Li, Yuyao; Chen, Huafu; Ding, Jurong; Yuan, Zhen

2016-11-04

In this study, small-world network analysis was performed to identify the similarities and differences between functional brain networks for right- and left-hand motor imageries (MIs). First, Pearson correlation coefficients among the nodes within the functional brain networks from healthy subjects were calculated. Then, small-world network indicators, including the clustering coefficient, the average path length, the global efficiency, the local efficiency, the average node degree, and the small-world index, were generated for the functional brain networks during both right- and left-hand MIs. We identified large differences in the small-world network indicators between the functional networks during MI and in the random networks. More importantly, the functional brain networks underlying the right- and left-hand MIs exhibited similar small-world properties in terms of the clustering coefficient, the average path length, the global efficiency, and the local efficiency. By contrast, the right- and left-hand MI brain networks showed differences in small-world characteristics, including indicators such as the average node degree and the small-world index. Interestingly, our findings also suggested that the differences in the activity intensity and range, the average node degree, and the small-world index of brain networks between the right- and left-hand MIs were associated with the asymmetry of brain functions.

Combining the Finite Element Method with Structural Connectome-based Analysis for Modeling Neurotrauma:Connectome Neurotrauma Mechanics

DTIC Science & Technology

2012-08-16

death threshold. Using an injury threshold of 18% strain, 161 edges were removed. Watts and Strogatz [66] define the small-world network based on the...NeuroImage 52: 1059–1069. 65. Latora V, Marchiori M (2001) Efficient behavior of small-world networks. Phys Rev Lett 87: 198701. 66. Watts DJ, Strogatz SH

The brainstem reticular formation is a small-world, not scale-free, network

PubMed Central

Humphries, M.D; Gurney, K; Prescott, T.J

2005-01-01

Recently, it has been demonstrated that several complex systems may have simple graph-theoretic characterizations as so-called ‘small-world’ and ‘scale-free’ networks. These networks have also been applied to the gross neural connectivity between primate cortical areas and the nervous system of Caenorhabditis elegans. Here, we extend this work to a specific neural circuit of the vertebrate brain—the medial reticular formation (RF) of the brainstem—and, in doing so, we have made three key contributions. First, this work constitutes the first model (and quantitative review) of this important brain structure for over three decades. Second, we have developed the first graph-theoretic analysis of vertebrate brain connectivity at the neural network level. Third, we propose simple metrics to quantitatively assess the extent to which the networks studied are small-world or scale-free. We conclude that the medial RF is configured to create small-world (implying coherent rapid-processing capabilities), but not scale-free, type networks under assumptions which are amenable to quantitative measurement. PMID:16615219

Estimation of Anonymous Email Network Characteristics through Statistical Disclosure Attacks

PubMed Central

Portela, Javier; García Villalba, Luis Javier; Silva Trujillo, Alejandra Guadalupe; Sandoval Orozco, Ana Lucila; Kim, Tai-Hoon

2016-01-01

Social network analysis aims to obtain relational data from social systems to identify leaders, roles, and communities in order to model profiles or predict a specific behavior in users’ network. Preserving anonymity in social networks is a subject of major concern. Anonymity can be compromised by disclosing senders’ or receivers’ identity, message content, or sender-receiver relationships. Under strongly incomplete information, a statistical disclosure attack is used to estimate the network and node characteristics such as centrality and clustering measures, degree distribution, and small-world-ness. A database of email networks in 29 university faculties is used to study the method. A research on the small-world-ness and Power law characteristics of these email networks is also developed, helping to understand the behavior of small email networks. PMID:27809275

Estimation of Anonymous Email Network Characteristics through Statistical Disclosure Attacks.

PubMed

Portela, Javier; García Villalba, Luis Javier; Silva Trujillo, Alejandra Guadalupe; Sandoval Orozco, Ana Lucila; Kim, Tai-Hoon

2016-11-01

Social network analysis aims to obtain relational data from social systems to identify leaders, roles, and communities in order to model profiles or predict a specific behavior in users' network. Preserving anonymity in social networks is a subject of major concern. Anonymity can be compromised by disclosing senders' or receivers' identity, message content, or sender-receiver relationships. Under strongly incomplete information, a statistical disclosure attack is used to estimate the network and node characteristics such as centrality and clustering measures, degree distribution, and small-world-ness. A database of email networks in 29 university faculties is used to study the method. A research on the small-world-ness and Power law characteristics of these email networks is also developed, helping to understand the behavior of small email networks.

Small-world human brain networks: Perspectives and challenges.

PubMed

Liao, Xuhong; Vasilakos, Athanasios V; He, Yong

2017-06-01

Modelling the human brain as a complex network has provided a powerful mathematical framework to characterize the structural and functional architectures of the brain. In the past decade, the combination of non-invasive neuroimaging techniques and graph theoretical approaches enable us to map human structural and functional connectivity patterns (i.e., connectome) at the macroscopic level. One of the most influential findings is that human brain networks exhibit prominent small-world organization. Such a network architecture in the human brain facilitates efficient information segregation and integration at low wiring and energy costs, which presumably results from natural selection under the pressure of a cost-efficiency balance. Moreover, the small-world organization undergoes continuous changes during normal development and ageing and exhibits dramatic alterations in neurological and psychiatric disorders. In this review, we survey recent advances regarding the small-world architecture in human brain networks and highlight the potential implications and applications in multidisciplinary fields, including cognitive neuroscience, medicine and engineering. Finally, we highlight several challenging issues and areas for future research in this rapidly growing field. Copyright © 2017 Elsevier Ltd. All rights reserved.

Moving beyond Stylized Economic Network Models: The Hybrid World of the Indian Firm Ownership Network1

PubMed Central

Mani, Dalhia; Moody, James

2014-01-01

A central theme of economic sociology has been to highlight the complexity and diversity of real world markets, but many network models of economic social structure ignore this feature and rely instead on stylized one-dimensional characterizations. Here, the authors return to the basic insight of structural diversity in economic sociology. Using the Indian interorganizational ownership network as their case, they discover a composite—or “hybrid”—model of economic networks that combines elements of prior stylized models. The network contains a disconnected periphery conforming closely to a “transactional” model; a semiperiphery characterized by small, dense clusters with sporadic links, as predicted in “small-world” models; and finally a nested core composed of clusters connected via multiple independent paths. The authors then show how a firm’s position within the mesolevel structure is associated with demographic features such as age and industry and differences in the extent to which firms engage in multiplex and high-value exchanges. PMID:25418990

Epidemics in small world networks

NASA Astrophysics Data System (ADS)

Telo da Gama, M. M.; Nunes, A.

2006-03-01

For many infectious diseases, a small-world network on an underlying regular lattice is a suitable simplified model for the contact structure of the host population. It is well known that the contact network, described in this setting by a single parameter, the small-world parameter p, plays an important role both in the short term and in the long term dynamics of epidemic spread. We have studied the effect of the network structure on models of immune for life diseases and found that in addition to the reduction of the effective transmission rate, through the screening of infectives, spatial correlations may strongly enhance the stochastic fluctuations. As a consequence, time series of unforced Susceptible-Exposed-Infected-Recovered (SEIR) models provide patterns of recurrent epidemics with realistic amplitudes, suggesting that these models together with complex networks of contacts are the key ingredients to describe the prevaccination dynamical patterns of diseases such as measles and pertussis. We have also studied the role of the host contact strucuture in pathogen antigenic variation, through its effect on the final outcome of an invasion by a viral strain of a population where a very similar virus is endemic. Similar viral strains are modelled by the same infection and reinfection parameters, and by a given degree of cross immunity that represents the antigenic distance between the competing strains. We have found, somewhat surprisingly, that clustering on the network decreases the potential to sustain pathogen diversity.

Tracing the Attention of Moving Citizens

NASA Astrophysics Data System (ADS)

Wu, Lingfei; Wang, Cheng-Jun

2016-09-01

With the widespread use of mobile computing devices in contemporary society, our trajectories in the physical space and virtual world are increasingly closely connected. Using the anonymous smartphone data of 1 × 105 users in a major city of China, we study the interplay between online and offline human behaviors by constructing the mobility network (offline) and the attention network (online). Using the network renormalization technique, we find that they belong to two different classes: the mobility network is small-world, whereas the attention network is fractal. We then divide the city into different areas based on the features of the mobility network discovered under renormalization. Interestingly, this spatial division manifests the location-based online behaviors, for example shopping, dating, and taxi-requesting. Finally, we offer a geometric network model to help us understand the relationship between small-world and fractal networks.

Modeling of synchronization behavior of bursting neurons at nonlinearly coupled dynamical networks.

PubMed

Çakir, Yüksel

2016-01-01

Synchronization behaviors of bursting neurons coupled through electrical and dynamic chemical synapses are investigated. The Izhikevich model is used with random and small world network of bursting neurons. Various currents which consist of diffusive electrical and time-delayed dynamic chemical synapses are used in the simulations to investigate the influences of synaptic currents and couplings on synchronization behavior of bursting neurons. The effects of parameters, such as time delay, inhibitory synaptic strengths, and decay time on synchronization behavior are investigated. It is observed that in random networks with no delay, bursting synchrony is established with the electrical synapse alone, single spiking synchrony is observed with hybrid coupling. In small world network with no delay, periodic bursting behavior with multiple spikes is observed when only chemical and only electrical synapse exist. Single-spike and multiple-spike bursting are established with hybrid couplings. A decrease in the synchronization measure is observed with zero time delay, as the decay time is increased in random network. For synaptic delays which are above active phase period, synchronization measure increases with an increase in synaptic strength and time delay in small world network. However, in random network, it increases with only an increase in synaptic strength.

Collective behavior of large-scale neural networks with GPU acceleration.

PubMed

Qu, Jingyi; Wang, Rubin

2017-12-01

In this paper, the collective behaviors of a small-world neuronal network motivated by the anatomy of a mammalian cortex based on both Izhikevich model and Rulkov model are studied. The Izhikevich model can not only reproduce the rich behaviors of biological neurons but also has only two equations and one nonlinear term. Rulkov model is in the form of difference equations that generate a sequence of membrane potential samples in discrete moments of time to improve computational efficiency. These two models are suitable for the construction of large scale neural networks. By varying some key parameters, such as the connection probability and the number of nearest neighbor of each node, the coupled neurons will exhibit types of temporal and spatial characteristics. It is demonstrated that the implementation of GPU can achieve more and more acceleration than CPU with the increasing of neuron number and iterations. These two small-world network models and GPU acceleration give us a new opportunity to reproduce the real biological network containing a large number of neurons.

Tracing the Attention of Moving Citizens

PubMed Central

Wu, Lingfei; Wang, Cheng-Jun

2016-01-01

With the widespread use of mobile computing devices in contemporary society, our trajectories in the physical space and virtual world are increasingly closely connected. Using the anonymous smartphone data of 1 × 105 users in a major city of China, we study the interplay between online and offline human behaviors by constructing the mobility network (offline) and the attention network (online). Using the network renormalization technique, we find that they belong to two different classes: the mobility network is small-world, whereas the attention network is fractal. We then divide the city into different areas based on the features of the mobility network discovered under renormalization. Interestingly, this spatial division manifests the location-based online behaviors, for example shopping, dating, and taxi-requesting. Finally, we offer a geometric network model to help us understand the relationship between small-world and fractal networks. PMID:27608929

Disease spreading in real-life networks

NASA Astrophysics Data System (ADS)

Gallos, Lazaros; Argyrakis, Panos

2002-08-01

In recent years the scientific community has shown a vivid interest in the network structure and dynamics of real-life organized systems. Many such systems, covering an extremely wide range of applications, have been recently shown to exhibit scale-free character in their connectivity distribution, meaning that they obey a power law. Modeling of epidemics on lattices and small-world networks suffers from the presence of a critical infection threshold, above which the entire population is infected. For scale-free networks, the original assumption was that the formation of a giant cluster would lead to an epidemic spreading in the same way as in simpler networks. Here we show that modeling epidemics on a scale-free network can greatly improve the predictions on the rate and efficiency of spreading, as compared to lattice models and small-world networks. We also show that the dynamics of a disease are greatly influenced by the underlying population structure. The exact same model can describe a plethora of networks, such as social networks, virus spreading in the Web, rumor spreading, signal transmission etc.

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

NASA Astrophysics Data System (ADS)

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

2015-11-01

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

An integrate-and-fire model for synchronized bursting in a network of cultured cortical neurons.

PubMed

French, D A; Gruenstein, E I

2006-12-01

It has been suggested that spontaneous synchronous neuronal activity is an essential step in the formation of functional networks in the central nervous system. The key features of this type of activity consist of bursts of action potentials with associated spikes of elevated cytoplasmic calcium. These features are also observed in networks of rat cortical neurons that have been formed in culture. Experimental studies of these cultured networks have led to several hypotheses for the mechanisms underlying the observed synchronized oscillations. In this paper, bursting integrate-and-fire type mathematical models for regular spiking (RS) and intrinsic bursting (IB) neurons are introduced and incorporated through a small-world connection scheme into a two-dimensional excitatory network similar to those in the cultured network. This computer model exhibits spontaneous synchronous activity through mechanisms similar to those hypothesized for the cultured experimental networks. Traces of the membrane potential and cytoplasmic calcium from the model closely match those obtained from experiments. We also consider the impact on network behavior of the IB neurons, the geometry and the small world connection scheme.

Consumers don’t play dice, influence of social networks and advertisements

NASA Astrophysics Data System (ADS)

Groot, Robert D.

2006-05-01

Empirical data of supermarket sales show stylised facts that are similar to stock markets, with a broad (truncated) Lévy distribution of weekly sales differences in the baseline sales [R.D. Groot, Physica A 353 (2005) 501]. To investigate the cause of this, the influence of social interactions and advertisements are studied in an agent-based model of consumers in a social network. The influence of network topology was varied by using a small-world network, a random network and a Barabási-Albert network. The degree to which consumers value the opinion of their peers was also varied. On a small-world and random network we find a phase transition between an open market and a locked-in market that is similar to condensation in liquids. At the critical point, fluctuations become large and buying behaviour is strongly correlated. However, on the small world network the noise distribution at the critical point is Gaussian, and critical slowing down occurs which is not observed in supermarket sales. On a scale-free network, the model shows a transition between a gas-like phase and a glassy state, but at the transition point the noise amplitude is much larger than what is seen in supermarket sales. To explore the role of advertisements, a model is studied where imprints are placed on the minds of consumers that ripen when a decision for a product is made. The correct distribution of weekly sales returns follows naturally from this model, as well as the noise amplitude, the correlation time and cross-correlation of sales fluctuations. For particular parameter values, simulated sales correlation shows power-law decay in time. The model predicts that social interaction helps to prevent aversion, and that products are viewed more positively when their consumption rate is higher.

Architecture of marine food webs: To be or not be a 'small-world'.

PubMed

Marina, Tomás Ignacio; Saravia, Leonardo A; Cordone, Georgina; Salinas, Vanesa; Doyle, Santiago R; Momo, Fernando R

2018-01-01

The search for general properties in network structure has been a central issue for food web studies in recent years. One such property is the small-world topology that combines a high clustering and a small distance between nodes of the network. This property may increase food web resilience but make them more sensitive to the extinction of connected species. Food web theory has been developed principally from freshwater and terrestrial ecosystems, largely omitting marine habitats. If theory needs to be modified to accommodate observations from marine ecosystems, based on major differences in several topological characteristics is still on debate. Here we investigated if the small-world topology is a common structural pattern in marine food webs. We developed a novel, simple and statistically rigorous method to examine the largest set of complex marine food webs to date. More than half of the analyzed marine networks exhibited a similar or lower characteristic path length than the random expectation, whereas 39% of the webs presented a significantly higher clustering than its random counterpart. Our method proved that 5 out of 28 networks fulfilled both features of the small-world topology: short path length and high clustering. This work represents the first rigorous analysis of the small-world topology and its associated features in high-quality marine networks. We conclude that such topology is a structural pattern that is not maximized in marine food webs; thus it is probably not an effective model to study robustness, stability and feasibility of marine ecosystems.

Properties of a new small-world network with spatially biased random shortcuts

NASA Astrophysics Data System (ADS)

Matsuzawa, Ryo; Tanimoto, Jun; Fukuda, Eriko

2017-11-01

This paper introduces a small-world (SW) network with a power-law distance distribution that differs from conventional models in that it uses completely random shortcuts. By incorporating spatial constraints, we analyze the divergence of the proposed model from conventional models in terms of fundamental network properties such as clustering coefficient, average path length, and degree distribution. We find that when the spatial constraint more strongly prohibits a long shortcut, the clustering coefficient is improved and the average path length increases. We also analyze the spatial prisoner's dilemma (SPD) games played on our new SW network in order to understand its dynamical characteristics. Depending on the basis graph, i.e., whether it is a one-dimensional ring or a two-dimensional lattice, and the parameter controlling the prohibition of long-distance shortcuts, the emergent results can vastly differ.

Suppression of anomalous synchronization and nonstationary behavior of neural network under small-world topology

NASA Astrophysics Data System (ADS)

Boaretto, B. R. R.; Budzinski, R. C.; Prado, T. L.; Kurths, J.; Lopes, S. R.

2018-05-01

It is known that neural networks under small-world topology can present anomalous synchronization and nonstationary behavior for weak coupling regimes. Here, we propose methods to suppress the anomalous synchronization and also to diminish the nonstationary behavior occurring in weakly coupled neural network under small-world topology. We consider a network of 2000 thermally sensitive identical neurons, based on the model of Hodgkin-Huxley in a small-world topology, with the probability of adding non local connection equal to p = 0 . 001. Based on experimental protocols to suppress anomalous synchronization, as well as nonstationary behavior of the neural network dynamics, we make use of (i) external stimulus (pulsed current); (ii) biologic parameters changing (neuron membrane conductance changes); and (iii) body temperature changes. Quantification analysis to evaluate phase synchronization makes use of the Kuramoto's order parameter, while recurrence quantification analysis, particularly the determinism, computed over the easily accessible mean field of network, the local field potential (LFP), is used to evaluate nonstationary states. We show that the methods proposed can control the anomalous synchronization and nonstationarity occurring for weak coupling parameter without any effect on the individual neuron dynamics, neither in the expected asymptotic synchronized states occurring for large values of the coupling parameter.

Complexity analysis on public transport networks of 97 large- and medium-sized cities in China

NASA Astrophysics Data System (ADS)

Tian, Zhanwei; Zhang, Zhuo; Wang, Hongfei; Ma, Li

2018-04-01

The traffic situation in Chinese urban areas is continuing to deteriorate. To make a better planning and designing of the public transport system, it is necessary to make profound research on the structure of urban public transport networks (PTNs). We investigate 97 large- and medium-sized cities’ PTNs in China, construct three types of network models — bus stop network, bus transit network and bus line network, then analyze the structural characteristics of them. It is revealed that bus stop network is small-world and scale-free, bus transit network and bus line network are both small-world. Betweenness centrality of each city’s PTN shows similar distribution pattern, although these networks’ size is various. When classifying cities according to the characteristics of PTNs or economic development level, the results are similar. It means that the development of cities’ economy and transport network has a strong correlation, PTN expands in a certain model with the development of economy.

Coevolution of Cooperation and Partner Rewiring Range in Spatial Social Networks

NASA Astrophysics Data System (ADS)

Khoo, Tommy; Fu, Feng; Pauls, Scott

2016-11-01

In recent years, there has been growing interest in the study of coevolutionary games on networks. Despite much progress, little attention has been paid to spatially embedded networks, where the underlying geographic distance, rather than the graph distance, is an important and relevant aspect of the partner rewiring process. It thus remains largely unclear how individual partner rewiring range preference, local vs. global, emerges and affects cooperation. Here we explicitly address this issue using a coevolutionary model of cooperation and partner rewiring range preference in spatially embedded social networks. In contrast to local rewiring, global rewiring has no distance restriction but incurs a one-time cost upon establishing any long range link. We find that under a wide range of model parameters, global partner switching preference can coevolve with cooperation. Moreover, the resulting partner network is highly degree-heterogeneous with small average shortest path length while maintaining high clustering, thereby possessing small-world properties. We also discover an optimum availability of reputation information for the emergence of global cooperators, who form distant partnerships at a cost to themselves. From the coevolutionary perspective, our work may help explain the ubiquity of small-world topologies arising alongside cooperation in the real world.

A Complex Network Approach to Distributional Semantic Models

PubMed Central

Utsumi, Akira

2015-01-01

A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models. PMID:26295940

Spatial connections in regional climate model rainfall outputs at different temporal scales: Application of network theory

NASA Astrophysics Data System (ADS)

Naufan, Ihsan; Sivakumar, Bellie; Woldemeskel, Fitsum M.; Raghavan, Srivatsan V.; Vu, Minh Tue; Liong, Shie-Yui

2018-01-01

Understanding the spatial and temporal variability of rainfall has always been a great challenge, and the impacts of climate change further complicate this issue. The present study employs the concepts of complex networks to study the spatial connections in rainfall, with emphasis on climate change and rainfall scaling. Rainfall outputs (during 1961-1990) from a regional climate model (i.e. Weather Research and Forecasting (WRF) model that downscaled the European Centre for Medium-range Weather Forecasts, ECMWF ERA-40 reanalyses) over Southeast Asia are studied, and data corresponding to eight different temporal scales (6-hr, 12-hr, daily, 2-day, 4-day, weekly, biweekly, and monthly) are analyzed. Two network-based methods are applied to examine the connections in rainfall: clustering coefficient (a measure of the network's local density) and degree distribution (a measure of the network's spread). The influence of rainfall correlation threshold (T) on spatial connections is also investigated by considering seven different threshold levels (ranging from 0.5 to 0.8). The results indicate that: (1) rainfall networks corresponding to much coarser temporal scales exhibit properties similar to that of small-world networks, regardless of the threshold; (2) rainfall networks corresponding to much finer temporal scales may be classified as either small-world networks or scale-free networks, depending upon the threshold; and (3) rainfall spatial connections exhibit a transition phase at intermediate temporal scales, especially at high thresholds. These results suggest that the most appropriate model for studying spatial connections may often be different at different temporal scales, and that a combination of small-world and scale-free network models might be more appropriate for rainfall upscaling/downscaling across all scales, in the strict sense of scale-invariance. The results also suggest that spatial connections in the studied rainfall networks in Southeast Asia are weak, especially when more stringent conditions are imposed (i.e. when T is very high), except at the monthly scale.

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

NASA Astrophysics Data System (ADS)

Ma, Fei; Yao, Bing

2017-10-01

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

Blackmail propagation on small-world networks

NASA Astrophysics Data System (ADS)

Shao, Zhi-Gang; Jian-Ping Sang; Zou, Xian-Wu; Tan, Zhi-Jie; Jin, Zhun-Zhi

2005-06-01

The dynamics of the blackmail propagation model based on small-world networks is investigated. It is found that for a given transmitting probability λ the dynamical behavior of blackmail propagation transits from linear growth type to logistical growth one with the network randomness p increases. The transition takes place at the critical network randomness pc=1/N, where N is the total number of nodes in the network. For a given network randomness p the dynamical behavior of blackmail propagation transits from exponential decrease type to logistical growth one with the transmitting probability λ increases. The transition occurs at the critical transmitting probability λc=1/, where is the average number of the nearest neighbors. The present work will be useful for understanding computer virus epidemics and other spreading phenomena on communication and social networks.

A Small World of Neuronal Synchrony

PubMed Central

Yu, Shan; Huang, Debin; Singer, Wolf

2008-01-01

A small-world network has been suggested to be an efficient solution for achieving both modular and global processing—a property highly desirable for brain computations. Here, we investigated functional networks of cortical neurons using correlation analysis to identify functional connectivity. To reconstruct the interaction network, we applied the Ising model based on the principle of maximum entropy. This allowed us to assess the interactions by measuring pairwise correlations and to assess the strength of coupling from the degree of synchrony. Visual responses were recorded in visual cortex of anesthetized cats, simultaneously from up to 24 neurons. First, pairwise correlations captured most of the patterns in the population's activity and, therefore, provided a reliable basis for the reconstruction of the interaction networks. Second, and most importantly, the resulting networks had small-world properties; the average path lengths were as short as in simulated random networks, but the clustering coefficients were larger. Neurons differed considerably with respect to the number and strength of interactions, suggesting the existence of “hubs” in the network. Notably, there was no evidence for scale-free properties. These results suggest that cortical networks are optimized for the coexistence of local and global computations: feature detection and feature integration or binding. PMID:18400792

Epidemics with pathogen mutation on small-world networks

NASA Astrophysics Data System (ADS)

Shao, Zhi-Gang; Tan, Zhi-Jie; Zou, Xian-Wu; Jin, Zhun-Zhi

2006-05-01

We study the dynamical behavior of the epidemiological model with pathogen mutation on small-world networks, and discuss the influence of the immunity duration τR, the cross-immunity threshold hthr, and system size N on epidemic dynamics. A decaying oscillation occurs because of the interplay between the immune response and the pathogen mutation. These results have implications for the interpretation of longitudinal epidemiological data on strain abundance, and they will be helpful to assess the threat of highly pathogenic and mutative viruses, such as avian influenza.

Self-organized Criticality in Hierarchical Brain Network

NASA Astrophysics Data System (ADS)

Yang, Qiu-Ying; Zhang, Ying-Yue; Chen, Tian-Lun

2008-11-01

It is shown that the cortical brain network of the macaque displays a hierarchically clustered organization and the neuron network shows small-world properties. Now the two factors will be considered in our model and the dynamical behavior of the model will be studied. We study the characters of the model and find that the distribution of avalanche size of the model follows power-law behavior.

Low-rank network decomposition reveals structural characteristics of small-world networks

NASA Astrophysics Data System (ADS)

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

2015-12-01

Small-world networks occur naturally throughout biological, technological, and social systems. With their prevalence, it is particularly important to prudently identify small-world networks and further characterize their unique connection structure with respect to network function. In this work we develop a formalism for classifying networks and identifying small-world structure using a decomposition of network connectivity matrices into low-rank and sparse components, corresponding to connections within clusters of highly connected nodes and sparse interconnections between clusters, respectively. We show that the network decomposition is independent of node indexing and define associated bounded measures of connectivity structure, which provide insight into the clustering and regularity of network connections. While many existing network characterizations rely on constructing benchmark networks for comparison or fail to describe the structural properties of relatively densely connected networks, our classification relies only on the intrinsic network structure and is quite robust with respect to changes in connection density, producing stable results across network realizations. Using this framework, we analyze several real-world networks and reveal new structural properties, which are often indiscernible by previously established characterizations of network connectivity.

Improved community model for social networks based on social mobility

NASA Astrophysics Data System (ADS)

Lu, Zhe-Ming; Wu, Zhen; Luo, Hao; Wang, Hao-Xian

2015-07-01

This paper proposes an improved community model for social networks based on social mobility. The relationship between the group distribution and the community size is investigated in terms of communication rate and turnover rate. The degree distributions, clustering coefficients, average distances and diameters of networks are analyzed. Experimental results demonstrate that the proposed model possesses the small-world property and can reproduce social networks effectively and efficiently.

Networked Ising-Sznajd AR-β Model

NASA Astrophysics Data System (ADS)

Nagao, Tomonori; Ohmiya, Mayumi

2009-09-01

The modified Ising-Sznajd model is studied to clarify the machanism of price formation in the stock market. The conventional Ising-Sznajd model is improved as a small world network with the rewireing probability β(t) which depends on the time. Numerical experiments show that phase transition, regarded as a economical crisis, is inevitable in this model.

Node-node correlations and transport properties in scale-free networks

NASA Astrophysics Data System (ADS)

Obregon, Bibiana; Guzman, Lev

2011-03-01

We study some transport properties of complex networks. We focus our attention on transport properties of scale-free and small-world networks and compare two types of transport: Electric and max-flow cases. In particular, we construct scale-free networks, with a given degree sequence, to estimate the distribution of conductances for different values of assortative/dissortative mixing. For the electric case we find that the distributions of conductances are affect ed by the assortative mixing of the network whereas for the max-flow case, the distributions almost do not show changes when node-node correlations are altered. Finally, we compare local and global transport in terms of the average conductance for the small-world (Watts-Strogatz) model

Coordination sequences and information spreading in small-world networks

NASA Astrophysics Data System (ADS)

Herrero, Carlos P.

2002-10-01

We study the spread of information in small-world networks generated from different d-dimensional regular lattices, with d=1, 2, and 3. With this purpose, we analyze by numerical simulations the behavior of the coordination sequence, e.g., the average number of sites C(n) that can be reached from a given node of the network in n steps along its bonds. For sufficiently large networks, we find an asymptotic behavior C(n)~ρn, with a constant ρ that depends on the network dimension d and on the rewiring probability p (which measures the disorder strength of a given network). A simple model of information spreading in these networks is studied, assuming that only a fraction q of the network sites are active. The number of active nodes reached in n steps has an asymptotic form λn, λ being a constant that depends on p and q, as well as on the dimension d of the underlying lattice. The information spreading presents two different regimes depending on the value of λ: For λ>1 the information propagates along the whole system, and for λ<1 the spreading is damped and the information remains confined in a limited region of the network. We discuss the connection of these results with site percolation in small-world networks.

Social influence in small-world networks

NASA Astrophysics Data System (ADS)

Sun, Kai; Mao, Xiao-Ming; Ouyang, Qi

2002-12-01

We report on our numerical studies of the Axelrod model for social influence in small-world networks. Our simulation results show that the topology of the network has a crucial effect on the evolution of cultures. As the randomness of the network increases, the system undergoes a transition from a highly fragmented phase to a uniform phase. We also find that the power-law distribution at the transition point, reported by Castellano et al, is not a critical phenomenon; it exists not only at the onset of transition but also for almost any control parameters. All these power-law distributions are stable against perturbations. A mean-field theory is developed to explain these phenomena.

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

PubMed

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

2008-01-01

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

Scale-free networks which are highly assortative but not small world

NASA Astrophysics Data System (ADS)

Small, Michael; Xu, Xiaoke; Zhou, Jin; Zhang, Jie; Sun, Junfeng; Lu, Jun-An

2008-06-01

Uncorrelated scale-free networks are necessarily small world (and, in fact, smaller than small world). Nonetheless, for scale-free networks with correlated degree distribution this may not be the case. We describe a mechanism to generate highly assortative scale-free networks which are not small world. We show that it is possible to generate scale-free networks, with arbitrary degree exponent γ>1 , such that the average distance between nodes in the network is large. To achieve this, nodes are not added to the network with preferential attachment. Instead, we greedily optimize the assortativity of the network. The network generation scheme is physically motivated, and we show that the recently observed global network of Avian Influenza outbreaks arises through a mechanism similar to what we present here. Simulations show that this network exhibits very similar physical characteristics (very high assortativity, clustering, and path length).

Distribution of shortest path lengths in a class of node duplication network models

NASA Astrophysics Data System (ADS)

Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

2017-09-01

We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L =ℓ ) , ℓ =1 ,2 ,⋯ , where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L =ℓ ) . The mean distance 〈L〉 t and the diameter Δt are found to scale like lnt , namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt . Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which 〈L〉 t˜lnlnt .

On the relation between the small world structure and scientific activities.

PubMed

Ebadi, Ashkan; Schiffauerova, Andrea

2015-01-01

The modern science has become more complex and interdisciplinary in its nature which might encourage researchers to be more collaborative and get engaged in larger collaboration networks. Various aspects of collaboration networks have been examined so far to detect the most determinant factors in knowledge creation and scientific production. One of the network structures that recently attracted much theoretical attention is called small world. It has been suggested that small world can improve the information transmission among the network actors. In this paper, using the data on 12 periods of journal publications of Canadian researchers in natural sciences and engineering, the co-authorship networks of the researchers are created. Through measuring small world indicators, the small worldiness of the mentioned network and its relation with researchers' productivity, quality of their publications, and scientific team size are assessed. Our results show that the examined co-authorship network strictly exhibits the small world properties. In addition, it is suggested that in a small world network researchers expand their team size through getting connected to other experts of the field. This team size expansion may result in higher productivity of the whole team as a result of getting access to new resources, benefitting from the internal referring, and exchanging ideas among the team members. Moreover, although small world network is positively correlated with the quality of the articles in terms of both citation count and journal impact factor, it is negatively related with the average productivity of researchers in terms of the number of their publications.

On the Relation between the Small World Structure and Scientific Activities

PubMed Central

Ebadi, Ashkan; Schiffauerova, Andrea

2015-01-01

The modern science has become more complex and interdisciplinary in its nature which might encourage researchers to be more collaborative and get engaged in larger collaboration networks. Various aspects of collaboration networks have been examined so far to detect the most determinant factors in knowledge creation and scientific production. One of the network structures that recently attracted much theoretical attention is called small world. It has been suggested that small world can improve the information transmission among the network actors. In this paper, using the data on 12 periods of journal publications of Canadian researchers in natural sciences and engineering, the co-authorship networks of the researchers are created. Through measuring small world indicators, the small worldiness of the mentioned network and its relation with researchers’ productivity, quality of their publications, and scientific team size are assessed. Our results show that the examined co-authorship network strictly exhibits the small world properties. In addition, it is suggested that in a small world network researchers expand their team size through getting connected to other experts of the field. This team size expansion may result in higher productivity of the whole team as a result of getting access to new resources, benefitting from the internal referring, and exchanging ideas among the team members. Moreover, although small world network is positively correlated with the quality of the articles in terms of both citation count and journal impact factor, it is negatively related with the average productivity of researchers in terms of the number of their publications. PMID:25780922

Simulating synchronization in neuronal networks

NASA Astrophysics Data System (ADS)

Fink, Christian G.

2016-06-01

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

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

NASA Astrophysics Data System (ADS)

Türker, İlker

2018-05-01

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

Scaling of Directed Dynamical Small-World Networks with Random Responses

NASA Astrophysics Data System (ADS)

Zhu, Chen-Ping; Xiong, Shi-Jie; Tian, Ying-Jie; Li, Nan; Jiang, Ke-Sheng

2004-05-01

A dynamical model of small-world networks, with directed links which describe various correlations in social and natural phenomena, is presented. Random responses of sites to the input message are introduced to simulate real systems. The interplay of these ingredients results in the collective dynamical evolution of a spinlike variable S(t) of the whole network. The global average spreading length s and average spreading time s are found to scale as p-αln(N with different exponents. Meanwhile, S(t) behaves in a duple scaling form for N≫N*: S˜f(p-βqγt˜), where p and q are rewiring and external parameters, α, β, and γ are scaling exponents, and f(t˜) is a universal function. Possible applications of the model are discussed.

Synaptic dynamics regulation in response to high frequency stimulation in neuronal networks

NASA Astrophysics Data System (ADS)

Su, Fei; Wang, Jiang; Li, Huiyan; Wei, Xile; Yu, Haitao; Deng, Bin

2018-02-01

High frequency stimulation (HFS) has confirmed its ability in modulating the pathological neural activities. However its detailed mechanism is unclear. This study aims to explore the effects of HFS on neuronal networks dynamics. First, the two-neuron FitzHugh-Nagumo (FHN) networks with static coupling strength and the small-world FHN networks with spike-time-dependent plasticity (STDP) modulated synaptic coupling strength are constructed. Then, the multi-scale method is used to transform the network models into equivalent averaged models, where the HFS intensity is modeled as the ratio between stimulation amplitude and frequency. Results show that in static two-neuron networks, there is still synaptic current projected to the postsynaptic neuron even if the presynaptic neuron is blocked by the HFS. In the small-world networks, the effects of the STDP adjusting rate parameter on the inactivation ratio and synchrony degree increase with the increase of HFS intensity. However, only when the HFS intensity becomes very large can the STDP time window parameter affect the inactivation ratio and synchrony index. Both simulation and numerical analysis demonstrate that the effects of HFS on neuronal network dynamics are realized through the adjustment of synaptic variable and conductance.

Unimodular lattice triangulations as small-world and scale-free random graphs

NASA Astrophysics Data System (ADS)

Krüger, B.; Schmidt, E. M.; Mecke, K.

2015-02-01

Real-world networks, e.g., the social relations or world-wide-web graphs, exhibit both small-world and scale-free behaviour. We interpret lattice triangulations as planar graphs by identifying triangulation vertices with graph nodes and one-dimensional simplices with edges. Since these triangulations are ergodic with respect to a certain Pachner flip, applying different Monte Carlo simulations enables us to calculate average properties of random triangulations, as well as canonical ensemble averages, using an energy functional that is approximately the variance of the degree distribution. All considered triangulations have clustering coefficients comparable with real-world graphs; for the canonical ensemble there are inverse temperatures with small shortest path length independent of system size. Tuning the inverse temperature to a quasi-critical value leads to an indication of scale-free behaviour for degrees k≥slant 5. Using triangulations as a random graph model can improve the understanding of real-world networks, especially if the actual distance of the embedded nodes becomes important.

Markov models for fMRI correlation structure: Is brain functional connectivity small world, or decomposable into networks?

PubMed

Varoquaux, G; Gramfort, A; Poline, J B; Thirion, B

2012-01-01

Correlations in the signal observed via functional Magnetic Resonance Imaging (fMRI), are expected to reveal the interactions in the underlying neural populations through hemodynamic response. In particular, they highlight distributed set of mutually correlated regions that correspond to brain networks related to different cognitive functions. Yet graph-theoretical studies of neural connections give a different picture: that of a highly integrated system with small-world properties: local clustering but with short pathways across the complete structure. We examine the conditional independence properties of the fMRI signal, i.e. its Markov structure, to find realistic assumptions on the connectivity structure that are required to explain the observed functional connectivity. In particular we seek a decomposition of the Markov structure into segregated functional networks using decomposable graphs: a set of strongly-connected and partially overlapping cliques. We introduce a new method to efficiently extract such cliques on a large, strongly-connected graph. We compare methods learning different graph structures from functional connectivity by testing the goodness of fit of the model they learn on new data. We find that summarizing the structure as strongly-connected networks can give a good description only for very large and overlapping networks. These results highlight that Markov models are good tools to identify the structure of brain connectivity from fMRI signals, but for this purpose they must reflect the small-world properties of the underlying neural systems. Copyright © 2012 Elsevier Ltd. All rights reserved.

The Small World of Psychopathology

PubMed Central

Borsboom, Denny; Cramer, Angélique O. J.; Schmittmann, Verena D.; Epskamp, Sacha; Waldorp, Lourens J.

2011-01-01

Background Mental disorders are highly comorbid: people having one disorder are likely to have another as well. We explain empirical comorbidity patterns based on a network model of psychiatric symptoms, derived from an analysis of symptom overlap in the Diagnostic and Statistical Manual of Mental Disorders-IV (DSM-IV). Principal Findings We show that a) half of the symptoms in the DSM-IV network are connected, b) the architecture of these connections conforms to a small world structure, featuring a high degree of clustering but a short average path length, and c) distances between disorders in this structure predict empirical comorbidity rates. Network simulations of Major Depressive Episode and Generalized Anxiety Disorder show that the model faithfully reproduces empirical population statistics for these disorders. Conclusions In the network model, mental disorders are inherently complex. This explains the limited successes of genetic, neuroscientific, and etiological approaches to unravel their causes. We outline a psychosystems approach to investigate the structure and dynamics of mental disorders. PMID:22114671

FPGA implementation of motifs-based neuronal network and synchronization analysis

NASA Astrophysics Data System (ADS)

Deng, Bin; Zhu, Zechen; Yang, Shuangming; Wei, Xile; Wang, Jiang; Yu, Haitao

2016-06-01

Motifs in complex networks play a crucial role in determining the brain functions. In this paper, 13 kinds of motifs are implemented with Field Programmable Gate Array (FPGA) to investigate the relationships between the networks properties and motifs properties. We use discretization method and pipelined architecture to construct various motifs with Hindmarsh-Rose (HR) neuron as the node model. We also build a small-world network based on these motifs and conduct the synchronization analysis of motifs as well as the constructed network. We find that the synchronization properties of motif determine that of motif-based small-world network, which demonstrates effectiveness of our proposed hardware simulation platform. By imitation of some vital nuclei in the brain to generate normal discharges, our proposed FPGA-based artificial neuronal networks have the potential to replace the injured nuclei to complete the brain function in the treatment of Parkinson's disease and epilepsy.

A study of the electrical properties of complex resistor network based on NW model

NASA Astrophysics Data System (ADS)

Chang, Yunfeng; Li, Yunting; Yang, Liu; Guo, Lu; Liu, Gaochao

2015-04-01

The power and resistance of two-port complex resistor network based on NW small world network model are studied in this paper. Mainly, we study the dependence of the network power and resistance on the degree of port vertices, the connection probability and the shortest distance. Qualitative analysis and a simplified formula for network resistance are given out. Finally, we define a branching parameter and give out its physical meaning in the analysis of complex resistor network.

Critical behavior and correlations on scale-free small-world networks: Application to network design

NASA Astrophysics Data System (ADS)

Ostilli, M.; Ferreira, A. L.; Mendes, J. F. F.

2011-06-01

We analyze critical phenomena on networks generated as the union of hidden variable models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small worlds similar to those à la Watts and Strogatz, but with a heterogeneous degree distribution. We prove that the critical behavior (thermal or percolative) remains completely unchanged by the presence of finite loops (or finite clustering). Then, we show that, in large but finite networks, correlations of two given spins may be strong, i.e., approximately power-law-like, at any temperature. Quite interestingly, if γ is the exponent for the power-law distribution of the vertex degree, for γ⩽3 and with or without short-range couplings, such strong correlations persist even in the thermodynamic limit, contradicting the common opinion that, in mean-field models, correlations always disappear in this limit. Finally, we provide the optimal choice of rewiring under which percolation phenomena in the rewired network are best performed, a natural criterion to reach best communication features, at least in noncongested regimes.

Stretched exponential dynamics of coupled logistic maps on a small-world network

NASA Astrophysics Data System (ADS)

Mahajan, Ashwini V.; Gade, Prashant M.

2018-02-01

We investigate the dynamic phase transition from partially or fully arrested state to spatiotemporal chaos in coupled logistic maps on a small-world network. Persistence of local variables in a coarse grained sense acts as an excellent order parameter to study this transition. We investigate the phase diagram by varying coupling strength and small-world rewiring probability p of nonlocal connections. The persistent region is a compact region bounded by two critical lines where band-merging crisis occurs. On one critical line, the persistent sites shows a nonexponential (stretched exponential) decay for all p while for another one, it shows crossover from nonexponential to exponential behavior as p → 1 . With an effectively antiferromagnetic coupling, coupling to two neighbors on either side leads to exchange frustration. Apart from exchange frustration, non-bipartite topology and nonlocal couplings in a small-world network could be a reason for anomalous relaxation. The distribution of trap times in asymptotic regime has a long tail as well. The dependence of temporal evolution of persistence on initial conditions is studied and a scaling form for persistence after waiting time is proposed. We present a simple possible model for this behavior.

Constructing a Watts-Strogatz network from a small-world network with symmetric degree distribution.

PubMed

Menezes, Mozart B C; Kim, Seokjin; Huang, Rongbing

2017-01-01

Though the small-world phenomenon is widespread in many real networks, it is still challenging to replicate a large network at the full scale for further study on its structure and dynamics when sufficient data are not readily available. We propose a method to construct a Watts-Strogatz network using a sample from a small-world network with symmetric degree distribution. Our method yields an estimated degree distribution which fits closely with that of a Watts-Strogatz network and leads into accurate estimates of network metrics such as clustering coefficient and degree of separation. We observe that the accuracy of our method increases as network size increases.

Networks model of the East Turkistan terrorism

NASA Astrophysics Data System (ADS)

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

2015-02-01

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

Network evolution by nonlinear preferential rewiring of edges

NASA Astrophysics Data System (ADS)

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

2011-06-01

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

From brain to earth and climate systems: small-world interaction networks or not?

PubMed

Bialonski, Stephan; Horstmann, Marie-Therese; Lehnertz, Klaus

2010-03-01

We consider recent reports on small-world topologies of interaction networks derived from the dynamics of spatially extended systems that are investigated in diverse scientific fields such as neurosciences, geophysics, or meteorology. With numerical simulations that mimic typical experimental situations, we have identified an important constraint when characterizing such networks: indications of a small-world topology can be expected solely due to the spatial sampling of the system along with the commonly used time series analysis based approaches to network characterization.

Impact of mobility structure on optimization of small-world networks of mobile agents

NASA Astrophysics Data System (ADS)

Lee, Eun; Holme, Petter

2016-06-01

In ad hoc wireless networking, units are connected to each other rather than to a central, fixed, infrastructure. Constructing and maintaining such networks create several trade-off problems between robustness, communication speed, power consumption, etc., that bridges engineering, computer science and the physics of complex systems. In this work, we address the role of mobility patterns of the agents on the optimal tuning of a small-world type network construction method. By this method, the network is updated periodically and held static between the updates. We investigate the optimal updating times for different scenarios of the movement of agents (modeling, for example, the fat-tailed trip distances, and periodicities, of human travel). We find that these mobility patterns affect the power consumption in non-trivial ways and discuss how these effects can best be handled.

The topology of large Open Connectome networks for the human brain.

PubMed

Gastner, Michael T; Ódor, Géza

2016-06-07

The structural human connectome (i.e. the network of fiber connections in the brain) can be analyzed at ever finer spatial resolution thanks to advances in neuroimaging. Here we analyze several large data sets for the human brain network made available by the Open Connectome Project. We apply statistical model selection to characterize the degree distributions of graphs containing up to nodes and edges. A three-parameter generalized Weibull (also known as a stretched exponential) distribution is a good fit to most of the observed degree distributions. For almost all networks, simple power laws cannot fit the data, but in some cases there is statistical support for power laws with an exponential cutoff. We also calculate the topological (graph) dimension D and the small-world coefficient σ of these networks. While σ suggests a small-world topology, we found that D < 4 showing that long-distance connections provide only a small correction to the topology of the embedding three-dimensional space.

The topology of large Open Connectome networks for the human brain

NASA Astrophysics Data System (ADS)

Gastner, Michael T.; Ódor, Géza

2016-06-01

The structural human connectome (i.e. the network of fiber connections in the brain) can be analyzed at ever finer spatial resolution thanks to advances in neuroimaging. Here we analyze several large data sets for the human brain network made available by the Open Connectome Project. We apply statistical model selection to characterize the degree distributions of graphs containing up to nodes and edges. A three-parameter generalized Weibull (also known as a stretched exponential) distribution is a good fit to most of the observed degree distributions. For almost all networks, simple power laws cannot fit the data, but in some cases there is statistical support for power laws with an exponential cutoff. We also calculate the topological (graph) dimension D and the small-world coefficient σ of these networks. While σ suggests a small-world topology, we found that D < 4 showing that long-distance connections provide only a small correction to the topology of the embedding three-dimensional space.

Small-world network model of propagation of the AIDS epidemic

NASA Astrophysics Data System (ADS)

Shi, Pengliang; Small, Michael

2004-03-01

Sexual contact and intravenus drug-use are the most common modes of transmission of HIV-AIDS. In this paper, homogenerous and heterogeneous models are proposed to model the dynamics in a system contains Small-World clusters. Four high risk groups: intravenus drug-users (D); homosexuals (H); individuals with multiple-sexual partners (M) and prostitutes (P), are classified using two models. Both networks are embedded among a background (low-risk) population using rich-get-richer preferential attachment. When a network is established, an epidemic is simulated in it by seeding randomly. We compare the two epidemic networks in detail and consider the effect of different levels of control policies in both. This study highlights two main conclusions: (i) set high protection coefficient for a massive-linkage-vertex (i.e. protect the highly connected individuals); and, (ii) a quick removal for the infected massive-linkage-veterx from the network is essential (rapidly quarantine infected individuals). While these conclusions may be intuitive, they indicate a necessary change of public policy toward prostitution in some developing countries such as China and India. An active effort to prevent possible infection from super-spreader is recommended.

Collective relaxation dynamics of small-world networks

NASA Astrophysics Data System (ADS)

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

2015-05-01

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

Collective relaxation dynamics of small-world networks.

PubMed

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

2015-05-01

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

Quality of Care as an Emergent Phenomenon out of a Small-World Network of Relational Actors.

PubMed

Fiorini, Rodolfo; De Giacomo, Piero; Marconi, Pier Luigi; L'Abate, Luciano

2014-01-01

In Healthcare Decision Support System, the development and evaluation of effective "Quality of Care" (QOC) indicators, in simulation-based training, are key feature to develop resilient and antifragile organization scenarios. Is it possible to conceive of QOC not only as a result of a voluntary and rational decision, imposed or even not, but also as an overall system "emergent phenomenon" out of a small-world network of relational synthetic actors, endowed with their own personality profiles to simulate human behaviour (for short, called "subjects")? In order to answer this question and to observe the phenomena of real emergence we should use computational models of high complexity, with heavy computational load and extensive computational time. Nevertheless, De Giacomo's Elementary Pragmatic Model (EPM) intrinsic self-reflexive functional logical closure enables to run simulation examples to classify the outcomes grown out of a small-world network of relational subjects fast and effectively. Therefore, it is possible to take note and to learn of how much strategic systemic interventions can induce context conditions of QOC facilitation, which can improve the effectiveness of specific actions, which otherwise might be paradoxically counterproductive also. Early results are so encouraging to use EPM as basic block to start designing more powerful Evolutive Elementary Pragmatic Model (E2PM) for real emergence computational model, to cope with ontological uncertainty at system level.

Distributed Sensing and Processing: A Graphical Model Approach

DTIC Science & Technology

2005-11-30

that Ramanujan graph toplogies maximize the convergence rate of distributed detection consensus algorithms, improving over three orders of...small world type network designs. 14. SUBJECT TERMS Ramanujan graphs, sensor network topology, sensor network...that Ramanujan graphs, for which there are explicit algebraic constructions, have large eigenratios, converging much faster than structured graphs

Functional network inference of the suprachiasmatic nucleus

PubMed Central

Abel, John H.; Meeker, Kirsten; Granados-Fuentes, Daniel; St. John, Peter C.; Wang, Thomas J.; Bales, Benjamin B.; Doyle, Francis J.; Herzog, Erik D.; Petzold, Linda R.

2016-01-01

In the mammalian suprachiasmatic nucleus (SCN), noisy cellular oscillators communicate within a neuronal network to generate precise system-wide circadian rhythms. Although the intracellular genetic oscillator and intercellular biochemical coupling mechanisms have been examined previously, the network topology driving synchronization of the SCN has not been elucidated. This network has been particularly challenging to probe, due to its oscillatory components and slow coupling timescale. In this work, we investigated the SCN network at a single-cell resolution through a chemically induced desynchronization. We then inferred functional connections in the SCN by applying the maximal information coefficient statistic to bioluminescence reporter data from individual neurons while they resynchronized their circadian cycling. Our results demonstrate that the functional network of circadian cells associated with resynchronization has small-world characteristics, with a node degree distribution that is exponential. We show that hubs of this small-world network are preferentially located in the central SCN, with sparsely connected shells surrounding these cores. Finally, we used two computational models of circadian neurons to validate our predictions of network structure. PMID:27044085

Effects of spike-time-dependent plasticity on the stochastic resonance of small-world neuronal networks

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

Yu, Haitao; Guo, Xinmeng; Wang, Jiang, E-mail: jiangwang@tju.edu.cn

2014-09-01

The phenomenon of stochastic resonance in Newman-Watts small-world neuronal networks is investigated when the strength of synaptic connections between neurons is adaptively adjusted by spike-time-dependent plasticity (STDP). It is shown that irrespective of the synaptic connectivity is fixed or adaptive, the phenomenon of stochastic resonance occurs. The efficiency of network stochastic resonance can be largely enhanced by STDP in the coupling process. Particularly, the resonance for adaptive coupling can reach a much larger value than that for fixed one when the noise intensity is small or intermediate. STDP with dominant depression and small temporal window ratio is more efficient formore » the transmission of weak external signal in small-world neuronal networks. In addition, we demonstrate that the effect of stochastic resonance can be further improved via fine-tuning of the average coupling strength of the adaptive network. Furthermore, the small-world topology can significantly affect stochastic resonance of excitable neuronal networks. It is found that there exists an optimal probability of adding links by which the noise-induced transmission of weak periodic signal peaks.« less

Transmission of severe acute respiratory syndrome in dynamical small-world networks

NASA Astrophysics Data System (ADS)

Masuda, Naoki; Konno, Norio; Aihara, Kazuyuki

2004-03-01

The outbreak of severe acute respiratory syndrome (SARS) is still threatening the world because of a possible resurgence. In the current situation that effective medical treatments such as antiviral drugs are not discovered yet, dynamical features of the epidemics should be clarified for establishing strategies for tracing, quarantine, isolation, and regulating social behavior of the public at appropriate costs. Here we propose a network model for SARS epidemics and discuss why superspreaders emerged and why SARS spread especially in hospitals, which were key factors of the recent outbreak. We suggest that superspreaders are biologically contagious patients, and they may amplify the spreads by going to potentially contagious places such as hospitals. To avoid mass transmission in hospitals, it may be a good measure to treat suspected cases without hospitalizing them. Finally, we indicate that SARS probably propagates in small-world networks associated with human contacts and that the biological nature of individuals and social group properties are factors more important than the heterogeneous rates of social contacts among individuals. This is in marked contrast with epidemics of sexually transmitted diseases or computer viruses to which scale-free network models often apply.

International migration network: Topology and modeling

NASA Astrophysics Data System (ADS)

Fagiolo, Giorgio; Mastrorillo, Marina

2013-07-01

This paper studies international migration from a complex-network perspective. We define the international migration network (IMN) as the weighted-directed graph where nodes are world countries and links account for the stock of migrants originated in a given country and living in another country at a given point in time. We characterize the binary and weighted architecture of the network and its evolution over time in the period 1960-2000. We find that the IMN is organized around a modular structure with a small-world binary pattern displaying disassortativity and high clustering, with power-law distributed weighted-network statistics. We also show that a parsimonious gravity model of migration can account for most of observed IMN topological structure. Overall, our results suggest that socioeconomic, geographical, and political factors are more important than local-network properties in shaping the structure of the IMN.

International migration network: topology and modeling.

PubMed

Fagiolo, Giorgio; Mastrorillo, Marina

2013-07-01

This paper studies international migration from a complex-network perspective. We define the international migration network (IMN) as the weighted-directed graph where nodes are world countries and links account for the stock of migrants originated in a given country and living in another country at a given point in time. We characterize the binary and weighted architecture of the network and its evolution over time in the period 1960-2000. We find that the IMN is organized around a modular structure with a small-world binary pattern displaying disassortativity and high clustering, with power-law distributed weighted-network statistics. We also show that a parsimonious gravity model of migration can account for most of observed IMN topological structure. Overall, our results suggest that socioeconomic, geographical, and political factors are more important than local-network properties in shaping the structure of the IMN.

Harmony in the small-world

NASA Astrophysics Data System (ADS)

Marchiori, Massimo; Latora, Vito

2000-10-01

The small-world phenomenon, popularly known as six degrees of separation, has been mathematically formalized by Watts and Strogatz in a study of the topological properties of a network. Small-world networks are defined in terms of two quantities: they have a high clustering coefficient C like regular lattices and a short characteristic path length L typical of random networks. Physical distances are of fundamental importance in applications to real cases; nevertheless, this basic ingredient is missing in the original formulation. Here, we introduce a new concept, the connectivity length D, that gives harmony to the whole theory. D can be evaluated on a global and on a local scale and plays in turn the role of L and 1/ C. Moreover, it can be computed for any metrical network and not only for the topological cases. D has a precise meaning in terms of information propagation and describes in a unified way, both the structural and the dynamical aspects of a network: small-worlds are defined by a small global and local D, i.e., by a high efficiency in propagating information both on a local and global scale. The neural system of the nematode C. elegans, the collaboration graph of film actors, and the oldest US subway system, can now be studied also as metrical networks and are shown to be small-worlds.

Small worlds in space: Synchronization, spatial and relational modularity

NASA Astrophysics Data System (ADS)

Brede, M.

2010-06-01

In this letter we investigate networks that have been optimized to realize a trade-off between enhanced synchronization and cost of wire to connect the nodes in space. Analyzing the evolved arrangement of nodes in space and their corresponding network topology, a class of small-world networks characterized by spatial and network modularity is found. More precisely, for low cost of wire optimal configurations are characterized by a division of nodes into two spatial groups with maximum distance from each other, whereas network modularity is low. For high cost of wire, the nodes organize into several distinct groups in space that correspond to network modules connected on a ring. In between, spatially and relationally modular small-world networks are found.

Generative model selection using a scalable and size-independent complex network classifier

NASA Astrophysics Data System (ADS)

Motallebi, Sadegh; Aliakbary, Sadegh; Habibi, Jafar

2013-12-01

Real networks exhibit nontrivial topological features, such as heavy-tailed degree distribution, high clustering, and small-worldness. Researchers have developed several generative models for synthesizing artificial networks that are structurally similar to real networks. An important research problem is to identify the generative model that best fits to a target network. In this paper, we investigate this problem and our goal is to select the model that is able to generate graphs similar to a given network instance. By the means of generating synthetic networks with seven outstanding generative models, we have utilized machine learning methods to develop a decision tree for model selection. Our proposed method, which is named "Generative Model Selection for Complex Networks," outperforms existing methods with respect to accuracy, scalability, and size-independence.

Étude statistique et dynamique de la propagation d'épidémies dans un réseau de petit mondeStatistical and dynamical study of the epidemics propagation in a small world network

NASA Astrophysics Data System (ADS)

Zekri, Nouredine; Clerc, Jean Pierre

We study numerically in this work the statistical and dynamical properties of the clusters in a one dimensional small world model. The parameters chosen correspond to a realistic network of children of school age where a disease like measles can propagate. Extensive results on the statistical behavior of the clusters around the percolation threshold, as well as the evoltion with time, are discussed. To cite this article: N. Zekri, J.P. Clerc, C. R. Physique 3 (2002) 741-747.

A novel memristive multilayer feedforward small-world neural network with its applications in PID control.

PubMed

Dong, Zhekang; Duan, Shukai; Hu, Xiaofang; Wang, Lidan; Li, Hai

2014-01-01

In this paper, we present an implementation scheme of memristor-based multilayer feedforward small-world neural network (MFSNN) inspirited by the lack of the hardware realization of the MFSNN on account of the need of a large number of electronic neurons and synapses. More specially, a mathematical closed-form charge-governed memristor model is presented with derivation procedures and the corresponding Simulink model is presented, which is an essential block for realizing the memristive synapse and the activation function in electronic neurons. Furthermore, we investigate a more intelligent memristive PID controller by incorporating the proposed MFSNN into intelligent PID control based on the advantages of the memristive MFSNN on computation speed and accuracy. Finally, numerical simulations have demonstrated the effectiveness of the proposed scheme.

A Novel Memristive Multilayer Feedforward Small-World Neural Network with Its Applications in PID Control

PubMed Central

Dong, Zhekang; Duan, Shukai; Hu, Xiaofang; Wang, Lidan

2014-01-01

In this paper, we present an implementation scheme of memristor-based multilayer feedforward small-world neural network (MFSNN) inspirited by the lack of the hardware realization of the MFSNN on account of the need of a large number of electronic neurons and synapses. More specially, a mathematical closed-form charge-governed memristor model is presented with derivation procedures and the corresponding Simulink model is presented, which is an essential block for realizing the memristive synapse and the activation function in electronic neurons. Furthermore, we investigate a more intelligent memristive PID controller by incorporating the proposed MFSNN into intelligent PID control based on the advantages of the memristive MFSNN on computation speed and accuracy. Finally, numerical simulations have demonstrated the effectiveness of the proposed scheme. PMID:25202723

Temporal node centrality in complex networks

NASA Astrophysics Data System (ADS)

Kim, Hyoungshick; Anderson, Ross

2012-02-01

Many networks are dynamic in that their topology changes rapidly—on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been lacking for the dynamic case. In this paper we present a simple but powerful model, the time-ordered graph, which reduces a dynamic network to a static network with directed flows. This enables us to extend network properties such as vertex degree, closeness, and betweenness centrality metrics in a very natural way to the dynamic case. We then demonstrate how our model applies to a number of interesting edge cases, such as where the network connectivity depends on a small number of highly mobile vertices or edges, and show that our centrality definition allows us to track the evolution of connectivity. Finally we apply our model and techniques to two real-world dynamic graphs of human contact networks and then discuss the implication of temporal centrality metrics in the real world.

Brain anatomical networks in early human brain development.

PubMed

Fan, Yong; Shi, Feng; Smith, Jeffrey Keith; Lin, Weili; Gilmore, John H; Shen, Dinggang

2011-02-01

Recent neuroimaging studies have demonstrated that human brain networks have economic small-world topology and modular organization, enabling efficient information transfer among brain regions. However, it remains largely unknown how the small-world topology and modular organization of human brain networks emerge and develop. Using longitudinal MRI data of 28 healthy pediatric subjects, collected at their ages of 1 month, 1 year, and 2 years, we analyzed development patterns of brain anatomical networks derived from morphological correlations of brain regional volumes. The results show that the brain network of 1-month-olds has the characteristically economic small-world topology and nonrandom modular organization. The network's cost efficiency increases with the brain development to 1 year and 2 years, so does the modularity, providing supportive evidence for the hypothesis that the small-world topology and the modular organization of brain networks are established during early brain development to support rapid synchronization and information transfer with minimal rewiring cost, as well as to balance between local processing and global integration of information. Copyright © 2010. Published by Elsevier Inc.

A distance constrained synaptic plasticity model of C. elegans neuronal network

NASA Astrophysics Data System (ADS)

Badhwar, Rahul; Bagler, Ganesh

2017-03-01

Brain research has been driven by enquiry for principles of brain structure organization and its control mechanisms. The neuronal wiring map of C. elegans, the only complete connectome available till date, presents an incredible opportunity to learn basic governing principles that drive structure and function of its neuronal architecture. Despite its apparently simple nervous system, C. elegans is known to possess complex functions. The nervous system forms an important underlying framework which specifies phenotypic features associated to sensation, movement, conditioning and memory. In this study, with the help of graph theoretical models, we investigated the C. elegans neuronal network to identify network features that are critical for its control. The 'driver neurons' are associated with important biological functions such as reproduction, signalling processes and anatomical structural development. We created 1D and 2D network models of C. elegans neuronal system to probe the role of features that confer controllability and small world nature. The simple 1D ring model is critically poised for the number of feed forward motifs, neuronal clustering and characteristic path-length in response to synaptic rewiring, indicating optimal rewiring. Using empirically observed distance constraint in the neuronal network as a guiding principle, we created a distance constrained synaptic plasticity model that simultaneously explains small world nature, saturation of feed forward motifs as well as observed number of driver neurons. The distance constrained model suggests optimum long distance synaptic connections as a key feature specifying control of the network.

Self-Healing Networks: Redundancy and Structure

PubMed Central

Quattrociocchi, Walter; Caldarelli, Guido; Scala, Antonio

2014-01-01

We introduce the concept of self-healing in the field of complex networks modelling; in particular, self-healing capabilities are implemented through distributed communication protocols that exploit redundant links to recover the connectivity of the system. We then analyze the effect of the level of redundancy on the resilience to multiple failures; in particular, we measure the fraction of nodes still served for increasing levels of network damages. Finally, we study the effects of redundancy under different connectivity patterns—from planar grids, to small-world, up to scale-free networks—on healing performances. Small-world topologies show that introducing some long-range connections in planar grids greatly enhances the resilience to multiple failures with performances comparable to the case of the most resilient (and least realistic) scale-free structures. Obvious applications of self-healing are in the important field of infrastructural networks like gas, power, water, oil distribution systems. PMID:24533065

Microscopic Spin Model for the STOCK Market with Attractor Bubbling on Regular and Small-World Lattices

NASA Astrophysics Data System (ADS)

Krawiecki, A.

A multi-agent spin model for changes of prices in the stock market based on the Ising-like cellular automaton with interactions between traders randomly varying in time is investigated by means of Monte Carlo simulations. The structure of interactions has topology of a small-world network obtained from regular two-dimensional square lattices with various coordination numbers by randomly cutting and rewiring edges. Simulations of the model on regular lattices do not yield time series of logarithmic price returns with statistical properties comparable with the empirical ones. In contrast, in the case of networks with a certain degree of randomness for a wide range of parameters the time series of the logarithmic price returns exhibit intermittent bursting typical of volatility clustering. Also the tails of distributions of returns obey a power scaling law with exponents comparable to those obtained from the empirical data.

Functional network inference of the suprachiasmatic nucleus

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

Abel, John H.; Meeker, Kirsten; Granados-Fuentes, Daniel

2016-04-04

In the mammalian suprachiasmatic nucleus (SCN), noisy cellular oscillators communicate within a neuronal network to generate precise system-wide circadian rhythms. Although the intracellular genetic oscillator and intercellular biochemical coupling mechanisms have been examined previously, the network topology driving synchronization of the SCN has not been elucidated. This network has been particularly challenging to probe, due to its oscillatory components and slow coupling timescale. In this work, we investigated the SCN network at a single-cell resolution through a chemically induced desynchronization. We then inferred functional connections in the SCN by applying the maximal information coefficient statistic to bioluminescence reporter data frommore » individual neurons while they resynchronized their circadian cycling. Our results demonstrate that the functional network of circadian cells associated with resynchronization has small-world characteristics, with a node degree distribution that is exponential. We show that hubs of this small-world network are preferentially located in the central SCN, with sparsely connected shells surrounding these cores. Finally, we used two computational models of circadian neurons to validate our predictions of network structure.« less

Generative model selection using a scalable and size-independent complex network classifier

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

Motallebi, Sadegh, E-mail: motallebi@ce.sharif.edu; Aliakbary, Sadegh, E-mail: aliakbary@ce.sharif.edu; Habibi, Jafar, E-mail: jhabibi@sharif.edu

2013-12-15

Real networks exhibit nontrivial topological features, such as heavy-tailed degree distribution, high clustering, and small-worldness. Researchers have developed several generative models for synthesizing artificial networks that are structurally similar to real networks. An important research problem is to identify the generative model that best fits to a target network. In this paper, we investigate this problem and our goal is to select the model that is able to generate graphs similar to a given network instance. By the means of generating synthetic networks with seven outstanding generative models, we have utilized machine learning methods to develop a decision tree formore » model selection. Our proposed method, which is named “Generative Model Selection for Complex Networks,” outperforms existing methods with respect to accuracy, scalability, and size-independence.« less

Spatial Epidemic Modelling in Social Networks

NASA Astrophysics Data System (ADS)

Simoes, Joana Margarida

2005-06-01

The spread of infectious diseases is highly influenced by the structure of the underlying social network. The target of this study is not the network of acquaintances, but the social mobility network: the daily movement of people between locations, in regions. It was already shown that this kind of network exhibits small world characteristics. The model developed is agent based (ABM) and comprehends a movement model and a infection model. In the movement model, some assumptions are made about its structure and the daily movement is decomposed into four types: neighborhood, intra region, inter region and random. The model is Geographical Information Systems (GIS) based, and uses real data to define its geometry. Because it is a vector model, some optimization techniques were used to increase its efficiency.

SmallSat Database

NASA Technical Reports Server (NTRS)

Petropulos, Dolores; Bittner, David; Murawski, Robert; Golden, Bert

2015-01-01

The SmallSat has an unrealized potential in both the private industry and in the federal government. Currently over 70 companies, 50 universities and 17 governmental agencies are involved in SmallSat research and development. In 1994, the U.S. Army Missile and Defense mapped the moon using smallSat imagery. Since then Smart Phones have introduced this imagery to the people of the world as diverse industries watched this trend. The deployment cost of smallSats is also greatly reduced compared to traditional satellites due to the fact that multiple units can be deployed in a single mission. Imaging payloads have become more sophisticated, smaller and lighter. In addition, the growth of small technology obtained from private industries has led to the more widespread use of smallSats. This includes greater revisit rates in imagery, significantly lower costs, the ability to update technology more frequently and the ability to decrease vulnerability of enemy attacks. The popularity of smallSats show a changing mentality in this fast paced world of tomorrow. What impact has this created on the NASA communication networks now and in future years? In this project, we are developing the SmallSat Relational Database which can support a simulation of smallSats within the NASA SCaN Compatability Environment for Networks and Integrated Communications (SCENIC) Modeling and Simulation Lab. The NASA Space Communications and Networks (SCaN) Program can use this modeling to project required network support needs in the next 10 to 15 years. The SmallSat Rational Database could model smallSats just as the other SCaN databases model the more traditional larger satellites, with a few exceptions. One being that the smallSat Database is designed to be built-to-order. The SmallSat database holds various hardware configurations that can be used to model a smallSat. It will require significant effort to develop as the research material can only be populated by hand to obtain the unique data required. When completed it will interface with the SCENIC environment to allow modeling of smallSats. The SmallSat Relational Database can also be integrated with the SCENIC Simulation modeling system that is currently in development. The SmallSat Relational Database simulation will be of great significance in assisting the NASA SCaN group to understand the impact the smallSats have made which have populated the lower orbit around our mother earth. What I have created and worked on this summer session 2015, is the basis for a tool that will be of value to the NASA SCaN SCENIC Simulation Environment for years to come.

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

PubMed

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

2015-01-01

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

Equity venture capital platform model based on complex network

NASA Astrophysics Data System (ADS)

Guo, Dongwei; Zhang, Lanshu; Liu, Miao

2018-05-01

This paper uses the small-world network and the random-network to simulate the relationship among the investors, construct the network model of the equity venture capital platform to explore the impact of the fraud rate and the bankruptcy rate on the robustness of the network model while observing the impact of the average path length and the average agglomeration coefficient of the investor relationship network on the income of the network model. The study found that the fraud rate and bankruptcy rate exceeded a certain threshold will lead to network collapse; The bankruptcy rate has a great influence on the income of the platform; The risk premium exists, and the average return is better under a certain range of bankruptcy risk; The structure of the investor relationship network has no effect on the income of the investment model.

DWTP: a basis for networked VR on the Internet

NASA Astrophysics Data System (ADS)

Broll, Wolfgang; Schick, Daniel

1998-04-01

Shared virtual worlds are one of today's major research topics. While limited to particular application areas and high speed networks in the past, they become more and more available to a large number of users. One reason for this development was the introduction of VRML (the Virtual Reality Modeling Language), which has been established as a standard of the exchange of 3D worlds on the Internet. Although a number of prototype systems have been developed to realize shared multi-user worlds based on VRML, no suitable network protocol to support the demands of such environments has yet been established. In this paper we will introduce our approach of a network protocol for shared virtual environments: DWTP--the Distributed Worlds Transfer and communication Protocol. We will show how DWTP meets the demands of shared virtual environments on the Internet. We will further present SmallView, our prototype of a distributed multi-user VR system, to show how DWTP can be used to realize shared worlds.

The Role of Graphlets in Viral Processes on Networks

NASA Astrophysics Data System (ADS)

Khorshidi, Samira; Al Hasan, Mohammad; Mohler, George; Short, Martin B.

2018-05-01

Predicting the evolution of viral processes on networks is an important problem with applications arising in biology, the social sciences, and the study of the Internet. In existing works, mean-field analysis based upon degree distribution is used for the prediction of viral spreading across networks of different types. However, it has been shown that degree distribution alone fails to predict the behavior of viruses on some real-world networks and recent attempts have been made to use assortativity to address this shortcoming. In this paper, we show that adding assortativity does not fully explain the variance in the spread of viruses for a number of real-world networks. We propose using the graphlet frequency distribution in combination with assortativity to explain variations in the evolution of viral processes across networks with identical degree distribution. Using a data-driven approach by coupling predictive modeling with viral process simulation on real-world networks, we show that simple regression models based on graphlet frequency distribution can explain over 95% of the variance in virality on networks with the same degree distribution but different network topologies. Our results not only highlight the importance of graphlets but also identify a small collection of graphlets which may have the highest influence over the viral processes on a network.

A last updating evolution model for online social networks

NASA Astrophysics Data System (ADS)

Bu, Zhan; Xia, Zhengyou; Wang, Jiandong; Zhang, Chengcui

2013-05-01

As information technology has advanced, people are turning to electronic media more frequently for communication, and social relationships are increasingly found on online channels. However, there is very limited knowledge about the actual evolution of the online social networks. In this paper, we propose and study a novel evolution network model with the new concept of “last updating time”, which exists in many real-life online social networks. The last updating evolution network model can maintain the robustness of scale-free networks and can improve the network reliance against intentional attacks. What is more, we also found that it has the “small-world effect”, which is the inherent property of most social networks. Simulation experiment based on this model show that the results and the real-life data are consistent, which means that our model is valid.

Small-worldness and gender differences of large scale brain metabolic covariance networks in young adults: a FDG PET study of 400 subjects.

PubMed

Hu, Yuxiao; Xu, Qiang; Shen, Junkang; Li, Kai; Zhu, Hong; Zhang, Zhiqiang; Lu, Guangming

2015-02-01

Many studies have demonstrated the small-worldness of the human brain, and have revealed a sexual dimorphism in brain network properties. However, little is known about the gender effects on the topological organization of the brain metabolic covariance networks. To investigate the small-worldness and the gender differences in the topological architectures of human brain metabolic networks. FDG-PET data of 400 healthy right-handed subjects (200 women and 200 age-matched men) were involved in the present study. Metabolic networks of each gender were constructed by calculating the covariance of regional cerebral glucose metabolism (rCMglc) across subjects on the basis of AAL parcellation. Gender differences of network and nodal properties were investigated by using the graph theoretical approaches. Moreover, the gender-related difference of rCMglc in each brain region was tested for investigating the relationships between the hub regions and the brain regions showing significant gender-related differences in rCMglc. We found prominent small-world properties in the domain of metabolic networks in each gender. No significant gender difference in the global characteristics was found. Gender differences of nodal characteristic were observed in a few brain regions. We also found bilateral and lateralized distributions of network hubs in the females and males. Furthermore, we first reported that some hubs of a gender located in the brain regions showing weaker rCMglc in this gender than the other gender. The present study demonstrated that small-worldness was existed in metabolic networks, and revealed gender differences of organizational patterns in metabolic network. These results maybe provided insights into the understanding of the metabolic substrates underlying individual differences in cognition and behaviors. © The Foundation Acta Radiologica 2014 Reprints and permissions: sagepub.co.uk/journalsPermissions.nav.

Reconstruction of a Real World Social Network using the Potts Model and Loopy Belief Propagation.

PubMed

Bisconti, Cristian; Corallo, Angelo; Fortunato, Laura; Gentile, Antonio A; Massafra, Andrea; Pellè, Piergiuseppe

2015-01-01

The scope of this paper is to test the adoption of a statistical model derived from Condensed Matter Physics, for the reconstruction of the structure of a social network. The inverse Potts model, traditionally applied to recursive observations of quantum states in an ensemble of particles, is here addressed to observations of the members' states in an organization and their (anti)correlations, thus inferring interactions as links among the members. Adopting proper (Bethe) approximations, such an inverse problem is showed to be tractable. Within an operational framework, this network-reconstruction method is tested for a small real-world social network, the Italian parliament. In this study case, it is easy to track statuses of the parliament members, using (co)sponsorships of law proposals as the initial dataset. In previous studies of similar activity-based networks, the graph structure was inferred directly from activity co-occurrences: here we compare our statistical reconstruction with such standard methods, outlining discrepancies and advantages.

Reconstruction of a Real World Social Network using the Potts Model and Loopy Belief Propagation

PubMed Central

Bisconti, Cristian; Corallo, Angelo; Fortunato, Laura; Gentile, Antonio A.; Massafra, Andrea; Pellè, Piergiuseppe

2015-01-01

The scope of this paper is to test the adoption of a statistical model derived from Condensed Matter Physics, for the reconstruction of the structure of a social network. The inverse Potts model, traditionally applied to recursive observations of quantum states in an ensemble of particles, is here addressed to observations of the members' states in an organization and their (anti)correlations, thus inferring interactions as links among the members. Adopting proper (Bethe) approximations, such an inverse problem is showed to be tractable. Within an operational framework, this network-reconstruction method is tested for a small real-world social network, the Italian parliament. In this study case, it is easy to track statuses of the parliament members, using (co)sponsorships of law proposals as the initial dataset. In previous studies of similar activity-based networks, the graph structure was inferred directly from activity co-occurrences: here we compare our statistical reconstruction with such standard methods, outlining discrepancies and advantages. PMID:26617539

The Conundrum of Functional Brain Networks: Small-World Efficiency or Fractal Modularity

PubMed Central

Gallos, Lazaros K.; Sigman, Mariano; Makse, Hernán A.

2012-01-01

The human brain has been studied at multiple scales, from neurons, circuits, areas with well-defined anatomical and functional boundaries, to large-scale functional networks which mediate coherent cognition. In a recent work, we addressed the problem of the hierarchical organization in the brain through network analysis. Our analysis identified functional brain modules of fractal structure that were inter-connected in a small-world topology. Here, we provide more details on the use of network science tools to elaborate on this behavior. We indicate the importance of using percolation theory to highlight the modular character of the functional brain network. These modules present a fractal, self-similar topology, identified through fractal network methods. When we lower the threshold of correlations to include weaker ties, the network as a whole assumes a small-world character. These weak ties are organized precisely as predicted by theory maximizing information transfer with minimal wiring costs. PMID:22586406

Emergence of small-world structure in networks of spiking neurons through STDP plasticity.

PubMed

Basalyga, Gleb; Gleiser, Pablo M; Wennekers, Thomas

2011-01-01

In this work, we use a complex network approach to investigate how a neural network structure changes under synaptic plasticity. In particular, we consider a network of conductance-based, single-compartment integrate-and-fire excitatory and inhibitory neurons. Initially the neurons are connected randomly with uniformly distributed synaptic weights. The weights of excitatory connections can be strengthened or weakened during spiking activity by the mechanism known as spike-timing-dependent plasticity (STDP). We extract a binary directed connection matrix by thresholding the weights of the excitatory connections at every simulation step and calculate its major topological characteristics such as the network clustering coefficient, characteristic path length and small-world index. We numerically demonstrate that, under certain conditions, a nontrivial small-world structure can emerge from a random initial network subject to STDP learning.

Market-oriented Programming Using Small-world Networks for Controlling Building Environments

NASA Astrophysics Data System (ADS)

Shigei, Noritaka; Miyajima, Hiromi; Osako, Tsukasa

The market model, which is one of the economic activity models, is modeled as an agent system, and applying the model to the resource allocation problem has been studied. For air conditioning control of building, which is one of the resource allocation problems, an effective method based on the agent system using auction has been proposed for traditional PID controller. On the other hand, it has been considered that this method is performed by decentralized control. However, its decentralization is not perfect, and its performace is not enough. In this paper, firstly, we propose a perfectly decentralized agent model and show its performance. Secondly, in order to improve the model, we propose the agent model based on small-world model. The effectiveness of the proposed model is shown by simulation.

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

NASA Astrophysics Data System (ADS)

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

2018-06-01

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

Network marketing with bounded rationality and partial information

NASA Astrophysics Data System (ADS)

Kiet, Hoang Anh Tuan; Kim, Beom Jun

2008-08-01

Network marketing has been proposed and used as a way to spread the product information to consumers through social connections. We extend the previous game model of the network marketing on a small-world tree network and propose two games: In the first model with the bounded rationality, each consumer makes purchase decision stochastically, while in the second model, consumers get only partial information due to the finite length of social connections. Via extensive numerical simulations, we find that as the rationality is enhanced not only the consumer surplus but also the firm’s profit is increased. The implication of our results is also discussed.

A small world of weak ties provides optimal global integration of self-similar modules in functional brain networks.

PubMed

Gallos, Lazaros K; Makse, Hernán A; Sigman, Mariano

2012-02-21

The human brain is organized in functional modules. Such an organization presents a basic conundrum: Modules ought to be sufficiently independent to guarantee functional specialization and sufficiently connected to bind multiple processors for efficient information transfer. It is commonly accepted that small-world architecture of short paths and large local clustering may solve this problem. However, there is intrinsic tension between shortcuts generating small worlds and the persistence of modularity, a global property unrelated to local clustering. Here, we present a possible solution to this puzzle. We first show that a modified percolation theory can define a set of hierarchically organized modules made of strong links in functional brain networks. These modules are "large-world" self-similar structures and, therefore, are far from being small-world. However, incorporating weaker ties to the network converts it into a small world preserving an underlying backbone of well-defined modules. Remarkably, weak ties are precisely organized as predicted by theory maximizing information transfer with minimal wiring cost. This trade-off architecture is reminiscent of the "strength of weak ties" crucial concept of social networks. Such a design suggests a natural solution to the paradox of efficient information flow in the highly modular structure of the brain.

Modeling the spreading of large-scale wildland fires

Treesearch

Mohamed Drissi

2015-01-01

The objective of the present study is twofold. First, the last developments and validation results of a hybrid model designed to simulate fire patterns in heterogeneous landscapes are presented. The model combines the features of a stochastic small-world network model with those of a deterministic semi-physical model of the interaction between burning and non-burning...

Optical mapping of prefrontal brain connectivity and activation during emotion anticipation.

PubMed

Wang, Meng-Yun; Lu, Feng-Mei; Hu, Zhishan; Zhang, Juan; Yuan, Zhen

2018-09-17

Accumulated neuroimaging evidence shows that the dorsal lateral prefrontal cortex (dlPFC) is activated during emotion anticipation. The aim of this work is to examine the brain connectivity and activation differences in dlPFC between the positive, neutral and negative emotion anticipation by using functional near-infrared spectroscopy (fNIRS). The hemodynamic responses were first assessed for all subjects during the performance of various emotion anticipation tasks. And then small-world analysis was performed, in which the small-world network indicators including the clustering coefficient, average path length, average node degree, and measure of small-world index were calculated for the functional brain networks associated with the positive, neutral and negative emotion anticipation, respectively. We discovered that compared to negative and neutral emotion anticipation, the positive one exhibited enhanced brain activation in the left dlPFC. Although the functional brain networks for the three emotion anticipation cases manifested the small-world properties regarding the clustering coefficient, average path length, average node degree, and measure of small-world index, the positive one showed significantly higher clustering coefficient and shorter average path length than those from the neutral and negative cases. Consequently, the small-world network indicators and brain activation in dlPPC were able to distinguish well between the positive, neutral and negative emotion anticipation. Copyright © 2018 Elsevier B.V. All rights reserved.

Nonequilibrium transitions in complex networks: A model of social interaction

NASA Astrophysics Data System (ADS)

Klemm, Konstantin; Eguíluz, Víctor M.; Toral, Raúl; San Miguel, Maxi

2003-02-01

We analyze the nonequilibrium order-disorder transition of Axelrod’s model of social interaction in several complex networks. In a small-world network, we find a transition between an ordered homogeneous state and a disordered state. The transition point is shifted by the degree of spatial disorder of the underlying network, the network disorder favoring ordered configurations. In random scale-free networks the transition is only observed for finite size systems, showing system size scaling, while in the thermodynamic limit only ordered configurations are always obtained. Thus, in the thermodynamic limit the transition disappears. However, in structured scale-free networks, the phase transition between an ordered and a disordered phase is restored.

a New Dynamic Community Model for Social Networks

NASA Astrophysics Data System (ADS)

Lu, Zhe-Ming; Wu, Zhen; Guo, Shi-Ze; Chen, Zhe; Song, Guang-Hua

2014-09-01

In this paper, based on the phenomenon that individuals join into and jump from the organizations in the society, we propose a dynamic community model to construct social networks. Two parameters are adopted in our model, one is the communication rate Pa that denotes the connection strength in the organization and the other is the turnover rate Pb, that stands for the frequency of jumping among the organizations. Based on simulations, we analyze not only the degree distribution, the clustering coefficient, the average distance and the network diameter but also the group distribution which is closely related to their community structure. Moreover, we discover that the networks generated by the proposed model possess the small-world property and can well reproduce the networks of social contacts.

Trade-offs between driving nodes and time-to-control in complex networks

PubMed Central

Pequito, Sérgio; Preciado, Victor M.; Barabási, Albert-László; Pappas, George J.

2017-01-01

Recent advances in control theory provide us with efficient tools to determine the minimum number of driving (or driven) nodes to steer a complex network towards a desired state. Furthermore, we often need to do it within a given time window, so it is of practical importance to understand the trade-offs between the minimum number of driving/driven nodes and the minimum time required to reach a desired state. Therefore, we introduce the notion of actuation spectrum to capture such trade-offs, which we used to find that in many complex networks only a small fraction of driving (or driven) nodes is required to steer the network to a desired state within a relatively small time window. Furthermore, our empirical studies reveal that, even though synthetic network models are designed to present structural properties similar to those observed in real networks, their actuation spectra can be dramatically different. Thus, it supports the need to develop new synthetic network models able to replicate controllability properties of real-world networks. PMID:28054597

Trade-offs between driving nodes and time-to-control in complex networks

NASA Astrophysics Data System (ADS)

Pequito, Sérgio; Preciado, Victor M.; Barabási, Albert-László; Pappas, George J.

2017-01-01

Recent advances in control theory provide us with efficient tools to determine the minimum number of driving (or driven) nodes to steer a complex network towards a desired state. Furthermore, we often need to do it within a given time window, so it is of practical importance to understand the trade-offs between the minimum number of driving/driven nodes and the minimum time required to reach a desired state. Therefore, we introduce the notion of actuation spectrum to capture such trade-offs, which we used to find that in many complex networks only a small fraction of driving (or driven) nodes is required to steer the network to a desired state within a relatively small time window. Furthermore, our empirical studies reveal that, even though synthetic network models are designed to present structural properties similar to those observed in real networks, their actuation spectra can be dramatically different. Thus, it supports the need to develop new synthetic network models able to replicate controllability properties of real-world networks.

Modeling of contact tracing in social networks

NASA Astrophysics Data System (ADS)

Tsimring, Lev S.; Huerta, Ramón

2003-07-01

Spreading of certain infections in complex networks is effectively suppressed by using intelligent strategies for epidemic control. One such standard epidemiological strategy consists in tracing contacts of infected individuals. In this paper, we use a recently introduced generalization of the standard susceptible-infectious-removed stochastic model for epidemics in sparse random networks which incorporates an additional (traced) state. We describe a deterministic mean-field description which yields quantitative agreement with stochastic simulations on random graphs. We also discuss the role of contact tracing in epidemics control in small-world and scale-free networks. Effectiveness of contact tracing grows as the rewiring probability is reduced.

Disrupted Small-World Networks in Schizophrenia

ERIC Educational Resources Information Center

Liu, Yong; Liang, Meng; Zhou, Yuan; He, Yong; Hao, Yihui; Song, Ming; Yu, Chunshui; Liu, Haihong; Liu, Zhening; Jiang, Tianzi

2008-01-01

The human brain has been described as a large, sparse, complex network characterized by efficient small-world properties, which assure that the brain generates and integrates information with high efficiency. Many previous neuroimaging studies have provided consistent evidence of "dysfunctional connectivity" among the brain regions in…

Active learning of cortical connectivity from two-photon imaging data.

PubMed

Bertrán, Martín A; Martínez, Natalia L; Wang, Ye; Dunson, David; Sapiro, Guillermo; Ringach, Dario

2018-01-01

Understanding how groups of neurons interact within a network is a fundamental question in system neuroscience. Instead of passively observing the ongoing activity of a network, we can typically perturb its activity, either by external sensory stimulation or directly via techniques such as two-photon optogenetics. A natural question is how to use such perturbations to identify the connectivity of the network efficiently. Here we introduce a method to infer sparse connectivity graphs from in-vivo, two-photon imaging of population activity in response to external stimuli. A novel aspect of the work is the introduction of a recommended distribution, incrementally learned from the data, to optimally refine the inferred network. Unlike existing system identification techniques, this "active learning" method automatically focuses its attention on key undiscovered areas of the network, instead of targeting global uncertainty indicators like parameter variance. We show how active learning leads to faster inference while, at the same time, provides confidence intervals for the network parameters. We present simulations on artificial small-world networks to validate the methods and apply the method to real data. Analysis of frequency of motifs recovered show that cortical networks are consistent with a small-world topology model.

Complex network view of evolving manifolds

NASA Astrophysics Data System (ADS)

da Silva, Diamantino C.; Bianconi, Ginestra; da Costa, Rui A.; Dorogovtsev, Sergey N.; Mendes, José F. F.

2018-03-01

We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by the condition that at each step, all the faces must be triangles. Stochastic application of these operations leads to random networks with different architectures. We perform extensive numerical simulations and explore the geometries of growing and equilibrium complex networks generated by these transformations and their local structural properties. This characterization includes the Hausdorff and spectral dimensions of the resulting networks, their degree distributions, and various structural correlations. Our results reveal a rich zoo of architectures and geometries of these networks, some of which appear to be small worlds while others are finite dimensional with Hausdorff dimension equal or higher than the original dimensionality of their simplices. The range of spectral dimensions of the evolving triangulations turns out to be from about 1.4 to infinity. Our models include simplicial complexes representing manifolds with evolving topologies, for example, an h -holed torus with a progressively growing number of holes. This evolving graph demonstrates features of a small-world network and has a particularly heavy-tailed degree distribution.

Active learning of cortical connectivity from two-photon imaging data

PubMed Central

Wang, Ye; Dunson, David; Sapiro, Guillermo; Ringach, Dario

2018-01-01

Understanding how groups of neurons interact within a network is a fundamental question in system neuroscience. Instead of passively observing the ongoing activity of a network, we can typically perturb its activity, either by external sensory stimulation or directly via techniques such as two-photon optogenetics. A natural question is how to use such perturbations to identify the connectivity of the network efficiently. Here we introduce a method to infer sparse connectivity graphs from in-vivo, two-photon imaging of population activity in response to external stimuli. A novel aspect of the work is the introduction of a recommended distribution, incrementally learned from the data, to optimally refine the inferred network. Unlike existing system identification techniques, this “active learning” method automatically focuses its attention on key undiscovered areas of the network, instead of targeting global uncertainty indicators like parameter variance. We show how active learning leads to faster inference while, at the same time, provides confidence intervals for the network parameters. We present simulations on artificial small-world networks to validate the methods and apply the method to real data. Analysis of frequency of motifs recovered show that cortical networks are consistent with a small-world topology model. PMID:29718955

Wayfinding in Social Networks

NASA Astrophysics Data System (ADS)

Liben-Nowell, David

With the recent explosion of popularity of commercial social-networking sites like Facebook and MySpace, the size of social networks that can be studied scientifically has passed from the scale traditionally studied by sociologists and anthropologists to the scale of networks more typically studied by computer scientists. In this chapter, I will highlight a recent line of computational research into the modeling and analysis of the small-world phenomenon - the observation that typical pairs of people in a social network are connected by very short chains of intermediate friends - and the ability of members of a large social network to collectively find efficient routes to reach individuals in the network. I will survey several recent mathematical models of social networks that account for these phenomena, with an emphasis on both the provable properties of these social-network models and the empirical validation of the models against real large-scale social-network data.

Disordered configurations of the Glauber model in two-dimensional networks

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

A Comparison of Geographic Information Systems, Complex Networks, and Other Models for Analyzing Transportation Network Topologies

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher

2005-01-01

This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.

Semantic networks based on titles of scientific papers

NASA Astrophysics Data System (ADS)

Pereira, H. B. B.; Fadigas, I. S.; Senna, V.; Moret, M. A.

2011-03-01

In this paper we study the topological structure of semantic networks based on titles of papers published in scientific journals. It discusses its properties and presents some reflections on how the use of social and complex network models can contribute to the diffusion of knowledge. The proposed method presented here is applied to scientific journals where the titles of papers are in English or in Portuguese. We show that the topology of studied semantic networks are small-world and scale-free.

The Large-Scale Structure of Semantic Networks: Statistical Analyses and a Model of Semantic Growth

ERIC Educational Resources Information Center

Steyvers, Mark; Tenenbaum, Joshua B.

2005-01-01

We present statistical analyses of the large-scale structure of 3 types of semantic networks: word associations, WordNet, and Roget's Thesaurus. We show that they have a small-world structure, characterized by sparse connectivity, short average path lengths between words, and strong local clustering. In addition, the distributions of the number of…

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

PubMed Central

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

2002-01-01

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

A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters

NASA Astrophysics Data System (ADS)

Ma, Fei; Su, Jing; Hao, Yongxing; Yao, Bing; Yan, Guanghui

2018-02-01

The problem of uncovering the internal operating function of network models is intriguing, demanded and attractive in researches of complex networks. Notice that, in the past two decades, a great number of artificial models are built to try to answer the above mentioned task. Based on the different growth ways, these previous models can be divided into two categories, one type, possessing the preferential attachment, follows a power-law P(k) ∼k-γ, 2 < γ < 3. The other has exponential-scaling feature, P(k) ∼α-k. However, there are no models containing above two kinds of growth ways to be presented, even the study of interconnection between these two growth manners in the same model is lacking. Hence, in this paper, we construct a class of planar and self-similar graphs motivated from a new attachment way, vertex-edge-growth network-operation, more precisely, the couple of both them. We report that this model is sparse, small world and hierarchical. And then, not only is scale-free feature in our model, but also lies the degree parameter γ(≈ 3 . 242) out the typical range. Note that, we suggest that the coexistence of multiple vertex growth ways will have a prominent effect on the power-law parameter γ, and the preferential attachment plays a dominate role on the development of networks over time. At the end of this paper, we obtain an exact analytical expression for the total number of spanning trees of models and also capture spanning trees entropy which we have compared with those of their corresponding component elements.

A recursive method for calculating the total number of spanning trees and its applications in self-similar small-world scale-free network models

NASA Astrophysics Data System (ADS)

Ma, Fei; Su, Jing; Yao, Bing

2018-05-01

The problem of determining and calculating the number of spanning trees of any finite graph (model) is a great challenge, and has been studied in various fields, such as discrete applied mathematics, theoretical computer science, physics, chemistry and the like. In this paper, firstly, thank to lots of real-life systems and artificial networks built by all kinds of functions and combinations among some simpler and smaller elements (components), we discuss some helpful network-operation, including link-operation and merge-operation, to design more realistic and complicated network models. Secondly, we present a method for computing the total number of spanning trees. As an accessible example, we apply this method to space of trees and cycles respectively, and our results suggest that it is indeed a better one for such models. In order to reflect more widely practical applications and potentially theoretical significance, we study the enumerating method in some existing scale-free network models. On the other hand, we set up a class of new models displaying scale-free feature, that is to say, following P(k) k-γ, where γ is the degree exponent. Based on detailed calculation, the degree exponent γ of our deterministic scale-free models satisfies γ > 3. In the rest of our discussions, we not only calculate analytically the solutions of average path length, which indicates our models have small-world property being prevailing in amounts of complex systems, but also derive the number of spanning trees by means of the recursive method described in this paper, which clarifies our method is convenient to research these models.

A small world of weak ties provides optimal global integration of self-similar modules in functional brain networks

PubMed Central

Gallos, Lazaros K.; Makse, Hernán A.; Sigman, Mariano

2012-01-01

The human brain is organized in functional modules. Such an organization presents a basic conundrum: Modules ought to be sufficiently independent to guarantee functional specialization and sufficiently connected to bind multiple processors for efficient information transfer. It is commonly accepted that small-world architecture of short paths and large local clustering may solve this problem. However, there is intrinsic tension between shortcuts generating small worlds and the persistence of modularity, a global property unrelated to local clustering. Here, we present a possible solution to this puzzle. We first show that a modified percolation theory can define a set of hierarchically organized modules made of strong links in functional brain networks. These modules are “large-world” self-similar structures and, therefore, are far from being small-world. However, incorporating weaker ties to the network converts it into a small world preserving an underlying backbone of well-defined modules. Remarkably, weak ties are precisely organized as predicted by theory maximizing information transfer with minimal wiring cost. This trade-off architecture is reminiscent of the “strength of weak ties” crucial concept of social networks. Such a design suggests a natural solution to the paradox of efficient information flow in the highly modular structure of the brain. PMID:22308319

Multi-language naming game

NASA Astrophysics Data System (ADS)

Zhou, Jianfeng; Lou, Yang; Chen, Guanrong; Tang, Wallace K. S.

2018-04-01

Naming game is a simulation-based experiment used to study the evolution of languages. The conventional naming game focuses on a single language. In this paper, a novel naming game model named multi-language naming game (MLNG) is proposed, where the agents are different-language speakers who cannot communicate with each other without a translator (interpreter) in between. The MLNG model is general, capable of managing k different languages with k ≥ 2. For illustration, the paper only discusses the MLNG with two different languages, and studies five representative network topologies, namely random-graph, WS small-world, NW small-world, scale-free, and random-triangle topologies. Simulation and analysis results both show that: 1) using the network features and based on the proportion of translators the probability of establishing a conversation between two or three agents can be theoretically estimated; 2) the relationship between the convergence speed and the proportion of translators has a power-law-like relation; 3) different agents require different memory sizes, thus a local memory allocation rule is recommended for saving memory resources. The new model and new findings should be useful for further studies of naming games and for better understanding of languages evolution from a dynamical network perspective.

Individual T1-weighted/T2-weighted ratio brain networks: Small-worldness, hubs and modular organization

NASA Astrophysics Data System (ADS)

Wu, Huijun; Wang, Hao; Lü, Linyuan

Applying network science to investigate the complex systems has become a hot topic. In neuroscience, understanding the architectures of complex brain networks was a vital issue. An enormous amount of evidence had supported the brain was cost/efficiency trade-off with small-worldness, hubness and modular organization through the functional MRI and structural MRI investigations. However, the T1-weighted/T2-weighted (T1w/T2w) ratio brain networks were mostly unexplored. Here, we utilized a KL divergence-based method to construct large-scale individual T1w/T2w ratio brain networks and investigated the underlying topological attributes of these networks. Our results supported that the T1w/T2w ratio brain networks were comprised of small-worldness, an exponentially truncated power-law degree distribution, frontal-parietal hubs and modular organization. Besides, there were significant positive correlations between the network metrics and fluid intelligence. Thus, the T1w/T2w ratio brain networks open a new avenue to understand the human brain and are a necessary supplement for future MRI studies.

Cortical connectivity and memory performance in cognitive decline: A study via graph theory from EEG data.

PubMed

Vecchio, F; Miraglia, F; Quaranta, D; Granata, G; Romanello, R; Marra, C; Bramanti, P; Rossini, P M

2016-03-01

Functional brain abnormalities including memory loss are found to be associated with pathological changes in connectivity and network neural structures. Alzheimer's disease (AD) interferes with memory formation from the molecular level, to synaptic functions and neural networks organization. Here, we determined whether brain connectivity of resting-state networks correlate with memory in patients affected by AD and in subjects with mild cognitive impairment (MCI). One hundred and forty-four subjects were recruited: 70 AD (MMSE Mini Mental State Evaluation 21.4), 50 MCI (MMSE 25.2) and 24 healthy subjects (MMSE 29.8). Undirected and weighted cortical brain network was built to evaluate graph core measures to obtain Small World parameters. eLORETA lagged linear connectivity as extracted by electroencephalogram (EEG) signals was used to weight the network. A high statistical correlation between Small World and memory performance was found. Namely, higher Small World characteristic in EEG gamma frequency band during the resting state, better performance in short-term memory as evaluated by the digit span tests. Such Small World pattern might represent a biomarker of working memory impairment in older people both in physiological and pathological conditions. Copyright © 2015 IBRO. Published by Elsevier Ltd. All rights reserved.

Modeling and dynamical topology properties of VANET based on complex networks theory

NASA Astrophysics Data System (ADS)

Zhang, Hong; Li, Jie

2015-01-01

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What's more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.

Modeling and dynamical topology properties of VANET based on complex networks theory

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

Zhang, Hong; Li, Jie, E-mail: prof.li@foxmail.com

2015-01-15

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate andmore » control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.« less

[Analysis of the Characteristics of Infantile Small World Neural Network Node Properties Correlated with the Influencing Factors].

PubMed

Qu, Haibo; Lu, Su; Zhang, Wenjing; Xiao, Yuan; Ning, Gang; Sun, Huaiqiang

2016-10-01

We applied resting-state functional magnetic resonance imaging(rfMRI)combined with graph theory to analyze 90 regions of the infantile small world neural network of the whole brain.We tried to get the following two points clear:1 whether the parameters of the node property of the infantile small world neural network are correlated with the level of infantile intelligence development;2 whether the parameters of the infantile small world neural network are correlated with the children’s baseline parameters,i.e.,the demographic parameters such as gender,age,parents’ education level,etc.Twelve cases of healthy infants were included in the investigation(9males and 3females with the average age of 33.42±8.42 months.)We then evaluated the level of infantile intelligence of all the cases and graded by Gesell Development Scale Test.We used a Siemens 3.0T Trio imaging system to perform resting-state(rs)EPI scans,and collected the BOLD functional Magnetic Resonance Imaging(fMRI)data.We performed the data processing with Statistical Parametric Mapping 5(SPM5)based on Matlab environment.Furthermore,we got the attributes of the whole brain small world and node attributes of 90 encephalic regions of templates of Anatomatic Automatic Labeling(ALL).At last,we carried out correlation study between the above-mentioned attitudes,intelligence scale parameters and demographic data.The results showed that many node attributes of small world neural network were closely correlated with intelligence scale parameters.Betweeness was mainly centered in thalamus,superior frontal gyrus,and occipital lobe(negative correlation).The r value of superior occipital gyrus associated with the individual and social intelligent scale was-0.729(P=0.007);degree was mainly centered in amygdaloid nucleus,superior frontal gyrus,and inferior parietal gyrus(positive correlation).The r value of inferior parietal gyrus associated with the gross motor intelligent scale was 0.725(P=0.008);efficiency was mainly centered in inferior frontal gyrus,inferior parietal gyrus,and insular lobe(positive correlation).The r value of inferior parietal gyrus associated with the language intelligent scale was 0.738(P=0.006);Anoda cluster coefficient(anodalCp)was centered in frontal lobe,inferior parietal gyrus,and paracentral lobule(positive correlation);Node shortest path length(nlp)was centered in frontal lobe,inferior parietal gyrus,and insular lobe.The distribution of the encephalic regions in the left and right brain was different.However,no statistical significance was found between the correlation of monolithic attributes of small world and intelligence scale.The encephalic regions,in which node attributes of small world were related to other demographic indices,were mainly centered in temporal lobe,cuneus,cingulated gyrus,angular gyrus,and paracentral lobule areas.Most of them belong to the default mode network(DMN).The node attributes of small world neural network are widely related to infantile intelligence level,moreover the distribution is characteristic in different encephalic regions.The distribution of dominant encephalic is in accordance the related functions.The existing correlations reflect the ever changing small world nervous network during infantile development.

Patterns in the English language: phonological networks, percolation and assembly models

NASA Astrophysics Data System (ADS)

Stella, Massimo; Brede, Markus

2015-05-01

In this paper we provide a quantitative framework for the study of phonological networks (PNs) for the English language by carrying out principled comparisons to null models, either based on site percolation, randomization techniques, or network growth models. In contrast to previous work, we mainly focus on null models that reproduce lower order characteristics of the empirical data. We find that artificial networks matching connectivity properties of the English PN are exceedingly rare: this leads to the hypothesis that the word repertoire might have been assembled over time by preferentially introducing new words which are small modifications of old words. Our null models are able to explain the ‘power-law-like’ part of the degree distributions and generally retrieve qualitative features of the PN such as high clustering, high assortativity coefficient and small-world characteristics. However, the detailed comparison to expectations from null models also points out significant differences, suggesting the presence of additional constraints in word assembly. Key constraints we identify are the avoidance of large degrees, the avoidance of triadic closure and the avoidance of large non-percolating clusters.

Thin Watts-Strogatz networks.

PubMed

de Moura, Alessandro P S

2006-01-01

A modified version of the Watts-Strogatz (WS) network model is proposed, in which the number of shortcuts scales with the network size N as Nalpha, with alpha < 1. In these networks, the ratio of the number of shortcuts to the network size approaches zero as N --> infinity, whereas in the original WS model, this ratio is constant. We call such networks "thin Watts-Strogatz networks." We show that even though the fraction of shortcuts becomes vanishingly small for large networks, they still cause a kind of small-world effect, in the sense that the length L of the network increases sublinearly with the size. We develop a mean-field theory for these networks, which predicts that the length scales as N1-alpha ln N for large N. We also study how a search using only local information works in thin WS networks. We find that the search performance is enhanced compared to the regular network, and we predict that the search time tau scales as N1-alpha/2. These theoretical results are tested using numerical simulations. We comment on the possible relevance of thin WS networks for the design of high-performance low-cost communication networks.

Phase Transition for the Maki-Thompson Rumour Model on a Small-World Network

NASA Astrophysics Data System (ADS)

Agliari, Elena; Pachon, Angelica; Rodriguez, Pablo M.; Tavani, Flavia

2017-11-01

We consider the Maki-Thompson model for the stochastic propagation of a rumour within a population. In this model the population is made up of "spreaders", "ignorants" and "stiflers"; any spreader attempts to pass the rumour to the other individuals via pair-wise interactions and in case the other individual is an ignorant, it becomes a spreader, while in the other two cases the initiating spreader turns into a stifler. In a finite population the process will eventually reach an equilibrium situation where individuals are either stiflers or ignorants. We extend the original hypothesis of homogenously mixed population by allowing for a small-world network embedding the model, in such a way that interactions occur only between nearest-neighbours. This structure is realized starting from a k-regular ring and by inserting, in the average, c additional links in such a way that k and c are tuneable parameters for the population architecture. We prove that this system exhibits a transition between regimes of localization (where the final number of stiflers is at most logarithmic in the population size) and propagation (where the final number of stiflers grows algebraically with the population size) at a finite value of the network parameter c. A quantitative estimate for the critical value of c is obtained via extensive numerical simulations.

Propagation, cascades, and agreement dynamics in complex communication and social networks

NASA Astrophysics Data System (ADS)

Lu, Qiming

Many modern and important technological, social, information and infrastructure systems can be viewed as complex systems with a large number of interacting components. Models of complex networks and dynamical interactions, as well as their applications are of fundamental interests in many aspects. Here, several stylized models of multiplex propagation and opinion dynamics are investigated on complex and empirical social networks. We first investigate cascade dynamics in threshold-controlled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, robust, and reliable prototypical activation protocol in sensor networks in responding to various alarm scenarios. We also consider the same dynamics on a modified network by adding a few long-range communication links, resulting in a small-world network. We find that such construction can further enhance and optimize the speed of the network's response, while keeping energy consumption at a manageable level. We also investigate a prototypical agent-based model, the Naming Game, on two-dimensional random geometric networks. The Naming Game [A. Baronchelli et al., J. Stat. Mech.: Theory Exp. (2006) P06014.] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case. When applying the model of Naming Game on empirical social networks, this stylized agent-based model captures essential features of agreement dynamics in a network of autonomous agents, corresponding to the development of shared classification schemes in a network of artificial agents or opinion spreading and social dynamics in social networks. Our study focuses on the impact that communities in the underlying social graphs have on the outcome of the agreement process. We find that networks with strong community structure hinder the system from reaching global agreement; the evolution of the Naming Game in these networks maintains clusters of coexisting opinions indefinitely. Further, we investigate agent-based network strategies to facilitate convergence to global consensus.

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

NASA Astrophysics Data System (ADS)

Zhang, Liang; Lu, Na

2017-12-01

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

A dynamic network model for interbank market

NASA Astrophysics Data System (ADS)

Xu, Tao; He, Jianmin; Li, Shouwei

2016-12-01

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

Brain Network Analysis from High-Resolution EEG Signals

NASA Astrophysics Data System (ADS)

de Vico Fallani, Fabrizio; Babiloni, Fabio

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

Small-worldness characteristics and its gender relation in specific hemispheric networks.

PubMed

Miraglia, F; Vecchio, F; Bramanti, P; Rossini, P M

2015-12-03

Aim of this study was to verify whether the topological organization of human brain functional networks is different for males and females in resting state EEGs. Undirected and weighted brain networks were computed by eLORETA lagged linear connectivity in 130 subjects (59 males and 71 females) within each hemisphere and in four resting state networks (Attentional Network (AN), Frontal Network (FN), Sensorimotor Network (SN), Default Mode Network (DMN)). We found that small-world (SW) architecture in the left hemisphere Frontal network presented differences in both delta and alpha band, in particular lower values in delta and higher in alpha 2 in males respect to females while in the right hemisphere differences were found in lower values of SW in males respect to females in gamma Attentional, delta Sensorimotor and delta and gamma DMNs. Gender small-worldness differences in some of resting state networks indicated that there are specific brain differences in the EEG rhythms when the brain is in the resting-state condition. These specific regions could be considered related to the functions of behavior and cognition and should be taken into account both for research on healthy and brain diseased subjects. Copyright © 2015 IBRO. Published by Elsevier Ltd. All rights reserved.

SmallTool - a toolkit for realizing shared virtual environments on the Internet

NASA Astrophysics Data System (ADS)

Broll, Wolfgang

1998-09-01

With increasing graphics capabilities of computers and higher network communication speed, networked virtual environments have become available to a large number of people. While the virtual reality modelling language (VRML) provides users with the ability to exchange 3D data, there is still a lack of appropriate support to realize large-scale multi-user applications on the Internet. In this paper we will present SmallTool, a toolkit to support shared virtual environments on the Internet. The toolkit consists of a VRML-based parsing and rendering library, a device library, and a network library. This paper will focus on the networking architecture, provided by the network library - the distributed worlds transfer and communication protocol (DWTP). DWTP provides an application-independent network architecture to support large-scale multi-user environments on the Internet.

Why do vulnerability cycles matter in financial networks?

NASA Astrophysics Data System (ADS)

Silva, Thiago Christiano; Tabak, Benjamin Miranda; Guerra, Solange Maria

2017-04-01

We compare two widely employed models that estimate systemic risk: DebtRank and Differential DebtRank. We show that not only network cyclicality but also the average vulnerability of banks are essential concepts that contribute to widening the gap in the systemic risk estimates of both approaches. We find that systemic risk estimates are the same whenever the network has no cycles. However, in case the network presents cyclicality, then we need to inspect the average vulnerability of banks to estimate the underestimation gap. We find that the gap is small regardless of the cyclicality of the network when its average vulnerability is large. In contrast, the observed gap follows a quadratic behavior when the average vulnerability is small or intermediate. We show results using an econometric exercise and draw guidelines both on artificial and real-world financial networks.

Coevolution of dynamical states and interactions in dynamic networks

NASA Astrophysics Data System (ADS)

Zimmermann, Martín G.; Eguíluz, Víctor M.; San Miguel, Maxi

2004-06-01

We explore the coupled dynamics of the internal states of a set of interacting elements and the network of interactions among them. Interactions are modeled by a spatial game and the network of interaction links evolves adapting to the outcome of the game. As an example, we consider a model of cooperation in which the adaptation is shown to facilitate the formation of a hierarchical interaction network that sustains a highly cooperative stationary state. The resulting network has the characteristics of a small world network when a mechanism of local neighbor selection is introduced in the adaptive network dynamics. The highly connected nodes in the hierarchical structure of the network play a leading role in the stability of the network. Perturbations acting on the state of these special nodes trigger global avalanches leading to complete network reorganization.

Geometric properties-dependent neural synchrony modulated by extracellular subthreshold electric field

NASA Astrophysics Data System (ADS)

Wei, Xile; Si, Kaili; Yi, Guosheng; Wang, Jiang; Lu, Meili

2016-07-01

In this paper, we use a reduced two-compartment neuron model to investigate the interaction between extracellular subthreshold electric field and synchrony in small world networks. It is observed that network synchronization is closely related to the strength of electric field and geometric properties of the two-compartment model. Specifically, increasing the electric field induces a gradual improvement in network synchrony, while increasing the geometric factor results in an abrupt decrease in synchronization of network. In addition, increasing electric field can make the network become synchronous from asynchronous when the geometric parameter is set to a given value. Furthermore, it is demonstrated that network synchrony can also be affected by the firing frequency and dynamical bifurcation feature of single neuron. These results highlight the effect of weak field on network synchrony from the view of biophysical model, which may contribute to further understanding the effect of electric field on network activity.

Traumatic brain injury impairs small-world topology

PubMed Central

Pandit, Anand S.; Expert, Paul; Lambiotte, Renaud; Bonnelle, Valerie; Leech, Robert; Turkheimer, Federico E.

2013-01-01

Objective: We test the hypothesis that brain networks associated with cognitive function shift away from a “small-world” organization following traumatic brain injury (TBI). Methods: We investigated 20 TBI patients and 21 age-matched controls. Resting-state functional MRI was used to study functional connectivity. Graph theoretical analysis was then applied to partial correlation matrices derived from these data. The presence of white matter damage was quantified using diffusion tensor imaging. Results: Patients showed characteristic cognitive impairments as well as evidence of damage to white matter tracts. Compared to controls, the graph analysis showed reduced overall connectivity, longer average path lengths, and reduced network efficiency. A particular impact of TBI is seen on a major network hub, the posterior cingulate cortex. Taken together, these results confirm that a network critical to cognitive function shows a shift away from small-world characteristics. Conclusions: We provide evidence that key brain networks involved in supporting cognitive function become less small-world in their organization after TBI. This is likely to be the result of diffuse white matter damage, and may be an important factor in producing cognitive impairment after TBI. PMID:23596068

Coevolving complex networks in the model of social interactions

NASA Astrophysics Data System (ADS)

Raducha, Tomasz; Gubiec, Tomasz

2017-04-01

We analyze Axelrod's model of social interactions on coevolving complex networks. We introduce four extensions with different mechanisms of edge rewiring. The models are intended to catch two kinds of interactions-preferential attachment, which can be observed in scientists or actors collaborations, and local rewiring, which can be observed in friendship formation in everyday relations. Numerical simulations show that proposed dynamics can lead to the power-law distribution of nodes' degree and high value of the clustering coefficient, while still retaining the small-world effect in three models. All models are characterized by two phase transitions of a different nature. In case of local rewiring we obtain order-disorder discontinuous phase transition even in the thermodynamic limit, while in case of long-distance switching discontinuity disappears in the thermodynamic limit, leaving one continuous phase transition. In addition, we discover a new and universal characteristic of the second transition point-an abrupt increase of the clustering coefficient, due to formation of many small complete subgraphs inside the network.

From Networks to Time Series

NASA Astrophysics Data System (ADS)

Shimada, Yutaka; Ikeguchi, Tohru; Shigehara, Takaomi

2012-10-01

In this Letter, we propose a framework to transform a complex network to a time series. The transformation from complex networks to time series is realized by the classical multidimensional scaling. Applying the transformation method to a model proposed by Watts and Strogatz [Nature (London) 393, 440 (1998)], we show that ring lattices are transformed to periodic time series, small-world networks to noisy periodic time series, and random networks to random time series. We also show that these relationships are analytically held by using the circulant-matrix theory and the perturbation theory of linear operators. The results are generalized to several high-dimensional lattices.

Independence polynomial and matching polynomial of the Koch network

NASA Astrophysics Data System (ADS)

Liao, Yunhua; Xie, Xiaoliang

2015-11-01

The lattice gas model and the monomer-dimer model are two classical models in statistical mechanics. It is well known that the partition functions of these two models are associated with the independence polynomial and the matching polynomial in graph theory, respectively. Both polynomials have been shown to belong to the “#P-complete” class, which indicate the problems are computationally “intractable”. We consider these two polynomials of the Koch networks which are scale-free with small-world effects. Explicit recurrences are derived, and explicit formulae are presented for the number of independent sets of a certain type.

Small-World Brain Networks Revisited

PubMed Central

Bassett, Danielle S.; Bullmore, Edward T.

2016-01-01

It is nearly 20 years since the concept of a small-world network was first quantitatively defined, by a combination of high clustering and short path length; and about 10 years since this metric of complex network topology began to be widely applied to analysis of neuroimaging and other neuroscience data as part of the rapid growth of the new field of connectomics. Here, we review briefly the foundational concepts of graph theoretical estimation and generation of small-world networks. We take stock of some of the key developments in the field in the past decade and we consider in some detail the implications of recent studies using high-resolution tract-tracing methods to map the anatomical networks of the macaque and the mouse. In doing so, we draw attention to the important methodological distinction between topological analysis of binary or unweighted graphs, which have provided a popular but simple approach to brain network analysis in the past, and the topology of weighted graphs, which retain more biologically relevant information and are more appropriate to the increasingly sophisticated data on brain connectivity emerging from contemporary tract-tracing and other imaging studies. We conclude by highlighting some possible future trends in the further development of weighted small-worldness as part of a deeper and broader understanding of the topology and the functional value of the strong and weak links between areas of mammalian cortex. PMID:27655008

Spreading gossip in social networks.

PubMed

Lind, Pedro G; da Silva, Luciano R; Andrade, José S; Herrmann, Hans J

2007-09-01

We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal reachability of the neighbors of a given node that interchange information among each other, and the spreading time needed for the information to reach such a fraction of nodes. When the information refers to a particular node at which both quantities are measured, the model can be taken as a model for gossip propagation. In this context, we apply the model to real empirical networks of social acquaintances and compare the underlying spreading dynamics with different types of scale-free and small-world networks. We find that the number of friendship connections strongly influences the probability of being gossiped. Finally, we discuss how the spread factor is able to be applied to other situations.

Spreading gossip in social networks

NASA Astrophysics Data System (ADS)

Lind, Pedro G.; da Silva, Luciano R.; Andrade, José S., Jr.; Herrmann, Hans J.

2007-09-01

We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal reachability of the neighbors of a given node that interchange information among each other, and the spreading time needed for the information to reach such a fraction of nodes. When the information refers to a particular node at which both quantities are measured, the model can be taken as a model for gossip propagation. In this context, we apply the model to real empirical networks of social acquaintances and compare the underlying spreading dynamics with different types of scale-free and small-world networks. We find that the number of friendship connections strongly influences the probability of being gossiped. Finally, we discuss how the spread factor is able to be applied to other situations.

Characteristics of Venture Capital Network and Its Correlation with Regional Economy: Evidence from China.

PubMed

Jin, Yonghong; Zhang, Qi; Shan, Lifei; Li, Sai-Ping

2015-01-01

Financial networks have been extensively studied as examples of real world complex networks. In this paper, we establish and study the network of venture capital (VC) firms in China. We compute and analyze the statistical properties of the network, including parameters such as degrees, mean lengths of the shortest paths, clustering coefficient and robustness. We further study the topology of the network and find that it has small-world behavior. A multiple linear regression model is introduced to study the relation between network parameters and major regional economic indices in China. From the result of regression, we find that, economic aggregate (including the total GDP, investment, consumption and net export), upgrade of industrial structure, employment and remuneration of a region are all positively correlated with the degree and the clustering coefficient of the VC sub-network of the region, which suggests that the development of the VC industry has substantial effects on regional economy in China.

Characteristics of Venture Capital Network and Its Correlation with Regional Economy: Evidence from China

PubMed Central

Jin, Yonghong; Zhang, Qi; Shan, Lifei; Li, Sai-Ping

2015-01-01

Financial networks have been extensively studied as examples of real world complex networks. In this paper, we establish and study the network of venture capital (VC) firms in China. We compute and analyze the statistical properties of the network, including parameters such as degrees, mean lengths of the shortest paths, clustering coefficient and robustness. We further study the topology of the network and find that it has small-world behavior. A multiple linear regression model is introduced to study the relation between network parameters and major regional economic indices in China. From the result of regression, we find that, economic aggregate (including the total GDP, investment, consumption and net export), upgrade of industrial structure, employment and remuneration of a region are all positively correlated with the degree and the clustering coefficient of the VC sub-network of the region, which suggests that the development of the VC industry has substantial effects on regional economy in China. PMID:26340555

Autoassociative memory retrieval and spontaneous activity bumps in small-world networks of integrate-and-fire neurons.

PubMed

Anishchenko, Anastasia; Treves, Alessandro

2006-10-01

The metric structure of synaptic connections is obviously an important factor in shaping the properties of neural networks, in particular the capacity to retrieve memories, with which are endowed autoassociative nets operating via attractor dynamics. Qualitatively, some real networks in the brain could be characterized as 'small worlds', in the sense that the structure of their connections is intermediate between the extremes of an orderly geometric arrangement and of a geometry-independent random mesh. Small worlds can be defined more precisely in terms of their mean path length and clustering coefficient; but is such a precise description useful for a better understanding of how the type of connectivity affects memory retrieval? We have simulated an autoassociative memory network of integrate-and-fire units, positioned on a ring, with the network connectivity varied parametrically between ordered and random. We find that the network retrieves previously stored memory patterns when the connectivity is close to random, and displays the characteristic behavior of ordered nets (localized 'bumps' of activity) when the connectivity is close to ordered. Recent analytical work shows that these two behaviors can coexist in a network of simple threshold-linear units, leading to localized retrieval states. We find that they tend to be mutually exclusive behaviors, however, with our integrate-and-fire units. Moreover, the transition between the two occurs for values of the connectivity parameter which are not simply related to the notion of small worlds.

A mixing evolution model for bidirectional microblog user networks

NASA Astrophysics Data System (ADS)

Yuan, Wei-Guo; Liu, Yun

2015-08-01

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

Evolving Scale-Free Networks by Poisson Process: Modeling and Degree Distribution.

PubMed

Feng, Minyu; Qu, Hong; Yi, Zhang; Xie, Xiurui; Kurths, Jurgen

2016-05-01

Since the great mathematician Leonhard Euler initiated the study of graph theory, the network has been one of the most significant research subject in multidisciplinary. In recent years, the proposition of the small-world and scale-free properties of complex networks in statistical physics made the network science intriguing again for many researchers. One of the challenges of the network science is to propose rational models for complex networks. In this paper, in order to reveal the influence of the vertex generating mechanism of complex networks, we propose three novel models based on the homogeneous Poisson, nonhomogeneous Poisson and birth death process, respectively, which can be regarded as typical scale-free networks and utilized to simulate practical networks. The degree distribution and exponent are analyzed and explained in mathematics by different approaches. In the simulation, we display the modeling process, the degree distribution of empirical data by statistical methods, and reliability of proposed networks, results show our models follow the features of typical complex networks. Finally, some future challenges for complex systems are discussed.

The Development of a Small-World Network of Higher Education Students, Using a Large-Group Problem-Solving Method

ERIC Educational Resources Information Center

Sousa, Fernando Cardoso; Monteiro, Ileana Pardal; Pellissier, René

2014-01-01

This article presents the development of a small-world network using an adapted version of the large-group problem-solving method "Future Search." Two management classes in a higher education setting were selected and required to plan a project. The students completed a survey focused on the frequency of communications before and after…

A network of networks model to study phase synchronization using structural connection matrix of human brain

NASA Astrophysics Data System (ADS)

Ferrari, F. A. S.; Viana, R. L.; Reis, A. S.; Iarosz, K. C.; Caldas, I. L.; Batista, A. M.

2018-04-01

The cerebral cortex plays a key role in complex cortical functions. It can be divided into areas according to their function (motor, sensory and association areas). In this paper, the cerebral cortex is described as a network of networks (cortex network), we consider that each cortical area is composed of a network with small-world property (cortical network). The neurons are assumed to have bursting properties with the dynamics described by the Rulkov model. We study the phase synchronization of the cortex network and the cortical networks. In our simulations, we verify that synchronization in cortex network is not homogeneous. Besides, we focus on the suppression of neural phase synchronization. Synchronization can be related to undesired and pathological abnormal rhythms in the brain. For this reason, we consider the delayed feedback control to suppress the synchronization. We show that delayed feedback control is efficient to suppress synchronous behavior in our network model when an appropriate signal intensity and time delay are defined.

Making big communities small: using network science to understand the ecological and behavioral requirements for community social capital.

PubMed

Neal, Zachary

2015-06-01

The concept of social capital is becoming increasingly common in community psychology and elsewhere. However, the multiple conceptual and operational definitions of social capital challenge its utility as a theoretical tool. The goals of this paper are to clarify two forms of social capital (bridging and bonding), explicitly link them to the structural characteristics of small world networks, and explore the behavioral and ecological prerequisites of its formation. First, I use the tools of network science and specifically the concept of small-world networks to clarify what patterns of social relationships are likely to facilitate social capital formation. Second, I use an agent-based model to explore how different ecological characteristics (diversity and segregation) and behavioral tendencies (homophily and proximity) impact communities' potential for developing social capital. The results suggest diverse communities have the greatest potential to develop community social capital, and that segregation moderates the effects that the behavioral tendencies of homophily and proximity have on community social capital. The discussion highlights how these findings provide community-based researchers with both a deeper understanding of the contextual constraints with which they must contend, and a useful tool for targeting their efforts in communities with the greatest need or greatest potential.

Structurally Dynamic Spin Market Networks

NASA Astrophysics Data System (ADS)

Horváth, Denis; Kuscsik, Zoltán

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

The effects of working memory training on functional brain network efficiency.

PubMed

Langer, Nicolas; von Bastian, Claudia C; Wirz, Helen; Oberauer, Klaus; Jäncke, Lutz

2013-10-01

The human brain is a highly interconnected network. Recent studies have shown that the functional and anatomical features of this network are organized in an efficient small-world manner that confers high efficiency of information processing at relatively low connection cost. However, it has been unclear how the architecture of functional brain networks is related to performance in working memory (WM) tasks and if these networks can be modified by WM training. Therefore, we conducted a double-blind training study enrolling 66 young adults. Half of the subjects practiced three WM tasks and were compared to an active control group practicing three tasks with low WM demand. High-density resting-state electroencephalography (EEG) was recorded before and after training to analyze graph-theoretical functional network characteristics at an intracortical level. WM performance was uniquely correlated with power in the theta frequency, and theta power was increased by WM training. Moreover, the better a person's WM performance, the more their network exhibited small-world topology. WM training shifted network characteristics in the direction of high performers, showing increased small-worldness within a distributed fronto-parietal network. Taken together, this is the first longitudinal study that provides evidence for the plasticity of the functional brain network underlying WM. Copyright © 2013 Elsevier Ltd. All rights reserved.

Statistical Analysis of Bus Networks in India

PubMed Central

2016-01-01

In this paper, we model the bus networks of six major Indian cities as graphs in L-space, and evaluate their various statistical properties. While airline and railway networks have been extensively studied, a comprehensive study on the structure and growth of bus networks is lacking. In India, where bus transport plays an important role in day-to-day commutation, it is of significant interest to analyze its topological structure and answer basic questions on its evolution, growth, robustness and resiliency. Although the common feature of small-world property is observed, our analysis reveals a wide spectrum of network topologies arising due to significant variation in the degree-distribution patterns in the networks. We also observe that these networks although, robust and resilient to random attacks are particularly degree-sensitive. Unlike real-world networks, such as Internet, WWW and airline, that are virtual, bus networks are physically constrained. Our findings therefore, throw light on the evolution of such geographically and constrained networks that will help us in designing more efficient bus networks in the future. PMID:27992590

Efficient Probabilistic Diagnostics for Electrical Power Systems

NASA Technical Reports Server (NTRS)

Mengshoel, Ole J.; Chavira, Mark; Cascio, Keith; Poll, Scott; Darwiche, Adnan; Uckun, Serdar

2008-01-01

We consider in this work the probabilistic approach to model-based diagnosis when applied to electrical power systems (EPSs). Our probabilistic approach is formally well-founded, as it based on Bayesian networks and arithmetic circuits. We investigate the diagnostic task known as fault isolation, and pay special attention to meeting two of the main challenges . model development and real-time reasoning . often associated with real-world application of model-based diagnosis technologies. To address the challenge of model development, we develop a systematic approach to representing electrical power systems as Bayesian networks, supported by an easy-to-use speci.cation language. To address the real-time reasoning challenge, we compile Bayesian networks into arithmetic circuits. Arithmetic circuit evaluation supports real-time diagnosis by being predictable and fast. In essence, we introduce a high-level EPS speci.cation language from which Bayesian networks that can diagnose multiple simultaneous failures are auto-generated, and we illustrate the feasibility of using arithmetic circuits, compiled from Bayesian networks, for real-time diagnosis on real-world EPSs of interest to NASA. The experimental system is a real-world EPS, namely the Advanced Diagnostic and Prognostic Testbed (ADAPT) located at the NASA Ames Research Center. In experiments with the ADAPT Bayesian network, which currently contains 503 discrete nodes and 579 edges, we .nd high diagnostic accuracy in scenarios where one to three faults, both in components and sensors, were inserted. The time taken to compute the most probable explanation using arithmetic circuits has a small mean of 0.2625 milliseconds and standard deviation of 0.2028 milliseconds. In experiments with data from ADAPT we also show that arithmetic circuit evaluation substantially outperforms joint tree propagation and variable elimination, two alternative algorithms for diagnosis using Bayesian network inference.

Abnormal small-world brain functional networks in obsessive-compulsive disorder patients with poor insight.

PubMed

Lei, Hui; Cui, Yan; Fan, Jie; Zhang, Xiaocui; Zhong, Mingtian; Yi, Jinyao; Cai, Lin; Yao, Dezhong; Zhu, Xiongzhao

2017-09-01

There are limited data on neurobiological correlates of poor insight in obsessive-compulsive disorder (OCD). This study explored whether specific changes occur in small-world network (SWN) properties in the brain functional network of OCD patients with poor insight. Resting-state electroencephalograms (EEGs) were recorded for 12 medication-free OCD patients with poor insight, 50 medication-free OCD patients with good insight, and 36 healthy controls. Both of the OCD groups exhibited topological alterations in the brain functional network characterized by abnormal small-world parameters at the beta band. However, the alterations at the theta band only existed in the OCD patients with poor insight. A relatively small sample size. Subjects were naïve to medications and those with Axis I comorbidity were excluded, perhaps limiting generalizability. Disrupted functional integrity at the beta bands of the brain functional network may be related to OCD, while disrupted functional integrity at the theta band may be associated with poor insight in OCD patients, thus this study might provide novel insight into our understanding of the pathophysiology of OCD. Copyright © 2017 Elsevier B.V. All rights reserved.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Spiral Wave in Small-World Networks of Hodgkin-Huxley Neurons

NASA Astrophysics Data System (ADS)

Ma, Jun; Yang, Li-Jian; Wu, Ying; Zhang, Cai-Rong

2010-09-01

The effect of small-world connection and noise on the formation and transition of spiral wave in the networks of Hodgkin-Huxley neurons are investigated in detail. Some interesting results are found in our numerical studies. i) The quiescent neurons are activated to propagate electric signal to others by generating and developing spiral wave from spiral seed in small area. ii) A statistical factor is defined to describe the collective properties and phase transition induced by the topology of networks and noise. iii) Stable rotating spiral wave can be generated and keeps robust when the rewiring probability is below certain threshold, otherwise, spiral wave can not be developed from the spiral seed and spiral wave breakup occurs for a stable rotating spiral wave. iv) Gaussian white noise is introduced on the membrane of neurons to study the noise-induced phase transition on spiral wave in small-world networks of neurons. It is confirmed that Gaussian white noise plays active role in supporting and developing spiral wave in the networks of neurons, and appearance of smaller factor of synchronization indicates high possibility to induce spiral wave.

Correlations between prefrontal neurons form a small-world network that optimizes the generation of multineuron sequences of activity

PubMed Central

Luongo, Francisco J.; Zimmerman, Chris A.; Horn, Meryl E.

2016-01-01

Sequential patterns of prefrontal activity are believed to mediate important behaviors, e.g., working memory, but it remains unclear exactly how they are generated. In accordance with previous studies of cortical circuits, we found that prefrontal microcircuits in young adult mice spontaneously generate many more stereotyped sequences of activity than expected by chance. However, the key question of whether these sequences depend on a specific functional organization within the cortical microcircuit, or emerge simply as a by-product of random interactions between neurons, remains unanswered. We observed that correlations between prefrontal neurons do follow a specific functional organization—they have a small-world topology. However, until now it has not been possible to directly link small-world topologies to specific circuit functions, e.g., sequence generation. Therefore, we developed a novel analysis to address this issue. Specifically, we constructed surrogate data sets that have identical levels of network activity at every point in time but nevertheless represent various network topologies. We call this method shuffling activity to rearrange correlations (SHARC). We found that only surrogate data sets based on the actual small-world functional organization of prefrontal microcircuits were able to reproduce the levels of sequences observed in actual data. As expected, small-world data sets contained many more sequences than surrogate data sets with randomly arranged correlations. Surprisingly, small-world data sets also outperformed data sets in which correlations were maximally clustered. Thus the small-world functional organization of cortical microcircuits, which effectively balances the random and maximally clustered regimes, is optimal for producing stereotyped sequential patterns of activity. PMID:26888108

Driving and driven architectures of directed small-world human brain functional networks.

PubMed

Yan, Chaogan; He, Yong

2011-01-01

Recently, increasing attention has been focused on the investigation of the human brain connectome that describes the patterns of structural and functional connectivity networks of the human brain. Many studies of the human connectome have demonstrated that the brain network follows a small-world topology with an intrinsically cohesive modular structure and includes several network hubs in the medial parietal regions. However, most of these studies have only focused on undirected connections between regions in which the directions of information flow are not taken into account. How the brain regions causally influence each other and how the directed network of human brain is topologically organized remain largely unknown. Here, we applied linear multivariate Granger causality analysis (GCA) and graph theoretical approaches to a resting-state functional MRI dataset with a large cohort of young healthy participants (n = 86) to explore connectivity patterns of the population-based whole-brain functional directed network. This directed brain network exhibited prominent small-world properties, which obviously improved previous results of functional MRI studies showing weak small-world properties in the directed brain networks in terms of a kernel-based GCA and individual analysis. This brain network also showed significant modular structures associated with 5 well known subsystems: fronto-parietal, visual, paralimbic/limbic, subcortical and primary systems. Importantly, we identified several driving hubs predominantly located in the components of the attentional network (e.g., the inferior frontal gyrus, supplementary motor area, insula and fusiform gyrus) and several driven hubs predominantly located in the components of the default mode network (e.g., the precuneus, posterior cingulate gyrus, medial prefrontal cortex and inferior parietal lobule). Further split-half analyses indicated that our results were highly reproducible between two independent subgroups. The current study demonstrated the directions of spontaneous information flow and causal influences in the directed brain networks, thus providing new insights into our understanding of human brain functional connectome.

The most common friend first immunization

NASA Astrophysics Data System (ADS)

Nian, Fu-Zhong; Hu, Cha-Sheng

2016-12-01

In this paper, a standard susceptible-infected-recovered-susceptible(SIRS) epidemic model based on the Watts-Strogatz (WS) small-world network model and the Barabsi-Albert (BA) scale-free network model is established, and a new immunization scheme — “the most common friend first immunization” is proposed, in which the most common friend’s node is described as being the first immune on the second layer protection of complex networks. The propagation situations of three different immunization schemes — random immunization, high-risk immunization, and the most common friend first immunization are studied. At the same time, the dynamic behaviors are also studied on the WS small-world and the BA scale-free network. Moreover, the analytic and simulated results indicate that the immune effect of the most common friend first immunization is better than random immunization, but slightly worse than high-risk immunization. However, high-risk immunization still has some limitations. For example, it is difficult to accurately define who a direct neighbor in the life is. Compared with the traditional immunization strategies having some shortcomings, the most common friend first immunization is effective, and it is nicely consistent with the actual situation. Project supported by the National Natural Science Foundation of China (Grant No. 61263019), the Program for International Science and Technology Cooperation Projects of Gansu Province, China (Grant No. 144WCGA166), and the Program for Longyuan Young Innovation Talents and the Doctoral Foundation of Lanzhou University of Technology, China.

Emergence of fractal scaling in complex networks

NASA Astrophysics Data System (ADS)

Wei, Zong-Wen; Wang, Bing-Hong

2016-09-01

Some real-world networks are shown to be fractal or self-similar. It is widespread that such a phenomenon originates from the repulsion between hubs or disassortativity. Here we show that this common belief fails to capture the causality. Our key insight to address it is to pinpoint links critical to fractality. Those links with small edge betweenness centrality (BC) constitute a special architecture called fractal reference system, which gives birth to the fractal structure of those reported networks. In contrast, a small amount of links with high BC enable small-world effects, hiding the intrinsic fractality. With enough of such links removed, fractal scaling spontaneously arises from nonfractal networks. Our results provide a multiple-scale view on the structure and dynamics and place fractality as a generic organizing principle of complex networks on a firmer ground.

Impact of Partial Time Delay on Temporal Dynamics of Watts-Strogatz Small-World Neuronal Networks

NASA Astrophysics Data System (ADS)

Yan, Hao; Sun, Xiaojuan

2017-06-01

In this paper, we mainly discuss effects of partial time delay on temporal dynamics of Watts-Strogatz (WS) small-world neuronal networks by controlling two parameters. One is the time delay τ and the other is the probability of partial time delay pdelay. Temporal dynamics of WS small-world neuronal networks are discussed with the aid of temporal coherence and mean firing rate. With the obtained simulation results, it is revealed that for small time delay τ, the probability pdelay could weaken temporal coherence and increase mean firing rate of neuronal networks, which indicates that it could improve neuronal firings of the neuronal networks while destroying firing regularity. For large time delay τ, temporal coherence and mean firing rate do not have great changes with respect to pdelay. Time delay τ always has great influence on both temporal coherence and mean firing rate no matter what is the value of pdelay. Moreover, with the analysis of spike trains and histograms of interspike intervals of neurons inside neuronal networks, it is found that the effects of partial time delays on temporal coherence and mean firing rate could be the result of locking between the period of neuronal firing activities and the value of time delay τ. In brief, partial time delay could have great influence on temporal dynamics of the neuronal networks.

A general stochastic model for studying time evolution of transition networks

NASA Astrophysics Data System (ADS)

Zhan, Choujun; Tse, Chi K.; Small, Michael

2016-12-01

We consider a class of complex networks whose nodes assume one of several possible states at any time and may change their states from time to time. Such networks represent practical networks of rumor spreading, disease spreading, language evolution, and so on. Here, we derive a model describing the dynamics of this kind of network and a simulation algorithm for studying the network evolutionary behavior. This model, derived at a microscopic level, can reveal the transition dynamics of every node. A numerical simulation is taken as an ;experiment; or ;realization; of the model. We use this model to study the disease propagation dynamics in four different prototypical networks, namely, the regular nearest-neighbor (RN) network, the classical Erdös-Renyí (ER) random graph, the Watts-Strogátz small-world (SW) network, and the Barabási-Albert (BA) scalefree network. We find that the disease propagation dynamics in these four networks generally have different properties but they do share some common features. Furthermore, we utilize the transition network model to predict user growth in the Facebook network. Simulation shows that our model agrees with the historical data. The study can provide a useful tool for a more thorough understanding of the dynamics networks.

Dynamical Response of Networks Under External Perturbations: Exact Results

NASA Astrophysics Data System (ADS)

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

2015-04-01

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

Harmonic stochastic resonance-enhanced signal detecting in NW small-world neural network

NASA Astrophysics Data System (ADS)

Wang, Dao-Guang; Liang, Xiao-Ming; Wang, Jing; Yang, Cheng-Fang; Liu, Kai; Lü, Hua-Ping

2010-11-01

The harmonic stochastic resonance-enhanced signal detecting in Newman-Watts small-world neural network is studied using the Hodgkin-Huxley dynamical equation with noise. If the connection probability p, coupling strength gsyn and noise intensity D matches well, higher order resonance will be found and an optimal signal-to-noise ratio will be obtained. Then, the reasons are given to explain the mechanism of this appearance.

Limited ability driven phase transitions in the coevolution process in Axelrod's model

NASA Astrophysics Data System (ADS)

Wang, Bing; Han, Yuexing; Chen, Luonan; Aihara, Kazuyuki

2009-04-01

We study the coevolution process in Axelrod's model by taking into account of agents' abilities to access information, which is described by a parameter α to control the geographical range of communication. We observe two kinds of phase transitions in both cultural domains and network fragments, which depend on the parameter α. By simulation, we find that not all rewiring processes pervade the dissemination of culture, that is, a very limited ability to access information constrains the cultural dissemination, while an exceptional ability to access information aids the dissemination of culture. Furthermore, by analyzing the network characteristics at the frozen states, we find that there exists a stage at which the network develops to be a small-world network with community structures.

Local and global synchronization transitions induced by time delays in small-world neuronal networks with chemical synapses.

PubMed

Yu, Haitao; Wang, Jiang; Du, Jiwei; Deng, Bin; Wei, Xile

2015-02-01

Effects of time delay on the local and global synchronization in small-world neuronal networks with chemical synapses are investigated in this paper. Numerical results show that, for both excitatory and inhibitory coupling types, the information transmission delay can always induce synchronization transitions of spiking neurons in small-world networks. In particular, regions of in-phase and out-of-phase synchronization of connected neurons emerge intermittently as the synaptic delay increases. For excitatory coupling, all transitions to spiking synchronization occur approximately at integer multiples of the firing period of individual neurons; while for inhibitory coupling, these transitions appear at the odd multiples of the half of the firing period of neurons. More importantly, the local synchronization transition is more profound than the global synchronization transition, depending on the type of coupling synapse. For excitatory synapses, the local in-phase synchronization observed for some values of the delay also occur at a global scale; while for inhibitory ones, this synchronization, observed at the local scale, disappears at a global scale. Furthermore, the small-world structure can also affect the phase synchronization of neuronal networks. It is demonstrated that increasing the rewiring probability can always improve the global synchronization of neuronal activity, but has little effect on the local synchronization of neighboring neurons.

Stochastic resonance on a modular neuronal network of small-world subnetworks with a subthreshold pacemaker

NASA Astrophysics Data System (ADS)

Yu, Haitao; Wang, Jiang; Liu, Chen; Deng, Bin; Wei, Xile

2011-12-01

We study the phenomenon of stochastic resonance on a modular neuronal network consisting of several small-world subnetworks with a subthreshold periodic pacemaker. Numerical results show that the correlation between the pacemaker frequency and the dynamical response of the network is resonantly dependent on the intensity of additive spatiotemporal noise. This effect of pacemaker-driven stochastic resonance of the system depends extensively on the local and the global network structure, such as the intra- and inter-coupling strengths, rewiring probability of individual small-world subnetwork, the number of links between different subnetworks, and the number of subnetworks. All these parameters play a key role in determining the ability of the network to enhance the noise-induced outreach of the localized subthreshold pacemaker, and only they bounded to a rather sharp interval of values warrant the emergence of the pronounced stochastic resonance phenomenon. Considering the rather important role of pacemakers in real-life, the presented results could have important implications for many biological processes that rely on an effective pacemaker for their proper functioning.

Investigation of a protein complex network

NASA Astrophysics Data System (ADS)

Mashaghi, A. R.; Ramezanpour, A.; Karimipour, V.

2004-09-01

The budding yeast Saccharomyces cerevisiae is the first eukaryote whose genome has been completely sequenced. It is also the first eukaryotic cell whose proteome (the set of all proteins) and interactome (the network of all mutual interactions between proteins) has been analyzed. In this paper we study the structure of the yeast protein complex network in which weighted edges between complexes represent the number of shared proteins. It is found that the network of protein complexes is a small world network with scale free behavior for many of its distributions. However we find that there are no strong correlations between the weights and degrees of neighboring complexes. To reveal non-random features of the network we also compare it with a null model in which the complexes randomly select their proteins. Finally we propose a simple evolutionary model based on duplication and divergence of proteins.

Resilience of networks to environmental stress: From regular to random networks

NASA Astrophysics Data System (ADS)

Eom, Young-Ho

2018-04-01

Despite the huge interest in network resilience to stress, most of the studies have concentrated on internal stress damaging network structure (e.g., node removals). Here we study how networks respond to environmental stress deteriorating their external conditions. We show that, when regular networks gradually disintegrate as environmental stress increases, disordered networks can suddenly collapse at critical stress with hysteresis and vulnerability to perturbations. We demonstrate that this difference results from a trade-off between node resilience and network resilience to environmental stress. The nodes in the disordered networks can suppress their collapses due to the small-world topology of the networks but eventually collapse all together in return. Our findings indicate that some real networks can be highly resilient against environmental stress to a threshold yet extremely vulnerable to the stress above the threshold because of their small-world topology.

Scale-free network provides an optimal pattern for knowledge transfer

NASA Astrophysics Data System (ADS)

Lin, Min; Li, Nan

2010-02-01

We study numerically the knowledge innovation and diffusion process on four representative network models, such as regular networks, small-world networks, random networks and scale-free networks. The average knowledge stock level as a function of time is measured and the corresponding growth diffusion time, τ is defined and computed. On the four types of networks, the growth diffusion times all depend linearly on the network size N as τ∼N, while the slope for scale-free network is minimal indicating the fastest growth and diffusion of knowledge. The calculated variance and spatial distribution of knowledge stock illustrate that optimal knowledge transfer performance is obtained on scale-free networks. We also investigate the transient pattern of knowledge diffusion on the four networks, and a qualitative explanation of this finding is proposed.

Large-scale brain networks in the awake, truly resting marmoset monkey.

PubMed

Belcher, Annabelle M; Yen, Cecil C; Stepp, Haley; Gu, Hong; Lu, Hanbing; Yang, Yihong; Silva, Afonso C; Stein, Elliot A

2013-10-16

Resting-state functional MRI is a powerful tool that is increasingly used as a noninvasive method for investigating whole-brain circuitry and holds great potential as a possible diagnostic for disease. Despite this potential, few resting-state studies have used animal models (of which nonhuman primates represent our best opportunity of understanding complex human neuropsychiatric disease), and no work has characterized networks in awake, truly resting animals. Here we present results from a small New World monkey that allows for the characterization of resting-state networks in the awake state. Six adult common marmosets (Callithrix jacchus) were acclimated to light, comfortable restraint using individualized helmets. Following behavioral training, resting BOLD data were acquired during eight consecutive 10 min scans for each conscious subject. Group independent component analysis revealed 12 brain networks that overlap substantially with known anatomically constrained circuits seen in the awake human. Specifically, we found eight sensory and "lower-order" networks (four visual, two somatomotor, one cerebellar, and one caudate-putamen network), and four "higher-order" association networks (one default mode-like network, one orbitofrontal, one frontopolar, and one network resembling the human salience network). In addition to their functional relevance, these network patterns bear great correspondence to those previously described in awake humans. This first-of-its-kind report in an awake New World nonhuman primate provides a platform for mechanistic neurobiological examination for existing disease models established in the marmoset.

A Single Session of rTMS Enhances Small-Worldness in Writer's Cramp: Evidence from Simultaneous EEG-fMRI Multi-Modal Brain Graph.

PubMed

Bharath, Rose D; Panda, Rajanikant; Reddam, Venkateswara Reddy; Bhaskar, M V; Gohel, Suril; Bhardwaj, Sujas; Prajapati, Arvind; Pal, Pramod Kumar

2017-01-01

Background and Purpose : Repetitive transcranial magnetic stimulation (rTMS) induces widespread changes in brain connectivity. As the network topology differences induced by a single session of rTMS are less known we undertook this study to ascertain whether the network alterations had a small-world morphology using multi-modal graph theory analysis of simultaneous EEG-fMRI. Method : Simultaneous EEG-fMRI was acquired in duplicate before (R1) and after (R2) a single session of rTMS in 14 patients with Writer's Cramp (WC). Whole brain neuronal and hemodynamic network connectivity were explored using the graph theory measures and clustering coefficient, path length and small-world index were calculated for EEG and resting state fMRI (rsfMRI). Multi-modal graph theory analysis was used to evaluate the correlation of EEG and fMRI clustering coefficients. Result : A single session of rTMS was found to increase the clustering coefficient and small-worldness significantly in both EEG and fMRI ( p < 0.05). Multi-modal graph theory analysis revealed significant modulations in the fronto-parietal regions immediately after rTMS. The rsfMRI revealed additional modulations in several deep brain regions including cerebellum, insula and medial frontal lobe. Conclusion : Multi-modal graph theory analysis of simultaneous EEG-fMRI can supplement motor physiology methods in understanding the neurobiology of rTMS in vivo . Coinciding evidence from EEG and rsfMRI reports small-world morphology for the acute phase network hyper-connectivity indicating changes ensuing low-frequency rTMS is probably not "noise".

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

PubMed

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

2010-02-15

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

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

Thakur, Gautam

A data-driven realistic design and evalua- tion of vehicular mobility has been particularly chal- lenging due to a lack of large-scale real-world mea- surements in the research community. Current research methodologies rely on articial scenarios, random con- nectivity, and use small and biased samples. In this pa- per, we perform a combined study to learn the struc- ture and connectivity of urban streets and modeling and characterization of vehicular trac densities on them. Our dataset is a collection of more than 222 thousand routes and 25 million vehicular mobility images from 1091 online web cameras located in six dierent re-more » gions of the world. Our results centered around four major observations: i. study shows that driving routes and visiting locations of regions demonstrate power-law distribution, indicating a planned or recently designed road infrastructure; ii. we represent regions by network graphs in which nodes are camera locations and edges are urban streets that connect the nodes. Such represen- tation exhibits small world properties with short path lengths and large clustering coecient; iii. trac densi- ties show 80% temporal correlation during several hours of a day; iv. modeling trac densities against known theoretical distributions show less than 5% deviation for heavy-trailed models such as log-logistic and log- gamma distributions. We believe this work will provide a much-needed contribution to the research community for design and evaluation of future vehicular networks and smart cities.« less

Small-world network properties in prefrontal cortex correlate with predictors of psychopathology risk in young children: a NIRS study.

PubMed

Fekete, Tomer; Beacher, Felix D C C; Cha, Jiook; Rubin, Denis; Mujica-Parodi, Lilianne R

2014-01-15

Near infrared spectroscopy (NIRS) is an emerging imaging technique that is relatively inexpensive, portable, and particularly well suited for collecting data in ecological settings. Therefore, it holds promise as a potential neurodiagnostic for young children. We set out to explore whether NIRS could be utilized in assessing the risk of developmental psychopathology in young children. A growing body of work indicates that temperament at young age is associated with vulnerability to psychopathology later on in life. In particular, it has been shown that low effortful control (EC), which includes the focusing and shifting of attention, inhibitory control, perceptual sensitivity, and a low threshold for pleasure, is linked to conditions such as anxiety, depression and attention deficit hyperactivity disorder (ADHD). Physiologically, EC has been linked to a control network spanning among other sites the prefrontal cortex. Several psychopathologies, such as depression and ADHD, have been shown to result in compromised small-world network properties. Therefore we set out to explore the relationship between EC and the small-world properties of PFC using NIRS. NIRS data were collected from 44 toddlers, ages 3-5, while watching naturalistic stimuli (movie clips). Derived complex network measures were then correlated to EC as derived from the Children's Behavior Questionnaire (CBQ). We found that reduced levels of EC were associated with compromised small-world properties of the prefrontal network. Our results suggest that the longitudinal NIRS studies of complex network properties in young children hold promise in furthering our understanding of developmental psychopathology. © 2013.

Spatial prisoner's dilemma game with volunteering in Newman-Watts small-world networks

NASA Astrophysics Data System (ADS)

Wu, Zhi-Xi; Xu, Xin-Jian; Chen, Yong; Wang, Ying-Hai

2005-03-01

A modified spatial prisoner’s dilemma game with voluntary participation in Newman-Watts small-world networks is studied. Some reasonable ingredients are introduced to the game evolutionary dynamics: each agent in the network is a pure strategist and can only take one of three strategies (cooperator, defector, and loner); its strategical transformation is associated with both the number of strategical states and the magnitude of average profits, which are adopted and acquired by its coplayers in the previous round of play; a stochastic strategy mutation is applied when it gets into the trouble of local commons that the agent and its neighbors are in the same state and get the same average payoffs. In the case of very low temptation to defect, it is found that agents are willing to participate in the game in typical small-world region and intensive collective oscillations arise in more random region.

The structural robustness of geographical networks against regional failure and their pre-optimization

NASA Astrophysics Data System (ADS)

Li, Yixiao; Zhang, Lin; Huang, Chaogeng; Shen, Bin

2016-06-01

Failures of real-world infrastructure networks due to natural disasters often originate in a certain region, but this feature has seldom been considered in theoretical models. In this article, we introduce a possible failure pattern of geographical networks-;regional failure;-by which nodes and edges within a region malfunction. Based on a previous spatial network model (Louf et al., 2013), we study the robustness of geographical networks against regional failure, which is measured by the fraction of nodes that remain in the largest connected component, via simulations. A small-area failure results in a large reduction of their robustness measure. Furthermore, we investigate two pre-deployed mechanisms to enhance their robustness: One is to extend the cost-benefit growth mechanism of the original network model by adding more than one link in a growth step, and the other is to strengthen the interconnection of hubs in generated networks. We measure the robustness-enhancing effects of both mechanisms on the basis of their costs, i.e., the amount of excessive links and the induced geographical length. The latter mechanism is better than the former one if a normal level of costs is considered. When costs exceed a certain level, the former has an advantage. Because the costs of excessive links affect the investment decision of real-world infrastructure networks, it is practical to enhance their robustness by adding more links between hubs. These results might help design robust geographical networks economically.

Critical tipping point distinguishing two types of transitions in modular network structures

NASA Astrophysics Data System (ADS)

Shai, Saray; Kenett, Dror Y.; Kenett, Yoed N.; Faust, Miriam; Dobson, Simon; Havlin, Shlomo

2015-12-01

Modularity is a key organizing principle in real-world large-scale complex networks. The relatively sparse interactions between modules are critical to the functionality of the system and are often the first to fail. We model such failures as site percolation targeting interconnected nodes, those connecting between modules. We find, using percolation theory and simulations, that they lead to a "tipping point" between two distinct regimes. In one regime, removal of interconnected nodes fragments the modules internally and causes the system to collapse. In contrast, in the other regime, while only attacking a small fraction of nodes, the modules remain but become disconnected, breaking the entire system. We show that networks with broader degree distribution might be highly vulnerable to such attacks since only few nodes are needed to interconnect the modules, consequently putting the entire system at high risk. Our model has the potential to shed light on many real-world phenomena, and we briefly consider its implications on recent advances in the understanding of several neurocognitive processes and diseases.

Optimizing Dynamical Network Structure for Pinning Control

NASA Astrophysics Data System (ADS)

Orouskhani, Yasin; Jalili, Mahdi; Yu, Xinghuo

2016-04-01

Controlling dynamics of a network from any initial state to a final desired state has many applications in different disciplines from engineering to biology and social sciences. In this work, we optimize the network structure for pinning control. The problem is formulated as four optimization tasks: i) optimizing the locations of driver nodes, ii) optimizing the feedback gains, iii) optimizing simultaneously the locations of driver nodes and feedback gains, and iv) optimizing the connection weights. A newly developed population-based optimization technique (cat swarm optimization) is used as the optimization method. In order to verify the methods, we use both real-world networks, and model scale-free and small-world networks. Extensive simulation results show that the optimal placement of driver nodes significantly outperforms heuristic methods including placing drivers based on various centrality measures (degree, betweenness, closeness and clustering coefficient). The pinning controllability is further improved by optimizing the feedback gains. We also show that one can significantly improve the controllability by optimizing the connection weights.

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

PubMed

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

2017-01-01

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

Network topology analysis approach on China's QFII stock investment behavior

NASA Astrophysics Data System (ADS)

Zhang, Yongjie; Cao, Xing; He, Feng; Zhang, Wei

2017-05-01

In this paper, the investment behavior of QFII in China stock market from 2004 to 2015 is studied with the network topology method. Based on the nodes topological characteristics, stock holding fluctuations correlation is studied from the micro network level. We conclude that the QFII mutual stock holding network have both scale free and small world properties, which presented mainly small world characteristics from 2005 to 2011, and scale free characteristics from 2012 to 2015. Moreover, fluctuations correlation is different with different nodes topological characteristics. In different economic periods, QFII represented different connection patterns and they reacted to the market crash spontaneously. Thus, this paper provides the first evidence of complex network research on QFII' investment behavior in China as an emerging market.

Mandala Networks: ultra-small-world and highly sparse graphs

PubMed Central

Sampaio Filho, Cesar I. N.; Moreira, André A.; Andrade, Roberto F. S.; Herrmann, Hans J.; Andrade, José S.

2015-01-01

The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to systematically construct networks which are robust against random failures. Furthermore, as the size of the network increases, its shortest path becomes asymptotically invariant and the density of links goes to zero, making it ultra-small world and highly sparse, respectively. The first property is ideal for communication and navigation purposes, while the second is interesting economically. Finally, we show that some simple changes on the original network formulation can lead to an improved topology against malicious attacks. PMID:25765450

a Weighted Local-World Evolving Network Model Based on the Edge Weights Preferential Selection

NASA Astrophysics Data System (ADS)

Li, Ping; Zhao, Qingzhen; Wang, Haitang

2013-05-01

In this paper, we use the edge weights preferential attachment mechanism to build a new local-world evolutionary model for weighted networks. It is different from previous papers that the local-world of our model consists of edges instead of nodes. Each time step, we connect a new node to two existing nodes in the local-world through the edge weights preferential selection. Theoretical analysis and numerical simulations show that the scale of the local-world affect on the weight distribution, the strength distribution and the degree distribution. We give the simulations about the clustering coefficient and the dynamics of infectious diseases spreading. The weight dynamics of our network model can portray the structure of realistic networks such as neural network of the nematode C. elegans and Online Social Network.

Multifractal cross-correlation effects in two-variable time series of complex network vertex observables

NASA Astrophysics Data System (ADS)

OświÈ©cimka, Paweł; Livi, Lorenzo; DroŻdŻ, Stanisław

2016-10-01

We investigate the scaling of the cross-correlations calculated for two-variable time series containing vertex properties in the context of complex networks. Time series of such observables are obtained by means of stationary, unbiased random walks. We consider three vertex properties that provide, respectively, short-, medium-, and long-range information regarding the topological role of vertices in a given network. In order to reveal the relation between these quantities, we applied the multifractal cross-correlation analysis technique, which provides information about the nonlinear effects in coupling of time series. We show that the considered network models are characterized by unique multifractal properties of the cross-correlation. In particular, it is possible to distinguish between Erdös-Rényi, Barabási-Albert, and Watts-Strogatz networks on the basis of fractal cross-correlation. Moreover, the analysis of protein contact networks reveals characteristics shared with both scale-free and small-world models.

Optimal Topology Control and Power Allocation for Minimum Energy Consumption in Consensus Networks

DTIC Science & Technology

2011-12-16

network topologies, such as small world graphs, can greatly increase the convergence rate. In [9], the authors show that nonbipartite Ramanujan graphs...unclassified c . THIS PAGE unclassified Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 23384 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60...of iterations necessary to achieve consensus. From this perspec- tive, enforcing a small world, scale-free, or Ramanujan graph topology may not be the

Evolution of weighted complex bus transit networks with flow

NASA Astrophysics Data System (ADS)

Huang, Ailing; Xiong, Jie; Shen, Jinsheng; Guan, Wei

2016-02-01

Study on the intrinsic properties and evolutional mechanism of urban public transit networks (PTNs) has great significance for transit planning and control, particularly considering passengers’ dynamic behaviors. This paper presents an empirical analysis for exploring the complex properties of Beijing’s weighted bus transit network (BTN) based on passenger flow in L-space, and proposes a bi-level evolution model to simulate the development of transit routes from the view of complex network. The model is an iterative process that is driven by passengers’ travel demands and dual-controlled interest mechanism, which is composed of passengers’ spatio-temporal requirements and cost constraint of transit agencies. Also, the flow’s dynamic behaviors, including the evolutions of travel demand, sectional flow attracted by a new link and flow perturbation triggered in nearby routes, are taken into consideration in the evolutional process. We present the numerical experiment to validate the model, where the main parameters are estimated by using distribution functions that are deduced from real-world data. The results obtained have proven that our model can generate a BTN with complex properties, such as the scale-free behavior or small-world phenomenon, which shows an agreement with our empirical results. Our study’s results can be exploited to optimize the real BTN’s structure and improve the network’s robustness.

Properties of four real world collaboration--competition networks

NASA Astrophysics Data System (ADS)

Fu, Chun-Hua; Xu, Xiu-Lian; He, Da-Ren

2009-03-01

Our research group has empirically investigated 9 real world collaboration networks and 25 real world cooperation-competition networks. Among the 34 real world systems, all the 9 real world collaboration networks and 6 real world cooperation-competition networks show the unimodal act-size distribution and the shifted power law distribution of degree and act-degree. We have proposed a collaboration network evolution model for an explanation of the rules [1]. The other 14 real world cooperation-competition networks show that the act-size distributions are not unimodal; instead, they take qualitatively the same shifted power law forms as the degree and act-degree distributions. The properties of four systems (the main land movie film network, Beijing restaurant network, 2004 Olympic network, and Tao-Bao notebook computer sale network) are reported in detail as examples. Via a numerical simulation, we show that the new rule can still be explained by the above-mentioned model. [1] H. Chang, B. B. Su, et al. Phsica A, 2007, 383: 687-702.

Bidirectional selection between two classes in complex social networks.

PubMed

Zhou, Bin; He, Zhe; Jiang, Luo-Luo; Wang, Nian-Xin; Wang, Bing-Hong

2014-12-19

The bidirectional selection between two classes widely emerges in various social lives, such as commercial trading and mate choosing. Until now, the discussions on bidirectional selection in structured human society are quite limited. We demonstrated theoretically that the rate of successfully matching is affected greatly by individuals' neighborhoods in social networks, regardless of the type of networks. Furthermore, it is found that the high average degree of networks contributes to increasing rates of successful matches. The matching performance in different types of networks has been quantitatively investigated, revealing that the small-world networks reinforces the matching rate more than scale-free networks at given average degree. In addition, our analysis is consistent with the modeling result, which provides the theoretical understanding of underlying mechanisms of matching in complex networks.

Emergence of cooperation in non-scale-free networks

NASA Astrophysics Data System (ADS)

Zhang, Yichao; Aziz-Alaoui, M. A.; Bertelle, Cyrille; Zhou, Shi; Wang, Wenting

2014-06-01

Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. Previous studies proposed a strategy updating mechanism, which successfully demonstrated that the scale-free network can provide a framework for the emergence of cooperation. Instead, individuals in random graphs and small-world networks do not favor cooperation under this updating rule. However, a recent empirical result shows the heterogeneous networks do not promote cooperation when humans play a prisoner’s dilemma. In this paper, we propose a strategy updating rule with payoff memory. We observe that the random graphs and small-world networks can provide even better frameworks for cooperation than the scale-free networks in this scenario. Our observations suggest that the degree heterogeneity may be neither a sufficient condition nor a necessary condition for the widespread cooperation in complex networks. Also, the topological structures are not sufficed to determine the level of cooperation in complex networks.

Stochastic resonance in the majority vote model on regular and small-world lattices

NASA Astrophysics Data System (ADS)

Krawiecki, A.

2017-11-01

The majority vote model with two states on regular and small-world networks is considered under the influence of periodic driving. Monte Carlo simulations show that the time-dependent magnetization, playing the role of the output signal, exhibits maximum periodicity at nonzero values of the internal noise parameter q, which is manifested as the occurrence of the maximum of the spectral power amplification; the location of the maximum depends in a nontrivial way on the amplitude and frequency of the periodic driving as well as on the network topology. This indicates the appearance of stochastic resonance in the system as a function of the intensity of the internal noise. Besides, for low frequencies and for certain narrow ranges of the amplitudes of the periodic driving double maxima of the spectral power amplification as a function of q occur, i.e., stochastic multiresonance appears. The above-mentioned results quantitatively agree with those obtained from numerical simulations of the mean-field equations for the time-dependent magnetization. In contrast, analytic solutions for the spectral power amplification obtained from the latter equations using the linear response approximation deviate significanlty from the numerical results since the effect of the periodic driving on the system is not small even for vanishing amplitude.

LAN Configuration and Analysis: Projects for the Data Communications and Networking Course

ERIC Educational Resources Information Center

Chen, Fang; Brabston, Mary

2011-01-01

We implemented two local area network (LAN) projects in our introductory data communications and networking course. The first project required students to develop a LAN from scratch for a small imaginary organization. The second project required student groups to analyze a LAN for a real world small organization. By allowing students to apply what…

Social dilemmas in an online social network: The structure and evolution of cooperation

NASA Astrophysics Data System (ADS)

Fu, Feng; Chen, Xiaojie; Liu, Lianghuan; Wang, Long

2007-11-01

We investigate two paradigms for studying the evolution of cooperation—Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society.

Statistical investigation of avalanches of three-dimensional small-world networks and their boundary and bulk cross-sections

NASA Astrophysics Data System (ADS)

Najafi, M. N.; Dashti-Naserabadi, H.

2018-03-01

In many situations we are interested in the propagation of energy in some portions of a three-dimensional system with dilute long-range links. In this paper, a sandpile model is defined on the three-dimensional small-world network with real dissipative boundaries and the energy propagation is studied in three dimensions as well as the two-dimensional cross-sections. Two types of cross-sections are defined in the system, one in the bulk and another in the system boundary. The motivation of this is to make clear how the statistics of the avalanches in the bulk cross-section tend to the statistics of the dissipative avalanches, defined in the boundaries as the concentration of long-range links (α ) increases. This trend is numerically shown to be a power law in a manner described in the paper. Two regimes of α are considered in this work. For sufficiently small α s the dominant behavior of the system is just like that of the regular BTW, whereas for the intermediate values the behavior is nontrivial with some exponents that are reported in the paper. It is shown that the spatial extent up to which the statistics is similar to the regular BTW model scales with α just like the dissipative BTW model with the dissipation factor (mass in the corresponding ghost model) m2˜α for the three-dimensional system as well as its two-dimensional cross-sections.

Advertising and Irreversible Opinion Spreading in Complex Social Networks

NASA Astrophysics Data System (ADS)

Candia, Julián

Irreversible opinion spreading phenomena are studied on small-world and scale-free networks by means of the magnetic Eden model, a nonequilibrium kinetic model for the growth of binary mixtures in contact with a thermal bath. In this model, the opinion of an individual is affected by those of their acquaintances, but opinion changes (analogous to spin flips in an Ising-like model) are not allowed. We focus on the influence of advertising, which is represented by external magnetic fields. The interplay and competition between temperature and fields lead to order-disorder transitions, which are found to also depend on the link density and the topology of the complex network substrate. The effects of advertising campaigns with variable duration, as well as the best cost-effective strategies to achieve consensus within different scenarios, are also discussed.

The Acceptance of Microblogging in the Learning Process: The µBAM Model

ERIC Educational Resources Information Center

Rejón-Guardia, Francisco; Sánchez-Fernández, Juan; Muñoz-Leiva, Francisco

2013-01-01

Microblogging social networks (µBSNs) provide the opportunity to communicate worldwide while using a small number of characters; this is an apparent limitation that forces users to share only essential information when linking to the world with which they interact. These platforms can serve to motivate students by narrowing the physical and…

Exploring the story, science, and adventure of small worlds

NASA Astrophysics Data System (ADS)

Swann, J. L.; Elkins-Tanton, L. T.; Anbar, A. D.; Klug Boonstra, S.; Tamer, A. J.; Mead, C.; Hunsley, D.

2017-12-01

Small worlds are a strategic focus at NASA, reflected by missions such as Osiris Rex and Psyche among others. The Infiniscope project, with funding from NASA SMD, is building on this scientific and public interest to teach formal and informal learners about asteroids and other small worlds. The digital learning experience, "Where are the small worlds?", and future Infiniscope experiences, incorporate a design theory that we describe as "education through exploration" (ETX) which is provided through an adaptive e-learning platform. This design ensures that learners actively engage in exploration and discovery, while receiving targeted feedback to push through challenges. To ensure that this and future experiences reach and meet the needs of as many educators as possible, Infiniscope includes a digital teaching network to host the experiences and support the reuse and adaptation of digital resources in new lessons. "Where are the small worlds?" puts learners in an interactive simulation of the solar system and provides a mission structure in which they hunt for "astrocaches" on near earth objects, main belt asteroids, and Kuiper-belt objects. These activities allow the learner to discover the locations of the small worlds in the solar system and develop an intuitive understanding for the relative motion of objects at various distances from the Sun. The experience is NGSS-aligned and accompanied by a lesson plan for integration into the classroom. In testing with more than 500 middle-school students, 83% of participants said they wanted to do more experiences like "Where are the small worlds?" They also found the experience both "fun" and "interesting" while being moderately difficult. "Where are the small worlds?" is one of many visualizations and lessons that is available within the Infiniscope teaching network. The network already has hundreds of members and is expected to grow in both numbers and engagement over time. Currently, educators can search and use pre-existing experiences, but as the visualization library expands and educators learn more about exploration-learning design, they may modify existing experiences and even build entirely new experiences to meet specific needs. In parallel, we are also developing a professional development program that builds understanding of the principles of ETX design.

CROSS-DISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: The Fractal Dimensions of Complex Networks

NASA Astrophysics Data System (ADS)

Guo, Long; Cai, XU

2009-08-01

It is shown that many real complex networks share distinctive features, such as the small-world effect and the heterogeneous property of connectivity of vertices, which are different from random networks and regular lattices. Although these features capture the important characteristics of complex networks, their applicability depends on the style of networks. To unravel the universal characteristics many complex networks have in common, we study the fractal dimensions of complex networks using the method introduced by Shanker. We find that the average 'density' (ρ(r)) of complex networks follows a better power-law function as a function of distance r with the exponent df, which is defined as the fractal dimension, in some real complex networks. Furthermore, we study the relation between df and the shortcuts Nadd in small-world networks and the size N in regular lattices. Our present work provides a new perspective to understand the dependence of the fractal dimension df on the complex network structure.

Gray Matter Network Disruptions and Regional Amyloid Beta in Cognitively Normal Adults.

PubMed

Ten Kate, Mara; Visser, Pieter Jelle; Bakardjian, Hovagim; Barkhof, Frederik; Sikkes, Sietske A M; van der Flier, Wiesje M; Scheltens, Philip; Hampel, Harald; Habert, Marie-Odile; Dubois, Bruno; Tijms, Betty M

2018-01-01

The accumulation of amyloid plaques is one of the earliest pathological changes in Alzheimer's disease (AD) and may occur 20 years before the onset of symptoms. Examining associations between amyloid pathology and other early brain changes is critical for understanding the pathophysiological underpinnings of AD. Alterations in gray matter networks might already start at early preclinical stages of AD. In this study, we examined the regional relationship between amyloid aggregation measured with positron emission tomography (PET) and gray matter network measures in elderly subjects with subjective memory complaints. Single-subject gray matter networks were extracted from T1-weigthed structural MRI in cognitively normal subjects ( n = 318, mean age 76.1 ± 3.5, 64% female, 28% amyloid positive). Degree, clustering, path length and small world properties were computed. Global and regional amyloid load was determined using [ 18 F]-Florbetapir PET. Associations between standardized uptake value ratio (SUVr) values and network measures were examined using linear regression models. We found that higher global SUVr was associated with lower clustering ( β = -0.12, p < 0.05), and small world values ( β = -0.16, p < 0.01). Associations were most prominent in orbito- and dorsolateral frontal and parieto-occipital regions. Local SUVr values showed less anatomical variability and did not convey additional information beyond global amyloid burden. In conclusion, we found that in cognitively normal elderly subjects, increased global amyloid pathology is associated with alterations in gray matter networks that are indicative of incipient network breakdown towards AD dementia.

Model of epidemic control based on quarantine and message delivery

NASA Astrophysics Data System (ADS)

Wang, Xingyuan; Zhao, Tianfang; Qin, Xiaomeng

2016-09-01

The model provides two novel strategies for the preventive control of epidemic diseases. One approach is related to the different isolating rates in latent period and invasion period. Experiments show that the increasing of isolating rates in invasion period, as long as over 0.5, contributes little to the preventing of epidemic; the improvement of isolation rate in latent period is key to control the disease spreading. Another is a specific mechanism of message delivering and forwarding. Information quality and information accumulating process are also considered there. Macroscopically, diseases are easy to control as long as the immune messages reach a certain quality. Individually, the accumulating messages bring people with certain immunity to the disease. Also, the model is performed on the classic complex networks like scale-free network and small-world network, and location-based social networks. Results show that the proposed measures demonstrate superior performance and significantly reduce the negative impact of epidemic disease.

Real beards and real networks: a spin-glass model for interacting individuals

NASA Astrophysics Data System (ADS)

O'Neale, Dion

''I want to be different, just like all the other different people'' sang the band King Missile. Whether they are the Beatniks of the 1950s, the punks of the 1970s, or the hipsters of today, non-conformists often tend to look the same, seemingly at odds with their goal of non-conformity. The spin-glass model, originally developed to describe the interaction of magnetic spins, and since applied to situations as diverse as the electrical activity of networks of neurons, to trades on a financial market, has recently been used in social science to study populations of interacting individuals comprised of a mix of both conformists and anti-conformists - or hipsters. Including delay effects for the interactions between individuals has been shown to give a system with non-trivial dynamics with a phase transition from stable behaviour to periodic switching between two states (let's call them bushy bearded and clean shaven). Analytic solutions to such a model are possible, but only for particular assumptions about the interaction and delay matrices. In this work we will show what happens when the interactions in the model are based on real-world networks with ''small-world'' effects and clustering.

Excitement and synchronization of small-world neuronal networks with short-term synaptic plasticity.

PubMed

Han, Fang; Wiercigroch, Marian; Fang, Jian-An; Wang, Zhijie

2011-10-01

Excitement and synchronization of electrically and chemically coupled Newman-Watts (NW) small-world neuronal networks with a short-term synaptic plasticity described by a modified Oja learning rule are investigated. For each type of neuronal network, the variation properties of synaptic weights are examined first. Then the effects of the learning rate, the coupling strength and the shortcut-adding probability on excitement and synchronization of the neuronal network are studied. It is shown that the synaptic learning suppresses the over-excitement, helps synchronization for the electrically coupled network but impairs synchronization for the chemically coupled one. Both the introduction of shortcuts and the increase of the coupling strength improve synchronization and they are helpful in increasing the excitement for the chemically coupled network, but have little effect on the excitement of the electrically coupled one.

Stochastic resonance enhancement of small-world neural networks by hybrid synapses and time delay

NASA Astrophysics Data System (ADS)

Yu, Haitao; Guo, Xinmeng; Wang, Jiang

2017-01-01

The synergistic effect of hybrid electrical-chemical synapses and information transmission delay on the stochastic response behavior in small-world neuronal networks is investigated. Numerical results show that, the stochastic response behavior can be regulated by moderate noise intensity to track the rhythm of subthreshold pacemaker, indicating the occurrence of stochastic resonance (SR) in the considered neural system. Inheriting the characteristics of two types of synapses-electrical and chemical ones, neural networks with hybrid electrical-chemical synapses are of great improvement in neuron communication. Particularly, chemical synapses are conducive to increase the network detectability by lowering the resonance noise intensity, while the information is better transmitted through the networks via electrical coupling. Moreover, time delay is able to enhance or destroy the periodic stochastic response behavior intermittently. In the time-delayed small-world neuronal networks, the introduction of electrical synapses can significantly improve the signal detection capability by widening the range of optimal noise intensity for the subthreshold signal, and the efficiency of SR is largely amplified in the case of pure chemical couplings. In addition, the stochastic response behavior is also profoundly influenced by the network topology. Increasing the rewiring probability in pure chemically coupled networks can always enhance the effect of SR, which is slightly influenced by information transmission delay. On the other hand, the capacity of information communication is robust to the network topology within the time-delayed neuronal systems including electrical couplings.

Emergence of synchronization induced by the interplay between two prisoner's dilemma games with volunteering in small-world networks

NASA Astrophysics Data System (ADS)

Chen, Yong; Qin, Shao-Meng; Yu, Lianchun; Zhang, Shengli

2008-03-01

We studied synchronization between prisoner’s dilemma games with voluntary participation in two Newman-Watts small-world networks. It was found that there are three kinds of synchronization: partial phase synchronization, total phase synchronization, and complete synchronization, for varied coupling factors. Besides, two games can reach complete synchronization for the large enough coupling factor. We also discussed the effect of the coupling factor on the amplitude of oscillation of cooperator density.

Optimal convergence in naming game with geography-based negotiation on small-world networks

NASA Astrophysics Data System (ADS)

Liu, Run-Ran; Wang, Wen-Xu; Lai, Ying-Cheng; Chen, Guanrong; Wang, Bing-Hong

2011-01-01

We propose a negotiation strategy to address the effect of geography on the dynamics of naming games over small-world networks. Communication and negotiation frequencies between two agents are determined by their geographical distance in terms of a parameter characterizing the correlation between interaction strength and the distance. A finding is that there exists an optimal parameter value leading to fastest convergence to global consensus on naming. Numerical computations and a theoretical analysis are provided to substantiate our findings.

Dynamic range in small-world networks of Hodgkin-Huxley neurons with chemical synapses

NASA Astrophysics Data System (ADS)

Batista, C. A. S.; Viana, R. L.; Lopes, S. R.; Batista, A. M.

2014-09-01

According to Stevens' law the relationship between stimulus and response is a power-law within an interval called the dynamic range. The dynamic range of sensory organs is found to be larger than that of a single neuron, suggesting that the network structure plays a key role in the behavior of both the scaling exponent and the dynamic range of neuron assemblies. In order to verify computationally the relationships between stimulus and response for spiking neurons, we investigate small-world networks of neurons described by the Hodgkin-Huxley equations connected by chemical synapses. We found that the dynamic range increases with the network size, suggesting that the enhancement of the dynamic range observed in sensory organs, with respect to single neurons, is an emergent property of complex network dynamics.

Insight to the express transport network

NASA Astrophysics Data System (ADS)

Yang, Hua; Nie, Yuchao; Zhang, Hongbin; Di, Zengru; Fan, Ying

2009-09-01

The express delivery industry is developing rapidly in recent years and has attracted attention in many fields. Express shipment service requires that parcels be delivered in a limited time with a low operation cost, which requests a high level and efficient express transport network (ETN). The ETN is constructed based on the public transport networks, especially the airline network. It is similar to the airline network in some aspects, while it has its own feature. With the complex network theory, the topological properties of the ETN are analyzed deeply. We find that the ETN has the small-world property, with disassortative mixing behavior and rich club phenomenon. It also shows difference from the airline network in some features, such as edge density and average shortest path. Analysis on the corresponding distance-weighted network shows that the distance distribution displays a truncated power-law behavior. At last, an evolving model, which takes both geographical constraint and preference attachment into account, is proposed. The model shows similar properties with the empirical results.

The correlation of metrics in complex networks with applications in functional brain networks

NASA Astrophysics Data System (ADS)

Li, C.; Wang, H.; de Haan, W.; Stam, C. J.; Van Mieghem, P.

2011-11-01

An increasing number of network metrics have been applied in network analysis. If metric relations were known better, we could more effectively characterize networks by a small set of metrics to discover the association between network properties/metrics and network functioning. In this paper, we investigate the linear correlation coefficients between widely studied network metrics in three network models (Bárabasi-Albert graphs, Erdös-Rényi random graphs and Watts-Strogatz small-world graphs) as well as in functional brain networks of healthy subjects. The metric correlations, which we have observed and theoretically explained, motivate us to propose a small representative set of metrics by including only one metric from each subset of mutually strongly dependent metrics. The following contributions are considered important. (a) A network with a given degree distribution can indeed be characterized by a small representative set of metrics. (b) Unweighted networks, which are obtained from weighted functional brain networks with a fixed threshold, and Erdös-Rényi random graphs follow a similar degree distribution. Moreover, their metric correlations and the resultant representative metrics are similar as well. This verifies the influence of degree distribution on metric correlations. (c) Most metric correlations can be explained analytically. (d) Interestingly, the most studied metrics so far, the average shortest path length and the clustering coefficient, are strongly correlated and, thus, redundant. Whereas spectral metrics, though only studied recently in the context of complex networks, seem to be essential in network characterizations. This representative set of metrics tends to both sufficiently and effectively characterize networks with a given degree distribution. In the study of a specific network, however, we have to at least consider the representative set so that important network properties will not be neglected.

Isles within islets: The lattice origin of small-world networks in pancreatic tissues

NASA Astrophysics Data System (ADS)

Barua, Amlan K.; Goel, Pranay

2016-02-01

The traditional computational model of the pancreatic islets of Langerhans is a lattice of β-cells connected with gap junctions. Numerous studies have investigated the behavior of networks of coupled β-cells and have shown that gap junctions synchronize bursting strongly. This simplistic architecture of islets, however, seems increasingly untenable at the face of recent experimental advances. In a microfluidics experiment on isolated islets, Rocheleau et al. (2004) showed a failure of penetration of excitation when one end received high glucose and other end was not excited sufficiently; this suggested that gap junctions may not be efficient at inducing synchrony throughout the islet. Recently, Stozer et al. (2013) have argued that the functional networks of β-cells in an islet are small world. Their results implicate the existence of a few long-range connections among cells in the network. The physiological reason underlying this claim is not well understood. These studies cast doubt on the original lattice model that largely predict an all-or-none synchrony among the cells. Here we have attempted to reconcile these observations in a unified framework. We assume that cells in the islet are coupled randomly to their nearest neighbors with some probability, p. We simulated detailed β-cell bursting in such islets. By varying p systematically we were led to network parameters similar to those obtained by Stozer et al. (2013). We find that the networks within islets break up into components giving rise to smaller isles within the super structure-isles-within-islets, as it were. This structure can also account for the partial excitation seen by Rocheleau et al. (2004). Our updated view of islet architecture thus explains the paradox how islets can have strongly synchronizing gap junctions, and be weakly coordinated at the same time.

Benchmarking Measures of Network Controllability on Canonical Graph Models

NASA Astrophysics Data System (ADS)

Wu-Yan, Elena; Betzel, Richard F.; Tang, Evelyn; Gu, Shi; Pasqualetti, Fabio; Bassett, Danielle S.

2018-03-01

The control of networked dynamical systems opens the possibility for new discoveries and therapies in systems biology and neuroscience. Recent theoretical advances provide candidate mechanisms by which a system can be driven from one pre-specified state to another, and computational approaches provide tools to test those mechanisms in real-world systems. Despite already having been applied to study network systems in biology and neuroscience, the practical performance of these tools and associated measures on simple networks with pre-specified structure has yet to be assessed. Here, we study the behavior of four control metrics (global, average, modal, and boundary controllability) on eight canonical graphs (including Erdős-Rényi, regular, small-world, random geometric, Barábasi-Albert preferential attachment, and several modular networks) with different edge weighting schemes (Gaussian, power-law, and two nonparametric distributions from brain networks, as examples of real-world systems). We observe that differences in global controllability across graph models are more salient when edge weight distributions are heavy-tailed as opposed to normal. In contrast, differences in average, modal, and boundary controllability across graph models (as well as across nodes in the graph) are more salient when edge weight distributions are less heavy-tailed. Across graph models and edge weighting schemes, average and modal controllability are negatively correlated with one another across nodes; yet, across graph instances, the relation between average and modal controllability can be positive, negative, or nonsignificant. Collectively, these findings demonstrate that controllability statistics (and their relations) differ across graphs with different topologies and that these differences can be muted or accentuated by differences in the edge weight distributions. More generally, our numerical studies motivate future analytical efforts to better understand the mathematical underpinnings of the relationship between graph topology and control, as well as efforts to design networks with specific control profiles.

Effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks

NASA Astrophysics Data System (ADS)

Sun, Xiaojuan; Perc, Matjaž; Kurths, Jürgen

2017-05-01

In this paper, we study effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks. Our focus is on the impact of two parameters, namely the time delay τ and the probability of partial time delay pdelay, whereby the latter determines the probability with which a connection between two neurons is delayed. Our research reveals that partial time delays significantly affect phase synchronization in this system. In particular, partial time delays can either enhance or decrease phase synchronization and induce synchronization transitions with changes in the mean firing rate of neurons, as well as induce switching between synchronized neurons with period-1 firing to synchronized neurons with period-2 firing. Moreover, in comparison to a neuronal network where all connections are delayed, we show that small partial time delay probabilities have especially different influences on phase synchronization of neuronal networks.

Effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks.

PubMed

Sun, Xiaojuan; Perc, Matjaž; Kurths, Jürgen

2017-05-01

In this paper, we study effects of partial time delays on phase synchronization in Watts-Strogatz small-world neuronal networks. Our focus is on the impact of two parameters, namely the time delay τ and the probability of partial time delay p delay , whereby the latter determines the probability with which a connection between two neurons is delayed. Our research reveals that partial time delays significantly affect phase synchronization in this system. In particular, partial time delays can either enhance or decrease phase synchronization and induce synchronization transitions with changes in the mean firing rate of neurons, as well as induce switching between synchronized neurons with period-1 firing to synchronized neurons with period-2 firing. Moreover, in comparison to a neuronal network where all connections are delayed, we show that small partial time delay probabilities have especially different influences on phase synchronization of neuronal networks.

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

PubMed

Gafarov, F M; Gafarova, V R

2016-09-01

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

A swarm intelligence framework for reconstructing gene networks: searching for biologically plausible architectures.

PubMed

Kentzoglanakis, Kyriakos; Poole, Matthew

2012-01-01

In this paper, we investigate the problem of reverse engineering the topology of gene regulatory networks from temporal gene expression data. We adopt a computational intelligence approach comprising swarm intelligence techniques, namely particle swarm optimization (PSO) and ant colony optimization (ACO). In addition, the recurrent neural network (RNN) formalism is employed for modeling the dynamical behavior of gene regulatory systems. More specifically, ACO is used for searching the discrete space of network architectures and PSO for searching the corresponding continuous space of RNN model parameters. We propose a novel solution construction process in the context of ACO for generating biologically plausible candidate architectures. The objective is to concentrate the search effort into areas of the structure space that contain architectures which are feasible in terms of their topological resemblance to real-world networks. The proposed framework is initially applied to the reconstruction of a small artificial network that has previously been studied in the context of gene network reverse engineering. Subsequently, we consider an artificial data set with added noise for reconstructing a subnetwork of the genetic interaction network of S. cerevisiae (yeast). Finally, the framework is applied to a real-world data set for reverse engineering the SOS response system of the bacterium Escherichia coli. Results demonstrate the relative advantage of utilizing problem-specific knowledge regarding biologically plausible structural properties of gene networks over conducting a problem-agnostic search in the vast space of network architectures.

Scale-Free Distribution of Avian Influenza Outbreaks

NASA Astrophysics Data System (ADS)

Small, Michael; Walker, David M.; Tse, Chi Kong

2007-11-01

Using global case data for the period from 25 November 2003 to 10 March 2007, we construct a network of plausible transmission pathways for the spread of avian influenza among domestic and wild birds. The network structure we obtain is complex and exhibits scale-free (although not necessarily small-world) properties. Communities within this network are connected with a distribution of links with infinite variance. Hence, the disease transmission model does not exhibit a threshold and so the infection will continue to propagate even with very low transmissibility. Consequentially, eradication with methods applicable to locally homogeneous populations is not possible. Any control measure needs to focus explicitly on the hubs within this network structure.

Hybrid modeling and empirical analysis of automobile supply chain network

NASA Astrophysics Data System (ADS)

Sun, Jun-yan; Tang, Jian-ming; Fu, Wei-ping; Wu, Bing-ying

2017-05-01

Based on the connection mechanism of nodes which automatically select upstream and downstream agents, a simulation model for dynamic evolutionary process of consumer-driven automobile supply chain is established by integrating ABM and discrete modeling in the GIS-based map. Firstly, the rationality is proved by analyzing the consistency of sales and changes in various agent parameters between the simulation model and a real automobile supply chain. Second, through complex network theory, hierarchical structures of the model and relationships of networks at different levels are analyzed to calculate various characteristic parameters such as mean distance, mean clustering coefficients, and degree distributions. By doing so, it verifies that the model is a typical scale-free network and small-world network. Finally, the motion law of this model is analyzed from the perspective of complex self-adaptive systems. The chaotic state of the simulation system is verified, which suggests that this system has typical nonlinear characteristics. This model not only macroscopically illustrates the dynamic evolution of complex networks of automobile supply chain but also microcosmically reflects the business process of each agent. Moreover, the model construction and simulation of the system by means of combining CAS theory and complex networks supplies a novel method for supply chain analysis, as well as theory bases and experience for supply chain analysis of auto companies.

Focus-based filtering + clustering technique for power-law networks with small world phenomenon

NASA Astrophysics Data System (ADS)

Boutin, François; Thièvre, Jérôme; Hascoët, Mountaz

2006-01-01

Realistic interaction networks usually present two main properties: a power-law degree distribution and a small world behavior. Few nodes are linked to many nodes and adjacent nodes are likely to share common neighbors. Moreover, graph structure usually presents a dense core that is difficult to explore with classical filtering and clustering techniques. In this paper, we propose a new filtering technique accounting for a user-focus. This technique extracts a tree-like graph with also power-law degree distribution and small world behavior. Resulting structure is easily drawn with classical force-directed drawing algorithms. It is also quickly clustered and displayed into a multi-level silhouette tree (MuSi-Tree) from any user-focus. We built a new graph filtering + clustering + drawing API and report a case study.

Small-world behaviour in a system of mobile elements

NASA Astrophysics Data System (ADS)

Manrubia, S. C.; Delgado, J.; Luque, B.

2001-03-01

We analyze the propagation of activity in a system of mobile automata. A number ρLd of elements move as random walkers on a lattice of dimension d, while with a small probability p they can jump to any empty site in the system. We show that this system behaves as a Dynamic Small World (DSW) and present analytic and numerical results for several quantities. Our analysis shows that the persistence time T* (equivalent to the persistence size L* of small-world networks) scales as T* ~ (ρp)-τ, with τ = 1/(d + 1).

Classification of complex networks based on similarity of topological network features

NASA Astrophysics Data System (ADS)

Attar, Niousha; Aliakbary, Sadegh

2017-09-01

Over the past few decades, networks have been widely used to model real-world phenomena. Real-world networks exhibit nontrivial topological characteristics and therefore, many network models are proposed in the literature for generating graphs that are similar to real networks. Network models reproduce nontrivial properties such as long-tail degree distributions or high clustering coefficients. In this context, we encounter the problem of selecting the network model that best fits a given real-world network. The need for a model selection method reveals the network classification problem, in which a target-network is classified into one of the candidate network models. In this paper, we propose a novel network classification method which is independent of the network size and employs an alignment-free metric of network comparison. The proposed method is based on supervised machine learning algorithms and utilizes the topological similarities of networks for the classification task. The experiments show that the proposed method outperforms state-of-the-art methods with respect to classification accuracy, time efficiency, and robustness to noise.

Price Formation Based on Particle-Cluster Aggregation

NASA Astrophysics Data System (ADS)

Wang, Shijun; Zhang, Changshui

In the present work, we propose a microscopic model of financial markets based on particle-cluster aggregation on a two-dimensional small-world information network in order to simulate the dynamics of the stock markets. "Stylized facts" of the financial market time series, such as fat-tail distribution of returns, volatility clustering and multifractality, are observed in the model. The results of the model agree with empirical data taken from historical records of the daily closures of the NYSE composite index.

Emergence of scale-free characteristics in socio-ecological systems with bounded rationality

PubMed Central

Kasthurirathna, Dharshana; Piraveenan, Mahendra

2015-01-01

Socio–ecological systems are increasingly modelled by games played on complex networks. While the concept of Nash equilibrium assumes perfect rationality, in reality players display heterogeneous bounded rationality. Here we present a topological model of bounded rationality in socio-ecological systems, using the rationality parameter of the Quantal Response Equilibrium. We argue that system rationality could be measured by the average Kullback–-Leibler divergence between Nash and Quantal Response Equilibria, and that the convergence towards Nash equilibria on average corresponds to increased system rationality. Using this model, we show that when a randomly connected socio-ecological system is topologically optimised to converge towards Nash equilibria, scale-free and small world features emerge. Therefore, optimising system rationality is an evolutionary reason for the emergence of scale-free and small-world features in socio-ecological systems. Further, we show that in games where multiple equilibria are possible, the correlation between the scale-freeness of the system and the fraction of links with multiple equilibria goes through a rapid transition when the average system rationality increases. Our results explain the influence of the topological structure of socio–ecological systems in shaping their collective cognitive behaviour, and provide an explanation for the prevalence of scale-free and small-world characteristics in such systems. PMID:26065713

Emergence of scale-free characteristics in socio-ecological systems with bounded rationality.

PubMed

Kasthurirathna, Dharshana; Piraveenan, Mahendra

2015-06-11

Socio-ecological systems are increasingly modelled by games played on complex networks. While the concept of Nash equilibrium assumes perfect rationality, in reality players display heterogeneous bounded rationality. Here we present a topological model of bounded rationality in socio-ecological systems, using the rationality parameter of the Quantal Response Equilibrium. We argue that system rationality could be measured by the average Kullback--Leibler divergence between Nash and Quantal Response Equilibria, and that the convergence towards Nash equilibria on average corresponds to increased system rationality. Using this model, we show that when a randomly connected socio-ecological system is topologically optimised to converge towards Nash equilibria, scale-free and small world features emerge. Therefore, optimising system rationality is an evolutionary reason for the emergence of scale-free and small-world features in socio-ecological systems. Further, we show that in games where multiple equilibria are possible, the correlation between the scale-freeness of the system and the fraction of links with multiple equilibria goes through a rapid transition when the average system rationality increases. Our results explain the influence of the topological structure of socio-ecological systems in shaping their collective cognitive behaviour, and provide an explanation for the prevalence of scale-free and small-world characteristics in such systems.

Exploring the evolution of London's street network in the information space: A dual approach

NASA Astrophysics Data System (ADS)

Masucci, A. Paolo; Stanilov, Kiril; Batty, Michael

2014-01-01

We study the growth of London's street network in its dual representation, as the city has evolved over the past 224 years. The dual representation of a planar graph is a content-based network, where each node is a set of edges of the planar graph and represents a transportation unit in the so-called information space, i.e., the space where information is handled in order to navigate through the city. First, we discuss a novel hybrid technique to extract dual graphs from planar graphs, called the hierarchical intersection continuity negotiation principle. Then we show that the growth of the network can be analytically described by logistic laws and that the topological properties of the network are governed by robust log-normal distributions characterizing the network's connectivity and small-world properties that are consistent over time. Moreover, we find that the double-Pareto-like distributions for the connectivity emerge for major roads and can be modeled via a stochastic content-based network model using simple space-filling principles.

Identifying protein complexes in PPI network using non-cooperative sequential game.

PubMed

Maulik, Ujjwal; Basu, Srinka; Ray, Sumanta

2017-08-21

Identifying protein complexes from protein-protein interaction (PPI) network is an important and challenging task in computational biology as it helps in better understanding of cellular mechanisms in various organisms. In this paper we propose a noncooperative sequential game based model for protein complex detection from PPI network. The key hypothesis is that protein complex formation is driven by mechanism that eventually optimizes the number of interactions within the complex leading to dense subgraph. The hypothesis is drawn from the observed network property named small world. The proposed multi-player game model translates the hypothesis into the game strategies. The Nash equilibrium of the game corresponds to a network partition where each protein either belong to a complex or form a singleton cluster. We further propose an algorithm to find the Nash equilibrium of the sequential game. The exhaustive experiment on synthetic benchmark and real life yeast networks evaluates the structural as well as biological significance of the network partitions.

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

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

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

PubMed

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

2010-03-01

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

A Real-World Network Modeling Project

DTIC Science & Technology

2014-02-12

about the project, which accounts for a third of their class grade. As can be expected, giving substantial weight to the project increases active student...analysis, humanitarian aid warehouses, Israeli traffic analysis, London Olympic Games transport, medical evacuation, Monterey fire department...responsiveness, Monterey Peninsula evacuation, natural gas pipeline transport, rail transport of new cars, ski lifts for Keystone Colorado, small boat attack

The correspondence of Thomas Dale (1700-1750): Botany in the transatlantic Republic of Letters.

PubMed

Cook, William J

2012-03-01

This paper seeks to provide a full account of the life and career of Dr. Thomas Dale (1700-1750), with particular reference to his botanical works and correspondence. Born in Hoxton, London, Dale studied medicine at Leiden and engaged fully in the social, literary and epistolary network in which botany was practised in eighteenth-century England. In 1730, however, Dale relocated to the British colonial port of Charles Town, South Carolina. Here he continued to engage in a transatlantic network of botanical exchange and discussion, corresponding on equal and reciprocal terms with his former colleagues in England. Where Dale differs from naturalists in South Carolina before him is that his motives for pursuing botany and for corresponding with English naturalists were located firmly in the New World. Such a conclusion forms a valuable, albeit small contribution to models for the development of national scientific cultures in the imperial world. Similarly, Dale's pursuit of botanical information in South Carolina provides a small amount of material with which to illustrate currently fashionable models for the mediated exchange and circulation of scientific knowledge. Copyright © 2011 Elsevier Ltd. All rights reserved.

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

PubMed

Liang, Xiaoming; Liu, Zonghua; Li, Baowen

2009-10-01

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

The complexity and robustness of metro networks

NASA Astrophysics Data System (ADS)

Derrible, Sybil; Kennedy, Christopher

2010-09-01

Transportation systems, being real-life examples of networks, are particularly interesting to analyze from the viewpoint of the new and rapidly emerging field of network science. Two particular concepts seem to be particularly relevant: scale-free patterns and small-worlds. By looking at 33 metro systems in the world, this paper adapts network science methodologies to the transportation literature, and offers one application to the robustness of metros; here, metro refers to urban rail transit with exclusive right-of-way, whether it is underground, at grade or elevated. We find that most metros are indeed scale-free (with scaling factors ranging from 2.10 to 5.52) and small-worlds; they show atypical behaviors, however, with increasing size. In particular, the presence of transfer-hubs (stations hosting more than three lines) results in relatively large scaling factors. The analysis provides insights/recommendations for increasing the robustness of metro networks. Smaller networks should focus on creating transfer stations, thus generating cycles to offer alternative routes. For larger networks, few stations seem to detain a certain monopole on transferring, it is therefore important to create additional transfers, possibly at the periphery of city centers; the Tokyo system seems to remarkably incorporate these properties.

Multistability, local pattern formation, and global collective firing in a small-world network of nonleaky integrate-and-fire neurons.

PubMed

Rothkegel, Alexander; Lehnertz, Klaus

2009-03-01

We investigate numerically the collective dynamical behavior of pulse-coupled nonleaky integrate-and-fire neurons that are arranged on a two-dimensional small-world network. To ensure ongoing activity, we impose a probability for spontaneous firing for each neuron. We study network dynamics evolving from different sets of initial conditions in dependence on coupling strength and rewiring probability. Besides a homogeneous equilibrium state for low coupling strength, we observe different local patterns including cyclic waves, spiral waves, and turbulentlike patterns, which-depending on network parameters-interfere with the global collective firing of the neurons. We attribute the various network dynamics to distinct regimes in the parameter space. For the same network parameters different network dynamics can be observed depending on the set of initial conditions only. Such a multistable behavior and the interplay between local pattern formation and global collective firing may be attributable to the spatiotemporal dynamics of biological networks.

Small-world bias of correlation networks: From brain to climate

NASA Astrophysics Data System (ADS)

Hlinka, Jaroslav; Hartman, David; Jajcay, Nikola; Tomeček, David; Tintěra, Jaroslav; Paluš, Milan

2017-03-01

Complex systems are commonly characterized by the properties of their graph representation. Dynamical complex systems are then typically represented by a graph of temporal dependencies between time series of state variables of their subunits. It has been shown recently that graphs constructed in this way tend to have relatively clustered structure, potentially leading to spurious detection of small-world properties even in the case of systems with no or randomly distributed true interactions. However, the strength of this bias depends heavily on a range of parameters and its relevance for real-world data has not yet been established. In this work, we assess the relevance of the bias using two examples of multivariate time series recorded in natural complex systems. The first is the time series of local brain activity as measured by functional magnetic resonance imaging in resting healthy human subjects, and the second is the time series of average monthly surface air temperature coming from a large reanalysis of climatological data over the period 1948-2012. In both cases, the clustering in the thresholded correlation graph is substantially higher compared with a realization of a density-matched random graph, while the shortest paths are relatively short, showing thus distinguishing features of small-world structure. However, comparable or even stronger small-world properties were reproduced in correlation graphs of model processes with randomly scrambled interconnections. This suggests that the small-world properties of the correlation matrices of these real-world systems indeed do not reflect genuinely the properties of the underlying interaction structure, but rather result from the inherent properties of correlation matrix.

Small-world bias of correlation networks: From brain to climate.

PubMed

Hlinka, Jaroslav; Hartman, David; Jajcay, Nikola; Tomeček, David; Tintěra, Jaroslav; Paluš, Milan

2017-03-01

Complex systems are commonly characterized by the properties of their graph representation. Dynamical complex systems are then typically represented by a graph of temporal dependencies between time series of state variables of their subunits. It has been shown recently that graphs constructed in this way tend to have relatively clustered structure, potentially leading to spurious detection of small-world properties even in the case of systems with no or randomly distributed true interactions. However, the strength of this bias depends heavily on a range of parameters and its relevance for real-world data has not yet been established. In this work, we assess the relevance of the bias using two examples of multivariate time series recorded in natural complex systems. The first is the time series of local brain activity as measured by functional magnetic resonance imaging in resting healthy human subjects, and the second is the time series of average monthly surface air temperature coming from a large reanalysis of climatological data over the period 1948-2012. In both cases, the clustering in the thresholded correlation graph is substantially higher compared with a realization of a density-matched random graph, while the shortest paths are relatively short, showing thus distinguishing features of small-world structure. However, comparable or even stronger small-world properties were reproduced in correlation graphs of model processes with randomly scrambled interconnections. This suggests that the small-world properties of the correlation matrices of these real-world systems indeed do not reflect genuinely the properties of the underlying interaction structure, but rather result from the inherent properties of correlation matrix.

Effects of rewiring strategies on information spreading in complex dynamic networks

NASA Astrophysics Data System (ADS)

Ally, Abdulla F.; Zhang, Ning

2018-04-01

Recent advances in networks and communication services have attracted much interest to understand information spreading in social networks. Consequently, numerous studies have been devoted to provide effective and accurate models for mimicking information spreading. However, knowledge on how to spread information faster and more widely remains a contentious issue. Yet, most existing works are based on static networks which limit the reality of dynamism of entities that participate in information spreading. Using the SIR epidemic model, this study explores and compares effects of two rewiring models (Fermi-Dirac and Linear functions) on information spreading in scale free and small world networks. Our results show that for all the rewiring strategies, the spreading influence replenishes with time but stabilizes in a steady state at later time-steps. This means that information spreading takes-off during the initial spreading steps, after which the spreading prevalence settles toward its equilibrium, with majority of the population having recovered and thus, no longer affecting the spreading. Meanwhile, rewiring strategy based on Fermi-Dirac distribution function in one way or another impedes the spreading process, however, the structure of the networks mimic the spreading, even with a low spreading rate. The worst case can be when the spreading rate is extremely small. The results emphasize that despite a big role of such networks in mimicking the spreading, the role of the parameters cannot be simply ignored. Apparently, the probability of giant degree neighbors being informed grows much faster with the rewiring strategy of linear function compared to that of Fermi-Dirac distribution function. Clearly, rewiring model based on linear function generates the fastest spreading across the networks. Therefore, if we are interested in speeding up the spreading process in stochastic modeling, linear function may play a pivotal role.

Efficient Control of Epidemics Spreading on Networks: Balance between Treatment and Recovery

PubMed Central

Oleś, Katarzyna; Gudowska-Nowak, Ewa; Kleczkowski, Adam

2013-01-01

We analyse two models describing disease transmission and control on regular and small-world networks. We use simulations to find a control strategy that minimizes the total cost of an outbreak, thus balancing the costs of disease against that of the preventive treatment. The models are similar in their epidemiological part, but differ in how the removed/recovered individuals are treated. The differences in models affect choice of the strategy only for very cheap treatment and slow spreading disease. However for the combinations of parameters that are important from the epidemiological perspective (high infectiousness and expensive treatment) the models give similar results. Moreover, even where the choice of the strategy is different, the total cost spent on controlling the epidemic is very similar for both models. PMID:23750205

Efficient control of epidemics spreading on networks: balance between treatment and recovery.

PubMed

Oleś, Katarzyna; Gudowska-Nowak, Ewa; Kleczkowski, Adam

2013-01-01

We analyse two models describing disease transmission and control on regular and small-world networks. We use simulations to find a control strategy that minimizes the total cost of an outbreak, thus balancing the costs of disease against that of the preventive treatment. The models are similar in their epidemiological part, but differ in how the removed/recovered individuals are treated. The differences in models affect choice of the strategy only for very cheap treatment and slow spreading disease. However for the combinations of parameters that are important from the epidemiological perspective (high infectiousness and expensive treatment) the models give similar results. Moreover, even where the choice of the strategy is different, the total cost spent on controlling the epidemic is very similar for both models.

Sequential defense against random and intentional attacks in complex networks.

PubMed

Chen, Pin-Yu; Cheng, Shin-Ming

2015-02-01

Network robustness against attacks is one of the most fundamental researches in network science as it is closely associated with the reliability and functionality of various networking paradigms. However, despite the study on intrinsic topological vulnerabilities to node removals, little is known on the network robustness when network defense mechanisms are implemented, especially for networked engineering systems equipped with detection capabilities. In this paper, a sequential defense mechanism is first proposed in complex networks for attack inference and vulnerability assessment, where the data fusion center sequentially infers the presence of an attack based on the binary attack status reported from the nodes in the network. The network robustness is evaluated in terms of the ability to identify the attack prior to network disruption under two major attack schemes, i.e., random and intentional attacks. We provide a parametric plug-in model for performance evaluation on the proposed mechanism and validate its effectiveness and reliability via canonical complex network models and real-world large-scale network topology. The results show that the sequential defense mechanism greatly improves the network robustness and mitigates the possibility of network disruption by acquiring limited attack status information from a small subset of nodes in the network.

Classes of real-world 'small-world' networks: From the neural network of C. Elegans to the web of human sexual contacts

NASA Astrophysics Data System (ADS)

Nunes Amaral, Luis A.

2002-03-01

We study the statistical properties of a variety of diverse real-world networks including the neural network of C. Elegans, food webs for seven distinct environments, transportation and technological networks, and a number of distinct social networks [1-5]. We present evidence of the occurrence of three classes of small-world networks [2]: (a) scale-free networks, characterized by a vertex connectivity distribution that decays as a power law; (b) broad-scale networks, characterized by a connectivity distribution that has a power-law regime followed by a sharp cut-off; (c) single-scale networks, characterized by a connectivity distribution with a fast decaying tail. Moreover, we note for the classes of broad-scale and single-scale networks that there are constraints limiting the addition of new links. Our results suggest that the nature of such constraints may be the controlling factor for the emergence of different classes of networks. [See http://polymer.bu.edu/ amaral/Networks.html for details and htpp://polymer.bu.edu/ amaral/Professional.html for access to PDF files of articles.] 1. M. Barthélémy, L. A. N. Amaral, Phys. Rev. Lett. 82, 3180-3183 (1999). 2. L. A. N. Amaral, A. Scala, M. Barthélémy, H. E. Stanley, Proc. Nat. Acad. Sci. USA 97, 11149-11152 (2000). 3. F. Liljeros, C. R. Edling, L. A. N. Amaral, H. E. Stanley, and Y. Åberg, Nature 411, 907-908 (2001). 4. J. Camacho, R. Guimera, L.A.N. Amaral, Phys. Rev. E RC (to appear). 5. S. Mossa, M. Barthelemy, H.E. Stanley, L.A.N. Amaral (submitted).

Naming Game on Networks: Let Everyone be Both Speaker and Hearer

PubMed Central

Gao, Yuan; Chen, Guanrong; Chan, Rosa H. M.

2014-01-01

To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios. Moreover, NGG allows the transmission (communication) of multiple words (opinions) for multiple intra-group consensuses. The communications among indirectly-connected nodes are also enabled in NGG. We simulated and analyzed the consensus process in some typical network topologies, including random-graph networks, small-world networks and scale-free networks, to better understand how global convergence (consensus) could be reached on one common word. The results are interpreted on group negotiation of a peer-to-peer network, which shows that global consensus in the population can be reached more rapidly when more opinions are permitted within each group or when the negotiating groups in the population are larger in size. The novel features and properties introduced by our model have demonstrated its applicability in better investigating general consensus problems on peer-to-peer networks. PMID:25143140

Naming Game on Networks: Let Everyone be Both Speaker and Hearer

NASA Astrophysics Data System (ADS)

Gao, Yuan; Chen, Guanrong; Chan, Rosa H. M.

2014-08-01

To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios. Moreover, NGG allows the transmission (communication) of multiple words (opinions) for multiple intra-group consensuses. The communications among indirectly-connected nodes are also enabled in NGG. We simulated and analyzed the consensus process in some typical network topologies, including random-graph networks, small-world networks and scale-free networks, to better understand how global convergence (consensus) could be reached on one common word. The results are interpreted on group negotiation of a peer-to-peer network, which shows that global consensus in the population can be reached more rapidly when more opinions are permitted within each group or when the negotiating groups in the population are larger in size. The novel features and properties introduced by our model have demonstrated its applicability in better investigating general consensus problems on peer-to-peer networks.

Cluster-size entropy in the Axelrod model of social influence: Small-world networks and mass media

NASA Astrophysics Data System (ADS)

Gandica, Y.; Charmell, A.; Villegas-Febres, J.; Bonalde, I.

2011-10-01

We study the Axelrod's cultural adaptation model using the concept of cluster-size entropy Sc, which gives information on the variability of the cultural cluster size present in the system. Using networks of different topologies, from regular to random, we find that the critical point of the well-known nonequilibrium monocultural-multicultural (order-disorder) transition of the Axelrod model is given by the maximum of the Sc(q) distributions. The width of the cluster entropy distributions can be used to qualitatively determine whether the transition is first or second order. By scaling the cluster entropy distributions we were able to obtain a relationship between the critical cultural trait qc and the number F of cultural features in two-dimensional regular networks. We also analyze the effect of the mass media (external field) on social systems within the Axelrod model in a square network. We find a partially ordered phase whose largest cultural cluster is not aligned with the external field, in contrast with a recent suggestion that this type of phase cannot be formed in regular networks. We draw a q-B phase diagram for the Axelrod model in regular networks.

Cluster-size entropy in the Axelrod model of social influence: small-world networks and mass media.

PubMed

Gandica, Y; Charmell, A; Villegas-Febres, J; Bonalde, I

2011-10-01

We study the Axelrod's cultural adaptation model using the concept of cluster-size entropy S(c), which gives information on the variability of the cultural cluster size present in the system. Using networks of different topologies, from regular to random, we find that the critical point of the well-known nonequilibrium monocultural-multicultural (order-disorder) transition of the Axelrod model is given by the maximum of the S(c)(q) distributions. The width of the cluster entropy distributions can be used to qualitatively determine whether the transition is first or second order. By scaling the cluster entropy distributions we were able to obtain a relationship between the critical cultural trait q(c) and the number F of cultural features in two-dimensional regular networks. We also analyze the effect of the mass media (external field) on social systems within the Axelrod model in a square network. We find a partially ordered phase whose largest cultural cluster is not aligned with the external field, in contrast with a recent suggestion that this type of phase cannot be formed in regular networks. We draw a q-B phase diagram for the Axelrod model in regular networks.

"Price-quakes" shaking the world's stock exchanges.

PubMed

Andersen, Jørgen Vitting; Nowak, Andrzej; Rotundo, Giulia; Parrott, Lael; Martinez, Sebastian

2011-01-01

Systemic risk has received much more awareness after the excessive risk taking by major financial instituations pushed the world's financial system into what many considered a state of near systemic failure in 2008. The IMF for example in its yearly 2009 Global Financial Stability Report acknowledged the lack of proper tools and research on the topic. Understanding how disruptions can propagate across financial markets is therefore of utmost importance. Here, we use empirical data to show that the world's markets have a non-linear threshold response to events, consistent with the hypothesis that traders exhibit change blindness. Change blindness is the tendency of humans to ignore small changes and to react disproportionately to large events. As we show, this may be responsible for generating cascading events--pricequakes--in the world's markets. We propose a network model of the world's stock exchanges that predicts how an individual stock exchange should be priced in terms of the performance of the global market of exchanges, but with change blindness included in the pricing. The model has a direct correspondence to models of earth tectonic plate movements developed in physics to describe the slip-stick movement of blocks linked via spring forces. We have shown how the price dynamics of the world's stock exchanges follows a dynamics of build-up and release of stress, similar to earthquakes. The nonlinear response allows us to classify price movements of a given stock index as either being generated internally, due to specific economic news for the country in question, or externally, by the ensemble of the world's stock exchanges reacting together like a complex system. The model may provide new insight into the origins and thereby also prevent systemic risks in the global financial network.

“Price-Quakes” Shaking the World's Stock Exchanges

PubMed Central

Andersen, Jørgen Vitting; Nowak, Andrzej; Rotundo, Giulia; Parrott, Lael; Martinez, Sebastian

2011-01-01

Background Systemic risk has received much more awareness after the excessive risk taking by major financial instituations pushed the world's financial system into what many considered a state of near systemic failure in 2008. The IMF for example in its yearly 2009 Global Financial Stability Report acknowledged the lack of proper tools and research on the topic. Understanding how disruptions can propagate across financial markets is therefore of utmost importance. Methodology/Principal Findings Here, we use empirical data to show that the world's markets have a non-linear threshold response to events, consistent with the hypothesis that traders exhibit change blindness. Change blindness is the tendency of humans to ignore small changes and to react disproportionately to large events. As we show, this may be responsible for generating cascading events—pricequakes—in the world's markets. We propose a network model of the world's stock exchanges that predicts how an individual stock exchange should be priced in terms of the performance of the global market of exchanges, but with change blindness included in the pricing. The model has a direct correspondence to models of earth tectonic plate movements developed in physics to describe the slip-stick movement of blocks linked via spring forces. Conclusions/Significance We have shown how the price dynamics of the world's stock exchanges follows a dynamics of build-up and release of stress, similar to earthquakes. The nonlinear response allows us to classify price movements of a given stock index as either being generated internally, due to specific economic news for the country in question, or externally, by the ensemble of the world's stock exchanges reacting together like a complex system. The model may provide new insight into the origins and thereby also prevent systemic risks in the global financial network. PMID:22073168

Measuring the value of accurate link prediction for network seeding.

PubMed

Wei, Yijin; Spencer, Gwen

2017-01-01

The influence-maximization literature seeks small sets of individuals whose structural placement in the social network can drive large cascades of behavior. Optimization efforts to find the best seed set often assume perfect knowledge of the network topology. Unfortunately, social network links are rarely known in an exact way. When do seeding strategies based on less-than-accurate link prediction provide valuable insight? We introduce optimized-against-a-sample ([Formula: see text]) performance to measure the value of optimizing seeding based on a noisy observation of a network. Our computational study investigates [Formula: see text] under several threshold-spread models in synthetic and real-world networks. Our focus is on measuring the value of imprecise link information. The level of investment in link prediction that is strategic appears to depend closely on spread model: in some parameter ranges investments in improving link prediction can pay substantial premiums in cascade size. For other ranges, such investments would be wasted. Several trends were remarkably consistent across topologies.

An Adaptive Complex Network Model for Brain Functional Networks

PubMed Central

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

2009-01-01

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

Naming Game with Multiple Hearers

NASA Astrophysics Data System (ADS)

Li, Bing; Chen, Guanrong; Chow, Tommy W. S.

2013-05-01

A new model called Naming Game with Multiple Hearers (NGMH) is proposed in this paper. A naming game over a population of individuals aims to reach consensus on the name of an object through pair-wise local interactions among all the individuals. The proposed NGMH model describes the learning process of a new word, in a population with one speaker and multiple hearers, at each interaction towards convergence. The characteristics of NGMH are examined on three types of network topologies, namely ER random-graph network, WS small-world network, and BA scale-free network. Comparative analysis on the convergence time is performed, revealing that the topology with a larger average (node) degree can reach consensus faster than the others over the same population. It is found that, for a homogeneous network, the average degree is the limiting value of the number of hearers, which reduces the individual ability of learning new words, consequently decreasing the convergence time; for a scale-free network, this limiting value is the deviation of the average degree. It is also found that a network with a larger clustering coefficient takes longer time to converge; especially a small-word network with smallest rewiring possibility takes longest time to reach convergence. As more new nodes are being added to scale-free networks with different degree distributions, their convergence time appears to be robust against the network-size variation. Most new findings reported in this paper are different from that of the single-speaker/single-hearer naming games documented in the literature.

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

PubMed

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

2015-03-01

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

[Stochastic model of infectious diseases transmission].

PubMed

Ruiz-Ramírez, Juan; Hernández-Rodríguez, Gabriela Eréndira

2009-01-01

Propose a mathematic model that shows how population structure affects the size of infectious disease epidemics. This study was conducted during 2004 at the University of Colima. It used generalized small-world network topology to represent contacts that occurred within and between families. To that end, two programs in MATLAB were conducted to calculate the efficiency of the network. The development of a program in the C programming language was also required, that represents the stochastic susceptible-infectious-removed model, and simultaneous results were obtained for the number of infected people. An increased number of families connected by meeting sites impacted the size of the infectious diseases by roughly 400%. Population structure influences the rapid spread of infectious diseases, reaching epidemic effects.

Scientific authorship and collaboration network analysis on malaria research in Benin: papers indexed in the web of science (1996-2016).

PubMed

Azondekon, Roseric; Harper, Zachary James; Agossa, Fiacre Rodrigue; Welzig, Charles Michael; McRoy, Susan

2018-01-01

To sustain the critical progress made, prioritization and a multidisciplinary approach to malaria research remain important to the national malaria control program in Benin. To document the structure of the malaria collaborative research in Benin, we analyze authorship of the scientific documents published on malaria from Benin. We collected bibliographic data from the Web Of Science on malaria research in Benin from January 1996 to December 2016. From the collected data, a mulitigraph co-authorship network with authors representing vertices was generated. An edge was drawn between two authors when they co-author a paper. We computed vertex degree, betweenness, closeness, and eigenvectors among others to identify prolific authors. We further assess the weak points and how information flow in the network. Finally, we perform a hierarchical clustering analysis, and Monte-Carlo simulations. Overall, 427 publications were included in this study. The generated network contained 1792 authors and 116,388 parallel edges which converted in a weighted graph of 1792 vertices and 95,787 edges. Our results suggested that prolific authors with higher degrees tend to collaborate more. The hierarchical clustering revealed 23 clusters, seven of which form a giant component containing 94% of all the vertices in the network. This giant component has all the characteristics of a small-world network with a small shortest path distance between pairs of three, a diameter of 10 and a high clustering coefficient of 0.964. However, Monte-Carlo simulations suggested our observed network is an unusual type of small-world network. Sixteen vertices were identified as weak articulation points within the network. The malaria research collaboration network in Benin is a complex network that seems to display the characteristics of a small-world network. This research reveals the presence of closed research groups where collaborative research likely happens only between members. Interdisciplinary collaboration tends to occur at higher levels between prolific researchers. Continuously supporting, stabilizing the identified key brokers and most productive authors in the Malaria research collaborative network is an urgent need in Benin. It will foster the malaria research network and ensure the promotion of junior scientists in the field.

Structural connectivity in schizophrenia and its impact on the dynamics of spontaneous functional networks

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

Cabral, Joana; Department of Psychiatry, University of Oxford, Oxford OX3 7JX; Fernandes, Henrique M.

The neuropathology of schizophrenia remains unclear. Some insight has come from modern neuroimaging techniques, which offer an unparalleled opportunity to explore in vivo the structure and function of the brain. Using functional magnetic resonance imaging, it has been found that the large-scale resting-state functional connectivity (rsFC) in schizophrenia — measured as the temporal correlations of the blood-oxygen-level-dependent (BOLD) signal — exhibit altered network topology, with lower small-world index. The origin of these rsFC alterations and link with the underlying structural connectivity remain unclear. In this work, we used a computational model of spontaneous large-scale brain activity to explore the rolemore » of the structural connectivity in the large-scale dynamics of the brain in health and schizophrenia. The structural connectomes from 15 adolescent patients with early-onset schizophrenia and 15 age- and gender-matched controls were built from diffusion tensor imaging data to detect the white matter tracts between 90 brain areas. Brain areas, simulated using a reduced dynamic mean-field model, receive excitatory input from other areas in proportion to the number of fibre tracts between them. The simulated mean field activity was transformed into BOLD signal, and the properties of the simulated functional networks were analyzed. Our results suggest that the functional alterations observed in schizophrenia are not directly linked to alterations in the structural topology. Instead, subtly randomized and less small-world functional networks appear when the brain operates with lower global coupling, which shifts the dynamics from the optimal healthy regime.« less

Structural connectivity in schizophrenia and its impact on the dynamics of spontaneous functional networks

NASA Astrophysics Data System (ADS)

Cabral, Joana; Fernandes, Henrique M.; Van Hartevelt, Tim J.; James, Anthony C.; Kringelbach, Morten L.; Deco, Gustavo

2013-12-01

The neuropathology of schizophrenia remains unclear. Some insight has come from modern neuroimaging techniques, which offer an unparalleled opportunity to explore in vivo the structure and function of the brain. Using functional magnetic resonance imaging, it has been found that the large-scale resting-state functional connectivity (rsFC) in schizophrenia — measured as the temporal correlations of the blood-oxygen-level-dependent (BOLD) signal — exhibit altered network topology, with lower small-world index. The origin of these rsFC alterations and link with the underlying structural connectivity remain unclear. In this work, we used a computational model of spontaneous large-scale brain activity to explore the role of the structural connectivity in the large-scale dynamics of the brain in health and schizophrenia. The structural connectomes from 15 adolescent patients with early-onset schizophrenia and 15 age- and gender-matched controls were built from diffusion tensor imaging data to detect the white matter tracts between 90 brain areas. Brain areas, simulated using a reduced dynamic mean-field model, receive excitatory input from other areas in proportion to the number of fibre tracts between them. The simulated mean field activity was transformed into BOLD signal, and the properties of the simulated functional networks were analyzed. Our results suggest that the functional alterations observed in schizophrenia are not directly linked to alterations in the structural topology. Instead, subtly randomized and less small-world functional networks appear when the brain operates with lower global coupling, which shifts the dynamics from the optimal healthy regime.

Network analysis of translocated Takahe populations to identify disease surveillance targets.

PubMed

Grange, Zoë L; VAN Andel, Mary; French, Nigel P; Gartrell, Brett D

2014-04-01

Social network analysis is being increasingly used in epidemiology and disease modeling in humans, domestic animals, and wildlife. We investigated this tool in describing a translocation network (area that allows movement of animals between geographically isolated locations) used for the conservation of an endangered flightless rail, the Takahe (Porphyrio hochstetteri). We collated records of Takahe translocations within New Zealand and used social network principles to describe the connectivity of the translocation network. That is, networks were constructed and analyzed using adjacency matrices with values based on the tie weights between nodes. Five annual network matrices were created using the Takahe data set, each incremental year included records of previous years. Weights of movements between connected locations were assigned by the number of Takahe moved. We calculated the number of nodes (i(total)) and the number of ties (t(total)) between the nodes. To quantify the small-world character of the networks, we compared the real networks to random graphs of the equivalent size, weighting, and node strength. Descriptive analysis of cumulative annual Takahe movement networks involved determination of node-level characteristics, including centrality descriptors of relevance to disease modeling such as weighted measures of in degree (k(i)(in)), out degree (k(i)(out)), and betweenness (B(i)). Key players were assigned according to the highest node measure of k(i)(in), k(i)(out), and B(i) per network. Networks increased in size throughout the time frame considered. The network had some degree small-world characteristics. Nodes with the highest cumulative tie weights connecting them were the captive breeding center, the Murchison Mountains and 2 offshore islands. The key player fluctuated between the captive breeding center and the Murchison Mountains. The cumulative networks identified the captive breeding center every year as the hub of the network until the final network in 2011. Likewise, the wild Murchison Mountains population was consistently the sink of the network. Other nodes, such as the offshore islands and the wildlife hospital, varied in importance over time. Common network descriptors and measures of centrality identified key locations for targeting disease surveillance. The visual representation of movements of animals in a population that this technique provides can aid decision makers when they evaluate translocation proposals or attempt to control a disease outbreak. © 2014 Society for Conservation Biology.

Effects of channel noise on firing coherence of small-world Hodgkin-Huxley neuronal networks

NASA Astrophysics Data System (ADS)

Sun, X. J.; Lei, J. Z.; Perc, M.; Lu, Q. S.; Lv, S. J.

2011-01-01

We investigate the effects of channel noise on firing coherence of Watts-Strogatz small-world networks consisting of biophysically realistic HH neurons having a fraction of blocked voltage-gated sodium and potassium ion channels embedded in their neuronal membranes. The intensity of channel noise is determined by the number of non-blocked ion channels, which depends on the fraction of working ion channels and the membrane patch size with the assumption of homogeneous ion channel density. We find that firing coherence of the neuronal network can be either enhanced or reduced depending on the source of channel noise. As shown in this paper, sodium channel noise reduces firing coherence of neuronal networks; in contrast, potassium channel noise enhances it. Furthermore, compared with potassium channel noise, sodium channel noise plays a dominant role in affecting firing coherence of the neuronal network. Moreover, we declare that the observed phenomena are independent of the rewiring probability.

Studies of Opinion Stability for Small Dynamic Networks with Opportunistic Agents

NASA Astrophysics Data System (ADS)

Sobkowicz, Pawel

There are numerous examples of societies with extremely stable mix of contrasting opinions. We argue that this stability is a result of an interplay between society network topology adjustment and opinion changing processes. To support this position we present a computer model of opinion formation based on some novel assumptions, designed to bring the model closer to social reality. In our model, the agents, in addition to changing their opinions due to influence of the rest of society and external propaganda, have the ability to modify their social network, forming links with agents sharing the same opinions and cutting the links with those they disagree with. To improve the model further we divide the agents into "fanatics" and "opportunists," depending on how easy it is to change their opinions. The simulations show significant differences compared to traditional models, where network links are static. In particular, for the dynamical model where inter-agent links are adjustable, the final network structure and opinion distribution is shown to resemble real world observations, such as social structures and persistence of minority groups even when most of the society is against them and the propaganda is strong.

Competition between Homophily and Information Entropy Maximization in Social Networks

PubMed Central

Zhao, Jichang; Liang, Xiao; Xu, Ke

2015-01-01

In social networks, it is conventionally thought that two individuals with more overlapped friends tend to establish a new friendship, which could be stated as homophily breeding new connections. While the recent hypothesis of maximum information entropy is presented as the possible origin of effective navigation in small-world networks. We find there exists a competition between information entropy maximization and homophily in local structure through both theoretical and experimental analysis. This competition suggests that a newly built relationship between two individuals with more common friends would lead to less information entropy gain for them. We demonstrate that in the evolution of the social network, both of the two assumptions coexist. The rule of maximum information entropy produces weak ties in the network, while the law of homophily makes the network highly clustered locally and the individuals would obtain strong and trust ties. A toy model is also presented to demonstrate the competition and evaluate the roles of different rules in the evolution of real networks. Our findings could shed light on the social network modeling from a new perspective. PMID:26334994

Functional disorganization of small-world brain networks in mild Alzheimer's Disease and amnestic Mild Cognitive Impairment: an EEG study using Relative Wavelet Entropy (RWE).

PubMed

Frantzidis, Christos A; Vivas, Ana B; Tsolaki, Anthoula; Klados, Manousos A; Tsolaki, Magda; Bamidis, Panagiotis D

2014-01-01

Previous neuroscientific findings have linked Alzheimer's Disease (AD) with less efficient information processing and brain network disorganization. However, pathological alterations of the brain networks during the preclinical phase of amnestic Mild Cognitive Impairment (aMCI) remain largely unknown. The present study aimed at comparing patterns of the detection of functional disorganization in MCI relative to Mild Dementia (MD). Participants consisted of 23 cognitively healthy adults, 17 aMCI and 24 mild AD patients who underwent electroencephalographic (EEG) data acquisition during a resting-state condition. Synchronization analysis through the Orthogonal Discrete Wavelet Transform (ODWT), and directional brain network analysis were applied on the EEG data. This computational model was performed for networks that have the same number of edges (N = 500, 600, 700, 800 edges) across all participants and groups (fixed density values). All groups exhibited a small-world (SW) brain architecture. However, we found a significant reduction in the SW brain architecture in both aMCI and MD patients relative to the group of Healthy controls. This functional disorganization was also correlated with the participant's generic cognitive status. The deterioration of the network's organization was caused mainly by deficient local information processing as quantified by the mean cluster coefficient value. Functional hubs were identified through the normalized betweenness centrality metric. Analysis of the local characteristics showed relative hub preservation even with statistically significant reduced strength. Compensatory phenomena were also evident through the formation of additional hubs on left frontal and parietal regions. Our results indicate a declined functional network organization even during the prodromal phase. Degeneration is evident even in the preclinical phase and coexists with transient network reorganization due to compensation.

Scale-free models for the structure of business firm networks

NASA Astrophysics Data System (ADS)

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

2010-03-01

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

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

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

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

Learning and innovative elements of strategy adoption rules expand cooperative network topologies.

PubMed

Wang, Shijun; Szalay, Máté S; Zhang, Changshui; Csermely, Peter

2008-04-09

Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains rather stable by applying the reinforcement learning strategy adoption rule, Q-learning on a variety of random, regular, small-word, scale-free and modular network models in repeated, multi-agent Prisoner's Dilemma and Hawk-Dove games. Furthermore, we found that using the above model systems other long-term learning strategy adoption rules also promote cooperation, while introducing a low level of noise (as a model of innovation) to the strategy adoption rules makes the level of cooperation less dependent on the actual network topology. Our results demonstrate that long-term learning and random elements in the strategy adoption rules, when acting together, extend the range of network topologies enabling the development of cooperation at a wider range of costs and temptations. These results suggest that a balanced duo of learning and innovation may help to preserve cooperation during the re-organization of real-world networks, and may play a prominent role in the evolution of self-organizing, complex systems.

Is there any connection between the network morphology and the fluctuations of the stock market index?

NASA Astrophysics Data System (ADS)

Stefan, F. M.; Atman, A. P. F.

2015-02-01

Models which consider behavioral aspects of the investors have attracted increasing interest in the Finance and Econophysics literature in the last years. Different behavioral profiles (imitation, anti-imitation, indifference) were proposed for the investors, which take their decision based on their trust network (neighborhood). Results from agent-based models have shown that most of the features observed in actual stock market indices can be replicated in simulations. Here, we present a deeper investigation of an agent based model considering different network morphologies (regular, random, small-world) for the investors' trust network, in an attempt to answer the question raised in the title. We study the model by considering four scenarios for the investors and different initial conditions to analyze their influence in the stock market fluctuations. We have characterized the stationary limit for each scenario tested, focusing on the changes introduced when complex networks were used, and calculated the Hurst exponent in some cases. Simulations showed interesting results suggesting that the fluctuations of the stock market index are strongly affected by the network morphology, a remarkable result which we believe was never reported or predicted before.

Stability and dynamical properties of material flow systems on random networks

NASA Astrophysics Data System (ADS)

Anand, K.; Galla, T.

2009-04-01

The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are characteristic of flow networks in economic, ecological and biological systems. Based on results from random matrix theory, we work out the phase diagram of such systems defined on extensively connected random graphs, and study in detail how the choice of control policies and the network structure affects stability. We also present results for more complex topologies of the underlying graph, focussing on finitely connected Erdös-Réyni graphs, Small-World Networks and Barabási-Albert scale-free networks. Results indicate that variability of input-output matrix elements, and random structures of the underlying graph tend to make the system less stable, while fast price dynamics or strong responsiveness to stock accumulation promote stability.

Experimental and computational analysis of a large protein network that controls fat storage reveals the design principles of a signaling network.

PubMed

Al-Anzi, Bader; Arpp, Patrick; Gerges, Sherif; Ormerod, Christopher; Olsman, Noah; Zinn, Kai

2015-05-01

An approach combining genetic, proteomic, computational, and physiological analysis was used to define a protein network that regulates fat storage in budding yeast (Saccharomyces cerevisiae). A computational analysis of this network shows that it is not scale-free, and is best approximated by the Watts-Strogatz model, which generates "small-world" networks with high clustering and short path lengths. The network is also modular, containing energy level sensing proteins that connect to four output processes: autophagy, fatty acid synthesis, mRNA processing, and MAP kinase signaling. The importance of each protein to network function is dependent on its Katz centrality score, which is related both to the protein's position within a module and to the module's relationship to the network as a whole. The network is also divisible into subnetworks that span modular boundaries and regulate different aspects of fat metabolism. We used a combination of genetics and pharmacology to simultaneously block output from multiple network nodes. The phenotypic results of this blockage define patterns of communication among distant network nodes, and these patterns are consistent with the Watts-Strogatz model.

Modeling structure and resilience of the dark network.

PubMed

De Domenico, Manlio; Arenas, Alex

2017-02-01

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

Modeling structure and resilience of the dark network

NASA Astrophysics Data System (ADS)

De Domenico, Manlio; Arenas, Alex

2017-02-01

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

Topic segmentation via community detection in complex networks

NASA Astrophysics Data System (ADS)

de Arruda, Henrique F.; Costa, Luciano da F.; Amancio, Diego R.

2016-06-01

Many real systems have been modeled in terms of network concepts, and written texts are a particular example of information networks. In recent years, the use of network methods to analyze language has allowed the discovery of several interesting effects, including the proposition of novel models to explain the emergence of fundamental universal patterns. While syntactical networks, one of the most prevalent networked models of written texts, display both scale-free and small-world properties, such a representation fails in capturing other textual features, such as the organization in topics or subjects. We propose a novel network representation whose main purpose is to capture the semantical relationships of words in a simple way. To do so, we link all words co-occurring in the same semantic context, which is defined in a threefold way. We show that the proposed representations favor the emergence of communities of semantically related words, and this feature may be used to identify relevant topics. The proposed methodology to detect topics was applied to segment selected Wikipedia articles. We found that, in general, our methods outperform traditional bag-of-words representations, which suggests that a high-level textual representation may be useful to study the semantical features of texts.

Topic segmentation via community detection in complex networks.

PubMed

de Arruda, Henrique F; Costa, Luciano da F; Amancio, Diego R

2016-06-01

Many real systems have been modeled in terms of network concepts, and written texts are a particular example of information networks. In recent years, the use of network methods to analyze language has allowed the discovery of several interesting effects, including the proposition of novel models to explain the emergence of fundamental universal patterns. While syntactical networks, one of the most prevalent networked models of written texts, display both scale-free and small-world properties, such a representation fails in capturing other textual features, such as the organization in topics or subjects. We propose a novel network representation whose main purpose is to capture the semantical relationships of words in a simple way. To do so, we link all words co-occurring in the same semantic context, which is defined in a threefold way. We show that the proposed representations favor the emergence of communities of semantically related words, and this feature may be used to identify relevant topics. The proposed methodology to detect topics was applied to segment selected Wikipedia articles. We found that, in general, our methods outperform traditional bag-of-words representations, which suggests that a high-level textual representation may be useful to study the semantical features of texts.

The gravitational law of social interaction

NASA Astrophysics Data System (ADS)

Levy, Moshe; Goldenberg, Jacob

2014-01-01

While a great deal is known about the topology of social networks, there is much less agreement about the geographical structure of these networks. The fundamental question in this context is: how does the probability of a social link between two individuals depend on the physical distance between them? While it is clear that the probability decreases with the distance, various studies have found different functional forms for this dependence. The exact form of the distance dependence has crucial implications for network searchability and dynamics: Kleinberg (2000) [15] shows that the small-world property holds if the probability of a social link is a power-law function of the distance with power -2, but not with any other power. We investigate the distance dependence of link probability empirically by analyzing four very different sets of data: Facebook links, data from the electronic version of the Small-World experiment, email messages, and data from detailed personal interviews. All four datasets reveal the same empirical regularity: the probability of a social link is proportional to the inverse of the square of the distance between the two individuals, analogously to the distance dependence of the gravitational force. Thus, it seems that social networks spontaneously converge to the exact unique distance dependence that ensures the Small-World property.

Improved representation of situational awareness within a dismounted small combat unit constructive simulation

NASA Astrophysics Data System (ADS)

Lee, K. David; Colony, Mike

2011-06-01

Modeling and simulation has been established as a cost-effective means of supporting the development of requirements, exploring doctrinal alternatives, assessing system performance, and performing design trade-off analysis. The Army's constructive simulation for the evaluation of equipment effectiveness in small combat unit operations is currently limited to representation of situation awareness without inclusion of the many uncertainties associated with real world combat environments. The goal of this research is to provide an ability to model situation awareness and decision process uncertainties in order to improve evaluation of the impact of battlefield equipment on ground soldier and small combat unit decision processes. Our Army Probabilistic Inference and Decision Engine (Army-PRIDE) system provides this required uncertainty modeling through the application of two critical techniques that allow Bayesian network technology to be applied to real-time applications. (Object-Oriented Bayesian Network methodology and Object-Oriented Inference technique). In this research, we implement decision process and situation awareness models for a reference scenario using Army-PRIDE and demonstrate its ability to model a variety of uncertainty elements, including: confidence of source, information completeness, and information loss. We also demonstrate that Army-PRIDE improves the realism of the current constructive simulation's decision processes through Monte Carlo simulation.

Small-time Scale Network Traffic Prediction Based on Complex-valued Neural Network

NASA Astrophysics Data System (ADS)

Yang, Bin

2017-07-01

Accurate models play an important role in capturing the significant characteristics of the network traffic, analyzing the network dynamic, and improving the forecasting accuracy for system dynamics. In this study, complex-valued neural network (CVNN) model is proposed to further improve the accuracy of small-time scale network traffic forecasting. Artificial bee colony (ABC) algorithm is proposed to optimize the complex-valued and real-valued parameters of CVNN model. Small-scale traffic measurements data namely the TCP traffic data is used to test the performance of CVNN model. Experimental results reveal that CVNN model forecasts the small-time scale network traffic measurement data very accurately

Plasmodial vein networks of the slime mold Physarum polycephalum form regular graphs

NASA Astrophysics Data System (ADS)

Baumgarten, Werner; Ueda, Tetsuo; Hauser, Marcus J. B.

2010-10-01

The morphology of a typical developing biological transportation network, the vein network of the plasmodium of the myxomycete Physarum polycephalum is analyzed during its free extension. The network forms a classical, regular graph, and has exclusively nodes of degree 3. This contrasts to most real-world transportation networks which show small-world or scale-free properties. The complexity of the vein network arises from the weighting of the lengths, widths, and areas of the vein segments. The lengths and areas follow exponential distributions, while the widths are distributed log-normally. These functional dependencies are robust during the entire evolution of the network, even though the exponents change with time due to the coarsening of the vein network.

Plasmodial vein networks of the slime mold Physarum polycephalum form regular graphs.

PubMed

Baumgarten, Werner; Ueda, Tetsuo; Hauser, Marcus J B

2010-10-01

The morphology of a typical developing biological transportation network, the vein network of the plasmodium of the myxomycete Physarum polycephalum is analyzed during its free extension. The network forms a classical, regular graph, and has exclusively nodes of degree 3. This contrasts to most real-world transportation networks which show small-world or scale-free properties. The complexity of the vein network arises from the weighting of the lengths, widths, and areas of the vein segments. The lengths and areas follow exponential distributions, while the widths are distributed log-normally. These functional dependencies are robust during the entire evolution of the network, even though the exponents change with time due to the coarsening of the vein network.

Characterization of topological structure on complex networks.

PubMed

Nakamura, Ikuo

2003-10-01

Characterizing the topological structure of complex networks is a significant problem especially from the viewpoint of data mining on the World Wide Web. "Page rank" used in the commercial search engine Google is such a measure of authority to rank all the nodes matching a given query. We have investigated the page-rank distribution of the real Web and a growing network model, both of which have directed links and exhibit a power law distributions of in-degree (the number of incoming links to the node) and out-degree (the number of outgoing links from the node), respectively. We find a concentration of page rank on a small number of nodes and low page rank on high degree regimes in the real Web, which can be explained by topological properties of the network, e.g., network motifs, and connectivities of nearest neighbors.

Correlation between standardized assessment of concussion scores and small-world brain network in mild traumatic brain injury.

PubMed

Yan, Yan; Song, Jian; Xu, Guozheng; Yao, Shun; Cao, Chenglong; Li, Chang; Peng, Guibao; Du, Hao

2017-10-01

This study investigated the characteristics of the small-world brain network architecture of patients with mild traumatic brain injury (MTBI), and a correlation between brain functional connectivity network properties in the resting-state fMRI and Standardized Assessment of Concussion (SAC) parameters. The neurological conditions of 22 MTBI patients and 17 normal control individuals were evaluated according to the SAC. Resting-state fMRI was performed in all subjects 3 and 7days after injury respectively. After preprocessing the fMRI data, cortex functional regions were marked using AAL90 and Dosenbach160 templates. The small-world network parameters and areas under the integral curves were computed in the range of sparsity from 0.01 to 0.5. Independent-sample t-tests were used to compare these parameters between the MTBI and control group. Significantly different parameters were investigated for correlations with SAC scores; those that correlated were chosen for further curve fitting. The clustering coefficient, the communication efficiency across in local networks, and the strength of connectivity were all higher in MTBI patients relative to control individuals. Parameters in 160 brain regions of the MTBI group significantly correlated with total SAC score and score for attention; the network parameters may be a quadratic function of attention scores of SAC and a cubic function of SAC scores. MTBI patients were characterized by elevated communication efficiency across global brain regions, and in local networks, and strength of mean connectivity. These features may be associated with brain function compensation. The network parameters significantly correlated with SAC total and attention scores. Copyright © 2017 Elsevier Ltd. All rights reserved.

Complex root networks of Chinese characters

NASA Astrophysics Data System (ADS)

Lee, Po-Han; Chen, Jia-Ling; Wang, Po-Cheng; Chi, Ting-Ting; Xiao, Zhi-Ren; Jhang, Zih-Jian; Yeh, Yeong-Nan; Chen, Yih-Yuh; Hu, Chin-Kun

There are several sets of Chinese characters still available today, including Oracle Bone Inscriptions (OBI) in Shang Dynasty, Chu characters (CC) used in Chu of Warring State Period, Small Seal Script in dictionary Shuowen Jiezi (SJ) in Eastern Han Dynasty, and Kangxi Dictionary (KD) in Qing Dynasty. Such as Chinese characters were all constructed via combinations of meaningful patterns, called roots. Our studies for the complex networks of all roots indicate that the roots of the characters in OBI, CC, SJ and KD have characteristics of small world networks and scale-free networks.

Beyond Scale-Free Small-World Networks: Cortical Columns for Quick Brains

NASA Astrophysics Data System (ADS)

Stoop, Ralph; Saase, Victor; Wagner, Clemens; Stoop, Britta; Stoop, Ruedi

2013-03-01

We study to what extent cortical columns with their particular wiring boost neural computation. Upon a vast survey of columnar networks performing various real-world cognitive tasks, we detect no signs of enhancement. It is on a mesoscopic—intercolumnar—scale that the existence of columns, largely irrespective of their inner organization, enhances the speed of information transfer and minimizes the total wiring length required to bind distributed columnar computations towards spatiotemporally coherent results. We suggest that brain efficiency may be related to a doubly fractal connectivity law, resulting in networks with efficiency properties beyond those by scale-free networks.

Modelling disease outbreaks in realistic urban social networks

NASA Astrophysics Data System (ADS)

Eubank, Stephen; Guclu, Hasan; Anil Kumar, V. S.; Marathe, Madhav V.; Srinivasan, Aravind; Toroczkai, Zoltán; Wang, Nan

2004-05-01

Most mathematical models for the spread of disease use differential equations based on uniform mixing assumptions or ad hoc models for the contact process. Here we explore the use of dynamic bipartite graphs to model the physical contact patterns that result from movements of individuals between specific locations. The graphs are generated by large-scale individual-based urban traffic simulations built on actual census, land-use and population-mobility data. We find that the contact network among people is a strongly connected small-world-like graph with a well-defined scale for the degree distribution. However, the locations graph is scale-free, which allows highly efficient outbreak detection by placing sensors in the hubs of the locations network. Within this large-scale simulation framework, we then analyse the relative merits of several proposed mitigation strategies for smallpox spread. Our results suggest that outbreaks can be contained by a strategy of targeted vaccination combined with early detection without resorting to mass vaccination of a population.

Complex network analysis of brain functional connectivity under a multi-step cognitive task

NASA Astrophysics Data System (ADS)

Cai, Shi-Min; Chen, Wei; Liu, Dong-Bai; Tang, Ming; Chen, Xun

2017-01-01

Functional brain network has been widely studied to understand the relationship between brain organization and behavior. In this paper, we aim to explore the functional connectivity of brain network under a multi-step cognitive task involving consecutive behaviors, and further understand the effect of behaviors on the brain organization. The functional brain networks are constructed based on a high spatial and temporal resolution fMRI dataset and analyzed via complex network based approach. We find that at voxel level the functional brain network shows robust small-worldness and scale-free characteristics, while its assortativity and rich-club organization are slightly restricted to the order of behaviors performed. More interestingly, the functional connectivity of brain network in activated ROIs strongly correlates with behaviors and is obviously restricted to the order of behaviors performed. These empirical results suggest that the brain organization has the generic properties of small-worldness and scale-free characteristics, and its diverse functional connectivity emerging from activated ROIs is strongly driven by these behavioral activities via the plasticity of brain.

Study on Dissemination Patterns in Location-Aware Gossiping Networks

NASA Astrophysics Data System (ADS)

Kami, Nobuharu; Baba, Teruyuki; Yoshikawa, Takashi; Morikawa, Hiroyuki

We study the properties of information dissemination over location-aware gossiping networks leveraging location-based real-time communication applications. Gossiping is a promising method for quickly disseminating messages in a large-scale system, but in its application to information dissemination for location-aware applications, it is important to consider the network topology and patterns of spatial dissemination over the network in order to achieve effective delivery of messages to potentially interested users. To this end, we propose a continuous-space network model extended from Kleinberg's small-world model applicable to actual location-based applications. Analytical and simulation-based study shows that the proposed network achieves high dissemination efficiency resulting from geographically neutral dissemination patterns as well as selective dissemination to proximate users. We have designed a highly scalable location management method capable of promptly updating the network topology in response to node movement and have implemented a distributed simulator to perform dynamic target pursuit experiments as one example of applications that are the most sensitive to message forwarding delay. The experimental results show that the proposed network surpasses other types of networks in pursuit efficiency and achieves the desirable dissemination patterns.

Networks in plant epidemiology: from genes to landscapes, countries, and continents.

PubMed

Moslonka-Lefebvre, Mathieu; Finley, Ann; Dorigatti, Ilaria; Dehnen-Schmutz, Katharina; Harwood, Tom; Jeger, Michael J; Xu, Xiangming; Holdenrieder, Ottmar; Pautasso, Marco

2011-04-01

There is increasing use of networks in ecology and epidemiology, but still relatively little application in phytopathology. Networks are sets of elements (nodes) connected in various ways by links (edges). Network analysis aims to understand system dynamics and outcomes in relation to network characteristics. Many existing natural, social, and technological networks have been shown to have small-world (local connectivity with short-cuts) and scale-free (presence of super-connected nodes) properties. In this review, we discuss how network concepts can be applied in plant pathology from the molecular to the landscape and global level. Wherever disease spread occurs not just because of passive/natural dispersion but also due to artificial movements, it makes sense to superimpose realistic models of the trade in plants on spatially explicit models of epidemic development. We provide an example of an emerging pathosystem (Phytophthora ramorum) where a theoretical network approach has proven particularly fruitful in analyzing the spread of disease in the UK plant trade. These studies can help in assessing the future threat posed by similar emerging pathogens. Networks have much potential in plant epidemiology and should become part of the standard curriculum.

Motif formation and industry specific topologies in the Japanese business firm network

NASA Astrophysics Data System (ADS)

Maluck, Julian; Donner, Reik V.; Takayasu, Hideki; Takayasu, Misako

2017-05-01

Motifs and roles are basic quantities for the characterization of interactions among 3-node subsets in complex networks. In this work, we investigate how the distribution of 3-node motifs can be influenced by modifying the rules of an evolving network model while keeping the statistics of simpler network characteristics, such as the link density and the degree distribution, invariant. We exemplify this problem for the special case of the Japanese Business Firm Network, where a well-studied and relatively simple yet realistic evolving network model is available, and compare the resulting motif distribution in the real-world and simulated networks. To better approximate the motif distribution of the real-world network in the model, we introduce both subgraph dependent and global additional rules. We find that a specific rule that allows only for the merging process between nodes with similar link directionality patterns reduces the observed excess of densely connected motifs with bidirectional links. Our study improves the mechanistic understanding of motif formation in evolving network models to better describe the characteristic features of real-world networks with a scale-free topology.

The Laplacian spectrum of neural networks

PubMed Central

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

2014-01-01

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

Utilizing Maximal Independent Sets as Dominating Sets in Scale-Free Networks

NASA Astrophysics Data System (ADS)

Derzsy, N.; Molnar, F., Jr.; Szymanski, B. K.; Korniss, G.

Dominating sets provide key solution to various critical problems in networked systems, such as detecting, monitoring, or controlling the behavior of nodes. Motivated by graph theory literature [Erdos, Israel J. Math. 4, 233 (1966)], we studied maximal independent sets (MIS) as dominating sets in scale-free networks. We investigated the scaling behavior of the size of MIS in artificial scale-free networks with respect to multiple topological properties (size, average degree, power-law exponent, assortativity), evaluated its resilience to network damage resulting from random failure or targeted attack [Molnar et al., Sci. Rep. 5, 8321 (2015)], and compared its efficiency to previously proposed dominating set selection strategies. We showed that, despite its small set size, MIS provides very high resilience against network damage. Using extensive numerical analysis on both synthetic and real-world (social, biological, technological) network samples, we demonstrate that our method effectively satisfies four essential requirements of dominating sets for their practical applicability on large-scale real-world systems: 1.) small set size, 2.) minimal network information required for their construction scheme, 3.) fast and easy computational implementation, and 4.) resiliency to network damage. Supported by DARPA, DTRA, and NSF.

Structure and controls of the global virtual water trade network

NASA Astrophysics Data System (ADS)

Suweis, S.; Konar, M.; Dalin, C.; Hanasaki, N.; Rinaldo, A.; Rodriguez-Iturbe, I.

2011-05-01

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

The model of microblog message diffusion based on complex social network

NASA Astrophysics Data System (ADS)

Zhang, Wei; Bai, Shu-Ying; Jin, Rui

2014-05-01

Microblog is a micromessage communication network in which users are the nodes and the followship between users are the edges. Sina Weibo is a typical case of these microblog service websites. As the enormous scale of nodes and complex links in the network, we choose a sample network crawled in Sina Weibo as the base of empirical analysis. The study starts with the analysis of its topological features, and brings in epidemiological SEIR model to explore the mode of message spreading throughout the microblog network. It is found that the network is obvious small-world and scale-free, which made it succeed in transferring messages and failed in resisting negative influence. In addition, the paper focuses on the rich nodes as they constitute a typical feature of Sina Weibo. It is also found that whether the message starts with a rich node will not account for its final coverage. Actually, the rich nodes always play the role of pivotal intermediaries who speed up the spreading and make the message known by much more people.

The complexity of classical music networks

NASA Astrophysics Data System (ADS)

Rolla, Vitor; Kestenberg, Juliano; Velho, Luiz

2018-02-01

Previous works suggest that musical networks often present the scale-free and the small-world properties. From a musician's perspective, the most important aspect missing in those studies was harmony. In addition to that, the previous works made use of outdated statistical methods. Traditionally, least-squares linear regression is utilised to fit a power law to a given data set. However, according to Clauset et al. such a traditional method can produce inaccurate estimates for the power law exponent. In this paper, we present an analysis of musical networks which considers the existence of chords (an essential element of harmony). Here we show that only 52.5% of music in our database presents the scale-free property, while 62.5% of those pieces present the small-world property. Previous works argue that music is highly scale-free; consequently, it sounds appealing and coherent. In contrast, our results show that not all pieces of music present the scale-free and the small-world properties. In summary, this research is focused on the relationship between musical notes (Do, Re, Mi, Fa, Sol, La, Si, and their sharps) and accompaniment in classical music compositions. More information about this research project is available at https://eden.dei.uc.pt/~vitorgr/MS.html.

Network analysis of named entity co-occurrences in written texts

NASA Astrophysics Data System (ADS)

Amancio, Diego Raphael

2016-06-01

The use of methods borrowed from statistics and physics to analyze written texts has allowed the discovery of unprecedent patterns of human behavior and cognition by establishing links between models features and language structure. While current models have been useful to unveil patterns via analysis of syntactical and semantical networks, only a few works have probed the relevance of investigating the structure arising from the relationship between relevant entities such as characters, locations and organizations. In this study, we represent entities appearing in the same context as a co-occurrence network, where links are established according to a null model based on random, shuffled texts. Computational simulations performed in novels revealed that the proposed model displays interesting topological features, such as the small world feature, characterized by high values of clustering coefficient. The effectiveness of our model was verified in a practical pattern recognition task in real networks. When compared with traditional word adjacency networks, our model displayed optimized results in identifying unknown references in texts. Because the proposed representation plays a complementary role in characterizing unstructured documents via topological analysis of named entities, we believe that it could be useful to improve the characterization of written texts (and related systems), specially if combined with traditional approaches based on statistical and deeper paradigms.

Coexistence of Stochastic Oscillations and Self-Organized Criticality in a Neuronal Network: Sandpile Model Application.

PubMed

Saeedi, Alireza; Jannesari, Mostafa; Gharibzadeh, Shahriar; Bakouie, Fatemeh

2018-04-01

Self-organized criticality (SOC) and stochastic oscillations (SOs) are two theoretically contradictory phenomena that are suggested to coexist in the brain. Recently it has been shown that an accumulation-release process like sandpile dynamics can generate SOC and SOs simultaneously. We considered the effect of the network structure on this coexistence and showed that the sandpile dynamics on a small-world network can produce two power law regimes along with two groups of SOs-two peaks in the power spectrum of the generated signal simultaneously. We also showed that external stimuli in the sandpile dynamics do not affect the coexistence of SOC and SOs but increase the frequency of SOs, which is consistent with our knowledge of the brain.

Bifurcation Phenomena of Opinion Dynamics in Complex Networks

NASA Astrophysics Data System (ADS)

Guo, Long; Cai, Xu

In this paper, we study the opinion dynamics of Improved Deffuant model (IDM), where the convergence parameter μ is a function of the opposite’s degree K according to the celebrity effect, in small-world network (SWN) and scale-free network (SFN). Generically, the system undergoes a phase transition from the plurality state to the polarization state and to the consensus state as the confidence parameter ɛ increasing. Furthermore, the evolution of the steady opinion s * as a function of ɛ, and the relation between the minority steady opinion s_{*}^{min} and the individual connectivity k also have been analyzed. Our present work shows the crucial role of the confidence parameter and the complex system topology in the opinion dynamics of IDM.

Levodopa modulates small-world architecture of functional brain networks in Parkinson's disease.

PubMed

Berman, Brian D; Smucny, Jason; Wylie, Korey P; Shelton, Erika; Kronberg, Eugene; Leehey, Maureen; Tregellas, Jason R

2016-11-01

PD is associated with disrupted connectivity to a large number of distributed brain regions. How the disease alters the functional topological organization of the brain, however, remains poorly understood. Furthermore, how levodopa modulates network topology in PD is largely unknown. The objective of this study was to use resting-state functional MRI and graph theory to determine how small-world architecture is altered in PD and affected by levodopa administration. Twenty-one PD patients and 20 controls underwent functional MRI scanning. PD patients were scanned off medication and 1 hour after 200 mg levodopa. Imaging data were analyzed using 226 nodes comprising 10 intrinsic brain networks. Correlation matrices were generated for each subject and converted into cost-thresholded, binarized adjacency matrices. Cost-integrated whole-brain global and local efficiencies were compared across groups and tested for relationships with disease duration and severity. Data from 2 patients and 4 controls were excluded because of excess motion. Patients off medication showed no significant changes in global efficiency and overall local efficiency, but in a subnetwork analysis did show increased local efficiency in executive (P = 0.006) and salience (P = 0.018) networks. Levodopa significantly decreased local efficiency (P = 0.039) in patients except within the subcortical network, in which it significantly increased local efficiency (P = 0.007). Levodopa modulates global and local efficiency measures of small-world topology in PD, suggesting that degeneration of nigrostriatal neurons in PD may be associated with a large-scale network reorganization and that levodopa tends to normalize the disrupted network topology in PD. © 2016 International Parkinson and Movement Disorder Society. © 2016 International Parkinson and Movement Disorder Society.

Celestial data routing network

NASA Astrophysics Data System (ADS)

Bordetsky, Alex

2000-11-01

Imagine that information processing human-machine network is threatened in a particular part of the world. Suppose that an anticipated threat of physical attacks could lead to disruption of telecommunications network management infrastructure and access capabilities for small geographically distributed groups engaged in collaborative operations. Suppose that small group of astronauts are exploring the solar planet and need to quickly configure orbital information network to support their collaborative work and local communications. The critical need in both scenarios would be a set of low-cost means of small team celestial networking. To the geographically distributed mobile collaborating groups such means would allow to maintain collaborative multipoint work, set up orbital local area network, and provide orbital intranet communications. This would be accomplished by dynamically assembling the network enabling infrastructure of the small satellite based router, satellite based Codec, and set of satellite based intelligent management agents. Cooperating single function pico satellites, acting as agents and personal switching devices together would represent self-organizing intelligent orbital network of cooperating mobile management nodes. Cooperative behavior of the pico satellite based agents would be achieved by comprising a small orbital artificial neural network capable of learning and restructing the networking resources in response to the anticipated threat.

Inferring general relations between network characteristics from specific network ensembles.

PubMed

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

2012-01-01

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

Hyperbolicity measures democracy in real-world networks

NASA Astrophysics Data System (ADS)

Borassi, Michele; Chessa, Alessandro; Caldarelli, Guido

2015-09-01

In this work, we analyze the hyperbolicity of real-world networks, a geometric quantity that measures if a space is negatively curved. We provide two improvements in our understanding of this quantity: first of all, in our interpretation, a hyperbolic network is "aristocratic", since few elements "connect" the system, while a non-hyperbolic network has a more "democratic" structure with a larger number of crucial elements. The second contribution is the introduction of the average hyperbolicity of the neighbors of a given node. Through this definition, we outline an "influence area" for the vertices in the graph. We show that in real networks the influence area of the highest degree vertex is small in what we define "local" networks (i.e., social or peer-to-peer networks), and large in "global" networks (i.e., power grid, metabolic networks, or autonomous system networks).

Agreement dynamics on interaction networks with diverse topologies

NASA Astrophysics Data System (ADS)

Barrat, Alain; Baronchelli, Andrea; Dall'Asta, Luca; Loreto, Vittorio

2007-06-01

We review the behavior of a recently introduced model of agreement dynamics, called the "Naming Game." This model describes the self-organized emergence of linguistic conventions and the establishment of simple communication systems in a population of agents with pairwise local interactions. The mechanisms of convergence towards agreement strongly depend on the network of possible interactions between the agents. In particular, the mean-field case in which all agents communicate with all the others is not efficient, since a large temporary memory is requested for the agents. On the other hand, regular lattice topologies lead to a fast local convergence but to a slow global dynamics similar to coarsening phenomena. The embedding of the agents in a small-world network represents an interesting tradeoff: a local consensus is easily reached, while the long-range links allow to bypass coarsening-like convergence. We also consider alternative adaptive strategies which can lead to faster global convergence.

Exploring the Role of Intrinsic Nodal Activation on the Spread of Influence in Complex Networks

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

Visweswara Sathanur, Arun; Halappanavar, Mahantesh; Shi, Yi

In many complex networked systems such as online social networks, at any given time, activity originates at certain nodes and subsequently spreads on the network through influence. To model the spread of influence in such a scenario, we consider the problem of identification of influential entities in a complex network when nodal activation can happen through two different mechanisms. The first mode of activation is due mechanisms intrinsic to the node. The second mechanism is through the influence of connected neighbors. In this work, we present a simple probabilistic formulation that models such self-evolving systems where information diffusion occurs primarilymore » because of the intrinsic activity of users and the spread of activity occurs due to influence. We provide an algorithm to mine for the influential seeds in such a scenario by modifying the well-known influence maximization framework with the independent cascade diffusion model. We provide small motivating examples to provide an intuitive understanding of the effect of including the intrinsic activation mechanism. We sketch a proof of the submodularity of the influence function under the new formulation and demonstrate the same with larger graphs. We then show by means of additional experiments on a real-world twitter dataset how the formulation can be applied to real-world social media datasets. Finally we derive a computationally efficient centrality metric that takes into account, both the mechanisms of activation and provides for an accurate as well as computationally efficient alternative approach to the problem of identifying influencers under intrinsic activation.« less

Graph Theoretical Analysis of BOLD Functional Connectivity during Human Sleep without EEG Monitoring.

PubMed

Lv, Jun; Liu, Dongdong; Ma, Jing; Wang, Xiaoying; Zhang, Jue

2015-01-01

Functional brain networks of human have been revealed to have small-world properties by both analyzing electroencephalogram (EEG) and functional magnetic resonance imaging (fMRI) time series. In our study, by using graph theoretical analysis, we attempted to investigate the changes of paralimbic-limbic cortex between wake and sleep states. Ten healthy young people were recruited to our experiment. Data from 2 subjects were excluded for the reason that they had not fallen asleep during the experiment. For each subject, blood oxygen level dependency (BOLD) images were acquired to analyze brain network, and peripheral pulse signals were obtained continuously to identify if the subject was in sleep periods. Results of fMRI showed that brain networks exhibited stronger small-world characteristics during sleep state as compared to wake state, which was in consistent with previous studies using EEG synchronization. Moreover, we observed that compared with wake state, paralimbic-limbic cortex had less connectivity with neocortical system and centrencephalic structure in sleep. In conclusion, this is the first study, to our knowledge, has observed that small-world properties of brain functional networks altered when human sleeps without EEG synchronization. Moreover, we speculate that paralimbic-limbic cortex organization owns an efficient defense mechanism responsible for suppressing the external environment interference when humans sleep, which is consistent with the hypothesis that the paralimbic-limbic cortex may be functionally disconnected from brain regions which directly mediate their interactions with the external environment. Our findings also provide a reasonable explanation why stable sleep exhibits homeostasis which is far less susceptible to outside world.

Altered Cerebral Blood Flow Covariance Network in Schizophrenia.

PubMed

Liu, Feng; Zhuo, Chuanjun; Yu, Chunshui

2016-01-01

Many studies have shown abnormal cerebral blood flow (CBF) in schizophrenia; however, it remains unclear how topological properties of CBF network are altered in this disorder. Here, arterial spin labeling (ASL) MRI was employed to measure resting-state CBF in 96 schizophrenia patients and 91 healthy controls. CBF covariance network of each group was constructed by calculating across-subject CBF covariance between 90 brain regions. Graph theory was used to compare intergroup differences in global and nodal topological measures of the network. Both schizophrenia patients and healthy controls had small-world topology in CBF covariance networks, implying an optimal balance between functional segregation and integration. Compared with healthy controls, schizophrenia patients showed reduced small-worldness, normalized clustering coefficient and local efficiency of the network, suggesting a shift toward randomized network topology in schizophrenia. Furthermore, schizophrenia patients exhibited altered nodal centrality in the perceptual-, affective-, language-, and spatial-related regions, indicating functional disturbance of these systems in schizophrenia. This study demonstrated for the first time that schizophrenia patients have disrupted topological properties in CBF covariance network, which provides a new perspective (efficiency of blood flow distribution between brain regions) for understanding neural mechanisms of schizophrenia.

The spatial scaling of species interaction networks.

PubMed

Galiana, Nuria; Lurgi, Miguel; Claramunt-López, Bernat; Fortin, Marie-Josée; Leroux, Shawn; Cazelles, Kevin; Gravel, Dominique; Montoya, José M

2018-05-01

Species-area relationships (SARs) are pivotal to understand the distribution of biodiversity across spatial scales. We know little, however, about how the network of biotic interactions in which biodiversity is embedded changes with spatial extent. Here we develop a new theoretical framework that enables us to explore how different assembly mechanisms and theoretical models affect multiple properties of ecological networks across space. We present a number of testable predictions on network-area relationships (NARs) for multi-trophic communities. Network structure changes as area increases because of the existence of different SARs across trophic levels, the preferential selection of generalist species at small spatial extents and the effect of dispersal limitation promoting beta-diversity. Developing an understanding of NARs will complement the growing body of knowledge on SARs with potential applications in conservation ecology. Specifically, combined with further empirical evidence, NARs can generate predictions of potential effects on ecological communities of habitat loss and fragmentation in a changing world.

The Effects of Observation Errors on the Attack Vulnerability of Complex Networks

DTIC Science & Technology

2012-11-01

more detail, to construct a true network we select a topology (erdos- renyi (Erdos & Renyi , 1959), scale-free (Barabási & Albert, 1999), small world...Efficiency of Scale-Free Networks: Error and Attack Tolerance. Physica A, Volume 320, pp. 622-642. 6. Erdos, P. & Renyi , A., 1959. On Random Graphs, I

Statistical Mechanics of Temporal and Interacting Networks

NASA Astrophysics Data System (ADS)

Zhao, Kun

In the last ten years important breakthroughs in the understanding of the topology of complexity have been made in the framework of network science. Indeed it has been found that many networks belong to the universality classes called small-world networks or scale-free networks. Moreover it was found that the complex architecture of real world networks strongly affects the critical phenomena defined on these structures. Nevertheless the main focus of the research has been the characterization of single and static networks. Recently, temporal networks and interacting networks have attracted large interest. Indeed many networks are interacting or formed by a multilayer structure. Example of these networks are found in social networks where an individual might be at the same time part of different social networks, in economic and financial networks, in physiology or in infrastructure systems. Moreover, many networks are temporal, i.e. the links appear and disappear on the fast time scale. Examples of these networks are social networks of contacts such as face-to-face interactions or mobile-phone communication, the time-dependent correlations in the brain activity and etc. Understanding the evolution of temporal and multilayer networks and characterizing critical phenomena in these systems is crucial if we want to describe, predict and control the dynamics of complex system. In this thesis, we investigate several statistical mechanics models of temporal and interacting networks, to shed light on the dynamics of this new generation of complex networks. First, we investigate a model of temporal social networks aimed at characterizing human social interactions such as face-to-face interactions and phone-call communication. Indeed thanks to the availability of data on these interactions, we are now in the position to compare the proposed model to the real data finding good agreement. Second, we investigate the entropy of temporal networks and growing networks , to provide a new framework to quantify the information encoded in these networks and to answer a fundamental problem in network science: how complex are temporal and growing networks. Finally, we consider two examples of critical phenomena in interacting networks. In particular, on one side we investigate the percolation of interacting networks by introducing antagonistic interactions. On the other side, we investigate a model of political election based on the percolation of antagonistic networks. The aim of this research is to show how antagonistic interactions change the physics of critical phenomena on interacting networks. We believe that the work presented in these thesis offers the possibility to appreciate the large variability of problems that can be addressed in the new framework of temporal and interacting networks.

Revealing the structure of the world airline network

PubMed Central

Verma, T.; Araújo, N. A. M.; Herrmann, H. J.

2014-01-01

Resilience of most critical infrastructures against failure of elements that appear insignificant is usually taken for granted. The World Airline Network (WAN) is an infrastructure that reduces the geographical gap between societies, both small and large, and brings forth economic gains. With the extensive use of a publicly maintained data set that contains information about airports and alternative connections between these airports, we empirically reveal that the WAN is a redundant and resilient network for long distance air travel, but otherwise breaks down completely due to removal of short and apparently insignificant connections. These short range connections with moderate number of passengers and alternate flights are the connections that keep remote parts of the world accessible. It is surprising, insofar as there exists a highly resilient and strongly connected core consisting of a small fraction of airports (around 2.3%) together with an extremely fragile star-like periphery. Yet, in spite of their relevance, more than 90% of the world airports are still interconnected upon removal of this core. With standard and unconventional removal measures we compare both empirical and topological perceptions for the fragmentation of the world. We identify how the WAN is organized into different classes of clusters based on the physical proximity of airports and analyze the consequence of this fragmentation. PMID:25005934

Stability analysis and synchronization in discrete-time complex networks with delayed coupling

NASA Astrophysics Data System (ADS)

Cheng, Ranran; Peng, Mingshu; Yu, Weibin; Sun, Bo; Yu, Jinchen

2013-12-01

A new network of coupled maps is proposed in which the connections between units involve no delays but the intra-neural communication does, whereas in the work of Atay et al. [Phys. Rev. Lett. 92, 144101 (2004)], the focus is on information processing delayed by the inter-neural communication. We show that the synchronization of the network depends on not only the intrinsic dynamical features and inter-connection topology (characterized by the spectrum of the graph Laplacian) but also the delays and the coupling strength. There are two main findings: (i) the more neighbours, the easier to be synchronized; (ii) odd delays are easier to be synchronized than even ones. In addition, compared with those discussed by Atay et al. [Phys. Rev. Lett. 92, 144101 (2004)], our model has a better synchronizability for regular networks and small-world variants.

Jordan recurrent neural network versus IHACRES in modelling daily streamflows

NASA Astrophysics Data System (ADS)

Carcano, Elena Carla; Bartolini, Paolo; Muselli, Marco; Piroddi, Luigi

2008-12-01

SummaryA study of possible scenarios for modelling streamflow data from daily time series, using artificial neural networks (ANNs), is presented. Particular emphasis is devoted to the reconstruction of drought periods where water resource management and control are most critical. This paper considers two connectionist models: a feedforward multilayer perceptron (MLP) and a Jordan recurrent neural network (JNN), comparing network performance on real world data from two small catchments (192 and 69 km 2 in size) with irregular and torrential regimes. Several network configurations are tested to ensure a good combination of input features (rainfall and previous streamflow data) that capture the variability of the physical processes at work. Tapped delayed line (TDL) and memory effect techniques are introduced to recognize and reproduce temporal dependence. Results show a poor agreement when using TDL only, but a remarkable improvement can be obtained with JNN and its memory effect procedures, which are able to reproduce the system memory over a catchment in a more effective way. Furthermore, the IHACRES conceptual model, which relies on both rainfall and temperature input data, is introduced for comparative study. The results suggest that when good input data is unavailable, metric models perform better than conceptual ones and, in general, it is difficult to justify substantial conceptualization of complex processes.

Synchronization in a noise-driven developing neural network

NASA Astrophysics Data System (ADS)

Lin, I.-H.; Wu, R.-K.; Chen, C.-M.

2011-11-01

We use computer simulations to investigate the structural and dynamical properties of a developing neural network whose activity is driven by noise. Structurally, the constructed neural networks in our simulations exhibit the small-world properties that have been observed in several neural networks. The dynamical change of neuronal membrane potential is described by the Hodgkin-Huxley model, and two types of learning rules, including spike-timing-dependent plasticity (STDP) and inverse STDP, are considered to restructure the synaptic strength between neurons. Clustered synchronized firing (SF) of the network is observed when the network connectivity (number of connections/maximal connections) is about 0.75, in which the firing rate of neurons is only half of the network frequency. At the connectivity of 0.86, all neurons fire synchronously at the network frequency. The network SF frequency increases logarithmically with the culturing time of a growing network and decreases exponentially with the delay time in signal transmission. These conclusions are consistent with experimental observations. The phase diagrams of SF in a developing network are investigated for both learning rules.

Knowledge Diffusion on Networks through the Game Strategy

NASA Astrophysics Data System (ADS)

Sun, Shu; Wu, Jiangning; Xuan, Zhaoguo

In this paper, we develop a knowledge diffusion model in which agents determine to give their knowledge to others according to some exchange strategies. The typical network namely small-world network is used for modeling, on which agents with knowledge are viewed as the nodes of the network and the edges are viewed as the social relationships for knowledge transmission. Such agents are permitted to interact with their neighbors repeatedly who have direct connections with them and accordingly change their strategies by choosing the most beneficial neighbors to diffuse knowledge. Two kinds of knowledge transmission strategies are proposed for the theoretical model based on the game theory and thereafter used in different simulations to examine the effect of the network structure on the knowledge diffusion effect. By analyses, two main observations can be found: One is that the simulation results are contrary to our intuition which agents would like to only accept but not share, thus they will maximize their benefit; another one is that the number of the agents acquired knowledge and the corresponding knowledge stock turn out to be independent of the percentage of those agents who choose to contribute their knowledge.

Estimation of the age-specific per-contact probability of Ebola virus transmission in Liberia using agent-based simulations

NASA Astrophysics Data System (ADS)

Siettos, Constantinos I.; Anastassopoulou, Cleo; Russo, Lucia; Grigoras, Christos; Mylonakis, Eleftherios

2016-06-01

Based on multiscale agent-based computations we estimated the per-contact probability of transmission by age of the Ebola virus disease (EVD) that swept through Liberia from May 2014 to March 2015. For the approximation of the epidemic dynamics we have developed a detailed agent-based model with small-world interactions between individuals categorized by age. For the estimation of the structure of the evolving contact network as well as the per-contact transmission probabilities by age group we exploited the so called Equation-Free framework. Model parameters were fitted to official case counts reported by the World Health Organization (WHO) as well as to recently published data of key epidemiological variables, such as the mean time to death, recovery and the case fatality rate.

Revealing the hidden language of complex networks.

PubMed

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

2014-04-01

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

Structure and Controls of the Global Virtual Water Trade Network

NASA Astrophysics Data System (ADS)

Suweis, S. S.

2011-12-01

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

Possible Origin of Efficient Navigation in Small Worlds

NASA Astrophysics Data System (ADS)

Hu, Yanqing; Wang, Yougui; Li, Daqing; Havlin, Shlomo; di, Zengru

2011-03-01

The small-world phenomenon is one of the most important properties found in social networks. It includes both short path lengths and efficient navigation between two individuals. It is found by Kleinberg that navigation is efficient only if the probability density distribution of an individual to have a friend at distance r scales as P(r)˜r-1. Although this spatial scaling is found in many empirical studies, the origin of how this scaling emerges is still missing. In this Letter, we propose the origin of this scaling law using the concept of entropy from statistical physics and show that this scaling is the result of optimization of collecting information in social networks.

Positron Emission Tomography Reveals Abnormal Topological Organization in Functional Brain Network in Diabetic Patients.

PubMed

Qiu, Xiangzhe; Zhang, Yanjun; Feng, Hongbo; Jiang, Donglang

2016-01-01

Recent studies have demonstrated alterations in the topological organization of structural brain networks in diabetes mellitus (DM). However, the DM-related changes in the topological properties in functional brain networks are unexplored so far. We therefore used fluoro-D-glucose positron emission tomography (FDG-PET) data to construct functional brain networks of 73 DM patients and 91 sex- and age-matched normal controls (NCs), followed by a graph theoretical analysis. We found that both DM patients and NCs had a small-world topology in functional brain network. In comparison to the NC group, the DM group was found to have significantly lower small-world index, lower normalized clustering coefficients and higher normalized characteristic path length. Moreover, for diabetic patients, the nodal centrality was significantly reduced in the right rectus, the right cuneus, the left middle occipital gyrus, and the left postcentral gyrus, and it was significantly increased in the orbitofrontal region of the left middle frontal gyrus, the left olfactory region, and the right paracentral lobule. Our results demonstrated that the diabetic brain was associated with disrupted topological organization in the functional PET network, thus providing functional evidence for the abnormalities of brain networks in DM.

Scale-free Graphs for General Aviation Flight Schedules

NASA Technical Reports Server (NTRS)

Alexandov, Natalia M. (Technical Monitor); Kincaid, Rex K.

2003-01-01

In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the number of nodes, n, became large rather than O(1/n). Moreover, these networks shared an important property with traditional random graphs as n becomes large the average shortest path length scales with log n. This latter property has been coined the small-world property. When taken together these three properties small-world, power law, and constant clustering coefficient describe what are now most commonly referred to as scale-free networks. Since 1997 at least six books and over 400 articles have been written about scale-free networks. In this manuscript an overview of the salient characteristics of scale-free networks. Computational experience will be provided for two mechanisms that grow (dynamic) scale-free graphs. Additional computational experience will be given for constructing (static) scale-free graphs via a tabu search optimization approach. Finally, a discussion of potential applications to general aviation networks is given.

Exploring network operations for data and information networks

NASA Astrophysics Data System (ADS)

Yao, Bing; Su, Jing; Ma, Fei; Wang, Xiaomin; Zhao, Xiyang; Yao, Ming

2017-01-01

Barabási and Albert, in 1999, formulated scale-free models based on some real networks: World-Wide Web, Internet, metabolic and protein networks, language or sexual networks. Scale-free networks not only appear around us, but also have high qualities in the world. As known, high quality information networks can transfer feasibly and efficiently data, clearly, their topological structures are very important for data safety. We build up network operations for constructing large scale of dynamic networks from smaller scale of network models having good property and high quality. We focus on the simplest operators to formulate complex operations, and are interesting on the closeness of operations to desired network properties.

Toward a formalized account of attitudes: The Causal Attitude Network (CAN) model.

PubMed

Dalege, Jonas; Borsboom, Denny; van Harreveld, Frenk; van den Berg, Helma; Conner, Mark; van der Maas, Han L J

2016-01-01

This article introduces the Causal Attitude Network (CAN) model, which conceptualizes attitudes as networks consisting of evaluative reactions and interactions between these reactions. Relevant evaluative reactions include beliefs, feelings, and behaviors toward the attitude object. Interactions between these reactions arise through direct causal influences (e.g., the belief that snakes are dangerous causes fear of snakes) and mechanisms that support evaluative consistency between related contents of evaluative reactions (e.g., people tend to align their belief that snakes are useful with their belief that snakes help maintain ecological balance). In the CAN model, the structure of attitude networks conforms to a small-world structure: evaluative reactions that are similar to each other form tight clusters, which are connected by a sparser set of "shortcuts" between them. We argue that the CAN model provides a realistic formalized measurement model of attitudes and therefore fills a crucial gap in the attitude literature. Furthermore, the CAN model provides testable predictions for the structure of attitudes and how they develop, remain stable, and change over time. Attitude strength is conceptualized in terms of the connectivity of attitude networks and we show that this provides a parsimonious account of the differences between strong and weak attitudes. We discuss the CAN model in relation to possible extensions, implication for the assessment of attitudes, and possibilities for further study. (c) 2015 APA, all rights reserved).

Efficient discovery of overlapping communities in massive networks

PubMed Central

Gopalan, Prem K.; Blei, David M.

2013-01-01

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

Infection dynamics on spatial small-world network models

NASA Astrophysics Data System (ADS)

Iotti, Bryan; Antonioni, Alberto; Bullock, Seth; Darabos, Christian; Tomassini, Marco; Giacobini, Mario

2017-11-01

The study of complex networks, and in particular of social networks, has mostly concentrated on relational networks, abstracting the distance between nodes. Spatial networks are, however, extremely relevant in our daily lives, and a large body of research exists to show that the distances between nodes greatly influence the cost and probability of establishing and maintaining a link. A random geometric graph (RGG) is the main type of synthetic network model used to mimic the statistical properties and behavior of many social networks. We propose a model, called REDS, that extends energy-constrained RGGs to account for the synergic effect of sharing the cost of a link with our neighbors, as is observed in real relational networks. We apply both the standard Watts-Strogatz rewiring procedure and another method that conserves the degree distribution of the network. The second technique was developed to eliminate unwanted forms of spatial correlation between the degree of nodes that are affected by rewiring, limiting the effect on other properties such as clustering and assortativity. We analyze both the statistical properties of these two network types and their epidemiological behavior when used as a substrate for a standard susceptible-infected-susceptible compartmental model. We consider and discuss the differences in properties and behavior between RGGs and REDS as rewiring increases and as infection parameters are changed. We report considerable differences both between the network types and, in the case of REDS, between the two rewiring schemes. We conclude that REDS represent, with the application of these rewiring mechanisms, extremely useful and interesting tools in the study of social and epidemiological phenomena in synthetic complex networks.

Attack Vulnerability of Network Controllability

PubMed Central

2016-01-01

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability. PMID:27588941

Attack Vulnerability of Network Controllability.

PubMed

Lu, Zhe-Ming; Li, Xin-Feng

2016-01-01

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability.

Dynamical origins of the community structure of an online multi-layer society

NASA Astrophysics Data System (ADS)

Klimek, Peter; Diakonova, Marina; Eguíluz, Víctor M.; San Miguel, Maxi; Thurner, Stefan

2016-08-01

Social structures emerge as a result of individuals managing a variety of different social relationships. Societies can be represented as highly structured dynamic multiplex networks. Here we study the dynamical origins of the specific community structures of a large-scale social multiplex network of a human society that interacts in a virtual world of a massive multiplayer online game. There we find substantial differences in the community structures of different social actions, represented by the various layers in the multiplex network. Community sizes distributions are either fat-tailed or appear to be centered around a size of 50 individuals. To understand these observations we propose a voter model that is built around the principle of triadic closure. It explicitly models the co-evolution of node- and link-dynamics across different layers of the multiplex network. Depending on link and node fluctuation probabilities, the model exhibits an anomalous shattered fragmentation transition, where one layer fragments from one large component into many small components. The observed community size distributions are in good agreement with the predicted fragmentation in the model. This suggests that several detailed features of the fragmentation in societies can be traced back to the triadic closure processes.

Evaluating managed care's special telecommunications needs.

PubMed

Harrison, P; Schenk, D

1993-11-01

Right now, managed care is a vast cosmic soup. But whether its ultimate form is the result of a bureaucratic big bang or a series of small industry explosions, one thing seems clear: telecommunications is the framework upon which managed care will be built. Managed care's primary players--purchasers, providers and payors--have already discovered the unifying power of telecommunications within their respective worlds. However, as the three worlds collide, an entirely new set of special telecommunications needs arises. And most of these needs can be distilled into three basic requirements: bigger networks, faster networks and smarter networks.

Optimal Link Removal for Epidemic Mitigation: A Two-Way Partitioning Approach

PubMed Central

Enns, Eva A.; Mounzer, Jeffrey J.; Brandeau, Margaret L.

2011-01-01

The structure of the contact network through which a disease spreads may influence the optimal use of resources for epidemic control. In this work, we explore how to minimize the spread of infection via quarantining with limited resources. In particular, we examine which links should be removed from the contact network, given a constraint on the number of removable links, such that the number of nodes which are no longer at risk for infection is maximized. We show how this problem can be posed as a non-convex quadratically constrained quadratic program (QCQP), and we use this formulation to derive a link removal algorithm. The performance of our QCQP-based algorithm is validated on small Erdős-Renyi and small-world random graphs, and then tested on larger, more realistic networks, including a real-world network of injection drug use. We show that our approach achieves near optimal performance and out-perform so ther intuitive link removal algorithms, such as removing links in order of edge centrality. PMID:22115862

Disease transmission in territorial populations: the small-world network of Serengeti lions

PubMed Central

Craft, Meggan E.; Volz, Erik; Packer, Craig; Meyers, Lauren Ancel

2011-01-01

Territoriality in animal populations creates spatial structure that is thought to naturally buffer disease invasion. Often, however, territorial populations also include highly mobile, non-residential individuals that potentially serve as disease superspreaders. Using long-term data from the Serengeti Lion Project, we characterize the contact network structure of a territorial wildlife population and address the epidemiological impact of nomadic individuals. As expected, pride contacts are dominated by interactions with neighbouring prides and interspersed by encounters with nomads as they wander throughout the ecosystem. Yet the pride–pride network also includes occasional long-range contacts between prides, making it surprisingly small world and vulnerable to epidemics, even without nomads. While nomads increase both the local and global connectivity of the network, their epidemiological impact is marginal, particularly for diseases with short infectious periods like canine distemper virus. Thus, territoriality in Serengeti lions may be less protective and non-residents less important for disease transmission than previously considered. PMID:21030428

Role of physical and mental training in brain network configuration

PubMed Central

Foster, Philip P.

2015-01-01

It is hypothesized that the topology of brain networks is constructed by connecting nodes which may be continuously remodeled by appropriate training. Efficiency of physical and/or mental training on the brain relies on the flexibility of networks' architecture molded by local remodeling of proteins and synapses of excitatory neurons producing transformations in network topology. Continuous remodeling of proteins of excitatory neurons is fine-tuning the scaling and strength of excitatory synapses up or down via regulation of intra-cellular metabolic and regulatory networks of the genome-transcriptome-proteome interface. Alzheimer's disease is a model of “energy cost-driven small-world network disorder” with dysfunction of high-energy cost wiring as the network global efficiency is impaired by the deposition of an informed agent, the amyloid-β, selectively targeting high-degree nodes. In schizophrenia, the interconnectivity and density of rich-club networks are significantly reduced. Training-induced homeostatic synaptogenesis-enhancement, presumably via reconfiguration of brain networks into greater small-worldness, appears essential in learning, memory, and executive functions. A macroscopic cartography of creation-removal of synaptic connections in a macro-network, and at the intra-cellular scale, micro-networks regulate the physiological mechanisms for the preferential attachment of synapses. The strongest molecular relationship of exercise and functional connectivity was identified for brain-derived neurotrophic factor (BDNF). The allele variant, rs7294919, also shows a powerful relationship with the hippocampal volume. How the brain achieves this unique quest of reconfiguration remains a puzzle. What are the underlying mechanisms of synaptogenesis promoting communications brain ↔ muscle and brain ↔ brain in such trainings? What is the respective role of independent mental, physical, or combined-mental-physical trainings? Physical practice seems to be playing an instrumental role in the cognitive enhancement (brain ↔ muscle com.). However, mental training, meditation or virtual reality (films, games) require only minimal motor activity and cardio-respiratory stimulation. Therefore, other potential paths (brain ↔ brain com.) molding brain networks are nonetheless essential. Patients with motor neuron disease/injury (e.g., amyotrophic lateral sclerosis, traumatism) also achieve successful cognitive enhancement albeit they may only elicit mental practice. PMID:26157387

Role of physical and mental training in brain network configuration.

PubMed

Foster, Philip P

2015-01-01

It is hypothesized that the topology of brain networks is constructed by connecting nodes which may be continuously remodeled by appropriate training. Efficiency of physical and/or mental training on the brain relies on the flexibility of networks' architecture molded by local remodeling of proteins and synapses of excitatory neurons producing transformations in network topology. Continuous remodeling of proteins of excitatory neurons is fine-tuning the scaling and strength of excitatory synapses up or down via regulation of intra-cellular metabolic and regulatory networks of the genome-transcriptome-proteome interface. Alzheimer's disease is a model of "energy cost-driven small-world network disorder" with dysfunction of high-energy cost wiring as the network global efficiency is impaired by the deposition of an informed agent, the amyloid-β, selectively targeting high-degree nodes. In schizophrenia, the interconnectivity and density of rich-club networks are significantly reduced. Training-induced homeostatic synaptogenesis-enhancement, presumably via reconfiguration of brain networks into greater small-worldness, appears essential in learning, memory, and executive functions. A macroscopic cartography of creation-removal of synaptic connections in a macro-network, and at the intra-cellular scale, micro-networks regulate the physiological mechanisms for the preferential attachment of synapses. The strongest molecular relationship of exercise and functional connectivity was identified for brain-derived neurotrophic factor (BDNF). The allele variant, rs7294919, also shows a powerful relationship with the hippocampal volume. How the brain achieves this unique quest of reconfiguration remains a puzzle. What are the underlying mechanisms of synaptogenesis promoting communications brain ↔ muscle and brain ↔ brain in such trainings? What is the respective role of independent mental, physical, or combined-mental-physical trainings? Physical practice seems to be playing an instrumental role in the cognitive enhancement (brain ↔ muscle com.). However, mental training, meditation or virtual reality (films, games) require only minimal motor activity and cardio-respiratory stimulation. Therefore, other potential paths (brain ↔ brain com.) molding brain networks are nonetheless essential. Patients with motor neuron disease/injury (e.g., amyotrophic lateral sclerosis, traumatism) also achieve successful cognitive enhancement albeit they may only elicit mental practice.

Large-scale cortical volume correlation networks reveal disrupted small world patterns in Parkinson's disease.

PubMed

Wu, Qiong; Gao, Yang; Liu, Ai-Shi; Xie, Li-Zhi; Qian, Long; Yang, Xiao-Guang

2018-01-01

To date, the most frequently reported neuroimaging biomarkers in Parkinson's disease (PD) are direct brain imaging measurements focusing on local disrupted regions. However, the notion that PD is related to abnormal functional and structural connectivity has received support in the past few years. Here, we employed graph theory to analyze the structural co-variance networks derived from 50 PD patients and 48 normal controls (NC). Then, the small world properties of brain networks were assessed in the structural networks that were constructed based on cortical volume data. Our results showed that both the PD and NC groups had a small world architecture in brain structural networks. However, the PD patients had a higher characteristic path length and clustering coefficients compared with the NC group. With regard to the nodal centrality, 11 regions, including 3 association cortices, 5 paralimbic cortices, and 3 subcortical regions were identified as hubs in the PD group. In contrast, 10 regions, including 7 association cortical regions, 2 paralimbic cortical regions, and the primary motor cortex region, were identified as hubs. Moreover, the regional centrality was profoundly affected in PD patients, including decreased nodal centrality in the right inferior occipital gyrus and the middle temporal gyrus and increased nodal centrality in the right amygdala, the left caudate and the superior temporal gyrus. In addition, the structural cortical network of PD showed reduced topological stability for targeted attacks. Together, this study shows that the coordinated patterns of cortical volume network are widely altered in PD patients with a decrease in the efficiency of parallel information processing. These changes provide structural evidence to support the concept that the core pathophysiology of PD is associated with disruptive alterations in the coordination of large-scale brain networks that underlie high-level cognition. Copyright © 2017. Published by Elsevier B.V.

Inference of financial networks using the normalised mutual information rate.

PubMed

Goh, Yong Kheng; Hasim, Haslifah M; Antonopoulos, Chris G

2018-01-01

In this paper, we study data from financial markets, using the normalised Mutual Information Rate. We show how to use it to infer the underlying network structure of interrelations in the foreign currency exchange rates and stock indices of 15 currency areas. We first present the mathematical method and discuss its computational aspects, and apply it to artificial data from chaotic dynamics and to correlated normal-variates data. We then apply the method to infer the structure of the financial system from the time-series of currency exchange rates and stock indices. In particular, we study and reveal the interrelations among the various foreign currency exchange rates and stock indices in two separate networks, of which we also study their structural properties. Our results show that both inferred networks are small-world networks, sharing similar properties and having differences in terms of assortativity. Importantly, our work shows that global economies tend to connect with other economies world-wide, rather than creating small groups of local economies. Finally, the consistent interrelations depicted among the 15 currency areas are further supported by a discussion from the viewpoint of economics.

Handedness- and brain size-related efficiency differences in small-world brain networks: a resting-state functional magnetic resonance imaging study.

PubMed

Li, Meiling; Wang, Junping; Liu, Feng; Chen, Heng; Lu, Fengmei; Wu, Guorong; Yu, Chunshui; Chen, Huafu

2015-05-01

The human brain has been described as a complex network, which integrates information with high efficiency. However, the relationships between the efficiency of human brain functional networks and handedness and brain size remain unclear. Twenty-one left-handed and 32 right-handed healthy subjects underwent a resting-state functional magnetic resonance imaging scan. The whole brain functional networks were constructed by thresholding Pearson correlation matrices of 90 cortical and subcortical regions. Graph theory-based methods were employed to further analyze their topological properties. As expected, all participants demonstrated small-world topology, suggesting a highly efficient topological structure. Furthermore, we found that smaller brains showed higher local efficiency, whereas larger brains showed higher global efficiency, reflecting a suitable efficiency balance between local specialization and global integration of brain functional activity. Compared with right-handers, significant alterations in nodal efficiency were revealed in left-handers, involving the anterior and median cingulate gyrus, middle temporal gyrus, angular gyrus, and amygdala. Our findings indicated that the functional network organization in the human brain was associated with handedness and brain size.

Inference of financial networks using the normalised mutual information rate

PubMed Central

2018-01-01

In this paper, we study data from financial markets, using the normalised Mutual Information Rate. We show how to use it to infer the underlying network structure of interrelations in the foreign currency exchange rates and stock indices of 15 currency areas. We first present the mathematical method and discuss its computational aspects, and apply it to artificial data from chaotic dynamics and to correlated normal-variates data. We then apply the method to infer the structure of the financial system from the time-series of currency exchange rates and stock indices. In particular, we study and reveal the interrelations among the various foreign currency exchange rates and stock indices in two separate networks, of which we also study their structural properties. Our results show that both inferred networks are small-world networks, sharing similar properties and having differences in terms of assortativity. Importantly, our work shows that global economies tend to connect with other economies world-wide, rather than creating small groups of local economies. Finally, the consistent interrelations depicted among the 15 currency areas are further supported by a discussion from the viewpoint of economics. PMID:29420644

Approximating natural connectivity of scale-free networks based on largest eigenvalue

NASA Astrophysics Data System (ADS)

Tan, S.-Y.; Wu, J.; Li, M.-J.; Lu, X.

2016-06-01

It has been recently proposed that natural connectivity can be used to efficiently characterize the robustness of complex networks. The natural connectivity has an intuitive physical meaning and a simple mathematical formulation, which corresponds to an average eigenvalue calculated from the graph spectrum. However, as a network model close to the real-world system that widely exists, the scale-free network is found difficult to obtain its spectrum analytically. In this article, we investigate the approximation of natural connectivity based on the largest eigenvalue in both random and correlated scale-free networks. It is demonstrated that the natural connectivity of scale-free networks can be dominated by the largest eigenvalue, which can be expressed asymptotically and analytically to approximate natural connectivity with small errors. Then we show that the natural connectivity of random scale-free networks increases linearly with the average degree given the scaling exponent and decreases monotonically with the scaling exponent given the average degree. Moreover, it is found that, given the degree distribution, the more assortative a scale-free network is, the more robust it is. Experiments in real networks validate our methods and results.

Coordinated and uncoordinated optimization of networks

NASA Astrophysics Data System (ADS)

Brede, Markus

2010-06-01

In this paper, we consider spatial networks that realize a balance between an infrastructure cost (the cost of wire needed to connect the network in space) and communication efficiency, measured by average shortest path length. A global optimization procedure yields network topologies in which this balance is optimized. These are compared with network topologies generated by a competitive process in which each node strives to optimize its own cost-communication balance. Three phases are observed in globally optimal configurations for different cost-communication trade offs: (i) regular small worlds, (ii) starlike networks, and (iii) trees with a center of interconnected hubs. In the latter regime, i.e., for very expensive wire, power laws in the link length distributions P(w)∝w-α are found, which can be explained by a hierarchical organization of the networks. In contrast, in the local optimization process the presence of sharp transitions between different network regimes depends on the dimension of the underlying space. Whereas for d=∞ sharp transitions between fully connected networks, regular small worlds, and highly cliquish periphery-core networks are found, for d=1 sharp transitions are absent and the power law behavior in the link length distribution persists over a much wider range of link cost parameters. The measured power law exponents are in agreement with the hypothesis that the locally optimized networks consist of multiple overlapping suboptimal hierarchical trees.

Topology of the conceptual network of language

NASA Astrophysics Data System (ADS)

Motter, Adilson E.; de Moura, Alessandro P.; Lai, Ying-Cheng; Dasgupta, Partha

2002-06-01

We define two words in a language to be connected if they express similar concepts. The network of connections among the many thousands of words that make up a language is important not only for the study of the structure and evolution of languages, but also for cognitive science. We study this issue quantitatively, by mapping out the conceptual network of the English language, with the connections being defined by the entries in a Thesaurus dictionary. We find that this network presents a small-world structure, with an amazingly small average shortest path, and appears to exhibit an asymptotic scale-free feature with algebraic connectivity distribution.

Patterns of contact within the New Zealand poultry industry.

PubMed

Lockhart, C Y; Stevenson, M A; Rawdon, T G; Gerber, N; French, N P

2010-07-01

Members of the Poultry Industry Association and the Egg Producers Federation of New Zealand (n=420) were sent a questionnaire asking them to describe the type and frequency of on- and off-enterprise movements relating to feed, live birds and hatching eggs, table eggs and poultry product, and manure and waste litter. Social network analyses were used to describe patterns of contact among poultry enterprises and their associates for these four movement types. The response rate to the survey was 58% (244 out of 420). Network structures for enterprise-to-enterprise movements of feed, live birds and hatching eggs, and table egg and poultry product were characterised by 'hub and spoke' type structures with small-world characteristics. Small worlds were created by network hubs (e.g. feed suppliers and hatcheries) providing goods and services to larger numbers of client farms. In addition to hubs acting as the predominant source of material moving onto farms we identified enterprises acting as bridges between identified small worlds. The presence of these bridges is a concern, since their presence has the potential to facilitate the spread of hazards (e.g. feed contaminants, infectious agents carried within feed) more readily throughout the population. An ability to predict enterprises with these network characteristics on the basis of factors such as shed capacity, enterprise type, geographic location would be useful for developing risk-based approaches to disease prevention, surveillance, detection, response and control activities. Copyright (c) 2010 Elsevier B.V. All rights reserved.

Gene expression complex networks: synthesis, identification, and analysis.

PubMed

Lopes, Fabrício M; Cesar, Roberto M; Costa, Luciano Da F

2011-10-01

Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdös-Rényi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabási-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree variation, decreasing its network recovery rate with the increase of . The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods.

Stream On: Video Servers in the Real World.

ERIC Educational Resources Information Center

Tristram, Claire

1995-01-01

Despite plans for corporate training networks, digital ad-insertion systems, hotel video-on-demand, and interactive television, only small scale video networks presently work. Four case studies examine the design and implementation decisions for different markets: corporate; advertising; hotel; and commercial video via cable, satellite or…

Hemisphere- and gender-related differences in small-world brain networks: a resting-state functional MRI study.

PubMed

Tian, Lixia; Wang, Jinhui; Yan, Chaogan; He, Yong

2011-01-01

We employed resting-state functional MRI (R-fMRI) to investigate hemisphere- and gender-related differences in the topological organization of human brain functional networks. Brain networks were first constructed by measuring inter-regional temporal correlations of R-fMRI data within each hemisphere in 86 young, healthy, right-handed adults (38 males and 48 females) followed by a graph-theory analysis. The hemispheric networks exhibit small-world attributes (high clustering and short paths) that are compatible with previous results in the whole-brain functional networks. Furthermore, we found that compared with females, males have a higher normalized clustering coefficient in the right hemispheric network but a lower clustering coefficient in the left hemispheric network, suggesting a gender-hemisphere interaction. Moreover, we observed significant hemisphere-related differences in the regional nodal characteristics in various brain regions, such as the frontal and occipital regions (leftward asymmetry) and the temporal regions (rightward asymmetry), findings that are consistent with previous studies of brain structural and functional asymmetries. Together, our results suggest that the topological organization of human brain functional networks is associated with gender and hemispheres, and they provide insights into the understanding of functional substrates underlying individual differences in behaviors and cognition. Copyright © 2010 Elsevier Inc. All rights reserved.

Brain modularity controls the critical behavior of spontaneous activity.

PubMed

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

2014-03-13

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

Consensus, Polarization and Clustering of Opinions in Social Networks

DTIC Science & Technology

2013-06-01

values of τ , and consensus at larger values. Fig. 6 compares the phase transitions for three different network configurations: RGG, Erdos- Renyi graph and...Erdos- Renyi graph [25] is generated uniformly at random from the collection of all graphs which have n = 50 nodes and M = 120 edges. The small- world...0.6 0.8 1 Threshold τ N or m al iz ed A lg eb ra ic C on ne ct iv ity RGG Erdos− Renyi Small−World Fig. 6. Phase transitions using three

Features and heterogeneities in growing network models

NASA Astrophysics Data System (ADS)

Ferretti, Luca; Cortelezzi, Michele; Yang, Bin; Marmorini, Giacomo; Bianconi, Ginestra

2012-06-01

Many complex networks from the World Wide Web to biological networks grow taking into account the heterogeneous features of the nodes. The feature of a node might be a discrete quantity such as a classification of a URL document such as personal page, thematic website, news, blog, search engine, social network, etc., or the classification of a gene in a functional module. Moreover the feature of a node can be a continuous variable such as the position of a node in the embedding space. In order to account for these properties, in this paper we provide a generalization of growing network models with preferential attachment that includes the effect of heterogeneous features of the nodes. The main effect of heterogeneity is the emergence of an “effective fitness” for each class of nodes, determining the rate at which nodes acquire new links. The degree distribution exhibits a multiscaling behavior analogous to the the fitness model. This property is robust with respect to variations in the model, as long as links are assigned through effective preferential attachment. Beyond the degree distribution, in this paper we give a full characterization of the other relevant properties of the model. We evaluate the clustering coefficient and show that it disappears for large network size, a property shared with the Barabási-Albert model. Negative degree correlations are also present in this class of models, along with nontrivial mixing patterns among features. We therefore conclude that both small clustering coefficients and disassortative mixing are outcomes of the preferential attachment mechanism in general growing networks.

Searching for the most cost-effective strategy for controlling epidemics spreading on regular and small-world networks

PubMed Central

Kleczkowski, Adam; Oleś, Katarzyna; Gudowska-Nowak, Ewa; Gilligan, Christopher A.

2012-01-01

We present a combined epidemiological and economic model for control of diseases spreading on local and small-world networks. The disease is characterized by a pre-symptomatic infectious stage that makes detection and control of cases more difficult. The effectiveness of local (ring-vaccination or culling) and global control strategies is analysed by comparing the net present values of the combined cost of preventive treatment and illness. The optimal strategy is then selected by minimizing the total cost of the epidemic. We show that three main strategies emerge, with treating a large number of individuals (global strategy, GS), treating a small number of individuals in a well-defined neighbourhood of a detected case (local strategy) and allowing the disease to spread unchecked (null strategy, NS). The choice of the optimal strategy is governed mainly by a relative cost of palliative and preventive treatments. If the disease spreads within the well-defined neighbourhood, the local strategy is optimal unless the cost of a single vaccine is much higher than the cost associated with hospitalization. In the latter case, it is most cost-effective to refrain from prevention. Destruction of local correlations, either by long-range (small-world) links or by inclusion of many initial foci, expands the range of costs for which the NS is most cost-effective. The GS emerges for the case when the cost of prevention is much lower than the cost of treatment and there is a substantial non-local component in the disease spread. We also show that local treatment is only desirable if the disease spreads on a small-world network with sufficiently few long-range links; otherwise it is optimal to treat globally. In the mean-field case, there are only two optimal solutions, to treat all if the cost of the vaccine is low and to treat nobody if it is high. The basic reproduction ratio, R0, does not depend on the rate of responsive treatment in this case and the disease always invades (but might be stopped afterwards). The details of the local control strategy, and in particular the optimal size of the control neighbourhood, are determined by the epidemiology of the disease. The properties of the pathogen might not be known in advance for emerging diseases, but the broad choice of the strategy can be made based on economic analysis only. PMID:21653570

Searching for the most cost-effective strategy for controlling epidemics spreading on regular and small-world networks.

PubMed

Kleczkowski, Adam; Oleś, Katarzyna; Gudowska-Nowak, Ewa; Gilligan, Christopher A

2012-01-07

We present a combined epidemiological and economic model for control of diseases spreading on local and small-world networks. The disease is characterized by a pre-symptomatic infectious stage that makes detection and control of cases more difficult. The effectiveness of local (ring-vaccination or culling) and global control strategies is analysed by comparing the net present values of the combined cost of preventive treatment and illness. The optimal strategy is then selected by minimizing the total cost of the epidemic. We show that three main strategies emerge, with treating a large number of individuals (global strategy, GS), treating a small number of individuals in a well-defined neighbourhood of a detected case (local strategy) and allowing the disease to spread unchecked (null strategy, NS). The choice of the optimal strategy is governed mainly by a relative cost of palliative and preventive treatments. If the disease spreads within the well-defined neighbourhood, the local strategy is optimal unless the cost of a single vaccine is much higher than the cost associated with hospitalization. In the latter case, it is most cost-effective to refrain from prevention. Destruction of local correlations, either by long-range (small-world) links or by inclusion of many initial foci, expands the range of costs for which the NS is most cost-effective. The GS emerges for the case when the cost of prevention is much lower than the cost of treatment and there is a substantial non-local component in the disease spread. We also show that local treatment is only desirable if the disease spreads on a small-world network with sufficiently few long-range links; otherwise it is optimal to treat globally. In the mean-field case, there are only two optimal solutions, to treat all if the cost of the vaccine is low and to treat nobody if it is high. The basic reproduction ratio, R(0), does not depend on the rate of responsive treatment in this case and the disease always invades (but might be stopped afterwards). The details of the local control strategy, and in particular the optimal size of the control neighbourhood, are determined by the epidemiology of the disease. The properties of the pathogen might not be known in advance for emerging diseases, but the broad choice of the strategy can be made based on economic analysis only.

Bifurcations in models of a society of reasonable contrarians and conformists

NASA Astrophysics Data System (ADS)

Bagnoli, Franco; Rechtman, Raúl

2015-10-01

We study models of a society composed of a mixture of conformist and reasonable contrarian agents that at any instant hold one of two opinions. Conformists tend to agree with the average opinion of their neighbors and reasonable contrarians tend to disagree, but revert to a conformist behavior in the presence of an overwhelming majority, in line with psychological experiments. The model is studied in the mean-field approximation and on small-world and scale-free networks. In the mean-field approximation, a large fraction of conformists triggers a polarization of the opinions, a pitchfork bifurcation, while a majority of reasonable contrarians leads to coherent oscillations, with an alternation of period-doubling and pitchfork bifurcations up to chaos. Similar scenarios are obtained by changing the fraction of long-range rewiring and the parameter of scale-free networks related to the average connectivity.

Bifurcations in models of a society of reasonable contrarians and conformists.

PubMed

Bagnoli, Franco; Rechtman, Raúl

2015-10-01

We study models of a society composed of a mixture of conformist and reasonable contrarian agents that at any instant hold one of two opinions. Conformists tend to agree with the average opinion of their neighbors and reasonable contrarians tend to disagree, but revert to a conformist behavior in the presence of an overwhelming majority, in line with psychological experiments. The model is studied in the mean-field approximation and on small-world and scale-free networks. In the mean-field approximation, a large fraction of conformists triggers a polarization of the opinions, a pitchfork bifurcation, while a majority of reasonable contrarians leads to coherent oscillations, with an alternation of period-doubling and pitchfork bifurcations up to chaos. Similar scenarios are obtained by changing the fraction of long-range rewiring and the parameter of scale-free networks related to the average connectivity.

Constraints and entropy in a model of network evolution

NASA Astrophysics Data System (ADS)

Tee, Philip; Wakeman, Ian; Parisis, George; Dawes, Jonathan; Kiss, István Z.

2017-11-01

Barabási-Albert's "Scale Free" model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however, indicates that the model is in some cases, only a rough approximation to the dynamical evolution of real networks. In particular, the exponent γ of the power law distribution of degree is predicted by the model to be exactly 3, whereas in a number of real world networks it has values between 1.2 and 2.9. In addition, the degree distributions of real networks exhibit cut offs at high node degree, which indicates the existence of maximal node degrees for these networks. In this paper we propose a simple extension to the "Scale Free" model, which offers better agreement with the experimental data. This improvement is satisfying, but the model still does not explain why the attachment probabilities should favor high degree nodes, or indeed how constraints arrive in non-physical networks. Using recent advances in the analysis of the entropy of graphs at the node level we propose a first principles derivation for the "Scale Free" and "constraints" model from thermodynamic principles, and demonstrate that both preferential attachment and constraints could arise as a natural consequence of the second law of thermodynamics.

Assortative mating and mutation diffusion in spatial evolutionary systems

NASA Astrophysics Data System (ADS)

Paley, C. J.; Taraskin, S. N.; Elliott, S. R.

2010-04-01

The influence of spatial structure on the equilibrium properties of a sexual population model defined on networks is studied numerically. Using a small-world-like topology of the networks as an investigative tool, the contributions to the fitness of assortative mating and of global mutant spread properties are considered. Simple measures of nearest-neighbor correlations and speed of spread of mutants through the system have been used to confirm that both of these dynamics are important contributory factors to the fitness. It is found that assortative mating increases the fitness of populations. Quick global spread of favorable mutations is shown to be a key factor increasing the equilibrium fitness of populations.

Complex network description of the ionosphere

NASA Astrophysics Data System (ADS)

Lu, Shikun; Zhang, Hao; Li, Xihai; Li, Yihong; Niu, Chao; Yang, Xiaoyun; Liu, Daizhi

2018-03-01

Complex networks have emerged as an essential approach of geoscience to generate novel insights into the nature of geophysical systems. To investigate the dynamic processes in the ionosphere, a directed complex network is constructed, based on a probabilistic graph of the vertical total electron content (VTEC) from 2012. The results of the power-law hypothesis test show that both the out-degree and in-degree distribution of the ionospheric network are not scale-free. Thus, the distribution of the interactions in the ionosphere is homogenous. None of the geospatial positions play an eminently important role in the propagation of the dynamic ionospheric processes. The spatial analysis of the ionospheric network shows that the interconnections principally exist between adjacent geographical locations, indicating that the propagation of the dynamic processes primarily depends on the geospatial distance in the ionosphere. Moreover, the joint distribution of the edge distances with respect to longitude and latitude directions shows that the dynamic processes travel further along the longitude than along the latitude in the ionosphere. The analysis of small-world-ness indicates that the ionospheric network possesses the small-world property, which can make the ionosphere stable and efficient in the propagation of dynamic processes.

Disorganized cortical thickness covariance network in major depressive disorder implicated by aberrant hubs in large-scale networks

PubMed Central

Wang, Tao; Wang, Kangcheng; Qu, Hang; Zhou, Jingjing; Li, Qi; Deng, Zhou; Du, Xue; Lv, Fajin; Ren, Gaoping; Guo, Jing; Qiu, Jiang; Xie, Peng

2016-01-01

Major depressive disorder is associated with abnormal anatomical and functional connectivity, yet alterations in whole cortical thickness topology remain unknown. Here, we examined cortical thickness in medication-free adult depression patients (n = 76) and matched healthy controls (n = 116). Inter-regional correlation was performed to construct brain networks. By applying graph theory analysis, global (i.e., small-worldness) and regional (centrality) topology was compared between major depressive disorder patients and healthy controls. We found that in depression patients, topological organization of the cortical thickness network shifted towards randomness, and lower small-worldness was driven by a decreased clustering coefficient. Consistently, altered nodal centrality was identified in the isthmus of the cingulate cortex, insula, supra-marginal gyrus, middle temporal gyrus and inferior parietal gyrus, all of which are components within the default mode, salience and central executive networks. Disrupted nodes anchored in the default mode and executive networks were associated with depression severity. The brain systems involved sustain core symptoms in depression and implicate a structural basis for depression. Our results highlight the possibility that developmental and genetic factors are crucial to understand the neuropathology of depression. PMID:27302485

Promotion of cooperation induced by appropriate payoff aspirations in a small-world networked game

NASA Astrophysics Data System (ADS)

Chen, Xiaojie; Wang, Long

2008-01-01

Based on learning theory, we adopt a stochastic learning updating rule to investigate the evolution of cooperation in the Prisoner’s Dilemma game on Newman-Watts small-world networks with different payoff aspiration levels. Interestingly, simulation results show that the mechanism of intermediate aspiration promoting cooperation resembles a resonancelike behavior, and there exists a ping-pong vibration of cooperation for large payoff aspiration. To explain the nontrivial dependence of the cooperation level on the aspiration level, we investigate the fractions of links, provide analytical results of the cooperation level, and find that the simulation results are in close agreement with analytical ones. Our work may be helpful in understanding the cooperative behavior induced by the aspiration level in society.

Evolution versus "intelligent design": comparing the topology of protein-protein interaction networks to the Internet.

PubMed

Yang, Q; Siganos, G; Faloutsos, M; Lonardi, S

2006-01-01

Recent research efforts have made available genome-wide, high-throughput protein-protein interaction (PPI) maps for several model organisms. This has enabled the systematic analysis of PPI networks, which has become one of the primary challenges for the system biology community. In this study, we attempt to understand better the topological structure of PPI networks by comparing them against man-made communication networks, and more specifically, the Internet. Our comparative study is based on a comprehensive set of graph metrics. Our results exhibit an interesting dichotomy. On the one hand, both networks share several macroscopic properties such as scale-free and small-world properties. On the other hand, the two networks exhibit significant topological differences, such as the cliqueishness of the highest degree nodes. We attribute these differences to the distinct design principles and constraints that both networks are assumed to satisfy. We speculate that the evolutionary constraints that favor the survivability and diversification are behind the building process of PPI networks, whereas the leading force in shaping the Internet topology is a decentralized optimization process geared towards efficient node communication.

Toward link predictability of complex networks

PubMed Central

Lü, Linyuan; Pan, Liming; Zhou, Tao; Zhang, Yi-Cheng; Stanley, H. Eugene

2015-01-01

The organization of real networks usually embodies both regularities and irregularities, and, in principle, the former can be modeled. The extent to which the formation of a network can be explained coincides with our ability to predict missing links. To understand network organization, we should be able to estimate link predictability. We assume that the regularity of a network is reflected in the consistency of structural features before and after a random removal of a small set of links. Based on the perturbation of the adjacency matrix, we propose a universal structural consistency index that is free of prior knowledge of network organization. Extensive experiments on disparate real-world networks demonstrate that (i) structural consistency is a good estimation of link predictability and (ii) a derivative algorithm outperforms state-of-the-art link prediction methods in both accuracy and robustness. This analysis has further applications in evaluating link prediction algorithms and monitoring sudden changes in evolving network mechanisms. It will provide unique fundamental insights into the above-mentioned academic research fields, and will foster the development of advanced information filtering technologies of interest to information technology practitioners. PMID:25659742

Properties of interaction networks underlying the minority game.

PubMed

Caridi, Inés

2014-11-01

The minority game is a well-known agent-based model with no explicit interaction among its agents. However, it is known that they interact through the global magnitudes of the model and through their strategies. In this work we have attempted to formalize the implicit interactions among minority game agents as if they were links on a complex network. We have defined the link between two agents by quantifying the similarity between them. This link definition is based on the information of the instance of the game (the set of strategies assigned to each agent at the beginning) without any dynamic information on the game and brings about a static, unweighed and undirected network. We have analyzed the structure of the resulting network for different parameters, such as the number of agents (N) and the agent's capacity to process information (m), always taking into account games with two strategies per agent. In the region of crowd effects of the model, the resulting networks structure is a small-world network, whereas in the region where the behavior of the minority game is the same as in a game of random decisions, networks become a random network of Erdos-Renyi. The transition between these two types of networks is slow, without any peculiar feature of the network in the region of the coordination among agents. Finally, we have studied the resulting static networks for the full strategy minority game model, a maximal instance of the minority game in which all possible agents take part in the game. We have explicitly calculated the degree distribution of the full strategy minority game network and, on the basis of this analytical result, we have estimated the degree distribution of the minority game network, which is in accordance with computational results.

Simulating Issue Networks in Small Classes using the World Wide Web.

ERIC Educational Resources Information Center

Josefson, Jim; Casey, Kelly

2000-01-01

Provides background information on simulations and active learning. Discusses the use of simulations in political science courses. Describes a simulation exercise where students performed specific institutional role playing, simulating the workings of a single congressional issue network, based on the reauthorization of the Endangered Species Act.…

Multilevel Deficiency of White Matter Connectivity Networks in Alzheimer's Disease: A Diffusion MRI Study with DTI and HARDI Models.

PubMed

Wang, Tao; Shi, Feng; Jin, Yan; Yap, Pew-Thian; Wee, Chong-Yaw; Zhang, Jianye; Yang, Cece; Li, Xia; Xiao, Shifu; Shen, Dinggang

2016-01-01

Alzheimer's disease (AD) is the most common form of dementia in elderly people. It is an irreversible and progressive brain disease. In this paper, we utilized diffusion-weighted imaging (DWI) to detect abnormal topological organization of white matter (WM) structural networks. We compared the differences between WM connectivity characteristics at global, regional, and local levels in 26 patients with probable AD and 16 normal control (NC) elderly subjects, using connectivity networks constructed with the diffusion tensor imaging (DTI) model and the high angular resolution diffusion imaging (HARDI) model, respectively. At the global level, we found that the WM structural networks of both AD and NC groups had a small-world topology; however, the AD group showed a significant decrease in both global and local efficiency, but an increase in clustering coefficient and the average shortest path length. We further found that the AD patients had significantly decreased nodal efficiency at the regional level, as well as weaker connections in multiple local cortical and subcortical regions, such as precuneus, temporal lobe, hippocampus, and thalamus. The HARDI model was found to be more advantageous than the DTI model, as it was more sensitive to the deficiencies in AD at all of the three levels.

A Theory of How Columns in the Neocortex Enable Learning the Structure of the World

PubMed Central

Hawkins, Jeff; Ahmad, Subutai; Cui, Yuwei

2017-01-01

Neocortical regions are organized into columns and layers. Connections between layers run mostly perpendicular to the surface suggesting a columnar functional organization. Some layers have long-range excitatory lateral connections suggesting interactions between columns. Similar patterns of connectivity exist in all regions but their exact role remain a mystery. In this paper, we propose a network model composed of columns and layers that performs robust object learning and recognition. Each column integrates its changing input over time to learn complete predictive models of observed objects. Excitatory lateral connections across columns allow the network to more rapidly infer objects based on the partial knowledge of adjacent columns. Because columns integrate input over time and space, the network learns models of complex objects that extend well beyond the receptive field of individual cells. Our network model introduces a new feature to cortical columns. We propose that a representation of location relative to the object being sensed is calculated within the sub-granular layers of each column. The location signal is provided as an input to the network, where it is combined with sensory data. Our model contains two layers and one or more columns. Simulations show that using Hebbian-like learning rules small single-column networks can learn to recognize hundreds of objects, with each object containing tens of features. Multi-column networks recognize objects with significantly fewer movements of the sensory receptors. Given the ubiquity of columnar and laminar connectivity patterns throughout the neocortex, we propose that columns and regions have more powerful recognition and modeling capabilities than previously assumed. PMID:29118696

Increased Small-World Network Topology Following Deployment-Acquired Traumatic Brain Injury Associated with the Development of Post-Traumatic Stress Disorder.

PubMed

Rowland, Jared A; Stapleton-Kotloski, Jennifer R; Dobbins, Dorothy L; Rogers, Emily; Godwin, Dwayne W; Taber, Katherine H

2018-05-01

Cross-sectional and longitudinal studies in active duty and veteran cohorts have both demonstrated that deployment-acquired traumatic brain injury (TBI) is an independent risk factor for developing post-traumatic stress disorder (PTSD), beyond confounds such as combat exposure, physical injury, predeployment TBI, and pre-deployment psychiatric symptoms. This study investigated how resting-state brain networks differ between individuals who developed PTSD and those who did not following deployment-acquired TBI. Participants included postdeployment veterans with deployment-acquired TBI history both with and without current PTSD diagnosis. Graph metrics, including small-worldness, clustering coefficient, and modularity, were calculated from individually constructed whole-brain networks based on 5-min eyes-open resting-state magnetoencephalography (MEG) recordings. Analyses were adjusted for age and premorbid IQ. Results demonstrated that participants with current PTSD displayed higher levels of small-worldness, F(1,12) = 5.364, p < 0.039, partial eta squared = 0.309, and Cohen's d = 0.972, and clustering coefficient, F(1, 12) = 12.204, p < 0.004, partial eta squared = 0.504, and Cohen's d = 0.905, than participants without current PTSD. There were no between-group differences in modularity or the number of modules present. These findings are consistent with a hyperconnectivity hypothesis of the effect of TBI history on functional networks rather than a disconnection hypothesis, demonstrating increased levels of clustering coefficient rather than a decrease as might be expected; however, these results do not account for potential changes in brain structure. These results demonstrate the potential pathological sequelae of changes in functional brain networks following deployment-acquired TBI and represent potential neurobiological changes associated with deployment-acquired TBI that may increase the risk of subsequently developing PTSD.

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

NASA Astrophysics Data System (ADS)

Kim, Sang-Yoon; Lim, Woochang

2013-07-01

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

A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities

NASA Astrophysics Data System (ADS)

Muscoloni, Alessandro; Vittorio Cannistraci, Carlo

2018-05-01

The investigation of the hidden metric space behind complex network topologies is a fervid topic in current network science and the hyperbolic space is one of the most studied, because it seems associated to the structural organization of many real complex systems. The popularity-similarity-optimization (PSO) model simulates how random geometric graphs grow in the hyperbolic space, generating realistic networks with clustering, small-worldness, scale-freeness and rich-clubness. However, it misses to reproduce an important feature of real complex networks, which is the community organization. The geometrical-preferential-attachment (GPA) model was recently developed in order to confer to the PSO also a soft community structure, which is obtained by forcing different angular regions of the hyperbolic disk to have a variable level of attractiveness. However, the number and size of the communities cannot be explicitly controlled in the GPA, which is a clear limitation for real applications. Here, we introduce the nonuniform PSO (nPSO) model. Differently from GPA, the nPSO generates synthetic networks in the hyperbolic space where heterogeneous angular node attractiveness is forced by sampling the angular coordinates from a tailored nonuniform probability distribution (for instance a mixture of Gaussians). The nPSO differs from GPA in other three aspects: it allows one to explicitly fix the number and size of communities; it allows one to tune their mixing property by means of the network temperature; it is efficient to generate networks with high clustering. Several tests on the detectability of the community structure in nPSO synthetic networks and wide investigations on their structural properties confirm that the nPSO is a valid and efficient model to generate realistic complex networks with communities.

Altered brain functional networks in people with Internet gaming disorder: Evidence from resting-state fMRI.

PubMed

Wang, Lingxiao; Wu, Lingdan; Lin, Xiao; Zhang, Yifen; Zhou, Hongli; Du, Xiaoxia; Dong, Guangheng

2016-08-30

Although numerous neuroimaging studies have detected structural and functional abnormality in specific brain regions and connections in subjects with Internet gaming disorder (IGD), the topological organization of the whole-brain network in IGD remain unclear. In this study, we applied graph theoretical analysis to explore the intrinsic topological properties of brain networks in Internet gaming disorder (IGD). 37 IGD subjects and 35 matched healthy control (HC) subjects underwent a resting-state functional magnetic resonance imaging scan. The functional networks were constructed by thresholding partial correlation matrices of 90 brain regions. Then we applied graph-based approaches to analysis their topological attributes, including small-worldness, nodal metrics, and efficiency. Both IGD and HC subjects show efficient and economic brain network, and small-world topology. Although there was no significant group difference in global topology metrics, the IGD subjects showed reduced regional centralities in the prefrontal cortex, left posterior cingulate cortex, right amygdala, and bilateral lingual gyrus, and increased functional connectivity in sensory-motor-related brain networks compared to the HC subjects. These results imply that people with IGD may be associated with functional network dysfunction, including impaired executive control and emotional management, but enhanced coordination among visual, sensorimotor, auditory and visuospatial systems. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Empirical analysis of online social networks in the age of Web 2.0

NASA Astrophysics Data System (ADS)

Fu, Feng; Liu, Lianghuan; Wang, Long

2008-01-01

Today the World Wide Web is undergoing a subtle but profound shift to Web 2.0, to become more of a social web. The use of collaborative technologies such as blogs and social networking site (SNS) leads to instant online community in which people communicate rapidly and conveniently with each other. Moreover, there are growing interest and concern regarding the topological structure of these new online social networks. In this paper, we present empirical analysis of statistical properties of two important Chinese online social networks-a blogging network and an SNS open to college students. They are both emerging in the age of Web 2.0. We demonstrate that both networks possess small-world and scale-free features already observed in real-world and artificial networks. In addition, we investigate the distribution of topological distance. Furthermore, we study the correlations between degree (in/out) and degree (in/out), clustering coefficient and degree, popularity (in terms of number of page views) and in-degree (for the blogging network), respectively. We find that the blogging network shows disassortative mixing pattern, whereas the SNS network is an assortative one. Our research may help us to elucidate the self-organizing structural characteristics of these online social networks embedded in technical forms.

Revealing the Hidden Language of Complex Networks

PubMed Central

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

2014-01-01

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

LCOGT: A World-Wide Network of Robotic Telescopes

NASA Astrophysics Data System (ADS)

Brown, T.

2013-05-01

Las Cumbres Observatory Global Telescope (LCOGT) is an organization dedicated to time-domain astronomy. To carry out the necessary observations in fields such as supernovae, extrasolar planets, small solar-system bodies, and pulsating stars, we have developed and are now deploying a set of robotic optical telescopes at sites around the globe. In this talk I will concentrate on the core of this network, consisting of up to 15 identical 1m telescopes deployed across multiple sites in both the northern and southern hemispheres. I will summarize the technical and performance aspect of these telescopes, including both their imaging and their anticipated spectroscopic capabilities. But I will also delve into the network organization, including communication among telescopes (to assure that observations are properly carried out), interactions among the institutions and scientists who will use the network (to optimize the scientific returns), and our funding model (which until now has relied entirely on one private donor, but will soon require funding from outside sources, if the full potential of the network is to be achieved).

A dataset on human navigation strategies in foreign networked systems.

PubMed

Kőrösi, Attila; Csoma, Attila; Rétvári, Gábor; Heszberger, Zalán; Bíró, József; Tapolcai, János; Pelle, István; Klajbár, Dávid; Novák, Márton; Halasi, Valentina; Gulyás, András

2018-03-13

Humans are involved in various real-life networked systems. The most obvious examples are social and collaboration networks but the language and the related mental lexicon they use, or the physical map of their territory can also be interpreted as networks. How do they find paths between endpoints in these networks? How do they obtain information about a foreign networked world they find themselves in, how they build mental model for it and how well they succeed in using it? Large, open datasets allowing the exploration of such questions are hard to find. Here we report a dataset collected by a smartphone application, in which players navigate between fixed length source and destination English words step-by-step by changing only one letter at a time. The paths reflect how the players master their navigation skills in such a foreign networked world. The dataset can be used in the study of human mental models for the world around us, or in a broader scope to investigate the navigation strategies in complex networked systems.

Research on Some Bus Transport Networks with Random Overlapping Clique Structure

NASA Astrophysics Data System (ADS)

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

2008-11-01

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

Resting State Network Topology of the Ferret Brain

PubMed Central

Zhou, Zhe Charles; Salzwedel, Andrew P.; Radtke-Schuller, Susanne; Li, Yuhui; Sellers, Kristin K.; Gilmore, John H.; Shih, Yen-Yu Ian; Fröhlich, Flavio; Gao, Wei

2016-01-01

Resting state functional magnetic resonance imaging (rsfMRI) has emerged as a versatile tool for non-invasive measurement of functional connectivity patterns in the brain. RsfMRI brain dynamics in rodents, non-human primates, and humans share similar properties; however, little is known about the resting state functional connectivity patterns in the ferret, an animal model with high potential for developmental and cognitive translational study. To address this knowledge-gap, we performed rsfMRI on anesthetized ferrets using a 9.4 tesla MRI scanner, and subsequently performed group-level independent component analysis (gICA) to identify functionally connected brain networks. Group-level ICA analysis revealed distributed sensory, motor, and higher-order networks in the ferret brain. Subsequent connectivity analysis showed interconnected higher-order networks that constituted a putative default mode network (DMN), a network that exhibits altered connectivity in neuropsychiatric disorders. Finally, we assessed ferret brain topological efficiency using graph theory analysis and found that the ferret brain exhibits small-world properties. Overall, these results provide additional evidence for pan-species resting-state networks, further supporting ferret-based studies of sensory and cognitive function. PMID:27596024

Technological Networks

NASA Astrophysics Data System (ADS)

Mitra, Bivas

The study of networks in the form of mathematical graph theory is one of the fundamental pillars of discrete mathematics. However, recent years have witnessed a substantial new movement in network research. The focus of the research is shifting away from the analysis of small graphs and the properties of individual vertices or edges to consideration of statistical properties of large scale networks. This new approach has been driven largely by the availability of technological networks like the Internet [12], World Wide Web network [2], etc. that allow us to gather and analyze data on a scale far larger than previously possible. At the same time, technological networks have evolved as a socio-technological system, as the concepts of social systems that are based on self-organization theory have become unified in technological networks [13]. In today’s society, we have a simple and universal access to great amounts of information and services. These information services are based upon the infrastructure of the Internet and the World Wide Web. The Internet is the system composed of ‘computers’ connected by cables or some other form of physical connections. Over this physical network, it is possible to exchange e-mails, transfer files, etc. On the other hand, the World Wide Web (commonly shortened to the Web) is a system of interlinked hypertext documents accessed via the Internet where nodes represent web pages and links represent hyperlinks between the pages. Peer-to-peer (P2P) networks [26] also have recently become a popular medium through which huge amounts of data can be shared. P2P file sharing systems, where files are searched and downloaded among peers without the help of central servers, have emerged as a major component of Internet traffic. An important advantage in P2P networks is that all clients provide resources, including bandwidth, storage space, and computing power. In this chapter, we discuss these technological networks in detail. The review is organized as follows. Section 2 presents an introduction to the Internet and different protocols related to it. This section also specifies the socio-technological properties of the Internet, like scale invariance, the small-world property, network resilience, etc. Section 3 describes the P2P networks, their categorization, and other related issues like search, stability, etc. Section 4 concludes the chapter.

Dynamics of financial crises in the world trade network

NASA Astrophysics Data System (ADS)

Askari, Marziyeh; Shirazi, Homayoun; Aghababaei Samani, Keivan

2018-07-01

A simple dynamical model is introduced to simulate the spreading of financial crises in the world trade network. In this model a directed network is constructed in which a weighted and directed link indicates the export value between two countries. The weights are subject to the change by a simple dynamical rule. The process begins with a crisis, i.e. a sudden decrease in the export value of a certain country and spreads throughout the whole network. We compare our results with the real values corresponding to the global financial crisis of 2008 and show that the results of our model are in good agreement with reality.

Network topology of an experimental futures exchange

NASA Astrophysics Data System (ADS)

Wang, S. C.; Tseng, J. J.; Tai, C. C.; Lai, K. H.; Wu, W. S.; Chen, S. H.; Li, S. P.

2008-03-01

Many systems of different nature exhibit scale free behaviors. Economic systems with power law distribution in the wealth are one of the examples. To better understand the working behind the complexity, we undertook an experiment recording the interactions between market participants. A Web server was setup to administer the exchange of futures contracts whose liquidation prices were coupled to event outcomes. After free registration, participants started trading to compete for the money prizes upon maturity of the futures contracts at the end of the experiment. The evolving `cash' flow network was reconstructed from the transactions between players. We show that the network topology is hierarchical, disassortative and small-world with a power law exponent of 1.02±0.09 in the degree distribution after an exponential decay correction. The small-world property emerged early in the experiment while the number of participants was still small. We also show power law-like distributions of the net incomes and inter-transaction time intervals. Big winners and losers are associated with high degree, high betweenness centrality, low clustering coefficient and low degree-correlation. We identify communities in the network as groups of the like-minded. The distribution of the community sizes is shown to be power-law distributed with an exponent of 1.19±0.16.

Surname complex network for Brazil and Portugal

NASA Astrophysics Data System (ADS)

Ferreira, G. D.; Viswanathan, G. M.; da Silva, L. R.; Herrmann, H. J.

2018-06-01

We present a study of social networks based on the analysis of Brazilian and Portuguese family names (surnames). We construct networks whose nodes are names of families and whose edges represent parental relations between two families. From these networks we extract the connectivity distribution, clustering coefficient, shortest path and centrality. We find that the connectivity distribution follows an approximate power law. We associate the number of hubs, centrality and entropy to the degree of miscegenation in the societies in both countries. Our results show that Portuguese society has a higher miscegenation degree than Brazilian society. All networks analyzed lead to approximate inverse square power laws in the degree distribution. We conclude that the thermodynamic limit is reached for small networks (3 or 4 thousand nodes). The assortative mixing of all networks is negative, showing that the more connected vertices are connected to vertices with lower connectivity. Finally, the network of surnames presents some small world characteristics.

Time reversibility of quantum diffusion in small-world networks

NASA Astrophysics Data System (ADS)

Han, Sung-Guk; Kim, Beom Jun

2012-02-01

We study the time-reversal dynamics of a tight-binding electron in the Watts-Strogatz (WS) small-world networks. The localized initial wave packet at time t = 0 diffuses as time proceeds until the time-reversal operation, together with the momentum perturbation of the strength η, is made at the reversal time T. The time irreversibility is measured by I = |Π( t = 2 T) - Π( t = 0)|, where Π is the participation ratio gauging the extendedness of the wavefunction and for convenience, t is measured forward even after the time reversal. When η = 0, the time evolution after T makes the wavefunction at t = 2 T identical to the one at t = 0, and we find I = 0, implying a null irreversibility or a complete reversibility. On the other hand, as η is increased from zero, the reversibility becomes weaker, and we observe enhancement of the irreversibility. We find that I linearly increases with increasing η in the weakly-perturbed region, and that the irreversibility is much stronger in the WS network than in the local regular network.

Small Worldness in Dense and Weighted Connectomes

NASA Astrophysics Data System (ADS)

Colon-Perez, Luis; Couret, Michelle; Triplett, William; Price, Catherine; Mareci, Thomas

2016-05-01

The human brain is a heterogeneous network of connected functional regions; however, most brain network studies assume that all brain connections can be described in a framework of binary connections. The brain is a complex structure of white matter tracts connected by a wide range of tract sizes, which suggests a broad range of connection strengths. Therefore, the assumption that the connections are binary yields an incomplete picture of the brain. Various thresholding methods have been used to remove spurious connections and reduce the graph density in binary networks. But these thresholds are arbitrary and make problematic the comparison of networks created at different thresholds. The heterogeneity of connection strengths can be represented in graph theory by applying weights to the network edges. Using our recently introduced edge weight parameter, we estimated the topological brain network organization using a complimentary weighted connectivity framework to the traditional framework of a binary network. To examine the reproducibility of brain networks in a controlled condition, we studied the topological network organization of a single healthy individual by acquiring 10 repeated diffusion-weighted magnetic resonance image datasets, over a one-month period on the same scanner, and analyzing these networks with deterministic tractography. We applied a threshold to both the binary and weighted networks and determined that the extra degree of freedom that comes with the framework of weighting network connectivity provides a robust result as any threshold level. The proposed weighted connectivity framework provides a stable result and is able to demonstrate the small world property of brain networks in situations where the binary framework is inadequate and unable to demonstrate this network property.

Interplay between cooperation-enhancing mechanisms in evolutionary games with tag-mediated interactions

NASA Astrophysics Data System (ADS)

Hadzibeganovic, Tarik; Stauffer, Dietrich; Han, Xiao-Pu

2018-04-01

Cooperation is fundamental for the long-term survival of biological, social, and technological networks. Previously, mechanisms for the enhancement of cooperation, such as network reciprocity, have largely been studied in isolation and with often inconclusive findings. Here, we present an evolutionary, multiagent-based, and spatially explicit computer model to specifically address the interactive interplay between such mechanisms. We systematically investigate the effects of phenotypic diversity, network structure, and rewards on cooperative behavior emerging in a population of reproducing artificial decision makers playing tag-mediated evolutionary games. Cooperative interactions are rewarded such that both the benefits of recipients and costs of donators are affected by the reward size. The reward size is determined by the number of cooperative acts occurring within a given reward time frame. Our computational experiments reveal that small reward frames promote unconditional cooperation in populations with both low and high diversity, whereas large reward frames lead to cycles of conditional and unconditional strategies at high but not at low diversity. Moreover, an interaction between rewards and spatial structure shows that relative to small reward frames, there is a strong difference between the frequency of conditional cooperators populating rewired versus non-rewired networks when the reward frame is large. Notably, in a less diverse population, the total number of defections is comparable across different network topologies, whereas in more diverse environments defections become more frequent in a regularly structured than in a rewired, small-world network of contacts. Acknowledging the importance of such interaction effects in social dilemmas will have inevitable consequences for the future design of cooperation-enhancing protocols in large-scale, distributed, and decentralized systems such as peer-to-peer networks.

A toolbox model of evolution of metabolic pathways on networks of arbitrary topology.

PubMed

Pang, Tin Yau; Maslov, Sergei

2011-05-01

In prokaryotic genomes the number of transcriptional regulators is known to be proportional to the square of the total number of protein-coding genes. A toolbox model of evolution was recently proposed to explain this empirical scaling for metabolic enzymes and their regulators. According to its rules, the metabolic network of an organism evolves by horizontal transfer of pathways from other species. These pathways are part of a larger "universal" network formed by the union of all species-specific networks. It remained to be understood, however, how the topological properties of this universal network influence the scaling law of functional content of genomes in the toolbox model. Here we answer this question by first analyzing the scaling properties of the toolbox model on arbitrary tree-like universal networks. We prove that critical branching topology, in which the average number of upstream neighbors of a node is equal to one, is both necessary and sufficient for quadratic scaling. We further generalize the rules of the model to incorporate reactions with multiple substrates/products as well as branched and cyclic metabolic pathways. To achieve its metabolic tasks, the new model employs evolutionary optimized pathways with minimal number of reactions. Numerical simulations of this realistic model on the universal network of all reactions in the KEGG database produced approximately quadratic scaling between the number of regulated pathways and the size of the metabolic network. To quantify the geometrical structure of individual pathways, we investigated the relationship between their number of reactions, byproducts, intermediate, and feedback metabolites. Our results validate and explain the ubiquitous appearance of the quadratic scaling for a broad spectrum of topologies of underlying universal metabolic networks. They also demonstrate why, in spite of "small-world" topology, real-life metabolic networks are characterized by a broad distribution of pathway lengths and sizes of metabolic regulons in regulatory networks.

Functional organization of intrinsic connectivity networks in Chinese-chess experts.

PubMed

Duan, Xujun; Long, Zhiliang; Chen, Huafu; Liang, Dongmei; Qiu, Lihua; Huang, Xiaoqi; Liu, Timon Cheng-Yi; Gong, Qiyong

2014-04-16

The functional architecture of the human brain has been extensively described in terms of functional connectivity networks, detected from the low-frequency coherent neuronal fluctuations during a resting state condition. Accumulating evidence suggests that the overall organization of functional connectivity networks is associated with individual differences in cognitive performance and prior experience. Such an association raises the question of how cognitive expertise exerts an influence on the topological properties of large-scale functional networks. To address this question, we examined the overall organization of brain functional networks in 20 grandmaster and master level Chinese-chess players (GM/M) and twenty novice players, by means of resting-state functional connectivity and graph theoretical analyses. We found that, relative to novices, functional connectivity was increased in GM/Ms between basal ganglia, thalamus, hippocampus, and several parietal and temporal areas, suggesting the influence of cognitive expertise on intrinsic connectivity networks associated with learning and memory. Furthermore, we observed economical small-world topology in the whole-brain functional connectivity networks in both groups, but GM/Ms exhibited significantly increased values of normalized clustering coefficient which resulted in increased small-world topology. These findings suggest an association between the functional organization of brain networks and individual differences in cognitive expertise, which might provide further evidence of the mechanisms underlying expert behavior. Copyright © 2014 Elsevier B.V. All rights reserved.

Weighted social networks for a large scale artificial society

NASA Astrophysics Data System (ADS)

Fan, Zong Chen; Duan, Wei; Zhang, Peng; Qiu, Xiao Gang

2016-12-01

The method of artificial society has provided a powerful way to study and explain how individual behaviors at micro level give rise to the emergence of global social phenomenon. It also creates the need for an appropriate representation of social structure which usually has a significant influence on human behaviors. It has been widely acknowledged that social networks are the main paradigm to describe social structure and reflect social relationships within a population. To generate social networks for a population of interest, considering physical distance and social distance among people, we propose a generation model of social networks for a large-scale artificial society based on human choice behavior theory under the principle of random utility maximization. As a premise, we first build an artificial society through constructing a synthetic population with a series of attributes in line with the statistical (census) data for Beijing. Then the generation model is applied to assign social relationships to each individual in the synthetic population. Compared with previous empirical findings, the results show that our model can reproduce the general characteristics of social networks, such as high clustering coefficient, significant community structure and small-world property. Our model can also be extended to a larger social micro-simulation as an input initial. It will facilitate to research and predict some social phenomenon or issues, for example, epidemic transition and rumor spreading.

Science and Math Assessment in K-6 Rural and Small Schools. Rural, Small Schools Network Information Exchange: Number 14, Spring 1993.

ERIC Educational Resources Information Center

Regional Laboratory for Educational Improvement of the Northeast & Islands, Andover, MA.

This packet includes reprints of journal articles and other resources concerning the assessment of science and math in small, rural elementary schools. Articles include: (1) "Standards, Assessment, and Educational Quality" (Lauren B. Resnick); (2) "A True Test: Toward More Authentic and Equitable Assessment" (Grant Wiggins); (3) "How World-Class…

Pandemic Diseases and the Aviation Network SARS, a case study

NASA Astrophysics Data System (ADS)

Hufnagel, Lars; Brockmann, Dirk; Geisel, Theo

2005-03-01

We investigate the mechanisms of the worldwide spread of infectious diseases in a modern world in which humans travel on all scales. We introduce a probabilistic model which accounts for the worldwide spread of infectious diseases on the global aviation network. The analysis indicates that a forecast of the geographical spread of an epidemic is indeed possible, provided that local dynamical parameters of the disease such as the basic reproduction number are known. The model consists of local stochastic infection dynamics and stochastic transport of individuals on the worldwide aviation network which takes into account over 95% of the entire the national and international civil aviation traffic. Our simulations of the SARS outbreak are in surprisingly good agreement with published case reports. Despite the fact that the system is stochastic with a high number of degrees of freedom the outcome of a single simulation exhibits only a small magnitude of variability. We show that this is due to the strong heterogeneity of the network ranging from a few two over 25,000 passengers between nodes of the network. Thus, we propose that our model can be employed to predict the worldwide spread of future pandemic diseases and to identify endangered regions in advance. Based on the connectivity of the aviation network we evaluate the performance of different control strategies and show that a quick and focused reaction is essential to inhibit the global spread of infectious diseases.

Disrupted functional connectome in antisocial personality disorder.

PubMed

Jiang, Weixiong; Shi, Feng; Liao, Jian; Liu, Huasheng; Wang, Tao; Shen, Celina; Shen, Hui; Hu, Dewen; Wang, Wei; Shen, Dinggang

2017-08-01

Studies on antisocial personality disorder (ASPD) subjects focus on brain functional alterations in relation to antisocial behaviors. Neuroimaging research has identified a number of focal brain regions with abnormal structures or functions in ASPD. However, little is known about the connections among brain regions in terms of inter-regional whole-brain networks in ASPD patients, as well as possible alterations of brain functional topological organization. In this study, we employ resting-state functional magnetic resonance imaging (R-fMRI) to examine functional connectome of 32 ASPD patients and 35 normal controls by using a variety of network properties, including small-worldness, modularity, and connectivity. The small-world analysis reveals that ASPD patients have increased path length and decreased network efficiency, which implies a reduced ability of global integration of whole-brain functions. Modularity analysis suggests ASPD patients have decreased overall modularity, merged network modules, and reduced intra- and inter-module connectivities related to frontal regions. Also, network-based statistics show that an internal sub-network, composed of 16 nodes and 16 edges, is significantly affected in ASPD patients, where brain regions are mostly located in the fronto-parietal control network. These results suggest that ASPD is associated with both reduced brain integration and segregation in topological organization of functional brain networks, particularly in the fronto-parietal control network. These disruptions may contribute to disturbances in behavior and cognition in patients with ASPD. Our findings may provide insights into a deeper understanding of functional brain networks of ASPD.

Disrupted functional connectome in antisocial personality disorder

PubMed Central

Jiang, Weixiong; Shi, Feng; Liao, Jian; Liu, Huasheng; Wang, Tao; Shen, Celina; Shen, Hui; Hu, Dewen

2017-01-01

Studies on antisocial personality disorder (ASPD) subjects focus on brain functional alterations in relation to antisocial behaviors. Neuroimaging research has identified a number of focal brain regions with abnormal structures or functions in ASPD. However, little is known about the connections among brain regions in terms of inter-regional whole-brain networks in ASPD patients, as well as possible alterations of brain functional topological organization. In this study, we employ resting-state functional magnetic resonance imaging (R-fMRI) to examine functional connectome of 32 ASPD patients and 35 normal controls by using a variety of network properties, including small-worldness, modularity, and connectivity. The small-world analysis reveals that ASPD patients have increased path length and decreased network efficiency, which implies a reduced ability of global integration of whole-brain functions. Modularity analysis suggests ASPD patients have decreased overall modularity, merged network modules, and reduced intra- and inter-module connectivities related to frontal regions. Also, network-based statistics show that an internal sub-network, composed of 16 nodes and 16 edges, is significantly affected in ASPD patients, where brain regions are mostly located in the fronto-parietal control network. These results suggest that ASPD is associated with both reduced brain integration and segregation in topological organization of functional brain networks, particularly in the fronto-parietal control network. These disruptions may contribute to disturbances in behavior and cognition in patients with ASPD. Our findings may provide insights into a deeper understanding of functional brain networks of ASPD. PMID:27541949

Competition between global and local online social networks

NASA Astrophysics Data System (ADS)

Kleineberg, Kaj-Kolja; Boguñá, Marián

2016-04-01

The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.

Competition between global and local online social networks.

PubMed

Kleineberg, Kaj-Kolja; Boguñá, Marián

2016-04-27

The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.

LEOPACK The integrated services communications system based on LEO satellites

NASA Astrophysics Data System (ADS)

Negoda, A.; Bunin, S.; Bushuev, E.; Dranovsky, V.

LEOPACK is yet another LEO satellite project which provides global integrated services for 'business' communications. It utilizes packet rather then circuit switching in both terrestrial and satellite chains as well as cellular approach for frequencies use. Original multiple access protocols and decentralized network control make it possible to organize regionally or logically independent and world-wide networks. Relatively small number of satellites (28) provides virtually global network coverage.

Altered characteristic of brain networks in mild cognitive impairment during a selective attention task: An EEG study.

PubMed

Wei, Ling; Li, Yingjie; Yang, Xiaoli; Xue, Qing; Wang, Yuping

2015-10-01

The present study evaluated the topological properties of whole brain networks using graph theoretical concepts and investigated the time-evolution characteristic of brain network in mild cognitive impairment patients during a selective attention task. Electroencephalography (EEG) activities were recorded in 10 MCI patients and 17 healthy subjects when they performed a color match task. We calculated the phase synchrony index between each possible pairs of EEG channels in alpha and beta frequency bands and analyzed the local interconnectedness, overall connectedness and small-world characteristic of brain network in different degree for two groups. Relative to healthy normal controls, the properties of cortical networks in MCI patients tend to be a shift of randomization. Lower σ of MCI had suggested that patients had a further loss of small-world attribute both during active and resting states. Our results provide evidence for the functional disconnection of brain regions in MCI. Furthermore, we found the properties of cortical networks could reflect the processing of conflict information in the selective attention task. The human brain tends to be a more regular and efficient neural architecture in the late stage of information processing. In addition, the processing of conflict information needs stronger information integration and transfer between cortical areas. Copyright © 2015 Elsevier B.V. All rights reserved.

"Small World" architecture in brain connectivity and hippocampal volume in Alzheimer's disease: a study via graph theory from EEG data.

PubMed

Vecchio, Fabrizio; Miraglia, Francesca; Piludu, Francesca; Granata, Giuseppe; Romanello, Roberto; Caulo, Massimo; Onofrj, Valeria; Bramanti, Placido; Colosimo, Cesare; Rossini, Paolo Maria

2017-04-01

Brain imaging plays an important role in the study of Alzheimer's disease (AD), where atrophy has been found to occur in the hippocampal formation during the very early disease stages and to progress in parallel with the disease's evolution. The aim of the present study was to evaluate a possible correlation between "Small World" characteristics of the brain connectivity architecture-as extracted from EEG recordings-and hippocampal volume in AD patients. A dataset of 144 subjects, including 110 AD (MMSE 21.3) and 34 healthy Nold (MMSE 29.8) individuals, was evaluated. Weighted and undirected networks were built by the eLORETA solutions of the cortical sources' activities moving from EEG recordings. The evaluation of the hippocampal volume was carried out on a subgroup of 60 AD patients who received a high-resolution T1-weighted sequence and underwent processing for surface-based cortex reconstruction and volumetric segmentation using the Freesurfer image analysis software. Results showed that, quantitatively, more correlation was observed in the right hemisphere, but the same trend was seen in both hemispheres. Alpha band connectivity was negatively correlated, while slow (delta) and fast-frequency (beta, gamma) bands positively correlated with hippocampal volume. Namely, the larger the hippocampal volume, the lower the alpha and the higher the delta, beta, and gamma Small World characteristics of connectivity. Accordingly, the Small World connectivity pattern could represent a functional counterpart of structural hippocampal atrophying and related-network disconnection.

Evolving network simulation study. From regular lattice to scale free network

NASA Astrophysics Data System (ADS)

Makowiec, D.

2005-12-01

The Watts-Strogatz algorithm of transferring the square lattice to a small world network is modified by introducing preferential rewiring constrained by connectivity demand. The evolution of the network is two-step: sequential preferential rewiring of edges controlled by p and updating the information about changes done. The evolving system self-organizes into stationary states. The topological transition in the graph structure is noticed with respect to p. Leafy phase a graph formed by multiple connected vertices (graph skeleton) with plenty of leaves attached to each skeleton vertex emerges when p is small enough to pretend asynchronous evolution. Tangling phase where edges of a graph circulate frequently among low degree vertices occurs when p is large. There exist conditions at which the resulting stationary network ensemble provides networks which degree distribution exhibit power-law decay in large interval of degrees.

A Clustering Graph Generator

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

Winlaw, Manda; De Sterck, Hans; Sanders, Geoffrey

In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps tomore » understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.« less

Time delay and long-range connection induced synchronization transitions in Newman-Watts small-world neuronal networks.

PubMed

Qian, Yu

2014-01-01

The synchronization transitions in Newman-Watts small-world neuronal networks (SWNNs) induced by time delay τ and long-range connection (LRC) probability P have been investigated by synchronization parameter and space-time plots. Four distinct parameter regions, that is, asynchronous region, transition region, synchronous region, and oscillatory region have been discovered at certain LRC probability P = 1.0 as time delay is increased. Interestingly, desynchronization is observed in oscillatory region. More importantly, we consider the spatiotemporal patterns obtained in delayed Newman-Watts SWNNs are the competition results between long-range drivings (LRDs) and neighboring interactions. In addition, for moderate time delay, the synchronization of neuronal network can be enhanced remarkably by increasing LRC probability. Furthermore, lag synchronization has been found between weak synchronization and complete synchronization as LRC probability P is a little less than 1.0. Finally, the two necessary conditions, moderate time delay and large numbers of LRCs, are exposed explicitly for synchronization in delayed Newman-Watts SWNNs.

Time Delay and Long-Range Connection Induced Synchronization Transitions in Newman-Watts Small-World Neuronal Networks

PubMed Central

Qian, Yu

2014-01-01

The synchronization transitions in Newman-Watts small-world neuronal networks (SWNNs) induced by time delay and long-range connection (LRC) probability have been investigated by synchronization parameter and space-time plots. Four distinct parameter regions, that is, asynchronous region, transition region, synchronous region, and oscillatory region have been discovered at certain LRC probability as time delay is increased. Interestingly, desynchronization is observed in oscillatory region. More importantly, we consider the spatiotemporal patterns obtained in delayed Newman-Watts SWNNs are the competition results between long-range drivings (LRDs) and neighboring interactions. In addition, for moderate time delay, the synchronization of neuronal network can be enhanced remarkably by increasing LRC probability. Furthermore, lag synchronization has been found between weak synchronization and complete synchronization as LRC probability is a little less than 1.0. Finally, the two necessary conditions, moderate time delay and large numbers of LRCs, are exposed explicitly for synchronization in delayed Newman-Watts SWNNs. PMID:24810595

The Italian corporate system in a network perspective (1952-1983)

NASA Astrophysics Data System (ADS)

Bargigli, L.; Giannetti, R.

2018-03-01

We study the Italian network of boards in four benchmark years covering different decades, when important economic structural shifts occurred. We find that the latter did not significantly disturb its structure as a small world. At the same time, we do not find a strong peculiarity of the Italian variety of capitalism and its corporate governance system. Typical properties of small world networks are at levels which are not dissimilar from those of other developed economies. Even the steady decrease of density that we observe is recurrent in many other national systems. The composition of the core of the most connected boards remains also quite stable over time. Among the most central boards we always find those of banks and insurances, as well as those of State Owned Enterprises (SOEs). At the same time, the system underwent two significant dynamic adjustments in the Sixties (nationalization of electrical industry) and Seventies (financial restructuring after the "big inflation") which are revealed by modifications in the core and in the community structure.

Biotechnology worldwide and the 'European Biotechnology Thematic Network' Association (EBTNA).

PubMed

Bruschi, F; Dundar, M; Gahan, P B; Gartland, K; Szente, M; Viola-Magni, M P; Akbarova, Y

2011-09-01

The European Biotechnology Congress 2011 held under the auspices of the European Biotechnology Thematic Network Association (EBTNA) in conjunction with the Turkish Medical Genetics Association brings together a broad spectrum of biotechnologists from around the world. The subsequent abstracts indicate the manner in which biotechnology has permeated all aspects of research from the basic sciences through to small and medium enterprises and major industries. The brief statements before the presentation of the abstracts aim to introduce not only Biotechnology in general and its importance around the world, but also the European Biotechnology Thematic Network Association and its aims especially within the framework of education and ethics in biotechnology. Copyright © 2011 Elsevier Ltd. All rights reserved.

Simulating market dynamics: interactions between consumer psychology and social networks.

PubMed

Janssen, Marco A; Jager, Wander

2003-01-01

Markets can show different types of dynamics, from quiet markets dominated by one or a few products, to markets with continual penetration of new and reintroduced products. In a previous article we explored the dynamics of markets from a psychological perspective using a multi-agent simulation model. The main results indicated that the behavioral rules dominating the artificial consumer's decision making determine the resulting market dynamics, such as fashions, lock-in, and unstable renewal. Results also show the importance of psychological variables like social networks, preferences, and the need for identity to explain the dynamics of markets. In this article we extend this work in two directions. First, we will focus on a more systematic investigation of the effects of different network structures. The previous article was based on Watts and Strogatz's approach, which describes the small-world and clustering characteristics in networks. More recent research demonstrated that many large networks display a scale-free power-law distribution for node connectivity. In terms of market dynamics this may imply that a small proportion of consumers may have an exceptional influence on the consumptive behavior of others (hubs, or early adapters). We show that market dynamics is a self-organized property depending on the interaction between the agents' decision-making process (heuristics), the product characteristics (degree of satisfaction of unit of consumption, visibility), and the structure of interactions between agents (size of network and hubs in a social network).

Principal Component Analysis Based Measure of Structural Holes

NASA Astrophysics Data System (ADS)

Deng, Shiguo; Zhang, Wenqing; Yang, Huijie

2013-02-01

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

Community detection for networks with unipartite and bipartite structure

NASA Astrophysics Data System (ADS)

Chang, Chang; Tang, Chao

2014-09-01

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

Random graph models for dynamic networks

NASA Astrophysics Data System (ADS)

Zhang, Xiao; Moore, Cristopher; Newman, Mark E. J.

2017-10-01

Recent theoretical work on the modeling of network structure has focused primarily on networks that are static and unchanging, but many real-world networks change their structure over time. There exist natural generalizations to the dynamic case of many static network models, including the classic random graph, the configuration model, and the stochastic block model, where one assumes that the appearance and disappearance of edges are governed by continuous-time Markov processes with rate parameters that can depend on properties of the nodes. Here we give an introduction to this class of models, showing for instance how one can compute their equilibrium properties. We also demonstrate their use in data analysis and statistical inference, giving efficient algorithms for fitting them to observed network data using the method of maximum likelihood. This allows us, for example, to estimate the time constants of network evolution or infer community structure from temporal network data using cues embedded both in the probabilities over time that node pairs are connected by edges and in the characteristic dynamics of edge appearance and disappearance. We illustrate these methods with a selection of applications, both to computer-generated test networks and real-world examples.

A Multilayer perspective for the analysis of urban transportation systems

PubMed Central

Aleta, Alberto; Meloni, Sandro; Moreno, Yamir

2017-01-01

Public urban mobility systems are composed by several transportation modes connected together. Most studies in urban mobility and planning often ignore the multi-layer nature of transportation systems considering only aggregated versions of this complex scenario. In this work we present a model for the representation of the transportation system of an entire city as a multiplex network. Using two different perspectives, one in which each line is a layer and one in which lines of the same transportation mode are grouped together, we study the interconnected structure of 9 different cities in Europe raging from small towns to mega-cities like London and Berlin highlighting their vulnerabilities and possible improvements. Finally, for the city of Zaragoza in Spain, we also consider data about service schedule and waiting times, which allow us to create a simple yet realistic model for urban mobility able to reproduce real-world facts and to test for network improvements. PMID:28295015

A Multilayer perspective for the analysis of urban transportation systems.

PubMed

Aleta, Alberto; Meloni, Sandro; Moreno, Yamir

2017-03-15

Public urban mobility systems are composed by several transportation modes connected together. Most studies in urban mobility and planning often ignore the multi-layer nature of transportation systems considering only aggregated versions of this complex scenario. In this work we present a model for the representation of the transportation system of an entire city as a multiplex network. Using two different perspectives, one in which each line is a layer and one in which lines of the same transportation mode are grouped together, we study the interconnected structure of 9 different cities in Europe raging from small towns to mega-cities like London and Berlin highlighting their vulnerabilities and possible improvements. Finally, for the city of Zaragoza in Spain, we also consider data about service schedule and waiting times, which allow us to create a simple yet realistic model for urban mobility able to reproduce real-world facts and to test for network improvements.

Uniting functional network topology and oscillations in the fronto-parietal single unit network of behaving primates.

PubMed

Dann, Benjamin; Michaels, Jonathan A; Schaffelhofer, Stefan; Scherberger, Hansjörg

2016-08-15

The functional communication of neurons in cortical networks underlies higher cognitive processes. Yet, little is known about the organization of the single neuron network or its relationship to the synchronization processes that are essential for its formation. Here, we show that the functional single neuron network of three fronto-parietal areas during active behavior of macaque monkeys is highly complex. The network was closely connected (small-world) and consisted of functional modules spanning these areas. Surprisingly, the importance of different neurons to the network was highly heterogeneous with a small number of neurons contributing strongly to the network function (hubs), which were in turn strongly inter-connected (rich-club). Examination of the network synchronization revealed that the identified rich-club consisted of neurons that were synchronized in the beta or low frequency range, whereas other neurons were mostly non-oscillatory synchronized. Therefore, oscillatory synchrony may be a central communication mechanism for highly organized functional spiking networks.

Metabolic Brain Network Analysis of Hypothyroidism Symptom Based on [18F]FDG-PET of Rats.

PubMed

Wan, Hongkai; Tan, Ziyu; Zheng, Qiang; Yu, Jing

2018-03-12

Recent researches have demonstrated the value of using 2-deoxy-2-[ 18 F]fluoro-D-glucose ([ 18 F]FDG) positron emission tomography (PET) imaging to reveal the hypothyroidism-related damages in local brain regions. However, the influence of hypothyroidism on the entire brain network is barely studied. This study focuses on the application of graph theory on analyzing functional brain networks of the hypothyroidism symptom. For both the hypothyroidism and the control groups of Wistar rats, the functional brain networks were constructed by thresholding the glucose metabolism correlation matrices of 58 brain regions. The network topological properties (including the small-world properties and the nodal centralities) were calculated and compared between the two groups. We found that the rat brains, like human brains, have typical properties of the small-world network in both the hypothyroidism and the control groups. However, the hypothyroidism group demonstrated lower global efficiency and decreased local cliquishness of the brain network, indicating hypothyroidism-related impairment to the brain network. The hypothyroidism group also has decreased nodal centrality in the left posterior hippocampus, the right hypothalamus, pituitary, pons, and medulla. This observation accorded with the hypothyroidism-related functional disorder of hypothalamus-pituitary-thyroid (HPT) feedback regulation mechanism. Our research quantitatively confirms that hypothyroidism hampers brain cognitive function by causing impairment to the brain network of glucose metabolism. This study reveals the feasibility and validity of applying graph theory method to preclinical [ 18 F]FDG-PET images and facilitates future study on human subjects.

A method of examining the structure and topological properties of public-transport networks

NASA Astrophysics Data System (ADS)

Dimitrov, Stavri Dimitri; Ceder, Avishai (Avi)

2016-06-01

This work presents a new method of examining the structure of public-transport networks (PTNs) and analyzes their topological properties through a combination of computer programming, statistical data and large-network analyses. In order to automate the extraction, processing and exporting of data, a software program was developed allowing to extract the needed data from General Transit Feed Specification, thus overcoming difficulties occurring in accessing and collecting data. The proposed method was applied to a real-life PTN in Auckland, New Zealand, with the purpose of examining whether it showed characteristics of scale-free networks and exhibited features of ;small-world; networks. As a result, new regression equations were derived analytically describing observed, strong, non-linear relationships among the probabilities of randomly chosen stops in the PTN to be serviced by a given number of routes. The established dependence is best fitted by an exponential rather than a power-law function, showing that the PTN examined is neither random nor scale-free, but a mixture of the two. This finding explains the presence of hubs that are not typical of exponential networks and simultaneously not highly connected to the other nodes as is the case with scale-free networks. On the other hand, the observed values of the topological properties of the network show that although it is highly clustered, owing to its representation as a directed graph, it differs slightly from ;small-world; networks, which are characterized by strong clustering and a short average path length.

An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks.

PubMed

He, Jieyue; Wang, Chunyan; Qiu, Kunpu; Zhong, Wei

2014-01-01

Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. The algorithm of probability graph isomorphism evaluation based on circuit simulation method excludes most of subgraphs which are not probability isomorphism and reduces the search space of the probability isomorphism subgraphs using the mismatch values in the node voltage set. It is an innovative way to find the frequent probability patterns, which can be efficiently applied to probability motif discovery problems in the further studies.

An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks

PubMed Central

2014-01-01

Background Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. Methods In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. Results The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. Conclusions The algorithm of probability graph isomorphism evaluation based on circuit simulation method excludes most of subgraphs which are not probability isomorphism and reduces the search space of the probability isomorphism subgraphs using the mismatch values in the node voltage set. It is an innovative way to find the frequent probability patterns, which can be efficiently applied to probability motif discovery problems in the further studies. PMID:25350277

Reducing financial avalanches by random investments

NASA Astrophysics Data System (ADS)

Biondo, Alessio Emanuele; Pluchino, Alessandro; Rapisarda, Andrea; Helbing, Dirk

2013-12-01

Building on similarities between earthquakes and extreme financial events, we use a self-organized criticality-generating model to study herding and avalanche dynamics in financial markets. We consider a community of interacting investors, distributed in a small-world network, who bet on the bullish (increasing) or bearish (decreasing) behavior of the market which has been specified according to the S&P 500 historical time series. Remarkably, we find that the size of herding-related avalanches in the community can be strongly reduced by the presence of a relatively small percentage of traders, randomly distributed inside the network, who adopt a random investment strategy. Our findings suggest a promising strategy to limit the size of financial bubbles and crashes. We also obtain that the resulting wealth distribution of all traders corresponds to the well-known Pareto power law, while that of random traders is exponential. In other words, for technical traders, the risk of losses is much greater than the probability of gains compared to those of random traders.

Reducing financial avalanches by random investments.

PubMed

Biondo, Alessio Emanuele; Pluchino, Alessandro; Rapisarda, Andrea; Helbing, Dirk

2013-12-01

Building on similarities between earthquakes and extreme financial events, we use a self-organized criticality-generating model to study herding and avalanche dynamics in financial markets. We consider a community of interacting investors, distributed in a small-world network, who bet on the bullish (increasing) or bearish (decreasing) behavior of the market which has been specified according to the S&P 500 historical time series. Remarkably, we find that the size of herding-related avalanches in the community can be strongly reduced by the presence of a relatively small percentage of traders, randomly distributed inside the network, who adopt a random investment strategy. Our findings suggest a promising strategy to limit the size of financial bubbles and crashes. We also obtain that the resulting wealth distribution of all traders corresponds to the well-known Pareto power law, while that of random traders is exponential. In other words, for technical traders, the risk of losses is much greater than the probability of gains compared to those of random traders.

Empirical research on complex networks modeling of combat SoS based on data from real war-game, Part I: Statistical characteristics

NASA Astrophysics Data System (ADS)

Chen, Lei; Kou, Yingxin; Li, Zhanwu; Xu, An; Wu, Cheng

2018-01-01

We build a complex networks model of combat System-of-Systems (SoS) based on empirical data from a real war-game, this model is a combination of command & control (C2) subnetwork, sensors subnetwork, influencers subnetwork and logistical support subnetwork, each subnetwork has idiographic components and statistical characteristics. The C2 subnetwork is the core of whole combat SoS, it has a hierarchical structure with no modularity, of which robustness is strong enough to maintain normal operation after any two nodes is destroyed; the sensors subnetwork and influencers subnetwork are like sense organ and limbs of whole combat SoS, they are both flat modular networks of which degree distribution obey GEV distribution and power-law distribution respectively. The communication network is the combination of all subnetworks, it is an assortative Small-World network with core-periphery structure, the Intelligence & Communication Stations/Command Center integrated with C2 nodes in the first three level act as the hub nodes in communication network, and all the fourth-level C2 nodes, sensors, influencers and logistical support nodes have communication capability, they act as the periphery nodes in communication network, its degree distribution obeys exponential distribution in the beginning, Gaussian distribution in the middle, and power-law distribution in the end, and its path length obeys GEV distribution. The betweenness centrality distribution, closeness centrality distribution and eigenvector centrality are also been analyzed to measure the vulnerability of nodes.

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks.

PubMed

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-11-22

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks

PubMed Central

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-01-01

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability. PMID:27874024

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks

NASA Astrophysics Data System (ADS)

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-11-01

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.

Local-world and cluster-growing weighted networks with controllable clustering

NASA Astrophysics Data System (ADS)

Yang, Chun-Xia; Tang, Min-Xuan; Tang, Hai-Qiang; Deng, Qiang-Qiang

2014-12-01

We constructed an improved weighted network model by introducing local-world selection mechanism and triangle coupling mechanism based on the traditional BBV model. The model gives power-law distributions of degree, strength and edge weight and presents the linear relationship both between the degree and strength and between the degree and the clustering coefficient. Particularly, the model is equipped with an ability to accelerate the speed increase of strength exceeding that of degree. Besides, the model is more sound and efficient in tuning clustering coefficient than the original BBV model. Finally, based on our improved model, we analyze the virus spread process and find that reducing the size of local-world has a great inhibited effect on virus spread.

A dataset on human navigation strategies in foreign networked systems

PubMed Central

Kőrösi, Attila; Csoma, Attila; Rétvári, Gábor; Heszberger, Zalán; Bíró, József; Tapolcai, János; Pelle, István; Klajbár, Dávid; Novák, Márton; Halasi, Valentina; Gulyás, András

2018-01-01

Humans are involved in various real-life networked systems. The most obvious examples are social and collaboration networks but the language and the related mental lexicon they use, or the physical map of their territory can also be interpreted as networks. How do they find paths between endpoints in these networks? How do they obtain information about a foreign networked world they find themselves in, how they build mental model for it and how well they succeed in using it? Large, open datasets allowing the exploration of such questions are hard to find. Here we report a dataset collected by a smartphone application, in which players navigate between fixed length source and destination English words step-by-step by changing only one letter at a time. The paths reflect how the players master their navigation skills in such a foreign networked world. The dataset can be used in the study of human mental models for the world around us, or in a broader scope to investigate the navigation strategies in complex networked systems. PMID:29533391

Economic and Social Factors in Designing Disease Control Strategies for Epidemics on Networks

NASA Astrophysics Data System (ADS)

Kleczkowski, A.; Dybiec, B.; Gilligan, C. A.

2006-11-01

Models for control of epidemics on local, global and small-world networks are considered, with only partial information accessible about the status of individuals and their connections. The main goal of an effective control measure is to stop the epidemic at a lowest possible cost, including treatment and cost necessary to track the disease spread. We show that delay in detection of infectious individuals and presence of long-range links are the most important factors determining the cost. However, the details of long-range links are usually the least-known element of the social interactions due to their occasional character and potentially short life-span. We show that under some conditions on the probability of disease spread, it is advisable to attempt to track those links, even if this involves additional costs. Thus, collecting some additional knowledge about the network structure might be beneficial to ensure a successful and cost-effective control.

Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.

PubMed

Shang, Yilun

2015-01-01

Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacian Estrada index of evolving graphs. Using linear algebra techniques, we established general upper and lower bounds for these graph-spectrum-based invariants through a couple of intuitive graph-theoretic measures, including the number of vertices or edges. Synthetic random evolving small-world networks are employed to show the relevance of the proposed dynamic Estrada indices. It is found that neither the static snapshot graphs nor the aggregated graph can approximate the evolving graph itself, indicating the fundamental difference between the static and dynamic Estrada indices.

EEG-based research on brain functional networks in cognition.

PubMed

Wang, Niannian; Zhang, Li; Liu, Guozhong

2015-01-01

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

Predicting the evolution of complex networks via similarity dynamics

NASA Astrophysics Data System (ADS)

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

2017-01-01

Almost all real-world networks are subject to constant evolution, and plenty of them have been investigated empirically to uncover the underlying evolution mechanism. However, the evolution prediction of dynamic networks still remains a challenging problem. The crux of this matter is to estimate the future network links of dynamic networks. This paper studies the evolution prediction of dynamic networks with link prediction paradigm. To estimate the likelihood of the existence of links more accurate, an effective and robust similarity index is presented by exploiting network structure adaptively. Moreover, most of the existing link prediction methods do not make a clear distinction between future links and missing links. In order to predict the future links, the networks are regarded as dynamic systems in this paper, and a similarity updating method, spatial-temporal position drift model, is developed to simulate the evolutionary dynamics of node similarity. Then the updated similarities are used as input information for the future links' likelihood estimation. Extensive experiments on real-world networks suggest that the proposed similarity index performs better than baseline methods and the position drift model performs well for evolution prediction in real-world evolving networks.

SmallWorld Behavior of the Worldwide Active Volcanoes Network: Preliminary Results

NASA Astrophysics Data System (ADS)

Spata, A.; Bonforte, A.; Nunnari, G.; Puglisi, G.

2009-12-01

We propose a preliminary complex networks based approach in order to model and characterize volcanoes activity correlation observed on a planetary scale over the last two thousand years. Worldwide volcanic activity is in fact related to the general plate tectonics that locally drives the faults activity, that in turn controls the magma upraise beneath the volcanoes. To find correlations among different volcanoes could indicate a common underlying mechanism driving their activity and could help us interpreting the deeper common dynamics controlling their unrest. All the first evidences found testing the procedure, suggest the suitability of this analysis to investigate global volcanism related to plate tectonics. The first correlations found, in fact, indicate that an underlying common large-scale dynamics seems to drive volcanic activity at least around the Pacific plate, where it collides and subduces beneath American, Eurasian and Australian plates. From this still preliminary analysis, also more complex relationships among volcanoes lying on different tectonic margins have been found, suggesting some more complex interrelationships between different plates. The understanding of eventually detected correlations could be also used to further implement warning systems, relating the unrest probabilities of a specific volcano also to the ongoing activity to the correlated ones. Our preliminary results suggest that, as for other many physical and biological systems, an underlying organizing principle of planetary volcanoes activity might exist and it could be a small-world principle. In fact we found that, from a topological perspective, volcanoes correlations are characterized by the typical features of small-world network: a high clustering coefficient and a low characteristic path length. These features confirm that global volcanoes activity is characterized by both short and long-range correlations. We stress here the fact that numerical simulation carried out in this work seems to agree with geological evidences (eg. the Pacific plate, South America volcanoes activity and so on). However a detailed analysis of numerical correlation pointed out in this work and geological implication requires a lot of effort and is still running. Thus this work represents preliminary contribution to better understand and clarify, from a geophysical point of view, the nature of planetary correlations among active volcanoes. Further work is still needed.

Rapid neutral-neutral reactions at low temperatures: a new network and first results for TMC-1

NASA Astrophysics Data System (ADS)

Smith, Ian W. M.; Herbst, Eric; Chang, Qiang

2004-05-01

There is now ample evidence from an assortment of experiments, especially those involving the CRESU (Cinétique de Réaction en Ecoulement Supersonique Uniforme) technique, that a variety of neutral-neutral reactions possess no activation energy barrier and are quite rapid at very low temperatures. These reactions include both radical-radical systems and, more surprisingly, systems involving an atom or a radical and one `stable' species. Generalizing from the small but growing number of systems studied in the laboratory, we estimate reaction rate coefficients for a larger number of such reactions and include these estimates in a new network of gas-phase reactions for use in low-temperature interstellar chemistry. Designated osu.2003, the new network is available on the World Wide Web and will be continually updated. A table of new results for molecular abundances in the dark cloud TMC-1 (CP) is provided and compared with results from an older (new standard model; nsm) network.

A pathway-based network analysis of hypertension-related genes

NASA Astrophysics Data System (ADS)

Wang, Huan; Hu, Jing-Bo; Xu, Chuan-Yun; Zhang, De-Hai; Yan, Qian; Xu, Ming; Cao, Ke-Fei; Zhang, Xu-Sheng

2016-02-01

Complex network approach has become an effective way to describe interrelationships among large amounts of biological data, which is especially useful in finding core functions and global behavior of biological systems. Hypertension is a complex disease caused by many reasons including genetic, physiological, psychological and even social factors. In this paper, based on the information of biological pathways, we construct a network model of hypertension-related genes of the salt-sensitive rat to explore the interrelationship between genes. Statistical and topological characteristics show that the network has the small-world but not scale-free property, and exhibits a modular structure, revealing compact and complex connections among these genes. By the threshold of integrated centrality larger than 0.71, seven key hub genes are found: Jun, Rps6kb1, Cycs, Creb312, Cdk4, Actg1 and RT1-Da. These genes should play an important role in hypertension, suggesting that the treatment of hypertension should focus on the combination of drugs on multiple genes.

Insights into the transmission of respiratory infectious diseases through empirical human contact networks

PubMed Central

Huang, Chunlin; Liu, Xingwu; Sun, Shiwei; Li, Shuai Cheng; Deng, Minghua; He, Guangxue; Zhang, Haicang; Wang, Chao; Zhou, Yang; Zhao, Yanlin; Bu, Dongbo

2016-01-01

In this study, we present representative human contact networks among Chinese college students. Unlike schools in the US, human contacts within Chinese colleges are extremely clustered, partly due to the highly organized lifestyle of Chinese college students. Simulations of influenza spreading across real contact networks are in good accordance with real influenza records; however, epidemic simulations across idealized scale-free or small-world networks show considerable overestimation of disease prevalence, thus challenging the widely-applied idealized human contact models in epidemiology. Furthermore, the special contact pattern within Chinese colleges results in disease spreading patterns distinct from those of the US schools. Remarkably, class cancelation, though simple, shows a mitigating power equal to quarantine/vaccination applied on ~25% of college students, which quantitatively explains its success in Chinese colleges during the SARS period. Our findings greatly facilitate reliable prediction of epidemic prevalence, and thus should help establishing effective strategies for respiratory infectious diseases control. PMID:27526868

Random graph models of social networks.

PubMed

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

2002-02-19

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

System-level insights into the cellular interactome of a non-model organism: inferring, modelling and analysing functional gene network of soybean (Glycine max).

PubMed

Xu, Yungang; Guo, Maozu; Zou, Quan; Liu, Xiaoyan; Wang, Chunyu; Liu, Yang

2014-01-01

Cellular interactome, in which genes and/or their products interact on several levels, forming transcriptional regulatory-, protein interaction-, metabolic-, signal transduction networks, etc., has attracted decades of research focuses. However, such a specific type of network alone can hardly explain the various interactive activities among genes. These networks characterize different interaction relationships, implying their unique intrinsic properties and defects, and covering different slices of biological information. Functional gene network (FGN), a consolidated interaction network that models fuzzy and more generalized notion of gene-gene relations, have been proposed to combine heterogeneous networks with the goal of identifying functional modules supported by multiple interaction types. There are yet no successful precedents of FGNs on sparsely studied non-model organisms, such as soybean (Glycine max), due to the absence of sufficient heterogeneous interaction data. We present an alternative solution for inferring the FGNs of soybean (SoyFGNs), in a pioneering study on the soybean interactome, which is also applicable to other organisms. SoyFGNs exhibit the typical characteristics of biological networks: scale-free, small-world architecture and modularization. Verified by co-expression and KEGG pathways, SoyFGNs are more extensive and accurate than an orthology network derived from Arabidopsis. As a case study, network-guided disease-resistance gene discovery indicates that SoyFGNs can provide system-level studies on gene functions and interactions. This work suggests that inferring and modelling the interactome of a non-model plant are feasible. It will speed up the discovery and definition of the functions and interactions of other genes that control important functions, such as nitrogen fixation and protein or lipid synthesis. The efforts of the study are the basis of our further comprehensive studies on the soybean functional interactome at the genome and microRNome levels. Additionally, a web tool for information retrieval and analysis of SoyFGNs can be accessed at SoyFN: http://nclab.hit.edu.cn/SoyFN.

System-Level Insights into the Cellular Interactome of a Non-Model Organism: Inferring, Modelling and Analysing Functional Gene Network of Soybean (Glycine max)

PubMed Central

Xu, Yungang; Guo, Maozu; Zou, Quan; Liu, Xiaoyan; Wang, Chunyu; Liu, Yang

2014-01-01

Cellular interactome, in which genes and/or their products interact on several levels, forming transcriptional regulatory-, protein interaction-, metabolic-, signal transduction networks, etc., has attracted decades of research focuses. However, such a specific type of network alone can hardly explain the various interactive activities among genes. These networks characterize different interaction relationships, implying their unique intrinsic properties and defects, and covering different slices of biological information. Functional gene network (FGN), a consolidated interaction network that models fuzzy and more generalized notion of gene-gene relations, have been proposed to combine heterogeneous networks with the goal of identifying functional modules supported by multiple interaction types. There are yet no successful precedents of FGNs on sparsely studied non-model organisms, such as soybean (Glycine max), due to the absence of sufficient heterogeneous interaction data. We present an alternative solution for inferring the FGNs of soybean (SoyFGNs), in a pioneering study on the soybean interactome, which is also applicable to other organisms. SoyFGNs exhibit the typical characteristics of biological networks: scale-free, small-world architecture and modularization. Verified by co-expression and KEGG pathways, SoyFGNs are more extensive and accurate than an orthology network derived from Arabidopsis. As a case study, network-guided disease-resistance gene discovery indicates that SoyFGNs can provide system-level studies on gene functions and interactions. This work suggests that inferring and modelling the interactome of a non-model plant are feasible. It will speed up the discovery and definition of the functions and interactions of other genes that control important functions, such as nitrogen fixation and protein or lipid synthesis. The efforts of the study are the basis of our further comprehensive studies on the soybean functional interactome at the genome and microRNome levels. Additionally, a web tool for information retrieval and analysis of SoyFGNs can be accessed at SoyFN: http://nclab.hit.edu.cn/SoyFN. PMID:25423109

The Role of Temporal Trends in Growing Networks

PubMed Central

Ruppin, Eytan; Shavitt, Yuval

2016-01-01

The rich get richer principle, manifested by the Preferential attachment (PA) mechanism, is widely considered one of the major factors in the growth of real-world networks. PA stipulates that popular nodes are bound to be more attractive than less popular nodes; for example, highly cited papers are more likely to garner further citations. However, it overlooks the transient nature of popularity, which is often governed by trends. Here, we show that in a wide range of real-world networks the recent popularity of a node, i.e., the extent by which it accumulated links recently, significantly influences its attractiveness and ability to accumulate further links. We proceed to model this observation with a natural extension to PA, named Trending Preferential Attachment (TPA), in which edges become less influential as they age. TPA quantitatively parametrizes a fundamental network property, namely the network’s tendency to trends. Through TPA, we find that real-world networks tend to be moderately to highly trendy. Networks are characterized by different susceptibilities to trends, which determine their structure to a large extent. Trendy networks display complex structural traits, such as modular community structure and degree-assortativity, occurring regularly in real-world networks. In summary, this work addresses an inherent trait of complex networks, which greatly affects their growth and structure, and develops a unified model to address its interaction with preferential attachment. PMID:27486847

Co-occurrence network analysis of Chinese and English poems

NASA Astrophysics Data System (ADS)

Liang, Wei; Wang, Yanli; Shi, Yuming; Chen, Guanrong

2015-02-01

A total of 572 co-occurrence networks of Chinese characters and words as well as English words are constructed from both Chinese and English poems. It is found that most of the networks have small-world features; more Chinese networks have scale-free properties and hierarchical structures as compared with the English networks; all the networks are disassortative, and the disassortativeness of the Chinese word networks is more prominent than those of the English networks; the spectral densities of the Chinese word networks and English networks are similar, but they are different from those of the ER, BA, and WS networks. For the above observed phenomena, analysis is provided with interpretation from a linguistic perspective.

Quantum Monte Carlo study of the transverse-field quantum Ising model on infinite-dimensional structures

NASA Astrophysics Data System (ADS)

Baek, Seung Ki; Um, Jaegon; Yi, Su Do; Kim, Beom Jun

2011-11-01

In a number of classical statistical-physical models, there exists a characteristic dimensionality called the upper critical dimension above which one observes the mean-field critical behavior. Instead of constructing high-dimensional lattices, however, one can also consider infinite-dimensional structures, and the question is whether this mean-field character extends to quantum-mechanical cases as well. We therefore investigate the transverse-field quantum Ising model on the globally coupled network and on the Watts-Strogatz small-world network by means of quantum Monte Carlo simulations and the finite-size scaling analysis. We confirm that both of the structures exhibit critical behavior consistent with the mean-field description. In particular, we show that the existing cumulant method has difficulty in estimating the correct dynamic critical exponent and suggest that an order parameter based on the quantum-mechanical expectation value can be a practically useful numerical observable to determine critical behavior when there is no well-defined dimensionality.

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

NASA Astrophysics Data System (ADS)

Wiedermann, Marc; Donges, Jonathan F.; Kurths, Jürgen; Donner, Reik V.

2016-04-01

Networks with nodes embedded in a metric space have gained increasing interest in recent years. The effects of spatial embedding on the networks' structural characteristics, however, are rarely taken into account when studying their macroscopic properties. Here, we propose a hierarchy of null models to generate random surrogates from a given spatially embedded network that can preserve certain global and local statistics associated with the nodes' embedding in a metric space. Comparing the original network's and the resulting surrogates' global characteristics allows one to quantify to what extent these characteristics are already predetermined by the spatial embedding of the nodes and links. We apply our framework to various real-world spatial networks and show that the proposed models capture macroscopic properties of the networks under study much better than standard random network models that do not account for the nodes' spatial embedding. Depending on the actual performance of the proposed null models, the networks are categorized into different classes. Since many real-world complex networks are in fact spatial networks, the proposed approach is relevant for disentangling the underlying complex system structure from spatial embedding of nodes in many fields, ranging from social systems over infrastructure and neurophysiology to climatology.

[Not Available].

PubMed

Yanashima, Ryoji; Kitagawa, Noriyuki; Matsubara, Yoshiya; Weatheritt, Robert; Oka, Kotaro; Kikuchi, Shinichi; Tomita, Masaru; Ishizaki, Shun

2009-01-01

The scale-free and small-world network models reflect the functional units of networks. However, when we investigated the network properties of a signaling pathway using these models, no significant differences were found between the original undirected graphs and the graphs in which inactive proteins were eliminated from the gene expression data. We analyzed signaling networks by focusing on those pathways that best reflected cellular function. Therefore, our analysis of pathways started from the ligands and progressed to transcription factors and cytoskeletal proteins. We employed the Python module to assess the target network. This involved comparing the original and restricted signaling cascades as a directed graph using microarray gene expression profiles of late onset Alzheimer's disease. The most commonly used method of shortest-path analysis neglects to consider the influences of alternative pathways that can affect the activation of transcription factors or cytoskeletal proteins. We therefore introduced included k-shortest paths and k-cycles in our network analysis using the Python modules, which allowed us to attain a reasonable computational time and identify k-shortest paths. This technique reflected results found in vivo and identified pathways not found when shortest path or degree analysis was applied. Our module enabled us to comprehensively analyse the characteristics of biomolecular networks and also enabled analysis of the effects of diseases considering the feedback loop and feedforward loop control structures as an alternative path.

Models to capture the potential for disease transmission in domestic sheep flocks.

PubMed

Schley, David; Whittle, Sophie; Taylor, Michael; Kiss, Istvan Zoltan

2012-09-15

Successful control of livestock diseases requires an understanding of how they spread amongst animals and between premises. Mathematical models can offer important insight into the dynamics of disease, especially when built upon experimental and/or field data. Here the dynamics of a range of epidemiological models are explored in order to determine which models perform best in capturing real-world heterogeneities at sufficient resolution. Individual based network models are considered together with one- and two-class compartmental models, for which the final epidemic size is calculated as a function of the probability of disease transmission occurring during a given physical contact between two individuals. For numerical results the special cases of a viral disease with a fast recovery rate (foot-and-mouth disease) and a bacterial disease with a slow recovery rate (brucellosis) amongst sheep are considered. Quantitative results from observational studies of physical contact amongst domestic sheep are applied and results from the differently structured flocks (ewes with newborn lambs, ewes with nearly weaned lambs and ewes only) compared. These indicate that the breeding cycle leads to significant changes in the expected basic reproduction ratio of diseases. The observed heterogeneity of contacts amongst animals is best captured by full network simulations, although simple compartmental models describe the key features of an outbreak but, as expected, often overestimate the speed of an outbreak. Here the weights of contacts are heterogeneous, with many low weight links. However, due to the well-connected nature of the networks, this has little effect and differences between models remain small. These results indicate that simple compartmental models can be a useful tool for modelling real-world flocks; their applicability will be greater still for more homogeneously mixed livestock, which could be promoted by higher intensity farming practices. Copyright © 2012 Elsevier B.V. All rights reserved.

Changes in Structural Connectivity Following a Cognitive Intervention in Children With Traumatic Brain Injury.

PubMed

Yuan, Weihong; Treble-Barna, Amery; Sohlberg, McKay M; Harn, Beth; Wade, Shari L

2017-02-01

Structural connectivity analysis based on graph theory and diffusion tensor imaging tractography is a novel method that quantifies the topological characteristics in the brain network. This study aimed to examine structural connectivity changes following the Attention Intervention and Management (AIM) program designed to improve attention and executive function (EF) in children with traumatic brain injury (TBI). Seventeen children with complicated mild to severe TBI (13.66 ± 2.68 years; >12 months postinjury) completed magnetic resonance imaging (MRI) and neurobehavioral measures at time 1, 10 of whom completed AIM and assessment at time 2. Eleven matched healthy comparison (HC) children (13.37 ± 2.08 years) completed MRI and neurobehavioral assessment at both time points, but did not complete AIM. Network characteristics were analyzed to quantify the structural connectivity before and after the intervention. Mixed model analyses showed that small-worldness was significantly higher in the TBI group than the HC group at time 1, and both small-worldness and normalized clustering coefficient decreased significantly at time 2 in the TBI group whereas the HC group remained relatively unchanged. Reductions in mean local efficiency were significantly correlated with improvements in verbal inhibition and both parent- and child-reported EF. Increased normalized characteristic path length was significantly correlated with improved sustained attention. The results provide preliminary evidence suggesting that graph theoretical analysis may be a sensitive tool in pediatric TBI for detecting ( a) abnormalities of structural connectivity in brain network and ( b) structural neuroplasticity associated with neurobehavioral improvement following a short-term intervention for attention and EF.

A study of EMR-based medical knowledge network and its applications.

PubMed

Zhao, Chao; Jiang, Jingchi; Xu, Zhiming; Guan, Yi

2017-05-01

Electronic medical records (EMRs) contain an amount of medical knowledge which can be used for clinical decision support. We attempt to integrate this medical knowledge into a complex network, and then implement a diagnosis model based on this network. The dataset of our study contains 992 records which are uniformly sampled from different departments of the hospital. In order to integrate the knowledge of these records, an EMR-based medical knowledge network (EMKN) is constructed. This network takes medical entities as nodes, and co-occurrence relationships between the two entities as edges. Selected properties of this network are analyzed. To make use of this network, a basic diagnosis model is implemented. Seven hundred records are randomly selected to re-construct the network, and the remaining 292 records are used as test records. The vector space model is applied to illustrate the relationships between diseases and symptoms. Because there may exist more than one actual disease in a record, the recall rate of the first ten results, and the average precision are adopted as evaluation measures. Compared with a random network of the same size, this network has a similar average length but a much higher clustering coefficient. Additionally, it can be observed that there are direct correlations between the community structure and the real department classes in the hospital. For the diagnosis model, the vector space model using disease as a base obtains the best result. At least one accurate disease can be obtained in 73.27% of the records in the first ten results. We constructed an EMR-based medical knowledge network by extracting the medical entities. This network has the small-world and scale-free properties. Moreover, the community structure showed that entities in the same department have a tendency to be self-aggregated. Based on this network, a diagnosis model was proposed. This model uses only the symptoms as inputs and is not restricted to a specific disease. The experiments conducted demonstrated that EMKN is a simple and universal technique to integrate different medical knowledge from EMRs, and can be used for clinical decision support. Copyright © 2017 Elsevier B.V. All rights reserved.

Limited-path-length entanglement percolation in quantum complex networks

NASA Astrophysics Data System (ADS)

Cuquet, Martí; Calsamiglia, John

2011-03-01

We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.

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

PubMed

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

2014-09-01

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

Randomizing bipartite networks: the case of the World Trade Web.

PubMed

Saracco, Fabio; Di Clemente, Riccardo; Gabrielli, Andrea; Squartini, Tiziano

2015-06-01

Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful representation of many systems, ranging from mutualistic networks in ecology to trade networks in economy, whence the need of a pattern detection-oriented analysis in order to identify statistically-significant structural properties. Such an analysis rests upon the definition of suitable null models, i.e. upon the choice of the portion of network structure to be preserved while randomizing everything else. However, quite surprisingly, little work has been done so far to define null models for real bipartite networks. The aim of the present work is to fill this gap, extending a recently-proposed method to randomize monopartite networks to bipartite networks. While the proposed formalism is perfectly general, we apply our method to the binary, undirected, bipartite representation of the World Trade Web, comparing the observed values of a number of structural quantities of interest with the expected ones, calculated via our randomization procedure. Interestingly, the behavior of the World Trade Web in this new representation is strongly different from the monopartite analogue, showing highly non-trivial patterns of self-organization.

Future Phenology: Challenges for an Integrative Environmental Science

NASA Astrophysics Data System (ADS)

Schwartz, M. D.

2004-12-01

Phenology is an interdisciplinary environmental science, and as such brings together individuals from many different scientific backgrounds, but the full benefits of their combined disciplinary perspectives to enrich phenological research have yet to be realized. The last few years have seen rapid progress in the transmission of "phenological perspectives" into the mainstream of science, especially related to the needs of global change research. While other parts of phenological research are still important and need to progress, it is global change science that will stimulate, challenge, and transform the discipline of phenology most in the coming decades. In order to maximize the benefits of phenology for global change research as rapidly as possible, commitments to integrative thinking and large-scale data collection must be accelerated. First of all, the limitations of the primary forms of data collection (remote sensing derived, native species, cloned indicator species, and model output) must be accepted. None of these data sources can meet the needs of all research questions, and an "integrative approach" that combines data types provides synergistic benefits. The most needed data are traditional native and cloned plant species observations. Networks that select a small number of common plants for coordinated observation among national and global scale networks will prove the most useful. These networks should be embraced and integrated into the missions of national weather services around the world, as is now the case in many European countries. A little more than one hundred years ago, the countries of the world began to cooperate in a global-scale network of weather and climate monitoring stations. The results of this long-term investment are the considerable progress that has been made in understanding the workings of the earth's climate systems. We have a similar opportunity with phenological data--small investments in national and global-scale observation networks are crucial to global change science, and will yield an impressive return in the years ahead.

Analysis of the “naming game” with learning errors in communications

NASA Astrophysics Data System (ADS)

Lou, Yang; Chen, Guanrong

2015-07-01

Naming game simulates the process of naming an objective by a population of agents organized in a certain communication network. By pair-wise iterative interactions, the population reaches consensus asymptotically. We study naming game with communication errors during pair-wise conversations, with error rates in a uniform probability distribution. First, a model of naming game with learning errors in communications (NGLE) is proposed. Then, a strategy for agents to prevent learning errors is suggested. To that end, three typical topologies of communication networks, namely random-graph, small-world and scale-free networks, are employed to investigate the effects of various learning errors. Simulation results on these models show that 1) learning errors slightly affect the convergence speed but distinctively increase the requirement for memory of each agent during lexicon propagation; 2) the maximum number of different words held by the population increases linearly as the error rate increases; 3) without applying any strategy to eliminate learning errors, there is a threshold of the learning errors which impairs the convergence. The new findings may help to better understand the role of learning errors in naming game as well as in human language development from a network science perspective.

Analysis of the "naming game" with learning errors in communications.

PubMed

Lou, Yang; Chen, Guanrong

2015-07-16

Naming game simulates the process of naming an objective by a population of agents organized in a certain communication network. By pair-wise iterative interactions, the population reaches consensus asymptotically. We study naming game with communication errors during pair-wise conversations, with error rates in a uniform probability distribution. First, a model of naming game with learning errors in communications (NGLE) is proposed. Then, a strategy for agents to prevent learning errors is suggested. To that end, three typical topologies of communication networks, namely random-graph, small-world and scale-free networks, are employed to investigate the effects of various learning errors. Simulation results on these models show that 1) learning errors slightly affect the convergence speed but distinctively increase the requirement for memory of each agent during lexicon propagation; 2) the maximum number of different words held by the population increases linearly as the error rate increases; 3) without applying any strategy to eliminate learning errors, there is a threshold of the learning errors which impairs the convergence. The new findings may help to better understand the role of learning errors in naming game as well as in human language development from a network science perspective.

Using neural networks and Dyna algorithm for integrated planning, reacting and learning in systems

NASA Technical Reports Server (NTRS)

Lima, Pedro; Beard, Randal

1992-01-01

The traditional AI answer to the decision making problem for a robot is planning. However, planning is usually CPU-time consuming, depending on the availability and accuracy of a world model. The Dyna system generally described in earlier work, uses trial and error to learn a world model which is simultaneously used to plan reactions resulting in optimal action sequences. It is an attempt to integrate planning, reactive, and learning systems. The architecture of Dyna is presented. The different blocks are described. There are three main components of the system. The first is the world model used by the robot for internal world representation. The input of the world model is the current state and the action taken in the current state. The output is the corresponding reward and resulting state. The second module in the system is the policy. The policy observes the current state and outputs the action to be executed by the robot. At the beginning of program execution, the policy is stochastic and through learning progressively becomes deterministic. The policy decides upon an action according to the output of an evaluation function, which is the third module of the system. The evaluation function takes the following as input: the current state of the system, the action taken in that state, the resulting state, and a reward generated by the world which is proportional to the current distance from the goal state. Originally, the work proposed was as follows: (1) to implement a simple 2-D world where a 'robot' is navigating around obstacles, to learn the path to a goal, by using lookup tables; (2) to substitute the world model and Q estimate function Q by neural networks; and (3) to apply the algorithm to a more complex world where the use of a neural network would be fully justified. In this paper, the system design and achieved results will be described. First we implement the world model with a neural network and leave Q implemented as a look up table. Next, we use a lookup table for the world model and implement the Q function with a neural net. Time limitations prevented the combination of these two approaches. The final section discusses the results and gives clues for future work.

Bayesian Inference and Online Learning in Poisson Neuronal Networks.

PubMed

Huang, Yanping; Rao, Rajesh P N

2016-08-01

Motivated by the growing evidence for Bayesian computation in the brain, we show how a two-layer recurrent network of Poisson neurons can perform both approximate Bayesian inference and learning for any hidden Markov model. The lower-layer sensory neurons receive noisy measurements of hidden world states. The higher-layer neurons infer a posterior distribution over world states via Bayesian inference from inputs generated by sensory neurons. We demonstrate how such a neuronal network with synaptic plasticity can implement a form of Bayesian inference similar to Monte Carlo methods such as particle filtering. Each spike in a higher-layer neuron represents a sample of a particular hidden world state. The spiking activity across the neural population approximates the posterior distribution over hidden states. In this model, variability in spiking is regarded not as a nuisance but as an integral feature that provides the variability necessary for sampling during inference. We demonstrate how the network can learn the likelihood model, as well as the transition probabilities underlying the dynamics, using a Hebbian learning rule. We present results illustrating the ability of the network to perform inference and learning for arbitrary hidden Markov models.

The Neonatal Connectome During Preterm Brain Development

PubMed Central

van den Heuvel, Martijn P.; Kersbergen, Karina J.; de Reus, Marcel A.; Keunen, Kristin; Kahn, René S.; Groenendaal, Floris; de Vries, Linda S.; Benders, Manon J.N.L.

2015-01-01

The human connectome is the result of an elaborate developmental trajectory. Acquiring diffusion-weighted imaging and resting-state fMRI, we studied connectome formation during the preterm phase of macroscopic connectome genesis. In total, 27 neonates were scanned at week 30 and/or week 40 gestational age (GA). Examining the architecture of the neonatal anatomical brain network revealed a clear presence of a small-world modular organization before term birth. Analysis of neonatal functional connectivity (FC) showed the early formation of resting-state networks, suggesting that functional networks are present in the preterm brain, albeit being in an immature state. Moreover, structural and FC patterns of the neonatal brain network showed strong overlap with connectome architecture of the adult brain (85 and 81%, respectively). Analysis of brain development between week 30 and week 40 GA revealed clear developmental effects in neonatal connectome architecture, including a significant increase in white matter microstructure (P < 0.01), small-world topology (P < 0.01) and interhemispheric FC (P < 0.01). Computational analysis further showed that developmental changes involved an increase in integration capacity of the connectivity network as a whole. Taken together, we conclude that hallmark organizational structures of the human connectome are present before term birth and subject to early development. PMID:24833018

Graph theoretical analysis of EEG functional connectivity during music perception.

PubMed

Wu, Junjie; Zhang, Junsong; Liu, Chu; Liu, Dongwei; Ding, Xiaojun; Zhou, Changle

2012-11-05

The present study evaluated the effect of music on large-scale structure of functional brain networks using graph theoretical concepts. While most studies on music perception used Western music as an acoustic stimulus, Guqin music, representative of Eastern music, was selected for this experiment to increase our knowledge of music perception. Electroencephalography (EEG) was recorded from non-musician volunteers in three conditions: Guqin music, noise and silence backgrounds. Phase coherence was calculated in the alpha band and between all pairs of EEG channels to construct correlation matrices. Each resulting matrix was converted into a weighted graph using a threshold, and two network measures: the clustering coefficient and characteristic path length were calculated. Music perception was found to display a higher level mean phase coherence. Over the whole range of thresholds, the clustering coefficient was larger while listening to music, whereas the path length was smaller. Networks in music background still had a shorter characteristic path length even after the correction for differences in mean synchronization level among background conditions. This topological change indicated a more optimal structure under music perception. Thus, prominent small-world properties are confirmed in functional brain networks. Furthermore, music perception shows an increase of functional connectivity and an enhancement of small-world network organizations. Copyright © 2012 Elsevier B.V. All rights reserved.

Small Traditional Human Communities Sustain Genomic Diversity over Microgeographic Scales despite Linguistic Isolation

PubMed Central

Cox, Murray P.; Hudjashov, Georgi; Sim, Andre; Savina, Olga; Karafet, Tatiana M.; Sudoyo, Herawati; Lansing, J. Stephen

2016-01-01

At least since the Neolithic, humans have largely lived in networks of small, traditional communities. Often socially isolated, these groups evolved distinct languages and cultures over microgeographic scales of just tens of kilometers. Population genetic theory tells us that genetic drift should act quickly in such isolated groups, thus raising the question: do networks of small human communities maintain levels of genetic diversity over microgeographic scales? This question can no longer be asked in most parts of the world, which have been heavily impacted by historical events that make traditional society structures the exception. However, such studies remain possible in parts of Island Southeast Asia and Oceania, where traditional ways of life are still practiced. We captured genome-wide genetic data, together with linguistic records, for a case–study system—eight villages distributed across Sumba, a small, remote island in eastern Indonesia. More than 4,000 years after these communities were established during the Neolithic period, most speak different languages and can be distinguished genetically. Yet their nuclear diversity is not reduced, instead being comparable to other, even much larger, regional groups. Modeling reveals a separation of time scales: while languages and culture can evolve quickly, creating social barriers, sporadic migration averaged over many generations is sufficient to keep villages linked genetically. This loosely-connected network structure, once the global norm and still extant on Sumba today, provides a living proxy to explore fine-scale genome dynamics in the sort of small traditional communities within which the most recent episodes of human evolution occurred. PMID:27274003

A novel approach to characterize information radiation in complex networks

NASA Astrophysics Data System (ADS)

Wang, Xiaoyang; Wang, Ying; Zhu, Lin; Li, Chao

2016-06-01

The traditional research of information dissemination is mostly based on the virus spreading model that the information is being spread by probability, which does not match very well to the reality, because the information that we receive is always more or less than what was sent. In order to quantitatively describe variations in the amount of information during the spreading process, this article proposes a safety information radiation model on the basis of communication theory, combining with relevant theories of complex networks. This model comprehensively considers the various influence factors when safety information radiates in the network, and introduces some concepts from the communication theory perspective, such as the radiation gain function, receiving gain function, information retaining capacity and information second reception capacity, to describe the safety information radiation process between nodes and dynamically investigate the states of network nodes. On a micro level, this article analyzes the influence of various initial conditions and parameters on safety information radiation through the new model simulation. The simulation reveals that this novel approach can reflect the variation of safety information quantity of each node in the complex network, and the scale-free network has better ;radiation explosive power;, while the small-world network has better ;radiation staying power;. The results also show that it is efficient to improve the overall performance of network security by selecting nodes with high degrees as the information source, refining and simplifying the information, increasing the information second reception capacity and decreasing the noises. In a word, this article lays the foundation for further research on the interactions of information and energy between internal components within complex systems.

Emergent Complexity in Conway's Game of Life

NASA Astrophysics Data System (ADS)

Gotts, Nick

It is shown that both small, finite patterns and random infinite very low density ("sparse") arrays of the Game of Life can produce emergent structures and processes of great complexity, through ramifying feedback networks and cross-scale interactions. The implications are discussed: it is proposed that analogous networks and interactions may have been precursors to natural selection in the real world.

Small-world networks exhibit pronounced intermittent synchronization

NASA Astrophysics Data System (ADS)

Choudhary, Anshul; Mitra, Chiranjit; Kohar, Vivek; Sinha, Sudeshna; Kurths, Jürgen

2017-11-01

We report the phenomenon of temporally intermittently synchronized and desynchronized dynamics in Watts-Strogatz networks of chaotic Rössler oscillators. We consider topologies for which the master stability function (MSF) predicts stable synchronized behaviour, as the rewiring probability (p) is tuned from 0 to 1. MSF essentially utilizes the largest non-zero Lyapunov exponent transversal to the synchronization manifold in making stability considerations, thereby ignoring the other Lyapunov exponents. However, for an N-node networked dynamical system, we observe that the difference in its Lyapunov spectra (corresponding to the N - 1 directions transversal to the synchronization manifold) is crucial and serves as an indicator of the presence of intermittently synchronized behaviour. In addition to the linear stability-based (MSF) analysis, we further provide global stability estimate in terms of the fraction of state-space volume shared by the intermittently synchronized state, as p is varied from 0 to 1. This fraction becomes appreciably large in the small-world regime, which is surprising, since this limit has been otherwise considered optimal for synchronized dynamics. Finally, we characterize the nature of the observed intermittency and its dominance in state-space as network rewiring probability (p) is varied.

Cortical connectivity modulation during sleep onset: A study via graph theory on EEG data.

PubMed

Vecchio, Fabrizio; Miraglia, Francesca; Gorgoni, Maurizio; Ferrara, Michele; Iberite, Francesco; Bramanti, Placido; De Gennaro, Luigi; Rossini, Paolo Maria

2017-11-01

Sleep onset is characterized by a specific and orchestrated pattern of frequency and topographical EEG changes. Conventional power analyses of electroencephalographic (EEG) and computational assessments of network dynamics have described an earlier synchronization of the centrofrontal areas rhythms and a spread of synchronizing signals from associative prefrontal to posterior areas. Here, we assess how "small world" characteristics of the brain networks, as reflected in the EEG rhythms, are modified in the wakefulness-sleep transition comparing the pre- and post-sleep onset epochs. The results show that sleep onset is characterized by a less ordered brain network (as reflected by the higher value of small world) in the sigma band for the frontal lobes indicating stronger connectivity, and a more ordered brain network in the low frequency delta and theta bands indicating disconnection on the remaining brain areas. Our results depict the timing and topography of the specific mechanisms for the maintenance of functional connectivity of frontal brain regions at the sleep onset, also providing a possible explanation for the prevalence of the frontal-to-posterior information flow directionality previously observed after sleep onset. Hum Brain Mapp 38:5456-5464, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Resilience and Controllability of Dynamic Collective Behaviors

PubMed Central

Komareji, Mohammad; Bouffanais, Roland

2013-01-01

The network paradigm is used to gain insight into the structural root causes of the resilience of consensus in dynamic collective behaviors, and to analyze the controllability of the swarm dynamics. Here we devise the dynamic signaling network which is the information transfer channel underpinning the swarm dynamics of the directed interagent connectivity based on a topological neighborhood of interactions. The study of the connectedness of the swarm signaling network reveals the profound relationship between group size and number of interacting neighbors, which is found to be in good agreement with field observations on flock of starlings [Ballerini et al. (2008) Proc. Natl. Acad. Sci. USA, 105: 1232]. Using a dynamical model, we generate dynamic collective behaviors enabling us to uncover that the swarm signaling network is a homogeneous clustered small-world network, thus facilitating emergent outcomes if connectedness is maintained. Resilience of the emergent consensus is tested by introducing exogenous environmental noise, which ultimately stresses how deeply intertwined are the swarm dynamics in the physical and network spaces. The availability of the signaling network allows us to analytically establish for the first time the number of driver agents necessary to fully control the swarm dynamics. PMID:24358209

Resting state network topology of the ferret brain.

PubMed

Zhou, Zhe Charles; Salzwedel, Andrew P; Radtke-Schuller, Susanne; Li, Yuhui; Sellers, Kristin K; Gilmore, John H; Shih, Yen-Yu Ian; Fröhlich, Flavio; Gao, Wei

2016-12-01

Resting state functional magnetic resonance imaging (rsfMRI) has emerged as a versatile tool for non-invasive measurement of functional connectivity patterns in the brain. RsfMRI brain dynamics in rodents, non-human primates, and humans share similar properties; however, little is known about the resting state functional connectivity patterns in the ferret, an animal model with high potential for developmental and cognitive translational study. To address this knowledge-gap, we performed rsfMRI on anesthetized ferrets using a 9.4T MRI scanner, and subsequently performed group-level independent component analysis (gICA) to identify functionally connected brain networks. Group-level ICA analysis revealed distributed sensory, motor, and higher-order networks in the ferret brain. Subsequent connectivity analysis showed interconnected higher-order networks that constituted a putative default mode network (DMN), a network that exhibits altered connectivity in neuropsychiatric disorders. Finally, we assessed ferret brain topological efficiency using graph theory analysis and found that the ferret brain exhibits small-world properties. Overall, these results provide additional evidence for pan-species resting-state networks, further supporting ferret-based studies of sensory and cognitive function. Copyright © 2016 Elsevier Inc. All rights reserved.

Following the Leader? Network Models of "World-Class" Universities on Twitter

ERIC Educational Resources Information Center

Shields, Robin

2016-01-01

Much research on higher education has discussed the positional competition induced by global rankings and the complementary concept of "world-class" universities. This paper investigates the network of social media communication between globally ranked universities. Specifically, it examines whether universities seek to preserve and…

Generalised Sandpile Dynamics on Artificial and Real-World Directed Networks

PubMed Central

Zachariou, Nicky; Expert, Paul; Takayasu, Misako; Christensen, Kim

2015-01-01

The main finding of this paper is a novel avalanche-size exponent τ ≈ 1.87 when the generalised sandpile dynamics evolves on the real-world Japanese inter-firm network. The topology of this network is non-layered and directed, displaying the typical bow tie structure found in real-world directed networks, with cycles and triangles. We show that one can move from a strictly layered regular lattice to a more fluid structure of the inter-firm network in a few simple steps. Relaxing the regular lattice structure by introducing an interlayer distribution for the interactions, forces the scaling exponent of the avalanche-size probability density function τ out of the two-dimensional directed sandpile universality class τ = 4/3, into the mean field universality class τ = 3/2. Numerical investigation shows that these two classes are the only that exist on the directed sandpile, regardless of the underlying topology, as long as it is strictly layered. Randomly adding a small proportion of links connecting non adjacent layers in an otherwise layered network takes the system out of the mean field regime to produce non-trivial avalanche-size probability density function. Although these do not display proper scaling, they closely reproduce the behaviour observed on the Japanese inter-firm network. PMID:26606143

Generalised Sandpile Dynamics on Artificial and Real-World Directed Networks.

PubMed

Zachariou, Nicky; Expert, Paul; Takayasu, Misako; Christensen, Kim

2015-01-01

The main finding of this paper is a novel avalanche-size exponent τ ≈ 1.87 when the generalised sandpile dynamics evolves on the real-world Japanese inter-firm network. The topology of this network is non-layered and directed, displaying the typical bow tie structure found in real-world directed networks, with cycles and triangles. We show that one can move from a strictly layered regular lattice to a more fluid structure of the inter-firm network in a few simple steps. Relaxing the regular lattice structure by introducing an interlayer distribution for the interactions, forces the scaling exponent of the avalanche-size probability density function τ out of the two-dimensional directed sandpile universality class τ = 4/3, into the mean field universality class τ = 3/2. Numerical investigation shows that these two classes are the only that exist on the directed sandpile, regardless of the underlying topology, as long as it is strictly layered. Randomly adding a small proportion of links connecting non adjacent layers in an otherwise layered network takes the system out of the mean field regime to produce non-trivial avalanche-size probability density function. Although these do not display proper scaling, they closely reproduce the behaviour observed on the Japanese inter-firm network.

Raspberry Shake- A World-Wide Citizen Seismograph Network

NASA Astrophysics Data System (ADS)

Christensen, B. C.; Blanco Chia, J. F.

2017-12-01

Raspberry Shake was conceived as an inexpensive plug-and-play solution to satisfy the need for universal, quick and accurate earthquake detections. First launched on Kickstarter's crowdfunding platform in July of 2016, the Raspberry Shake project was funded within hours of the launch date and, by the end of the campaign, reached more than 1000% of its initial funding goal. This demonstrated for the first time that there exists a strong interest among Makers, Hobbyists and Do It Yourselfers for personal seismographs. From here, a citizen scientist network was created and it has steadily been growing. The Raspberry Shake network is currently being used in conjunction with publicly available broadband data from the GSN and other state-run seismic networks available through the IRIS, Geoscope and GEOFON data centers to detect and locate earthquakes large and small around the globe. Raspberry Shake looks well positioned to improve local monitoring of earthquakes on a global scale, deepen community's understanding of earthquakes, and serve as a formidable teaching tool. We present the main results of the project, the current state of the network, and the new Raspberry Shake models that are being built.

A Complex Network Theory Approach for the Spatial Distribution of Fire Breaks in Heterogeneous Forest Landscapes for the Control of Wildland Fires

PubMed Central

Russo, Lucia; Russo, Paola; Siettos, Constantinos I.

2016-01-01

Based on complex network theory, we propose a computational methodology which addresses the spatial distribution of fuel breaks for the inhibition of the spread of wildland fires on heterogeneous landscapes. This is a two-level approach where the dynamics of fire spread are modeled as a random Markov field process on a directed network whose edge weights are determined by a Cellular Automata model that integrates detailed GIS, landscape and meteorological data. Within this framework, the spatial distribution of fuel breaks is reduced to the problem of finding network nodes (small land patches) which favour fire propagation. Here, this is accomplished by exploiting network centrality statistics. We illustrate the proposed approach through (a) an artificial forest of randomly distributed density of vegetation, and (b) a real-world case concerning the island of Rhodes in Greece whose major part of its forest was burned in 2008. Simulation results show that the proposed methodology outperforms the benchmark/conventional policy of fuel reduction as this can be realized by selective harvesting and/or prescribed burning based on the density and flammability of vegetation. Interestingly, our approach reveals that patches with sparse density of vegetation may act as hubs for the spread of the fire. PMID:27780249

A gene co-expression network model identifies yield-related vicinity networks in Jatropha curcas shoot system.

PubMed

Govender, Nisha; Senan, Siju; Mohamed-Hussein, Zeti-Azura; Wickneswari, Ratnam

2018-06-15

The plant shoot system consists of reproductive organs such as inflorescences, buds and fruits, and the vegetative leaves and stems. In this study, the reproductive part of the Jatropha curcas shoot system, which includes the aerial shoots, shoots bearing the inflorescence and inflorescence were investigated in regard to gene-to-gene interactions underpinning yield-related biological processes. An RNA-seq based sequencing of shoot tissues performed on an Illumina HiSeq. 2500 platform generated 18 transcriptomes. Using the reference genome-based mapping approach, a total of 64 361 genes was identified in all samples and the data was annotated against the non-redundant database by the BLAST2GO Pro. Suite. After removing the outlier genes and samples, a total of 12 734 genes across 17 samples were subjected to gene co-expression network construction using petal, an R library. A gene co-expression network model built with scale-free and small-world properties extracted four vicinity networks (VNs) with putative involvement in yield-related biological processes as follow; heat stress tolerance, floral and shoot meristem differentiation, biosynthesis of chlorophyll molecules and laticifers, cell wall metabolism and epigenetic regulations. Our VNs revealed putative key players that could be adapted in breeding strategies for J. curcas shoot system improvements.

A Complex Network Theory Approach for the Spatial Distribution of Fire Breaks in Heterogeneous Forest Landscapes for the Control of Wildland Fires.

PubMed

Russo, Lucia; Russo, Paola; Siettos, Constantinos I

2016-01-01

Based on complex network theory, we propose a computational methodology which addresses the spatial distribution of fuel breaks for the inhibition of the spread of wildland fires on heterogeneous landscapes. This is a two-level approach where the dynamics of fire spread are modeled as a random Markov field process on a directed network whose edge weights are determined by a Cellular Automata model that integrates detailed GIS, landscape and meteorological data. Within this framework, the spatial distribution of fuel breaks is reduced to the problem of finding network nodes (small land patches) which favour fire propagation. Here, this is accomplished by exploiting network centrality statistics. We illustrate the proposed approach through (a) an artificial forest of randomly distributed density of vegetation, and (b) a real-world case concerning the island of Rhodes in Greece whose major part of its forest was burned in 2008. Simulation results show that the proposed methodology outperforms the benchmark/conventional policy of fuel reduction as this can be realized by selective harvesting and/or prescribed burning based on the density and flammability of vegetation. Interestingly, our approach reveals that patches with sparse density of vegetation may act as hubs for the spread of the fire.

Modeling epidemics on adaptively evolving networks: A data-mining perspective.

PubMed

Kattis, Assimakis A; Holiday, Alexander; Stoica, Ana-Andreea; Kevrekidis, Ioannis G

2016-01-01

The exploration of epidemic dynamics on dynamically evolving ("adaptive") networks poses nontrivial challenges to the modeler, such as the determination of a small number of informative statistics of the detailed network state (that is, a few "good observables") that usefully summarize the overall (macroscopic, systems-level) behavior. Obtaining reduced, small size accurate models in terms of these few statistical observables--that is, trying to coarse-grain the full network epidemic model to a small but useful macroscopic one--is even more daunting. Here we describe a data-based approach to solving the first challenge: the detection of a few informative collective observables of the detailed epidemic dynamics. This is accomplished through Diffusion Maps (DMAPS), a recently developed data-mining technique. We illustrate the approach through simulations of a simple mathematical model of epidemics on a network: a model known to exhibit complex temporal dynamics. We discuss potential extensions of the approach, as well as possible shortcomings.

Development of mini VSAT system

NASA Astrophysics Data System (ADS)

Lu, Shyue-Ching; Chiu, Wu-Jhy; Lin, Hen-Dao; Shih, Mu-Piao

1992-03-01

This paper presents the mini VSAT (very small aperture terminal) system, which is a low cost networking system providing economical alternatives to the business world's datacom needs. The system is designed to achieve the highest possible performance/price ratio for private VSAT networks that range from a few tens of remote terminals to large networks of several thousands remote terminals. The paper describes the system architecture, major features, hardware and software structure, access protocol and performance of the developed system.

The evolution analysis of listed companies co-holding non-listed financial companies based on two-mode heterogeneous networks

NASA Astrophysics Data System (ADS)

An, Pengli; Li, Huajiao; Zhou, Jinsheng; Chen, Fan

2017-10-01

Complex network theory is a widely used tool in the empirical research of financial markets. Two-mode and multi-mode networks are new trends and represent new directions in that they can more accurately simulate relationships between entities. In this paper, we use data for Chinese listed companies holding non-listed financial companies over a ten-year period to construct two networks: a two-mode primitive network in which listed companies and non-listed financial companies are considered actors and events, respectively, and a one-mode network that is constructed based on the decreasing-mode method in which listed companies are considered nodes. We analyze the evolution of the listed company co-holding network from several perspectives, including that of the whole network, of information control ability, of implicit relationships, of community division and of small-world characteristics. The results of the analysis indicate that (1) China's developing stock market affects the share-holding condition of listed companies holding non-listed financial companies; (2) the information control ability of co-holding networks is focused on a few listed companies and the implicit relationship of investment preference between listed companies is determined by the co-holding behavior; (3) the community division of the co-holding network is increasingly obvious, as determined by the investment preferences among listed companies; and (4) the small-world characteristics of the co-holding network are increasingly obvious, resulting in reduced communication costs. In this paper, we conduct an evolution analysis and develop an understanding of the factors that influence the listed companies co-holding network. This study will help illuminate research on evolution analysis.

Fiia: A Model-Based Approach to Engineering Collaborative Augmented Reality

NASA Astrophysics Data System (ADS)

Wolfe, Christopher; Smith, J. David; Phillips, W. Greg; Graham, T. C. Nicholas

Augmented reality systems often involve collaboration among groups of people. While there are numerous toolkits that aid the development of such augmented reality groupware systems (e.g., ARToolkit and Groupkit), there remains an enormous gap between the specification of an AR groupware application and its implementation. In this chapter, we present Fiia, a toolkit which simplifies the development of collaborative AR applications. Developers specify the structure of their applications using the Fiia modeling language, which abstracts details of networking and provides high-level support for specifying adapters between the physical and virtual world. The Fiia.Net runtime system then maps this conceptual model to a runtime implementation. We illustrate Fiia via Raptor, an augmented reality application used to help small groups collaboratively prototype video games.

Echo State Networks for data-driven downhole pressure estimation in gas-lift oil wells.

PubMed

Antonelo, Eric A; Camponogara, Eduardo; Foss, Bjarne

2017-01-01

Process measurements are of vital importance for monitoring and control of industrial plants. When we consider offshore oil production platforms, wells that require gas-lift technology to yield oil production from low pressure oil reservoirs can become unstable under some conditions. This undesirable phenomenon is usually called slugging flow, and can be identified by an oscillatory behavior of the downhole pressure measurement. Given the importance of this measurement and the unreliability of the related sensor, this work aims at designing data-driven soft-sensors for downhole pressure estimation in two contexts: one for speeding up first-principle model simulation of a vertical riser model; and another for estimating the downhole pressure using real-world data from an oil well from Petrobras based only on topside platform measurements. Both tasks are tackled by employing Echo State Networks (ESN) as an efficient technique for training Recurrent Neural Networks. We show that a single ESN is capable of robustly modeling both the slugging flow behavior and a steady state based only on a square wave input signal representing the production choke opening in the vertical riser. Besides, we compare the performance of a standard network to the performance of a multiple timescale hierarchical architecture in the second task and show that the latter architecture performs better in modeling both large irregular transients and more commonly occurring small oscillations. Copyright © 2016 Elsevier Ltd. All rights reserved.

Current-flow efficiency of networks

NASA Astrophysics Data System (ADS)

Liu, Kai; Yan, Xiaoyong

2018-02-01

Many real-world networks, from infrastructure networks to social and communication networks, can be formulated as flow networks. How to realistically measure the transport efficiency of these networks is of fundamental importance. The shortest-path-based efficiency measurement has limitations, as it assumes that flow travels only along those shortest paths. Here, we propose a new metric named current-flow efficiency, in which we calculate the average reciprocal effective resistance between all pairs of nodes in the network. This metric takes the multipath effect into consideration and is more suitable for measuring the efficiency of many real-world flow equilibrium networks. Moreover, this metric can handle a disconnected graph and can thus be used to identify critical nodes and edges from the efficiency-loss perspective. We further analyze how the topological structure affects the current-flow efficiency of networks based on some model and real-world networks. Our results enable a better understanding of flow networks and shed light on the design and improvement of such networks with higher transport efficiency.