Quantcast

Asymptotic Behaviour of the Number of Labelled Essential Acyclic Digraphs and Labelled Chain Graphs

Research paper by Bertran Steinsky

Indexed on: 01 Aug '04Published on: 01 Aug '04Published in: Graphs and Combinatorics



Abstract

We provide an asymptotic formula for the number of labelled essential DAGs an and show that limn→∞an′/an=c, where an′ is the number of labelled DAGs and c≈13.65, which is interesting in the field of Bayesian networks. Furthermore, we present an asymptotic formula for the number of labelled chain graphs.