1. Anantharam, V., Tsoucas, P.: A proof of the Markov chain tree theorem. Stat. Probab. Lett. 8(2), 189–192 (1989)
2. Avena, L., Castell, F., Gaudillière, A., Mélot, C.: Approximate and exact solutions of intertwining equations through random spanning forests (2017).
arXiv:1702.05992
3. Benoist, S., Dumaz, L., Werner, W.: Near critical spanning forests and renormalization (2015).
arXiv:1503.08093
4. Burton, R., Pemantle, R.: Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances. Ann. Probab. 21, 1329–1371 (1993)
5. Chang, Y.: Contribution à l’étude des laçets Markoviens. thèse de doctorat de l’université Paris Sud—Paris XI, tel-00846462 (2013)