# Annihilating random walks and perfect matchings of planar graphs

Abstract : We study annihilating random walks on $\mathbb{Z}$ using techniques of P.W. Kasteleyn and $R$. Kenyonon 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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [10 references]

https://hal.inria.fr/hal-01183921
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 9:06:31 AM
Last modification on : Sunday, June 26, 2022 - 12:03:57 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:37:03 AM

### File

dmAC0119.pdf
Publisher files allowed on an open archive

### Citation

Massimiliano Mattera. Annihilating random walks and perfect matchings of planar graphs. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.173-180, ⟨10.46298/dmtcs.3326⟩. ⟨hal-01183921⟩

Record views