pith. sign in

arxiv: 2604.10260 · v1 · submitted 2026-04-11 · 📡 eess.SY · cs.SY

Stability and Robustness of Tensor-Coupled Flow-Conservation Dynamical Systems on Hypergraphs

Chencheng Zhang , Hao Yang , Bin Jiang , Shaoxuan Cui This is my paper

Pith reviewed 2026-05-10 15:24 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords hypergraph dynamicstensor interactionsflow conservationentropy Lyapunov functiondetailed balancespectral gapinput-to-state stabilityrobustness
0
0 comments X

The pith

Under the tensor generalized detailed-balance condition, hypergraph flow systems admit a unique equilibrium that is globally asymptotically stable via an entropy Lyapunov function, with the Jacobian spectral gap controlling both convergence

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

The paper establishes that nonlinear dynamical systems on hypergraphs, whose states evolve on the simplex under conserved flows with state-dependent higher-order tensor interactions, reach a single equilibrium whenever a tensor generalized detailed-balance condition holds. An entropy function constructed from the equilibrium serves as a Lyapunov function that strictly decreases along trajectories, proving global asymptotic stability from any initial distribution. The linearization of the dynamics around this equilibrium, restricted to the tangent space, is shown to be Hurwitz, so its spectral gap supplies an explicit lower bound on the exponential convergence rate. The same gap enters first-order sensitivity bounds that quantify how much the equilibrium moves when the coupling tensor is perturbed and appears in local input-to-state stability estimates that bound recovery from external inputs.

Core claim

Under the tensor generalized detailed-balance (TGDB) condition, the system admits a unique equilibrium and an entropy Lyapunov function ensuring global asymptotic stability. The Jacobian restricted to the tangent subspace of the simplex is Hurwitz, and its spectral gap determines the exponential convergence rate. Building on this structure, first-order sensitivity bounds of the equilibrium under perturbations of the coupling tensor are derived together with a local input-to-state stability estimate with respect to external inputs. The results establish a quantitative link between the spectral gap and the system's robustness margin.

What carries the argument

The tensor generalized detailed-balance (TGDB) condition on state-dependent transition rates, which guarantees an equilibrium at which an entropy function decreases monotonically and thereby produces global asymptotic stability on the simplex.

If this is right

  • Every trajectory on the simplex converges globally to the unique equilibrium.
  • The exponential convergence rate is bounded below by the spectral gap of the restricted Jacobian.
  • First-order shifts of the equilibrium under small changes to the coupling tensor are inversely proportional to the spectral gap.
  • Local recovery from additive external inputs obeys an ISS estimate whose gain improves with larger spectral gaps.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The shared role of the spectral gap suggests that optimizing the gap could simultaneously accelerate convergence and tighten robustness margins in engineered hypergraph systems.
  • The entropy construction may extend to related conservative dynamics on other simplicial complexes once an analogous generalized balance condition is identified.

Load-bearing premise

The tensor generalized detailed-balance condition holds for the state-dependent transition rates.

What would settle it

A concrete hypergraph system obeying all modeling assumptions except the TGDB condition, yet possessing either multiple equilibria or at least one trajectory that fails to converge to a single point.

read the original abstract

This paper develops an entropy-based stability and robustness framework for nonlinear hypergraph dynamics with conservation and flow balance. We consider generator-form systems on the simplex whose state-dependent transition rates capture higher-order (tensor) interactions among nodes. Under a tensor generalized detailed-balance (TGDB) condition, we show that the system admits a unique equilibrium and an entropy Lyapunov function ensuring global asymptotic stability. The Jacobian restricted to the tangent subspace of the simplex is Hurwitz, and its spectral gap determines the exponential convergence rate. Building on this structure, we derive first-order sensitivity bounds of the equilibrium under perturbations of the coupling tensor and establish a local input-to-state stability (ISS) estimate with respect to external inputs. The results reveal a quantitative link between the spectral gap and the system's robustness margin: larger spectral gaps imply smaller equilibrium shifts and faster recovery under structural or parametric perturbations. Numerical experiments on tensor-coupled flow models confirm the theoretical predictions and illustrate how the proposed entropy-dissipating framework unifies stability and robustness analysis for conservative higher-order network systems.

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

0 major / 3 minor

Summary. The paper develops an entropy-based stability and robustness framework for nonlinear hypergraph dynamics with conservation and flow balance. It considers generator-form systems on the simplex with state-dependent transition rates capturing higher-order tensor interactions. Under a tensor generalized detailed-balance (TGDB) condition, the system admits a unique equilibrium and an entropy Lyapunov function ensuring global asymptotic stability. The Jacobian restricted to the tangent subspace is Hurwitz, with its spectral gap determining the exponential convergence rate. The authors derive first-order sensitivity bounds of the equilibrium under perturbations of the coupling tensor and establish a local input-to-state stability (ISS) estimate, revealing a quantitative link between the spectral gap and robustness margin. Numerical experiments on tensor-coupled flow models confirm the predictions.

