相关论文: Tap Complexity, the Cavity Method and Supersymmetr…
The one-step replica symmetry breaking cavity method is proposed as a new tool to investigate large deviations in random graph ensembles. The procedure hinges on a general connection between negative complexities and probabilities of rare…
We consider special supersymmetry (SUSY) transformations with $m$ generators $\overleftarrow{s}_{\alpha }$ for a certain class of models and study some physical consequences of Grassmann-odd transformations which form an Abelian supergroup…
Symmetric extensions are essential in quantum mechanics, providing a lens to investigate the correlations of entangled quantum systems and to address challenges like the quantum marginal problem. Though semi-definite programming (SDP) is a…
We construct super Hamiltonian integrable systems within the theory of Supersymmetric Poisson vertex algebras (SUSY PVAs). We provide a powerful tool for the understanding of SUSY PVAs called the super master formula. We attach some Lie…
We address the problem of detecting the number of complex exponentials and estimating their parameters from a noisy signal using the Matrix Pencil (MP) method. We introduce the MP modes and present their informative spectral structure. We…
Based on the modified Thouless-Anderson-Palmer equations a detailed numerical investigation for the complexity of the Sherrington-Kirkpatrick spin glass is worked out. The data suggest a scaling law which leads to a vanishing of the…
We prove the Thouless-Anderson-Palmer (TAP) equations for the local magnetization in the multi-species Sherrington-Kirkpatrick (MSK) spin glass model. One of the key ingredients is based on concentration results established…
Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…
We study an intensity-dependent quantum Rabi model that can be written in terms of SU(1,1) group elements and is related to the Buck-Sukumar model for the Bargmann parameter $k=1/2$. The spectrum seems to present avoiding crossings for all…
MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation…
The canonical tensor rank approximation problem (TAP) consists of approximating a real-valued tensor by one of low canonical rank, which is a challenging non-linear, non-convex, constrained optimization problem, where the constraint set…
MAP is the problem of finding a most probable instantiation of a set of nvariables in a Bayesian network, given some evidence. MAP appears to be a significantly harder problem than the related problems of computing the probability of…
Neutrinoless double beta decay ($\znbb$) induced by superparticle exchange is investigated. Such a supersymmetric (SUSY) mechanism of $\znbb$ decay arises within SUSY theories with R-parity non-conservation (\rp). We consider the minimal…
A novel algebraic topology approach to supersymmetry (SUSY) and symmetry breaking in quantum field and quantum gravity theories is presented with a view to developing a wide range of physical applications. These include: controlled nuclear…
We suggest a solution to the \mu problem of gauge mediated supersymmtery breaking models based on flavor symmetries. In this scenario the \mu term arises through the vacuum expectation value of a singlet scalar field which is suppressed by…
Approximating the permanent of a complex-valued matrix is a fundamental problem with applications in Boson sampling and probabilistic inference. In this paper, we extend factor-graph-based methods for approximating the permanent of…
A partially identified model, where the parameters can not be uniquely identified, often arises during statistical analysis. While researchers frequently use Bayesian inference to analyze the models, when Bayesian inference with an…
We introduce a version of Farber's topological complexity suitable for investigating mechanical systems whose configuration spaces exhibit symmetries. Our invariant has vastly different properties to the previous approaches of Colman-Grant,…
Recent studies have examined the computational complexity of computing Shapley additive explanations (also known as SHAP) across various models and distributions, revealing their tractability or intractability in different settings.…
We analyze the CP asymmetries of $B\to \phi K$ and $B\to \eta^{(\prime)} K$ modes in the QCD improved factorization framework. For our calculation we use the phenomenological parameters predetermined from the global fit for the available…