A hierarchical heteroclinic network

We consider a heteroclinic network in the framework of winnerless competition of species. It consists of two levels of heteroclinic cycles. On the lower level, the heteroclinic cycle connects three saddles, each representing the survival of a single species; on the higher level, the cycle connects three such heteroclinic cycles, in which nine species are involved. We show how to tune the predation rates in order to generate the long time scales on the higher level from the shorter time scales on the lower level. Moreover, when we tune a single bifurcation parameter, first the motion along the lower and next along the higher-level heteroclinic cycles are replaced by a heteroclinic cycle between 3-species coexistence-fixed points and by a 9-species coexistence-fixed point, respectively. We also observe a similar impact of additive noise. Beyond its usual role of preventing the slowing-down of heteroclinic trajectories at small noise level, its increasing strength can replace the lower-level heteroclinic cycle by 3-species coexistence fixed-points, connected by an effective limit cycle, and for even stronger noise the trajectories converge to the 9-species coexistence-fixed point. The model has applications to systems in which slow oscillations modulate fast oscillations with sudden transitions between the temporary winners.     

Hölder continuity of generalized chaos synchronization in complex networks

A complex network consisting of chaotic systems is considered and the existence of the Hölder continuous generalized synchronization in the network is studied. First, we divide nodes of the network into two parts according to their dynamical behaviour. Then, based on the Schauder fixed point theorem, sufficient conditions for the existence of the generalized synchronization between them are derived. Moreover, the results are theoretically proved. Numerical simulations validate the theory.     

Heteroclinic contours and self-replicated solitary waves in a reaction–diffusion lattice with complex threshold excitation

The space–time dynamics of the network system modeling collective behavior of electrically coupled nonlinear cells is investigated. The dynamics of a local cell is described by the FitzHugh–Nagumo system with complex threshold excitation. Heteroclinic orbits defining traveling wave front solutions are investigated in a moving frame system. A heteroclinic contour formed by separatrix manifolds of two saddle-foci is found in the phase space. The existence of such structure indicates the appearance of complex wave patterns in the network. Such solutions have been confirmed and analyzed numerically. Complex homoclinic orbits found in the neighborhood of the heteroclinic contour define the propagation of composite pulse excitations that can be self-replicated in collisions leading to the appearance of complex wave patterns.     

Solitary Waves of a Perturbed sine—Gordon Equation

Based on the bifurcation and the idea that the solitary waves and shock waves of partial differential equations correspond respectively to the homoclinic and heteroclinic trajectories of nonlinear ordinary differential equations satisfied by the travelling waves,different conditions for the existence of solitary waves of a perturbed sine-Gordon equation are obtained.All of the corresponding approximate solitary wave solutions are given by integrating the derived approximate equations directly.     

Dynamical encoding by networks of competing neuron groups: winnerless competition

Following studies of olfactory processing in insects and fish, we investigate neural networks whose dynamics in phase space is represented by orbits near the heteroclinic connections between saddle regions (fixed points or limit cycles). These networks encode input information as trajectories along the heteroclinic connections. If there are N neurons in the network, the capacity is approximately e(N-1)!, i.e., much larger than that of most traditional network structures. We show that a small winnerless competition network composed of FitzHugh-Nagumo spiking neurons efficiently transforms input information into a spatiotemporal output.     

Bifurcation to heteroclinic cycles and sensitivity in three and four coupled phase oscillators

