Percolation and jamming of random sequential adsorption samples of large linear \(k\)-mers on a square lattice

The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and memory usage has been developed and applied to the model inv...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2018-12
Main Authors: Slutskii, M G, L Yu Barash, Yu Yu Tarasevich
Format: Article
Language:English
Subjects:
Adsorption
Boundary conditions
Clusters
Computer simulation
Jamming
Mathematical models
Percolation
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Slutskii, M G
L Yu Barash
Yu Yu Tarasevich
description The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and memory usage has been developed and applied to the model involving large linear \(k\)-mers on a square lattice with periodic boundary conditions. We have obtained the percolation thresholds and jamming concentrations for lengths of \(k\)-mers up to \(2^{17}\). New large \(k\) regime of the percolation threshold behavior has been identified. The structure of the percolating and jamming states has been investigated. The theorem of G.~Kondrat, Z.~Koza, and P.~Brzeski [Phys. Rev. E 96, 022154 (2017)] has been generalized to the case of periodic boundary conditions. We have proved that any cluster at jamming is percolating cluster and that percolation occurs before jamming.
doi_str_mv 10.48550/arxiv.1810.06800
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2121208690</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2121208690</sourcerecordid><originalsourceid>FETCH-proquest_journals_21212086903</originalsourceid><addsrcrecordid>eNqNjU1LA0EMhgdBsGh_gLeAFz1szc521_EsikcPHgsltGmZdT62yaz48x3FHyA5hDfPwxtjrltcrV3f4z3Jl_9cta4ecHCIZ2Zhu65t3NraC7NUHRHRDg-277uFSW8suxyo-JyA0h5GitGnI-QDSM05gvJp5lQ8BaC9Zpl-XaU4BdYfL5AcGYJPTAKb24_NXRNZKqqNoKeZpFIqxe_4ypwfKCgv__aluXl5fn96bSbJ9YuW7ZhnSRVtbVsH3fCI3f-sby5vUAM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2121208690</pqid></control><display><type>article</type><title>Percolation and jamming of random sequential adsorption samples of large linear \(k\)-mers on a square lattice</title><source>ProQuest - Publicly Available Content Database</source><creator>Slutskii, M G ; L Yu Barash ; Yu Yu Tarasevich</creator><creatorcontrib>Slutskii, M G ; L Yu Barash ; Yu Yu Tarasevich</creatorcontrib><description>The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and memory usage has been developed and applied to the model involving large linear \(k\)-mers on a square lattice with periodic boundary conditions. We have obtained the percolation thresholds and jamming concentrations for lengths of \(k\)-mers up to \(2^{17}\). New large \(k\) regime of the percolation threshold behavior has been identified. The structure of the percolating and jamming states has been investigated. The theorem of G.~Kondrat, Z.~Koza, and P.~Brzeski [Phys. Rev. E 96, 022154 (2017)] has been generalized to the case of periodic boundary conditions. We have proved that any cluster at jamming is percolating cluster and that percolation occurs before jamming.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1810.06800</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Adsorption ; Boundary conditions ; Clusters ; Computer simulation ; Jamming ; Mathematical models ; Percolation</subject><ispartof>arXiv.org, 2018-12</ispartof><rights>2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2121208690?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25732,27904,36991,44569</link.rule.ids></links><search><creatorcontrib>Slutskii, M G</creatorcontrib><creatorcontrib>L Yu Barash</creatorcontrib><creatorcontrib>Yu Yu Tarasevich</creatorcontrib><title>Percolation and jamming of random sequential adsorption samples of large linear \(k\)-mers on a square lattice</title><title>arXiv.org</title><description>The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and memory usage has been developed and applied to the model involving large linear \(k\)-mers on a square lattice with periodic boundary conditions. We have obtained the percolation thresholds and jamming concentrations for lengths of \(k\)-mers up to \(2^{17}\). New large \(k\) regime of the percolation threshold behavior has been identified. The structure of the percolating and jamming states has been investigated. The theorem of G.~Kondrat, Z.~Koza, and P.~Brzeski [Phys. Rev. E 96, 022154 (2017)] has been generalized to the case of periodic boundary conditions. We have proved that any cluster at jamming is percolating cluster and that percolation occurs before jamming.</description><subject>Adsorption</subject><subject>Boundary conditions</subject><subject>Clusters</subject><subject>Computer simulation</subject><subject>Jamming</subject><subject>Mathematical models</subject><subject>Percolation</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNjU1LA0EMhgdBsGh_gLeAFz1szc521_EsikcPHgsltGmZdT62yaz48x3FHyA5hDfPwxtjrltcrV3f4z3Jl_9cta4ecHCIZ2Zhu65t3NraC7NUHRHRDg-277uFSW8suxyo-JyA0h5GitGnI-QDSM05gvJp5lQ8BaC9Zpl-XaU4BdYfL5AcGYJPTAKb24_NXRNZKqqNoKeZpFIqxe_4ypwfKCgv__aluXl5fn96bSbJ9YuW7ZhnSRVtbVsH3fCI3f-sby5vUAM</recordid><startdate>20181221</startdate><enddate>20181221</enddate><creator>Slutskii, M G</creator><creator>L Yu Barash</creator><creator>Yu Yu Tarasevich</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20181221</creationdate><title>Percolation and jamming of random sequential adsorption samples of large linear \(k\)-mers on a square lattice</title><author>Slutskii, M G ; L Yu Barash ; Yu Yu Tarasevich</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_21212086903</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Adsorption</topic><topic>Boundary conditions</topic><topic>Clusters</topic><topic>Computer simulation</topic><topic>Jamming</topic><topic>Mathematical models</topic><topic>Percolation</topic><toplevel>online_resources</toplevel><creatorcontrib>Slutskii, M G</creatorcontrib><creatorcontrib>L Yu Barash</creatorcontrib><creatorcontrib>Yu Yu Tarasevich</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest - Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Slutskii, M G</au><au>L Yu Barash</au><au>Yu Yu Tarasevich</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Percolation and jamming of random sequential adsorption samples of large linear \(k\)-mers on a square lattice</atitle><jtitle>arXiv.org</jtitle><date>2018-12-21</date><risdate>2018</risdate><eissn>2331-8422</eissn><abstract>The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and memory usage has been developed and applied to the model involving large linear \(k\)-mers on a square lattice with periodic boundary conditions. We have obtained the percolation thresholds and jamming concentrations for lengths of \(k\)-mers up to \(2^{17}\). New large \(k\) regime of the percolation threshold behavior has been identified. The structure of the percolating and jamming states has been investigated. The theorem of G.~Kondrat, Z.~Koza, and P.~Brzeski [Phys. Rev. E 96, 022154 (2017)] has been generalized to the case of periodic boundary conditions. We have proved that any cluster at jamming is percolating cluster and that percolation occurs before jamming.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1810.06800</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2018-12
issn 2331-8422
language eng
recordid cdi_proquest_journals_2121208690
source ProQuest - Publicly Available Content Database
subjects Adsorption
Boundary conditions
Clusters
Computer simulation
Jamming
Mathematical models
Percolation
title Percolation and jamming of random sequential adsorption samples of large linear \(k\)-mers on a square lattice
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T13%3A01%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Percolation%20and%20jamming%20of%20random%20sequential%20adsorption%20samples%20of%20large%20linear%20%5C(k%5C)-mers%20on%20a%20square%20lattice&rft.jtitle=arXiv.org&rft.au=Slutskii,%20M%20G&rft.date=2018-12-21&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1810.06800&rft_dat=%3Cproquest%3E2121208690%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_21212086903%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2121208690&rft_id=info:pmid/&rfr_iscdi=true