Related papers: Almost complete and equable heteroclinic networks
Biological transport networks are highly optimized structures that ensure power-efficient distribution of fluids across various domains, including animal vasculature and plant venation. Theoretically, these networks can be described as…
Let K denote a compact invariant set for a strongly monotone semiflow in an ordered Banach space E, satisfying standard smoothness and compactness assumptions. Suppose the semiflow restricted to K is chain transitive. The main result is…
Heterogeneous graph convolutional networks have gained great popularity in tackling various network analytical tasks on heterogeneous network data, ranging from link prediction to node classification. However, most existing works ignore the…
In this paper, a necessary and sufficient condition for the controllability of networked systems with heterogeneous dynamics is established where the nodes are higher dimensional linear time invariant systems and the network topology is…
The interaction of distinct units in physical, social, biological and technological systems naturally gives rise to complex network structures. Networks have constantly been in the focus of research for the last decade, with considerable…
Experimental observations of an almost symmetric electronic circuit show complicated sequences of bifurcations. These results are discussed in the light of a theory of imperfect global bifurcations. It is shown that much of the dynamics…
Signed networks have been a topic of recent interest in the network control community as they allow studying antagonistic interactions in multi-agent systems. Although dynamical characteristics of signed networks have been well-studied,…
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong…
We consider a (mathbb{Z}_2)-equivariant flow in (mathbb{R}^{4}) with an integral of motion and a hyperbolic equilibrium with a transverse homoclinic orbit (Gamma). We provide criteria for the existence of stable and unstable invariant…
We describe a simple adaptive network of coupled chaotic maps. The network reaches a stationary state (frozen topology) for all values of the coupling parameter, although the dynamics of the maps at the nodes of the network can be…
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical…
Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movement patterns are generated by a subset of automorphisms of the…
Exploiting symmetries and invariance in data is a powerful, yet not fully exploited, way to achieve better generalisation with more efficiency. In this paper, we introduce two graph network architectures that are equivariant to several…
Transport networks are crucial to the functioning of natural systems and technological infrastructures. For flow networks in many scenarios, such as rivers or blood vessels, acyclic networks (i.e., trees) are optimal structures when…
We study nonlinear dynamics on complex networks. Each vertex $i$ has a state $x_i$ which evolves according to a networked dynamics to a steady-state $x_i^*$. We develop fundamental tools to learn the true steady-state of a small part of the…
For piecewise-linear maps, the phenomenon that a branch of a one-dimensional unstable manifold of a periodic solution is completely contained in its stable manifold is codimension-two. Unlike codimension-one homoclinic corners, such…
We show that any neighborhood of a non-degenerate reversible bifocal homoclinic orbit contains chaotic suspended invariant sets on $N$-symbols for all $N\geq 2$. This will be achieved by showing switching associated with networks of…
We study network design problems for nonlinear and nonconvex flow models without controllable elements under load scenario uncertainties, i.e., under uncertain injections and withdrawals. To this end, we apply the concept of adjustable…
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…
We consider a non-autonomous dynamical system formed by coupling two piecewise-smooth systems in $\RR^2$ through a non-autonomous periodic perturbation. We study the dynamics around one of the heteroclinic orbits of one of the…