Directed acyclic graphs (DAGs) are commonly used in statistics as models, such as Bayesian networks. In this article, we propose a stochastic block model for data that are DAGs. Two main features of this model are the incorporation of the topological ordering of nodes as a parameter, and the use of the Pitman-Yor process as the prior for the allocation vector. In the resultant Markov chain Monte Carlo sampler, not only are the topological ordering and the number of groups inferred, but a model selection step is also included to select between the two regimes of the Pitman-Yor process. The model and the sampler are applied to two citation networks.
翻译:直接环形图(DAGs)通常作为模型在统计中使用,例如贝耶斯网络。在本条中,我们为数据是DAG提出一个随机区块模型。这一模型的两个主要特征是将节点的地形顺序作为参数,将Pitman-Yor过程作为分配矢量的前面使用。在由此生成的Markov链Monte Carlo取样器中,不仅有地形顺序和推断的组数,而且还包括一个示范选择步骤,以便在Pitman-Yor过程的两个制度之间作出选择。模型和取样器适用于两个引用网络。