Related papers: q-Overlaps in the Random Exact Cover Problem
Optimal quantization for mixed distributions has emerged as a compelling area of study. In this work, we have focused on a mixed distribution formed from two uniform distributions with partially overlapping supports. For this class of…
We consider models of Bayesian inference of signals with vectorial components of finite dimensionality. We show that, under a proper perturbation, these models are replica symmetric in the sense that the overlap matrix concentrates. The…
The upper bounds on the coverage probabilities of the confidence regions based on blockwise empirical likelihood [Kitamura (1997)] and nonstandard expansive empirical likelihood [Nordman et al. (2013)] methods for time series data are…
An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generalize this concept to "$K_t$ clique cover", i.e. a set of cliques that covers all complete subgraphs on $t$ vertices of the graph, for every $t…
The overlapping coefficient is a fundamental measure of similarity between probability distributions. While the case of two distributions has been extensively studied, extending this measure to multiple populations presents both analytical…
We propose smooth $q$-gram, the first variant of $q$-gram that captures $q$-gram pair within a small edit distance. We apply smooth $q$-gram to the problem of detecting overlapping pairs of error-prone reads produced by single molecule real…
We investigate the large deviation behavior of the overlap probability density in the Sherrington--Kirkpatrick model from several analytical perspectives. First we analyze the spin glass phase using the coupled replica scheme. Here…
For a very general class of probability distributions in disordered Ising spin systems, in the thermodynamical limit, we prove the following property for overlaps among real replicas. Consider the overlaps among s replicas. Add one replica…
We study the statistical mechanics of a model describing the coevolution of species interacting in a random way. We find that at high competition replica symmetry is broken. We solve the model in the approximation of one step replica…
We extend a recent argument of Kahn, Narayanan and Park (Proceedings of the AMS, to appear) about the threshold for the appearance of the square of a Hamilton cycle to other spanning structures. In particular, for any spanning graph, we…
A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \{ S_j \subseteq \{1,...,n\} \}$, where each subset has size $k$ and each $1 \le i \le n$ is contained in $d$ of the $S_j$. It is satisfiable if there…
Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research direction is to tackle such quadratic optimization problems…
Recent work has made substantial progress in understanding the transitions of random constraint satisfaction problems. In particular, for several of these models, the exact satisfiability threshold has been rigorously determined, confirming…
Overlap between two neural quantum states can be computed through Monte Carlo sampling by evaluating the unnormalized probability amplitudes on a subset of basis configurations. Due to the presence of probability amplitude ratios in the…
We consider the problem of constructing distribution-free prediction sets with finite-sample conditional guarantees. Prior work has shown that it is impossible to provide exact conditional coverage universally in finite samples. Thus, most…
We consider the random regular $k$-NAE-SAT problem with $n$ variables each appearing in exactly $d$ clauses. For all $k$ exceeding an absolute constant $k_0$, we establish explicitly the satisfiability threshold $d_*=d_*(k)$. We prove that…
Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements…
We continue our presentation of mathematically rigorous results about the Sherrington-Kirkpatrick mean field spin glass model. Here we establish some properties of the distribution of overlaps between real replicas. They are in full…