IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v488y2017icp16-29.html
   My bibliography  Save this article

Kinetics of particle deposition at heterogeneous surfaces

Author

Listed:
  • Stojiljković, D.Lj.
  • Vrhovac, S.B.

Abstract

The random sequential adsorption (RSA) approach is used to analyze adsorption of spherical particles of fixed diameter d0 on nonuniform surfaces covered by square cells arranged in a square lattice pattern. To characterize such pattern two dimensionless parameters are used: the cell size α and the cell–cell separation β, measured in terms of the particle diameter d0. Adsorption is assumed to occur if the particle (projected) center lies within a cell area. We focus on the kinetics of deposition process in the case when no more than a single disk can be placed onto any square cell (α<1∕2≈0.707). We find that the asymptotic approach of the coverage fraction θ(t) to the jamming limit θJ is algebraic if the parameters α and β satisfy the simple condition, β+α∕2<1. If this condition is not satisfied, the late time kinetics of deposition process is not consistent with the power law behavior. However, if the geometry of the pattern approaches towards “noninteracting conditions” (β>1), when adsorption on each cell can be decoupled, approach of the coverage fraction θ(t) to θJ becomes closer to the exponential law. Consequently, changing the pattern parameters in the present model allows to interpolate the deposition kinetics between the continuum limit and the lattice-like behavior. Structural properties of the jammed-state coverings are studied in terms of the radial distribution function g(r) and spatial distribution of particles inside the cell. Various, non-trivial spatial distributions are observed depending on the geometry of the pattern.

Suggested Citation

  • Stojiljković, D.Lj. & Vrhovac, S.B., 2017. "Kinetics of particle deposition at heterogeneous surfaces," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 488(C), pages 16-29.
  • Handle: RePEc:eee:phsmap:v:488:y:2017:i:c:p:16-29
    DOI: 10.1016/j.physa.2017.06.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117306714
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2017.06.031?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. P. G. Szabó & M. Cs. Markót & T. Csendes & E. Specht & L. G. Casado & I. García, 2007. "New Approaches to Circle Packing in a Square," Springer Optimization and Its Applications, Springer, number 978-0-387-45676-8, June.
    2. Oleyar, C. & Talbot, J., 2007. "Reversible adsorption on a random site surface," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 376(C), pages 27-37.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2023. "Model Development and Solver Demonstrations Using Randomized Test Problems," SN Operations Research Forum, Springer, vol. 4(1), pages 1-15, March.
    2. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2020. "Packing ovals in optimized regular polygons," Journal of Global Optimization, Springer, vol. 77(1), pages 175-196, May.
    3. I Al-Mudahka & M Hifi & R M'Hallah, 2011. "Packing circles in the smallest circle: an adaptive hybrid algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1917-1930, November.
    4. Kalczynski, Pawel & Drezner, Zvi, 2022. "The Obnoxious Facilities Planar p-Median Problem with Variable Sizes," Omega, Elsevier, vol. 111(C).
    5. Brimberg, Jack & Kalczynski, Pawel & Drezner, Zvi, 2024. "Different formulations of the gray pattern problem and their optimal solutions," European Journal of Operational Research, Elsevier, vol. 316(1), pages 61-71.
    6. Mihály Csaba Markót, 2021. "Improved interval methods for solving circle packing problems in the unit square," Journal of Global Optimization, Springer, vol. 81(3), pages 773-803, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:488:y:2017:i:c:p:16-29. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.