Offdiagonal complexity: A computationally quick network complexity measure. Application to protein networks and cell division

Details Offdiagonal complexity: A computationally quick network complexity measure. Application to protein networks and cell division Offdiagonal complexity: A computationally quick network complexity measure. Application to protein networks and cell division

2007-12-27

arxiv.org/abs/0712.4216v1

Mathematical Modeling of Biological Systems II. Ed. A.Deutsch et al., Birkhaeuser Boston 291-299 (2007)

Biology

Quantitative Biology

Quantitative Methods

9 pages, extends Physica A 375, 365-373 (2007) http://dx.doi.org/10.1016/j.physa.2006.08.067 by FullOdC and application to a

Scientific paper

Many complex biological, social, and economical networks show topologies drastically differing from random graphs. But, what is a complex network, i.e.\ how can one quantify the complexity of a graph? Here the Offdiagonal Complexity (OdC), a new, and computationally cheap, measure of complexity is defined, based on the node-node link cross-distribution, whose nondiagonal elements characterize the graph structure beyond link distribution, cluster coefficient and average path length. The OdC apporach is applied to the {\sl Helicobacter pylori} protein interaction network and randomly rewired surrogates thereof. In addition, OdC is used to characterize the spatial complexity of cell aggregates. We investigate the earliest embryo development states of Caenorhabditis elegans. The development states of the premorphogenetic phase are represented by symmetric binary-valued cell connection matrices with dimension growing from 4 to 385. These matrices can be interpreted as adjacency matrix of an undirected graph, or network. The OdC approach allows to describe quantitatively the complexity of the cell aggregate geometry.

Affiliated with

Also associated with

No associations

Rating

Offdiagonal complexity: A computationally quick network complexity measure. Application to protein networks and cell division does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Offdiagonal complexity: A computationally quick network complexity measure. Application to protein networks and cell division, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Offdiagonal complexity: A computationally quick network complexity measure. Application to protein networks and cell division will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-201270