A proof of the Markov chain tree theorem
Let X be a finite set, P be a stochastic matrix on X, and = limn --> [infinity] (1/n)[summation operator]n-1k=0Pk. Let G = (X, E) be the weighted directed graph on X associated to P, with weights pij. An arborescence is a subset a [subset, double equals] E which has at most one edge out of every node, contains no cycles, and has maximum possible cardinality. The weight of an arborescence is the product of its edge weights. Let denote the set of all arborescences. Let ij denote the set of all arborescences which have j as a root and in which there is a directed path from i to j. Let [short parallel][short parallel], resp. [short parallel]ij[short parallel], be the sum of the weights of the arborescences in , resp. ij. The Markov chain tree theorem states that ij = [short parallel]ij[short parallel]/[short parallel][short parallel]. We give a proof of this theorem which is probabilistic in nature.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 8 (1989)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:8:y:1989:i:2:p:189-192. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.