度序列的均匀抽样简单有向图实现
On uniform sampling simple directed graph realizations of degree sequences
摘要：
选择度序列的均匀采样简单有向图实现有许多应用，特别是在通常不允许自循环的社交网络中。过去已经表明，可以通过执行两种类型的切换来执行马尔可夫链弧切换算法以均匀地对简单有向图进行采样：2-切换和有向3-循环重定向。本文讨论了在什么情况下需要定向3循环重定向。特别地，需要的度序列的类是有向3圈锚定度序列的子类。这个结果的一个重要含义是减少马尔可夫链算法，只使用2开关。
英文摘要：
Choosing a uniformly sampled simple directed graph realization of a degree sequence has many applications, in particular in social networks where self-loops are commonly not allowed. It has been shown in the past that one can perform a Markov chain arc-switching algorithm to sample a simple directed graph uniformly by performing two types of switches: a 2-switch and a directed 3-cycle reorientation. This paper discusses under what circumstances a directed 3-cycle reorientation is required. In particular, the class of degree sequences where this is required is a subclass of the directed 3-cycle anchored degree sequences. An important implication of this result is a reduced Markov chain algorithm that uses only 2-switches.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
