Description Usage Arguments Value Note Author(s) References Examples

Generate N random strings of n>1 binary spin variables (i.e. each element is -1 or 1) arising from a fully-visible Boltzmann machine with some specified bias vector and interaction matrix.

1 | ```
rfvbm(num, bvec, Mmat)
``` |

`num` |
Number N of random strings to be generated. |

`bvec` |
Vector of length n containing real valued bias parameters. |

`Mmat` |
Symmetric n by n matrix, with zeros along the diagonal, containing the interaction parameters. |

An N by n matrix, where each row contains a random spin variable string from a fully-visible Boltzmann machine with bias vector `bvec`

and interaction matrix `Mmat`

.

The function `allpfvbm`

must be called each time this function is run. Thus, it is much more efficient to generate N strings all at once, than to generate strings one at a time.

Andrew T. Jones and Hien D. Nguyen

H.D. Nguyen and I.A. Wood (2016), Asymptotic normality of the maximum pseudolikelihood estimator for fully-visible Boltzmann machines, IEEE Transactions on Neural Networks and Learning Systems, vol. 27, pp. 897-902.

1 2 3 4 5 |

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.