title: Functional holography analysis: simplifying the complexity of dynamical networks.
abstract: We present a novel functional holography (FH) analysis devised to study the dynamics of task-performing dynamical networks. The latter term refers to networks composed of dynamical systems or elements, like gene networks or neural networks. The new approach is based on the realization that task-performing networks follow some underlying principles that are reflected in their activity. Therefore, the analysis is designed to decipher the existence of simple causal motives that are expected to be embedded in the observed complex activity of the networks under study. First we evaluate the matrix of similarities (correlations) between the activities of the network's components. We then perform collective normalization of the similarities (or affinity transformation) to construct a matrix of functional correlations. Using dimension reduction algorithms on the affinity matrix, the matrix is projected onto a principal three-dimensional space of the leading eigenvectors computed by the algorithm. To retrieve back information that is lost in the dimension reduction, we connect the nodes by colored lines that represent the level of the similarities to construct a holographic network in the principal space. Next we calculate the activity propagation in the network (temporal ordering) using different methods like temporal center of mass and cross correlations. The causal information is superimposed on the holographic network by coloring the nodes locations according to the temporal ordering of their activities. First, we illustrate the analysis for simple, artificially constructed examples. Then we demonstrate that by applying the FH analysis to modeled and real neural networks as well as recorded brain activity, hidden causal manifolds with simple yet characteristic geometrical and topological features are deciphered in the complex activity. The term "functional holography" is used to indicate that the goal of the analysis is to extract the maximum amount of functional information about the dynamical network as a whole unit.
authors.affiliation: School of Physics and Astronomy, Tel Aviv University, 69978 Tel Aviv, Israel.
authors.forename: Itay
authors.initials: I
authors.lastname: Baruchi
authors.forename: Danny
authors.initials: D
authors.lastname: Grossman
authors.forename: Vladislav
authors.initials: V
authors.lastname: Volman
authors.forename: Mark
authors.initials: M
authors.lastname: Shein
authors.forename: John
authors.initials: J
authors.lastname: Hunter
authors.forename: Vernon L
authors.initials: VL
authors.lastname: Towle
authors.forename: Eshel
authors.initials: E
authors.lastname: Ben-Jacob
mesh_terms: D000465:Algorithms; D000818:Animals; D002468:Cell Physiological Phenomena; D003198:Computer Simulation; D006696:Holography; D006801:Humans; D008954:Models, Biological; D009415:Nerve Net / Q000502:physiology*; D015398:Signal Transduction / Q000502:physiology*