Exact and approximate results for deposition and annihilation processes on graphs

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published at http://dx.doi.org/10.1214/105051604000000765 in the Annals of Applied Probability (http://www.imstat.org/aap/) by

Scientific paper

10.1214/105051604000000765

We consider random sequential adsorption processes where the initially empty sites of a graph are irreversibly occupied, in random order, either by monomers which block neighboring sites, or by dimers. We also consider a process where initially occupied sites annihilate their neighbors at random times. We verify that these processes are well defined on infinite graphs, and derive forward equations governing joint vacancy/occupation probabilities. Using these, we derive exact formulae for occupation probabilities and pair correlations in Bethe lattices. For the blocking and annihilation processes we also prove positive correlations between sites an even distance apart, and for blocking we derive rigorous lower bounds for the site occupation probability in lattices, including a lower bound of 1/3 for Z^2. We also give normal approximation results for the number of occupied sites in a large finite graph.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Exact and approximate results for deposition and annihilation processes on graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact and approximate results for deposition and annihilation processes on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact and approximate results for deposition and annihilation processes on graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-586891

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.