Discrete Random Walks, DRW'03
Cyril Banderier and Christian Krattenthaler (eds.)
DMTCS Conference Volume AC (2003), pp. 173180
author:  Massimiliano Mattera 

title:  Annihilating random walks and perfect matchings of planar graphs 
keywords:  Perfect matchings, Partition fucntion, Interacting particles systems 
abstract: 
We study annihilating random walks on
Z
using techniques of P.W. Kasteleyn and R. Kenyon on
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.

If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files.  
reference:  Massimiliano Mattera (2003), Annihilating random walks and perfect matchings of planar graphs, in Discrete Random Walks, DRW'03, Cyril Banderier and Christian Krattenthaler (eds.), Discrete Mathematics and Theoretical Computer Science Proceedings AC, pp. 173180 
bibtex:  For a corresponding BibTeX entry, please consider our BibTeXfile. 
ps.gzsource:  dmAC0119.ps.gz (36 K) 
pssource:  dmAC0119.ps (128 K) 
pdfsource:  dmAC0119.pdf (92 K) 
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.
Automatically produced on Di Sep 27 10:09:20 CEST 2005 by gustedt