We study the bifurcation and dynamical behaviour of the system of N globally coupled identical phase oscillators introduced by Hansel, Mato and Meunier, in the cases N=3 and N=4. This model has been found to exhibit robust ‘slow switching’ oscillations that are caused by the presence of robust heteroclinic attractors. This paper presents a bifurcation analysis of the system in an attempt to better understand the creation of such attractors. We consider bifurcations that occur in a system of identical oscillators on varying the parameters in the coupling function. These bifurcations preserve the permutation symmetry of the system. We then investigate the implications of these bifurcations for the sensitivity to detuning (i.e. the size of the smallest perturbations that give rise to loss of frequency locking).For N=3 we find three types of heteroclinic bifurcation that are codimension-one with symmetry. On varying two parameters in the coupling function we find three curves giving (a) an S₃-transcritical homoclinic bifurcation, (b) a saddle-node/heteroclinic bifurcation and (c) a Z₃-heteroclinic bifurcation. We also identify several global bifurcations with symmetry that organize the bifurcation diagram; these are codimension-two with symmetry.For N=4 oscillators we determine many (but not all) codimension-one bifurcations with symmetry, including those that lead to a robust heteroclinic cycle. A robust heteroclinic cycle is stable in an open region of parameter space and unstable in another open region. Furthermore, we verify that there is a subregion where the heteroclinic cycle is the only attractor of the system, while for other parts of the phase plane it can coexist with stable limit cycles. We finish with a discussion of bifurcations that appear for this coupling function and general N, as well as for more general coupling functions.     

Extracting hidden fluctuation patterns of Hang Seng stock index from network topologies

We present a model of complex network generated from Hang Seng index (HSI) of Hong Kong stock market, which encodes stock market relevant both interconnections and interactions between fluctuation patterns of HSI in the network topologies. In the network, the nodes (edges) represent all kinds of patterns of HSI fluctuation (their interconnections). Based on network topological statistic, we present efficient algorithms, measuring betweenness centrality (BC) and inverse participation ratio (IPR) of network adjacency matrix, for detecting topological important nodes. We have at least obtained three uniform nodes of topological importance, and find the three nodes, i.e. 18.7% nodes undertake 71.9% betweenness centrality and closely correlate other nodes. From these topological important nodes, we can extract hidden significant fluctuation patterns of HSI. We also find these patterns are independent the time intervals scales. The results contain important physical implication, i.e. the significant patterns play much more important roles in both information control and transport of stock market, and should be useful for us to more understand fluctuations regularity of stock market index. Moreover, we could conclude that Hong Kong stock market, rather than a random system, is statistically stable, by comparison to random networks.     

PageRank centrality for temporal networks

In this paper, we propose a new centrality measure for ranking the nodes and time layers of temporal networks simultaneously, referred to as the f-PageRank centrality. The f-PageRank values of nodes and time layers in temporal networks are obtained by solving the eigenvector of a multi-homogeneous map. The existence and uniqueness of the proposed centrality measure are also guaranteed by existing results, under some reasonable conditions. The numerical experiments on a synthetic temporal network and two real-world temporal networks (i.e., Email-Eu-core and CollegeMsg temporal networks) show that the proposed centrality outperforms some existing centrality measures.     

Novel homoclinic and heteroclinic solutions for the 2D complex cubic Ginzburg-Landau equation

Homoclinic and heteroclinic solutions are two important concepts that are used to investigate the complex properties of nonlinear evolutionary equations. In this Letter, we perform hyperbolic and linear stability analysis, and prove the existence of homoclinic and heteroclinic solutions for two-dimensional cubic Ginzburg-Landau equation with periodic boundary condition and even constraint. Then, using the Hirota's bilinear transformation, we find the closed-form homoclinic and heteroclinic solutions. Moreover, we find that the homoclinic tubes and two families of heteroclinic solutions are asymptotic to a periodic cycle in one dimension.     

Escape dynamics in collinear atomic-like three mass point systems

The present paper studies the escape mechanism in collinear three point mass systems with small-range-repulsive/large-range-attractive pairwise interaction. Specifically, we focus on the asymptotic behaviour for systems with non-negative total energy.On the zero energy level set there are two distinct asymptotic states, called 1+1+1escape configurations, where all the three separations infinitely increase as t→∞. We show that 1+1+1 escapes are improbable by proving that the set of initial conditions leading to such asymptotic configurations has zero Lebesgue measure. When the outer mass points are of the same kind we deduce the existence of a heteroclinic orbit connecting the 1+1+1 escape configurations. We further prove that this orbit is stable under parameter perturbation.In the positive energies’ case, we show that the set of initial conditions leading to 1+1+1 escape configurations has positive Lebesgue measure.     

