Pith. sign in

REVIEW

A network dynamics approach to chemical reaction networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1502.02247 v1 pith:7UUXIO5T submitted 2015-02-08 math.DS math.OC

A network dynamics approach to chemical reaction networks

classification math.DS math.OC
keywords dynamicschemicalreactionactionmassnetworknetworksassumption
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A crisp survey is given of chemical reaction networks from the perspective of general nonlinear network dynamics, in particular of consensus dynamics. It is shown how by starting from the complex-balanced assumption the reaction dynamics governed by mass action kinetics can be rewritten into a form which allows for a very simple derivation of a number of key results in chemical reaction network theory, and which directly relates to the thermodynamics of the system. Central in this formulation is the definition of a balanced Laplacian matrix on the graph of chemical complexes together with a resulting fundamental inequality. This directly leads to the characterization of the set of equilibria and their stability. Both the form of the dynamics and the deduced dynamical behavior are very similar to consensus dynamics. The assumption of complex-balancedness is revisited from the point of view of Kirchhoff's Matrix Tree theorem, providing a new perspective. Finally, using the classical idea of extending the graph of chemical complexes by an extra 'zero' complex, a complete steady-state stability analysis of mass action kinetics reaction networks with constant inflows and mass action outflows is given.

discussion (0)

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