S EMI - SUPERVISED C OMMUNITY D ETECTION VIA S TRUCTURAL S IMILARITY M ETRICS
A BSTRACT
Motivated by social network analysis and network-based recommendation systems, we study a semi-supervised community detection problem in which the objective is to estimate the community label of a new node using the network topology and partially observed community labels of existing nodes.
The network is modeled using a degree-corrected stochastic block model, which allows for severe degree heterogeneity and potentially non-assortative communities.
We propose an algorithm that computes a ‘structural similarity metric’ between the new node and each of the K communities by aggregating labeled and unlabeled data.
The estimated label of the new node corresponds to the value of k that maximizes this similarity metric.
Our method is fast and numerically outperforms existing semi-supervised algorithms.
Theoretically, we derive explicit bounds for the misclassification error and show the efficiency of our method by comparing it with an ideal classifier.
Our findings highlight, to the best of our knowledge, the first semi-supervised community detection algorithm that offers theoretical guarantees.
I NTRODUCTION
Nowadays, large network data are frequently observed on social media (such as Facebook, Twitter, and LinkedIn), science and social science.
Learning the latent community structure in a network is of particular interest.
For example, community analysis is useful in designing recommendation systems (Debnath et al., 2008), measuring scholarly impacts (Ji et al., 2022) and re-constructing pseudo-dynamics in single-cell data (Liu et al., 2018).
In this paper we consider a semi-supervised community detection setting: we are given a symmetric network with n nodes and denote by
A ∈ R n × n the adjacency matrix, where A ij ∈ { 0 , 1 } indicates whether there is an edge between nodes i and j .
Suppose the nodes partition into K non-overlapping communities C 1 , C 2 , . .
, C K .
For a subset L ⊂ { 1 , 2 , . . . , n } , we observe the true community label y i ∈ { 1 , 2 , . . .
, K } for each i ∈ L .
Write m = |L| and Y L =
( y i ) i ∈L .
In this context, there are two related semi-supervised community detection problems: (i) in-sample classification , where the goal is to classify all the existing unlabeled nodes; (ii) prediction , where the goal is to classify a new node joining the network.
Notably, the in-sample classification problem can be easily reduced to prediction problem: we can successively single out each existing unlabeled node, regard it as the “new node”, and then predict its label by applying an algorithms for the prediction problem.
Hence, for most of the paper, we focus on the prediction problem and defer the study of in-sample classification to Section 3.
In the prediction problem, let X ∈ { 0 , 1 } n denote the vector consisting of edges between the new node and each of the existing nodes.
Given ( A, Y L , X ) , our goal is to estimate the community label of the new node.
This problem has multiple applications.
Consider the news suggestion or online advertising push for a new Facebook user (Shapira et al., 2013).
Given a big Facebook network of existing users, for a small fraction of nodes (e.g., active users), we may have good information about the communities to which they belong, whereas for the majority of users, we just observe who they link to.
We are interested in estimating the community label of the new user in order to personalize news or ad recommendations.
For another example, in a co-citation network of researchers (Ji et al., 2022), each community might be interpreted as a group of researchers working on the same research area.
We frequently have a clear understanding of the research areas of some authors (e.g., senior authors), and we intend to use this knowledge to determine the community to which a new node (e.g., a junior author) belongs.
The statistical literature on community detection has mainly focused on the unsupervised setting (Bickel & Chen, 2009;
Rohe et al., 2011; Jin, 2015; Gao et al., 2018; Li et al., 2021).
The semisupervised setting is less studied.
Leng & Ma (2019) offers a comprehensive literature review of semi-supervised community detection algorithms.
Liu et al.
(2014) and Ji et al.
(2016) derive systems of linear equations for the community labels through physics theory, and predict the labels by solving those equations.
Zhou et al.
(2018) leverages on the belief function to propagate labels across the network, so that one can estimate the label of a node through its belief.
Betzel et al.
(2018) extracts several patterns in size and structural composition across the known communities and search for similar patterns in the graph.
Yang et al.
(2015) unifies a number of different community detection algorithms based on non-negative matrix factorization or spectral clustering under the unsupervised setting, and fits them into the semi-supervised scenario by adding various regularization terms to encourage the estimated labels for nodes in L to match with the clustering behavior of their observed labels.
However, the existing methods still face challenges.
First, many of them employ the heuristic that a node tends to have more edges with nodes in the same community than those in other communities.
This is true only when communities are assortative .
But non-assortative communities are also seen in real networks (Goldenberg et al., 2010; Betzel et al., 2018); for instance, Facebook users sharing similar restaurant preferences are not necessarily friends of each other.
Second, real networks often have severe degree heterogeneity (i.e., the degrees of some nodes can be many times larger than the degrees of other nodes), but most semi-supervised community detection algorithms do not handle degree heterogeneity.
Third, the optimization-based algorithms (Yang et al., 2015) solve non-convex problems and face the issue of local minima.
Last, to our best knowledge, none of the existing methods have theoretical guarantees.
Attributed network clustering is a problem related to community detection, for which many algorithms have been developed (please see Chunaev et al.
for a nice survey).
The graph neural networks (GNN) reported great successes in attributed network clustering.
Kipf & Welling (2016) proposes a graph convolutional network (GCN) approach to semi-supervised community detection, and Jin et al.
(2019) combines GNN with the Markov random field to predict node labels.
However, GNN is designed for the setting where each node has a large number of attributes and these attributes contain rich information of community labels.
The key question in the GNN research is how to utilize the graph to better propagate messages.
In contrast, we are interested in the scenario where it is infeasible or costly to collect node attributes.
For instance, it is easy to construct a co-authorship network from bibtex files, but collecting features of authors is much harder.
Additionally, a number of benchmark network datasets do not have attributes (e.g. Caltech (Red et al., 2011; Traud et al., 2012), Simmons (Red et al., 2011; Traud et al., 2012) , and Polblogs (Adamic & Glance, 2005)).
It is unclear how to implement GNN on these data sets.
In Section 4, we briefly study the performance of GNN with self-created nodal features from 1-hop representation, graph topology and node embedding.
Our experiments indicate that GNN is often not suitable for the case of no node attributes.
We propose a new algorithm for semi-supervised community detection to address the limitations of existing methods.
We adopt the DCBM model (Karrer & Newman, 2011) for networks, which models degree heterogeneity and allows for both assortative and non-assortative communities.
Inspired by the viewpoint of Goldenberg et al.
(2010) that a ‘community’ is a group of ‘structurally equivalent’ nodes, we design a structural similar metric between the new node and each of the K communities.
This metric aggregates information in both labeled and unlabeled nodes.
We then estimate the community label of the new node by the k that maximizes this similarity metric.
Our method is easy to implement, computationally fast, and compares favorably with other methods in numerical experiments.
In theory, we derive explicit bounds for the misclassification probability of our method under the DCBM model.
We also study the efficiency of our method by comparing its misclassification probability with that of an ideal classifier having access to the community labels of all nodes.
S EMI - SUPERVISED COMMUNITY DETECTION
Recall that A is the n × n adjacency matrix on the existing nodes and Y L contains the community labels of nodes in L .
Write [ n ] = { 1 , 2 , . . . , n } and let U =
[ n ] \ L denote the set of unlabeled nodes.
We index the new node by n +1 and let X ∈ R n be the binary vector consisting of the edges between the new node and existing nodes.
Denote by ¯ A the adjacency matrix for the network of ( n + 1) nodes.
2.1 The DCBM model and
structural equivalence of communities We model ¯ A with the degreecorrected block model (DCBM) (Karrer & Newman, 2011).
Define a K -dimensional membership matrix π i ∈ { e 1 , e 2 , . .
, e K } , where e k ’s are the standard basis vectors of R K .
We encode the community labels by π i , where π i =
e k
if and only if y i = k .
For a symmetric nonnegative matrix
P ∈ R K × K and a degree parameter θ i ∈ (0 , 1] for each node i , we assume that the upper triangle of ¯
A contains independent Bernoulli variables, where
[Equation]
When θ i are equal, the DCBM model reduces to the stochastic block model (SBM).
Compared with SBM, DCBM is more flexible as it accommodates degree heterogeneity.
For a matrix M or a vector v , let diag( M ) and diag( v ) denote the diagonal matrices whose diagonals are from the diagonal of M or the vector v , respectively.
Write θ =
( θ 1 , θ 2 , . .
, θ n +1 ) ′ ,
Θ = diag( θ ) , and Π =
[ π 1 , π 2 , . .
π n +1 ] ′ ∈ R n × K .
Model (1) yields that
[Equation]
where Ω = ΘΠ P Π ′ Θ and ¯ W
=
¯
A − E ¯ A.
Here, Ω is a low-rank matrix that captures the ‘signal’, W is a generalized Wigner matrix that captures ‘noise’, and diag(Ω) yields a bias to the ‘signal’ but its effect is usually negligible.
The DCBM belongs to the family of block models for networks.
In block models, it is not necessarily true that the edge densities within a community are higher than those between different communities.
Such communities are called assortative communities.
However, non-assortative communities also appear in many real networks (Goldenberg et al., 2010; Betzel et al., 2018).
For instance, in news and ad recommendation, we are interested in identifying a group of users who have similar behaviors, but they may not be densely connected to each other.
Goldenberg et al.
(2010) introduced an intuitive notion of structural equivalence - two nodes are structurally equivalent if their connectivity with similar nodes is similar.
They argued that a ‘community’ in block models is a group of structurally equivalent nodes.
This way of defining communities is more general than assortative communities.
We introduce a rigorous description of structural equivalence in the DCBM model.
For two vectors u and v , define ψ ( u, v ) =
arccos ⟨ u ∥ u ∥ , v ∥ v ∥ ⟩ , which is the angle between these two vectors.
Let ¯
A
i be the i th column of ¯ A .
This vector describes the ‘behavior’ of node i in the network.
Recall that Ω is as in (2).
When the signal-to-noise ratio is sufficiently large, ¯ A
i ≈ Ω
i , where Ω i is the i th column of Ω .
We approximate the angle between ¯ A i and ¯ A j by the angle between Ω i and Ω j .
By DCBM model, for a node i in community k , Ω i
= θ i ΘΠ
Pe k , where e k is the k th standard basis of R K .
It follows that for i ∈ C k and j ∈ C ℓ , the degree parameters θ i and θ j cancel out in our structural similarity:
[Equation]
It is seen that cos ψ (Ω i , Ω j ) does not depend on the degree parameters of nodes and is solely determined by community membership.
When k = ℓ (i.e., i and j are in the same community), cos ψ (Ω i , Ω j ) = 1 , which means the angle between these two vectors is zero.
When k ̸ = ℓ , as long as P is non-singular and Π has a full column rank, M is a positive-definite matrix.
It follows that cos ψ (Ω i , Ω j ) < 1 and that the angle between Ω i and Ω j is nonzero.
Example 1.
Suppose K = 2 , P ∈ R 2 × 2 is such that the diagonal entries are 1 and off-diagonal entries are b , for some b > 0 and b ̸ = 1 , and max i { θ i } < min { 1 /b, 1 } (to guarantee that all entries of Ω are smaller than 1).
For simplicity, we assume (cid:80) i ∈C 1 θ 2 i
=
(cid:80) i ∈C 2 θ 2 i .
It can be shown that M is proportional to the matrix whose diagonal entries are (1 + b 2 ) and off-diagonal entries are 2 b .
When b < 1 , the communities are assortative, and when b > 1 , the communities are non-assortative.
However, regardless of the value of b , the off-diagonal entries of M are always strictly smaller than the diagonal entries, so that cos ψ (Ω i , Ω j ) < 1 , for nodes in distinct communities.
2.2 Semi-supervised community detection Inspired by (3)
, we propose assigning a community label to the new node based on its ‘similarity’ to those labeled nodes.
For each 1 ≤ k ≤ K , assume that L ∩ C k ̸ = ∅ and define a vector A ( k ) ∈ R n by A ( k ) j = (cid:80) i ∈L∩C k A ij , for 1 ≤ j ≤ n .
The vector
A ( k ) describes the ‘aggregated behavior’ of all labeled nodes in community k .
Recall that X ∈ R n contains the edges between the new node and all the existing nodes.
We can estimate the community label of the new node by
[Equation]
We call (4) the AngleMin estimate.
Note that each A ( k ) is an n -dimensional vector, the construction of which uses both A LL and A LU .
Therefore, A ( k ) aggregates information from both labeled and unlabeled nodes, and so AngleMin is indeed a semi-supervised approach.
The estimate in (4) still has space to improve.
First, A ( k ) and X are high-dimensional random vectors, each entry of which is a sum of independent Bernoulli variables.
When the network is very sparse or communities are heavily imbalanced in size or degree, the large-deviation bound for ψ ( A ( k ) , X ) can be unsatisfactory.
Second, recall that our observed data include A and X .
Denote by A LL the submatrix of A restricted on L × L and X L the subvector of X restricted on L ; other notations are similar.
In (4), only ( A LL , A LU , X ) are used, but the information in A UU is wasted.
We now propose a variant of (4).
For any vector x ∈ R n , let x L and x U be the sub-vectors restricted to indices in L and U , respectively.
Let 1 ( k ) denote the |L| -dimensional vector indicating whether each labeled node is in community k .
Given any |U| × K matrix H
=
[ h 1 , h 2 , . . .
, h K ] , define
[Equation]
The mapping f ( · ; H ) creates a low-dimensional projection of x .
Suppose we now apply this mapping to A ( k ) .
In the projected vector, each entry is a weighted sum of a large number of entries of A ( k ) .
Since A ( k ) contains independent entries, it follows from large-deviation inequalities that each entry of f ( A ( k ) , H ) has a nice asymptotic tail behavior.
This resolves the first issue above.
We then modify the AngleMin estimate in (4) to the following estimate, which we call (3):
[Equation]
AngleMin+ requires an input of H .
Our theory suggests that H has to satisfy two conditions: (a) The spectral norm of H ′ H is O ( |U| ) .
In fact, given any H , we can always multiply it by a scalar so that ∥ H ′ H ∥ is at the order of |U| .
Hence, this condition says that the scaling of H should be properly set to balance the contributions from labeled and unlabeled nodes.
(b) The minimum singular value of H ′ Θ UU Π U has to be at least a constant times ∥ H ∥∥ Θ UU Π U ∥ , where Θ UU is the submatrix of Θ restricted to the ( U , U ) block and Π U is the sub-matrix of Π restricted to the rows in U .
This condition prevents the columns of H from being orthogonal to the columns of Θ UU Π U , and it guarantees that the last K entries of f ( x ; H ) retain enough information of the unlabeled nodes.
We construct a data-driven H from A UU , by taking advantage of the existing unsupervised community detection algorithms such as Gao et al.
; Jin et al.
Let ˆΠ U
=
[ˆ π i ] i ∈U be the community labels obtained by applying a community detection algorithm on the sub-network restricted to unlabeled nodes, where ˆ π i =
e k
if and only if node k is clustered to community k .
We propose using
[Equation] [Equation]
This choice of H always satisfies the aforementioned condition (a).
Furthermore, under mild regularity conditions, as long as the clustering error fraction is bounded by a constant, this H also satisfies the aforementioned condition (b).
We note that the information in A UU has been absorbed into H , so it resolves the second issue above.
Combining (7) with (3) gives a two-stage algorithm for estimating y .
Remark 1 : A nice property of AngleMin+ is that it tolerates an arbitrary permutation of communities in ˆΠ U .
In other words, the communities output by the unsupervised community detection algorithm do not need to have a one-to-one correspondence with the communities on the labeled nodes.
To see the reason, we consider an arbitrary permutation of columns of ˆΠ U .
By (12), this yields a permutation of the last K entries of f ( x ; H ) , simultaneously for all x .
However, the angle between f ( A ( k ) ; H ) and f ( X ; H )) is still the same, and
so ˆ y ( H ) is unchanged.
This property brings a lot of practical conveniences.
When K is large or the signals are weak, it is challenging (both computationally and statistically) to match the communities in ˆΠ U with those in Π L .
Our method avoids this issue.
Remark 2 : AngleMin+ is flexible to accommodate other choices of H .
Some unsupervised community detection algorithms provide both ˆΠ U and ˆΘ UU (Jin et al., 2022).
We may use H ∝ ˆΘ UU ˆΠ U ,
(subject to a re-scaling to satisfy the aforementioned condition (a)).
This H down-weights the contribution of low-degree unlabeled nodes in the last K entries of (12).
This is beneficial if the signals are weak and the degree heterogeneity is severe.
Another choice is H ∝ ˆΞ ( U ) ˆΛ − 1 ( U ) , where ˆΛ U is a diagonal matrix containing the K largest eigenvalues (in magnitude) of A UU and ˆΞ ( U ) is the associated matrix of eigenvectors.
For this H , we do not even need to perform any community detection algorithm on A UU .
We may also use spectral embedding (Rubin-Delanchy et al., 2017).
Remark 3 :
The local refinement algorithm (Gao et al., 2018) may be adapted to the semi-supervised setting, but it requires prior knowledge on assortativity or dis-assortativity and a strong balance condition on the average degrees of communities.
When these conditions are not satisfied, we can construct examples where the error rate of AngleMin+ is o (1) but the error rate of local refinement is 0.5.
See Section C.
2.3 The choice of the unsupervised community detection algorithm
We discuss how to obtain ˆΠ U .
In the statistical literature, there are several approaches to unsupervised community detection.
The first is modularity maximization (Girvan & Newman, 2002).
It exhaustively searches for all cluster assignments and selects the one that maximizes an empirical modularity function.
The second is spectral clustering (Jin, 2015).
It applies k-means clustering to rows of the matrix consisting of empirical eigenvectors.
Other methods include post-processing the output of spectral clustering by majority vote (Gao et al., 2018).
Not every method deals with degree heterogeneity and nonassortative communities as in the DCBM model.
We use a recent spectral algorithm SCORE+ (Jin et al., 2021), which allows for both severe degree heterogeneity and non-assortative communities.
SCORE+ : We tentatively write A UU =
A and |U| = n and assume the network (on unlabeled nodes) is connected (otherwise consider its giant component).
SCORE+ first computes L
=
D − 1 / 2 τ
AD − 1 / 2 τ , where D τ = diag( d 1 , . . .
, d n ) + 0 .
1 d max I n , and d i is degree of node i .
Let ˆ λ k
be the k th eigenvalue (in magnitude) of L and let ˆ ξ k be the associated eigenvector.
Let r = K or r = K
+ 1 (see Jin et al.
(2021) for details).
Let ˆ R ∈ R n × ( r − 1) by ˆ R ik
=
(ˆ λ k
+1 / ˆ λ 1 ) ·
[ˆ ξ k +1 ( i ) / ˆ ξ 1 ( i )] .
Run k-means on rows of ˆ R .
T HEORETICAL PROPERTIES
We assume that the observed adjacency matrix ¯ A follows the DCBM model in (1)-(2).
From now on, let θ ∗ denote the degree parameter of the new node n + 1 .
Suppose k ∗ ∈ { 1 , 2 , . .
, K } is its true community label, and the corresponding K -dimensional membership vector is π ∗ =
e k ∗ .
In (2), θ and P are not identifiable.
To have identifiability, we assume that all diagonal entries of P are equal to 1 (if this is not true, we replace P by [diag( P )]
− 12 P [diag( P )] − 12 and each θ i in community k by θ i √ P kk , while keeping Ω = ΘΠ P Π ′ Θ unchanged).
In the asymptotic framework, we fix K and assume n → ∞ .
We need some regularity conditions.
For any symmetric matrix B , let ∥ B ∥ max denote its entry-wise maximum norm and λ min ( B ) denote its minimum eigenvalue (in magnitude).
We assume for a constant C 1 > 0 and a positive sequence β n (which may tend to 0 ),
[Equation]
For 1 ≤ k ≤ K , let θ ( k ) ∈
R
n be the vector with θ ( k ) i =
[Equation]
· 1 { i ∈ C k } , and let θ ( k ) L and θ ( k ) U be the sub-vectors restricted to indices in L and U , respectively.
We assume for a constant C 2 > 0 and a properly small constant c 3 > 0 ,
[Equation]
These conditions are mild.
Consider (8).
For identifiability, P is already scaled to make P kk =
for all k .
It is thus a mild condition to assume ∥ P ∥ max ≤ C 1 .
The condition of | λ min ( P ) | ≥ β n is also mild, because we allow β n → 0 .
Here, β n captures the ‘dissimilarity’ of communities.
To see this, consider a special P where the diagonals are 1 and the off-diagonals are all equal to b ; in this example, | 1 − b | captures the difference of within-community connectivity and between-community connectivity, and it can be shown that | λ min ( P ) | = | 1 − b | .
Consider (9).
The first condition requires that the total degree in different communities are balanced, which is mild.
The second condition is about degree heterogeneity.
Let θ max and ¯ θ be the maximum and average of θ i , respectively.
In the second inequality of (9), the left hand side is O ( n − 1 θ max / ¯ θ ) , so this condition is satisfied as long as θ max / ¯ θ
= O ( nβ n ) .
This is a very mild requirement.
3.1 The misclassification error of AngleMin+ For any |U| × K matrix H , let ˆ ψ k ( H )
=
ψ ( f ( A ( k ) ; H ) , f ( X ; H )) be as in (3).
AngleMin+ estimates the community label to the new node by finding the minimum of ˆ ψ 1 ( H ) , . . .
, ˆ ψ K ( H ) , with H = ˆΠ U .
We first introduce a counterpart of ˆ ψ k ( H ) .
Recall that Ω is as in (2), which is the ‘signal’ matrix.
Let Ω ( k ) ∈
R n by Ω ( k ) j = (cid:80)
i ∈L∩C k Ω ij , for 1 ≤ j ≤ n , and define
[Equation]
The next lemma gives the explicit expression of ψ k ( H ) for an arbitrary H .
Lemma 1. Consider the DCBM model where (8)-(9) are satisfied.
We define three K × K matrices:
G LL =
Π ′L Θ
[Equation]
Π L , G UU = Π ′U Θ UU Π U , and Q = G − 1 UU Π ′U Θ UU H .
For 1 ≤ k ≤ K , ψ k ( H ) = arccos (cid:16)
[Equation]
where M
[Equation]
P
[Equation]
P .
The choice of H is flexible.
For convenience, we focus on the class of H that is an eligible community membership matrix, i.e., H = ˆΠ U .
Our theory can be easily extended to more general forms of H .
Definition 1.
For any b 0 ∈ (0 , 1) , we say that ˆΠ U is b 0 -correct if min T (cid:0)(cid:80) i ∈U θ i · 1 { T ˆ π i ̸
= π i } (cid:1) ≤ b
∥ θ ∥ 1 , where the minimum is taken over all permutations of K columns of ˆΠ U .
The next two theorems study ψ k ( H ) and ˆ ψ k ( H ) , respectively, for H =
ˆΠ U .
Theorem 1.
Consider the DCBM model where (8)-(9) hold.
Let k ∗ denote the true community label of the new node.
Suppose ˆΠ U is b 0 -correct, for a constant b 0 ∈ (0 , 1) .
When b 0 is properly small, there exists a constant c 0 > 0 , which does not depend on b 0 , such that ψ k ∗ (ˆΠ U )
=
and min k ̸ = k ∗ { ψ k (ˆΠ U ) } ≥ c 0 β n .
Theorem 2.
Consider the DCBM model where (8)-(9) hold.
There exists constant C > 0 , such that for any δ ∈ (0 , 1 / 2) , with probability 1 − δ , simultaneously for 1 ≤ k ≤ K , | ˆ ψ k (ˆΠ U ) − ψ k (ˆΠ U ) | ≤
C
[Equation]
+
[Equation]
Write ˆ ψ k = ˆ ψ k (ˆΠ U ) and ψ k = ψ k (ˆΠ U ) for short.
When max k {| ˆ ψ k − ψ k |} < (1 / 2) min k ̸
= k ∗ { ψ k } , the community label of the new node is correctly estimated.
We can immediately translate the results in Theorems 1-2 to an upper bound for the misclassification probability.
Corollary 1.
Consider the DCBM model where (8)-(9) hold.
Suppose for some constants b 0 ∈ (0 , 1) and ϵ ∈ (0 , 1 / 2) , ˆΠ U is b 0 -correct with probability 1 − ϵ .
When b 0 is properly small, there exist constants C 0 > 0 and ¯ C > 0 , which do not depend on ( b 0 , ϵ ) , such that P (ˆ y ̸ = k ∗ ) ≤ ϵ + ¯ C (cid:80) Kk
=1 exp (cid:16) − C 0 β 2 n ∥ θ ∥ 1 · min { θ ∗ , ∥ θ ( k ) L ∥ 1 } (cid:17) .
Remark 4: When min k ∥ θ ( k ) L ∥ 1 ≥ O ( θ ∗ ) , the stochastic noise in X will dominate the error, and the misspecification probability in Corollary 1 will not improve with more label information.
Typically, the error rate will be the same as in the ideal case that Π U is known (except there is no ϵ in the ideal case).
Hence, only little label information can make AngleMin+ perform almost as well as a fully supervised algorithm that possesses all the label information.
We will formalize this in Section 3.
Remark 5: Notice that min T (cid:0)(cid:80) i ∈U θ i · 1 { T ˆ π i ̸
= π i } (cid:1) ≤ 1 K !
(cid:80) T (cid:0)(cid:80)
i ∈U θ i · 1 { T ˆ π
i ̸
= π i } (cid:1) ≤ K −
K ∥ θ U ∥ 1 .
Therefore, if ∥ θ L ∥ 1 ≥ (1 − Kb 0 K − 1 )
∥ θ ∥ 1 , then min T (cid:0)(cid:80) i ∈U
θ i · 1 { T ˆ π i ̸
= π i } (cid:1) ≤ b 0 ∥
θ ∥is always true.
In other words, as long as the information on the labels is strong enough, AngleMin+ would not require any assumption on the unsupervised community detection algorithm.
For AngleMin+ to be consistent, we need the bound in Corollary 1 to be o (1) .
It then requires that for a small constant b 0 , ˆΠ U is b 0 -correct with probability 1 − o (1) .
This is a mild requirement and can be achieved by several unsupervised community detection algorithms.
The next corollary studies the specific version of AngleMin+, when ˆΠ U is from SCORE+:
Corollary 2.
Consider the DCBM model where (8)-(9) hold.
We apply SCORE+ to obtain ˆΠ U and plug it into AngleMin+.
As n → ∞ , suppose for some constant q 0 > 0 , min i ∈U θ i ≥ q 0 max i ∈U θ i , β n ∥ θ U ∥ ≥ q 0 (cid:112) log( n ) , β 2 n ∥ θ ∥ 1 θ ∗ → ∞ , and β 2 n ∥ θ ∥ 1 min k {∥ θ ( k ) L ∥ 1 } → ∞ .
Then, P (ˆ y ̸ = k ∗ ) → 0 , so the AngleMin+ estimate is consistent.
3.2 Comparison with an information theoretical lower bound We compare the performance of
AngleMin+ with an ideal estimate that has access to all model parameters, except for the community label k ∗ of the new node.
For simplicity, we first consider the case of K = 2 .
For any label predictor ˜ y for the new node, define Risk(˜ y )
= (cid:80) k ∗ ∈
[ K ] P (˜ y ̸
= k ∗ | π ∗ =
e k ∗ ) .
Lemma 2. Consider a DCBM with K = 2 and P = (1 − b ) I
+ b 1 2 1 ′ 2 .
Suppose θ ∗ =
o (1) , θ ∗ min k ∥ θ ( k ) L ∥
= o (1) , 1 − b =
o (1) , ∥ θ (1) L ∥ 1 ∥ θ (2) L ∥ 1 = ∥
θ (1) U ∥
∥ θ (2) U ∥ 1 = 1 .
There exists a constant c 4 > 0 such that inf ˜ y
{ Risk(˜ y ) } ≥ c 4 exp (cid:110) − 2[
+ o (1)] (1 −
[Equation]
· θ
[Equation]
( ∥ θ L ∥ 1 + ∥ θ U ∥ 1 ) (cid:111) , where the infimum is taken over all measurable functions of A , X , and parameters Π L , Π U , Θ , P , θ ∗ .
In AngleMin+, suppose the second part of condition 9 holds with c
3 = o (1) , ˆΠ U is ˜ b 0 -correct with ˜
b 0 a.s. → 0 .
There is a constant C 4 > 0 such that, Risk(ˆ y ) ≤ C 4 exp (cid:110) − [1 − o (1)] (1 − b )
[Equation]
(cid:111) .
Lemma 2 indicates that the classification error of AngleMin+ is almost the same as the information theoretical lower bound of an algorithm that knows all the parameters except π ∗ apart from a mild difference of the exponents.
This difference comes from two sources.
The first is the extra "2" in the exponent of Risk(ˆ y ) , which is largely an artifact of proof techniques, because we bound the total variation distance by the Hellinger distance (the total variation distance is hard to analyze directly).
The second is the difference of ∥ θ L ∥ 1 + ∥ θ U ∥ 1 in inf ˜ y { Risk(˜ y ) } and ( ∥ θ L ∥ 21 + ∥ θ U ∥ 21 )
∥ θ L ∥ 31 + ∥ θ U ∥ 31 in Risk(ˆ y ) .
Note that ( ∥ θ L ∥ 21 + ∥ θ U ∥ 21 ) 2 ∥ θ L ∥ 31 + ∥ θ U ∥ 31 ≤ ∥ θ L ∥ 1 + ∥ θ U ∥ 1 ≤ 1 .
125 ( ∥ θ L ∥ 21 + ∥ θ U ∥ 21 ) 2 ∥ θ L ∥ 31 + ∥ θ U ∥ 31 , so this difference is quite mild.
It arises from the fact that AngleMin+ does not aggregate the information in labeled and unlabeled data by adding the first and last K coordinates of f ( x ; H ) together.
The reason we do not do this is that unsupervised community detection methods only provide class labels up to a permutation, and practically it is really hard to estimate this permutation, which will result in the algorithm being extremely unstable.
To conclude, the difference of the error rate of our method and the information theoretical lower bound is mild, demonstrating that our algorithm is nearly optimal.
For a general K , we have a similar conclusion:
Theorem 3.
Suppose the conditions of Corollary 1 hold, where b 0 is properly small , and suppose that ˆΠ U is b 0 -correct.
Furthermore, we assume for sufficiently large constant C 3 , θ ∗ ≤ 1 C 3 , θ ∗ ≤ min k ∈
[ K ] C 3 ∥ θ ( k ) L ∥ 1 , and for a constant r 0 > 0 , min k ̸ = ℓ { P kℓ } ≥ r 0 .
Then, there is a constant ˜ c
= ˜ c
2 ( K, C 1 , C 2 , C 3 , c 3 , r 0 ) >
such that [ − log(˜ c 2 Risk(ˆ y ))] / [ − log(inf ˜
y
{ Risk(˜ y ) } )] ≥ ˜ c 2 .
3.3 In-sample Classification In this part, we briefly discuss the in-sample classification problem.
Formally, our goal is to estimate π i for all i ∈ U .
As mentioned in section 1, an in-sample classification algorithm can be directly derived from AngleMin+: for each i ∈ U , predict the label of i as ˆ y i
( H ) =
arg min 1 ≤ k ≤ K ψ (cid:0) f
( A ( k ) − i ; H i ) , f
( A − i,i ; H i ) (cid:1) , where A ( k ) − i is the subvector of A ( k ) by removing the i th entry, A − i,i is the subvector of A i by removing the i th entry, and H i is a ( |U| − 1)
× K projection matrix which may be different across distinct i .
As discussed in subsection 2, the choices of H i are quite flexible.
For purely theoretical convenience, we would focus on the case that H i =
ˆΠ U\{ i } .
For any in-sample classifier ˜
y
=
(˜ y i ) i ∈U ∈ [ K ] |U| , define the in-sample risk Risk ins (˜ y )
= 1 |U| (cid:80) i ∈U
(cid:80) k ∗ ∈
[ K ] P (˜ y i
̸
= k ∗ | π i =
e k ∗ ) .
For the above in-sample classification algorithm, we have similar theoretical results as in section 3 on consistency and efficiency under some very mild conditions:
Theorem 4.
Consider the DCBM model where (8)-(9) hold.
We apply SCORE+ to obtain ˆΠ U\{ i } and plug it into the above algorithm.
As n → ∞ , suppose for some constant q 0 > 0 , min i ∈U θ i ≥ q 0 max i ∈U θ i , β n ∥ θ U ∥ ≥ q 0 (cid:112) log( n ) , β 2 n
∥ θ ∥ 1 min i ∈U θ i → ∞ , and β 2 n ∥ θ ∥ 1 min k {∥ θ ( k ) L ∥ 1 } → ∞ .
Then, 1 |U| (cid:80) i ∈U
P
(ˆ y i ̸
= k i )
→ 0 , so the above in-sample classification algorithm is consistent.
Theorem 5.
Suppose the conditions of Corollary 1 hold, where b 0 is properly small , and suppose that ˆΠ U\{ i } is b 0 -correct for all i ∈ U .
Furthermore, we assume for sufficiently large constant C 3 , max i ∈U θ i ≤ 1 C 3 , max i ∈U θ i ≤ min k ∈
[ K ] C 3 ∥ θ ( k ) L ∥ 1 , log( |U| ) ≤ C 3 β 2 n ∥ θ ∥ 1 min i ∈U θ i , and for a constant r 0 > 0 , min k ̸ = ℓ { P kℓ } ≥ r 0 .
Then, there is a constant ˜ c
= ˜ c
21 ( K, C 1 , C 2 , C 3 , c 3 , r 0 ) >such that [ − log(˜ c 21 Risk ins (ˆ y ))] / [ − log(inf ˜
y { Risk ins (˜ y ) } )] ≥ ˜ c 21 , so the above in-sample classification algorithm is efficient.
[Figure]
are
E MPIRICAL S TUDY
We study the performance of AngelMin+, where ˆΠ U is from SCORE+ (Jin et al., 2021).
We compare our methods with SNMF (Yang et al., 2015) (a representative of semi-supervised approaches) and
SCORE+ (a fully unsupervised approach).
We also compare our algorithm to typical GNN methods (Kipf & Welling, 2016) in the real data part.
Simulations : To illustrate how information in A UU will improve the classification accuracy, we would consider AngleMin in (4) in simulations.
Also, to cast light on how information on unlabeled data will ameliorate the classification accuracy, we consider a special version of AngleMin+ in simulations by feeding into the algorithm only A LL and X L .
It ignores information on unlabeled data and only uses the subnetwork consisting of labeled nodes.
We call it AngleMin+(subnetwork).
This method is practically uninteresting, but it serves as a representative of the fully supervised approach that ignores unlabeled nodes.
We simulate data from the DCBM with ( n, K ) =
To generate P , we draw its (off diagonal) entries from Uniform(0 , 1) , and then symmetrize it.
We generate the degree heterogeneity parameters θ i i.i.d.
from one of the 4 following distributions: n − 0 .
5 (cid:112) log( n )Gamma(3 . 5) , n − 0 .
25 Gamma(3 . 5) , n − 0 .
5 (cid:112) log( n )Pareto(3 . 5) , n − 0 .
25 Pareto(3 .
They cover most scenarios: Gamma distributions have considerable mass near 0, so the network has severely low degree nodes; Pareto distributions have heavy tails, so the network has severely high degree nodes.
The scaling n − 0 .
5 (cid:112) log( n ) corresponds to the sparse regime, where the average node degree is ≍ log( n ) 2 , and n − 0 .
25 corresponds to the dense regime, with average node degree ≍ √ n .
We consider two cases of Π : the balanced case (bal.) and the imbalanced case (inbal.).
In the former, π ( i ) are i.i.d.
from Multinomial(1 / 3 , 1 / 3 , 1 / 3) , and in the latter, π ( i ) are i.i.d.
from
Multinomial(0 .
We repeat the simulation 100 times.
Our results are presented in Figure 1, which shows the average classification error of each algorithm as the number of labeled nodes, N L increases.
The plots indicate that AngleMin+ outperforms other methods in all the cases.
Furthermore, though AngleMin is not so good as AngleMin+ when N L is small, it still surpasses all the other approaches except AngleMin+ in most scenarios.
Compared to supervised and unsupervised methods which only use part of the data, we can see that AngleMin+ gains a great amount of accuracy by leveraging on both the labeled and unlabeled data.
Real data : We consider three benchmark datasets for community detection, Caltech (Traud et al., 2012) , Simmons (Traud et al., 2012) , and Polblogs (Adamic & Glance, 2005).
For each data set, we separate nodes into 10 folds and treat each fold as the test data at a time, with the other 9 folds as training data.
In the training network, we randomly choose n L nodes as labeled nodes.
We then estimate the label of each node in the test data and report the misclassification error rate (averaged over 10 folds).
We consider n L /n ∈ { 0 . 3 , 0 .
7 } , where n is the number of nodes in training data.
The results are shown in Table 1.
In most cases, AngleMin+ significantly outperforms the other methods (unsupervised or semi-supervised).
Additionally, we notice that in the Polblogs data, the standard deviation of the error of SCORE+ is quite large, indicating that its performance is unstable.
Remarkably, even though AngleMin+ uses SCORE+ to initialize, the performance of AngleMin+ is nearly unaffected: It still achieves low means and standard deviations in misclassification error.
This is consistent with our theory in Section 3.
We also compare the running time of different methods (please see Section B of the appendix) and find that AngleMin+ is much faster than SNMF
[Table] [Table]
GNN is a popular approach for attributed node clustering.
Although it is not designed for the case of no node attributes, we are still interested in whether GNN can be easily adapted to our setting by self-created features.
We take the GCN method in Kipf & Welling (2016) and consider 6 schemes of creating a feature vector for each node: i) a 50-dimensional constant vector of 1 ’s, ii) a 50-dimensional randomly generated feature vector, iii) the n -dimensional adjacency vector, iv) the vector of landing probabilities (LP) (Li et al., 2019) (which contains network topology information), v) the embedding vector from node2vec (Grover & Leskovec, 2016), and vi) a practically infeasible vector e
i
A Π ∈ R K (which uses the true Π ).
The results are in Table 1.
GCN performs unsatisfactorily, regardless of how the features are created.
For example, propagating messages with all-1 vectors seems to result in over-smoothing; and using adjacency vectors as node features means that the feature transformation linear layers’ size changes with the number of nodes in a network, which could heavily overfit due to too many parameters.
We conclude that it is not easy to adapt GNN to the case of no node attributes.
For a fairer comparison, we also consider a real network, Citeseer (Sen et al., 2008), that contains node features.
We consider two state-of-the-art semi-supervised GNN algorithms, GCN (Kipf &
Welling, 2016) and MasG (Jin et al., 2019).
Our methods can also be generalized to accommodate node features.
Using the “fusion" idea surveyed in Chunaev et al.
(2019), we “fuse" the adjacency matrix ¯ A (on n +1 nodes) and node features into a weighted adjacency matrix ¯ A fuse (see the appendix for details).
We denote its top left block by A fuse ∈ R n × n and its last column by X fuse ∈ R n and apply AngleMin+ by replacing ( A, X ) by ( A fuse , X fuse ) .
The misclassification error averaged over 10 data splits is reported in Table 2.
The error rates of GCN and MasG are quoted from those papers, which are based on 1 particular data split.
We also re-run GCN on our 10 data splits.
[Table]
Conclusion and discussions : In this paper, we propose a fast semi-supervised community detection algorithm AngleMin+
based on the structural similarity metric of DCBM.
Our method is able to address degree heterogeneity and non-assortative network, is computationally fast, and possesses favorable theoretical properties on consistency and efficiency.
Also, our algorithm performs well on both simulations and real data, indicating its strong usage in practice.
There are possible extensions for our method.
Our method does not directly deal with soft label (a.k.a mixed membership) where the available label information is the probability of a certain node being in each community.
We are currently endeavoring to solve this by fitting our algorithm into the degree-corrected mixed membership model (DCMM), and developing sharp theories for it. A CKNOWLEDGMENTS
This work is partially supported by the NSF CAREER grant DMS-1943902.
E THICS S TATEMENT
This paper proposes a novel semi-supervised community detection algorithm, AngleMin+, based on the structural similarity metric of DCBM.
Our method may be maliciously manipulated to identify certain group of people such as dissenters.
This is a common drawback of all the community detection algorithms and we think that this can be solved by replacing the network data by their differential private counterpart.
All the real data we use come from public datasets which we have clearly cited and we do not think that they will raise any privacy issues or other potential problems
R EPRODUCIBILITY S TATEMENT
We provide detailed theory on our algorithm AngleMin+.
we derive explicit bounds for the misclassification probability of our method under DCBM, and show that it is consistent.
We also study the efficiency of our method by comparing its misclassification probability with that of an ideal classifier having access to the community labels of all nodes.
Additionally, we provide clear explanations and insights of our theory.
All the proofs, together with some generalization of our theory, are available in the appendix.
Also, we perform empirical study on our proposed algorithms under both simulations and real data settings and we consider a large number of scenarios in both cases.
All the codes are available in the supplementary materials.
A PPENDIX A Pseudo
code of the algorithm
B Running Time
C Comparison with Local Refinement Algorithm
D Generalization of Lemma
E Preliminaries
F Proof of Lemma
G Proof of Theorem
G.1 Proof of Lemma 6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
H Proof of Theorem
H.1 Proof of Lemma 8 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
H.2 Proof of Lemma 9 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
I Proof of
Corollary 1,
I.
Proof of Corollary 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
I.
Proof of Corollary 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
J Proof of
Lemma
J.
Proof of Lower Bound (75) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
J.
Proof of Upper Bound (76’) . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
K Proof of Theorem
L Proof of Theorem 4,
L.1 Proof of Theorem 4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
L.2 Proof of Theorem 5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
A P SEUDO CODE OF THE ALGORITHM
Below are the pseudo code of AngleMin+ which is deferred to the appendix due to the page limit.
Algorithm 1: AngleMin+
Input: Number of communities K , adjacency matrix A ∈ R n n , community labels y i for nodes
in
i of edges
Unsupervised community detection: Apply a community detection algorithm (e
g., SCORE+ in Section 2) on A UU , and let ˆΠ U
=
[ˆ π i ] i ∈U store the estimated community labels, where ˆ π i =
e k
if and only if node k is clustered to community k , 1 ≤ k ≤ K . 2.
Assigning the community label to a new node: Let Π L =
[ π i ] i ∈L contain the community memberships of labeled nodes, where π i =
e k
if and only if y i
=
k , 1 ≤ k ≤ K .
Let H =
ˆΠ U .
Compute
[Equation]
Suppose k ∗ minimizes the angle between v k and x , among 1 ≤ k ≤ K (if there is a tie, pick
the smaller
k
Output ˆ y = k ∗ .
B R UNNING T IME
Table 3 exhibits the running time of all the algorithms considered in Table 1.
It can be seen from the result that our algorithm AngleMin+ is much faster than all the other algorithms.
This is one of the merits of our method.
[Figure]
[Table]
C C OMPARISON WITH L OCAL R EFINEMENT A LGORITHM
We would first illustrate why local refinement may not work with an example and then explain our insight behind it.
Consider a network with n = 4 m nodes and K = 2 communities.
Suppose that there are 2 m labeled nodes, m of them are in community C 1 and have degree heterogeneity θ = 0 . 8 , and the other m of them are in community C 2 and have degree heterogeneity θ = 0 .
There are 2 m unlabeled nodes, m of them are in community C 1 and have degree heterogeneity θ = 0 . 6 , and the other m of them are in community C 2 and have degree heterogeneity θ = 0 .
The P matrix is defined as follows:
[Equation]
Under this setting, all the assumptions in our paper are satisfied.
On the other hand, recall that the prototypical refinement algorithm, Algorithm 2 of Gao et al.
(2018) is defined as follows:
[Equation]
where ˆ y 0 is a vector of community label and ˆ y is the refined community label.
For semi-supervised setting, one may consider the following modification of local refinement algorithm:
(i) Apply local refinement algorithm, with known labels to assign nodes in U .
(ii) With the labels of all nodes, one updates the labels of every node by applying the same refinement procedure.
Under the setting of our toy example, for step (i), all the unlabeled nodes which are actually in community C 2 will be assigned to community C 1 with probability converging to 1 as n → ∞ .
The reason is that for any unlabeled node i which is actually in community C 2 , when u = 1 , { A ij : j ∈ L , y j = u } are iid ∼ Bern ( θ i θ j P 21 ) =
Bern ( θ i · 0 . 8 · 0 . 9) =
Bern (0 .
72 θ i ) ; when u = 2 , { A ij : j ∈ L , y j = u } are iid ∼ Bern ( θ i θ j P 22 )
=
Bern ( θ i · 0 . 5 · 1) =
Bern (0 .
5 θ i ) .
Hence, by law of large numbers,
[Equation]
Consequently, the prototypical refinement algorithm will incorrectly assign all the unlabeled nodes which are actually in the community C 2 to C 1 with probability converging to 1 as n → ∞ .
This will cause a classification error of at least 50% .
Based on the huge classification error in step (i), step (ii) will also perform poorly.
Similar to the reasoning above, by law of large numbers, it can be shown that after step (ii).
the algorithm will still assign all the unlabeled nodes which are actually in the community C 2 to C 1 with probability converging to 1 as n → ∞ .
In other words, even if the local refinement algorithm is applied to the whole network, a classification error of at least 50% will always remain.
Even if all the labels of the nodes are known, applying the local refinement algorithm still can cause severe errors.
Still consider our toy example.
Suppose now that we know the label of all the nodes, and we perform the local refinement algorithm on these known labels in an attempt to purify them.
By the law of large numbers, however, it is not hard to show that for any node i which is actually in community C 2 ,
[Equation]
Consequently, similar to the previous cases, the local refinement algorithm will incorrectly assign all the unlabeled nodes which are actually in the community C 2 to C 1 with probability converging to 1 as n → ∞ .
This will cause a classification error of at least 50% , even though the input of the algorithm is actually the true label vector.
To conclude, in general, the local refinement algorithms may not work under the broad settings of our paper.
Intrinsically, label refinement is quite challenging when there is moderate degree heterogeneity, not to mention the scenarios where non-assortative networks occur.
Local refinement algorithm works theoretically because strong assumptions on degree heterogeneity are imposed.
For instance, it is required that the mean of the degree heterogeneity parameter in each community is 1 + o (1) , which means that the network is extremely dense and that the degree heterogeneity parameters across communities are strongly balanced.
Both of these two assumptions are hardly true in the real world, where most of the networks are sparse and imbalanced.
Gao et al.
(2018) is a very good paper, but we think that local refinement algorithm or similar algorithms might not be good choices for our problem.
D G ENERALIZATION OF L EMMA
In the main paper, for the smoothness and comprehensibility of the text, we do not present the most general form of Lemma 2.
We have a more general version of the lemma by relaxing the condition ∥ θ (1) L ∥∥ θ (2) L ∥ 1 = ∥ θ (1)
U ∥∥ θ (2) U ∥ 1 = 1 .
Please see Section J for more details.
E P RELIMINARIES
For any positive integer N , Define [ N ] = { 1 , 2 , ..., N } .
For a matrix D and two index sets S 1 , S 2 , define D S 1 S 2 to be the submatrix ( D ij ) i ∈ S 1 ,j ∈ S 2 , D S 1 · to be the submatrix ( D ij ) i ∈ S 1 ,j ∈L∪U , and D · S 2 to be the submatrix ( D ij )
i ∈L∪U , |∈S ∈ .
The two main assumptions (8), (9) in the main paper are presented below for convenience.
[Equation]
, where constant c 3 is properly small.
We would specify this precisely in our proofs.
A number of lemmas used in our proofs will be presented as follows.
The following lemma shows that sin x and x have the same order.
Lemma 3.
Let x ∈ R .
When x ≥ 0 , sin x ≤ x ; when x ∈ [0 , π 2 ] , sin x ≥ 2 π x .
Lemma 3 is quite obvious, but for the completeness of our work, we provide a proof for it.
Proof.
Let g 1 ( x ) = sin x − x .
Then
[Equation]
Hence g 1 ( x ) is monotonously decreasing on R .
As a result, when x ≥ 0 , g 1 ( x ) ≥ g 1 (0) = 0 .
Therefore, when x ≥ 0 , sin x ≤ x .
Let g 2 ( x ) =
sin x − 2 π x .
Then
[Equation]
Since cos x is monotonously decreasing on [0 , π 2 ] , ddx g 2 ( x ) ≥ 0 when x ∈ [0 , arccos 2 π ] and ddx g 2 ( x ) ≤ 0 when x ∈ [arccos 2 π , π 2 ] .
Hence, g 2 ( x ) is monotonously increasing on [0 , arccos 2 π ] and is monotonously decreasing on [arccos 2 π , π 2 ] .
As a result, when x ∈ [0 , π 2 ] ,
[Equation]
Therefore, when x ∈ [0 , π 2 ] , sin x ≥ 2 π x .
The following lemma demonstrates that the angle ψ ( u, v ) in Definition 1 satisfies the triangle inequality, so that it can be regarded as a sort of "metric".
Lemma 4 (Angle Inequality) .
Let x, y, z be three real vectors.
Then,
[Equation]
The proof of Lemma 4 can be seen in Gustafson & Rao (1997), pg 56.
Also, for completeness of our work, we provide a proof of Lemma 4.
Proof.
Let ˜ x
= x ∥ x ∥ , ˜ y
= y ∥
y ∥ , ˜ z
= z ∥
z ∥ , then cos ψ ( x, y ) = ⟨ ˜ x, ˜ y ⟩ , cos ψ ( y, z ) = ⟨ ˜ y, ˜ z ⟩ , cos ψ ( x, z ) = ⟨ ˜ x, ˜ z ⟩ .
Consider the following matrix
[Equation]
For any vector c = ( c 1 , c 2 , c 3 ) T ∈ R
[Equation]
Also, G is symmetric.
Therefore, G is positive semi-definite.
As a result, det ( G ) ≥ 0 .
In other word,
[Equation]
The above inequality can be rewritten as
[Equation]
))or (sin ψ ( x, y ) sin ψ ( y, z )) 2 ≥ (cos ψ ( x, y )
cos ψ ( y, z ) − cos ψ ( x, z ))
By definition of arccos , ψ ( x, y ) , ψ ( y, z ) ∈ [0 , π ] , so sin ψ ( x, y ) sin ψ ( y, z ) ≥ 0 .
Therefore,
[Equation]
x,
[Equation]
If ψ ( x, y ) + ψ ( y, z ) > π , because by definition of arccos , ψ ( x, z ) ∈ [0 , π ] , it is immediate that ψ ( x, z ) ≤ ψ ( x, y ) + ψ ( y, z )
If ψ ( x, y ) + ψ ( y, z ) ≤ π , recall that ψ ( x, y ) , ψ ( y, z ) ∈ [0 , π ] , hence ψ ( x, y )
+ ψ ( y, z ) ∈ [0 , π ] .
Also, ψ ( x, z ) ∈ [0 , π ] .
Since cos is monotone decreasing on [0 , π ] , we obtain
[Equation]
x,
[Equation]
y
[Equation]
In all, ψ
[Equation] [Equation]
The following lemma relates angle to Euclidean distance.
Lemma 5.
Suppose that x, y ∈ R m , ∥ y
∥
<
∥ x ∥ .
Then,
[Equation]
The equality holds if and only if ⟨ y, x + y ⟩ =
Proof.
Let ρ = ∥
y ∥
∥ x ∥ , ψ 0 = ψ ( x, y ) .
Then ⟨ x, y ⟩ = ∥ x ∥∥ y ∥ cos ψ 0 .
Notice that
[Equation]
This can be rewritten as
[Equation]
Since ∥ y ∥ <
∥ x ∥ , so ρ < 1 , 1 + ρ cos ψ 0 > 0 .
Hence
[Equation]
ψ
[Equation]
Plugging in ρ = ∥
y ∥
∥ x ∥ , we have
[Equation]
Since ⟨ x, y ⟩ = ∥ x ∥∥ y ∥ cos ψ 0 , ∥ x ∥ 2 + ⟨ x, y ⟩ ∥ x ∥ (cid:112)
∥ x
∥ 2 + ∥ y ∥ 2 +
[Equation]
⟨ x, y ⟩ ≥ (cid:115)
[Equation]
y ∥
[Equation]
∥
[Equation]
∥
[Equation]
⟨ x,
[Equation] [Equation]
⟨ x + y, x + y ⟩ ≥ (cid:115) 1 −
[Equation]
y ∥
[Equation]
∥ x ∥
In other words,
[Equation]
Since ∥ y ∥
∥ x ∥ ≥ 0 , arcsin (cid:16) ∥
y ∥
∥ x ∥ (cid:17) ∈ [0 , π 2 ] .
Therefore, by monotonicity of cos on [0 , π 2 ] ,
[Equation]
arcsin
[Equation]
(cid:19)
The equality holds if and only if ρ 2 ( ρ + cos ψ 0 ) 2 ≥ 0 , or equivalently, ( ∥ y ∥ 2 + ∥ x ∥∥ y ∥ cos ψ 0 ) 2 =
This can be reduced to ⟨ y, x + y ⟩ =
F P ROOF OF L EMMA
Lemma 1. Consider the DCBM model where (8)-(9) are satisfied.
We define three K × K matrices:
G LL =
Π ′L Θ LL Π L , G UU = Π ′U Θ UU Π U , and Q = G − 1 UU Π ′U Θ UU H .
For 1 ≤ k ≤ K , ψ k ( H ) = arccos (cid:16)
M kk ∗ √
M kk √ M k ∗ k ∗ (cid:17) , where M = P (cid:16) G 2 LL + G UU QQ ′ G UU (cid:17) P.
Proof.
Recall that
[Equation]
where
[Equation]
and
[Equation]
which indicates
[Equation]
Hence
[Equation]
Notice that
[Equation]
In other words
[Equation]
Hence
[Equation]
Similarly,
[Equation]
Pe k ∗
Therefore
[Equation]
Similarly
[Equation]
Hence,
[Equation]
G P ROOF OF T HEOREM
Theorem 1.
Consider the DCBM model where (8)-(9) hold.
Let k ∗ denote the true community label of the new node.
Suppose ˆΠ U is b 0 -correct, for a constant b 0 ∈ (0 , 1) .
When b 0 is properly small, there exists a constant c 0 > 0 , which does not depend on b 0 , such that ψ k ∗ (ˆΠ U )
=
and min k ̸ = k ∗ { ψ k (ˆΠ U ) } ≥ c 0 β n .
Proof.
Define G LL =
Π ′L Θ LL Π L , G UU = Π ′U Θ UU Π U , Q = G − 1 UU Π ′U Θ UU ˆΠ U , and M =
P (cid:16) G 2 LL + G UU QQ ′ G UU (cid:17) P as in Lemma 1.
According to Lemma 1,
[Equation]
Hence,
[Equation]
When k ̸ = k ∗ , according to Lemma 3,
[Equation]
=
[Equation]
√ M
[Equation]
∗
[Equation]
∗
[Equation]
Let D M = diag
( M 11 , ..., M KK ) ,
˜ M
= D − 12 M MD − 12 M .
Then ( e k − e k ∗ ) ′ ˜
M ( e k − e k ∗ ) =
˜ M kk + ˜ M k ∗ k ∗ − ˜ M kk ∗ −
˜ M k ∗ k =
M kk √
M kk √ M kk +
M k ∗ k ∗ √
M k ∗ k ∗ √ M k ∗ k ∗ −
M kk ∗ √
M kk √ M k ∗ k ∗ −
M k ∗ k
[Equation]
M k ∗ k ∗ √ M kk = 2 (cid:16) 1 −
M kk ∗ √
M kk √ M k ∗ k ∗ (cid:17) (19)
Hence,
[Equation]
˜ M is affected by ˆΠ U and is complicated to evaluate directly.
Hence, we would first evaluate its oracle version and then reduce the noisy version to the oracle version.
Define the oracle version of M as follow, where ˆΠ U is replaced by Π U
[Equation]
Similarly, define the oracle version of D M , D M (
[Equation]
) =
diag( M (0)11 , ..., M (0) KK ) , and the oracle version of ˜ M , ˜ M (0) =
D −
[Equation]
M
[Equation]
D
[Equation] [Equation]
Oracle Case We first study the oracle case | α ′ ˜ M (0) α | .
Since G LL
[Equation] [Equation]
= diag (cid:16)
∥ θ (1) U ∥ 1 , ..., ∥ θ ( K ) U ∥ 1 (cid:17) , which indicates that G 2 LL + G 2 UU = diag (cid:16)(cid:16) ∥ θ ( k ) L ∥ 21 + ∥ θ ( k ) U ∥ 21 (cid:17) K k =1 (cid:17) , for any vector α ∈ R k ,
[Equation]
( Cauchy-Schwartz Inequality )
[Equation]
It remains to study the noisy case.
We reduce the noisy case to the oracle case through the following lemma.
Lemma 6.
Denote
[Equation]
Suppose that C 5 ≤ 14 .
Then, for any vector α ∈ R k ,
[Equation]
The proof of Lemma 6 is quite tedious and we would defer it to the end of this section
[Equation]
Set b 0 ≤ 1 32 K 2 √ KC 22 , then C 5 ≤ ∥ θ U ∥ 1 4 ∥ θ ∥ 1 ≤ 14 .
As a result, combining (21) with Lemma 6, we have for any vector α ∈ R k ,
[Equation]
Hence, take α = e k − e k ∗ in (24) and combine it with (20), we obtain that for any k ∈ [ K ]
[Equation]
Therefore, set c 0 = (cid:113) 13 C 22 , we have
[Equation]
In all, when b 0 is properly small such that b 0 ≤
[Equation]
, there exists constant c
[Equation]
(cid:113) 13 C
[Equation]
not depending on b 0 such that ψ k ∗ (ˆΠ U ) = 0 and min k ̸ = k ∗ { ψ k (ˆΠ U ) } ≥ c 0 β n .
G. P ROOF OF L EMMA
Proof.
For any vector α ∈ R k ,
[Equation] [Equation]
The first part on the RHS of (27),
[Equation]
Denote G ( d ) =
Π ′U Θ UU (ˆΠ U ˆΠ ′U − Π
U Π ′U )
Θ UU Π U .
Define η l ˜ l
= (cid:80) i ∈U ,π i =
e l , ˆ π i =
e ˜ l θ i .
In other words, η l ˜ l is the sum of the degree heterogeneity parameters of all the nodes in U with true label l and estimated label ˜ l .
Then,
[Equation]
where I l =˜ l is the indicator function of event { l = ˜ l } .
Hence,
[Equation]
Since ˆΠ U is b 0 correct, there exists permutation T of K columns of ˆΠ U such that (cid:0)(cid:80) i ∈U θ i · 1 { T ˆ π i ̸
= π i
[Equation]
≤
[Equation]
Let r = r ( l ) satisfies e r
=
T − 1 e l .
When l = ˜ l , we have
[Equation]
When l ̸ =
˜ l , we have
[Equation]
Therefore,
[Equation]
∥ ∞ ≤ (cid:88) l, ˜ l ∈
[ K ] | G ( d ) l ˜ l | = (cid:88) l ∈ [ K ] | G ( d ) ll | + (cid:88) l ̸ =
˜ l | G ( d ) ll | ≤ (cid:88) l ∈
[ K ] (cid:16) 2( (cid:88) s
̸ = r η ls )( (cid:88) s ∈ [ K ] η ls ) (cid:17) + (cid:88) l ̸ =˜ l (cid:88) s ∈ [ K ] η ls η ˜ ls ≤ 2 max l (cid:16) (cid:88) s ∈ [ K ] η ls (cid:17)(cid:0) (cid:88) l ∈ [ K ] ,s ̸
= r ( l ) η ls (cid:1) + (cid:88) s ∈ [ K ] (cid:88) l ̸ =
˜ l
η ls η ˜ ls = 2 max l (cid:16) (cid:88) s ∈ [ K ] η ls (cid:17)(cid:0) (cid:88) l ∈
[ K ] ,s ̸ = r ( l ) η ls (cid:1) + (cid:88) s
∈ [ K ] (cid:2)(cid:0)(cid:88) l ∈
[ k ] η ls (cid:1) 2 − (cid:88) l ∈ [ k ] η 2 ls (cid:3) ≤ 2 max l (cid:16) (cid:88) s ∈ [ K ] η ls (cid:17)(cid:0) (cid:88) l ∈ [ K ] ,s ̸
= r ( l ) η ls (cid:1) + (cid:88) s ∈ [ K ] (cid:2)(cid:0)(cid:88) l ∈ [ k ] η ls (cid:1) 2 − (cid:88)
r
( l )=
s
η 2 ls (cid:3) = 2 max l (cid:16) (cid:88) s ∈ [ K ] η ls (cid:17)(cid:0) (cid:88) l ∈
[ K ] ,s ̸ = r ( l ) η ls (cid:1) + (cid:88) s
∈ [ K ] (cid:2)(cid:0) (cid:88) r ( l ) ̸
= s η ls (cid:1)(cid:0) (cid:88) l ∈ [ K ] η ls + (cid:88) r ( l )
=
s η ls (cid:1)(cid:3)
[Table]
[Equation]
Recall that T satisfies (cid:0)(cid:80)
i
[Equation]
θ i · 1 { T ˆ π i ̸
= π i } (cid:1) ≤ b
∥ θ ∥ 1 , hence
[Equation]
Therefore,
[Equation]
Plugging (33) into (28), we obtain
[Equation]
On the other hand,
[Equation]
Since G LL =
[Equation]
diag( ∥ θ (1) U ∥ 1 , ..., ∥ θ ( K ) U ∥ 1 ) ,
[Equation]
Recall condition (9) in the main paper,
[Equation]
Hence
[Equation]
Comparing (35) with (34)
[Equation]
we obtain
[Equation] [Equation]
Consequently, we bound the first part of (27) by the second part of (27).
It remains to bound the second part of (27).
Since D M , D M (0) , M (0) are all diagonal matrices
[Equation]
we can rewrite the second part on the LHS of (27) as follows:
[Equation] [Equation]
[Table]
-Schwartz
[Equation]
[Table]
in
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
Plugging (38) into (37), we have
[Equation]
[Equation]
Combining (27), (36)
[Equation]
and (39), we have
[Equation]
Hence for any vector α ∈ R k ,
[Equation]
To conclude, in this subsection, we successfully reduce the noisy case | α ′ ˜
Mα | to the oracle case | α ′ ˜
M (0) α | .
Result (41) will also be used in the proof of other claims.
H P ROOF OF T HEOREM
Theorem 2.
Consider the DCBM model where (8)-(9) hold.
There exists constant C > 0 , such that for any δ ∈ (0 , 1 / 2) , with probability 1 − δ , simultaneously for 1 ≤ k ≤ K ,
[Equation]
To prove Theorem 2, we need a famous concentration inequality, Bernstein inequality:
Lemma 7 (Bernstein inequality) .
Suppose X 1 , ..., X n are independent random variables such that E
X i = 0 , | X i | ≤ b and V ar ( X i ) ≤ σ 2 i for all i .
Let σ 2 = n − 1 (cid:80) ni
=1 σ 2 i .
Then, for any t > 0 ,
P
[Equation]
n
[Equation]
| n (cid:88)
i
[Equation] [Equation]
The proof of Lemma 7, Bernstein inequality, can be seen in most probability textbooks such as
Uspensky (1937).
Proof.
Recall that for k ∈ [ K ] ,
[Equation]
Denote v k = f
( A ( k ) ; ˆΠ U ) , v ∗ =
f ( X ; ˆΠ U ) , ˜ v k = f (Ω ( k ) ; ˆΠ U ) , ˜ v ∗ =
f ( EX ; ˆΠ U ) , k ∈
[ K ] .
Then, by Lemma 4,
[Equation]
Similarly, ψ
[Equation]
Therefore, | ˆ ψ k (ˆΠ
[Equation] [Equation]
ψ
[Equation]
ˆΠ
[Equation]
|
[Equation] [Equation]
For any ϕ 1 , ..., ϕ K ≥ 0 .
[Equation]
By definition of ψ , ˆ ψ k (ˆΠ U ) , ψ k (ˆΠ U ) ∈ [0 , π ] .
Hence, | ˆ ψ k (ˆΠ U ) − ψ k (ˆΠ U ) | ∈
[0 , π ] .
As a result, when ϕ k ≥ π ,
[Equation]
When ϕ k < π , by (42),
[Equation]
By lemma 5, when ∥ v k − ˜ v k ∥ < ∥ ˜ v k ∥
[Equation]
∥
Hence, for any ϕ ∈ [0 , π 2 ) , ∥ v k − ˜ v k ∥ ≤ sin( ϕ ) ∥
˜ v k ∥ implies ψ ( v k , ˜ v k ) ≤ ϕ .
As a result, for any ϕ ∈ [0 , π 2 ) , ψ ( v k , ˜ v k ) > ϕ implies ∥ v k − ˜ v k ∥ > sin( ϕ ) ∥ ˜ v k ∥ .
Similarly, for any ϕ ∈ [0 , π 2 ) , ψ ( v ∗ , ˜ v ∗ ) > ϕ implies ∥ v ∗ − ˜ v ∗ ∥ ≥ sin( ϕ ) ∥
˜
v ∗ ∥ .
By definition of ϕ k , ϕ k ≥ 0 .
Hence, when ϕ k < π , 12 ϕ k ∈ [0 , π 2 ) .
Plugging the above results into (44), we have
[Equation]
Since when ϕ k < π , 12 ϕ k ∈ [0 , π 2 ] , by Lemma 3, sin( 12 ϕ k ) ≥ 2 π 12 ϕ k = 1 π ϕ k .
Plugging back to (45), we have when ϕ k < π ,
[Equation]
It remains to evaluate P (cid:16) | ( v k − ˜ v k ) l | ≥ 1 π
[Equation]
K ϕ k ∥
˜ v k ∥ (cid:17) and P (cid:16) | ( v ∗ − ˜ v ∗ ) l | ≥ 1 π √ K ϕ k
∥
˜
v ∗ ∥ (cid:17) , which are illustrated in the following two lemmas.
Lemma 8.
Define C 6 =
[Equation]
When
[Equation]
Lemma 9.
Define C 7 =
[Equation]
Then,
[Equation]
The proof of Lemma 8 and 9 are quite tedious.
We would defer their proofs to the end of this section.
Choose
[Equation]
Then leveraging on Lemma 8 and
[Equation]
we have when C ≥ 2 √ 2 πK 2 ,
P (cid:16) | ( v k − ˜ v k ) l | ≥
[Equation] [Equation]
Plugging (47) and (48) back to (46), leveraging on the fact that δ ≤ 12 < 1 , we obtain when ϕ k < π , and C ≥ 2 √ 2 πK 2 ,
[Equation]
Recall that when ϕ k ≥ π ,
[Equation]
In all, we have that when C ≥ 2 √ 2 πK 2 ,
[Equation]
Substituting (49) into (43), we obtain that when C ≥ 2 √ 2 πK 2 ,
[Equation]
Hence, it suffices to make 8 K 2 δ C 6 ≤ δ .
Choose
[Equation] [Equation]
Then C 6 − 1 ≥ log(8 K 2 ) log ≥ 1 .
Since δ ≤ 12 ,
[Equation]
As a result, 8 K 2 δ C 6 ≤ δ .
Hence, choose C as in (51), then C > ) , and for any δ ∈ (0 , 1 / 2) ,
[Equation]
To conclude, there exists constant C > 0 , such that for any δ ∈ (0 , 1 / 2) , with probability 1 − δ , simultaneously for 1 ≤ k ≤ K ,
[Equation]
H. P ROOF OF L EMMA
Proof.
When l ∈ [ K ] , (˜ v k ) l
[Equation]
k )
; ˆΠ U
[Equation]
(cid:88) i ∈C k ∩L (cid:88)
j ∈C l ∩L [Equation] ij
When l ∈ { K + 1 , ..., 2 K } , define
[Equation]
, then
[Equation]
Hence
[Equation]
( Identifiability condition
[Equation]
When l ∈ [ K ] ,
[Equation]
Recall that,
[Equation]
So
[Equation]
When l ∈ [ K ] \{ k } , since ˆΠ U only depends on A UU , it is independent of A LL .
Hence, given ˆΠ U , { A ij − Ω ij : i ∈ C k ∩ L , j ∈ C l ∩ L} are a collection of |C k ∩ L||C l ∩ L| independent random variables.
Furthermore, given ˆΠ U , for any i ∈ C k ∩ L , j ∈ C l ∩ L ,
[Equation]
Also,
[Equation]
So | A ij − Ω ij | ≤ 1 .
Additionally,
[Equation]
Therefore, denote n kl = |C k ∩ L||C l ∩ L| , by Lemma 7,
[Equation]
When l = k , { A ij − Ω ij : i, j ∈ C k ∩L , i < j } are a collection of 12 |C k ∩L| ( |C k ∩L|− 1) independent random variables.
Furthermore, for any i, j ∈ C k ∩ L , i < j ,
E ( A ij − Ω ij ) =
E A ij − Ω ij =
Ω ij − Ω ij =
Also, − 1 ≤ − Ω ij ≤ A ij − Ω ij ≤ A ij ≤
So | A ij − Ω ij | ≤ 1 .
Additionally, var ( A ij − Ω ij ) =
var ( A ij ) =
Ω ij (1 − Ω ij ) ≤ Ω ij
Denote n kk = 12 |C k ∩ L| ( |C k ∩ L| − 1) , we have
P (cid:16) | ( v k − ˜ v k ) l | ≥
[Equation]
K ϕ
[Equation]
k ∥ (cid:17) =
[Equation] [Equation]
Notice that
[Equation]
Since ϕ
[Equation]
( Identifiability condition ) =
[Equation]
Therefore
[Equation]
by Lemma 7,
[Equation] [Equation]
When l ∈ { K + 1 , ..., 2 K } , recall
[Equation]
e
[Equation]
So
[Equation]
Recall that
[Equation]
So
[Equation]
Since ˆΠ U only depends on A UU , it is independent of A LU .
Hence, given ˆΠ U , { A ij − Ω ij : i ∈
C k ∩ L , j ∈ ˆ C l } are a collection of |C k ∩ L|| ˆ C l | independent random variables.
Furthermore, given ˆΠ U , for any i ∈ C k ∩ L , j ∈ ˆ C l ,
[Equation]
Also,
[Equation]
So
[Equation]
| ≤ 1 .
Additionally,
[Equation]
Therefore
[Equation]
denote ˆ n kl =
|C k ∩ L|| ˆ C l | , by Lemma 7,
P
[Equation]

[Equation] [Equation]
In all
[Equation]
for any l ∈ [2 K ] ,
[Equation]
Plugging (53) into (59), we obtain
[Equation]
That concludes the proof.
H. P ROOF OF L EMMA
The proof of Lemma 9 is nearly the same as Lemma 8.
For the completeness of our paper, we will present a proof of Lemma 9 as follows.
Proof.
When l ∈ [ K ] ,
[Equation]
Similarly,
[Equation]
So
[Equation]
When l ∈ [ K ] , since ˆΠ U only depends on A UU , it is independent of X .
Hence, given ˆΠ U , { X j − E [ X j ] : j ∈ C l ∩ L} are a collection of |C l ∩ L| independent random variables.
Furthermore, given ˆΠ U , for any j ∈ C l ∩ L ,
[Equation]
Also,
[Equation]
So | X j − E
[ X j ] | ≤ 1 .
Additionally,
[Equation]
Therefore, denote n l = |C l ∩ L| , by Lemma 7,
[Equation] [Equation]
When l ∈ { K + 1 , ..., 2 K }
[Equation]
define
[Equation]
Then
[Equation]
Similarly,
[Equation]
So
[Equation]
X
[Equation]
E [ X j ]) When l ∈ [ K ] , since ˆΠ U only depends on A UU , it is independent of X .
Hence, given ˆΠ U , { X j −
E [ X j ] : j ∈ ˆ C l } are a collection of |C l ∩ L| independent random variables.
Furthermore, given ˆΠ U , for any j ∈ ˆ C l ,
[Equation]
Also, − 1 ≤ − E [ X
[Equation]
≤ X
[Equation]
X
[Equation]
] ≤ X j ≤
So | X j − E
[ X j ] | ≤ 1 .
Additionally, var
[Equation]
= var (cid:16) X j | ˆΠ
[Equation]
(cid:17) =
E [ X j ](
[Equation]
E [ X j ]) ≤ E [ X j ]
Therefore, denote ˆ n l = | ˆ C l | , by Lemma 7,
[Equation]

