Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach

Publisher： Cambridge University Press

E-ISSN： 2079-7370|1|2|132-154

ISSN： 2079-7362

Source： East Asian Journal on Applied Mathematics, Vol.1, Iss.2, 2011-05, pp. : 132-154

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On Generating Optimal Sparse Probabilistic Boolean Networks with Maximum Entropy from a Positive Stationary Distribution

By  

East Asian Journal on Applied Mathematics, Vol. 2, Iss. 4, 2012-11 ,pp. : 353-372

Cambridge University Press

Access to resources Recommend Favorite

On Construction of Sparse Probabilistic Boolean Networks

By  

East Asian Journal on Applied Mathematics, Vol. 2, Iss. 1, 2012-02 ,pp. : 1-18

Cambridge University Press

Access to resources Recommend Favorite

Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity

By Dalai Deepak   Maitra Subhamoy   Sarkar Sumanta  

Designs, Codes and Cryptography, Vol. 40, Iss. 1, 2006-07 ,pp. : 41-58

Springer Publishing Company

Access to resources Recommend Favorite

Space-time mapping of soil salinity using probabilistic bayesian maximum entropy

By Douaik A.   van Meirvenne M.   Tóth T.   Serre M.  

Stochastic Environmental Research and Risk Assessment, Vol. 18, Iss. 4, 2004-08 ,pp. : 219-227

Springer Publishing Company

Access to resources Recommend Favorite

A probabilistic algorithm for finding the rate matrix of a block-GI/M/1 Markov chain

By  

ANZIAM Journal, Vol. 45, Iss. 4, 2004-04 ,pp. : 457-475

Cambridge University Press

Access to resources Recommend Favorite