Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Annihilating random ...
Conference paper

Annihilating random walks and perfect matchings of planar graphs

Massimiliano Mattera (1)
(1) Laboratoire de Mathématiques d'Orsay
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2002
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Proceedings
DOI
10.46298/dmtcs.3326
License
https://about.hal.science/hal-authorisation-v1
Indicators
749
Views
1114
Downloads

Annihilating random walks and perfect matchings of planar graphs

Massimiliano Mattera (1)
(1) Laboratoire de Mathématiques d'Orsay
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.
Keywords
  • [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]
  • Perfect matchings
  • Partition fucntion
  • Interacting particles systems
Cited by

Source: OpenCitations

  • Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata

    Lecture notes in computer science

    Authors : Nazim Fatés ORCID, Michel Morvan, Nicolas Schabanel, Éric Thierry

    Journal reference : Volume , 2005, pp. 316-327

    DOI : 10.1007/11549345_28

  • Fully asynchronous behavior of double-quiescent elementary cellular automata

    Authors : Nazim Fatès ORCID, Éric Thierry, Michel Morvan, Nicolas Schabanel

    Journal reference : Volume 362, 2006, pp. 1-16

    DOI : 10.1016/j.tcs.2006.05.036

  • Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata

    Lecture notes in computer science

    Authors : Nazim Fatès ORCID, Damien Regnault ORCID, Nicolas Schabanel, Éric Thierry

    Journal reference : Volume , 2006, pp. 455-466

    DOI : 10.1007/11682462_43
Preview
Loading PDF preview...