[Equation]
In all
[Equation]
for any l ∈ [2 K ] ,
[Equation]
Notice that
[Equation]
( Identifiability condition )
[Equation] [Equation]
Plugging (64) into (63), we obtain
[Equation]
That concludes the proof.
I P ROOF OF C OROLLARY 1,I. P ROOF OF C OROLLARY
Corollary 1.
Consider the DCBM model where (8)-(9) hold.
Suppose for some constants b 0 ∈ (0 , 1) and ϵ ∈ (0 , 1 / 2) , ˆΠ U is b 0 -correct with probability 1 − ϵ .
When b 0 is properly small, there exist constants C 0 > 0 and ¯ C > 0 , which do not depend on ( b 0 , ϵ ) , such that P (ˆ y ̸ = k ∗ ) ≤ ϵ + ¯ C (cid:80) Kk
=1 exp (cid:16) − C 0 β 2 n ∥ θ ∥ 1 · min { θ ∗ , ∥ θ ( k ) L ∥ 1 } (cid:17) .
Proof.
Let B 0 be the event that ˆΠ U is b 0 -correct.
Then,
[Equation]
By Theorem
[Equation]
when b 0 is properly small
[Equation]
B 0 implies that there exists a constant c 0 >
[Equation]
which does not depend on b
[Equation]
such that ψ k ∗ ( ˆ Π U ) =
and min k ̸ = k ∗ { ψ k ( ˆ Π U ) } ≥ c 0 β n .
Substituting this result into (66)
[Equation]
we have
[Equation] [Equation]
According to Theorem 2, there exists a constant C > 0 , such that for any δ ∈ (0 , 1 / 2) , with probability 1 − δ , simultaneously for 1 ≤ k ≤ K ,
[Equation]
Take C
= c
[Equation] [Equation]
Then
[Equation]
On the other hand
[Equation]
take c 3 in condition (9) properly small such that c 3 ≤ c 0 6 C
[Equation]
then according to condition (9),
[Equation]
Combining (68) and (69), we have
[Equation]
Therefore
[Equation]
when δ < 12 , by Theorem
[Equation]
with probability 1 − δ , simultaneously for 1 ≤ k ≤ K ,
[Equation]
As a result, when δ < 12 ,
[Equation]
When δ ≥ 12 ,
[Equation]
Hence in total, we have
[Equation]
Plugging (70) into (67), we obtain
[Equation]
Choose ¯ C = 2 , we obtain
[Equation]
To conclude, when b 0 is properly small, there exist constants C
= c 20 36 C 2 > 0 and ¯ C = 2 > 0 , which do not depend on ( b 0 , ϵ ) , such that P (ˆ y ̸
= k ∗ )
≤ ϵ + ¯ C (cid:80) Kk =1 exp (cid:16) − C 0 β 2 n ∥ θ ∥ 1 · min { θ ∗ ,
∥ θ ( k ) L ∥ 1 } (cid:17) .
I. P ROOF OF C OROLLARY
Corollary 2.
Consider the DCBM model where (8)-(9) hold.
We apply SCORE+ to obtain ˆΠ U and plug it into AngleMin+.
As n → ∞ , suppose for some constant q 0 > 0 , min i ∈U θ i ≥ q 0 max i ∈U θ i , β n ∥ θ U ∥ ≥ q 0 (cid:112) log( n ) , β 2 n ∥ θ ∥ 1 θ ∗ → ∞ , and β 2 n ∥ θ ∥ 1 min k {∥ θ ( k ) L ∥ 1 } → ∞ .
Then, P (ˆ y ̸ = k ∗ ) → 0 , so the AngleMin+ estimate is consistent.
Proof.
By Corollary 2, let ϵ be the probability that ˆΠ U obtained through SCORE+ is not b 0 -correct, then
[Equation]
Since β 2 n ∥ θ ∥ 1 θ ∗ → ∞ , and β 2 n ∥ θ ∥ 1 min k {∥ θ ( k ) L ∥ 1 } → ∞ , ¯ C
K (cid:88) k
=
[Equation]
(cid:16) − C 0 β 2 n
[Equation]
θ ∥
[Equation]
min { θ ∗ , ∥ θ ( k ) L ∥ 1 } (cid:17) →
By Theorem 2.2 in Jin et al. (2021), when q 0 is sufficiently large, min i ∈U θ i ≥ q 0 max i ∈U θ i and β n ∥ θ U ∥ ≥ q
0 (cid:112) log( n ) imply that ϵ
→
Hence, in all, we have P (ˆ y ̸ = k ∗ ) → 0 , so the AngleMin+ estimate is consistent.
J P ROOF OF L EMMA
As mentioned in section D, in the main paper, for the smoothness and comprehensibility of the text, we do not present the most general form of Lemma 2.
Here, we present both the original version, Lemma 2, and the generalized version, Lemma 2’ below, where we relax the assumption that ∥ θ (1) L ∥
[Equation]
[Equation]
1 = 1 to the much weaker assumption: the first part of condition (9) in the main text, which only assumes that ∥ θ (1) ∥ 1 and ∥ θ (2) ∥ 1 are of the same order.
Lemma 2. Consider a DCBM with K = 2 and P = (1 − b ) I
+ b 1 2 1 ′ 2 .
Suppose θ ∗ =
o (1) ,
[Equation] [Equation]
= 1 .
There exists a constant c 4 > 0 such that
[Equation]
where the infimum is taken over all measurable functions of A , X , and parameters Π L , Π U , Θ , P , θ ∗ .
In AngleMin+, suppose the second part of condition 9 holds with c
3 = o (1) , ˆΠ U is ˜ b 0 -correct with ˜
b 0 a.s. → 0 .
There is a constant C 4 > 0 such that,
[Equation]
Lemma 2’.
Consider a DCBM with K = 2 and P = (1 − b ) I 2 + b 1 2 1 ′ 2 .
Suppose 1 − b
=
o (1) .
There exists a constant c 4 > 0 such that
[Equation]
where the infimum is taken over all measurable functions of A , X , and parameters Π L , Π U , Θ , P , θ ∗ .
In AngleMin+, suppose condition 9 holds with c
3 = o (1) , θ ∗ =
o (1) ,
[Equation]
˜ b 0 -correct with ˜ b 0 a.s. → 0 .
There is a constant C 4 > 0 such that,
[Equation]
When conditions of Lemma 2 hold, conditions of Lemma 2’ hold.
Also, with ∥ θ
[Equation]
assumed in Lemma 2, the results of Lemma 2’ imply the results of 2.
Therefore, it suffices to prove the generalized version, Lemma 2’.
We prove the lower bound (75) and upper bound (76’) separately.
J. P ROOF OF L OWER B OUND (75)
Proof.
Let P (1) and P (2) be the joint distribution of A and X given π ∗ =
e 1 and π ∗ =
e 2 , respectively.
For a random variable or vector or matrix Y , let P (1) Y and P (2) Y be the distribution of Y given π ∗ =
eand π ∗ =
e 2 , respectively.
According to Theorem 2.2 in Section 2.4.2 of Tsybakov (2009),
[Equation]
where
[Equation]
is the Hellinger distance between P (1) and P (2) .
As in Section 2.4 of Tsybakov (2009), one key property of Hellinger distance is that if Q (1) and Q (2) are product measures, Q (1) = ⊗ Ni =1 Q (1) i , Q (2) = ⊗ Ni =1 Q (2) i , then
[Equation]
Notice that for k = 1 , 2 , since according to DCBM, A, X 1 , ..., X n are independent,
[Equation]
Combining (77) and (78), we obtain
[Equation]
Given π ∗ =
e 1 and π ∗ =
e 2 , according to DCBM, the distribution of A remains the same.
As a result, H 2 ( P (1) A , P (2) A ) = 0 .
On the other hand, for k = 1 , 2 and i ∈ [ n ] , according to DCBM model
[Equation]
where k i is the true label of node i .
As a result,
[Equation]
For x
[Equation]
y ∈ R
[Equation]
denote g ( x, y ) =
log( xy + (cid:112) (1 − x
[Equation]
(1 − y
[Equation]
Then, 1 − H 2 ( P (1) Xi , P (
[Equation]
) Xi )
[Equation]
Hence, by (79)
[Equation]
Substituting (81) into (76), we obtain
[Equation]
To reduce the RHS of (82), we need to evaluate g .
The following lemma shows that g ( x, y )
≈ − 12 ( x − y ) 2 .
Lemma 10.
Suppose that 0 ≤ x, y ≤ a < 1 .
Then,
[Equation]
Proof.
We first prove a short inequality on log .
For z > 0 , define g 3 ( z )
= log( z )
− z − 1 z .
Then
[Equation]
Therefore, when z ≤ 1 , ddz g 3 ( z ) ≤ 0 , g 3 ( z ) is monotonously deceasing, hence g 3 ( z ) ≥ g 3 (1) = 0 ; when z ≥ 1 , ddz g 3 ( z ) ≥ 0 , g 3 ( z ) is monotonously increasing, hence g 3 ( z ) ≥ g 3 (1) = 0 .
In all, g 3 ( z ) ≥ 0 , so
[Equation]
Since x, y ∈ [0 , 1] , we could define ϕ x = arcsin x ∈ [0 , π 2 ] , ϕ y = arcsin y ∈ [0 , π 2 ] .
Then, g ( x, y ) =
g (sin ϕ x , sin ϕ y ) [Equation] y
[Equation]
(1 − sin 2 ϕ [Equation] [Equation] sin 2 ϕ y ) (cid:17) =
log(sin ϕ x sin ϕ y + cos ϕ x cos ϕ y ) =
log(cos( ϕ x − ϕ y ))
[Equation]
Since x, y ∈ [0 , a ] , ϕ x , ϕ y ∈ [0 , arcsin a ] .As a result, | ϕ x − ϕ y | , ( ϕ x + ϕ y )∈ [0 , arcsin a ] .
Plugging this result back into (84), we have
[Equation]
This concludes the proof.
Back to the proof of lower bound (75).
Define θ a = (cid:114) θ ∗ (cid:16) max i ∈ [ n ] θ i (cid:17) (max { 1 , b } ) , then for any k ∈ { 1 , 2 } , i ∈ [ n ] , (cid:112) θ ∗ θ i
P kk i ≤
θ a .
Therefore, applying Lemma 10 in (82), we have when θ a < 1 , inf ˜ y
{ Risk(˜ y ) } ≥ 1 2 exp (cid:16)n (cid:88)
i = − 2(1 − ( θ a ) 2 )(cid:16)(cid:112)
[Equation] [Equation]
Since θ ∗ = o (1) , b = 1 − o (1) , and by DCBM model, max i ∈ [ n ] θ i ≤ , we have θ a = (cid:114)
θ ∗ (cid:16)
max i ∈ [ n ] θ i (cid:17) (max { 1 , b } ) =
o (1) .
Since b = 1 − o (1) , (1 + √ b ) 2 → 4 .
Therefore,
[Equation]
1+ √ b )
[Equation]
1 − ( θ a ) 2 ) 32 = 1 − o (1) .
Substituting these results into (86), we obtain
[Equation]
This concludes our proof of lower bound (75), with c 4 = 12 .
J. P ROOF OF U PPER B OUND (76’)
Proof.
When K = 2 , Risk(ˆ y )
=
P (ˆ y = 2 |
π ∗ =
e 1 ) + P
ˆ y = 1 | π ∗ =
e 2 ) .
The evaluation of P (ˆ y = 2 |
π ∗ =
e 1 ) and P (ˆ y = 1 |
π ∗ =
e 2 ) are exactly the same.
Without the loss of generosity, we would focus on P (ˆ y = 2 | π ∗ =
e 1 ) .
Recall that in the proof of 2, we define v k = f
( A ( k ) ; ˆΠ U ) , v ∗ =
f ( X ; ˆΠ U ) , ˜ v k = f (Ω ( k ) ; ˆΠ U ) , ˜ v ∗ =
f ( EX ; ˆΠ U ) , k ∈
[ K ] .
We have
[Equation] [Equation]
Recall that in proof of Lemma 8 9, we define ˆ C k
=
{ i ∈ U :
ˆ π i =
e k − K } , k = K + 1 , ..., 2 K .
Let w = v 2 ∥ v 2 ∥ − v 1 ∥ v 1 ∥ .
Since when l ∈ [ K ] ,
[Equation]
X
[Equation]
; when l ∈ { K + 1 , ..., 2 K } ,
[Equation]
X j we have
[Equation]
Since A and X are independent and for k ∈ [2 K ] , w k is measurable with respect to A , given A , { w k ( X i − E X i ) :
k ∈ [ K ] , i ∈ C k ∩ L} ∪ { w k
( X i − E X i ) :
k ∈ [2 K ] \ [ K ] , i ∈ ˆ C k } are a collection of independent random variables.
Also, for any k ∈ [2 K ] , i ∈ [ n ] ,
[Equation]
Furthermore, − 1 ≤ − E X
[Equation]
≤ X
[Equation]
≤
So | w k ( X i − E X i ) | ≤ max k ∈ [2 K ] | w k | .
Additionally,
[Equation]
Let
[Equation]
where w ◦ w is defined as ( w 21 , ..., w 22 K ) .
Then by Lemma
[Equation]
By Lemma 8, when ϕ ≥ 2 √ 2 πC 2 K 2 ∥ θ ( k ) L ∥ 2 ∥ θ ( k )
[Equation]
Take
[Equation]
Then because θ ∗ min k ∈ [ K ] ∥ θ ( k ) L ∥ 1 = o (1) and by condition 9,
[Equation]
∥
[Equation]
∥ 1 ∥
[Equation]
∥ 1 ≤ c 3 β n = o ( | 1 − b | ) , we have ϕ
=
o ( | 1 − b | ) .
Also,
P (cid:16) ∃ k ∈ [ K ] , l ∈ [2 K ] , | ( v k − ˜ v k ) l
[Equation]
≤ (cid:88) k
∈
[ K ] (cid:88)
[Equation]
P
[Equation]
[Table]
[Equation] [Equation]
Hence, we can focus on the case where for all k ∈ [ K ] , l ∈
[2 K ] , | ( v k − ˜ v k ) l |
= o ( | 1 − b | ) ∥
˜ v k ∥ .
Until the end of the proof, we assume that we are under this case.
We first evaluate ⟨ w, ˜ v ∗ ⟩ .
Let ˜ w = ˜ v 2 ∥ ˜ v 2 ∥ − ˜ v 1 ∥ ˜ v 1 ∥ .
Then,
[Equation]
Since π ∗ = 1 , ˜ b 0 → 0 , by Theorem 1, ψ (˜ v 1 , ˜ v ∗ )
= ψ 1 = 0 , ψ (˜ v 2 , ˜ v ∗ )
= ψ 2 ≥ c 0 β n = c 0 | 1 − b | .
On the other hand, that for all k ∈ [ K ] , l ∈ [2 K ] , | ( v k − ˜ v k ) l | =
o ( | 1 − b | )
∥
˜ v k ∥ indicates that ∥ v k − ˜ v k ∥ =
o ( | 1 − b | )
∥
˜ v k ∥ .
By lemma 5, this implies that ψ ( v 1 , ˜ v 1 )
=
o ( | 1 − b | ) , k
= 1 , 2 .
Therefore,
[Equation]
Therefore, ⟨ w, ˜ v ∗ ⟩ = (1 + o (1)) ⟨ ˜ w, ˜ v ∗ ⟩ .
Let η kl
= (cid:80) π i =
e k , ˆ π i =
e l θ i .
Let µ ( k ) a = ∥ θ ( k ) a ∥ 1 , a ∈ {L , U} , k ∈ [ K ] .
Then,
[Equation]
Hence,
[Equation] [Equation]
∥
[Equation]
∥
[Equation]
(94) where
[Equation]
Notice that
[Equation]
On the other hand,
[Equation]
Therefore,
[Equation]
Similarly
[Equation]
Therefore,
[Equation]
We turn to ⟨ w ◦ w, ˜ v ∗ ⟩
[Equation]
Denote that
[Equation]
One simple but useful fact is that ∥ ˜ ν 1 ∥ , ∥ ˜ ν 2 ∥
=
O ( ∥ θ ∥ 1 ) .
The reason is that for k ∈ [ K ]
[Equation]
Notice that
[Equation]
Since
[Equation]
We have ˜
[Equation]
Since for all k ∈ [ K ] , l ∈ [2 K ] , | ( v k − ˜ v k ) l | =
o ( | 1 − b | )
∥
˜ v k ∥ , we have | w k − ˜ w k |
= o ( | 1 − b | ) , k = 1 , 2 , ..., 2 K .
Hence, denote γ = ( µ (2) L ) 2 +( µ (2) U ) 2 − ( µ (1) L ) 2 − ( µ (1) U ) 2 ∥ ˜ ν 2 ∥, we obtain
[Equation]
Similarly, we can show that
[Equation]
As a result, ⟨ w ◦ w, ˜ ν ∗ ⟩ =
[Equation]
When ∥ θ ∥ 1 = o (1) , the bounds (75) and (76 ′ ) both become trivial, so we can focus on the case
where ∥ θ ∥ 1 ≥ O (1) .
In this case, ( µ ( k ) a ) 2 (1 − ( − 1) k γ ) ∥ ˜
ν k ∥≤ O (1) , µ ( k ) a ∥ ˜ ν k
∥ 2 ≤ O (1) .
On the other hand, for k ∈ [ K ] , (cid:88)
[Equation]
Holder Inequality
[Equation]
[Equation]
Since 1 − γ and 1 + γ cannot be both o (1) , we have (cid:88)
[Equation]
Therefore,
[Equation]
By (101) (102) (103) (104)
[Equation]
max k ∈ [2 K ] | w k | =
O
[Equation]
1 − b ) =
o (1) .
Substituting this result together with (97) and (107) into (90)
[Equation]
we obtain
[Equation]
Similarly,
[Equation]
∥ 21 ) 2 + ∥ θ (2) L ∥ 31 + ∥ θ (2) U ∥( ∥ θ (2) L ∥ 21 + ∥ θ (2) U ∥ 21 )
  (109)
