title   
  

Assortative mixing in close-packed spatial networks

Turgut, Deniz and Atılgan, Ali Rana and Atılgan, Canan (2010) Assortative mixing in close-packed spatial networks. PLoS One, 5 (12). ISSN 1932-6203

This is the latest version of this item.

[img]
Preview
PDF (This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
474Kb

Official URL: http://dx.doi.org/10.1371/journal.pone.0015551

Abstract

Background: In recent years, there is aroused interest in expressing complex systems as networks of interacting nodes. Using descriptors from graph theory, it has been possible to classify many diverse systems derived from social and physical sciences alike. In particular, folded proteins as examples of self-assembled complex molecules have also been investigated intensely using these tools. However, we need to develop additional measures to classify different systems, in order to dissect the underlying hierarchy. Methodology and Principal Findings: In this study, a general analytical relation for the dependence of nearest neighbor degree correlations on degree is derived. Dependence of local clustering on degree is shown to be the sole determining factor of assortative versus disassortative mixing in networks. The characteristics of networks constructed from spatial atomic/molecular systems exemplified by self-organized residue networks built from folded protein structures and block copolymers, atomic clusters and well-compressed polymeric melts are studied. Distributions of statistical properties of the networks are presented. For these densely-packed systems, assortative mixing in the network construction is found to apply, and conditions are derived for a simple linear dependence. Conclusions: Our analyses (i) reveal patterns that are common to close-packed clusters of atoms/molecules, (ii) identify the type of surface effects prominent in different close-packed systems, and (iii) associate fingerprints that may be used to classify networks with varying types of correlations.

Item Type:Article
Additional Information:Article Number: e15551
Subjects:Q Science > Q Science (General)
ID Code:16321
Deposited By:Ali Rana Atılgan
Deposited On:21 Jan 2011 11:55
Last Modified:25 May 2011 14:16

Available Versions of this Item

Repository Staff Only: item control page