--- title: Threshold-2 Rule Overview url: https://www.emergentmind.com/topics/threshold-2-rule type: topic --- # Threshold-2 Rule Overview Searching arXiv for recent papers on "Threshold-2 Rule" and closely related uses across fields. {"query":"\"Threshold-2\" rule arXiv cellular automata threshold semiorder bootstrap percolation", "max_results": 10} {"query":"2507.14569", "max_results": 5} {"query":"1702.06614", "max_results": 5} The expression **Threshold-2 Rule** is not uniform across the contemporary arXiv literature. In one recent line of work it denotes a nontrivial update rule for two-dimensional threshold cellular automata on a torus with the von-Neumann neighborhood, where stable configurations are structurally characterizable and testable with query complexity independent of the configuration size and quadratic in $1/\epsilon$ [2507.14569]. In other literatures, the same phrase or a closely related one refers to the case $r=2$ in threshold diffusion and bootstrap percolation, to the upper threshold $t_2$ in double-threshold preference models, to the upper AI cut-point $T_2$ in rule-in diagnostics, or to a 2-input threshold gate in molecular computation. The common idea is a transition triggered by crossing a specified level, but the underlying state spaces, dynamics, and semantics differ substantially. ## 1. Terminological scope A useful way to read the term is as a family resemblance rather than a single formal object. In all of the settings below, “threshold-2” marks a boundary at which qualitative behavior changes: activation by two neighbors, preference above an upper uncertainty boundary, automatic rule-in above a second diagnostic cut-point, or logical output $1$ when both binary inputs are present. | Domain | Meaning of “Threshold-2” | Representative source | |---|---|---| | Two-dimensional cellular automata | A threshold rule on the von-Neumann neighborhood with nontrivial stable configurations | [2507.14569] | | Threshold diffusion / bootstrap percolation | A node becomes blue once it has at least two blue neighbors | [1905.06896] | | Double-threshold semiorders | The upper threshold $t_2$ above which preference is mandatory | [1702.06614] | | Two-threshold diagnostics | The upper cut-point $T_2 \equiv T_A^{ri}$ for automatic rule-in | [2604.23463] | | Step chemical reaction networks | A 2-input threshold-2 gate implementing logical AND | [2405.00940] | A recurring misconception is to treat these as notational variants of one model. The sources instead use the phrase for distinct constructs: a local update rule in dynamical systems, a pairwise-comparison rule in preference theory, a decision threshold in statistical diagnosis, and a gate specification in unconventional computation. This suggests that any technical use of the term must be interpreted with its ambient model class. ## 2. Two-dimensional threshold cellular automata In the cellular-automaton setting, configurations evolve on a **two-dimensional torus** according to threshold rules with respect to the **von-Neumann neighborhood**. The paper distinguishes trivial and nontrivial stability regimes: stable configurations for **Threshold-1 (OR)** and **Threshold-5 (AND)** are trivial, whereas **Threshold-2**, **Threshold-4**, and **Threshold-3 (Majority)** exhibit more diverse behaviors [2507.14569]. The principal results reported for Threshold-2 are structural and algorithmic. First, the work characterizes the structure of stable configurations with respect to the Threshold-2 rule. Second, it designs and analyzes a testing algorithm that distinguishes between configurations that are stable with respect to the Threshold-2 rule and those that are $\epsilon$-far from any stable configuration. The stated query complexity is independent of the size of the configuration and depends quadratically on $1/\epsilon$ [2507.14569]. Within the threshold-cellular-automata taxonomy, Threshold-2 therefore occupies the first nontrivial regime beyond the degenerate OR case. A plausible implication is that the combinatorics of local support patterns, rather than merely all-zero or all-one fixed points, controls stability. The abstract also places Threshold-2 near Threshold-4 and opposite Threshold-3 (Majority), indicating a broader classification program for nontrivial fixed-point structure on the torus. ## 3. The $r=2$ threshold model on graphs In graph dynamics, the Threshold-2 rule appears as the special case $r=2$ of a monotone threshold process or bootstrap percolation. For an $n$-vertex graph $G=(V,E)$ and initial blue set $B_0 \subseteq V$, the evolution is \[ B_{t+1} = B_t \cup \{\, v \notin B_t : |N(v)\cap B_t| \ge 2 \,\}, \qquad t=0,1,2,\dots. \] Blue vertices never turn red, the process stabilizes in at most $n$ steps, and a **target set** (or **dynamic monopoly**) is a set $T\subseteq V$ such that starting from $B_0=T$ one eventually reaches $V$ [1905.06896]. The minimum size of such a set is \[ m^*(2;G)=\min\{|T|:T\text{ is a 2-threshold target set in }G\}. \] For a $d$-regular graph with second-largest normalized eigenvalue $\sigma<1$, the analysis relies on the Expander–Mixing Lemma and yields a target-set bound of order $O(n/d)$. Specializing the general result of Zehmakan to $r=2$, one sets \[ \beta = \frac{2}{(1-\sigma)d}, \] and obtains \[ m^*(2;G)\le 2\beta n+\frac1\beta = \frac{4n}{(1-\sigma)d}+\frac{(1-\sigma)d}{2} = O\!\left(\frac{n}{d}\right). \] The proof sketch proceeds by first finding a stable set $S$ with $\beta n\le |S|\le 2\beta n+1/\beta$, where every vertex in $S$ has at least two neighbors in $S$, and then using mixing to force one-by-one growth until all vertices become blue [1905.06896]. For random graph models, the same threshold-2 activation rule yields asymptotic regimes tied to expansion. In the uniform random $d$-regular graph $\mathcal G_{n,d}$, Friedman’s theorem gives \[ \sigma(\mathcal G_{n,d})\le \frac{2}{\sqrt d} \quad \text{a.a.s.}, \] hence \[ m^*(2;\mathcal G_{n,d}) = O\!\left(\frac{n}{d}\right) \quad \text{a.a.s.} \] In Erdős–Rényi graphs $G(n,p)$ with \[ p=\omega\!\left(\frac{\log n}{n}\right), \] the same method yields \[ m^*(2;G(n,p)) = O\!\left(\frac1p\right) \qquad \text{a.a.s.} \] and below the connectivity threshold $p\approx (\log n)/n$, no small seed set can infect the whole graph [1905.06896]. Here Threshold-2 has an exact combinatorial meaning: a vertex activates as soon as it acquires two active neighbors. This is distinct from Majority dynamics and from non-monotone cellular automata, even though all are threshold systems. ## 4. Double-threshold semiorders and digraphs In preference theory, the relevant object is not a two-neighbor activation rule but a **double-threshold** relation with lower threshold $t_1$ and upper threshold $t_2$. Each element $x$ is assigned a utility value $\alpha(x)$, with $0\le t_1\le t_2$, and preference is defined by three regions: - if $\alpha(y)-\alpha(x)t_2$, then $y$ is preferred to $x$. The corresponding directed graph is a **double threshold digraph**. A satisfying assignment $\alpha$ for thresholds $(t_1,t_2)$ must satisfy the system of linear constraints \[ \text{for every directed edge }(u\to v):\quad \alpha(v)-\alpha(u)\ge t_1, \] \[ \text{for every unordered non-adjacent pair }\{u,v\}:\quad \alpha(v)-\alpha(u)\le t_2. \] The upper boundary $t_2$ is therefore the “threshold-2” of the model: above it, preference is mandatory; below $t_1$, preference is forbidden; between them lies an uncertainty band [1702.06614]. This formulation generalizes semiorders and allows controlled nontransitivity while remaining acyclic. Every directed acyclic graph is a double threshold graph for sufficiently large ratio \[ r=t_2/t_1. \] The key invariant is \[ \lambda(G)=\min \{t_2/t_1:\ G \text{ admits a satisfying } \alpha\}. \] The paper characterizes $\lambda(G)$ via **forcing cycles**, with \[ \lambda(G)=\max\{\text{ratio of a forcing cycle in }G\}, \] and also shows that $\lambda(G)$ can be written as $j/i$ with integers $1\le i\le j< i+j\le |V|$ [1702.06614]. Algorithmically, feasibility for fixed $(t_1,t_2)$ is reduced to a difference-constraints graph $G_d$: for each directed edge $(u\to v)$ of $G$, add an arc $v\to u$ of weight $-t_1$; for each unordered non-edge $\{u,v\}$, add arcs $u\to v$ and $v\to u$ each of weight $+t_2$. The digraph $G$ admits a satisfying assignment iff $G_d$ has no negative-weight cycle. If none exists, shortest-path distances yield $\alpha$; if one exists, extracting it yields a forbidden forcing cycle certifying infeasibility. The stated high-level time bound is $O(nm/r)$, where $r=t_2/t_1$ [1702.06614]. In this literature, Threshold-2 is thus an upper certainty boundary, not an activation count. The shared threshold language masks a substantially different semantics. ## 5. Two-threshold diagnostic rules In diagnostic ROC analysis, threshold-2 is the upper cut-point in a **two-threshold rule** combining two correlated tests. Test A produces score $Y$, Test B produces score $X$, and two cut-points are introduced on the Test A scale: \[ T_1 \equiv T_A^{ro}, \qquad T_2 \equiv T_A^{ri}, \qquad T_1