July 1, 2007 Journal article Open Access

Dong-Uk Hwang; Vito Latora; Stefano Boccaletti

JSON-LD (schema.org) Export

{
  "@context": "https://schema.org/", 
  "@id": "https://doi.org/10.1142/s0218127407018518", 
  "@type": "ScholarlyArticle", 
  "creator": [
    {
      "@type": "Person", 
      "name": "Dong-Uk Hwang"
    }, 
    {
      "@type": "Person", 
      "name": "Vito Latora"
    }, 
    {
      "@type": "Person", 
      "name": "Stefano Boccaletti"
    }
  ], 
  "datePublished": "2007-07-01", 
  "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.", 
  "headline": "GROWING HIERARCHICAL SCALE-FREE NETWORKS BY MEANS OF NONHIERARCHICAL PROCESSES", 
  "identifier": "https://doi.org/10.1142/s0218127407018518", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "inLanguage": {
    "@type": "Language", 
    "alternateName": "eng", 
    "name": "English"
  }, 
  "keywords": [
    "Knowmad Institut", 
    "Applied Mathematics", 
    "Modeling and Simulation", 
    "Engineering (miscellaneous)"
  ], 
  "license": "", 
  "name": "GROWING HIERARCHICAL SCALE-FREE NETWORKS BY MEANS OF NONHIERARCHICAL PROCESSES", 
  "url": "https://www.openaccessrepository.it/record/141631"
}