Significance. If the derivations hold, this provides a valuable extension of classical detailed-balance Lyapunov methods to higher-order conservative systems on hypergraphs. The quantitative connection between spectral gap, convergence rate, equilibrium sensitivity, and ISS robustness margins offers practical tools for analyzing stability in networked systems with multi-way interactions, such as those arising in biology or infrastructure. The conditional but explicitly stated TGDB hypothesis and the numerical validation strengthen the contribution for the systems and control community.

minor comments (3)
  1. §3 (TGDB definition): clarify whether the TGDB condition can be checked algorithmically from the rate tensors or remains a modeling assumption that must be verified case-by-case; this would help readers assess applicability.
  2. Numerical experiments section: provide explicit values or ranges for the hypergraph order, number of nodes, and the computed spectral gaps alongside observed convergence times to strengthen the quantitative link claimed in the theory.
  3. Notation: ensure the coupling tensor is denoted consistently (e.g., avoid switching between script and boldface) and that the tangent-space projection operator is defined before its first use in the Jacobian analysis.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our manuscript, which correctly identifies the entropy Lyapunov function, global asymptotic stability under the tensor generalized detailed-balance condition, the role of the spectral gap in the Jacobian, and the quantitative sensitivity and local ISS bounds. We are pleased that the potential value for analyzing higher-order networked systems is recognized. No specific major comments were raised in the report, so we have no point-by-point revisions to address. We will incorporate any minor editorial or formatting suggestions in the revised version.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The derivation begins from the model equations on the simplex with state-dependent tensor rates and proceeds conditionally on the TGDB assumption, which is introduced explicitly rather than derived or fitted. Under TGDB the paper constructs an entropy function shown to dissipate, proves uniqueness of the equilibrium on the simplex, establishes that the tangent Jacobian is Hurwitz with positive spectral gap, and obtains first-order sensitivity and local ISS bounds from the same linearization. None of these steps reduces the claimed stability, convergence rate, or robustness margins to the inputs by construction, nor relies on self-citation chains or renamed empirical patterns; the argument follows the standard detailed-balance Lyapunov template extended to hypergraphs and remains independent of the target results.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claims rest on the TGDB condition as the key structural assumption enabling the entropy function and uniqueness; no free parameters or new invented entities are stated in the abstract.

axioms (1)
  • domain assumption Tensor generalized detailed-balance (TGDB) condition on the state-dependent transition rates
    Invoked to guarantee unique equilibrium and existence of the entropy Lyapunov function.

pith-pipeline@v0.9.0 · 5487 in / 1318 out tokens · 24756 ms · 2026-05-10T15:24:26.246036+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

