logNumMHNeighbours: (Log) Number of neighbouring networks.
In rjbgoudie/structmcmc: Structural inference for Bayesian Networks and Variable Selection.
Description
Usage
Arguments
Value
See Also
Description
Returns the number of acyclic graphs that can be formed
by adding, removing or flipping a single edge of the
current network
Usage
1
2
logNumMHNeighbours(routes, adjacency, constraintT,
maxNumberParents = Inf)
Arguments
routes
The routes matrix of the network
adjacency
The adjacency matrix of the network
constraintT
The transpose of a constraint matrix
maxNumberParents
Integer of length 1. The maximum
number of parents of any node.
Value
A numeric of length 1. The log number of neighbouring
graphs.
See Also
rjbgoudie/structmcmc documentation built on Nov. 3, 2020, 3:41 a.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.
Description Usage Arguments Value See Also
Description
Returns the number of acyclic graphs that can be formed by adding, removing or flipping a single edge of the current network
Usage
1 2 | logNumMHNeighbours(routes, adjacency, constraintT,
maxNumberParents = Inf)
|
Arguments
routes |
The routes matrix of the network |
adjacency |
The adjacency matrix of the network |
constraintT |
The transpose of a constraint matrix |
maxNumberParents |
Integer of length 1. The maximum number of parents of any node. |
Value
A numeric of length 1. The log number of neighbouring graphs.
See Also
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.