Related papers: Analysis of the dynamical cluster approximation fo…
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small…
The minimum sum-of-squares clustering problem (MSSC), also known as $k$-means clustering, refers to the problem of partitioning $n$ data points into $k$ clusters, with the objective of minimizing the total sum of squared Euclidean distances…
Traditional clustering methods often perform clustering with low-level indiscriminative representations and ignore relationships between patterns, resulting in slight achievements in the era of deep learning. To handle this problem, we…
This paper introduces an efficient perturbed difference-of-convex algorithm (pDCA) for computing d-stationary points of an important class of structured nonsmooth difference-of-convex problems. Compared to the principal algorithms…
We have investigated electronic properties of the degenerate multi-orbital Hubbard model, in the limit of large spatial dimension. A new local model, including a doubly degenerate strongly correlated site has been introduced and solved in…
Modeling cross-sectional correlations between thousands of stocks, across countries and industries, can be challenging. In this paper, we demonstrate the advantages of using Hierarchical Principal Component Analysis (HPCA) over the classic…
This paper aims to develop new techniques to describe joint behavior of stocks, beyond regression and correlation. For example, we want to identify the clusters of the stocks that move together. Our work is based on applying Kernel…
The fabrication, utilisation, and efficiency of quantum technologies rely on a good understanding of quantum thermodynamic properties. Many-body systems are often used as hardware for these quantum devices, but interactions between…
We illustrate the scope of Time Dependent Density Functional Theory (TDDFT) for strongly correlated (lattice) models out of equilibrium. Using the exact many body time evolution, we reverse engineer the exact exchange correlation (xc)…
This paper studies clustering algorithms for dynamically evolving graphs $\{G_t\}$, in which new edges (and potential new vertices) are added into a graph, and the underlying cluster structure of the graph can gradually change. The paper…
The parquet decomposition of the self-energy into classes of diagrams, those associated with specific scattering processes, can be exploited for different scopes. In this work, the parquet decomposition is used to unravel the underlying…
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…
We discuss diagrammatic modifications to the coupled cluster doubles (CCD) equations, wherein different groups of terms out of rings, ladders, crossed-rings and mosaics can be removed to form approximations to the coupled cluster method, of…
In this work we exploit Dirac's Constraint Analysis (DCA) in Hamiltonian formalism to study different types of Superconducting Quantum Circuits (SQC) in a {\it{unified}} way. The Lagrangian of a SQC reveals the constraints, that are…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
This paper studies high-dimensional canonical correlation analysis (CCA) with an emphasis on the vectors that define canonical variables. The paper shows that when two dimensions of data grow to infinity jointly and proportionally, the…
Causal decomposition analysis (CDA) is an approach for modeling the impact of hypothetical interventions to reduce disparities. It is useful for identifying foci that future interventions, including multilevel and multimodal interventions,…
We study the $H$-convergence of nonlocal linear operators in fractional divergence form, where the oscillations of the matrices are prescribed outside the reference domain. Our compactness argument bypasses the failure of the classical…
The Boosted Difference of Convex functions Algorithm (BDCA) was recently proposed for minimizing smooth difference of convex (DC) functions. BDCA accelerates the convergence of the classical Difference of Convex functions Algorithm (DCA)…
We show how to simulate the clustering of rich clusters of galaxies using a technique based on the Zel'dovich approximation. This method well reproduces the spatial distribution of clusters obtainable from full N-body simulations at a…