具有指定度相关的图的精确抽样
Exact sampling of graphs with prescribed degree correlations
摘要:
许多现实世界的网络都表现出节点度之间的相关性。例如,在社交网络中,节点倾向于连接到相似度的节点。相反,在生物和技术网络中,高度节点往往与低度节点相连。度相关性也会影响网络结构所支持的过程的动态性,例如意见或流行病的传播。这些系统的正确建模,即,在没有不受控制的偏差的情况下,需要对具有指定约束集的网络进行采样。我们提出了一个解决方案时,所施加的约束是度相关性的采样问题。特别是,我们开发了一种高效和精确的方法来构建和采样图与指定的联合度矩阵,这是一个矩阵提供的边缘数之间的所有节点集的一个给定的程度,为所有度,从而完全指定所有成对度的相关性,此外,度序列本身。我们的算法总是产生独立的样本没有回溯。图的构造算法的复杂度是O(NM),其中N是节点数,M是边数。
英文摘要:
Many real-world networks exhibit correlations between the node degrees. For instance, in social networks nodes tend to connect to nodes of similar degree. Conversely, in biological and technological networks, high-degree nodes tend to be linked with low-degree nodes. Degree correlations also affect the dynamics of processes supported by a network structure, such as the spread of opinions or epidemics. The proper modelling of these systems, i.e., without uncontrolled biases, requires the sampling of networks with a specified set of constraints. We present a solution to the sampling problem when the constraints imposed are the degree correlations. In particular, we develop an efficient and exact method to construct and sample graphs with a specified joint-degree matrix, which is a matrix providing the number of edges between all the sets of nodes of a given degree, for all degrees, thus completely specifying all pairwise degree correlations, and additionally, the degree sequence itself. Our algorithm always produces independent samples without backtracking. The complexity of the graph construction algorithm is O(NM) where N is the number of nodes and M is the number of edges.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。