---
title: Edge-Based γ-Quasi-Clique Model
url: https://www.emergentmind.com/topics/edge-based-quasi-clique-model
type: topic
---

# Edge-Based γ-Quasi-Clique Model

An edge-based $γ$-quasi-clique is a fundamental dense subgraph model in graph theory and network science. Given a simple undirected graph $G = (V, E)$ and density threshold $\gamma \in (0,1]$, a subset $S \subseteq V$ is a $γ$-quasi-clique if its induced subgraph satisfies $|E(S)| \geq \gamma \cdot \binom{|S|}{2}$. The model generalizes the classical clique ($\gamma=1$) and supports rigorous extremal, probabilistic, and algorithmic analysis. The largest cardinality of such a subset is called the $γ$-quasi-clique number of $G$ and denoted $\omega^{(\gamma)}(G)$. This model has driven progress in extremal combinatorics, random graph theory, planted subgraph detection, and large-scale graph mining [1803.10349, 2009.04945, 2601.14619, 2508.04174].

## 1. Mathematical Definition and Extremal Parameters

Given $G=(V,E)$ and $S \subseteq V$, let $E(S)$ be the set of edges induced by $S$. $S$ is an edge-based $γ$-quasi-clique if
$$
|E(S)| \geq \gamma \cdot \binom{|S|}{2}
$$
and the $γ$-quasi-clique number is
$$
\omega^{(\gamma)}(G) = \max \left\{\,|S|: S \subseteq V,\, |E(S)| \geq \gamma \binom{|S|}{2}\, \right\}.
$$
When $\gamma=1$, this coincides with the clique number.

In Erdős–Rényi random graphs $G_{n,p}$, the parameter $\omega^{(\gamma)}(G_{n,p})$ exhibits sharp concentration. Let
$$
\alpha(\gamma,p) = \gamma \log \left(\frac{\gamma}{p}\right) + (1-\gamma) \log \left(\frac{1-\gamma}{1-p}\right),
$$
the Kullback–Leibler divergence $D(\mathrm{Ber}(\gamma)\,\|\,\mathrm{Ber}(p))$. The two-point concentration theorem states
$$
\omega^{(\gamma)}(G_{n,p}) \in \left\{\,\left\lfloor \frac{2}{\alpha(\gamma,p)} \left(\log n - \log \log n + \log \frac{e\alpha(\gamma,p)}{2} \right) + \frac12\right\rfloor,
 \left\lceil \ldots \right\rceil \,\right\}
$$
with high probability as $n \rightarrow \infty$ [1803.10349, 2009.04945]. In inhomogeneous random graphs with kernel $\kappa: [0,1]^2 \to (0,1)$ and edge probability $p_{\max} = \max_{x,y} \kappa(x,y)$, the largest $γ$-quasi-clique again satisfies
$$
\omega^{(\gamma)}(G) = \frac{2 \log n}{D(\gamma, p_{\max})} (1+o(1)),
$$
demonstrating that the leading-order behavior depends only on $p_{\max}$ [2009.04945].

## 2. Algorithmic Complexity and Exact Algorithms

Determining whether $G$ contains a $γ$-quasi-clique of size at least $k$ is NP-complete for any fixed $\gamma \in (0,1)$ and $k$ [2601.14619]. The lack of hereditary property (i.e., induced subgraphs of a $γ$-quasi-clique may not be $γ$-quasi-cliques themselves) limits classical pruning strategies such as those used for cliques or hereditary properties.

Recent major advances include iteratively reducing the maximum $γ$-quasi-clique problem to $k$-defective clique computations, where a $k$-defective clique allows for at most $k$ missing edges and is hereditary. The EQC-Pro algorithm [2601.14619] uses a bottom-up doubling and binary search approach, achieves $O^*(\beta_\kappa^n)$ time with $\beta_\kappa<2$ (improving on previous $O^*(2^n)$ approaches), leverages dynamic degeneracy-based heuristics, and outperforms QClique/FPCE by up to four orders of magnitude on large real-world graphs.

## 3. Mathematical Programming and Multiobjective Formulations

The edge-based $γ$-quasi-clique problem is naturally formulated as a Mixed Integer Linear Program (MILP). For MQC, the following formulation holds [2403.10896, 2403.08534]:
\[
\begin{align*}
\max &\quad \sum_{i\in V} x_i \\
\text{s.t.} &\quad \sum_{\{i,j\}\in E} y_{ij} \geq \gamma \cdot \frac{|S|(|S|-1)}{2} \\
            &\quad y_{ij} \leq x_i,\;\; y_{ij} \leq x_j,\;\; \forall\{i,j\}\in E \\
            &\quad x_i \in \{0,1\},\;\; y_{ij} \geq 0
\end{align*}
\]
with $x_i=1$ iff vertex $i$ belongs to $S$, $y_{ij}=1$ iff $\{i,j\} \in E(S)$.

