DMTCS Proceedings, Discrete Random Walks, DRW'03

Font Size:  Small  Medium  Large

Annihilating random walks and perfect matchings of planar graphs

Massimiliano Mattera


We study annihilating random walks on Z using techniques of P.W. Kasteleyn and R. Kenyon on perfect matchings of planar graphs. We obtain the asymptotic of the density of remaining particles and the partition function of the underlying statistical mechanical model.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page

Valid XHTML 1.0 Transitional