Related papers: Attractor separation and signed cycles in asynchro…
We prove that an inseparable graph can have any positive number of cycles with the six exceptions 2, 4, 5, 8, 9, 16, and that an inseparable cubic graph has the additional exceptions 1 and 13. The exceptions for simple inseparable cubic…
We provide conditions on the coupling function such that a system of 4 globally coupled identical oscillators has chaotic attractors, a pair of Lorenz attractors or a 4-winged analogue of the Lorenz attractor. The attractors emerge near the…
The dynamics of an agreement protocol interacting with a disagreement process over a common random network is considered. The model can represent the spreading of true and false information over a communication network, the propagation of…
We discuss properties which must be satisfied by a genetic network in order for it to allow differentiation. These conditions are expressed as follows in mathematical terms. Let $F$ be a differentiable mapping from a finite dimensional real…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
We study behaviour of trajectories near a type Z heteroclinic network which is a union of two cycles. Analytical and numerical studies indicate that attractiveness of this network can be associated with various kinds of dynamics in its…
For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorized according to the given graph. Both criteria are based on special types…
A coupling of random walkers on the same finite graph, who take turns sequentially, is said to be an avoidance coupling if the walkers never collide. Previous studies of these processes have focused almost exclusively on complete graphs, in…
Attractor-repeller decompositions of isolated invariant sets give rise to so-called connecting homomorphisms. These homomorphisms reveal information on the existence and structure of connecting trajectories of the underlying dynamical…
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously…
The attractors of a dynamical system govern its typical long-term behaviour. The presence of many attractors is significant as it means the behaviour is heavily dependent on the initial conditions. To understand how large numbers of…
In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the…
A Boolean network is a mapping $f :\{0,1\}^n \to \{0,1\}^n$, which can be used to model networks of $n$ interacting entities, each having a local Boolean state that evolves over time according to a deterministic function of the current…
This paper presents a new chaotic system having four attractors, including two fixed point attractors and two symmetrical chaotic strange attractors. Dynamical properties of the system, viz. sensitive dependence on initial conditions,…
We examine the problem of gathering $k \geq 2$ agents (or multi-agent rendezvous) in dynamic graphs which may change in every synchronous round but remain always connected ($1$-interval connectivity) [KLO10]. The agents are identical and…
By their nature it is difficult to differentiate chaotic dynamical systems through measurement. In recent years, work has begun on using methods of Topological Data Analysis (TDA) to qualitatively type dynamical data by approximating the…
The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semi-annealed approximation to study the stability properties of Random Boolean Networks…
The deterministic dynamics of randomly connected neural networks are studied, where a state of binary neurons evolves according to a discreet-time synchronous update rule. We give a theoretical support that the overlap of systems' states…
We treat $n$-dimensional piecewise-linear continuous maps with two pieces, each of which has exactly one unstable direction, and identify an explicit set of sufficient conditions for the existence of a chaotic attractor. The conditions…
In a previous paper we considered a sequence of maps on a complete metric space $(X,d)$ and derived an extension of the Banach fixed point theorem. We showed that backward trajectories of maps $X\to X$ converge under mild conditions and…