Witness-Sensitive Detection of Induced Diamonds

Abstract: We provide a fast \emph{witness-sensitive} algorithm for detecting an induced diamond (a $K_4$ minus an edge) in an $n$-vertex graph containing $t$ induced diamonds. Our algorithm runs in time $$\tilde{O}(\min(n^{{2.425}/t^{{0.25}+n^2,}} n<sup>ω))$$ with high probability, improving upon the prior state of the art (witness-oblivious) algorithm that runs in time $O(n<sup>ω\log{n})$ [Vassilevska Williams, Wang, Williams, Yu, SODA 2014] whenever $t \geq n<sup>{(3-ω)/3}$, where $ω&lt; 2.372$ is the matrix multiplication exponent. Our key insight is that the size of a clique containing one of the triangles of an induced diamond plays a crucial role in detecting such a diamond. We say that a diamond is $r$-heavy if this size is at least $r$, and we provide a fast detection algorithm for $r$-heavy diamonds in $$\tilde{O}(r \cdot (n/r)^ω+ (n/r)³⁺ nr)$$ time. When there are no $r$-heavy diamonds, we provide a different fast detection algorithm in $\tilde{O}(\mathsf{MM}(n,n,n\sqrt{r/t}))$ time, where $\mathsf{MM}(a,b,c)$ denotes the time to multiply an $a \times b$ matrix by a $b \times c$ matrix, which is conditionally optimal for $r=\tilde{O}(1)$. Our main technical contribution is in designing a refinement framework for sampling vectors, which allows sampling vertices for detecting diamonds in a manner that is adaptive to the structure of graphs with no $r$-heavy diamonds. We establish that our technique is of a wide applicability, by showing how it also allows for faster witness-sensitive algorithms for $4$-SUM and for a special case of $4$-cycles.

• The paper presents a novel witness-sensitive algorithm for induced diamond detection that achieves improved running times of O(min(n^(2.425)/t^(0.25) + n^2, n^ω)) under high witness conditions.
• It leverages a structural dichotomy by classifying diamonds as r-heavy or r-light, employing specialized sampling, fast matrix multiplication, and vector partitioning techniques.
• The approach establishes tight conditional lower bounds and extends its methodology to related problems such as induced C4 detection and 4-SUM, offering subcubic performance in dense graphs.

Witness-Sensitive Induced Diamond Detection: A Technical Analysis

Problem Setting and Motivation

The detection of fixed subgraphs, specifically induced patterns such as diamonds (the 4-vertex clique $K_4$ with one edge missing), is a central problem in graph algorithms. Induced diamond detection is instrumental in numerous applications, including motif counting in biological networks, social network analysis, and graph-based machine learning. While the combinatorial complexity of general subgraph detection is inherently high, practitioners frequently encounter graph instances where the number of target subgraphs (witnesses) is large. This has driven research into witness-sensitive algorithms—algorithms whose running time improves as the number of witnesses grows.

Prior work for induced diamond detection, particularly the state-of-the-art algorithm of Vassilevska Williams et al. (SODA 2014), achieves $O(n^\omega \log n)$ time but is witness-oblivious, i.e., running time does not scale with the number of diamonds $t$ unless $t$ is prohibitively large. The literature contains highly optimized witness-sensitive algorithms for triangles and some cycle/clique patterns, with important upper and lower bounds relating to matrix multiplication exponents. Crucially, there has been no commensurate witness-sensitive result for induced diamonds, in part due to structural bottlenecks absent in simpler patterns.

Main Contributions

This paper introduces a fundamentally new witness-sensitive algorithm for induced diamond detection with running time $O(\min(n^{2.425}/t^{0.25} + n^2, n^\omega))$ w.h.p., breaking the $(n^\omega \log n)$ barrier when $t > n^{(3-\omega)/3}$. The approach is conceptually novel in two respects:

1. Structural Dichotomy (r-heaviness): Induced diamonds are classified as r-heavy if three of their vertices fall within a clique of size $r$. The main algorithm interleaves specialized routines for r-heavy and r-light cases.
2. Refined Sampling and Vector Partitioning: Extending the algebraic sampling frameworks for triangles, the algorithm introduces a sampling vector refinement technique. This achieves improved sampling in the r-light case by leveraging the structure that no large clique contains three vertices of a diamond, thus accelerating detection in classically hard instances.

The results are tight under the Unbalanced Triangle Detection Hypothesis, and the paper demonstrates the broader applicability of its techniques to problems such as 4-SUM and induced C4.

Algorithms and Technical Approach

r-Heavy Induced Diamond Detection