Time-periodic perturbation of a Liénard equation with an unbounded homoclinic loop

We consider a quadratic Liénard equation with an unbounded homoclinic loop, which is a solution tending in forward and backward time to a non-hyperbolic equilibrium point located at infinity. Under small time-periodic perturbation, this equilibrium becomes a normally hyperbolic line of singularities at infinity. We show that the perturbed system may present homoclinic bifurcations, leading to the existence of transverse intersections between the stable and unstable manifolds of such a normally hyperbolic line of singularities. The global study concerning the infinity is performed using the Poincaré compactification in polar coordinates, from which we obtain a system defined on a set equivalent to a solid torus in R³, whose boundary plays the role of the infinity. The transversality of the manifolds is proved using the Melnikov method and implies, via the Birkhoff-Smale Theorem, a complex dynamical behaviour of the perturbed system solutions in the finite part of the phase space. Numerical simulations are performed in order to illustrate this behaviour, which could be called “the chaos arising from infinity”, since it depends on the global structure of the Liénard equation, including the points at infinity. Although applied to a particular case, the analysis presented provides a geometrical approach to study periodic perturbations of homoclinic (or heteroclinic) loops to infinity of any planar polynomial vector field.     

Cascade dynamics of complex propagation

Random links between otherwise distant nodes can greatly facilitate the propagation of disease or information, provided contagion can be transmitted by a single active node. However, we show that when the propagation requires simultaneous exposure to multiple sources of activation, called complex propagation, the effect of random links can be just the opposite; it can make the propagation more difficult to achieve. We numerically calculate critical points for a threshold model using several classes of complex networks, including an empirical social network. We also provide an estimation of the critical values in terms of vulnerable nodes.     

Eikonal equation for partially coherent fields

Coherence is the study of the amplitude correlations of optical fields. Its physical features can be obtained from the cross-spectral density function W(x₁,x₂,γ) which satisfies two coupled Helmholtz equations. In this article, we describe the amplitude of the optical field using the angular spectrum model. With this representation we calculate the propagation of the correlation function emerging from a transmittance plane. We show that the cross-spectral density function, can be described by just one Helmholtz equation. The treatment permits us to associate directional features to the coherence phenomena. This implies the existence of extremal trajectories of correlation, which are characterized by an eikonal equation, and the existence of a function for media fluctuations, which we term the correlation refractive index. Experimental results are shown for the synthesis of partially coherent focusing regions, which are described by an ensemble of extreme correlation trajectories.     

Response of scale-free networks with community structure to external stimuli

The response of scale-free networks with community structure to external stimuli is studied. By disturbing some nodes with different strategies, it is shown that the robustness of this kind of network can be enhanced due to the existence of communities in the networks. Some of the response patterns are found to coincide with topological communities. We show that such phenomena also occur in the cat brain network which is an example of a scale-free like network with community structure. Our results provide insights into the relationship between network topology and the functional organization in complex networks from another viewpoint.     

基于复杂网络理论的北京公交网络拓扑性质分析

为分析公交复杂网络的拓扑性质, 本文以北京市为例, 选取截止到2010年7月的北京全市(14区、2县)的1165条公交线路和9618个公交站点为样本数据, 运用复杂网络理论构建起基于邻接站点的有向加权复杂网络模型. 该方法以公交站点作为节点, 相邻站点之间的公交线路作为边, 使得网络既具有复杂网络的拓扑性质同时节点(站点)又具有明确的地理坐标. 对网络中节点度、点强度、强度分布、平均最短路径、聚类系数等性质的分析显示, 公交复杂网络的度和点强度分布极为不均, 网络中前5%和前10%节点的累计强度分布分别达到22.43%和43.02%; 点强度与排列序数、累积强度分布都服从幂律分布, 具有无标度和小世界的网络特点, 少数关键节点在网络中发挥着重要的连接作用. 为分析复杂网络中的关键节点, 本文通过承载压力分析和基于"掠夺" 的区域中心节点提取两种方法, 得到了公交复杂网络中两类不同表现的关键节点. 这些规律也为优化城市公交网络及交通规划发展提供了新的参考建议.     

