We study the convergence of a sequence of evolution equations for measures supported on the nodes of a graph. The evolution equations themselves can be interpreted as the forward Kolmogorov equations of Markov jump processes, or equivalently as the equations for the concentrations in a network of linear reactions. The jump rates or reaction rates are divided in two classes; `slow rates are constant, and `fast rates are scaled as~$1/epsilon$, and we prove the convergence in the fast-reaction limit $epsilonto0$. We establish a $Gamma$-convergence result for the rate functional in terms of both the concentration at each node and the flux over each edge (the level-2.5 rate function). The limiting system is again described by a functional, and characterizes both fast and slow fluxes in the system. This method of proof has three advantages. First, no condition of detailed balance is required. Secondly, the formulation in terms of concentration and flux leads to a short and simple proof of the $Gamma$-convergence; the price to pay is a more involved compactness proof. Finally, the method of proof deals with approximate solutions, for which the functional is not zero but small, without any changes.
Download