Effect of memory in non-Markovian Boolean networks

Abstract

One successful model of interacting biological systems is the Boolean network. The dynamics of a Boolean network, controlled with Boolean functions, is usually considered to be a Markovian (memory-less) process. However, both self organizing features of biological phenomena and their intelligent nature should raise some doubt about ignoring the history of their time evolution. Here, we extend the Boolean network Markovian approach: we involve the effect of memory on the dynamics. This can be explored by modifying Boolean functions into non-Markovian functions, for example, by investigating the usual non-Markovian threshold function, - one of the most applied Boolean functions. By applying the non-Markovian threshold function on the dynamical process of a cell cycle network, we discover a power law memory with a more robust dynamics than the Markovian dynamics.

References in corpus (12)

• Emergence of scaling in random networks
• The Yeast Cell-Cycle Network Is Robustly Designed
• Random Boolean Network Models and the Yeast Transcriptional Network
• Boolean network model predicts cell cycle sequence of fission yeast
• Stable and unstable attractors in Boolean networks
• Simulating non-Markovian stochastic processes
• Function Constrains Network Architecture and Dynamics: A Case Study on the Yeast Cell Cycle Boolean Network
• Aging Scaled Brownian Motion
• Fractional Dynamics of Network Growth Constrained by aging Node Interactions
• Binary threshold networks as a natural null model for biological networks
• Knockouts, Robustness and Cell Cycles
• Boolean networks with veto functions

Cited by in corpus (3)

• Memory effects on epidemic evolution: The susceptible-infected-recovered epidemic model
• Glassy states of aging social networks
• Markov Chain Monte Carlo for generating ranked textual data