A unified model for Sierpinski networks with scale-free scaling and small-world effect

In this paper, we propose an evolving Sierpinski gasket, based on which we establish a model of evolutionary Sierpinski networks (ESNs) that unifies deterministic Sierpinski network [Z.Z. Zhang, S.G. Zhou, T. Zou, L.C. Chen, J.H. Guan, Eur. Phys. J. B 60 (2007) 259] and random Sierpinski network [Z.Z. Zhang, S.G. Zhou, Z. Su, T. Zou, J.H. Guan, Eur. Phys. J. B 65 (2008) 141] to the same framework. We suggest an iterative algorithm generating the ESNs. On the basis of the algorithm, some relevant properties of presented networks are calculated or predicted analytically. Analytical solution shows that the networks under consideration follow a power-law degree distribution, with the distribution exponent continuously tuned in a wide range. The obtained accurate expression of clustering coefficient, together with the prediction of average path length reveals that the ESNs possess small-world effect. All our theoretical results are successfully contrasted by numerical simulations. Moreover, the evolutionary prisoner’s dilemma game is also studied on some limitations of the ESNs, i.e., deterministic Sierpinski network and random Sierpinski network.     

Intrinsic quantum computation

We introduce ways to measure information storage in quantum systems, using a recently introduced computation-theoretic model that accounts for measurement effects. The first, the quantum excess entropy, quantifies the shared information between a quantum process's past and its future. The second, the quantum transient information, determines the difficulty with which an observer comes to know the internal state of a quantum process through measurements. We contrast these with von Neumann entropy and quantum entropy rate and provide a closed-form expression for the latter for the class of deterministic quantum processes.     

A Non-Stationary Poisson Model for the Scaling of Urban Traffic Fluctuations

We investigate the traffic flow volume data on the time dependent activity of Beijing＇s urban road network. The couplings between the average flux and the fluctuations on individual links are shown to follow certain scaling laws and yield a wide variety of scaling exponents between 1/2 and 1. To quantitatively explain this interesting phenomenon, a non-stationary Poisson arriving model is proposed. The scaling property is interpreted as the result of the time- variation of the arriving rate of flux over the network, which nicely explicates the effect of aggregation windows, and provides a concise model for the dependence of scaling exponent on the external/internal force ratio.     

A Law of Gravitation for Complex Networks

Inspiring Newton＇s law of universal gravitation and empirical studies, we propose a concept of virtual network mass and network gravitational force in complex networks. Then a network gravitational model for complex networks is presented. In the model, each node in the network is described with its position, edges （links） and virtual network mass. The proposed model is examined by experiments to show its potential applications.     

A class of improved algorithms for detecting communities in complex networks

Detecting communities in complex networks is of considerable importance for understanding both the structure and function of the networks. Here, we propose a class of improved algorithms for community detection, by combining the betweenness algorithm of Girvan and Newman with the edge weight defined by the edge-clustering coefficient. The improved algorithms are tested on some artificial and real-world networks, and the results show that they can detect communities of networks more effectively in both unweighted and weighted cases. In addition, the technique for improving the betweenness algorithm in this paper, thanks to its compatibility, can directly be applied to various detection algorithms.     

A robust matching model of capacity to defense cascading failure on complex networks

How to control the cascading failure has become a hot topic in recent years. In this paper, we propose a new matching model of capacity by developing a profit function to defense cascading failures on artificially created scale-free networks and the real network structure of the North American power grid. Results show that our matching model can enhance the network robustness efficiently, which is particularly important for the design of networks to deduce the damage triggered by the cascading failures.     

The complexity of Chinese syntactic dependency networks

This paper proposes how to build a syntactic network based on syntactic theory and presents some statistical properties of Chinese syntactic dependency networks based on two Chinese treebanks with different genres. The results show that the two syntactic networks are small-world networks, and their degree distributions obey a power law. The finding, that the two syntactic networks have the same diameter and different average degrees, path lengths, clustering coefficients and power exponents, can be seen as an indicator that complexity theory can work as a means of stylistic study. The paper links the degree of a vertex with a valency of a word, the small world with the minimized average distance of a language, that reinforces the explanations of the findings from linguistics.     

Dynamics of traffic networks: From microscopic and macroscopic perspectives

