Related papers: Precise algorithm to generate random sequential ad…
We describe a new, surprisingly simple algorithm, that simulates exact sample paths of a class of stochastic differential equations. It involves rejection sampling and, when applicable, returns the location of the path at a random…
Inspired by observations of beads packed on a thin string in such systems as sea-grapes and dental plaque, we study the random sequential adsorption of spheres on a cylinder. We determine the asymptotic fractional coverage of the cylinder…
Tensor networks like matrix product states (MPSs) and matrix product operators (MPOs) are powerful tools for representing exponentially large states and operators, with applications in quantum many-body physics, machine learning, numerical…
Mixed packing and covering problems are problems that can be formulated as linear programs using only non-negative coefficients. Examples include multicommodity network flow, the Held-Karp lower bound on TSP, fractional relaxations of set…
Imaging beyond the diffraction limit barrier has attracted wide attention due to the ability to resolve image features that were previously hidden. Of the various super-resolution microscopy techniques available, a particularly simple…
The kinetics of collective rearrangements in solution, such as protein folding and nanocrystal phase transitions, often involve free energy barriers that are both long and rough. Applying methods of transition path sampling to harvest…
Computer simulation was used to study the random sequential adsorption of identical discorectangles onto a continuous plane . The problem was analyzed for a wide range of discorectangle aspect ratios ($\varepsilon \in [1;100]$). We studied…
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…
We develop a new efficient sequential approximate leverage score algorithm, SALSA, using methods from randomized numerical linear algebra (RandNLA) for large matrices. We demonstrate that, with high probability, the accuracy of SALSA's…
Wavefront shaping (WFS) schemes for efficient energy deposition in weakly lossy targets is an ongoing challenge for many classical wave technologies relevant to next-generation telecommunications, long-range wireless power transfer, and…
Motivated by the recent observation of liquid glass in suspensions of ellipsoidal colloids, we examine the structure of (asymptotically) saturated RSA ellipse packings. We determine the packing fractions $\phi_{\rm s}(\alpha)$ to high…
We present a new sink particle algorithm developed for the Adaptive Mesh Refinement code RAMSES. Our main addition is the use of a clump finder to identify density peaks and their associated regions (the peak patches). This allows us to…
We provide a theoretical foundation for the statistical approach for computing the absorption properties of particles in the Rayleigh domain. We present a general method based on the Discrete Dipole Approximation (DDA) to compute the…
This paper investigates adaptive importance sampling algorithms for which the policy, the sequence of distributions used to generate the particles, is a mixture distribution between a flexible kernel density estimate (based on the previous…
Complex structures are typical in machine learning. Tailoring learning algorithms for every structure requires an effort that may be saved by defining a generic learning procedure adaptive to any complex structure. In this paper, we propose…
Porous and heterogeneous materials are found in many applications from composites, membranes, chemical reactors, and other engineered materials to biological matter and natural subsurface structures. In this work we propose an integrated…
In this paper, we introduce a new stochastic approximation (SA) type algorithm, namely the randomized stochastic gradient (RSG) method, for solving an important class of nonlinear (possibly nonconvex) stochastic programming (SP) problems.…
We extend Random Access, a fundamental operation that enables efficient search and exploration algorithms, to the modern interactive data systems based on Ranked Retrieval and Similarity Search, where orderings are dynamically defined over…
We introduce a simple and efficient lossless image compression algorithm. We store a low resolution version of an image as raw pixels, followed by several iterations of lossless super-resolution. For lossless super-resolution, we predict…
We present a number models describing the sequential deposition of a mixture of particles whose size distribution is determined by the power-law $p(x) \sim \alpha x^{\alpha-1}$, $x\leq l$ . We explicitly obtain the scaling function in the…