Related papers: Perfect simulation of the Hard Disks Model by Part…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
We present a new algorithm for the exact uniform sampling of proper \(k\)-colorings of a graph on \(n\) vertices with maximum degree~\(\Delta\). The algorithm is based on partial rejection sampling (PRS) and introduces a soft relaxation of…
This paper studies the \emph{subset sampling} problem. The input is a set $\mathcal{S}$ of $n$ records together with a function $\textbf{p}$ that assigns each record $v\in\mathcal{S}$ a probability $\textbf{p}(v)$. A query returns a random…
Consider a randomized algorithm that draws samples exactly from a distribution using recursion. Such an algorithm is called a perfect simulation, and here a variety of methods for building this type of algorithm are shown to derive from the…
Through temporal shaping of the excitation signal, the complex-frequency scattering zeros of a lossless structure can be accessed, enabling a storage-release mechanism referred to as coherent virtual absorption. Practical demonstrations of…
Many real world systems exhibit cyclic behavior that is, for example, due to the nearly harmonic oscillations being perturbed by the strong fluctuations present in the regime of significant non-linearities. For the investigation of such…
A simple and efficient algorithm of the molecular-dynamics simulation of the hard disk system based on the Event-Driven method is developed. From the analysis of algorithm, the complexity is O(log N) per 1 event, and the constant…
Assessing the validity of a real-world system with respect to given quality criteria is a common yet costly task in industrial applications due to the vast number of required real-world tests. Validating such systems by means of simulation…
We present a novel approach to Bayesian inference and general Bayesian computation that is defined through a sequential decision loop. Our method defines a recursive partitioning of the sample space. It neither relies on gradients nor…
The hard sphere model is widely used in description of fluids and solid media as a zero approximation to real systems. Despite the uniqueness of the model, few analytical results are known for it, both for the 2D and 3D cases. In present…
Likelihood-free methods, such as approximate Bayesian computation, are powerful tools for practical inference problems with intractable likelihood functions. Markov chain Monte Carlo and sequential Monte Carlo variants of approximate…
We propose a sampling method to include the negative contribution to probability density distribution in a sampling procedure. This sampling method is a universal solution for all negative probability problem and shows extraordinarily power…
Calculating one-body density profiles in equilibrium via particle-based simulation methods involves counting of events of particle occurrences at (histogram-resolved) space points. Here we investigate an alternative method based on a…
An efficient algorithm for random sequential adsorption of hard discs in two dimensions is implemented. A precise value for the coverage is obtained: theta(infty) = 0.547069. The asymptotic law theta(t) = theta(infty) - ct^{-1/2} is…
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…
In this paper, we demonstrate the efficiency of simulations via direct computation of the partition function under various macroscopic conditions, such as different temperatures or volumes. The method can compute partition functions by…
We present a new computation method for simulating reflection high-energy electron diffraction and the total-reflection high-energy positron diffraction experiments. The two experiments are used commonly for the structural analysis of…
Inverse problems involving systems of partial differential equations (PDEs) with many measurements or experiments can be very expensive to solve numerically. In a recent paper we examined dimensionality reduction methods, both stochastic…
We give an implementation of a statistical model, which can be successfully applied for compressing of a sequence of binary digits with behavior close to random.
Quantum algorithms are touted as a way around some classically intractable problems such as the simulation of quantum mechanics. At the end of all quantum algorithms is a quantum measurement whereby classical data is extracted and utilized.…