Competitive irreversible random one-, two-, three-, . . . point adsorption on two-dimensional lattices

An analytic treatment of competitive, irreversible (immobile) random one-, two-, three-, . . . point adsorption (or monomer, dimer, trimer, . . . filling) on infinite, uniform two-dimensional lattices is provided by applying previously developed truncation schemes to the hierarchial form of the appropriate master equations. The behavior of these processes for two competing species is displayed by plotting families of ``filling trajectories'' in the partial-coverage plane for various ratios of adsorption rates. The time or coverage dependence of various subconfiguration probabilities can also be analyzed. For processes where no one-point (monomer) adsorption occurs, the lattice cannot fill completely; accurate estimates of the total (and partial) saturation coverages can be obtained.