Related papers: q-Overlaps in the Random Exact Cover Problem
The goal in the stochastic vertex cover problem is to obtain an approximately minimum vertex cover for a graph $G^\star$ that is realized by sampling each edge independently with some probability $p\in (0, 1]$ in a base graph $G = (V, E)$.…
The threshold behaviour of the K-Satisfiability problem is studied in the framework of the statistical mechanics of random diluted systems. We find that at the transition the entropy is finite and hence that the transition itself is due to…
We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…
We propose a new method for simulating QCD at finite density. The method is based on a general factorization property of distribution functions of observables, and it is therefore applicable to any system with a complex action. The…
We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…
We comment on recent numerical experiments by G.Hed and E.Domany [cond-mat/0608535v2] on the quenched equilibrium state of the Edwards-Anderson spin glass model. The rigorous proof of overlap identities related to replica equivalence shows…
The overlap measurement scheme accomplishes to evaluate the overlap of two input quantum states by only measuring an introduced auxiliary qubit, irrespective of the complexity of the two input states. We find a counterintuitive phenomenon…
A classical problem in statistics is estimating the expected coverage of a sample, which has had applications in gene expression, microbial ecology, optimization, and even numismatics. Here we consider a related extension of this problem to…
Conformal Prediction methods have finite-sample distribution-free marginal coverage guarantees. However, they generally do not offer conditional coverage guarantees, which can be important for high-stakes decisions. In this paper, we…
In this work spontaneous (non-dynamical) breaking (effective hiding) of the unitary quantum mechanical dynamical symmetry (superposition) is considered. It represents an especial but very interesting case of the general formalism of the…
This paper proposes an easy-to-compute upper bound for the overlap index between two probability distributions without requiring any knowledge of the distribution models. The computation of our bound is time-efficient and memory-efficient…
For all $k \geq 1$, we show that deciding whether a graph is $k$-planar is NP-complete, extending the well-known fact that deciding 1-planarity is NP-complete. Furthermore, we show that the gap version of this decision problem is…
Many NP-complete constraint satisfaction problems appear to undergo a "phase transition'' from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds…
In this paper, we prove a novel trace inequality involving two operators. As applications, we sharpen the one-shot achievability bound on the relative entropy error in a wealth of quantum covering-type problems, such as soft covering,…
In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upper-bound [17,5,11,8]. In this paper, we introduce the $\Pi$-Packing with $\alpha()$-Overlap problem to allow for…
A random overlap structure (ROSt) is a measure on pairs (X,Q) where X is a locally finite sequence in the real line with a maximum and Q a positive semidefinite matrix of overlaps intrinsic to the particles X. Such a measure is said to be…
In order to study certain questions concerning the distribution of the overlap in Sherrington--Kirkpatrick type models, such as the chaos and ultrametricity problems, it seems natural to study the free energy of multiple systems with…
We discuss interfaces in spin glasses. We present new theoretical results and a numerical method to characterize overlap interfaces and the stability of the spin-glass phase in extended disordered systems. We use this definition to…
The $k$-ExactCover problem is a parameterized version of the ExactCover problem, in which we are given a universe $U$, a collection $S$ of subsets of $U$, and an integer $k$, and the task is to determine whether $U$ can be partitioned into…
We study bootstrap inference for the $k$th largest coordinate of a normalized sum of independent high-dimensional random vectors. Existing second-order theory for maxima does not directly extend to order statistics, because the event…