Related papers: Interacting Copies of Random Constraint Satisfacti…
We propose a streamlined combination scheme of the transcorrelation (TC) and coupled cluster (CC) theory, which not only increases the convergence rate with respect to the basis set, but also extends the applicability of the lowest order CC…
The problem of the relationship between entanglement and two-qubit systems in which it is embedded is central to the quantum information theory. This paper suggests that the concurrence hierarchy as an entanglement measure provides an…
Online Conformal Prediction (CP) struggles to balance temporal adaptability and structural stability. Feedback-driven methods (e.g., Adaptive Conformal Inference (ACI)) suffer from systemic marginal under-coverage and high interval variance…
In nonperturbative regimes, the superfluid instability in the two-dimensional Hubbard model can be described by an emergent BCS theory with small effective pairing constants. We compute the effective couplings using a controlled bold-line…
We study the Heisenberg $S=1/2$ chain with random ferro- and antiferromagnetic couplings using quantum Monte Carlo simulations at ultra-low temperatures, converging to the ground state. Finite-size scaling of correlation functions and…
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…
The VertexCover problem is proven to be computationally hard in different ways: It is NP-complete to find an optimal solution and even NP-hard to find an approximation with reasonable factors. In contrast, recent experiments suggest that on…
The two-dimensional attractive Hubbard model is studied in the weak to intermediate coupling regime by employing a non-perturbative approach. It is first shown that this approach is in quantitative agreement with Monte Carlo calculations…
We study the critical behavior (CB) of all period $p$-tuplings $(p \!=\!2,3,4,\dots)$ in $N$ $(N \!=\! 2,3,4,\dots)$ symmetrically coupled one-dimensional maps. We first investigate the CB for the $N=2$ case of two coupled maps, using a…
Correlations derived through single-particle approximations of the many-body problem frequently result in erroneously inflated or diminished physical properties. In the context of transition metals, the impact of correlations can be…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
We study random constraint satisfaction problems (CSPs) in the unsatisfiable regime. We relate the structure of near-optimal solutions for any Max-CSP to that for an associated spin glass on the hypercube, using the Guerra-Toninelli…
We perform a numerical study of the kinetic Blume-Capel (BC) model to find if it exhibits the metamagnetic anomalies previously observed in the kinetic Ising model for supercritical periods. We employ a heat-bath Monte Carlo (MC) algorithm…
We consider chains of random constraint satisfaction models that are spatially coupled across a finite window along the chain direction. We investigate their phase diagram at zero temperature using the survey propagation formalism and the…
We consider the problem of estimating rare event probabilities, focusing on systems whose evolution is governed by differential equations with uncertain input parameters. If the system dynamics is expensive to compute, standard sampling…
We study the phase transitions of a random copolymer chain with quenched disorder. We apply a replica variational approach based on a Gaussian trial Hamiltonian in terms of the correlation functions of monomer Fourier coordinates. This…
We consider the matching augmentation problem (MAP), where a matching of a graph needs to be extended into a $2$-edge-connected spanning subgraph by adding the minimum number of edges to it. We present a polynomial-time algorithm with an…
We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the $(d,k,t)$-model, and binary…
We demonstrate for the first time that ill-conditioned, non-smooth, constrained distributions in very high dimension, upwards of 100,000, can be sampled efficiently $\textit{in practice}$. Our algorithm incorporates constraints into the…
We introduce an ensemble Markov chain Monte Carlo approach to sampling from a probability density with known likelihood. This method upgrades an underlying Markov chain by allowing an ensemble of such chains to interact via a process in…