Related papers: A fast algorithm for random sequential adsorption …
The different variants of two-stage random sequential adsorption (RSA) models for packing of disks and discorectangles on a two-dimensional (2D) surface were investigated. In the SD model, the discorectangles were first deposited and then…
We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…
This work proposes a universal and adaptive second-order method for minimizing second-order smooth, convex functions. Our algorithm achieves $O(\sigma / \sqrt{T})$ convergence when the oracle feedback is stochastic with variance $\sigma^2$,…
In this paper we analyze the influence of transport mechanisms (diffusion and sedimentation) on the structure of monolayers of particles irreversibly adsorbed on a line. We focus our attention on the dependence of the radial distribution…
We consider two-species random sequential adsorption (RSA) in which species A and B adsorb randomly on a lattice with the restriction that opposite species cannot occupy nearest-neighbor sites. When the probability $x_A$ of choosing an A…
Detecting changes in high-dimensional vectors presents significant challenges, especially when the post-change distribution is unknown and time-varying. This paper introduces a novel robust algorithm for correlation change detection in…
Set cover, over a universe of size $n$, may be modelled as a data-streaming problem, where the $m$ sets that comprise the instance are to be read one by one. A semi-streaming algorithm is allowed only $O(n\, \mathrm{poly}\{\log n, \log…
Non-Hermitian photonic systems capable of perfectly absorbing incident radiation recently attracted much attention both because fundamentally they correspond to an exotic scattering phenomenon (a real-valued scattering matrix zero) and…
We filled a void with a regular or asymmetric pattern without overlap using a time-dependent packing method termed random sequential adsorption (RSA). In the infinite-time limit, the density of coverage frequently hits a limit. This study…
Let $S$ be a set of $n$ points in the plane. We present several different algorithms for finding a pair of points in $S$ such that any disk that contains that pair must contain at least $cn$ points of $S$, for some constant $c>0$. The first…
Sampling from Gibbs distributions and computing their log-partition function are fundamental tasks in statistics, machine learning, and statistical physics. While efficient algorithms are known for log-concave densities, the worst-case…
As first-order optimization methods become the method of choice for solving large-scale optimization problems, optimization solvers based on first-order algorithms are being built. Such general-purpose solvers must robustly detect…
Let A be a set of positive integers with gcd(A) = 1, and let p_A(n) be the partition function of A. Let c = \pi \sqrt(2/3). Let \alpha > 0. It is proved that log p_A(n) ~ c\sqrt(\alpha n) if and only if the set A has asymptotic density…
The vertical structure of stationary thin accretion discs is calculated from the energy balance equation with heat generation due to microscopic ion viscosity {\eta} and electron heat conductivity {\kappa}, both depending on temperature. In…
We present three new approximation algorithms with improved constant ratios for selecting $n$ points in $n$ disks such that the minimum pairwise distance among the points is maximized. (1) A very simple $O(n\log n)$-time algorithm with…
A kinetic theory is proposed to elucidate complex nature of adsorption and desorption on surface and to calculate the adsorption and desorption rates in a practically simple way. This theory provides decomposition of the energy barriers and…
This paper presents a fast and simple new 2-approximation algorithm for minimum weighted vertex cover. The unweighted version of this algorithm is equivalent to a well-known greedy maximal independent set algorithm. We prove that this…
The idea of using fast sweeping methods for solving stationary systems of conservation laws has previously been proposed for efficiently computing solutions with sharp shocks. We further develop these methods to allow for a more challenging…
Predicting the densest random disc packing fraction is an unsolved paradigm problem relevant to a number of disciplines and technologies. One difficulty is that it is ill-defined without setting a criterion for the disorder. Another is that…
The first aim of this paper is to establish the weak convergence rate of nonlinear two-time-scale stochastic approximation algorithms. Its second aim is to introduce the averaging principle in the context of two-time-scale stochastic…