Balance equation

In probability theory, a balance equation is an equation that describes the probability flux associated with a Markov chain in and out of states or set of states.

Global balance

The global balance equations (also known as full balance equations) are a set of equations that characterize the equilibrium distribution (or any stationary distribution) of a Markov chain, when such a distribution exists.

For a continuous time Markov chain with state space [math]\displaystyle{ \mathcal{S} }[/math], transition rate from state [math]\displaystyle{ i }[/math] to [math]\displaystyle{ j }[/math] given by [math]\displaystyle{ q_{ij} }[/math] and equilibrium distribution given by [math]\displaystyle{ \pi }[/math], the global balance equations are given by

[math]\displaystyle{ \pi_i = \sum_{j \in S} \pi_j q_{ji}, }[/math]

or equivalently

[math]\displaystyle{ \pi_i \sum_{j \in S\setminus \{i\}} q_{ij} = \sum_{j \in S\setminus \{i\}} \pi_j q_{ji}. }[/math]

for all [math]\displaystyle{ i \in S }[/math]. Here [math]\displaystyle{ \pi_i q_{ij} }[/math] represents the probability flux from state [math]\displaystyle{ i }[/math] to state [math]\displaystyle{ j }[/math]. So the left-hand side represents the total flow from out of state i into states other than i, while the right-hand side represents the total flow out of all states [math]\displaystyle{ j \neq i }[/math] into state [math]\displaystyle{ i }[/math]. In general it is computationally intractable to solve this system of equations for most queueing models.

Detailed balance

For a continuous time Markov chain (CTMC) with transition rate matrix [math]\displaystyle{ Q }[/math], if [math]\displaystyle{ \pi_i }[/math] can be found such that for every pair of states [math]\displaystyle{ i }[/math] and [math]\displaystyle{ j }[/math]

[math]\displaystyle{ \pi_i q_{ij} = \pi_j q_{ji} }[/math]

holds, then by summing over [math]\displaystyle{ j }[/math], the global balance equations are satisfied and [math]\displaystyle{ \pi }[/math] is the stationary distribution of the process. If such a solution can be found the resulting equations are usually much easier than directly solving the global balance equations.

A CTMC is reversible if and only if the detailed balance conditions are satisfied for every pair of states [math]\displaystyle{ i }[/math] and [math]\displaystyle{ j }[/math].

A discrete time Markov chain (DTMC) with transition matrix [math]\displaystyle{ P }[/math] and equilibrium distribution [math]\displaystyle{ \pi }[/math] is said to be in detailed balance if for all pairs [math]\displaystyle{ i }[/math] and [math]\displaystyle{ j }[/math],

[math]\displaystyle{ \pi_i p_{ij} = \pi_j p_{ji}. }[/math]

When a solution can be found, as in the case of a CTMC, the computation is usually much quicker than directly solving the global balance equations.

Local balance

In some situations, terms on either side of the global balance equations cancel. The global balance equations can then be partitioned to give a set of local balance equations (also known as partial balance equations, independent balance equations or individual balance equations). These balance equations were first considered by Peter Whittle. The resulting equations are somewhere between detailed balance and global balance equations. Any solution [math]\displaystyle{ \pi }[/math] to the local balance equations is always a solution to the global balance equations (we can recover the global balance equations by summing the relevant local balance equations), but the converse is not always true. Often, constructing local balance equations is equivalent to removing the outer summations in the global balance equations for certain terms.

During the 1980s it was thought local balance was a requirement for a product-form equilibrium distribution, but Gelenbe's G-network model showed this not to be the case.