Related papers: Perfect simulation of the Hard Disks Model by Part…
An analytical theory for the random close packing density, $\phi_\textrm{RCP}$, of polydisperse hard disks is provided using an equilibrium model of crowding [A. Zaccone, Phys. Rev. Lett. 128, 028002 (2022)] which has been justified on the…
The efficiency of Hamiltonian Monte Carlo (HMC) can suffer when sampling a distribution with a wide range of length scales, because the small step sizes needed for stability in high-curvature regions are inefficient elsewhere. To address…
We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for…
We present the first feasible method for sampling a dynamic data stream with deletions, where the sample consists of pairs $(k,C_k)$ of a value $k$ and its exact total count $C_k$. Our algorithms are for both Strict Turnstile data streams…
The Metropolis-Hastings (MH) algorithm is the prototype for a class of Markov chain Monte Carlo methods that propose transitions between states and then accept or reject the proposal. These methods generate a correlated sequence of random…
We review the derivation of the Kac master equation model for random collisions of particles, its relationship to the Poisson process, and existing algorithms for simulating values from the marginal distribution of velocity for a single…
Hard spheres are a central and important model reference system for both homogeneous and inhomogeneous fluid systems. In this paper we present new high-precision molecular-dynamics computer simulations for a hard sphere fluid at a planar…
Grid-based magnetohydrodynamic (MHD) simulations have proven invaluable for the study of astrophysical accretion disks. However, the fact that angular momentum transport in disks is mediated by MHD turbulence (with structure down to very…
Inference for statistics of a stationary time series often involve nuisance parameters and sampling distributions that are difficult to estimate. In this paper, we propose the method of orthogonal samples, which can be used to address some…
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…
We introduce a method to sample the orientational distribution function in computer simulations. The method is based on the exact torque balance equation for classical many-body systems of interacting anisotropic particles in equilibrium.…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
Given a vector $x \in \mathbb{R}^n$ induced by a turnstile stream $S$, a non-negative function $G: \mathbb{R} \to \mathbb{R}$, a perfect $G$-sampler outputs an index $i$ with probability $\frac{G(x_i)}{\sum_{j\in[n]}…
In the context of state-space models, skeleton-based smoothing algorithms rely on a backward sampling step which by default has a $\mathcal O(N^2)$ complexity (where $N$ is the number of particles). Existing improvements in the literature…
The problem of steady-state accretion to nonrotating black holes is examined. Advection is included and generalized formulas for the radiation pressure in both the optically thick and thin cases are used. Special attention is devoted to…
With the aim of generalizing histogram statistics to higher dimensional cases, density estimation via discrepancy based sequential partition (DSP) has been proposed to learn an adaptive piecewise constant approximation defined on a binary…
Simulating from a gamma distribution with small shape parameter is a challenging problem. Towards an efficient method, we obtain a limiting distribution for a suitably normalized gamma distribution when the shape parameter tends to zero.…
We present a model of one-dimensional irreversible adsorption in which particles once adsorbed immediately shrink to a smaller size or expand to a larger size. Exact solutions for the fill factor and the particle number variance as a…
For a set $P$ of $n$ points in the plane and a value $r > 0$, the unit-disk range reporting problem is to construct a data structure so that given any query disk of radius $r$, all points of $P$ in the disk can be reported efficiently. We…
Tensor completion exhibits an interesting computational-statistical gap in terms of the number of samples needed to perform tensor estimation. While there are only $\Theta(tn)$ degrees of freedom in a $t$-order tensor with $n^t$ entries,…