45
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Critical phenomena in complex networks

      , ,
      Reviews of Modern Physics
      American Physical Society (APS)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references331

          • Record: found
          • Abstract: found
          • Article: not found

          Epidemic Spreading in Scale-Free Networks

          The Internet has a very complex connectivity recently modeled by the class of scale-free networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from computer virus infections and find the average lifetime and persistence of viral strains on the Internet. We define a dynamical model for the spreading of infections on scale-free networks, finding the absence of an epidemic threshold and its associated critical behavior. This new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Assortative Mixing in Networks

            M. Newman (2002)
            A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              From Kuramoto to Crawford: exploring the onset of synchronization in populations of coupled oscillators

                Bookmark

                Author and article information

                Journal
                RMPHAT
                Reviews of Modern Physics
                Rev. Mod. Phys.
                American Physical Society (APS)
                0034-6861
                1539-0756
                October 2008
                October 6 2008
                : 80
                : 4
                : 1275-1335
                Article
                10.1103/RevModPhys.80.1275
                44e70182-19fe-4fb7-8263-e4bb7982fd9b
                © 2008

                http://link.aps.org/licenses/aps-default-license

                History

                Comments

                Comment on this article