Search arXivSearch

arXiv · 2510.17656

Inhomogeneous random 2-SAT

Abstract

We introduce an inhomogeneous variant of random 2-SAT. Each variable $v_1,\ldots,v_n$ is assigned a type from a state space $Λ$, independently at random. Clause inclusion is governed by a symmetric measurable kernel $W$ on $(Λ\times \{+,-\})^2$, in analogy with the inhomogeneous random graph model of Bollobás, Janson, and Riordan: given literals $\ell_i\in\{v_i,\neg v_i\}$ and $\ell_j\in\{v_j,\neg v_j\}$, the clause $\{\ell_i,\ell_j\}$ appears with probability $W(\mathrm{type}(\ell_i),\mathrm{type}(\ell_j))/(2n)$. In particular, for a variable $v_i$ of type $x\inΛ$, the slices $W((+,x),\cdot)$ and $W((-,x),\cdot)$ describe how $v_i$ and $\neg v_i$ interact with other literals. We identify a parameter $ρ^*(W)$, defined as the spectral radius of an integral operator derived from $W$, and show that $ρ^*(W)<1$ and $ρ^*(W)>1$ correspond to asymptotically almost surely satisfiable and unsatisfiable instances, respectively. The satisfiability threshold for homogeneous random 2-SAT is well-established, occurring when the ratio of clauses to variables is $1$. This corresponds to a weight function of $W \equiv 1$ and a clause density of $1/(2n)$. Our result extends this classical result to a broad class of models controlled by types of variables.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Hladký, Petr Savický. 2025-11-16. Inhomogeneous random 2-SAT. https://arxiv.org/abs/2510.17656

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO