English
Related papers

Related papers: Instability of one-step replica-symmetry-broken ph…

200 papers

We introduce a highly structured family of hard satisfiable 3-SAT formulas corresponding to an ordered spin-glass model from statistical physics. This model has provably "glassy" behavior; that is, it has many local optima with large energy…

Statistical Mechanics · Physics 2012-10-19 Haixia Jia , Cristopher Moore , Bart Selman

We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…

Discrete Mathematics · Computer Science 2012-02-06 Harold Connamacher , Michael Molloy

In this paper we show that the performance of the quantum adiabatic algorithm is determined by phase transitions in underlying problem in the presence of transverse magnetic field $\Gamma$. We show that the quantum version of random…

Disordered Systems and Neural Networks · Physics 2007-05-23 S. Knysh , V. N. Smelyanskiy

The integration of Inverter-Based Resource (IBR) model into phasor-domain short circuit (SC) solvers challenges their numerical stability. To address the challenge, this paper proposes a solver that improves numerical stability by employing…

Systems and Control · Electrical Eng. & Systems 2024-11-20 Aboutaleb Haddadi , Evangelos Farantatos , Ilhan Kocar

Since the early 2000s physicists have developed an ingenious but non-rigorous formalism called the cavity method to put forward precise conjectures on phase transitions in random problems [Mezard, Parisi, Zecchina: Science 2002]. The cavity…

Combinatorics · Mathematics 2018-11-02 Amin Coja-Oghlan , Konstantinos Panagiotou

Random constraint satisfaction problems (CSPs) are known to exhibit threshold phenomena: given a uniformly random instance of a CSP with $n$ variables and $m$ clauses, there is a value of $m = \Omega(n)$ beyond which the CSP will be…

Data Structures and Algorithms · Computer Science 2016-11-07 Prasad Raghavendra , Satish Rao , Tselil Schramm

Reduction of frustration was the driving force in an approach to social balance as it was recently considered by Antal \emph{et al.} [ T. Antal, P. L. Krapivsky, and S. Redner, Phys. Rev. E {\bf 72}, 036121 (2005). ]. We generalize their…

Physics and Society · Physics 2008-11-18 Filippo Radicchi , Daniele Vilone , Sooeyon Yoon , Hildegard Meyer-Ortmanns

We focus on the random generation of SAT instances that have properties similar to real-world instances. It is known that many industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable…

Computational Complexity · Computer Science 2023-03-14 Carlos Ansótegui , Maria Luisa Bonet , Jordi Levy

The random k-SAT instances undergo a "phase transition" from being generally satisfiable to unsatisfiable as the clause number m passes a critical threshold, $r_k n$. This causes a drastic reduction in the number of satisfying assignments,…

Quantum Physics · Physics 2024-11-05 Mingyou Wu

We study the replica symmetry breaking (RSB) in the Gaussian Unitary Ensemble (GUE) random matrix model. We find that the RSB occurs at the transition temperature $T_{\text{RSB}}\sim N^{-2/3}$ in the large $N$ limit. We argue that this…

High Energy Physics - Theory · Physics 2020-02-13 Kazumi Okuyama

Corroborating a prediction from statistical physics, we prove that the Belief Propagation message passing algorithm approximates the partition function of the random $k$-SAT model well for all clause/variable densities and all inverse…

Probability · Mathematics 2020-11-24 Amin Coja-Oghlan , Noëla Müller , Jean B. Ravelomanana

Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking predicates (SBPs) is a well-known, often effective, technique…

Artificial Intelligence · Computer Science 2008-12-18 Joao Marques-Silva , Ines Lynce , Vasco Manquinho

Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear…

Combinatorics · Mathematics 2022-07-28 Peter Ayre , Amin Coja-Oghlan , Pu Gao , Noëla Müller

Phase retrieval refers to the problem of recovering some signal (which is often modelled as an element of a Hilbert space) from phaseless measurements. It has been shown that in the deterministic setting phase retrieval from frame…

Numerical Analysis · Mathematics 2021-11-11 Rima Alaifari , Matthias Wellershoff

Phase transition is an important feature of SAT problem. For random k-SAT model, it is proved that as r (ratio of clauses to variables) increases, the structure of solutions will undergo a sudden change like satisfiability phase transition…

Artificial Intelligence · Computer Science 2007-05-23 Ke Xu , Wei Li

We apply statistical mechanics to an inverse problem of linear mapping to investigate the physics of the irreversible compression. We use the replica symmetry breaking (RSB) technique with a toy model to demonstrate the Shannon's result.…

Disordered Systems and Neural Networks · Physics 2009-11-07 Tatsuto Murayama , Masato Okada

The planetary restricted three-body problem (RTBP) is considered. The primary mass M is much more than another masses mj, i=1..N, which revolve around M. The massless probe particle m moves on elliptic orbit, is perturbed by mj. It is well…

Dynamical Systems · Mathematics 2007-05-23 A. E. Rosaev

We describe a novel method which allows the treatment of high orders of replica-symmetry-breaking (RSB) at low temperatures as well as at T=0 directly, without a need for approximations or scaling assumptions. It yields the low temperature…

Disordered Systems and Neural Networks · Physics 2013-05-29 Manuel J. Schmidt , Reinhold Oppermann

We study the problem of \emph{robust satisfiability} of systems of nonlinear equations, namely, whether for a given continuous function $f:\,K\to\mathbb{R}^n$ on a~finite simplicial complex $K$ and $\alpha>0$, it holds that each function…

Computational Complexity · Computer Science 2014-02-05 Peter Franek , Marek Krcal

The problem of reconstructing a function from the magnitudes of its frame coefficients has recently been shown to be never uniformly stable in infinite-dimensional spaces [5]. This result also holds for frames that are possibly continuous…

Functional Analysis · Mathematics 2020-09-03 Rima Alaifari , Philipp Grohs
‹ Prev 1 3 4 5 6 7 10 Next ›