July 1, 2007 Journal article Closed Access

Dong-Uk Hwang; Vito Latora; Stefano Boccaletti

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Dong-Uk Hwang</dc:creator>
  <dc:creator>Vito Latora</dc:creator>
  <dc:creator>Stefano Boccaletti</dc:creator>
  <dc:date>2007-07-01</dc:date>
  <dc:description>We introduce a fully nonhierarchical network growing mechanism, that furthermore does not impose explicit preferential attachment rules. The growing procedure produces a graph featuring power-law degree and clustering distributions, and manifesting slightly disassortative degree-degree correlations. The rigorous rate equations for the evolution of the degree distribution and for the conditional degree-degree probability are derived.</dc:description>
  <dc:identifier>https://www.openaccessrepository.it/record/141631</dc:identifier>
  <dc:identifier>10.1142/s0218127407018518</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>url:https://www.openaccessrepository.it/communities/itmirror</dc:relation>
  <dc:rights>info:eu-repo/semantics/closedAccess</dc:rights>
  <dc:subject>Knowmad Institut</dc:subject>
  <dc:subject>Applied Mathematics</dc:subject>
  <dc:subject>Modeling and Simulation</dc:subject>
  <dc:subject>Engineering (miscellaneous)</dc:subject>
  <dc:title>GROWING HIERARCHICAL SCALE-FREE NETWORKS BY MEANS OF NONHIERARCHICAL PROCESSES</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>