Pith. sign in

REVIEW 2 major objections 6 minor 41 references

Structural Visibility in Dynamical Systems on Hypergraphs: A Pattern Formation Perspective

T0 review · 2 major / 6 minor · reviewed 2026-07-12 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Linearization of reaction-diffusion systems on hypergraphs sees only first-moment exposure; higher-order co-occurrence reappears only as packing effects that shape nonlinear saturation.

desk verdict Clean, usable theory of which hypergraph statistics survive linearization vs. nonlinear saturation; modeling restriction is explicit and the math holds. read the letter →

arxiv 2607.00256 v3 pith:IJ6RKVYA submitted 2026-06-30 math.DS

Moise R. Mouyebe , Anthony M. Bloch This is my paper · ORCID
classification math.DS MSC 37G1037N2505C6535B3634C23
keywords structuralvisibilitydirectedhypergraphsdynamicalgraphsurrogacyreaction-diffusionsystemsondiffusion-inducedinstabilitypackingeffectsexposureequivalencepatternformation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Hypergraphs can encode rich multiway interactions, but this paper argues that dynamics do not automatically make all of that structure visible. Near a pattern-forming instability, the linearized operator depends on the hypergraph only through first-tail-moment statistics called exposure, so any two hypergraphs that share those statistics have identical dispersion relations and the same onset threshold. Beyond onset, a weakly nonlinear amplitude equation recovers only certain higher-order marginals of the adjacency tensor, contracted against the critical left and right eigenvectors and called packing effects. Exposure therefore governs linear onset, while packing effects control branch selection, saturated amplitude, and pattern morphology. The same decomposition also says when a genuine higher-order system can be replaced, near onset, by a pairwise graph surrogate: precisely when the packing effects vanish.

What carries the argument

The nonlinear structural decomposition theorem: amplitude coefficients factor as β = β_exp + β_pack and γ = γ_exp + γ_pack, where packing effects are the contractions of higher tail-moment tensors with the critical eigenvectors that alone enter the reduced dynamics.

What would settle it

Build two exposure-equivalent hypergraphs with deliberately different packing effects, drive them through the same codimension-one Turing onset, and check whether their saturated modal amplitudes (or branch orientations) diverge exactly as predicted by the difference in β_pack and γ_pack while their linear thresholds remain identical.

Watch

Extended reading notes

Core claim

The paper establishes a structural visibility hierarchy for reaction-diffusion systems on directed B-hypergraphs with nonlinear mean aggregation. At linear order the Jacobian depends on the hypergraph only through exposure (zeroth and first tail moments), so exposure-equivalent hypergraphs are linearly indistinguishable. At quadratic and cubic order the reduced amplitude coefficients split into exposure-driven pieces plus packing effects obtained by contracting pair- and triple-packing tensors with the critical mode; those packing effects alone determine whether linearly identical systems remain distinguishable after onset and whether a graph surrogate can reproduce the reduced dynamics.

Load-bearing premise

The coupling must be the same mean-then-activate aggregator and the same mixing matrix for every interaction order; otherwise higher moments can already appear in the linearization.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. The paper develops a theory of structural visibility for reaction-diffusion systems on directed B-hypergraphs near a codimension-one steady bifurcation. Under order-independent nonlinear mean aggregation (DeepSet-style mean followed by a fixed smooth activation σ and a shared mixing matrix M), the linearized dynamics about a homogeneous equilibrium depends on the hypergraph only through its zeroth and first tail moments (exposure). Exposure-equivalent hypergraphs therefore share identical dispersion relations, critical eigenspaces, and instability thresholds (Theorem 4.5, Corollary 4.9). Beyond onset, a weakly nonlinear center-manifold reduction yields a scalar amplitude equation whose quadratic and cubic coefficients decompose into exposure-driven and packing-driven parts (Proposition 5.4, Theorem 5.9). Packing effects are contractions of higher-order tail-moment tensors with the critical left and right eigenvectors; they control post-onset saturation, branch selection, and pattern morphology. The paper formalizes weak packing-equivalence, nonlinear distinguishability of exposure-equivalent systems, and dynamical graph surrogacy (when packing effects vanish). Small directed hypergraph numerics with Schnakenberg kinetics confirm linear indistinguishability and packing-driven divergence of saturated amplitudes.