Multiobjective formulations simultaneously maximize both density and cardinality (the Multiobjective Quasi-Clique Problem, MOQC). Scalarization approaches such as ε-constraint and weighted-sum are efficient due to the total unimodularity of the LP relaxations, and a three-phase strategy combining dichotomic search, local search exploiting quasi-heredity, and ε-constraint fill-in provides strong empirical performance on real-world networks [2403.10896].

## 4. Heuristic Algorithms and Scalable Approaches

On large-scale graphs, exact methods remain challenging; thus, heuristics such as diffusion-based clustering and degeneracy ordering are used. The EDQC algorithm [2508.04174] introduces an energy-diffusion approach: energy is propagated stochastically from seed nodes, with high-energy vertices indicating structural cohesion. EDQC sidesteps explicit candidate enumeration, providing competitive speed and higher solution quality than previous metaheuristics while maintaining low solution variance.

Dynamic heuristics in the EQC-Pro framework further raise lower bounds within the search and can iteratively expand solutions via degeneracy and neighborhood search. These procedures exploit quasi-hereditary properties and local extension rules to efficiently traverse the search landscape [2601.14619].

## 5. Planted Quasi-Clique Recovery and Convex Relaxations

For the detection and recovery of planted $γ$-quasi-cliques in noisy environments, convex optimization approaches grounded in robust PCA and matrix decomposition have been proposed. The rank-sparsity (low-rank plus sparse) matrix decomposition attempts to extract the quasi-clique adjacency via nuclear norm and $\ell_1$ penalties with explicit guarantees [2208.03251]:
\[
\min_{0 \leq B \leq 1} \|B\|_* + \lambda \|A - B\|_1 \quad \text{s.t.}\; \sum_{i,j} B_{ij} \geq \gamma n_c^2
\]
When the planted subgraph satisfies certain incoherence and sampling conditions ($p, \gamma \gtrsim r \log n / n$), exact recovery is possible with high probability, as certified by a dual variable constructed using a golfing scheme [2208.03251].

## 6. Structural, Probabilistic, and Query-Theoretic Insights

The edge-based $γ$-quasi-clique model possesses rich structural and probabilistic properties:

- In random graphs, $\omega^{(\gamma)}(G_{n,p})$ exhibits two-point concentration near its mean, governed by large deviation rates $\alpha(\gamma,p)$ or $D(\gamma,p)$ [1803.10349, 2009.04945].
- As $p \to \gamma$, the rate approaches zero and quasi-cliques grow larger; for small $p, \gamma$ expansions exist to characterize the thresholds [1803.10349].
- In query-limited models, the largest discoverable $γ$-quasi-clique (or dense subgraph) in $G_{n,1/2}$, under $n^\delta$ adjacency queries and $\ell$ adaptive rounds, is sharply bounded by combinatorial anti-matching arguments:
  \[
  \alpha_\star(\delta, \ell, \eta) \leq 1 + \sqrt{1 - \frac{(2 - \delta)^2}{4\gamma(\ell)}}
  \]
  where $\gamma(\ell)$ is a universal constant determined by edge-label/matching combinatorics [2310.06826]. These bounds are tight in regimes of high query-complexity or adaptivity.

## 7. Extensions: Connectivity, Biobjective Models, and Further Directions

Classical MQC and DKS formulations can yield disconnected subgraphs, which are often undesirable. Flow-based constraints (C-STree, C-Flow) have been incorporated into MILPs to enforce connectedness of the returned subgraphs. This ensures practical relevance in domains where connectivity is essential and delivers near-optimal solution rates and reduced runtimes on sparse real networks [2403.08534].

The multiobjective view (size vs. density) allows the computed Pareto front to capture efficiency tradeoffs between small, dense and large, sparser quasi-cliques. Algorithms recover supported Pareto points via dichotomic LP search, filling in non-supported points using ε-constraint approaches, and exploit structural properties such as quasi-heredity and degree-extension [2403.10896].

Further open directions include tightening query-complexity lower bounds for subpolynomial adaptivity, improving worst-case fixed-parameter complexity in exact algorithms, and developing robust methodologies for noisy, multi-layer, or attributed network settings.

---

**References**

- "Dense Subgraphs in Random Graphs," [1803.10349]
- "Quasi-cliques in inhomogeneous random graphs," [2009.04945]
- "Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks," [2601.14619]
- "Quasi-Clique Discovery via Energy Diffusion," [2508.04174]
- "Solving the Multiobjective Quasi-Clique Problem," [2403.10896]
- "Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems," [2403.08534]
- "Rank-sparsity decomposition for planted quasi clique recovery," [2208.03251]
- "Finding cliques and dense subgraphs using edge queries," [2310.06826]

Source: https://www.emergentmind.com/topics/edge-based-quasi-clique-model