N-Ball Sampling for Unbiased Graph Estimation

• N-ball Sampling Technique is a probabilistic graph sampling method that employs BFS expansion from a randomized seed to unbiasedly estimate subgraph motifs.
• It generalizes classical designs such as random-node, multiplicity, and adaptive cluster sampling while effectively capturing local subgraph densities.
• The technique's flexibility in adjusting the number of expansion waves enables a balance between computational cost and variance reduction for accurate motif counts.

N-ball sampling, also referred to as T-wave snowball sampling (SBS), is a probabilistic graph sampling technique defined by breadth-first expansion from a randomized initial node sample, aiming to unbiasedly estimate finite-order subgraph totals such as triangles, cycles, or stars. The methodology generalizes multiple classical sampling paradigms, including random-node, random-edge, multiplicity, and adaptive cluster sampling, by constructing “N-balls” (subgraphs induced by nodes within T steps from seed nodes) and employing Horvitz–Thompson normalization for unbiased inference (Oguz-Alper et al., 2020).

1. Formal Definition

Let $G=(V,E)$ denote a simple undirected graph with $|V|=N$ nodes. The N-ball (or T-wave SBS) protocol comprises the following steps:

• Initial Sample and Observation: Select an initial seed set $s_0\subset V$ (typically of fixed size $n$) using any probability design admitting known first- and higher-order inclusion probabilities.
• Reciprocal Incident Observation Procedure (RIOP): Whenever $u\in V$ enters the sample, observe all incident edges $(u,v)\in E$ and their endpoints $v$.
• Wave Expansion (N-balls): For step $t\geq1$, define

$$\alpha(s_{t-1}) = \{ v\in V \setminus \bigcup_{r<t} s_r : \exists u\in s_{t-1}, (u,v)\in E \}$$

and set the new sample increment as

$$\Delta_t = \alpha(s_{t-1}) \setminus \bigcup_{r< t}s_r.$$

The process is iterated up to $|V|=N$0 waves (or until $|V|=N$1), yielding the final sample $|V|=N$2.

• Final Sample Graph: The discovered sample graph is $|V|=N$3, consisting of the observed node set $|V|=N$4 and all edges $|V|=N$5 exposed during RIOP.

This framework yields an “N-ball of radius $|V|=N$6 around $|V|=N$7” in the breadth-first search (BFS) sense.

2. Inclusion Probabilities and Ancestor Sets

An essential component of unbiased graph motif estimation under SBS is the computation of inclusion probabilities, leveraging the structure of SBS-ancestor sets:

• For a motif $|V|=N$8 (e.g., node, edge, triangle), define its ancestor set as:

$|V|=N$9

Typically, a recognized subset $s_0\subset V$0 is used, identifiable from the observed $s_0\subset V$1 when $s_0\subset V$2 is seen.

• The first-order inclusion probability is:

$s_0\subset V$3

For a single-node motif $s_0\subset V$4 and initial simple random sampling (SRS) without replacement of size $s_0\subset V$5:

$s_0\subset V$6

where $s_0\subset V$7 is the number of ancestors of node $s_0\subset V$8.

• Higher-order (joint) inclusion probabilities for any motif set $s_0\subset V$9 are:

$n$0

In SRS, these probabilities admit closed-form combinatorial representation in terms of $n$1-set overlaps (e.g., $n$2).

3. Unbiased Estimation via Horvitz–Thompson

Given motif set $n$3, with associated values $n$4, the inferential target is $n$5. The canonical unbiased estimator (Horvitz–Thompson) is

$n$6

where $n$7 is the set of motifs observed in $n$8 (those for which $n$9). This estimator is unbiased for $u\in V$0:

$u\in V$1

since $u\in V$2 and summing over $u\in V$3 yields exact expectation.

This formalism encompasses node totals ($u\in V$4), edge totals ($u\in V$5), triangle counts, or totals over arbitrary motifs.

4. Sampling Variance Analysis

The variance of the Horvitz–Thompson estimator under SBS design on the seed set $u\in V$6 is

$u\in V$7

For node-sum estimation,

$u\in V$8

Approximate forms arise if all $u\in V$9 are small or the sampling fraction $(u,v)\in E$0 is small, in which case independence is assumed:

$(u,v)\in E$1

The HT methodology supports unbiased variance estimation:

$(u,v)\in E$2

5. Special Cases and Theoretical Generalizations

T-wave SBS unifies several classical sampling designs in a single graph-theoretic formalism:

• Random-node (T=0) sampling: No waves. The ancestor set reduces to $(u,v)\in E$3; $(u,v)\in E$4 is the initial inclusion probability.
• Random-edge sampling: Utilizing a bipartite T=0 design on the incidence graph (edges as “nodes”).
• Multiplicity sampling (Birnbaum–Sirken): The bipartite sampling-unit/measurement-unit relation forms a graph $(u,v)\in E$5; 1-wave SBS from $(u,v)\in E$6 with RIOP reconstructs classical multiplicity estimators through known ancestor sets and yields direct application of the HT formula.
• Adaptive cluster sampling (Thompson): Treating the spatial grid and neighbor-criteria as an infinite-wave ($(u,v)\in E$7) directed procedure, clusters form connected components detected via suitable $(u,v)\in E$8.

6. Methodological Advantages and Practical Considerations

T-wave SBS possesses several notable advantages:

• Flexibility: Adjusting $(u,v)\in E$9 controls the trade-off between traversal cost and variance.
• Motif Generality: Any finite-order subgraph motif can be estimated within the same HT framework.
• Sampling Efficiency: Breadth-first “waves” tend to oversample high-degree regions, increasing efficiency for motifs $v$0 associated with local subgraph density.
• Unification: SBS instantiates a general theory encompassing otherwise disparate sampling regimes, allowing analytical connection between motif estimation and finite-population sampling theory.

The key operational principle is that T-wave snowball sampling equates to BFS truncated at depth $v$1 from a randomly sampled seed set, with motif inclusion determined by ancestor-set intersection with $v$2. Once inclusion probabilities for motifs are characterized, unbiased estimation and closed-form variance expressions are immediate (Oguz-Alper et al., 2020).