Related papers: Perfect simulation of the Hard Disks Model by Part…
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…
We introduce exact methods for the simulation of sample paths of one-dimensional diffusions with a discontinuity in the drift function. Our procedures require the simulation of finite-dimensional candidate draws from probability laws…
High-dimensional simulation optimization is notoriously challenging. We propose a new sampling algorithm that converges to a global optimal solution and suffers minimally from the curse of dimensionality. The algorithm consists of two…
Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase space due to their better scalability than continuum approaches with respect to dimension. Complex processes…
The random sequential adsorption of various particle shapes is studied in order to determine the influence of particle anisotropy on the saturated random packing. For all tested particles there is an optimal level of anisotropy which…
Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a…
We examine the reversible adsorption of hard spheres on a random site surface in which the adsorption sites are uniformly and randomly distributed on a plane. Each site can be occupied by one solute provided that the nearest occupied site…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
We develop a sampling scheme on the sphere that permits accurate computation of the spherical harmonic transform and its inverse for signals band-limited at $L$ using only $L^2$ samples. We obtain the optimal number of samples given by the…
Consider a system of N identical hard spherical particles moving in a d-dimensional box and undergoing elastic, possibly multi-particle, collisions. We develop a new algorithm that recovers the pre-collision state from the post-collision…
Since diffusion processes arise in so many different fields, efficient tech-nics for the simulation of sample paths, like discretization schemes, represent crucial tools in applied probability. Such methods permit to obtain approximations…
Rejection sampling methods have recently been proposed to improve the performance of discriminator-based generative models. However, these methods are only optimal under an unlimited sampling budget, and are usually applied to a generator…
We discuss two important techniques, series expansion and Monte Carlo simulation, for random sequential adsorption study. Random sequential adsorption is an idealization for surface deposition where the time scale of particle relaxation is…
Random packing of unoriented regular polygons and star polygons on a two-dimensional flat, continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine saturated random…
We propose efficient techniques for generating independent identically distributed uniform random samples inside semialgebraic sets. The proposed algorithm leverages recent results on the approximation of indicator functions by polynomials…
In this paper we present a method to generate independent samples for a general random variable, either continuous or discrete. The algorithm is an extension of the acceptance-rejection method, and it is particularly useful for kinetic…
We provide a method for approximating Bayesian inference using rejection sampling. We not only make the process efficient, but also dramatically reduce the memory required relative to conventional methods by combining rejection sampling…
We discuss historic pressure computations for the hard-disk model performed since 1953, and compare them to results that we obtain with a powerful event-chain Monte Carlo and a massively parallel Metropolis algorithm. Like other simple…
We study by Monte Carlo computer simulations random sequential adsorption (RSA) with diffusional relaxation, of lattice hard squares in two dimensions. While for RSA without diffusion the coverage approaches its maximum jamming value…
Existing solid state drive (SSD) simulators unfortunately lack hardware and/or software architecture models. Consequently, they are far from capturing the critical features of contemporary SSD devices. More importantly, while the…