Significance. If the results hold under the stated hypotheses, the paper supplies a precise, order-by-order account of which higher-order structural features are dynamically accessible near Turing onset. The exposure reduction explains why clique-expansion and graph surrogates often reproduce linear instability thresholds, while the packing decomposition identifies the precise obstruction to nonlinear surrogacy. The notions of weak packing-equivalence and dynamical graph surrogacy are clean and falsifiable. Strengths include explicit tensor contractions, Kronecker spectral lemmas, center-manifold derivations with proofs in the appendix, and fully specified small-system numerics (Tables 1–2, Figures 4–5, C.1) that match the predicted coefficients without fitted constants. The modeling restriction to order-independent mean aggregation is the price of the clean hierarchy, but it is declared explicitly and yields a self-contained theory that advances the structural understanding of higher-order dynamical systems.

major comments (2)
  1. Section 4.3.1 and Eq. (25): the first-tail-moment reduction (Theorem 4.5) and the subsequent packing hierarchy rest on the assumption that the aggregator is order-independent mean-plus-fixed-activation with a single mixing matrix M across all interaction orders. This is declared, but the manuscript should state more prominently (abstract/introduction and discussion) that other aggregators or order-dependent activations generically re-introduce higher moments already at linear order, so the visibility hierarchy is model-class-specific rather than universal for all multiway operators.
  2. Section 6 and Tables 1–2: the numerical validation uses only N=6 directed hypergraphs. While sufficient to illustrate the coefficients, the claim that packing effects control post-onset morphology would be stronger with at least one larger or random ensemble example showing that the same exposure/packing distinction persists beyond hand-crafted small systems. This is not a correctness issue but a load-bearing support gap for the empirical claims.
minor comments (6)
  1. Abstract and introduction: 'co-occurence' should be 'co-occurrence' (also appears in the structural dictionary).
  2. Eq. (2) and Remark 2.6: the 1/k! normalization is convenient; a brief note that the same hierarchy holds (up to combinatorial factors) for the unnormalized tensor would help readers comparing with other hypergraph Laplacian conventions.
  3. Figure 3 caption: the visibility hierarchy is clear, but labeling the asymptotic orders (linear/quadratic/cubic) next to the arrows would make the figure self-contained.
  4. Proposition 5.4 / Remark 5.5: the indirect cubic contribution γ_B inherits packing through the center-manifold correction u; a short sentence noting that this term is computed numerically in the tables (rather than left symbolic) would clarify reproducibility.
  5. Section 2.6 (directification): the embedding is well-defined; a one-line remark that undirected results inherit the same exposure/packing statements via the B-embedding would tighten the undirected claim.
  6. References: a few recent works on Turing patterns on hypergraphs/simplicial complexes (e.g., Muolo et al. already cited) could be cross-referenced more explicitly when discussing graph surrogacy success at linear order.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: theorems follow by direct calculation from the stated model under declared assumptions; numerics recompute the same tensors rather than fitting targets.

full rationale

The load-bearing chain is self-contained. The first-tail-moment reduction (Theorem 4.5 / Eq. 46–47) is obtained by linearizing the hypergraph RD system under the explicitly restricted coupling (order-independent mean aggregator plus fixed activation and shared mixing matrix M; Sec. 4.3.1 and Eq. 25): every partial of ψ_k collapses to the same Dσ factor, so only CHOM contractions of the Laplacian tensors survive. Exposure-equivalence and linear indistinguishability (Def. 4.8, Cor. 4.9) are then immediate consequences of that operator, not redefinitions of the claim. The packing hierarchy and nonlinear structural decomposition (Prop. 5.4, Thm. 5.9) likewise follow by Taylor expansion of the same vector field, projection onto the critical left eigenvector, and contraction of the higher tail-moment tensors with the critical mode; β_pack and γ_pack are defined as those projected contributions, not fitted to match post-onset data. Weak packing-equivalence, nonlinear distinguishability, and dynamical graph surrogacy (Defs. 5.10, Cors. 5.13–5.14) are logical corollaries of that decomposition. Numerical tables report coefficients computed directly from the same tensors and compare full-system projected amplitudes to the reduced ODE; no free parameters are calibrated to a target and then re-predicted. Self-citations (e.g. [22]) are incidental and not load-bearing for the central theorems. The modeling restriction is the price of the clean hierarchy, but it is stated up front rather than smuggled in as a uniqueness theorem. No step reduces a claimed prediction to its input by construction.

