Graph structures satisfying detailed balance. Labels have been omitted for clarity. (A) A sequence of reversible edges, as considered by Ong et al. . (B) A tree of reversible edges. A tree is characterised by having no cycle of reversible edges and is an example of a general graph structure that always satisfies detailed balance, irrespective of the kinds of edges in the graph and the labels on these edges (Methods).