Related papers: A fast algorithm for random sequential adsorption …
We present a complete characterization of the asymptotic behaviour of a correlated Bernoulli sequence { which depends on the parameter $\theta \in [0,1]$. A martingale theory based approach will allow} us to prove versions of the law of…
We present an efficient and numerically stable algorithm for calculation of two-particle response functions within the dynamical mean-field theory. The technique is based on inferring the high frequency asymptotic behavior of the…
In this paper the random packing fraction of hard disks in a plane is analyzed, following a geometric probabilistic approach. First, the random close packing (RCP) of equally sized disks is modelled. Subsequently, following the same…
The Landau distribution as well as its first and second momenta are well suited for describing the energy loss of charged particles traversing a thin layer of matter. At present, just rational approximations and asymptotic expressions for…
Recent optical flow estimation methods often employ local cost sampling from a dense all-pairs correlation volume. This results in quadratic computational and memory complexity in the number of pixels. Although an alternative…
Let $X=\{X_n: n\in\mathbb{N}\}$ be a long memory linear process with innovations in the domain of attraction of an $\alpha$-stable law $(0<\alpha<2)$. Assume that the linear process $X$ has a bounded probability density function $f(x)$.…
We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…
We design a new, fast algorithm for agnostically learning univariate probability distributions whose densities are well approximated by piecewise polynomial functions. Let $f$ be the density function of an arbitrary univariate distribution,…
Random arrangements of points in the plane, interacting only through a simple hard core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved…
In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to…
A reversible adsorption-desorption parking process in one dimension is studied. An exact solution for the equilibrium properties is obtained. The coverage near saturation depends logarithmically on the ratio between the adsorption rate,…
A streaming algorithm to compute the spectral proper orthogonal decomposition (SPOD) of stationary random processes is presented. As new data becomes available, an incremental update of the truncated eigenbasis of the estimated…
In this note, we develop a novel algorithm for generating random numbers from a distribution with a probability density function proportional to $\sin^k(x)$, $x \in (0,\pi)$ and $k \geq 1$. Our algorithm is highly efficient and is based on…
DNA data storage systems encode digital data into DNA strands, enabling dense and durable storage. Efficient data retrieval depends on coverage depth, a key performance metric. We study the random access coverage depth problem and focus on…
We point out that the mixed-event method for two-particle acceptance correction, widely used in particle correlation measurements at RHIC and LHC, is wrong in cases where the single particle pseudorapidity distribution is significantly…
We investigate both analytically and by numerical simulation the kinetics of a microscopic model of hard rods adsorbing on a linear substrate, a model which is relevant for compaction of granular materials. The computer simulations use an…
The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…
In this paper we generalize the classical theorem of Thue about the optimal circular disc packing in the plane. We are given a family of circular discs, not necessarily of equal radii, with the property that the inflation of every disc by a…
We take the vertical distribution of the radial and azimuthal velocity into account in spherical coordinates, and find that the analytic relation c_{s0}/(v_K \Theta) = [(\gamma -1)/(2\gamma)]^{1/2} is valid for both geometrically thin and…
Using the strong dispersive coupling to a high-cooperativity cavity, we demonstrate fast and non-destructive number-resolved detection of atoms in optical tweezers. We observe individual atom-atom collisions, quantum state jumps, and atom…