Hostname: page-component-7b7567c8c-jswmv Total loading time: 0 Render date: 2026-11-15T23:31:20.048Z Has data issue: false hasContentIssue false

On Construction of Sparse Probabilistic Boolean Networks

Published online by Cambridge University Press:  28 May 2015

Xi Chen*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
Hao Jiang*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
Wai-Ki Ching*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
*
Corresponding author. Email: dlkcissy@hku.hk
Corresponding author. Email: haohao@hkusuc.hku.hk
Corresponding author. Email: wching@hku.hk
Get access

Abstract

In this paper we envisage building Probabilistic Boolean Networks (PBNs) from a prescribed stationary distribution. This is an inverse problem of huge size that can be subdivided into two parts — viz. (i) construction of a transition probability matrix from a given stationary distribution (Problem ST), and (ii) construction of a PBN from a given transition probability matrix (Problem TP). A generalized entropy approach has been proposed for Problem ST and a maximum entropy rate approach for Problem TP respectively. Here we propose to improve both methods, by considering a new objective function based on the entropy rate with an additional term of La-norm that can help in getting a sparse solution. A sparse solution is useful in identifying the major component Boolean networks (BNs) from the constructed PBN. These major BNs can simplify the identification of the network structure and the design of control policy, and neglecting non-major BNs does not change the dynamics of the constructed PBN to a large extent. Numerical experiments indicate that our new objective function is effective in finding a better sparse solution.

Information

Type
Research Article
Copyright
Copyright © Global-Science Press 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable