Related papers: CaSPA - an Algorithm for Calculation of the Size o…
We present an efficient and exact Monte Carlo algorithm to simulate reversible aggregation of particles with dedicated binding sites. This method introduces a novel data structure of dynamic bond tree to record clusters and sequences of…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
This paper considers the problem of minimizing an expectation function over a closed convex set, coupled with a {\color{black} functional or expectation} constraint on either decision variables or problem parameters. We first present a new…
As a model of proportion regulation in differentiation process of biological system, globally coupled activator-inhibitor systems are studied. Formation and destabilization of one and two cluster state are predicted analytically. Numerical…
Size extensivity, defined as the correct scaling of energy with system size, is a desirable property for any many-body method. Traditional CI methods are not size extensive hence the error increases as the system gets larger. Coupled…
This article proposes a new way to construct computationally efficient `wrappers' around fine scale, microscopic, detailed descriptions of dynamical systems, such as molecular dynamics, to make predictions at the macroscale `continuum'…
In this paper we study proximal conditional-gradient (CG) and proximal gradient-projection type algorithms for a block-structured constrained nonconvex optimization model, which arises naturally from tensor data analysis. First, we…
Linear response theories in the continuum capable of describing continuum spectra and dynamical correlations are presented. Our formulation is essentially the same as the continuum random-phase approximation (RPA) but suitable for uniform…
The latent block model is used to simultaneously rank the rows and columns of a matrix to reveal a block structure. The algorithms used for estimation are often time consuming. However, recent work shows that the log-likelihood ratios are…
We consider stopping criteria that balance algebraic and discretization errors for the conjugate gradient algorithm applied to high-order finite element discretizations of Poisson problems. Firstly, we introduce a new stopping criterion…
Merging galaxy clusters may provide a unique window into the behavior of dark matter and the evolution of member galaxies. To interpret these natural collider experiments we must account for how much time has passed since pericenter passage…
This paper addresses the generation expansion planning (GEP) problem, formulated as a mixed-integer linear programming model with intertemporal storage constraints. Being generally NP-hard, the problem's computational complexity grows…
We examine the hydrodynamics of a granular gas using numerical simulation. We demonstrate the appearance of shearing and clustering instabilities predicted by linear stability analysis, and show that their appearance is directly related to…
This paper studies the deflation algorithm when applied to estimate a low-rank symmetric spike contained in a large tensor corrupted by additive Gaussian noise. Specifically, we provide a precise characterization of the large-dimensional…
Chimera states in coupled oscillator systems present both spatially coherent and incoherent domains. The number and size of these domains depend on many factors like the system parameters and initial conditions. Systematic investigations of…
We describe a robust, fast, and memory-efficient procedure that can cluster millions of structures derived from molecular dynamics simulations. The essence of the method is based on a peak-picking algorithm applied to three- and…
The cumulant correlators, $C_{pq}$, are statistical quantities that generalise the better-known $S_p$ parameters; the former are obtained from the two-point probability distribution function of the density fluctuations while the latter…
We use computational modeling to investigate the assembly thermodynamics of a particle-based model for geometrically frustrated assembly, in which the local packing geometry of subunits is incompatible with uniform, strain-free large-scale…
In this presentation, we describe the GoSam (Golem/Samurai) framework for the automated computation of multi-particle scattering amplitudes at the one-loop level. The amplitudes are generated analytically in terms of Feynman diagrams, and…
Clustering algorithms are fundamental tools across many fields, with density-based methods offering particular advantages in identifying arbitrarily shaped clusters and handling noise. However, their effectiveness is often limited by the…