Annihilating random walks and perfect matchings of planar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2003

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.
Fichier principal
Vignette du fichier
dmAC0119.pdf (87.36 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01183921 , version 1 (12-08-2015)

Identifiers

Cite

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⟩
107 View
749 Download

Altmetric

Share

Gmail Facebook X LinkedIn More