Searcharxiv⌕ Search

arXiv subjects

Eddie Nijholt

Publications and source records attributed to Eddie Nijholt.

17 recordsLinked to original sources
arXiv2026

Homogeneous coupled cell systems with high-dimensional internal dynamics

The analysis of network dynamics is oftentimes restricted to networks with one-dimensional internal dynamics. Here, we show how symmetry explains the relation between behavior of systems with one-dimensional internal dynamics and with higher dimensional internal dynamics, when the network topology is the same. Fundamental networks of homogeneous coupled cell systems (B. Rink, J. Sanders. Coupled Cell Networks and Their Hidden Symmetries. SIAM J. Math. Anal. 46.2 (2014)) can be expressed in terms of monoid representations, which uniquely decompose into indecomposable subrepresentations. In the high-dimensional internal dynamics case, these subrepresentations are isomorphic to multiple copies of those one computes in the one-dimensional case. We describe the implications of this observation on steady state and Hopf bifurcations in $l$-parameter families of network vector fields. The main results are that (1) generic one-parameter steady state bifurcations are qualitatively independent of the dimension of the internal dynamics and that, (2) in order to observe all generic $l$-parameter bifurcations that may occur for internal dynamics of any dimension, the internal dynamics has to be at least $l$-dimensional for steady state bifurcations and $2l$-dimensional for Hopf bifurcations. Furthermore, we illustrate how additional structure in the network can be exploited to obtain understanding beyond qualitative statements about the collective dynamics. One-parameter steady state bifurcations in feedforward networks exhibit an unusual amplification in the asymptotic growth rates of individual cells, when these are one-dimensional (S. von der Gracht, E. Nijholt, B. Rink. Amplified steady state bifurcations in feedforward networks. Nonlinearity 35.4 (2022)). We prove that (3) the same cells exhibit this amplifying effect with the same growth rates when the internal dynamics is high-dimensional.

math.DS↗
arXiv2024

Dimension Bounds for Systems of Equations with Graph Structure

We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain induced subgraphs. As corollaries, we obtain novel bounds in spectral graph theory on the multiplicities of graph eigenvalues, and in nonlinear dynamical system on the dimension of the equilibrium set of a network.

math.CO↗
arXiv2024

Higher order interactions lead to "reluctant" synchrony breaking

To model dynamical systems on networks with higher order (non-pairwise) interactions, we recently introduced a new class of ODEs on hypernetworks. Here we consider one-parameter synchrony breaking bifurcations in such ODEs. We call a synchrony breaking steady state branch ``reluctant'' if it is tangent to a synchrony space, but does not lie inside it. We prove that reluctant synchrony breaking is ubiquitous in hypernetwork systems, by constructing a large class of examples that support it. We also give an explicit formula for the order of tangency to the synchrony space of a reluctant steady state branch.

math.DS↗
arXiv2023

Chaotic behavior in diffusively coupled systems

We study emergent oscillatory behavior in networks of diffusively coupled nonlinear ordinary differential equations. Starting from a situation where each isolated node possesses a globally attracting equilibrium point, we give, for an arbitrary network configuration, general conditions for the existence of the diffusive coupling of a homogeneous strength which makes the network dynamics chaotic. The method is based on the theory of local bifurcations we develop for diffusively coupled networks. We, in particular, introduce the class of the so-called versatile network configurations and prove that the Taylor coefficients of the reduction to the center manifold for any versatile network can take any given value.

math.DS↗
arXiv2023

Hypernetworks: cluster synchronisation is a higher-order effect

Many networked systems are governed by non-pairwise interactions between nodes. The resulting higher-order interaction structure can then be encoded by means of a hypernetwork. In this paper we consider dynamical systems on hypernetworks by defining a class of admissible maps for every such hypernetwork. We explain how to classify robust cluster synchronisation patterns on hypernetworks by finding balanced partitions, and we generalize the concept of a graph fibration to the hypernetwork context. We also show that robust synchronisation patterns are only fully determined by polynomial admissible maps of high order. This means that, unlike in dyadic networks, cluster synchronisation on hypernetworks is a higher-order, i.e., nonlinear effect. We give a formula, in terms of the order of the hypernetwork, for the degree of the polynomial admissible maps that determine robust synchronisation patterns. We also demonstrate that this degree is optimal by investigating a class of examples. We conclude by displaying how this effect may cause remarkable synchrony breaking bifurcations that occur at high polynomial degree.

