numbermixed: The number of possible networks
In ClausDethlefsen/deal: Learning Bayesian Networks with Mixed Variables
numbermixed R Documentation
The number of possible networks
Description
Calculates the number of different directed acyclic graphs
for a set of discrete and continuous nodes.
Usage
numbermixed(nd,nc)
Arguments
nd
an integer, which gives the number of discrete nodes.
nc
an integer, which gives the number of continuous nodes.
Details
No arrows are allowed from continuous nodes to discrete nodes. Cycles
are not allowed. The
number of networks is given by Bottcher (2003), using the result in
Robinson (1977).
When nd+nc>15, the procedure is quite slow.
Value
A numeric containing the number of directed acyclic graphs with the given node
configuration.
Author(s)
Susanne Gammelgaard Bottcher,
Claus Dethlefsen rpackage.deal@gmail.com.
References
Bottcher, S.G. (2003). Learning Conditional Gaussian
Networks. Aalborg University, 2003.
Robinson, R.W. (1977). Counting unlabeled acyclic digraphs, Lecture
Notes in Mathematics, 622: Combinatorial Mathematics.
Examples
numbermixed(2,2)
## Not run: numbermixed(5,10)
ClausDethlefsen/deal documentation built on Nov. 18, 2022, 11:38 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| numbermixed | R Documentation |
The number of possible networks
Description
Calculates the number of different directed acyclic graphs for a set of discrete and continuous nodes.
Usage
numbermixed(nd,nc)
Arguments
nd |
an integer, which gives the number of discrete nodes. |
nc |
an integer, which gives the number of continuous nodes. |
Details
No arrows are allowed from continuous nodes to discrete nodes. Cycles are not allowed. The number of networks is given by Bottcher (2003), using the result in Robinson (1977).
When nd+nc>15, the procedure is quite slow.
Value
A numeric containing the number of directed acyclic graphs with the given node configuration.
Author(s)
Susanne Gammelgaard Bottcher,
Claus Dethlefsen rpackage.deal@gmail.com.
References
Bottcher, S.G. (2003). Learning Conditional Gaussian Networks. Aalborg University, 2003.
Robinson, R.W. (1977). Counting unlabeled acyclic digraphs, Lecture Notes in Mathematics, 622: Combinatorial Mathematics.
Examples
numbermixed(2,2) ## Not run: numbermixed(5,10)
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.