Entropy analysis of Boolean network reduction according to the determinative power of nodes

DOI10.1016/j.physa.2021.126621OpenAlexW3005399447MaRDI QIDQ2669279

Mihaela T. Velcsov, Matthew Pelz

Publication date: 9 March 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2021.126621

zbMATH Keywords

mutual informationnetwork reductionnumerical simulationsShannon entropyBoolean networksbiological information theorydeterminative power

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Nested canalyzing depth and network stability
• Logical reduction of biological networks to their most determinative components
• The value of less connected agents in Boolean networks
• Biologically meaningful update rules increase the critical connectivity of generalized Kauffman networks
• Dynamical phase transition in a neural network model with noise: An exact solution
• The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
• A Reduction Method for Boolean Network Models Proven to Conserve Attractors
• Canalizing Boolean Functions Maximize Mutual Information
• Emergence of Scaling in Random Networks
• SIMPLIFYING BOOLEAN NETWORKS
• Complexity and irreducibility of dynamics on networks of networks
• Dynamics Preserving Size Reduction Mappings for Probabilistic Boolean Networks
• Collective dynamics of ‘small-world’ networks
• Elements of Information Theory

This page was built for publication: Entropy analysis of Boolean network reduction according to the determinative power of nodes