Annihilating random walks and perfect matchings of planar graphs

Massimiliano Mattera (1)

1 LM-Orsay - Laboratoire de Mathématiques d'Orsay

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.

Mots clés: Perfect matchings; Partition fucntion; Interacting particles systems

Domaines: Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]; Combinatoire [math.CO]; Géométrie algorithmique [cs.CG]

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⟩