Assumptions & free parameters 2 free parameters · 4 assumptions · 4 invented entities

The central theorems rest on standard center-manifold theory, a modeling choice of mean aggregation, and the codimension-one spectral assumption. No free parameters enter the analytic claims; numerical illustrations use conventional kinetic and activation coefficients that do not affect the structural statements.

free parameters (2)
  • Schnakenberg a,b and diffusion du = a=0.2, b=1.3, du=0.25
    Fixed at a=0.2, b=1.3, du=0.25 for numerics only; not used in any theorem.
  • activation polynomial coefficients c1,u etc. = c1,u=1.1, c2,u=0.2, ...
    Chosen by hand to produce nonzero quadratic/cubic packing or to set σ''(x̄)=0; again only for numerical illustration.
assumptions (4)
  • domain assumption Codimension-one steady bifurcation: simple zero eigenvalue of the Jacobian with all other eigenvalues having negative real parts (Assumption 4.3.3).
    Standard for scalar amplitude equations; Hopf and higher-codimension cases are deferred.
  • ad hoc to paper Coupling is order-independent nonlinear mean aggregation followed by a fixed smooth activation σ and a single mixing matrix M (Section 4.3.1, Eq. (25)).
    Enables the exact first-tail-moment collapse; other aggregators would change the linear operator.
  • standard math Sufficient smoothness of f and σ for a third-order Taylor expansion (Assumption 4.3.2).
    Required for the weakly nonlinear expansion.
  • standard math Center-manifold theorem for a simple zero eigenvalue (standard reference).
    Used to reduce to the scalar amplitude equation.
invented entities (4)
  • exposure (first-tail-moment / CHOM of the adjacency tensor)
    purpose: The only structural statistic retained by the linearized operator.
    Defined via tensor contraction; shown to determine the entire linear spectrum.
  • packing tensors / packing effects
    purpose: Higher-order co-occurrence statistics that enter the quadratic and cubic amplitude coefficients after projection onto critical eigenvectors.
    Arise naturally from the multilinear expansion of the mean-aggregation nonlinearity.
  • dynamical graph surrogacy
    purpose: Formal condition under which a hypergraph system is indistinguishable from a graph system near onset (vanishing packing effects).
    Direct corollary of the structural decomposition theorem.
  • visibility hierarchy
    purpose: Organizing principle that successive asymptotic orders of the reduction reveal successive tail moments.
    Summarizes the main theoretical message of the paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Structural Visibility in Dynamical Systems on Hypergraphs: A Pattern Formation Perspective." pith.science (2026). https://pith.science/paper/IJ6RKVYA

@misc{pith2026260700256,
  author       = {Pith},
  title        = {Pith review of: Structural Visibility in Dynamical Systems on Hypergraphs: A Pattern Formation Perspective},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IJ6RKVYA}},
  note         = {Machine review of arXiv:2607.00256}
}
read the original abstract

Hypergraphs encode rich multiway interactions, but not all structural information is equally accessible through the dynamics. By analyzing pattern-forming instabilities in reaction-diffusion systems on directed hypergraphs, this work develops a theory of structural visibility that characterizes which features of higher-order structure survive successive levels of dynamical reduction. It is established that higher-order structure is not automatically dynamically relevant. Linearization destroys most higher-order information. Meanwhile, nonlinear reduction recovers only specific higher-order marginals of the adjacency tensor, and projection along critical directions further filters what is dynamically visible. First, we show that the linearized dynamics depends on the hypergraph only through its first-tail-moment statistics, termed exposure. Consequently, exposure-equivalent hypergraphs are linearly indistinguishable in the sense that they exhibit identical dispersion relations and instability thresholds. Next, we define a hierarchy of hyperedge tail-moments that captures progressively detailed co-occurence, and we prove a structural decomposition theorem describing how contractions of these tensors, termed packing effects, influence the reduced amplitude dynamics. This leads to a visibility hierarchy in which successive asymptotic orders reveal increasingly richer structural information. More specifically, exposure governs linear onset while packing effects control post-onset dynamics. Finally, we establish results on nonlinear distinguishability, characterizing when linearly indistinguishable higher-order systems may exhibit different post-onset behaviors. In addition, we formalize when higher-order systems become dynamically indistinguishable from pairwise systems, leading to the notion of dynamical graph surrogacy. Numerical simulations support the theoretical predictions.

