PMC:7795931 / 12161-13565 JSONTXT

{"project":"LitCovid-sentences","denotations":[{"id":"T71","span":{"begin":0,"end":178},"obj":"Sentence"},{"id":"T72","span":{"begin":179,"end":397},"obj":"Sentence"},{"id":"T73","span":{"begin":398,"end":482},"obj":"Sentence"},{"id":"T74","span":{"begin":483,"end":585},"obj":"Sentence"},{"id":"T75","span":{"begin":586,"end":681},"obj":"Sentence"},{"id":"T76","span":{"begin":682,"end":979},"obj":"Sentence"},{"id":"T77","span":{"begin":980,"end":1039},"obj":"Sentence"},{"id":"T78","span":{"begin":1040,"end":1286},"obj":"Sentence"},{"id":"T79","span":{"begin":1287,"end":1404},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"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. 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. Degree and degree distribution are concepts used in graph theory and network theory. A graph (or network) consists of a number of vertices (nodes) and the edges (links) that connect them. The number of edges (links) connected to each vertex (node) is the degree of the vertex (node). 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. Throughout the following analysis, we take v=−1 and ϵ=0.01. 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. The neighborhood of an individual node i is the set of all other nodes (including j) it connects with, denoted as Oi."}