Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 410

The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.

Nonlinear dynamics of networks: the groupoid formalism

Open access
Golubitsky, Martin, Stewart, Ian·2006·Bulletin of the American Mathematical Society

Abstract

A formal theory of symmetries of networks of coupled dynamical systems, stated in terms of the group of permutations of the nodes that preserve the network topology, has existed for some time. Global network symmetries impose strong constraints on the corresponding dynamical systems, which affect equilibria, periodic states, heteroclinic cycles, and even chaotic states. In particular, the symmetries of the network can lead to synchrony, phase relations, resonances, and synchronous or cycling chaos. Symmetry is a rather restrictive assumption, and a general theory of networks should be more flexible. A recent generalization of the group-theoretic notion of symmetry replaces global symmetries by bijections between certain subsets of the directed edges of the network, the ‘input sets’. Now the symmetry group becomes a groupoid, which is an algebraic structure that resembles a group, except that the product of two elements may not be defined. The groupoid formalism makes it possible to extend group-theoretic methods to more general networks, and in particular it leads to a complete classification of ‘robust’ patterns of synchrony in terms of the combinatorial structure of the network. Many phenomena that would be nongeneric in an arbitrary dynamical system can become generic when constrained by a particular network topology. A network of dynamical systems is not just a dynamical system with a high-dimensional phase space. It is also equipped with a canonical set of observables—the states of the individual nodes of the network. Moreover, the form of the underlying ODE is constrained by the network topology—which variables occur in which component equations, and how those equations relate to each other. The result is a rich and new range of phenomena, only a few of which are yet properly understood.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1090/s0273-0979-06-01108-6

Cites

54 of 54 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 54 references

Cited by

See all 410

Metadata

Authors
Golubitsky, M., & Stewart, I.
Venue
Bulletin of the American Mathematical Society
Published
2006-05-03
Volume
43
Issue
03
Pages
305-365
ISSN
  • 0002-9904 (ISSN-L)
  • 0273-0979
OpenAlex
W2064608742
Cited by
410
References
54
FWCI
24.78
Type
journal article
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Nonlinear dynamics of networks: the groupoid formalism. https://app.cochat.ai/papers/10.1090/s0273-0979-06-01108-6
The paper
Golubitsky, M., & Stewart, I. (2006). Nonlinear dynamics of networks: the groupoid formalism. Bulletin of the American Mathematical Society. https://doi.org/10.1090/s0273-0979-06-01108-6

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.