DeepAI AI Chat
Log In Sign Up

A Bayesian Nonparametric Stochastic Block Model for Directed Acyclic Graphs

01/18/2023
by   Clement Lee, et al.
0

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.

READ FULL TEXT

page 22

page 24

04/25/2015

A Prior Distribution over Directed Acyclic Graphs for Sparse Bayesian Networks

The main contribution of this article is a new prior distribution over d...
10/28/2015

Priors on exchangeable directed graphs

Directed graphs occur throughout statistical modeling of networks, and e...
02/16/2018

Diversity from the Topology of Citation Networks

We study transitivity in directed acyclic graphs and its usefulness in c...
09/20/2019

Inference for the stochastic block model with unknown number of blocks and non-conjugate edge models

The stochastic block model (SBM) is a popular model for capturing commun...
06/12/2019

Structure learning of Bayesian networks involving cyclic structures

Many biological networks include cyclic structures. In such cases, Bayes...
09/25/2020

Bayesian Testing for Exogenous Partition Structures in Stochastic Block Models

Network data often exhibit block structures characterized by clusters of...
12/04/2017

Sub-clustering in decomposable graphs and size-varying junction trees

This paper proposes a novel representation of decomposable graphs based ...