pith. sign in

arxiv: 2510.08187 · v2 · pith:2LGB6YPQnew · submitted 2025-10-09 · 🧮 math.DS

Generic balanced synchrony patterns in network dynamics

Romain Joly , Maxime Percie du Sert This is my paper

Pith reviewed 2026-05-18 08:32 UTC · model grok-4.3

classification 🧮 math.DS
keywords coupled cell networkssynchrony patternsbalanced equivalence relationsgeneric vector fieldsnetwork dynamicsrigid synchrony conjectureoscillation conjecture
0
0 comments X

The pith

For a generic vector field on a coupled cell network, every synchrony pattern is balanced.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that when the equations governing a network of interacting cells are chosen generically, any synchronization that appears among the cells must arise directly from the network's directed graph and the labels on its cells and arrows. This rules out synchrony that would occur by accident rather than by the structural constraints. A reader interested in models of neural circuits or ecosystems would see this as confirmation that observed patterns of locking or clustering are forced by connectivity, not by special choices of the interaction strengths.

Core claim

For a generic admissible vector field f, the synchrony patterns of solutions to the ODE are always balanced equivalence relations on the cells. These relations are inherited from the cell types and arrow types of the network and cannot be broken by the dynamics except in ways already allowed by the graph geometry.

What carries the argument

Genericity of the vector field in the open dense subset of admissible vector fields; it forces the only invariant synchrony patterns to be the balanced ones defined by the network.

Load-bearing premise

The equations must be generic within the class allowed by the network's cell and arrow types.

What would settle it

Exhibit one concrete network together with one vector field from the open dense generic set whose solutions display a synchrony pattern that fails to be a balanced equivalence relation.

Figures

Figures reproduced from arXiv: 2510.08187 by Maxime Percie du Sert, Romain Joly.

