---
abstract: 'Congruence theory has many applications in physical, social, biological and technological systems. Congruence arithmetic has been a fundamental tool for data security and computer algebra. However, much less attention was devoted to the topological features of congruence relations among natural numbers. Here, we explore the congruence relations in the setting of a multiplex network and unveil some unique and outstanding properties of the multiplex congruence network. Analytical results show that every layer therein is a sparse and heterogeneous subnetwork with a scale-free topology. Counterintuitively, every layer has an extremely strong controllability in spite of its scale-free structure that is usually difficult to control. Another amazing feature is that the controllability is robust against targeted attacks to critical nodes but vulnerable to random failures, which also differs from normal scale-free networks. The multi-chain structure with a small number of chain roots arising from each layer accounts for the strong controllability and the abnormal feature. The multiplex congruence network offers a graphical solution to the simultaneous congruences problem, which may have implication in cryptography based on simultaneous congruences. Our work also gains insight into the design of networks integrating advantages of both heterogeneous and homogeneous networks without inheriting their limitations.'
author:
- 'Xiao-Yong Yan$^{1,5}$, Wen-Xu Wang$^{2,6,}$'
- 'Guan-Rong Chen$^{3}$'
- 'Ding-Hua Shi$^{4,}$'
title: Multiplex congruence network of natural numbers
---