Figures

Figures reproduced from arXiv: 2607.00256 by the authors.

Figure 1
Figure 1. A 3-uniform hypergraph on four nodes with hyperedges [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. The B-arc set associated with the hyperedge [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Visibility hierarchy structure illustrating the principle by which [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Nonlinear distinguishability for the pair of hypergraphs in Table [PITH_FULL_IMAGE:figures/full_fig_p030_4.png]
Figure 5
Figure 5. Figure 5: Graph-surrogacy test for a hypergraph H and its exposure-preserving graph sur￾rogate G. Left: Activation regime satisfying σ ′′(¯x) = 0. In this regime, the quadratic packing effect vanishes, suppressing the leading nonlinear obstruction to graph surrogacy. The project…

Review history (3 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references

  1. [1]

    Networks beyond pairwise interac- tions: Structure and dynamics.Physics reports, 874:1–92, 2020

    Federico Battiston, Giulia Cencetti, Iacopo Iacopini, Vito Latora, Maxime Lucas, Alice Patania, Jean-Gabriel Young, and Giovanni Petri. Networks beyond pairwise interac- tions: Structure and dynamics.Physics reports, 874:1–92, 2020

    2020

  2. [2]

    The physics of higher-order interactions in complex systems

    Federico Battiston, Enrico Amico, Alain Barrat, Ginestra Bianconi, Guilherme Fer- raz de Arruda, Benedetta Franceschiello, Iacopo Iacopini, Sonia K´ efi, Vito Latora, Yamir Moreno, et al. The physics of higher-order interactions in complex systems. Nature physics, 17(10):1093–1098, 2021

    2021

  3. [3]

    Hypergraphs and cellular networks

    Steffen Klamt, Utz-Uwe Haus, and Fabian Theis. Hypergraphs and cellular networks. PLoS computational biology, 5(5):e1000385, 2009

    2009

  4. [4]

    Simplicial models of social contagion.Nature communications, 10(1):2485, 2019

    Iacopo Iacopini, Giovanni Petri, Alain Barrat, and Vito Latora. Simplicial models of social contagion.Nature communications, 10(1):2485, 2019

    2019

  5. [5]

    High-order species interactions shape ecosystem diversity.Nature communications, 7(1):12285, 2016

    Eyal Bairey, Eric D Kelsic, and Roy Kishony. High-order species interactions shape ecosystem diversity.Nature communications, 7(1):12285, 2016

    2016

  6. [6]

    Princeton University Press Princeton, NJ, 2018

    Damon Centola.How behavior spreads: The science of complex contagions, volume 3. Princeton University Press Princeton, NJ, 2018

    2018

  7. [7]

    Cambridge University Press, 2021

    Ginestra Bianconi.Higher-order networks. Cambridge University Press, 2021

    2021

  8. [8]

    Multiorder laplacian for syn- chronization in higher-order networks.Physical Review Research, 2(3):033410, 2020

    Maxime Lucas, Giulia Cencetti, and Federico Battiston. Multiorder laplacian for syn- chronization in higher-order networks.Physical Review Research, 2(3):033410, 2020. 39

    2020

Show all 41 references
  1. [9]

    Random walks on simplicial complexes and the normalized hodge 1-laplacian.SIAM Review, 62(2):353–391, 2020

    Michael T Schaub, Austin R Benson, Paul Horn, Gabor Lippner, and Ali Jadbabaie. Random walks on simplicial complexes and the normalized hodge 1-laplacian.SIAM Review, 62(2):353–391, 2020

    2020

  2. [10]

    Explosive higher-order ku- ramoto dynamics on simplicial complexes.Physical Review Letters, 124(21):218301, 2020

    Ana P Mill´ an, Joaqu´ ın J Torres, and Ginestra Bianconi. Explosive higher-order ku- ramoto dynamics on simplicial complexes.Physical Review Letters, 124(21):218301, 2020

    2020

  3. [11]

    The chemical basis of morphogenesis: Philosophical transactions of the roy al society of london

    AM Turing. The chemical basis of morphogenesis: Philosophical transactions of the roy al society of london. ser. b. InBiol. Sci, volume 237, 1952

    1952

  4. [12]

    Turing patterns in network-organized activator–inhibitor systems.Nature Physics, 6(7):544–550, 2010

    Hiroya Nakao and Alexander S Mikhailov. Turing patterns in network-organized activator–inhibitor systems.Nature Physics, 6(7):544–550, 2010

    2010

  5. [13]

    Dynamical systems on hyper- graphs.Journal of Physics: Complexity, 1(3):035006, 2020

    Timoteo Carletti, Duccio Fanelli, and Sara Nicoletti. Dynamical systems on hyper- graphs.Journal of Physics: Complexity, 1(3):035006, 2020

    2020

  6. [14]

    Random walks on hypergraphs.Physical review E, 101(2):022308, 2020

    Timoteo Carletti, Federico Battiston, Giulia Cencetti, and Duccio Fanelli. Random walks on hypergraphs.Physical review E, 101(2):022308, 2020

    2020

  7. [15]

    Springer, 2003

    James Dickson Murray and James Dickson Murray.Mathematical biology: II: spatial models and biomedical applications, volume 18. Springer, 2003

    2003

  8. [16]

    Pattern formation outside of equilibrium

    Mark C Cross and Pierre C Hohenberg. Pattern formation outside of equilibrium. Reviews of modern physics, 65(3):851, 1993

    1993

  9. [17]

    Cambridge Univer- sity Press, 2006

    Rebecca B Hoyle.Pattern formation: an introduction to methods. Cambridge Univer- sity Press, 2006

    2006

  10. [18]

    Turing’s model for biological pattern formation and the robustness problem.Interface focus, 2(4):487, 2012

    Philip K Maini, Thomas E Woolley, Ruth E Baker, Eamonn A Gaffney, and S Seirin Lee. Turing’s model for biological pattern formation and the robustness problem.Interface focus, 2(4):487, 2012

    2012

  11. [19]

    Deep sets.Advances in neural information processing systems, 30, 2017

    Manzil Zaheer, Satwik Kottur, Siamak Ravanbakhsh, Barnabas Poczos, Russ R Salakhutdinov, and Alexander J Smola. Deep sets.Advances in neural information processing systems, 30, 2017

    2017

  12. [20]

    Set transformer: A framework for attention-based permutation-invariant neural networks

    Juho Lee, Yoonho Lee, Jungtaek Kim, Adam Kosiorek, Seungjin Choi, and Yee Whye Teh. Set transformer: A framework for attention-based permutation-invariant neural networks. InInternational conference on machine learning, pages 3744–3753. PMLR, 2019

    2019

  13. [21]

    Directed hyper- graphs and applications.Discrete applied mathematics, 42(2-3):177–201, 1993

    Giorgio Gallo, Giustino Longo, Stefano Pallottino, and Sang Nguyen. Directed hyper- graphs and applications.Discrete applied mathematics, 42(2-3):177–201, 1993

    1993

  14. [22]

    Coupling induced stabilization of network dynamical systems and switching

    Moise R Mouyebe and Anthony M Bloch. Coupling induced stabilization of network dynamical systems and switching. In2025 IEEE 64th Conference on Decision and Control (CDC), pages 8091–8097. IEEE, 2025

    2025

  15. [23]

    Consensus problems in networks of agents with switching topology and time-delays.IEEE Transactions on automatic control, 49(9):1520–1533, 2004

    Reza Olfati-Saber and Richard M Murray. Consensus problems in networks of agents with switching topology and time-delays.IEEE Transactions on automatic control, 49(9):1520–1533, 2004

    2004

  16. [24]

    Consensus seeking in multiagent systems under dy- namically changing interaction topologies.IEEE Transactions on automatic control, 50(5):655–661, 2005

    Wei Ren and Randal W Beard. Consensus seeking in multiagent systems under dy- namically changing interaction topologies.IEEE Transactions on automatic control, 50(5):655–661, 2005. 40

    2005

  17. [25]

    Synchronization in complex networks.Physics reports, 469(3):93–153, 2008

    Alex Arenas, Albert D´ ıaz-Guilera, Jurgen Kurths, Yamir Moreno, and Changsong Zhou. Synchronization in complex networks.Physics reports, 469(3):93–153, 2008

    2008

  18. [26]

    Self-entrainment of a population of coupled non-linear oscillators

    Yoshiki Kuramoto. Self-entrainment of a population of coupled non-linear oscillators. InInternational symposium on mathematical problems in theoretical physics: January 23–29, 1975, kyoto university, kyoto/Japan, pages 420–422. Springer, 2005

    1975

  19. [27]

    The kuramoto model: A simple paradigm for synchronization phenomena

    Juan A Acebr´ on, Luis L Bonilla, Conrad J P´ erez Vicente, F´ elix Ritort, and Renato Spigler. The kuramoto model: A simple paradigm for synchronization phenomena. Reviews of modern physics, 77(1):137–185, 2005

    2005

  20. [28]

    From kuramoto to crawford: exploring the onset of synchronization in populations of coupled oscillators.Physica D: Nonlinear Phenomena, 143(1-4):1–20, 2000

    Steven H Strogatz. From kuramoto to crawford: exploring the onset of synchronization in populations of coupled oscillators.Physica D: Nonlinear Phenomena, 143(1-4):1–20, 2000

    2000

  21. [29]

    Controllability of hypergraphs.IEEE Transactions on Network Science and Engineering, 8(2):1646–1657, 2021

    Can Chen, Amit Surana, Anthony M Bloch, and Indika Rajapakse. Controllability of hypergraphs.IEEE Transactions on Network Science and Engineering, 8(2):1646–1657, 2021

    2021

  22. [30]

    Tur- ing patterns in systems with high-order interactions.Chaos, Solitons & Fractals, 166:112912, 2023

    Riccardo Muolo, Luca Gallo, Vito Latora, Mattia Frasca, and Timoteo Carletti. Tur- ing patterns in systems with high-order interactions.Chaos, Solitons & Fractals, 166:112912, 2023

    2023

  23. [31]

    Tensor decompositions and applications.SIAM review, 51(3):455–500, 2009

    Tamara G Kolda and Brett W Bader. Tensor decompositions and applications.SIAM review, 51(3):455–500, 2009

    2009

  24. [32]

    Matrix analysis.American history, 1861(1900), 1945

    Roger A Horn and Charles R Johnson. Matrix analysis.American history, 1861(1900), 1945

    1900

  25. [33]

    JHU press, 2013

    Gene H Golub and Charles F Van Loan.Matrix computations. JHU press, 2013

    2013

  26. [34]

    SIAM, 1997

    Lloyd N Trefethen and David Bau, III.Numerical Linear Algebra. SIAM, 1997

    1997

  27. [35]

    Springer Science & Business Media, 2012

    Jack Carr.Applications of centre manifold theory. Springer Science & Business Media, 2012

    2012

  28. [36]

    Springer Science & Business Media, 2013

    John Guckenheimer and Philip Holmes.Nonlinear oscillations, dynamical systems, and bifurcations of vector fields. Springer Science & Business Media, 2013

    2013

  29. [37]

    Springer, 1998

    Yuri A Kuznetsov.Elements of applied bifurcation theory. Springer, 1998

    1998

  30. [38]

    Springer, 2003

    Stephen Wiggins.Introduction to applied nonlinear dynamical systems and chaos. Springer, 2003

    2003

  31. [39]

    Finite bandwidth, finite amplitude convection

    Alan C Newell and John A Whitehead. Finite bandwidth, finite amplitude convection. Journal of Fluid Mechanics, 38(2):279–303, 1969

    1969

  32. [40]

    Cambridge University Press, 2009

    Michael Cross and Henry Greenside.Pattern formation and dynamics in nonequilibrium systems. Cambridge University Press, 2009

    2009

  33. [41]

    Simple chemical reaction systems with limit cycle behaviour

    J¨ urgen Schnakenberg. Simple chemical reaction systems with limit cycle behaviour. Journal of theoretical biology, 81(3):389–400, 1979. 41

    1979

Pith tools

Reviewed July 12, 2026 · model on record in the stance chip above.