math.DS↗
arXiv2023

A parametrisation method for high-order phase reduction in coupled oscillator networks

We present a novel method for high-order phase reduction in networks of weakly coupled oscillators and, more generally, perturbations of reducible normally hyperbolic (quasi-)periodic tori. Our method works by computing an asymptotic expansion for an embedding of the perturbed invariant torus, as well as for the reduced phase dynamics in local coordinates. Both can be determined to arbitrary degrees of accuracy, and we show that the phase dynamics may directly be obtained in normal form. We apply the method to predict remote synchronisation in a chain of coupled Stuart-Landau oscillators.

math.DS↗
arXiv2023

Invariant Synchrony and Anti-Synchrony Subspaces of Weighted Networks

The internal state of a cell in a coupled cell network is often described by an element of a vector space. Synchrony or anti-synchrony occurs when some of the cells are in the same or the opposite state. Subspaces of the state space containing cells in synchrony or anti-synchrony are called polydiagonal subspaces. We study the properties of several types of polydiagonal subspaces of weighted coupled cell networks. In particular, we count the number of such subspaces and study when they are dynamically invariant. Of special interest are the evenly tagged anti-synchrony subspaces in which the number of cells in a certain state is equal to the number of cells in the opposite state. Our main theorem shows that the dynamically invariant polydiagonal subspaces determined by certain types of couplings are either synchrony subspaces or evenly tagged anti-synchrony subspaces. A special case of this result confirms a conjecture about difference-coupled graph network systems.

math.DS↗
arXiv2022

Emergent hypernetworks in weakly coupled oscillators

Networks of weakly coupled oscillators had a profound impact on our understanding of complex systems. Studies on model reconstruction from data have shown prevalent contributions from hypernetworks with triplet and higher interactions among oscillators, in spite that such models were originally defined as oscillator networks with pairwise interactions. Here, we show that hypernetworks can spontaneously emerge even in the presence of pairwise albeit nonlinear coupling given certain triplet frequency resonance conditions. The results are demonstrated in experiments with electrochemical oscillators and in simulations with integrate-and-fire neurons. By developing a comprehensive theory, we uncover the mechanism for emergent hypernetworks by identifying appearing and forbidden frequency resonant conditions. Furthermore, it is shown that microscopic linear (difference) coupling among units results in coupled mean fields, which have sufficient nonlinearity to facilitate hypernetworks. Our findings shed light on the apparent abundance of hypernetworks and provide a constructive way to predict and engineer their emergence.

math.DS↗
arXiv2022

Amplified steady state bifurcations in feedforward networks

We investigate bifurcations in feedforward coupled cell networks. Feedforward structure (the absence of feedback) can be defined by a partial order on the cells. We use this property to study generic one-parameter steady state bifurcations for such networks. Branching solutions and their asymptotics are described in terms of Taylor coefficients of the internal dynamics. They can be determined via an algorithm that only exploits the network structure. Similar to previous results on feedforward chains, we observe amplifications of the growth rates of steady state branches induced by the feedforward structure. However, contrary to these earlier results, as the interaction scenarios can be more complicated in general feedforward networks, different branching patterns and different amplifications can occur for different regions in the space of Taylor coefficients.

math.DS↗
arXiv2020

Quiver representations and dimension reduction in dynamical systems

Dynamical systems often admit geometric properties that must be taken into account when studying their behaviour. We show that many such properties can be encoded by means of quiver representations. These properties include classical symmetry, hidden symmetry and feedforward structure, as well as subnetwork and quotient relations in network dynamical systems. A quiver equivariant dynamical system consists of a collection of dynamical systems with maps between them that send solutions to solutions. We prove that such quiver structures are preserved under Lyapunov-Schmidt reduction, center manifold reduction, and normal form reduction.

math.DS↗
arXiv2019

Circulant Type Formulas for the Eigenvalues of Linear Network Maps

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 maps for homogeneous networks. In particular, we define so-called network multipliers. These are (relatively small) matrices that depend linearly on the coefficients of the response function, and whose eigenvalues together make up the spectrum of the corresponding admissible map. More precisely, given a network N, we define a finite set of network multipliers L1 to Lk and a class of networks C containing N. This class is furthermore closed under taking quotient networks, subnetworks and disjoint unions. We then show that the eigenvalues of an admissible map for any network in C are given by those of (a subset of) the network multipliers, with fixed multiplicities m1 to mk and independently of the given (finite dimensional) phase space of a node. The coefficients of all the network multipliers of C are furthermore linearly independent, which implies that one may find the multiplicities m1 to mk by simply expressing the trace of an admissible map as a linear combination of the traces of the multipliers. In particular, we will give examples of networks where the network multipliers need not be constructed, but can be determined by looking at small networks in C. We also show that network multipliers are multiplicative with respect to composition of linear maps.