Considering the microscopic characteristics (vehicle speed, road length etc.) of links and macroscopic behaviors of traffic systems, we derive the critical flow generation rate in scale-free networks. And the dynamics of traffic congestion is studied numerically in this paper. It is shown that the queue length increases with microscopic characteristics of links. Additionally, the critical flow generation rate decreases with increase of the network size N, maximum speed v_max and parameter τ. The significance of this finding is that, in order to improve the traffic environment, both the local information for the single link and behaviors of the whole network must be analyzed simultaneously in a traffic system design.     

Macro-Behaviour of Agents＇ Opinion under Influence of an External Field

We propose a model to study the evolution of opinion under the influence of all external field on small world network. The maero-behaviour of agents＇ opinion and the relative change rate as time elapses are studied. The external field is found to play an important role in making the opinion s（t） balance or increase, and without the influence of the external field, the relative change rate γ（t） shows nonlinear increasing behaviour as time runs. What is more, this nonlinear increasing behaviour is independent of the initial condition, the strength of the external field and the time that we cancel the external field. The results may reflect some phenomena in our society, such as the function of the macro-control in China or the mass media in our society.     

Effects of small world topology on the critical boundary for Boolean networks

Due to their complexity, real dynamic systems are widely regarded as operating on the boundary between order and chaos. Therefore it is of great interest to determine analytical expressions for this boundary. For random Boolean networks model, a well known critical value of bias is established as , where K is the mean connectivity. Recent research shows, however, that this expression may need to be modified. In this paper, we shall focus on the effects of topology deviation from the random network assumption since the topologies of many real networks are neither pure random nor fully regular Boolean networks. A modification of the critical boundary condition is given with parameters of the degree distribution in the setting of more realistic networks modeled with small world features.     

Detection of changes in the fractal scaling of heart rate and speed in a marathon race

The aim of this study was to detect changes in the fractal scaling behavior of heart rate and speed fluctuations when the average runner’s speed decreased with fatigue. Scaling analysis in heart rate (HR) and speed (S) dynamics of marathon runners was performed using the detrended fluctuation analysis (DFA) and the wavelet based structure function. We considered both: the short-range (α₁) and the long-range (α₂) scaling exponents for the DFA method separated by a change-point, (box length), the same for all the races. The variability of HR and S decreased in the second part of the marathon race, while the cardiac cost time series (i.e. the number of cardiac beats per meter) increased due to the decreasing speed behavior. The scaling exponents α₁ and α₂ of HR and α₁ of S, increased during the race () as did the HR wavelet scaling exponent (τ). These findings provide evidence of the significant effect of fatigue induced by long exercise on the heart rate and speed variability.     

Delay-enhanced coherence of spiral waves in noisy Hodgkin-Huxley neuronal networks

We study the spatial dynamics of spiral waves in noisy Hodgkin-Huxley neuronal ensembles evoked by different information transmission delays and network topologies. In classical settings of coherence resonance the intensity of noise is fine-tuned so as to optimize the system's response. Here, we keep the noise intensity constant, and instead, vary the length of information transmission delay amongst coupled neurons. We show that there exists an intermediate transmission delay by which the spiral waves are optimally ordered, hence indicating the existence of delay-enhanced coherence of spatial dynamics in the examined system. Additionally, we examine the robustness of this phenomenon as the diffusive interaction topology changes towards the small-world type, and discover that shortcut links amongst distant neurons hinder the emergence of coherent spiral waves irrespective of transmission delay length. Presented results thus provide insights that could facilitate the understanding of information transmission delay on realistic neuronal networks.     

Geographical Effects on Complex Networks

We investigate how the geographical structure of a complex network affects its network topology, synchronization and the average spatial length of edges. The geographical structure means that the connecting probability of two nodes is related to the spatial distance of the two nodes. Our simulation results show that the geographical structure changes the network topology. The synchronization tendency is enhanced and the average spatial length of edges is enlarged when the node can randomly connect to the further one. Analytic results support our understanding of the phenomena.     

A tree-like complex network model

We propose a new tree-like network model. Our results indicate that the tree-like model has a small-world effect with a small average path length and large clustering coefficient. Strikingly, our tree-like model is scale-free. We also add weight to the links following the network structure. With this adding-weight method, the weight of the nodes shows exponential growth, which is ubiquitous in social networks.     

