Related papers: A fast algorithm for random sequential adsorption …
Accurate theoretical methods are needed to correctly describe adsorption on solid surfaces or in porous materials. The random phase approximation with singles corrections scheme (RPA) and the second order M{\o}ller-Plesset perturbation…
Many applications require randomly sampling bipartite graphs with fixed degrees, or randomly sampling incidence matrices with fixed row and column sums. Although several sampling algorithms exist, the ``curveball'' algorithm is the most…
The sequence of 1/2-discrepancy sums of $\{x + i \theta \bmod 1\}$ is realized through a sequence of substitutions on an alphabet of three symbols; particular attention is paid to $x=0$. The first application is to show that any asymptotic…
Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random…
Many experimental studies of protein deposition on solid surfaces involve alternating adsorption/desorption steps. In this paper, we investigate the effect of a desorption step (separating two adsorption steps) on the kinetics, the…
In random sequential adsorption (RSA), objects are deposited randomly, irreversibly, and sequentially; attempts leading to an overlap with previously deposited objects are discarded. The process continues until the system reaches a jammed…
A model of soft frictionless disks in two dimensions at zero temperature is simulated with a shearing dynamics to study various kinds of asymmetries in sheared systems. We examine both single particle properties, the spatial velocity…
We express the Riemann zeta function $\zeta\left(s\right)$ of argument $s=\sigma+i\tau$ with imaginary part $\tau$ in terms of three absolutely convergent series. The resulting simple algorithm allows to compute, to arbitrary precision,…
Given a point set P in 2D, the problem of finding the smallest set of unit disks that cover all of P is NP-hard. We present a simple algorithm for this problem with an approximation factor of 25/6 in the Euclidean norm and 2 in the max…
A light-storage experiment with a total (storage and retrieval) efficiency $\eta=58 \pm 5%$ is carried out by enclosing a sample, with a single pass absorption of 10%, in an impedance-matched cavity. The experiment is carried out using the…
The properties of the number of iterations in random sequential adsorption protocol needed to generate finite saturated random packing of spherically symmetric shapes were studied. Numerical results obtained for one, two, and three…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
Cosmological perturbation theory is a powerful tool to predict the statistics of large-scale structure in the weakly non-linear regime, but even at 1-loop order it results in computationally expensive mode-coupling integrals. Here we…
An algorithm is given for determining an optimal $b$-step approximation of weighted data, where the error is measured with respect to the $L_\infty$ norm. For data presorted by the independent variable the algorithm takes $\Theta(n + \log n…
The adsorption of particles diffusing in a half-space bounded by the substrate and irreversibly sticking to the substrate upon contacts is investigated. We show that when absorbing particles are planar disks diffusing in the…
Given a set of $n$ points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-hard and several approximation…
An analytical theory for the random close packing density, $\phi_\textrm{RCP}$, of polydisperse hard disks is provided using an equilibrium model of crowding [A. Zaccone, Phys. Rev. Lett. 128, 028002 (2022)] which has been justified on the…
Intrinsic fluctuations of the proton saturation momentum generate asymmetric rapidity distributions on an event-by-event basis. We argue that the asymmetric component, $\left<a_1^2\right>$, of the orthogonal polynomial decomposition of the…
We consider the non-overlapping irreversible random sequential adsorption (RSA) process on one-dimensional finite line, which is known also as the car parking process. The probability of each coverage in saturating states is analytically…
This paper presents new methodology for computationally efficient kernel density estimation. It is shown that a large class of kernels allows for exact evaluation of the density estimates using simple recursions. The same methodology can be…