Figure 1
Figure 1. Figure 1: The graph G above has 4 cells linked with 8 arrows. There are two types of cells: the cells 1 and 3 (the left/green/squared ones) and the cells 2 and 4 (the right/red/round ones). There are two types of arrows: the ones from left to right (the blue/solid ones) and the ones from right to left (the magenta/dashed ones). Notice that we include circling arrows inside the cells to remember that the evolution of… view at source ↗
Figure 2
Figure 2. Figure 2: Several examples of dynamics inside the network of [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: An example of network with types. The graph G has 10 cells, divided in 3 types, and 17 arrows divided in 5 types. The types are coded by shapes and colors. The small circling arrows inside each cell is a reminder that an internal arrow ci → ci is implicitly present, having its own type, see Definition 2.7 below. 7 [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: A simple illustration of Henry’s Theorem. For each λ ∈ Λ, the function Φ(·, λ) maps a two-dimensional manifold M into a two-dimensional submanifold of N = R 3 . The kernel of DxΦ(x, λ) is {0} and its index is −1 because its image is of codimension 1. Even if Φ(M, λ) may contain a given point y∗ ∈ R 3 for some specific λ, if the image of DΦ contains a direction Z not included in the tangent space Ty∗Φ(M, λ)… view at source ↗
Figure 5
Figure 5. Figure 5: To construct a suitable perturbation, we focus on a ball B where t 7→ (xc(t), xT (t)) is a bijective curve. Then a function ϕ is generated by the combination of bump functions ϕn with disjoint supports. The choice of the amplitudes zn of the bumps provides an infinite-dimensional freedom. Moreover, the resulting function ϕ = Pznϕ reaches its maximum along the curve t 7→ (xc(t), xT (t)). ✄ Trick 3: Avoiding… view at source ↗
Figure 6
Figure 6. Figure 6: An simplified illustration of Lemma 4.1 for a curve t 7→ (x(t), y(t)) (plain line) and its symmetry by the permutation β ∗ (x, y) = (y, x) (dashed line). In the situation on the left, the curve satisfies the symmetry only at exceptional times and we can find a ball B satisfying the second point of (ii) of Lemma 4.1. Notice that B may contain points of the curve t 7→ β ∗ (x(t), y(t)), but not in the interva… view at source ↗
read the original abstract

A coupled cell network is a type of ordinary differential equation $\dot x(t)=f(x(t))$, with structural constraints on the vector field $f$, encoded in a directed graph, whose cells and arrows are labeled by type. The generated dynamics can model, for example, those of neural networks or ecological systems. These systems and the synchrony patterns observed in their solutions have been intensely studied, particularly by Golubitsky, Stewart, and their coauthors. In the present article, we show that, for a generic vector field $f$, the synchrony patterns of the solutions of $\dot x(t)=f(x(t))$ are always balanced. This roughly means that for almost all $f$, the observed synchrony patterns, such as synchronization in two different cells, are inherited from the structural symmetries imposed by the graph and the cell types. Any other synchronization, not directly imposed by the geometry of the graph and the cell types, cannot occur. By doing so, we are completing the proof of several conjectures, including the rigid synchrony conjecture, the full oscillation conjecture and the observation of constant states. This article is the published version of the results stated by the second author in his PhD thesis.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript proves that for a generic admissible vector field f on a coupled cell network (defined by a directed graph with cell and arrow types), the synchrony patterns realized by solutions of the ODE ẋ = f(x) are always balanced. This means observed synchronies must be inherited from the network structure and symmetries; non-balanced patterns are non-generic. The result completes the rigid synchrony conjecture, the full oscillation conjecture, and the constant-state observation in the Golubitsky–Stewart framework.

Significance. If the central claim holds, the work supplies the missing transversality and density arguments that close several long-standing conjectures in network dynamics. It confirms that the admissible vector field space is partitioned such that non-balanced synchrony lies in a lower-dimensional subset, providing a rigorous generic foundation for the theory with direct implications for modeling synchronization in neural and ecological networks.

major comments (1)
  1. §3.2, Theorem 3.4: the reduction to the balanced subspace via the implicit-function theorem along orbits is stated, but the verification that the algebraic condition for non-balanced synchrony is indeed nontrivial (i.e., defines a proper subvariety) is only sketched for the constant and periodic cases; an explicit codimension calculation for the general orbit would strengthen the density claim.
minor comments (2)
  1. The notation for cell and arrow types in §2.1 is introduced without a small illustrative network diagram; adding one would clarify the distinction between balanced and unbalanced patterns for readers new to the framework.
  2. Reference list omits the original 2006 Golubitsky–Stewart paper on coupled cell networks; including it would improve historical context.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their positive evaluation of the manuscript and for the constructive suggestion regarding the density argument. We address the major comment below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: §3.2, Theorem 3.4: the reduction to the balanced subspace via the implicit-function theorem along orbits is stated, but the verification that the algebraic condition for non-balanced synchrony is indeed nontrivial (i.e., defines a proper subvariety) is only sketched for the constant and periodic cases; an explicit codimension calculation for the general orbit would strengthen the density claim.

    Authors: We agree that an explicit codimension calculation for general orbits would strengthen the density claim. In the revised manuscript we will add a detailed computation in §3.2, extending the existing sketches for constant and periodic solutions. The argument proceeds by considering the jet-space formulation of the synchrony condition and verifying that the non-balanced equations impose at least one independent algebraic constraint of positive codimension on the space of admissible vector fields, using the same transversality setup already employed for the reduction via the implicit-function theorem. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper proves that for generic admissible vector fields on a coupled cell network, all realized synchrony patterns are balanced by demonstrating that any non-balanced pattern imposes a nontrivial algebraic condition on the vector field, thereby defining a lower-dimensional subset of the admissible space. This is a direct application of transversality and the implicit-function theorem within the established Golubitsky-Stewart framework, completing the rigid synchrony, full oscillation, and constant-state conjectures. The manuscript supplies the missing density argument without introducing self-referential definitions, fitted parameters renamed as predictions, or load-bearing self-citations whose content is unverified; the reference to the second author's PhD thesis is merely provenance for the published version of the same independent proof.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard concepts from dynamical systems theory and the definition of coupled cell networks; no new free parameters, invented entities, or ad-hoc axioms are introduced beyond the generic property of vector fields.

axioms (2)
  • standard math The space of admissible vector fields for a coupled cell network admits a topology in which 'generic' means belonging to an open and dense subset.
    Directly invoked in the statement that synchrony patterns are balanced 'for a generic vector field f'.
  • domain assumption Coupled cell networks are defined by a directed graph with typed cells and arrows that constrain the form of the vector field f.
    This is the structural setup inherited from the Golubitsky-Stewart framework referenced in the abstract.

pith-pipeline@v0.9.0 · 5742 in / 1412 out tokens · 40741 ms · 2026-05-18T08:32:04.370172+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

33 extracted references · 33 canonical work pages

  1. [1]

    Abraham and J

    R. Abraham and J. Robbin,Transversal mappings and flows, Benjamin, New York, 1987

    work page 1987

  2. [2]

    Ashwin, S

    P. Ashwin, S. Coombes and R. Nicks,Mathematical frameworks for oscillatory network dynamics in neuroscience, Journal of Mathematical Neuroscience n o6 (2016), paper n o2

    work page 2016

  3. [3]

    Bonic,Linear functional analysis

    R.A. Bonic,Linear functional analysis. Notes on Mathematics and its Applica- tions Gordon and Breach Science Publishers, New York-London-Paris, 1969

    work page 1969

  4. [4]

    Christensen,On sets of Haar measure zero in Abelian Polish groups, Israel Journal of Mathematics n o13 (1972), pp

    J.P.R. Christensen,On sets of Haar measure zero in Abelian Polish groups, Israel Journal of Mathematics n o13 (1972), pp. 255-260

    work page 1972

  5. [5]

    Feinberg,The existence and uniqueness of steady states for a class of chem- ical reaction networks, Archive for Rational Mechanics and Analysis n o132 (1995), pp

    M. Feinberg,The existence and uniqueness of steady states for a class of chem- ical reaction networks, Archive for Rational Mechanics and Analysis n o132 (1995), pp. 311–370. 33

    work page 1995

  6. [6]

    Golubitsky, M

    M. Golubitsky, M. Nicol and I. Stewart,Some curious phenomena in coupled cell networks, Journal of Nonlinear Science n o14 (2004), pp. 207-236

    work page 2004

  7. [7]

    Golubitsky, D

    M. Golubitsky, D. Romano and Y. Wang,Network periodic solutions: full os- cillation and rigid synchrony, Nonlinearity n o23 (2010), pp. 3227–3243

    work page 2010

  8. [8]

    Golubitsky, D

    M. Golubitsky, D. Romano and Y. Wang,Network periodic solutions: patterns of phase-shift synchrony, Nonlinearity n o25 (2012), pp. 1045–1074

    work page 2012

  9. [9]

    Golubitsky and I

    M. Golubitsky and I. Stewart,Nonlinear dynamics of networks: the groupoid formalism, Bulletin of the American Mathematical Society. New Series n o43 (2006), pp. 305–364

    work page 2006

  10. [10]

    Golubitsky and I

    M. Golubitsky and I. Stewart,Rigid patterns of synchrony for equilibria and periodic cycles in network dynamics, Chaos n o26 (2016), 094803

    work page 2016

  11. [11]

    Golubitsky, I

    M. Golubitsky, I. Stewart and A. T¨ or¨ ok,Patterns of synchrony in coupled cell networks with multiple arrows, SIAM Journal on Applied Dynamical Systems no4 (2005), pp.78–100

    work page 2005

  12. [12]

    Henry,Perturbation of the boundary in boundary-value problems of partial differential equations

    D. Henry,Perturbation of the boundary in boundary-value problems of partial differential equations. With editorial assistance from Jack Hale and Antˆ onio Luiz Pereira. London Mathematical Society Lecture Note Series n o318. Cam- bridge University Press, Cambridge, 2005

    work page 2005

  13. [13]

    almost every

    B. Hunt, T. Sauer and J. Yorke,Prevalence: a translation invariant “almost every” on infinite dimensional spaces, Bulletin of the American Mathematical Society, New Series, n o27 (1992), pp. 217-238

    work page 1992

  14. [14]

    Joly,Observation and inverse problems in coupled cell networks, Nonlinearity no25 (2012), pp

    R. Joly,Observation and inverse problems in coupled cell networks, Nonlinearity no25 (2012), pp. 657–676

    work page 2012

  15. [15]

    Joly,Adaptation of the generic PDE’s results to the notion of prevalence, Journal of Dynamics and Differential Equations n o19 (2007), pp

    R. Joly,Adaptation of the generic PDE’s results to the notion of prevalence, Journal of Dynamics and Differential Equations n o19 (2007), pp. 967-983

    work page 2007

  16. [16]

    Josi´ c and A

    K. Josi´ c and A. T¨ or¨ ok,Network architecture and spatio-temporally symmetric dynamics, Physica D n o224 (2006), pp. 52–68

    work page 2006

  17. [17]

    Kato,Perturbation theory for linear operators

    T. Kato,Perturbation theory for linear operators. Reprint of the corr. print. of the 2nd ed. 1980. Classics in Mathematics. Berlin: Springer-Verlag, 1995

    work page 1980

  18. [18]

    Ott and J.A

    W. Ott and J.A. Yorke,Prevalence, Bulletin of the American Mathematical Society, New Series, n o42 (2005), pp. 263-290

    work page 2005

  19. [19]

    Palis and W

    J. Palis and W. de Melo,Geometric theory of dynamical systems. An introduc- tion. Translated from the Portuguese by A. K. Manning. Springer-Verlag, New York-Berlin, 1982

    work page 1982

  20. [20]

    Percie du Sert,R´ esultats de g´ en´ ericit´ e pour des r´ eseaux, PhD Thesis, 2014

    M. Percie du Sert,R´ esultats de g´ en´ ericit´ e pour des r´ eseaux, PhD Thesis, 2014. https://theses.hal.science/tel-01089479 34

    work page 2014

  21. [21]

    Quinn and A

    F. Quinn and A. Sard,Hausdorff conullity of critical images of Fredholm maps, American Journal of Mathematics n o94 (1972), pp. 1101-1110

    work page 1972

  22. [22]

    Sard,The measure of the critical values of differentiable maps, Bulletin of the American Mathematical Society n o48 (1942), pp

    A. Sard,The measure of the critical values of differentiable maps, Bulletin of the American Mathematical Society n o48 (1942), pp. 883-890

    work page 1942

  23. [23]

    Saut and R

    J.C. Saut and R. Temam,Generic properties of nonlinear boundary value prob- lems, Communication in PDE n o4 (1979), pp. 293-319

    work page 1979

  24. [24]

    Schechter,Principles of functional analysis

    M. Schechter,Principles of functional analysis. 2nd ed. Graduate Studies in Mathematics no36. Providence, RI: American Mathematical Society, 2001

    work page 2001

  25. [25]

    Smale,An Infinite Dimensional Version of Sard’s Theorem, American Jour- nal of Mathematics n o87 (1965),p

    S. Smale,An Infinite Dimensional Version of Sard’s Theorem, American Jour- nal of Mathematics n o87 (1965),p. 861-866

    work page 1965

  26. [26]

    Stewart,Networking opportunity, Nature n o427 (2004), pp

    I. Stewart,Networking opportunity, Nature n o427 (2004), pp. 601-604

    work page 2004

  27. [27]

    Stewart,Overdetermined constraints and rigid synchrony patterns for network equilibria, Portugaliae Mathematica n o77 (2020), pp

    I. Stewart,Overdetermined constraints and rigid synchrony patterns for network equilibria, Portugaliae Mathematica n o77 (2020), pp. 163–196

    work page 2020

  28. [28]

    Stewart,Overdetermined ODEs and rigid periodic states in network dynam- ics, Portugaliae Mathematica n o79 (2022), pp

    I. Stewart,Overdetermined ODEs and rigid periodic states in network dynam- ics, Portugaliae Mathematica n o79 (2022), pp. 85–161

    work page 2022

  29. [29]

    Stewart, M

    I. Stewart, M. Golubitsky and M. Pivato,Symmetry groupoids and patterns of synchrony in coupled cell networksSIAM Journal on Applied Dynamical Systems no2 (2003), pp. 609-646

    work page 2003

  30. [30]

    Stewart and M

    I. Stewart and M. Parker,Periodic dynamics of coupled celll networks: I. Rigid patterns of synchrony and phase relations, Dynamical Systems n o22 (2007), pp. 389—450

    work page 2007

  31. [31]

    Stewart and D

    I. Stewart and D. Wood,Stable synchronous propagation of signals by feedfor- ward networksSIAM Journal on Applied Dynamical Systems n o23 (2024), pp. 167–204

    work page 2024

  32. [32]

    Thom,Les singularit´ es des applications diff´ erentiables, Annales de l’Institut Fourier no6 (1956), pp

    R. Thom,Les singularit´ es des applications diff´ erentiables, Annales de l’Institut Fourier no6 (1956), pp. 43-87

    work page 1956

  33. [33]

    Thom,Un lemme sur les applications diff´ erentiables, Bol

    R. Thom,Un lemme sur les applications diff´ erentiables, Bol. Soc. Mat. Mexi- cana no1 (1956), pp. 59-71. 35

    work page 1956