Metraipolis › archive › dc_de6e853cd10e
A new look at some aspects of one-dimensional random sequential adsorption and its continuum limit — arXiv:2608.04730
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04730
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T11:38:49.634Z
- SHA-256 of the archived text
3500940c9ddecb8123deb198b3127f97efc9dba3f7b6ca7cdede275e710e21d1- Stable URL of this page
https://metraipolis.com/documento/dc_de6e853cd10e
How to cite
A new look at some aspects of one-dimensional random sequential adsorption and its continuum limit — arXiv:2608.04730 — arXiv (en), https://arxiv.org/abs/2608.04730 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_de6e853cd10e (Metraipolis archive dc_de6e853cd10e, sha256 3500940c9ddecb8123deb198b3127f97efc9dba3f7b6ca7cdede275e710e21d1)
BibTeX
@misc{dcde6e853cd10e,
title = {A new look at some aspects of one-dimensional random sequential adsorption and its continuum limit — arXiv:2608.04730},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04730},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_de6e853cd10e; sha256 3500940c9ddecb8123deb198b3127f97efc9dba3f7b6ca7cdede275e710e21d1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04730. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Fix a positive integer $k\ge2$, and for $n\ge k$, consider a row of $n$ molecules. From among the $n-k+1$ nearest-neighbor $k$-tuples of molecules, select one uniformly at random and bond the $k$ molecules. Now, from all the remaining nearest-neighbor $k$-tuples, again select one uniformly at random and bond the $k$ molecules. Continue like this until there are no nearest-neighbor $k$-tuples left. Let $M^{(n)}_k$ denote the expected value of the number of bonded molecules. An explicit integral formula for $m_k:=\lim_{n\to\infty}\frac{M^{(n)}_k}n$ is known, and an explicit formula for $m_\infty:=\lim_{k\to\infty}m_k$ is known. The constant $m_\infty$, known as the Rényi parking constant, arises as the limiting packing density for a continuous analog of the above discrete packing problems. These are all models of what is called random sequential adsorption (RSA). The first part of this paper studies the gaps of sizes $0,1,\cdots, k-1$ that arise between bonded $k$-tuples and shows that after scaling the $k$-grid, when $k\to\infty$ the empirical distribution of expected gaps in the discrete problem on the lattice converges weakly to an appropriate gap distribution that is known to hold for the above noted continuous analog. The second part of the this paper considers two different models of the discrete bonding problem when both $k_1$-bonding and $k_2$-bonding occur, with $2\le k_1<k_2$. Explicit formulas are obtained for the analogs of $m_k$, and the asymptotic behavior of these analogs is studied both when $k_2\to\infty$ with $k_1$ fixed, and when $k_1,k_2\to\infty$ at certain ratios.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in math.PR).
Categorie arXiv: Probability (math.PR) ; Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.04730 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T11:29:05.114Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).