相关论文: Disks on a Sphere and two-dimensional Glasses
The aim of this work is to prove that it is possible to realise an optical system which produces as output a light intensity that can be expressed in the same mathematical form of the spin glass Hamiltonian. The optical system under study…
Jamming in hard-particle packings has been the subject of considerable interest in recent years. In a paper by Torquato and Stillinger [J. Phys. Chem. B, 105 (2001)], a classification scheme of jammed packings into hierarchical categories…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…
Various packing problems and simulations of hard and soft interacting particles, such as microscopic models of nematic liquid crystals, reduce to calculations of intersections and pair interactions between ellipsoids. When constrained to a…
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O(n\log n)$-time algorithm for the two-center…
The Monte Carlo evaluation of path integrals is one of a few general purpose methods to approach strongly coupled systems. It is used in all branches of Physics, from QCD/nuclear physics to the correlated electron systems. However, many…
We introduce an original approach to geometric calculus in which we define derivatives and integrals on functions which depend on extended bodies in space--that is, paths, surfaces, and volumes etc. Though this theory remains to be fully…
Successful computer studies of glass-forming materials need to overcome both the natural tendency to structural ordering and the dramatic increase of relaxation times at low temperatures. We present a comprehensive analysis of eleven…
In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…
We introduce a new Monte Carlo method by incorporating a guided distribution function to the conventional Monte Carlo method. In this way, the efficiency of Monte Carlo methods is drastically improved. To further speed up the algorithm, we…
Sphere packings are essential to the development of physical models for powders, composite materials, and the atomic structure of the liquid state. There is a strong scientific need to be able to assess the fit of packing models to data,…
An efficient simulation-based methodology is proposed for the rolling window estimation of state space models, called particle rolling Markov chain Monte Carlo (MCMC) with double block sampling. In our method, which is based on Sequential…
Column chromatography is an important process in downstream biopharmaceutical manufacturing that enables high-selectivity separation of proteins through various modalities, such as affinity, ion exchange, hydrophobic interactions, or a…
In this article, a novel cluster analysis algorithm was employed in the study of polymer coil to globule transition via single chain Monte Carlo simulations. The algorithm, which has been recently applied in Molecular Dynamics simulations…
Monte Carlo simulations of hard-sphere (HS) crystal grown on a square patterned wall under gravity have been performed. While previous simulations were performed with step-wise controlled gravity, in the present simulations constant gravity…
We study the spacial and temporal multiscale properties of complex systems. We present accelerated algorithms for dilute spin glasses and display explicitly their relation to the effective dynamics of specific collective degrees of freedom…
We derive optimal filters on the sphere in the context of detecting compact objects embedded in a stochastic background process. The matched filter and the scale adaptive filter are derived on the sphere in the most general setting,…
The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm…
In this paper, we consider the Cycle Packing problem on unit disk graphs defined as follows. Given a unit disk graph G with n vertices and an integer k, the goal is to find a set of $k$ vertex-disjoint cycles of G if it exists. Our…