Extreme self-organization in networks constructed from gene expression data
arXiv:cond-mat/0207409 · doi:10.1103/PhysRevLett.89.268702
Abstract
We study networks constructed from gene expression data obtained from many types of cancers. The networks are constructed by connecting vertices that belong to each others' list of K-nearest-neighbors, with K being an a priori selected non-negative integer. We introduce an order parameter for characterizing the homogeneity of the networks. On minimizing the order parameter with respect to K, degree distribution of the networks shows power-law behavior in the tails with an exponent of unity. Analysis of the eigenvalue spectrum of the networks confirms the presence of the power-law and small-world behavior. We discuss the significance of these findings in the context of evolutionary biological processes.
4 pages including 3 eps figures, revtex. Revisions as in published version
References in corpus (6)
Cited by in corpus (6)
- Transport on Complex Networks: Flow, Jamming and Optimization
- Connectivity Distribution of Spatial Networks
- The shortest path to complex networks
- Probabilities of spurious connections in gene networks: Application to expression time series
- Preferential compactness of networks
- Error-rate and decision-theoretic methods of multiple testing: Which genes have high objective probabilities of differential expression?