While it might be desirable to use shortest-path algorithms to identify reaction pathways in graph-based CRNs, as we did pre-viously, such algorithms become computationally intractable as network size increases. We therefore turn to the kinetic Monte Carlo (kMC) algorithm of Gillespie, which, with appropriate modifications, can scale sublinearly with number of reactions. In a kMC simulation, a system evolves from some user-defined initial state in a manner that is non-deterministic but consistent with the rate coefficients provided to the model.