  The peeling decoder introduced by Luby, et al. allows analysis of LDPC
decoding for the binary erasure channel (BEC). For irregular ensembles, they
analyze the decoder state as a Markov process and present a solution to the
differential equations describing the process mean. Multi-edge type (MET)
ensembles allow greater precision through specifying graph connectivity. We
generalize the the peeling decoder for MET ensembles and derive analogous
differential equations. We offer a new change of variables and solution to the
node fraction evolutions in the general (MET) case. This result is preparatory
to investigating finite-length ensemble behavior.
