On construction of sparse probabilistic Boolean networks.

DOI10.4208/EAJAM.030511.060911AzbMATH Open1284.60141OpenAlexW2162479941MaRDI QIDQ5406906FDOQ5406906

Authors: Xi Chen, Hao Jiang, Wai-Ki Ching 

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

Recommendations

• On generating optimal sparse probabilistic Boolean networks with maximum entropy from a positive stationary distribution.
• Construction of probabilistic Boolean networks from a prescribed transition probability matrix: a maximum entropy rate approach.
• A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
• Generating probabilistic Boolean networks from a prescribed stationary distribution
• Distributional observability of probabilistic Boolean networks

zbMATH Keywords

entropysparsitystationary distributionprobabilistic Boolean networkstransition probability matrix

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)

Cites Work

• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• A Mathematical Theory of Communication
• Trust Region Methods
• Markov chains: models, algorithms and applications
• Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation.
• Title not available (Why is that?)
• Coefficient of determination in nonlinear signal processing.
• Construction of probabilistic Boolean networks from a prescribed transition probability matrix: a maximum entropy rate approach.
• Generating probabilistic Boolean networks from a prescribed stationary distribution

Cited In (7)

• Bayesian selection probability estimation for probabilistic Boolean networks
• A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
• Construction of probabilistic Boolean networks from a prescribed transition probability matrix: a maximum entropy rate approach.
• On generating optimal sparse probabilistic Boolean networks with maximum entropy from a positive stationary distribution.
• Sparse probabilistic Boolean network problems: a partial proximal-type operator splitting method
• A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint
• Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks.

This page was built for publication: On construction of sparse probabilistic Boolean networks.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406906)