38 extracted references · 38 canonical work pages

  1. [1]

    Consensus dynamics and opinion formation on hypergraphs,

    L. Neuh ¨auser, R. Lambiotte, and M. T. Schaub, “Consensus dynamics and opinion formation on hypergraphs,” inHigher-Order Systems. Springer, 2022, pp. 347–376

    work page 2022

  2. [2]

    Analysis of higher-order lotka-volterra models: Application of s-tensors and the polynomial complementarity problem,

    S. Cui, Q. Zhao, G. Zhang, H. Jardon-Kojakhmetov, and M. Cao, “Analysis of higher-order lotka-volterra models: Application of s-tensors and the polynomial complementarity problem,”IEEE Transactions on Automatic Control, 2025

    work page 2025

  3. [3]

    Consensus dynamics on temporal hypergraphs,

    L. Neuh ¨auser, R. Lambiotte, and M. T. Schaub, “Consensus dynamics on temporal hypergraphs,”Physical Review E, vol. 104, no. 6, p. 064305, 2021

    work page 2021

  4. [4]

    Flocking control against malicious agent,

    C. Zhang, H. Yang, B. Jiang, and M. Cao, “Flocking control against malicious agent,”IEEE Transactions on Automatic Control, vol. 69, no. 5, pp. 3278–3285, 2023

    work page 2023

  5. [5]

    An sis diffusion process with direct and indirect spreading on a hypergraph,

    S. Cui, F. Liu, L. Liang, H. Jard ´on-Kojakhmetov, and M. Cao, “An sis diffusion process with direct and indirect spreading on a hypergraph,” Automatica, vol. 177, p. 112319, 2025

    work page 2025

  6. [6]

    Discrete-time sis contagion processes on hypergraphs,

    L. Liang, S. Cui, and F. Liu, “Discrete-time sis contagion processes on hypergraphs,”IEEE Transactions on Automatic Control, 2025

    work page 2025

  7. [7]

    What are higher-order networks?

    C. Bick, E. Gross, H. A. Harrington, and M. T. Schaub, “What are higher-order networks?”SIAM Review, vol. 65, no. 3, pp. 686–731, 2023

    work page 2023

  8. [8]

    Dynamics on higher-order networks: A review,

    S. Majhi, M. Perc, and D. Ghosh, “Dynamics on higher-order networks: A review,”Journal of the Royal Society Interface, vol. 19, no. 188, p. 20220043, 2022

    work page 2022

  9. [9]

    Measuring dynamical systems on directed hypergraphs,

    M. Faccin and G. Bianconi, “Measuring dynamical systems on directed hypergraphs,”Physical Review E, vol. 105, no. 4, p. 044303, 2022

    work page 2022

  10. [10]

    Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes,

    Y . Zhang, X. Zhang, A.-L. Barab ´asi, and F. Battiston, “Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes,”Nature Communications, vol. 14, p. 1608, 2023

    work page 2023

  11. [11]

    Convergence analysis using the edge laplacian: Robust consensus of nonlinear multi-agent systems via iss method,

    Z. Zeng, X. Wang, and Z. Zheng, “Convergence analysis using the edge laplacian: Robust consensus of nonlinear multi-agent systems via iss method,”International Journal of Robust and Nonlinear Control, vol. 26, no. 5, pp. 1051–1072, 2016

    work page 2016

  12. [12]

    Mesbahi and M

    M. Mesbahi and M. Egerstedt,Graph Theoretic Methods in Multiagent Networks. Princeton, NJ: Princeton University Press, 2010

    work page 2010

  13. [13]

    Discrete-time layered-network epidemics model with time-varying transition rates and multiple resources,

    S. Cui, F. Liu, H. Jard ´on-Kojakhmetov, and M. Cao, “Discrete-time layered-network epidemics model with time-varying transition rates and multiple resources,”Automatica, vol. 159, p. 111303, 2024. 12 GENERIC COLORIZED JOURNAL, VOL. XX, NO. XX, XXXX 2017

    work page 2024

  14. [14]

    Sensitivity and convergence of uniformly ergodic markov chains,

    A. Y . Mitrophanov, “Sensitivity and convergence of uniformly ergodic markov chains,”Journal of Applied Probability, vol. 42, no. 4, pp. 1003– 1014, 2005

    work page 2005

  15. [15]

    Gradient flows of the entropy for finite markov chains,

    J. Maas, “Gradient flows of the entropy for finite markov chains,” Journal of Functional Analysis, vol. 261, no. 8, pp. 2250–2292, 2011

    work page 2011

  16. [16]

    An iss small-gain theorem for general networks,

    S. Dashkovskiy, B. S. R ¨uffer, and F. Wirth, “An iss small-gain theorem for general networks,”Mathematics of Control, Signals and Systems, vol. 19, no. 2, pp. 93–122, 2007

    work page 2007

  17. [17]

    Attack detection and identi- fication in cyber-physical systems,

    F. Pasqualetti, F. D ¨orfler, and F. Bullo, “Attack detection and identi- fication in cyber-physical systems,”IEEE Transactions on Automatic Control, vol. 58, no. 11, pp. 2715–2729, 2013

    work page 2013

  18. [18]

    On metzler positive systems on hypergraphs,

    S. Cui, G. Zhang, H. Jard ´on-Kojakhmetov, and M. Cao, “On metzler positive systems on hypergraphs,”IEEE Transactions on Control of Network Systems, 2025

    work page 2025

  19. [19]

    On discrete-time polynomial dynamical systems on hypergraphs,

    ——, “On discrete-time polynomial dynamical systems on hypergraphs,” IEEE Control Systems Letters, 2024

    work page 2024

  20. [20]

    Higher- order laplacian dynamics on hypergraphs with cooperative and antago- nistic interactions,

    S. Cui, C. Zhang, B. Jiang, H. J. Kojakhmetov, and M. Cao, “Higher- order laplacian dynamics on hypergraphs with cooperative and antago- nistic interactions,”arXiv preprint arXiv:2502.08276, 2025

    work page arXiv 2025

  21. [21]

    Controllability of hypergraphs,

    C. Chen, A. Surana, A. M. Bloch, and I. Rajapakse, “Controllability of hypergraphs,”IEEE Transactions on Network Science and Engineering, vol. 8, no. 2, pp. 1646–1657, 2021

    work page 2021

  22. [22]

    Observability of hypergraphs,

    J. Pickard, A. Surana, A. Bloch, and I. Rajapakse, “Observability of hypergraphs,” in2023 62nd IEEE Conference on Decision and Control (CDC). IEEE, 2023, pp. 2445–2451

    work page 2023

  23. [23]

    Global and local observability of hypergraphs,

    C. Zhang, H. Yang, S. Cui, B. Jiang, and M. Cao, “Global and local observability of hypergraphs,”arXiv preprint arXiv:2405.18969, 2024

    work page arXiv 2024

  24. [24]

    Controllability and observability of temporal hypergraphs,

    A. Dong, X. Mao, R. Vasudevan, and C. Chen, “Controllability and observability of temporal hypergraphs,”IEEE Control Systems Letters, 2024

    work page 2024

  25. [25]

    Networks beyond pairwise interactions: Structure and dynamics,

    F. Battiston, G. Cencetti, I. Iacopini, V . Latora, M. Lucas, A. Patania, J.-G. Young, and G. Petri, “Networks beyond pairwise interactions: Structure and dynamics,”Physics reports, vol. 874, pp. 1–92, 2020

    work page 2020

  26. [26]

    Multibody interactions and nonlinear consensus dynamics on networked systems,

    L. Neuh ¨auser, A. Mellor, and R. Lambiotte, “Multibody interactions and nonlinear consensus dynamics on networked systems,”Physical Review E, vol. 101, no. 3, p. 032310, 2020

    work page 2020

  27. [27]

    Ricci curvature of finite markov chains via convexity of the entropy,

    M. Erbar and J. Maas, “Ricci curvature of finite markov chains via convexity of the entropy,”Archive for Rational Mechanics and Analysis, vol. 206, pp. 997–1038, 2012

    work page 2012

  28. [28]

    Resilient asymptotic consensus in robust networks,

    H. J. LeBlanc, H. Zhang, X. Koutsoukos, and S. Sundaram, “Resilient asymptotic consensus in robust networks,”IEEE Journal on Selected Areas in Communications, vol. 31, no. 4, pp. 766–781, 2013

    work page 2013

  29. [29]

    Input to state stability: Basic concepts and results,

    E. D. Sontag, “Input to state stability: Basic concepts and results,” inNonlinear and optimal control theory: lectures given at the CIME summer school held in Cetraro, Italy June 19–29, 2004. Springer, 2008, pp. 163–220

    work page 2004

  30. [30]

    Small-gain theorem for iss systems and applications,

    Z. P. Jiang, A. R. Teel, and L. Praly, “Small-gain theorem for iss systems and applications,”Mathematics of Control, Signals and Systems, vol. 7, no. 2, pp. 95–120, 1994

    work page 1994

  31. [31]

    Fault estimation and accommodation of fractional-order nonlinear, switched, and interconnected systems,

    C. Zhang, H. Yang, and B. Jiang, “Fault estimation and accommodation of fractional-order nonlinear, switched, and interconnected systems,” IEEE Transactions on Cybernetics, vol. 52, no. 3, pp. 1443–1453, 2022

    work page 2022

  32. [32]

    Characterizations of input-to-state sta- bility for infinite-dimensional systems,

    A. Mironchenko and F. Wirth, “Characterizations of input-to-state sta- bility for infinite-dimensional systems,”SIAM Journal on Control and Optimization, vol. 55, no. 6, pp. 3629–3659, 2017

    work page 2017

  33. [33]

    Exponential small-gain theorem and fault-tolerant safe control of interconnected nonlinear systems,

    H. Yang, C. Zhang, Z. An, and B. Jiang, “Exponential small-gain theorem and fault-tolerant safe control of interconnected nonlinear systems,”Automatica, vol. 115, p. 108866, 2020

    work page 2020

  34. [34]

    Local input-to-state stability: Characterizations and counterexamples,

    A. Mironchenko, “Local input-to-state stability: Characterizations and counterexamples,”Systems & Control Letters, vol. 87, pp. 23–28, 2016

    work page 2016

  35. [35]

    Note on the derivatives with respect to a parameter of the solutions of a system of differential equations,

    T. H. Gronwall, “Note on the derivatives with respect to a parameter of the solutions of a system of differential equations,”Annals of Mathematics, vol. 20, no. 4, pp. 292–296, 1919

    work page 1919

  36. [36]

    Kullback-leibler divergence,

    S. Kullback, “Kullback-leibler divergence,”Tech. Rep., 1951

    work page 1951

  37. [37]

    Advances in operator cauchy–schwarz inequalities and their reverses,

    J. Aldaz, S. Barza, M. Fujii, and M. S. Moslehian, “Advances in operator cauchy–schwarz inequalities and their reverses,”Annals of Functional Analysis, vol. 6, no. 3, pp. 275–295, 2015

    work page 2015

  38. [38]

    Sharpness in young’s inequality for convolution prod- ucts,

    O. A. Nielsen, “Sharpness in young’s inequality for convolution prod- ucts,”Canadian Journal of Mathematics, vol. 46, no. 6, pp. 1287–1298, 1994. Chencheng Zhangreceived the B.S. degree in automation from the College of Information Engi- neering, Y angzhou University, Y angzhou, China, in 2017. She was a visiting Ph.D. student at the University of Groning...

    work page 1994