English
Related papers

Related papers: Perfect simulation of the Hard Disks Model by Part…

200 papers

We present a new, simple, fast algorithm to numerically evolve disks of inelastically colliding particles surrounding a central star. Our algorithm adds negligible computational cost to the fastest existing collisionless N-body codes, and…

Astrophysics · Physics 2008-11-26 Yoram Lithwick , Eugene Chiang

We study the following basic machine learning task: Given a fixed set of $d$-dimensional input points for a linear regression problem, we wish to predict a hidden response value for each of the points. We can only afford to attain the…

Machine Learning · Computer Science 2018-06-07 Michał Dereziński , Manfred K. Warmuth

We investigate the problem of testing the global null in the high-dimensional regression models when the feature dimension $p$ grows proportionally to the number of observations $n$. Despite a number of prior work studying this problem,…

Methodology · Statistics 2020-10-06 Yue Li , Ilmun Kim , Yuting Wei

In this work, a numerical simulation of 1D Burgers' equation is developed using finite difference method and a reduced order model (ROM) of the simulation is developed using proper orthogonal decomposition (POD). The objective of this work…

Numerical Analysis · Mathematics 2023-03-14 Neelakantan Padmanabhan

Direct sampling of multi-dimensional systems with quantum Monte Carlo methods allows exact account of many-body effects or particle correlations. The most straightforward approach to solve the Schr\"odinger equation, Diffusion Monte Carlo,…

Quantum Physics · Physics 2017-09-07 Ilkka Ruokosenmäki , Tapio T. Rantala

We develop a hybrid Monte Carlo method to efficiently compute the physical observables from the samplings of the Laughlin and the Moore-Read wave functions of fractional quantum Hall (FQH) systems. With the advancements in methodology,…

Strongly Correlated Electrons · Physics 2026-02-20 Ting-Tung Wang , Ha Quang Trung , Qianhui Xu , Min Long , Bo Yang , Zi Yang Meng

We study the problem of sampling weighted partial triangulations of a convex polygon. We consider the distribution where each partial triangulation $\sigma$ is chosen with probability proportional to $\lambda^{|\sigma|}$, where $\lambda>0$…

Discrete Mathematics · Computer Science 2026-05-22 Antonio Blanca , Alexandre Stauffer , Izabella Stuhl

We investigate the compression of quantum information with respect to a given set $\mathcal{M}$ of high-dimensional measurements. This leads to a notion of simulability, where we demand that the statistics obtained from $\mathcal{M}$ and an…

An important challenge with the current generation of noisy, large-scale quantum computers is the question of validation. Does the hardware generate correct answers? If not, what are the errors? This issue is often combined with questions…

Quantum Physics · Physics 2025-07-11 Alexander S. Dellios , Margaret D. Reid , Peter D. Drummond

Irreversible adsorption of spheres on flat collectors having dimension $d<2$ is studied. Molecules are adsorbed on Sierpinski's Triangle and Carpet like fractals ($1<d<2$), and on General Cantor Set ($d<1$). Adsorption process is modeled…

Materials Science · Physics 2012-08-02 Michal Ciesla , Jakub Barbasz

This paper deals with the problem of efficient sampling from a stochastic differential equation, given the drift function and the diffusion matrix. The proposed approach leverages a recent model for probabilities \cite{rudi2021psd} (the…

Machine Learning · Statistics 2023-05-25 Anant Raj , Umut Şimşekli , Alessandro Rudi

The operation of a novel nonvolatile memory device based on a conductive ferroelectric/non-ferroelectric thin film multilayer stack is simulated numerically. The simulation involves the self-consistent steady state solution of Poisson's…

Materials Science · Physics 2007-05-23 Rene Meyer , Hermann Kohlstedt

The diffusion of particles trapped in long narrow channels occurs predominantly in one dimension. Here, molecular dynamics simulation is used to study the inertial dynamics of two-dimensional hard disks, confined to long, narrow,…

Soft Condensed Matter · Physics 2020-02-05 Mahdi Zarif , Richard K. Bowles

Precision measurements of the large scale structure of the Universe require large numbers of high fidelity mock catalogs to accurately assess, and account for, the presence of systematic effects. We introduce and test a scheme for…

Cosmology and Nongalactic Astrophysics · Physics 2016-06-01 Tomomi Sunayama , Nikhil Padmanabhan , Katrin Heitmann , Salman Habib , Esteban Rangel

The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…

In this paper, we present near-optimal space bounds for Lp-samplers. Given a stream of updates (additions and subtraction) to the coordinates of an underlying vector x \in R^n, a perfect Lp sampler outputs the i-th coordinate with…

Data Structures and Algorithms · Computer Science 2010-12-23 Hossein Jowhari , Mert Sağlam , Gábor Tardos

A robust method to handle vacuum and near vacuum regions in hybrid simulations for space and astrophysical plasmas is presented. The conventional hybrid simulation model dealing with kinetic ions and a massless charge-neutralizing electron…

Plasma Physics · Physics 2015-06-22 Takanobu Amano , Katsuaki Higashimori , Keisuke Shirakawa

The Ho-Kalman algorithm has been widely employed for the identification of discrete-time linear time-invariant (LTI) systems. In this paper, we investigate the pole estimation error for the Ho-Kalman algorithm based on finite input/output…

Systems and Control · Electrical Eng. & Systems 2025-08-20 Shuai Sun , Xu Wang

Wave propagation in coherently absorbing disordered media is generally modeled by adding a complex part to the real part of the potential. In such a case, it is already understood that the complex potential plays a duel role; it acts as an…

Mesoscale and Nanoscale Physics · Physics 2007-05-23 Prabhakar Pradhan

Given a set of $n$ points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-hard and several approximation…

Computational Geometry · Computer Science 2022-05-05 Rachel Friederich , Matthew Graham , Anirban Ghosh , Brian Hicks , Ronald Shevchenko