The r-heavy case exploits the structural property that a diamond-free graph is characterized by every edge belonging to a single maximal clique. If a diamond exists where three vertices are in a large clique ("r-heavy"), then many edges of this clique (the "r-heavy revealing edges") are highly amenable to sampling. The following steps summarize the approach:

• Sample a subset $S$ of size $\tilde{O}(n/r)$ to cover such cliques with good probability.
• Use fast matrix multiplication to enumerate candidate edges in $O(n^\omega \log n)$0.
• For each candidate, check in quasi-linear time relative to the clique size if the edge is r-heavy and if it induces a diamond.
• Early stopping and avoidance of redundant work are achieved through careful removal of processed subgraphs and analysis based on cycles in an auxiliary bipartite graph.

The total running time is $O(n^\omega \log n)$1. For $O(n^\omega \log n)$2 this bound is subquadratic.

r-Light Induced Diamond Detection

For graphs where all diamonds are r-light, classical vector-based sampling (as used for triangles/cycles) is insufficient due to the lack of efficient sparsity in the sampled graphs. The authors refine this framework as follows:

• Employ a gradual refinement of sampling vectors, progressing through dimension increases rooted in the fact that, in the absence of large cliques, non-edges are sufficiently distributed to allow for more balanced sampling probabilities.
• Prove that, structurally, either the number of degree-3 diamond vertices $O(n^\omega \log n)$3 is large (enabling a separate algorithm) or one can select a sampling vector $O(n^\omega \log n)$4 that yields the desired witness-sensitive speedup.
• Implement detection of colorful induced diamonds via tailored color-coding, with matching running time $O(n^\omega \log n)$5, where $O(n^\omega \log n)$6 is the current best bound for matrix multiplication.

Combining results for the two cases yields the overall improvement.

Lower Bounds and Combinatorial Connections

The paper establishes conditional lower bounds under the Unbalanced Triangle Detection Hypothesis, showing that for $O(n^\omega \log n)$7, detecting an induced diamond with $O(n^\omega \log n)$8 occurrences requires $O(n^\omega \log n)$9 time, matching the algorithm's upper bound. A matching lower bound is also obtained for combinatorial algorithms under the Boolean Matrix Multiplication Conjecture, demonstrating tightness for all known combinatorial approaches.

Broader Consequences and Extensions

• Other Patterns: The sampling refinement technique is shown to generalize to other 4-vertex patterns, such as induced C4, achieving $t$0 time for r-light C4 detection. The analysis leverages the greater symmetry of C4, allowing for consistently good sampling vectors.
• 4-SUM: Refinement shows that for 4-SUM, a combinatorial algorithm achieves $t$1 time in sparse/tiny moderate witness regimes, improving upon prior results and matching the sampling lower bound via a structural observation on 4-SUM "witnesses."
• Approximate Counting: The detection-to-counting reduction [DLM22] combined with the new detection algorithms yields the first $t$2-approximate subgraph counting (with similar witness sensitivity) for induced diamonds and other four-node patterns in truly subcubic time.

Experimental and Theoretical Highlights

Among the strongest empirical and theoretical assertions:

• For diamond counts $t$3, the running time of the new algorithm becomes sub-$t$4, outperforming all prior algorithms.
• For $t$5 (i.e., graphs with no large cliques), diamond detection is, conditionally, strictly harder than triangle detection, showing the first separation between these problems in the witness-sensitive setting.
• For dense low-witness instances, nearly input-size lower bounds are established, verifying that simple algorithms are, in such cases, optimal up to log factors.

Implications and Future Directions

From a practical perspective, these algorithms offer immediate benefits for large-scale subgraph analysis where the witness multiplicity is high or the graph structure is amenable (e.g., lacks large cliques). Theoretically, the techniques set a new paradigm for the exploitation of structure in parameterized subgraph detection, extending both algebraic and combinatorial toolkits.

Future work may focus on:

• Extending these refinement-based techniques to larger patterns, multi-patterns, or parameterized motif classes where recursive sparsity/regularity notions may be exploited.
• Tighter analysis and derandomization of sampling-based approaches.
• Empirical adaptation to massive dynamic or streaming models, where witness multiplicity can be rapidly changing and resource constraints are acute.

Conclusion

The paper presents a comprehensive and technically innovative framework for witness-sensitive induced diamond detection, matching or improving all known bounds in almost all parameter regimes. By leveraging a nuanced structural dichotomy and advanced sampling vector refinements, the work achieves both theoretical improvements and deeper understanding of the interplay between graph structure, witness multiplicity, and algorithmic efficiency. The results not only close a notable gap in subgraph detection theory but point towards a richer structural methodology for witness-sensitive graph algorithms in general.

Reference:

"Witness-Sensitive Detection of Induced Diamonds" (2605.09006)