Related papers: Perfect simulation of the Hard Disks Model by Part…
For sink-free orientations in graphs of minimum degree at least $3$, we show that there is a deterministic approximate counting algorithm that runs in time $O((n^{73}/\varepsilon^{72})\log(n/\varepsilon))$, a near-linear time sampling…
This paper introduces a framework for simulating finite dimensional representations of (jump) diffusion sample paths over finite intervals, without discretisation error (exactly), in such a way that the sample path can be restored at any…
The method, proposed in \cite{Za22} to derive the densest packing fraction of random disc and sphere packings, is shown to yield in two dimensions too high a value that (i) violates the very assumption underlying the method and (ii)…
Purpose - This paper continues the development of a comprehensive methodology for fully resolved numerical simulations of fusion deposition modeling. Design/methodology/approach - A front-tracking/finite volume method introduced in Part I…
Naive approaches to amortized inference in probabilistic programs with unbounded loops can produce estimators with infinite variance. This is particularly true of importance sampling inference in programs that explicitly include rejection…
We present a performance analysis of the DiskMass Survey. The survey uses collisionless tracers in the form of disk stars to measure the surface-density of spiral disks, to provide an absolute calibration of the stellar mass-to-light ratio,…
Dynamical simulations are a fundamental tool for studying the secular evolution of disc galaxies. Even at their maximum resolution, they still follow a limited number of particles and typically resolve scales of the order of a few tens of…
In this paper, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis of gaps in such disk sets. This analysis is the basis for maximal and adaptive sampling in Euclidean space and on…
We propose a new type of effective densities via the potential distribution theorem. These densities are for the sake of enabling the mapping of the free energy of a uniform fluid onto that of a nonuniform fluid. The potential distribution…
We propose a simple and accurate approach to estimate the random close packing (RCP) fraction of binary hard-disk mixtures. By introducing a parameter based on the mixture's reduced third virial coefficient -- which effectively captures…
We present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss networks. We use a variation of Dominated Coupling From The Past for which we simulate a…
We provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that any set of (not necessarily equal) disks of total area…
The accuracy and robustness of a simple method to estimate the total mass profile of a galaxy is tested using a sample of 65 cosmological zoom-simulations of individual galaxies. The method only requires information on the optical surface…
We study the optimal design problems where the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector in $d$ dimensions. We study the $A$-optimal design variant where the objective is to…
In this article, we develop efficient sampling algorithms for random surjections from $[n]$ to $[k]$ for all $n \geq k$. We make no assumption about $n$ and $k$. In particular, we do not make the common assumption that the ratio…
We give a algorithm for exact sampling from the Bingham distribution $p(x)\propto \exp(x^\top A x)$ on the sphere $\mathcal S^{d-1}$ with expected runtime of $\operatorname{poly}(d, \lambda_{\max}(A)-\lambda_{\min}(A))$. The algorithm is…
For large-scale point cloud processing, resampling takes the important role of controlling the point number and density while keeping the geometric consistency. % in related tasks. However, current methods cannot balance such different…
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…
Monte Carlo methods are often necessary for the implementation of optimal Bayesian estimators. A fundamental technique that can be used to generate samples from virtually any target probability distribution is the so-called rejection…
Random sequential adsorption (RSA) models have been studied due to their relevance to deposition processes on surfaces. The depositing particles are represented by hard-core extended objects; they are not allowed to overlap. Numerical Monte…