Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01183921
Contributor : Coordination Episciences Iam <>
Submitted on : Wednesday, August 12, 2015 - 9:06:31 AM
Last modification on : Wednesday, September 16, 2020 - 4:05:30 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:37:03 AM

File

dmAC0119.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01183921, version 1

Collections

Citation

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

Share

Metrics

Record views

132

Files downloads

903