Abstract

One great challenge of big data research is to efficiently and
accurately identify the inherent complex network structure.
We will discuss possible approaches to reconstruct Boolean networks.
Specifically, we will prove that O(log n) state transition pairs are
sufficient and necessary to reconstruct the time delay Boolean network
of n nodes with high accuracy if the number of inputs to each
node is bounded. Future developments of methodologies and computation
systems for big data researches will be also discussed.