Therefore,
Risk
[Equation] [Equation]
[Equation] [Equation]
[Equation] [Equation]
 
[Equation]
Taking C 4 = 4 , we conclude the proof.
K P ROOF OF T HEOREM
Theorem 3.
Suppose the conditions of Corollary 1 hold, where b 0 is properly small , and suppose that ˆΠ U is b 0 -correct.
Furthermore, we assume for sufficiently large constant C 3 , θ ∗ ≤ 1 C 3 , θ ∗ ≤ min k ∈
[ K ] C 3 ∥ θ ( k ) L ∥ 1 , and for a constant r 0 > 0 , min k ̸ = ℓ { P kℓ } ≥ r 0 .
Then, there is a constant ˜ c
= ˜ c
2 ( K, C 1 , C 2 , C 3 , c 3 , r 0 ) >
such that [ − log(˜ c 2 Risk(ˆ y ))] / [ − log(inf ˜
y
{ Risk(˜ y ) } )] ≥ ˜ c 2 .
Proof.
On one hand, for any k, k ∗ ∈ [ K ] , k ̸ = k ∗ , using exactly the same proof as in Section J.1, we can show that when C 3 > C 1 ,
[Equation]
where k i is the true label of node
i , θ a = max i ∈ [ n ] max k ∈ [ K ] (cid:112) θ ∗ θ i P kk i .
According to DCBM model and condition (8), θ a ≤ CC 3 .
Hence take C 3 ≥ √ 2 C 1 , then
[Equation]
[Equation]
Let B 0 be the event that ˆΠ U is b 0 -correct.
When inf ˜ y
{ Risk(˜ y ) } is replaced by the version conditioning on B 0 , since X and A are independent, and B 0 ∈ σ ( A ) , conditioning on B 0 or not does not affect the distribution of X .
On the other hand, for any k, k ∗ , since π ∗ does not affect the distribution of A , the distribution of A | B 0 , π ∗ =
e k and A | B 0 , π ∗ =
e k ∗ are the same, so their Hellinger distance is still 0.
Hence, all the proofs in Section J and above remain unaffected.
In other words, one does not gain a lot of information from B 0 .
On the other hand, notice that proof of Theorem 2 still works conditioning on B 0 .
In other words, there exists constant C > 0 , such that given B 0 , for any δ ∈ (0 , 1 / 2) , with probability 1 − δ , simultaneously for 1 ≤ k ≤ K ,
[Equation]
Define ˜
[Equation]
ˆΠ U ) .
Replacing c 0 β n by ˜ β k and replicating the proof of Corollary 1 , we can show that
[Equation]
Since θ ∗ ≤ min k ∈ [ K ] C 3 ∥ θ ( k ) L ∥ 1 , min { θ ∗ , ∥ θ ( k ) L ∥ 1 } ≥ min { 1 , 1 C 3 } θ ∗ , therefore,
[Equation]
Recall that in (20) of Section G, we show that
[Equation]
By Lemma 6, denote
[Equation]
Suppose that C 5 ≤ 1 4 .
Then, for any vector α ∈ R k ,
[Equation]
) where recall that in Section G, we define
[Equation]
D M (0) =
diag( M (0)11 , ..., M (0) KK ) , and ˜ M , ˜ M (0) =
D − 12 M (0) M (0) D − 12 M (0)
Hence, when b 0 is sufficiently small,
[Equation]
Define λ l = (cid:113) ∥ θ ( l ) L ∥ 21 + ∥ θ ( l ) U ∥ 21 , l ∈ [ K ] .
Then,
[Equation]
Therefore, plugging the above result into (117)
[Equation]
we have
[Equation]
Notice that
[Equation]
Identification Condition )
[Equation]
Cauchy-Schwartz )
[Equation]
Substituting (119) into (118)
[Equation]
we have
[Equation] [Equation]
On one hand
[Equation]
by Cauchy-Schwartz inequality
[Equation]
So
[Equation]
On the other hand,
[Equation]
Plugging (121), (122), (123) into (120), we obtain
[Equation]
( By (9) , min k ̸ = ℓ { P kℓ } ≥ r 0 ) ≥
[Equation] [Equation]
Substituting (124) into (113), we obtain
P (ˆ y ̸
=
k ∗ | B 0 , π ∗ =
e k ∗ )
≤ ¯ C
[Equation] [Equation]
where C 8 = C
[Equation]
As a result
[Equation]
Comparing (112) and (126), we have
[Equation]
I
[Equation]
) where I = θ ∗ min k ̸ = k ∗ ∈
[ K ] (cid:80) Kl
=
∥ θ ( l ) ∥ 1 ( √ P kl − √ P k ∗ l ) 2 denotes the efficient information in the data.
Notice that since I ≥ 0 , when C 8 ≥ 2 √ 2 , log(2)+ C 8 I log(2)+2 √ 2 I ≥ 1 ; when C 8 ≤ 2 √ 2 , log(2)+ C 8 I log(2)+2 √ 2 I ≥ log(2) C 8 2 √ 2 + C 8 I log(2)+2 √ 2 I = C 8 2 √ 2 .
Therefore,
[Equation]
2 √
[Equation]
Take ˜ c
2 = min { 1 , C 8 2 √ 2 , 1 2 ¯ CK 2 } .
Then ˜ c 2 only depends on K, C 1 , C 2 , C 3 , c 3 , r 0 (recall that both Cand c 0 only depend on K, C 1 , C 2 , C 3 , c 3 , r 0 , and
¯ C = 2 ), and − log(˜ c
[Equation]
Risk(ˆ y |
[Equation] [Equation]
This concludes our proof.
L P ROOF OF T HEOREM 4,L. P ROOF OF T HEOREM
Theorem 4.
Consider the DCBM model where (8)-(9) hold.
We apply SCORE+ to obtain ˆΠ U\{ i } and plug it into the above algorithm.
As n → ∞ , suppose for some constant q 0 > 0 , min i ∈U θ i ≥ q 0 max i ∈U θ i , β n ∥ θ U ∥ ≥ q 0 (cid:112) log( n ) , β 2 n
∥ θ ∥ 1 min i ∈U θ i → ∞ , and β 2 n ∥ θ ∥ 1 min k {∥ θ ( k ) L ∥ 1 } → ∞ .
Then, 1 |U| (cid:80) i ∈U
P
(ˆ y i ̸
= k i )
→ 0 , so the in-sample classification algorithm in section 3 is consistent.
Proof.
Let i ∗ = arg max i ∈U P (ˆ y
i ̸
= k i ) .
Then
[Equation]
Notice that the assumptions of theorem 4 directly imply the assumptions of Corollary 2 when taking i ∗ as the new node.
Hence, regard i ∗ as the new node and leveraging on Corollary 2, we have
[Equation]
Therefore,
[Equation]
In other words, the in-sample classification algorithm in section 3 is consistent.
L. P ROOF OF T HEOREM
Theorem 5.
Suppose the conditions of Corollary 1 hold, where b 0 is properly small , and suppose that ˆΠ U\{ i } is b 0 -correct for all i ∈ U .
Furthermore, we assume for sufficiently large constant C 3 , max
[Equation]
∈ [ K ] C
[Equation]
∥ θ ( k ) L ∥ 1 , log( |U| ) ≤ C 3 β 2 n ∥ θ ∥ 1 min i ∈U θ i , and for a constant r 0 > 0 , min k ̸ = ℓ { P kℓ } ≥ r 0 .
Then, there is a constant ˜ c
= ˜ c
21 ( K, C 1 , C 2 , C 3 , c 3 , r 0 ) >such that [ − log(˜ c 21 Risk ins (ˆ y ))] / [ − log(inf ˜
y { Risk ins (˜ y ) } )] ≥ ˜ c 21 , so the in-sample classification algorithm in section 3 is efficient.
Proof.
For i ∈ U , define individual risk Risk(˜ y i )
= (cid:80) k ∗ ∈
[ K ] P (˜ y i
̸
= k ∗ | π i =
e k ∗ ) .
Then the in-sample risk Risk ins (˜ y )
= 1 |U| (cid:80) i ∈U Risk(ˆ y i ) .
The minimizer of Risk ins (˜ y ) may not exist, so we define ˜ y (0) to be an approximate minimizer such that Risk ins (˜ y (0) )
≤ 2 inf ˜ y
{ Risk ins (˜ y ) } .
By the definition of infimum, such ˜ y (0) always exists as long as inf
˜ y
{ Risk ins (˜ y ) } > 0 .
Notice that for any i ∈ U , inf
˜ y
{ Risk ins (˜ y ) } ≥ inf ˜ y
i 1 |U| { Risk(˜ y i ) } .
Regarding node i as the new node and leveraging on (112), we know that inf ˜ y
i { Risk(˜ y i ) } > 0 .
Hence, inf ˜ y
{ Risk ins (˜ y ) } ≥ inf ˜ y
i 1 |U| { Risk(˜ y i ) } >
(note that we are not taking n or |U| → ∞ here), and ˜ y
(0) is well-defined.
Let i ∗ = arg max i ∈U Risk(ˆ y i ) , and let k ∗ be the true label of i ∗ .
Regard [ n ] \{ i ∗ } as the existing nodes in the network and i ∗ as the new node.
By (112) and (126), we have
[Equation] [Equation]
(131) where I i ∗ =
θ i ∗ min k ̸ = k ∗ ∈
[ K ] ( (cid:80) Kl
=
∥ θ ( l ) ∥ 1 ( √ P kl − √ P k ∗ l ) 2 − θ i ∗ (1 − √ P kk ∗ ) 2 ) denotes the efficient information in the data for classifying node i ∗ .
As a result, we have
[Equation] [Equation]
Notice that
I
[Equation]
( The true label of node i ∗ is k
[Equation] [Equation]
By assumption 8, for any k ∈ [ K ] ,
[Equation]
( By identification condition that P kk =
P k ∗ k ∗ = 1)
[Equation]
By assumption 9, for any k ∈ [ K ]
[Equation]
From the assumption
[Equation]
log( |U| ) ≤ C 3 β 2 n ∥ θ ∥ 1 min i ∈U θ i .
Plugging (134) (135) into (133)
[Equation]
we obtain
[Equation] [Equation]
In other words
[Equation]
Substituting (137) into (132), we have
[Equation]
Similar to the proof of Theorem
[Equation]
notice that since I i ∗ ≥
[Equation]
when C 8 ≥
[Equation]
C
[Equation] [Equation]
[Equation]
; when C 8 ≤ 2 √ 2 + KC 2 C 3 (1 + √ C 1 ) 2 ,
[Equation]
Therefore, −
[Equation]
Take ˜ c
21 = min { 1 ,
[Equation]
2+
[Equation]
1 4 ¯
[Equation]
Then ˜ c 21 only depends on K, C 1 , C 2 , C 3 , c 3 , r(recall that both C 0 and c 0 only depend on K, C 1 , C 2 , C 3 , c 3 , r 0 , and ¯ C = 2 ), and
[Equation]
This concludes our proof.