# Complex and detailed balancing of chemical reaction networks revisited

Source: [Complex and detailed balancing of chemical reaction networks revisited](<https://www.sota2.com/research/paper/68fa518e1e209131ce974cd6>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-27T04:57:47.618Z

Authors: Arjan van der Schaft, Shodhan Rao, Bayu Jayawardhana

Published: 2015-03-06T15:51:38.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1503.01996>)

[PDF](<https://arxiv.org/pdf/1503.01996.pdf>)