Related papers: Rejection-free cluster Wang-Landau algorithm for h…
We propose a structure-preserving model-reduction methodology for large-scale dynamic networks with tightly-connected components. First, the coherent groups are identified by a spectral clustering algorithm on the graph Laplacian matrix…
Local graph clustering methods aim to detect small clusters in very large graphs without the need to process the whole graph. They are fundamental and scalable tools for a wide range of tasks such as local community detection, node ranking…
A simple ``brute-force'' parallelisation procedure for the computational implementation of high-order coupled cluster method (CCM) calculations is presented here. This approach is investigated and illustrated by an application of high-order…
We advocate Laplacian K-modes for joint clustering and density mode finding, and propose a concave-convex relaxation of the problem, which yields a parallel algorithm that scales up to large datasets and high dimensions. We optimize a tight…
Non-binary (NB) low-density parity-check (LDPC) codes are graph-based codes that are increasingly being considered as a powerful error correction tool for modern dense storage devices. The increasing levels of asymmetry incorporated by the…
Cluster deletion is an NP-hard graph clustering objective with applications in computational biology and social network analysis, where the goal is to delete a minimum number of edges to partition a graph into cliques. We first provide a…
This study introduces a systematic approach for analyzing strongly correlated systems by adapting the conventional quantum cluster method to a quantum circuit model. We have developed a more concise formula for calculating the cluster's…
In this paper we study lattice rules which are cubature formulae to approximate integrands over the unit cube $[0,1]^s$ from a weighted reproducing kernel Hilbert space. We assume that the weights are independent random variables with a…
We present an unsupervised data processing workflow that is specifically designed to obtain a fast conformational clustering of long molecular dynamics simulation trajectories. In this approach we combine two dimensionality reduction…
We study graph clustering in the Stochastic Block Model (SBM) in the presence of both large clusters and small, unrecoverable clusters. Previous convex relaxation approaches achieving exact recovery do not allow any small clusters of size…
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…
Searches for continuous gravitational waves target nearly monochromatic gravitational wave emission from e.g. non-axysmmetric fast-spinning neutron stars. Broad surveys often require to explicitly search for a very large number of different…
Monte Carlo algorithms such as the Wang-Landau algorithm and similar `entropic' methods are able to accurately sample the density of states of model systems and thereby give access to thermal equilibrium properties at any temperature.…
A high-performance implementation of a multiphase lattice Boltzmann method based on the conservative Allen-Cahn model supporting high-density ratios and high Reynolds numbers is presented. Metaprogramming techniques are used to generate…
We propose an efficient approach to accurately finding the ground-state structures in alloys based on the cluster expansion method. In this approach, a small number of candidate ground-state structures are obtained without any information…
In this work, we systematically assess the performance of a new method from [H. Shah et al., Phys. Rev. C 113, L012201] for locating the QCD critical point using constant-entropy contours by testing it against various effective QCD…
This paper presents a new approach to non-parametric cluster analysis called Adaptive Weights Clustering (AWC). The idea is to identify the clustering structure by checking at different points and for different scales on departure from…
We study the $k$-NN hard core lattice gas model in which the first $k$ next nearest neighbor sites of a particle are excluded from occupation by other particles on a two dimensional square lattice. This model is the lattice version of the…
We examine the reversible adsorption of hard spheres on a random site surface in which the adsorption sites are uniformly and randomly distributed on a plane. Each site can be occupied by one solute provided that the nearest occupied site…
The physics programme of the LHCb experiment at the Large Hadron Collider requires an efficient and precise reconstruction of the particle collision vertices. The LHCb Upgrade detector relies on a fully software-based trigger with an online…