Dynamical behaviors of inter-out-of-equilibrium state intervals in Korean futures exchange markets

A recently discovered feature of financial markets, the two-phase phenomenon, is utilized to categorize a financial time series into two phases, namely equilibrium and out-of-equilibrium states. For out-of-equilibrium states, we analyze the time intervals at which the state is revisited. The power-law distribution of inter-out-of-equilibrium state intervals is shown and we present an analogy with discrete-time heat bath dynamics, similar to random Ising systems. In the mean-field approximation, this model reduces to a one-dimensional multiplicative process. By varying global and local model parameters, the relevance between volatilities in financial markets and the interaction strengths between agents in the Ising model are investigated and discussed.     

Structure of a financial cross-correlation matrix under attack

We investigate the structure of a perturbed stock market in terms of correlation matrices. For the purpose of perturbing a stock market, two distinct methods are used, namely local and global perturbation. The former involves replacing a correlation coefficient of the cross-correlation matrix with one calculated from two Gaussian-distributed time series while the latter reconstructs the cross-correlation matrix just after replacing the original return series with Gaussian-distributed time series. Concerning the local case, it is a technical study only and there is no attempt to model reality. The term ‘global’ means the overall effect of the replacement on other untouched returns. Through statistical analyses such as random matrix theory (RMT), network theory, and the correlation coefficient distributions, we show that the global structure of a stock market is vulnerable to perturbation. However, apart from in the analysis of inverse participation ratios (IPRs), the vulnerability becomes dull under a small-scale perturbation. This means that these analysis tools are inappropriate for monitoring the whole stock market due to the low sensitivity of a stock market to a small-scale perturbation. In contrast, when going down to the structure of business sectors, we confirm that correlation-based business sectors are regrouped in terms of IPRs. This result gives a clue about monitoring the effect of hidden intentions, which are revealed via portfolios taken mostly by large investors.     

Pacemaker-guided noise-induced spatial periodicity in excitable media

We study the impact of subthreshold periodic pacemaker activity and internal noise on the spatial dynamics of excitable media. For this purpose, we examine two systems that both consist of diffusively coupled units. In the first case, the local dynamics of the units is driven by a simple one-dimensional model of excitability with a piece-wise linear potential. In the second case, a more realistic biological system is studied, and the local dynamics is driven by a model for calcium oscillations. Internal noise is introduced via the τ-leap stochastic integration procedure and its intensity is determined by the finite size of each constitutive system unit. We show that there exists an intermediate level of internal stochasticity for which the localized pacemaker activity maps best into coherent periodic waves, whose spatial frequency is uniquely determined by the local subthreshold forcing. Via an analytical treatment of the simple minimal model for the excitable spatially extended system, we explicitly link the pacemaker activity with the spatial dynamics and determine necessary conditions that warrant the observation of the phenomenon in excitable media. Our results could prove useful for the understanding of interplay between local and global agonists affecting the functioning of tissue and organs.     

A local-world node deleting evolving network model

A new type network growth rule which comprises node addition with the concept of local-world connectivity and node deleting is studied. A series of theoretical analysis and numerical simulation to the LWD network are conducted in this Letter. Firstly, the degree distribution p(k) of this network changes no longer pure scale free but truncates by an exponential tail and the truncation in p(k) increases as pa decreases. Secondly, the connectivity is tighter, as the local-world size M increases. Thirdly, the average path length L increases and the clustering coefficient 〈C〉 decreases as generally node deleting increases. Finally, 〈C〉 trends up when the local-world size M increases, so as to kmax. Hence, the expanding local-world can compensate the infection of the node deleting.     

Universal power laws in the threshold network model: A theoretical analysis based on extreme value theory

We theoretically and numerically investigated the threshold network model with a generic weight function where there were a large number of nodes and a high threshold. Our analysis was based on extreme value theory, which gave us a theoretical understanding of the distribution of independent and identically distributed random variables within a sufficiently high range. Specifically, the distribution could be generally expressed by a generalized Pareto distribution, which enabled us to formulate the generic weight distribution function. By using the theorem, we obtained the exact expressions of degree distribution and clustering coefficient which behaved as universal power laws within certain ranges of degrees. We also compared the theoretical predictions with numerical results and found that they were extremely consistent.