Related papers: Random Sequential Adsorption with Correlated Defec…
We study saturated packings produced according to random sequential adsorption (RSA) protocol built of identical rectangles deposited on a flat, continuous plane. An aspect ratio of rectangles is defined as the length-to-width ratio,…
The random sequential adsorption (RSA) of identical elongated particles (discorectangles) on a line ("Paris car parking problem") was studied numerically. An off-lattice model with continuous positional and orientational degrees of freedom…
Random sequential adsorption (RSA) is a standard method of modeling adsorption of large molecules at the liquid-solid interface. Here we consider jammed states of the RSA process of nonoverlapping dimers (objects occupying two…
Relaxation of the packing of elongated particles (discorectangles) aligned on a line was studied numerically. The aspect ratio (length-to-width ratio) for the discorectangles was varied within the range $\varepsilon \in [1;50]$. The initial…
We propose a new ensemble prediction method, Random Subset Averaging (RSA), tailored for settings with many covariates, particularly in the presence of strong correlations. RSA constructs candidate models via binomial random subset strategy…
We present a model of one-dimensional irreversible adsorption in which particles once adsorbed immediately shrink to a smaller size or expand to a larger size. Exact solutions for the fill factor and the particle number variance as a…
We model a dense wireless local area network where the access points (APs) employ carrier sense multiple access (CSMA)-type medium access control protocol. In our model, the spatial locations of the set of active APs are modeled using the…
We study the kinetics of random sequential adsorption of a mixture of particles with continuous distribution of sizes for different deposition rules. It appears in the long time limit the resulting system can be described using the fractal…
Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal and random lattices is studied. The adsorption process is modeled by using random sequential adsorption (RSA) algorithm. Objects are adsorbed on one-,…
It is shown that the fluctuations of the jamming coverage upon Random Sequential Adsorption ($\sigma_{\theta_J}$), decay with the lattice size according to the power-law $\sigma_{\theta_J} \propto L^{-1 / \nu_J}$, with $\nu_{J} = 2 / (2D -…
Wideband spectrum sensing detects the unused spectrum holes for dynamic spectrum access (DSA). Too high sampling rate is the main problem. Compressive sensing (CS) can reconstruct sparse signal with much fewer randomized samples than…
We reveal the fractal nature of patterns arising in random sequential adsorption of particles with continuum power-law size distribution, $P(R)\sim R^{\alpha-1}$, $R \le R_{\rm max}$. We find that the patterns become more and more ordered…
In this paper, we review the key figures of merit to assess the performance of advanced random access (RA) schemes exploiting physical layer coding, repetitions and collision resolution techniques. We then investigate RA modeling aspects…
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…
Understanding the dynamic adsorption of colloidal particles at fluid interfaces is essential for applications ranging from emulsion stabilization to interfacial assembly of functional materials. Adsorption dynamics is often described…
This paper develops a unified framework, based on iterated random operator theory, to analyze the convergence of constant stepsize recursive stochastic algorithms (RSAs). RSAs use randomization to efficiently compute expectations, and so…
The random sequential adsorption (RSA) model is a classical model in Statistical Physics for adsorption on two-dimensional surfaces. Objects are deposited sequentially at random and adsorb irreversibly on the landing site, provided that…
The Subset Sum Problem is a fundamental NP-complete problem in cryptography and combinatorial optimization, with many real-world applications. The Random Subset Sum Problem (RSSP) is a more applicable version of subset sum, where numbers…
Connectedness percolation phenomena in the two-dimensional (2D) packing of binary mixtures of disks with different diameters were studied numerically. The packings were produced using random sequential adsorption (RSA) model with…
We study the percolation and jamming of rods ($k$-mers) on a square lattice that contains defects. The point defects are placed randomly and uniformly on the substrate before deposition of the rods. The general case of unequal probabilities…