Complex and detailed balancing of chemical reaction networks revisited

Arjan van der Schaft; Bayu Jayawardhana; Shodhan Rao

REVIEW

Complex and detailed balancing of chemical reaction networks revisited

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1503.01996 v1 pith:3BO2J4D7 submitted 2015-03-06 math.DS

Complex and detailed balancing of chemical reaction networks revisited

Arjan van der Schaft , Shodhan Rao , Bayu Jayawardhana This is my paper

classification math.DS

keywords balancingcomplexchemicaldetailednetworksparticularreactionrevisited

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

The characterization of the notions of complex and detailed balancing for mass action kinetics chemical reaction networks is revisited from the perspective of algebraic graph theory, in particular Kirchhoff's Matrix Tree theorem for directed weighted graphs. This yields an elucidation of previously obtained results, in particular with respect to the Wegscheider conditions, and a new necessary and sufficient condition for complex balancing, which can be verified constructively.

Complex and detailed balancing of chemical reaction networks revisited

discussion (0)