Coherent States and Modified de Broglie-Bohm Complex Quantum Trajectories

This paper examines the nature of classical correspondence in the case of coherent states at the level of quantum trajectories. We first show that for a harmonic oscillator, the coherent state complex quantum trajectories and the complex classical trajectories are identical to each other. This congruence in the complex plane, not restricted to high quantum numbers alone, illustrates that the harmonic oscillator in a coherent state executes classical motion. The quantum trajectories we consider are those conceived in a modified de Broglie-Bohm scheme. Though quantum trajectory representations are widely discussed in recent years, identical classical and quantum trajectories for coherent states are obtained only in the present approach. We may note that this result for standard harmonic oscillator coherent states is not totally unexpected because of their holomorphic nature. The study is extended to coherent states of a particle in an infinite potential well and that in a symmetric Poschl-Teller potential by solving for the trajectories numerically. For the Gazeau-Klauder coherent state of the infinite potential well, almost identical classical and quantum trajectories are obtained whereas for the Poschl-Teller potential, though classical trajectories are not regained, a periodic motion results as t→∞. Similar features were found for the SUSY quantum mechanics-based coherent states of the Poschl-Teller potential too, but this time the pattern of complex trajectories is quite different from that of the previous case. Thus we find that the method is a potential tool in analyzing the properties of generalized coherent states.     

Analysis of the T-point-Hopf bifurcation

In a parameterized three-dimensional system of autonomous differential equations, a T-point is a point of the parameter space where a special kind of codimension-2 heteroclinic cycle occurs. If the parameter space is three-dimensional, such a bifurcation is located generically on a curve. A more degenerate scenario appears when this curve reaches a surface of Hopf bifurcations of one of the equilibria involved in the heteroclinic cycle. We are interested in the analysis of this codimension-3 bifurcation, which we call T-point-Hopf. In this work we propose a model, based on the construction of a Poincaré map, that describes the global behavior close to a T-point-Hopf bifurcation. The existence of certain kinds of homoclinic and heteroclinic connections between equilibria and/or periodic orbits is proved. The predictions deduced from this model strongly agree with the numerical results obtained in a modified van der Pol-Duffing electronic oscillator.     

How complex a dynamical network can be?

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen; (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes.     

Generalized projective synchronization of two coupled complex networks of different sizes

We investigate a new generalized projective synchronization between two complex dynamical networks of different sizes. To the best of our knowledge, most of the current studies on projective synchronization have dealt with coupled networks of the same size. By generalized projective synchronization, we mean that the states of the nodes in each network can realize complete synchronization, and the states of a pair of nodes from both networks can achieve projective synchronization. Using the stability theory of the dynamical system, several sufficient conditions for guaranteeing the existence of the generalized projective synchronization under feedback control and adaptive control are obtained. As an example, we use Chua's circuits to demonstrate the effectiveness of our proposed approach.     

A local-world heterogeneous model of wireless sensor networks with node and link diversity

In this paper, we present a novel local-world model of wireless sensor networks (WSN) with two kinds of nodes: sensor nodes and sink nodes, which is different from other models with identical nodes and links. The model balances energy consumption by limiting the connectivity of sink nodes to prolong the life of the network. How the proportion of sink nodes, different energy distribution and the local-world scale would affect the topological structure and network performance are investigated. We find that, using mean-field theory, the degree distribution is obtained as an integral with respect to the proportion of sink nodes and energy distribution. We also show that, the model exhibits a mixed connectivity correlation which is greatly distinct from general networks. Moreover, from the perspective of the efficiency and the average hops for data processing, we find some suitable range of the proportion p of sink nodes would make the network model have optimal performance for data processing.