On Construction of Sparse Probabilistic Boolean Networks

DOI10.4208/eajam.030511.060911azbMath1284.60141OpenAlexW2162479941MaRDI QIDQ5406906

Wai-Ki Ching, Xi Chen, Hao Jiang

Publication date: 4 April 2014

Published in: East Asian Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/40998500a92346dd6eed40fef7a26b5706c2e5e8

zbMATH Keywords

entropytransition probability matrixstationary distributionsparsityprobabilistic Boolean networks

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items

A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks, A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint, Bayesian selection probability estimation for probabilistic Boolean networks, On Generating Optimal Sparse Probabilistic Boolean Networks with Maximum Entropy from a Positive Stationary Distribution, Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• Markov chains: models, algorithms and applications
• Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation.
• Generating probabilistic Boolean networks from a prescribed stationary distribution
• Coefficient of determination in nonlinear signal processing.
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Trust Region Methods
• Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach