Loading [MathJax]/jax/output/HTML-CSS/jax.js

Massimiliano Mattera - Annihilating random walks and perfect matchings of planar graphs

dmtcs:3326 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) - https://doi.org/10.46298/dmtcs.3326
Annihilating random walks and perfect matchings of planar graphsConference paper

Authors: Massimiliano Mattera 1

  • 1 Laboratoire de Mathématiques d'Orsay

We study annihilating random walks on 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.

https://doi.org/10.46298/dmtcs.3326
Source: HAL:hal-01183921v1
Volume: DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Section: Proceedings
Published on: January 1, 2003
Imported on: May 10, 2017
Keywords: Perfect matchings,Partition fucntion,Interacting particles systems,[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

3 Documents citing this article

Share and export

Consultation statistics

This page has been seen 325 times.
This article's PDF has been downloaded 467 times.