INVESTIGADORES
RAMIREZ PASTOR Antonio Jose
artículos
Título:
Random Sequential Adsorption of Polyatomic Species
Autor/es:
V. CORNETTE; D. LINARES; F. NIETO; RAMIREZ PASTOR A. J.
Revista:
JOURNAL OF PHYSICS. A - MATHEMATICAL AND GENERAL
Editorial:
IOP
Referencias:
Año: 2007 vol. 40 p. 11765 - 11776
ISSN:
0305-4470
Resumen:
Random sequential adsorption of k-mers (particles occupying k adsorption sites
on the substrate) of different sizes and shapes deposited on two-dimensional
regular lattices is studied. For discrete models at the late stage the surface
coverage evolves according to Æ(t) = Æ() − Aexp − t
Ð , where Æ() is
the jamming coverage while A and Ð are fitting parameters. In the present
paper, the dependence of the terminal relaxation time Ð (which determine how
fast the lattice is filled up to the jamming coverage) on the parameters of the
problem is established through a theoretical approach. In addition, a strategy
for determining Ð by means of a computational algorithm is presented.
k-mers (particles occupying k adsorption sites
on the substrate) of different sizes and shapes deposited on two-dimensional
regular lattices is studied. For discrete models at the late stage the surface
coverage evolves according to Æ(t) = Æ() − Aexp − t
Ð , where Æ() is
the jamming coverage while A and Ð are fitting parameters. In the present
paper, the dependence of the terminal relaxation time Ð (which determine how
fast the lattice is filled up to the jamming coverage) on the parameters of the
problem is established through a theoretical approach. In addition, a strategy
for determining Ð by means of a computational algorithm is presented.
Æ(t) = Æ() − Aexp − t
Ð , where Æ() is
the jamming coverage while A and Ð are fitting parameters. In the present
paper, the dependence of the terminal relaxation time Ð (which determine how
fast the lattice is filled up to the jamming coverage) on the parameters of the
problem is established through a theoretical approach. In addition, a strategy
for determining Ð by means of a computational algorithm is presented.
, where Æ() is
the jamming coverage while A and Ð are fitting parameters. In the present
paper, the dependence of the terminal relaxation time Ð (which determine how
fast the lattice is filled up to the jamming coverage) on the parameters of the
problem is established through a theoretical approach. In addition, a strategy
for determining Ð by means of a computational algorithm is presented.
A and Ð are fitting parameters. In the present
paper, the dependence of the terminal relaxation time Ð (which determine how
fast the lattice is filled up to the jamming coverage) on the parameters of the
problem is established through a theoretical approach. In addition, a strategy
for determining Ð by means of a computational algorithm is presented.
Ð (which determine how
fast the lattice is filled up to the jamming coverage) on the parameters of the
problem is established through a theoretical approach. In addition, a strategy
for determining Ð by means of a computational algorithm is presented.Ð by means of a computational algorithm is presented.