math.DS↗
arXiv2019

A new algorithm for computing idempotents of R-trivial monoids

The authors of [Primitive orthogonal idempotents for R-trivial monoids, Journal of Algebra] provide an algorithm for finding a complete system of primitive orthogonal idempotents for CM, where M is any finite R-trivial monoid. Their method relies on a technical result stating that R-trivial monoids are equivalent to so-called weakly ordered monoids. We provide an alternative algorithm, based only on the simple observation that an R-trivial monoid may be realised by upper triangular matrices. This approach is inspired by results in the field of coupled cell network dynamical systems, where L-trivial monoids (the opposite notion) correspond to so-called feed-forward networks. We also show that our algorithm only has to be performed for ZM, after which a complete system of primitive orthogonal idempotents may be obtained for RM, where R is any ring with a known complete system of primitive orthogonal idempotents. In particular, the algorithm works if R is any field.

math.RT↗
arXiv2017

Transversality in Dynamical Systems with Generalized Symmetry

We prove that a generic $k$-parameter bifurcation of a dynamical system with a monoid symmetry occurs along a generalized kernel or center subspace of a particular type. More precisely, any (complementable) subrepresentation $U$ is given a number $K_U$ and a number $C_U$. A $k$-parameter bifurcation can generically only occur along a generalized kernel isomorphic to $U$ if $k \geq K_U$. It can generically only occur along a center subspace isomorphic to $U$ if $k \geq C_U$. The numbers $K_U$ and $C_U$ depend only on the decomposition of $U$ into indecomposable subrepresentations. In particular, we prove that a generic one-parameter steady-state bifurcation occurs along one absolutely indecomposable subrepresentation. Likewise, it follows that a generic one-parameter Hopf bifurcation occurs along one indecomposable subrepresentation of complex or quaternionic type, or along two isomorphic absolutely indecomposable subrepresentations. In order to prove these results, we show that the set of endomorphisms with generalized kernel (or center subspace) isomorphic to $U$ is the disjoint union of a finite set of conjugacy invariant submanifolds of codimension $K_U$ and higher (or $C_U$ and higher). The results in this article hold for any monoid, including non-compact groups.

math.DS↗
arXiv2016

Projection blocks in homogeneous coupled cell networks

We introduce a special subset of the graph of a homogeneous coupled cell network, called a projection block, and show that the network obtained from identifying this block to a single point can be used to understand the generic bifurcations of the original network. This technique is then used to describe the bifurcations in a generalized feed-forward network, in which the loop can contain more than one cell.

math.DS↗
arXiv2016

Center manifolds of coupled cell networks

Dynamical systems with a network structure can display anomalous bifurcations as a generic phenomenon. As an explanation for this it has been noted that homogeneous networks can be realized as quotient networks of so-called fundamental networks. The class of admissible vector fields for these fundamental networks is equal to the class of equivariant vector fields of the regular representation of a monoid. Using this insight, we set up a framework for center manifold reduction in fundamental networks and their quotients. We then use this machinery to explain the difference in generic bifurcations between three example networks with identical spectral properties and identical robust synchrony spaces.

math.DS↗
arXiv2014

Graph fibrations and symmetries of network dynamics

Dynamical systems with a network structure can display collective behaviour such as synchronisation. Golubitsky and Stewart observed that all the robustly synchronous dynamics of a network is contained in the dynamics of its quotient networks. DeVille and Lerman have recently shown that the original network and its quotients are related by graph fibrations and hence their dynamics are conjugate. This paper demonstrates the importance of self-fibrations of network graphs. Self-fibrations give rise to symmetries in the dynamics of a network. We show that every homogeneous network admits a lift with self-fibrations and that every robust synchrony in this lift is determined by the symmetries of its dynamics. These symmetries moreover impact the global dynamics of network systems and can be used to explain and predict generic scenarios for synchrony breaking. We also discuss networks with interior symmetries and nonhomogeneous networks.

math.DS↗