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

Publisher： Cambridge University Press

E-ISSN： 2079-7370|2|4|353-372

ISSN： 2079-7362

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

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

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

By  

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

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

On the tails of the distribution of the maximum of a smooth stationaryGaussian process

By Azaïs Jean-Marc   Bardet Jean-Marc   Wschebor Mario  

ESAIM: Probability and Statistics, Vol. 6, Iss. issue, 2010-03 ,pp. : 177-184

Edp Sciences

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

Bounds and asymptotic expansions for the distribution of the Maximum of a smooth stationary Gaussian process

By Azaïs Jean-Marc   Cierco-Ayrolles Christine   Croquette Alain  

ESAIM: Probability and Statistics, Vol. 3, Iss. issue, 2010-03 ,pp. : 107-129

Edp Sciences

Access to resources Recommend Favorite