| Id |
Subject |
Object |
Predicate |
Lexical cue |
| T71 |
0-178 |
Sentence |
denotes |
Information network: the network has (N+1) nodes, first N are individual nodes representing N individuals denoted as i,i=1,2,⋯N, and one government information node denoted as j. |
| T72 |
179-397 |
Sentence |
denotes |
The degree of an individual node i is denoted as yi, which obeys a power-law distribution, that is, Fyi∝yi−v, where F(·) is the CDF and yi satisfies ϵ≤1∕yi≤1, where ϵ is a small constant to avoid the degree to blow up. |
| T73 |
398-482 |
Sentence |
denotes |
Degree and degree distribution are concepts used in graph theory and network theory. |
| T74 |
483-585 |
Sentence |
denotes |
A graph (or network) consists of a number of vertices (nodes) and the edges (links) that connect them. |
| T75 |
586-681 |
Sentence |
denotes |
The number of edges (links) connected to each vertex (node) is the degree of the vertex (node). |
| T76 |
682-979 |
Sentence |
denotes |
The degree distribution is a general description of the number of degrees of vertices (nodes) in a graph (or network), and, for random graphs, the degree distribution is the probability distribution of the number of degrees of vertices in the graph, which usually assumes a power-law distribution. |
| T77 |
980-1039 |
Sentence |
denotes |
Throughout the following analysis, we take v=−1 and ϵ=0.01. |
| T78 |
1040-1286 |
Sentence |
denotes |
The government node j (representing real-world government) discloses information to every individual node and can only obtain information from n1 (n1≪N) (The notation “≪” means that the number n1 must be far less than the number N.) random nodes. |
| T79 |
1287-1404 |
Sentence |
denotes |
The neighborhood of an individual node i is the set of all other nodes (including j) it connects with, denoted as Oi. |
