相关论文: Finite switching near heteroclinic networks

We study the structural characteristics of complex networks using the representative eigenvectors of the adjacent matrix. The probability distribution function of the components of the representative eigenvectors are proposed to describe…

Autonomous sustained oscillations are ubiquitous in living and nonliving systems. As open systems, far from thermodynamic equilibrium, they defy entropic laws which mandate convergence to stationarity. We present structural conditions on…

Chemical reaction networks taken with mass-action kinetics are dynamical systems that arise in chemical engineering and systems biology. In general, determining whether a chemical reaction network admits multiple steady states is difficult,…

The Contact Process has been studied on complex networks exhibiting different kinds of quenched disorder. Numerical evidence is found for Griffiths phases and other rare region effects, in Erd\H os R\'enyi networks, leading rather…

The R\"ossler System is one of the best known chaotic dynamical systems, exhibiting a plethora of complex phenomena - and yet, only a few studies tackled its complexity analytically. In this paper we find sufficient conditions for the…

Many-body systems when continuous phase transition occurs are mainly built in the interrelationship between particles, implemented through many-body correlations. Some of them may exhibit so-called topological order hardly measured by…

We investigate stability of a new class of heteroclinic cycles that we call heteroclinic cycles of type Y. The cycles can be regarded as a generalisation of heteroclinic cycles of type Z introduced in [Podvigina, Nonlinearity 25, 2012]. The…

Kuramoto Networks contain non-hyperbolic equilibria whose stability is sometimes difficult to determine. We consider the extreme case in which all Jacobian eigenvalues are zero. In this case linearizing the system at the equilibrium leads…

Based on a rigorous extension of classical statistical mechanics to networks, we study a specific microscopic network Hamiltonian. The form of this Hamiltonian is derived from the assumption that individual nodes increase/decrease their…

We consider critical phenomena on heterogeneous small-world networks having a scale-free character but also arbitrary short-loops. After deriving the self-consistent equation for the order parameter and the critical surface, we prove that…

The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…

We provide a Jacobian criterion that applies to arbitrary chemical reaction networks taken with mass-action kinetics to preclude the existence of multiple positive steady states within any stoichiometric class for any choice of rate…

The decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying a given Boolean formula $C$, are well-known {\it NP}-complete problems. Here we…

In this paper, we study the complicated dynamics of infinite dimensional random dynamical systems which include deterministic dynamical systems as their special cases in a Polish space. Without assuming any hyperbolicity, we proved if a…

We study billiards in domains enclosed by circular polygons. These are closed $C^1$ strictly convex curves formed by finitely many circular arcs. We prove the existence of a set in phase space, corresponding to generic sliding trajectories…

Many complex networks demonstrate a phenomenon of striking degree correlations, i.e., a node tends to link to other nodes with similar (or dissimilar) degrees. From the perspective of degree correlations, this paper attempts to characterize…

Given an admissible map F for a homogeneous network N, it is known that the Jacobian DF(x) around a fully synchronous point x = (x0, ..., x0) is again an admissible map for N. Motivated by this, we study the spectra of linear admissible…

Chaotic attractors, chaotic saddles and periodic orbits are examples of chain-recurrent sets. Using arbitrary small controls, a trajectory starting from any point in a chain-recurrent set can be steered to any other in that set. The…

Many natural, complex systems are remarkably stable thanks to an absence of feedback acting on their elements. When described as networks, these exhibit few or no cycles, and associated matrices have small leading eigenvalues. It has been…

Robust heteroclinic networks are invariant sets that can appear as attractors in symmetrically coupled or otherwise constrained dynamical systems. These networks may have a very complicated structure that is poorly understood and determined…