Introduction {#sec:1 .unnumbered}
============

Congruence is a fundamental concept in number theory. Two integers $a$ and $r$ are said to be congruent modulo a positive integer $m$ if their difference $a-r$ is integrally divisible by $m$, written as $a \equiv r \ ({\rm mod} \ m)$ [@hardy79]. Congruence theory has been widely used in physics, biology, chemistry, computer science, and even music and business [@n2p92; @guterl94; @ding96; @yan02; @schr08]. Because of the limited computational and storage ability of computers, congruence arithmetic is particularly useful and applicable to computing with numbers of infinite length [@yan02]. Significant and representative applications include generating random numbers [@knuth97], designing hash functions [@preneel94] and checksumming in error detections [@yan02; @wang05]. As a cornerstone of modern cryptography, congruence arithmetic has been successfully used in public-key encryption [@salo13], secret sharing [@adi79], digital authentication, and many other data security applications [@ding96; @yan02; @schr08].

Despite the well-established congruence theory with a broad spectrum of applications, a comprehensive understanding of the congruence relation among natural numbers is still lacking. Our purpose is to uncover some intrinsic properties of the network consisting of natural numbers with congruence relations. A link in the congruence network is defined in terms of the congruence relation $j \equiv r \ ({\rm mod} \ i)$, where $r$ is the reminder of $j$ divided by $i$. For a fixed value of $r$, we discern an infinite set of integer pairs $(i,j)$. For each pair of such integers, a directed link from $i$ to $j$ (suppose $i<j$) characterizes the congruence relation between $i$ and $j$, giving rise to a congruence network for a given reminder $r$. Let $G(r,N)$ denote a congruence network, where $N$ is the largest integer considered. Note that congruence networks associated with different values of $r$ share the same set of nodes (integers), thereby a multiplex network [@yuan14] with a number of layers is formed, as shown in Fig. \[fig1\](a).

To our knowledge, the multiplex congruence network (MCN) has not been explored in spite of some effort dedicated to complex networks associated with natural numbers [@corso04; @zhou06; @luque08; @shi10; @garcia14; @sheka15]. We will demonstrate several unique and prominent properties of the MCN regarding some typical dynamical processes. Specifically, analytical results will show that all layers of the MCN are sparse with the same power-law degree distribution. A counterintuitive property of the MCN is that every layer of the MCN has an extremely strong controllability, which significantly differs from ordinary scale-free networks requiring a large fraction of driver nodes. To steer the network in a layer, the minimum number of driver nodes is nothing but the reminder $r$ that is negligible as compared to the network size. The controllability of the MCN is also very robust against targeted removal of nodes but relatively vulnerable to random failures, which is also in sharp contrast to ordinary scale-free networks. This amazing robustness against attacks can be interpreted in terms of the multi-chain structure in MCN. The MCN therefore sheds light on the design of heterogeneous networks with high searching efficiency [@klainberg] and strong controllability simultaneously. Another application of the MCN is that it can graphically solve the simultaneous congruences problem in a more intuitive way than currently used methods, such as the Garner’s algorithm. The solution of the simultaneous congruences problem is to locate common neighbors of relevant numbers in different layers. This alternative approach by virtue of the MCN may have implication in cryptography based on simultaneous congruences.

![image](fig1.eps){width="15.0cm"}

To our knowledge, the multiplex congruence network (MCN) has not been explored in spite of some effort dedicated to complex networks associated with natural numbers [@corso04; @zhou06; @luque08; @shi10; @garcia14; @sheka15]. We will demonstrate several unique and prominent properties of the MCN regarding some typical dynamical processes. Specifically, analytical results will show that all layers of the MCN are sparse with the same power-law degree distribution. A counterintuitive property of the MCN is that every layer of the MCN has an extremely strong controllability, which significantly differs from ordinary scale-free networks requiring a large fraction of driver nodes. To steer the network in a layer, the minimum number of driver nodes is nothing but the number of reminder $r$ that is negligible as compared to the network size. The controllability of the MCN is also very robust against targeted removal of nodes but relatively vulnerable to random failures, which is also in sharp contrast to ordinary scale-free networks. This amazing robustness against attacks can be interpreted in terms of the multi-chain structure in MCN. The MCN therefore sheds light on the design of heterogeneous networks with high searching efficiency [@klainberg] and strong controllability simultaneously. One of the most important applications of the MCN is that it allows to solve the simultaneous congruences problem in a much more efficient way than existing methods using the Gauss algorithm. To tackle the problem with high computational efficiency, the network of each layer should be stored in advance, e.g., in a distributed storage system. The solution of the simultaneous congruences problem is to locate common neighbors of relevant numbers in different layers. This new efficient approach by virtue of the MCN offers deeper and broader insight into the modern cryptography and has potential applications in many other fields, such as communications and computer science.

Results {#sec:3 .unnumbered}
=======

Topology of MCN {#topology-of-mcn .unnumbered}
---------------

MCN consists of a number of congrence networks (layers) $G(r>0,N)$, as shown in Fig. \[fig1\](a). Each layer contains all the natural numbers larger than $r$ but less than or equal to $N$, so the size (number of nodes) of a layer is $N-r$. The remainder $r$ is a parameter that determines the structure of congruence network. When $r=0$, the congruence network reduces to a divisibility network [@shi10], in which the dividend links to all of its divisors except itself.

The out-degrees of nodes are heterogeneous in each layer of the MCN. We have analytically derived the distribution of the out-degrees in the thermodynamic limit (see details in the section of **Methods**): $$P(k)= \frac{1}{k(k+1)}.$$ For large $k$, the out-degree distribution becomes $P(k) \sim
k^{-2}$, thus $G(r,N)$ is a typical scale-free network. All $G(r>0,N)$ have similar out-degree distributions, as shown in Fig. \[fig1\](b), but the divisibility network $G(0,N)$ has a different out-degree distribution. For small $k$, $P(k)$ of $G(0,N)$ deviates from the other networks $G(r>0,N)$. The main factor that accounts for the difference lies in that half of the nodes in $G(0,N)$ have no outgoing links, but in $G(r>0,N)$ there are only $r$ nodes without outgoing links.

![image](fig2.eps){width="17cm"}

Analytical results demonstrate that the average degree of any layer increases logarithmically with the network size (see Fig. \[fig1\](b) and the section of **Methods** for details), and a larger value of $r$ corresponds to a sparser layer. These results indicate that $G(r,N)$ is always a sparse network. Hence, the MCN is compatible with a sparse storage, which is important for applying the MCN to solve real-world problems.

According to the definition of MCN, the numbers in each layer $G(r > 0,N)$ can be classified into $r$ arithmetic sequences: $$a_{n}^{i} =i +nr, \label{eq:seq}$$ where $1\leq i \leq r, n =1, 2, \cdots, \lfloor \frac{N-i}{r}
\rfloor $ ($\lfloor x \rfloor $ denotes the largest integer not greater than $x$). The consecutive numbers in the sequence are linked from small to large, resulting in $r$ chains traversing all nodes in a layer, as shown in Fig. \[fig2\](a). The root node of a chain is the minimum number in the chain. There are totally $r$ root nodes associated with $r$ chains. The end of a chain is always the maximum number in the chain. Note that $r=0$ is a special case, because the arithmetic sequence does not exist in the layer $G(0,N)$, rendering the absence of the multi-chain structure in the divisibility network.

The above results indicate that although the divisibility network $G(0,N)$ is a special case of $G(r,N)$, it has some fundamental differences from $G(r>0,N)$. Only when $r>0$ the multi-chain structure emerges, and the number of nodes without outgoing links is negligible. Some evidence has suggested that the multi-chain structure and the absence of nodes with low out-degrees play an important role in the controllability of complex networks [@wang12; @giulia14]. In the next section, we will further investigate the controllability properties of the MCN.

Controllability of MCN {#controllability-of-mcn .unnumbered}
----------------------

In principle, the MCN composed of natural numbers is not a dynamical system, such that it cannot be controlled. However, because of the multi-chain structure, the MCN provides significant insight into the design of heterogeneous networked systems with strong controllability. Thus, we treat the MCN as a dynamical system and explore its unique and outstanding controllability properties. The central problem of controlling complex networks is to discern a minimum set of driver nodes, on which external input signals are imposed to fully control the whole system. Let $N_{\rm D}$ denote the minimum number of driver nodes and $n_{\rm D}$ denote the fraction of driver nodes in a network. In general, a network with a smaller value of $n_{\rm D}$ is said to be more controllable.

According to the exact controllability theory for complex networks [@yuan13] and the sparsity of MCN, we can prove that (see in the section of **Methods**) $$N_{\rm D}=r,$$ and $$n_{\rm D}=\frac{r}{N-r}.$$ For large $N$ (namely $r \ll N$), $n_{\rm D} \rightarrow 0$ and $G(r>0,N)$ is considered as highly controllable. Furthermore, according to both the exact controllability theory [@yuan13] and the structural controllability theory [@liu11], the driver nodes are the $r$ root nodes of the chains in $G(r>0,N)$ (see details in the section of **Methods**). Meanwhile, the driver nodes are the hub nodes with the maximum degree. In comparison, due to the absence of chains, the divisibility network $G(0,N)$ with $N_D= \lceil N/2 \rceil$ ($\lceil x \rceil$ denotes the smallest integer not less than $x$) is hard to control for large $N$.

It has been recognized that scale-free networks are often difficult to control [@liu11]. In particular, Liu et al. [@liu11] have analytically found that when the network size $N
\to \infty$, one must control almost all nodes in order to fully control a scale-free network with scaling index $\gamma \to 2$. The MCN is a scale-free network with scaling exponent $\gamma =
2$, but one just needs to control $r$ root nodes to achieve full control. Such a strong controllability stems from the inherent multi-chain structure in MCN. From the perspective of structural controllability, all nodes in the chains in MCN are matched except the $r$ roots, which need to be controlled. Thus, the MCN is valuable for designing heterogeneous networks with strong controllability.

We also found that the MCN is strongly structurally controllable (SSC) because of the multi-chain structure (see [**Methods**]{}), which provides significant insight into the design of heterogeneous and controllable networks without exact link weights. A network is said to be SSC if and only if its controllability will not be affected by the link weights in its adjacency matrix [@liu11], or equivalently, for any distribution of link weights, the network will be fully controllable from the same set of driver nodes. The SSC property implies that the MCN is robust against the fluctuation and uncertainty of link weights. This is an outstanding feature with practical significance since sometimes link weights are hard to be exactly measured and they are sometimes time-varying in real situations.

The robustness against attacks is also a significant problem for the design of a controllable networked system [@pu12]. We explore the robustness of the controllability of the MCN against attacks on nodes and find some unique properties, which is useful for the design of practical networks. On the one hand, due to the existence of chains rooted in $r$ driver nodes in MCN, targeted attacks to driver nodes will not destroy the multi-chain structure nor increase $n_{\rm D}$. Here, nodes critical for targeted attacks can be identified based on the rank of node degrees or their hierarchical structure [@liu12]. In MCN, driver nodes (the $r$ root nodes) become such critical nodes. In this regard, MCN is robust against targeted attacks. On the other hand, random attacks to nodes may cut some chains. As a result, an additional driver is required to control each new breakpoint, leading to an increase of $n_{\rm D}$. Thus, the controllability of MCN is unusual in resisting attacks in the sense that it is robust against intentional attacks but vulnerable to random attacks, which significantly differs from general scale-free networks. The results in comparing the MCN and SF networks generated by using static model [@goh01] are shown in Fig. \[fig2\](b). To make an unbiased comparison, a scale-free network with the same scaling exponent $\gamma$ and $\langle k\rangle$ as the MCN is necessary. However, because of the graphicality constraint, it is not possible to generate a random SF network with $\gamma=2$ [@del11; @baek12]. Thus, we slightly release the requirement by using static model to generate SF networks with the same $\langle k\rangle$ but with $\gamma=2.001$. Indeed, one can see that $n_{\rm D}$ remains nearly unchanged under targeted attacks to driver nodes; whereas random attacks to node causes clear increase of $n_{\rm D}$. This phenomenon is consistent with our analysis in terms of the multi-chain structure. Moreover, for the presence of random attacks, in a wide range of the fractions of failed nodes, the controllability of MCN is still better than SF networks in general.

Solving the simultaneous congruences problem {#solving-the-simultaneous-congruences-problem .unnumbered}
--------------------------------------------

One of the applications of MCN is that one can graphically solve the simultaneous congruences problem, which has implication in communication security and computer science. In particular, one can find that MCN is exactly a topological representation of the system of simultaneous congruences [@schr08]. A system of simultaneous congruences is a set of congruence equations: $$\left\{
\begin{array}{c}
x \equiv r_{1} \ ({\rm mod} \ m_{1})\\
x \equiv r_{2} \ ({\rm mod} \ m_{2})\\
\cdots \\
x \equiv r_{k} \ ({\rm mod} \ m_{k})
\end{array}
\right.
\label{eq:sim}$$ If the moduli $m_{1},m_{2}\dots m_{k}$ are pairwise coprime, then a unique solution modulo $m_{1} m_{2} \dots m_{k}$ exists. This is the *Chinese remainder theorem* (CRT), which has many applications in computing, coding and cryptography [@ding96; @yan02; @schr08; @sorin07]. A well-known algorithm to solve the simultaneous congruences in CRT is the Gaussian algorithm [@menezes96], also known as *Dayanshu* [@lib06] in ancient China. Here, we present an intuitive approach based on MCN to solve the simultaneous congruences in Eq. (\[eq:sim\]). Firstly, we construct an MCN containing $k$ subnetworks with remainders $r_{1},r_2 \dots r_k$, respectively. To focus on the minimum solution of Eq. (\[eq:sim\]), we set the maximum number in the network as $N=m_{1} m_{2} \dots m_{k}$. Then, we find the common successor neighbor of the nodes $m_{1},m_{2}\dots m_{k}$ in this MCN, which is precisely the solution $x$.

We use a well-known example of CRT, recorded in *Sunzi Suanjing* [@lam04], to demonstrate our approach. The problem in this example is: ‘Suppose we have an unknown number of objects. When grouped in threes, 2 are left out, when grouped in fives, 3 are left out, and when grouped in sevens, 2 are left out. How many objects are there?’ This problem is equivalent to the following simultaneous congruences $$\left\{
\begin{array}{c}
x \equiv 2 \ ({\rm mod} \ 3)\\
x \equiv 3 \ ({\rm mod} \ 5)\\
x \equiv 2 \ ({\rm mod} \ 7)
\end{array}
\right.
\label{eq:sz}$$ To solve the problem, we first construct an MCN of two layers, $G(2,105)$ and $G(3,105)$, as shown in Fig. \[fig3\]. Then, we find the common successor neighbor of the three moduli, 3, 5 and 7, and finally get the result $x=23$.

It is noteworthy that the traditional algorithm for solving the simultaneous congruences problem, e.g., the Garner’s algorithm [@menezes96], is more efficient than our algorithm based on the MCN that is essentially a brute-force search. Thus, it is infeasible to immediately use the graphical approach in data security. However, the graphical algorithm offers new routes to the simultaneous congruences problem in the viewpoint of a complex network, which may be useful to improve the currently used algorithm.

![ [**Solving simultaneous congruences using MCN.**]{} For visualization, we only show a part of nodes in the MCN. In the upper layer, the set of successor neighbors of node $5$ is $S_{m=5}=\{8,13,18,23\}$, and similarly $S_{m=3}=\{5,8,11,14,17,20,23\}$ and $S_{m=7}=\{9,16,23\}$ in the lower layer. Thus the common successor neighbor of the three nodes is $23$, which is the solution of the simultaneous congruences problem described by in Eq. (\[eq:sz\]).[]{data-label="fig3"}](fig3.eps){width="9cm"}

Discussion {#sec:3 .unnumbered}
==========

We have defined a multiplex congruence network composed of natural numbers and uncovered its unique topological features. Analytical results demonstrate that every layer of the multiplex network is a sparse and scale-free subnetwork with the same degree distribution. Counterintuitively, every layer with a scale-free structure has an extremely strong controllability, which significantly differs from ordinary scale-free networks. In general, a scale-free network with power-law degree distribution is harder to control than homogeneous networks. This is attributed to the presence of hub nodes, at which dilation arises according to the structural control theory [@liu11]. As a result, downstream neighbor nodes of hubs are difficult to control. Moreover, due to a large number of nodes connecting to hubs, scale-free networks are usually of weak controllability with a large fraction of driver nodes. In contrast, in spite of the scale-free structure of the congruence network, the long chains in each layer considerably inhibit dilation and reduce the number driver nodes. Furthermore, an interesting finding is that every layer is also strong structurally controllable in that link weights have no effect on the controllability. This indicates that the controllability of the multiplex congruence network is extremely robust against the inherent limit to precisely accessing link weights in the real situation. To our knowledge, a scale-free network with strong structural controllability has not been reported prior to our congruence network. An unusual controllability property is that the controllability of each layer is robust against targeted attacks to driver nodes, but relatively fragile to random failures of nodes, which is also different from common scale-free networks. Previously reported results [@pu12; @liu12] demonstrate that targeted removal of high degree nodes and nodes in the top level of a hierarchical structure causes maximum damage to the network controllability. Under the two kinds of intentional removals, a network is easier to break to pieces, such that more driver nodes are required to achieve full control. Thus, targeted attacks are defined in terms of the two types of node removals. In the congruence network, high degree nodes and high level nodes are exactly identical, leading to the combination of the targeted attacks. Strikingly, the congruence network is robust against the targeted attacks, because of the existence of the chains. Targeted attacks will not destroy the chains in the downstream of the attacked node. As a result, the number of driver nodes nearly does not increase, even when a large fraction of nodes has been targeted attacked. The outstanding structural and controllability properties of the multiplex congruence network are valuable for designing heterogeneous networks with strong controllability and high searching efficiency rooted in the scale-free structure.

Another application of the multiplex congruent network is to solve the simultaneous congruences problem in a graphical and intuitive manner. The multiplex congruence network by converting the algebraic problem of solving simultaneous congruences equations to be a graphical problem of finding common neighbors in a graph, offers an alternative route to the traditional approaches. Despite this property, the traditional algorithms, such as Gaussian algorithm and Garner’s algorithm, outperform the graphical method in computational efficiency. Hence, the graphical method is not applicable in data security at the present. Nevertheless, the graphical approach may inspire the combination of the graphical and algebraic method to improve the current algorithm, which is potentially valuable in communication security, computer science and many fields relevant to cryptography. Our work may also stimulate further effort toward studying of networks arising from natural relationships among numbers, with outstanding features and applied values. Many topological insights can be expected from complex networks consisting of natural numbers.

Methods {#methods .unnumbered}
=======

Deriving the out-degree distribution of MCN {#deriving-the-out-degree-distribution-of-mcn .unnumbered}
-------------------------------------------

For a sub-network $G(r>0,N)$ in MCN, the total number of nodes is $N-r$ and the number of nodes without out-links is $r$. The out-degree of a node labelled $m$ in the range of $(\frac{N-r}{2},N-r]$ is 1, because node $m$ can only link to one node i.e. node $m+r$ in the network; similarly, the out-degree of a node labelled $m$ in the range of $(\frac{N-r}{3},\frac{N-r}{2}]$ is 2, because node $m$ can only link to two nodes i.e. nodes $m+r$ and $2m+r$; similar scenarios appear to the other nodes. Thus, we can derive the distribution of out-degrees in the thermodynamic limit, as follows: $$P(k) =\frac{\frac{N-r}{k}-\frac{N-r}{k+1}}{N-r} = \frac{1}{k(k+1)}, \ k \geq 1.
\label{eq:deg}$$

In $G(0,N)$, the numbers larger than $N/2$ have no out-links, i.e. $P(0)=\frac{N- \lfloor N/2 \rfloor}{N}$, and the numbers in the range of $(N/3,N/2]$ have only one out-link, i.e. $P(1)=\frac{\lfloor N/2 \rfloor-\lfloor N/3 \rfloor}{N}$. Analogously, as $N \to \infty$, $$P(k) =\frac{\frac{N}{k+1}-\frac{N}{k+2}}{N} = \frac{1}{(k+1)(k+2)}, \ k \geq 0.
\label{eq:deg0}$$ This is the same as the in-degree distribution of a growing network with copying [@ksky05], which can be regarded as a random version of the divisibility network [@shi10].

Calculating the average degree of sparse MCN {#calculating-the-average-degree-of-sparse-mcn .unnumbered}
--------------------------------------------

Note that the minimum number $r+1$ in $G(r>0,N)$ has the maximum out-degree $ \lfloor \frac{N-r} {r+1} \rfloor $ and the second minimum number $r+2$ has the out-degree $\lfloor \frac{N-r} {r+2} \rfloor $, and so on. Thus, the average degree $\bar{k}$ of $G(r>0,N)$ is $$\begin{aligned}
\bar{k} &=\frac{ \sum\limits_{i=r+1}^{N-r}{ \lfloor \frac{N-r}{i} \rfloor } }{N-r}  \\
& \approx \frac{ (N-r) (\ln {(N-r)} +2C-1)-\sum\limits_{i=1}^{r}{ \lfloor \frac{N-r}{i} \rfloor }}{N-r} \\
& \approx \ln(N-r) +H,
\end{aligned}
\label{eq:av}$$ where $C$ is the Euler constant and $H = 2C-1
-\frac{\sum\limits_{i=1}^{r}{ \lfloor \frac{N-r}{i} \rfloor
}}{N-r}$ is a constant, which is approximately $C-1-\ln(r)$ when $r$ is very large.

Eq. (\[eq:av\]) is not valid for the divisibility network $G(0,N)$. In $G(0,N)$, number 1 has the maximum out-degree $N-1$, and 2 has the second maximum out-degree $ \lfloor N/2 \rfloor -1$, and so on. In a similar way to Eq. (\[eq:av\]), we can obtain the average degree of $G(0,N)$, as $$\bar{k} =\frac{\sum\limits_{i=1}^{N}{ \lfloor \frac{N}{i} -1 \rfloor }}{N}  \approx \ln(N) +2C-2,
\label{eq:av0}$$ which is consistent with the analytical results of the undirected divisibility network [@sheka15].

Controllability of MCN and identification of driver nodes {#controllability-of-mcn-and-identification-of-driver-nodes .unnumbered}
---------------------------------------------------------

An arbitrary network with linear time-invariant dynamics under control can be described by $$\dot{\mathbf{x}} = A\mathbf{x} + B\mathbf{u},
\label{eq:ct}$$ where the vector $\mathbf{x} = (x_1 , \dots , x_N )^{\mathrm{T}}$ stands for the states of $N$ nodes, $A$ denotes the coupling matrix (transpose of the adjacency matrix) of a network, $\mathbf{u} = (u_1 , \dots , u_m )^{\mathrm{T}}$ is the vector of $m$ input signals, and $B \in \mathbb{R}^{N \times m}$ is the input matrix.

System (\[eq:ct\]) is said to be (state) controllable if the input signal $\mathbf{u}$ imposed on a minimum number $N_{\rm D}$ of driver nodes specified by control matrix $B$ can steer the state $\mathbf{x}$ from any initial state to any target state in finite time. The level of controllability of the networked system (\[eq:ct\]) is defined by the fraction $n_{\rm D}$ of driver nodes in the sense that a complex network is more controllable if a smaller fraction of driver nodes is needed to achieve full control. According to Liu [*et al*]{}. [@liu11], the key is to find a matrix $B$ associated with the minimum number of controllers to ensure full control of system (\[eq:ct\]).

Because of the sparsity of MCN, $N_{\rm D}$ of a layer $G(r,N)$ is determined by [@yuan13] $$N_{D} = \max \{1,N-r- \mathrm{rank} (A) \}.
\label{eq:pbh}$$ Because in $G(r>0,N)$ each node-labelled number can only link to the node-labelled numbers larger than itself, the coupling matrix $A$ is a strictly lower-triangular matrix. Moreover, $A$ of $G(r>0,N)$ is in a column echelon form because the minimum number linked from node $m$ is always $m+r$. In other words, the leading coefficient of the $i$th column in $A$ is precisely in the $(i+r)$th row. On the other hand, the last $r$ columns of $A$ are all zeros because the maximum $r$ nodes in $G(r>0,N)$ have no out-links, so the rank of $A$ is exactly $N-2r$. An example of matrix $A$ of $G(1,9)$ is $$A_{G(1,9)}=
\begin{pmatrix}
 0 &   0 &   0 &   0 &   0 &   0 &   0 &   0  \\
  1 &   0 &   0 &   0 &   0 &   0 &   0 &   0  \\
  0 &   1 &   0 &   0 &   0 &   0 &   0 &   0  \\
  1 &   0 &   1 &   0 &   0 &   0 &   0 &   0  \\
  0 &   0 &   0 &   1 &   0 &   0 &   0 &   0  \\
  1 &   1 &   0 &   0 &   1 &   0 &   0 &   0  \\
  0 &   0 &   0 &   0 &   0 &   1 &   0 &   0  \\
  1 &   0 &   1 &   0 &   0 &   0 &   1 &   0  \\
\end{pmatrix}.
\label{eq:mtx1}$$ According to Eq. (\[eq:pbh\]), we can show that the minimum number of driver nodes $N_{\rm D}$ for $G(r>0,N)$ is $r$ and the value of non-zero elements in $A$ does not affect ${\rm rank}(A)$, which indicate that $G(r>0,N)$ is SSC.

According to the exact controllability theory [@yuan13], the control matrix $B$ to ensure full control of the congruence network $G(r>0,N)$ should satisfy the following condition $$\mathrm{rank} [-A,B] = N-r.
\label{eq:cond}$$ Notice that the rank of the matrix $[-A, B]$ is contributed by the number of linearly independent rows, hence the input signals specified via $B$ should be imposed on the linearly dependence rows in $A$ so as to eliminate all linear correlations in Eq. (\[eq:cond\]). Apparently, the first $r$ rows in the coupling matrix $A$ of $G(r>0,N)$ are all zero rows (see Eq.(\[eq:mtx1\])), hence the $r$ driver nodes that need to be controlled to maintain full control are just the minimum $r$ nodes of the congruence network, i.e. the $r$ roots of the chains in the congruence network (see Fig. \[fig2\](a)).

The coupling matrix of the divisibility network $G(0,N)$ is also a strictly lower-triangular matrix and in a column echelon form, but the rank of the matrix is $ \lfloor N/2 \rfloor $, because in $G(0,N)$ the node with labelled number larger than $ \lfloor N/2
\rfloor $ has no out-links, namely, the last $ \lceil N/2 \rceil $ columns of the matrix are all zeros. An example of $G(0,9)$ is $$A_{G(0,9)}=
\begin{pmatrix}
 0 &   0 &   0 &   0 &   0 &   0 &   0 &   0 &   0  \\
  1 &   0 &   0 &   0 &   0 &   0 &   0 &   0 &   0  \\
  1 &   0 &   0 &   0 &   0 &   0 &   0 &   0 &   0  \\
  1 &   1 &   0 &   0 &   0 &   0 &   0 &   0 &   0  \\
  1 &   0 &   0 &   0 &   0 &   0 &   0 &   0 &   0  \\
  1 &   1 &   1 &   0 &   0 &   0 &   0 &   0 &   0  \\
  1 &   0 &   0 &   0 &   0 &   0 &   0 &   0 &   0  \\
  1 &   1 &   0 &   1 &   0 &   0 &   0 &   0 &   0  \\
  1 &   0 &   1 &   0 &   0 &   0 &   0 &   0 &   0  \\
\end{pmatrix}
.\label{eq:mtx0}$$

Therefore, according to Eq. (\[eq:pbh\]), we finally obtain the minimum number of driver nodes of $G(0,N)$ as $N_D=\lceil N/2
\rceil$, indicating that one must control half of the nodes in order to control the whole divisibility network. Moreover, the value of non-zero elements in $A$ does not affect ${\rm rank}(A)$, which indicate that $G(0,N)$ is SSC. Thus, the MCN composed of $G(0,N)$ and $G(r>0,N)$ is SSC.

[**Acknowledgments:**]{} We thank Dr. Zhengzhong Yuan for useful discussions. X.-Y.Y. was supported by NSFC under Grant Nos. 61304177, 71525002 and the Fundamental Research Funds of BJTU under Grant No. 2015RC042. W.-X.W. was supported by NSFC under Grant No. 61573064. G.-R.C. was supported by the Hong Kong Research Grants Council under the GRF Grant CityU11208515. D.-H.S. was supported by NSFC under Grant No. 61174160.

[10]{} url \#1[`#1`]{}urlprefix\[2\][\#2]{} \[2\]\[\][[\#2](#2)]{}

& ** (, ).

, , & ** (, ).

. ** ().

** (, ).

** (, ).

** (, ).

**, vol.  (, ).

. ** ****, ().

& . In **, (, ).

** (, ).

. ** ****, ().

, , , & . ** ****, ().

. ** ****, ().

, , & . ** ****, ().

, & . ** ****, ().

& . ** ****, ().

, & . ** ****, ().

, & . ** ****, ().

. ** ****, ().

, , & . ** ****, ().

, & . ** ****, ().

, , , & . ** ****, ().

, & . ** ****, ().

, & . ** ****, ().

, & . ** ****, ().

, & . ** ****, ().

, & . ** ****, ().

, , & . ** ****, ().

. ** ****, ().

, & ** (, ).

**, vol.  (, ).

& ** (, ).

& . ** ****, ().
