Related papers: Interlaced coarse-graining for the dynamic cluster…
This paper describes the incremental behaviours of Density based clustering. It specially focuses on the Density Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm and its incremental approach.DBSCAN relies on a density…
Coarse-grained models have proven helpful for simulating complex systems over long timescales to provide molecular insights into various processes. Methodologies for systematic parameterization of the underlying energy function, or force…
This paper introduces a novel ansatz-based technique for solution of the Hubbard model over two length scales. Short range correlations are treated exactly using a dynamical cluster approximation QMC simulation, while longer-length-scale…
AI-enabled precision medicine promises a transformational improvement in healthcare outcomes by enabling data-driven personalized diagnosis, prognosis, and treatment. However, the well-known "curse of dimensionality" and the clustered…
Clustering algorithms have long been the topic of research, representing the more popular side of unsupervised learning. Since clustering analysis is one of the best ways to find some clarity and structure within raw data, this paper…
In many far-from-equilibrium biological systems, energy injected by irreversible processes at microscopic scales propagates to larger scales to fulfill important biological functions. But given dissipative dynamics at the microscale, how…
Lossy data transformations by definition lose information. Yet, in modern machine learning, methods like data pruning and lossy data augmentation can help improve generalization performance. We study this paradox using a solvable model of…
Gaussian Graphical Models (GGMs) are widely used in high-dimensional data analysis to synthesize the interaction between variables. In many applications, such as genomics or image analysis, graphical models rely on sparsity and clustering…
The effect of Coulomb correlations in the half-filled Hubbard model of the honeycomb lattice is studied within the dynamical cluster approximation (DCA) combined with exact diagonalization (ED) and continuous-time quantum Monte Carlo (QMC).…
Strongly correlated fermionic systems are of great interest in condensed matter physics and numerical methods are indispensable tools for their study. However, existing approaches such as exact diagonalization (ED) and stochastic quantum…
We consider the problem of coarse-graining in the context of finite-volume fluid models. If a variable is defined on a high-resolution grid it may be coarse-grained so that it is defined on a grid of lower resolution. In general this will…
Modularity is one of the most widely used quality measures for graph clusterings. Maximizing modularity is NP-hard, and the runtime of exact algorithms is prohibitive for large graphs. A simple and effective class of heuristics coarsens the…
We study the effect of coarse-graining the dynamics of a pressureless selfgravitating fluid (coarse-grained dust) in the context of cosmological perturbation theory, both in the Eulerian und Lagrangian framework. We obtain recursion…
We connect the problem of semi-supervised clustering to constrained Markov aggregation, i.e., the task of partitioning the state space of a Markov chain. We achieve this connection by considering every data point in the dataset as an…
Clustering is a fundamental primitive in unsupervised learning which gives rise to a rich class of computationally-challenging inference tasks. In this work, we focus on the canonical task of clustering d-dimensional Gaussian mixtures with…
We demonstrate that numerical linked cluster expansions (NLCE) yield a powerful approach to calculate time-dependent correlation functions for quantum many-body systems in one dimension. As a paradigmatic example, we study the dynamics of…
We present the conceptual and technical background required to describe and understand the correlations and fluctuations of the empirical density and current of steady-state diffusion processes on all time scales -- observables central to…
High-dimensional recordings of dynamical processes are often characterized by a much smaller set of effective variables, evolving on low-dimensional manifolds. Identifying these latent dynamics requires solving two intertwined problems:…
Motivated by the understanding of holography as realized in tensor networks, we develop a bulk procedure that can be interpreted as generating a sequence of coarse-grained holographic states. The coarse-graining procedure involves…
Cluster analysis plays an important role in decision making process for many knowledge-based systems. There exist a wide variety of different approaches for clustering applications including the heuristic techniques, probabilistic models,…