Blog
About

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

      Null models for community detection in spatially embedded, temporal networks

      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 references 74

          • Record: found
          • Abstract: not found
          • Book: not found

          Social Network Analysis

            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Modularity and community structure in networks

             M. Newman (2006)
            Many networks of interest in the sciences, including a variety of social and biological networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure has attracted considerable recent attention. One of the most sensitive detection methods is optimization of the quality function known as "modularity" over the possible divisions of a network, but direct application of this method using, for instance, simulated annealing is computationally costly. Here we show that the modularity can be reformulated in terms of the eigenvectors of a new characteristic matrix for the network, which we call the modularity matrix, and that this reformulation leads to a spectral algorithm for community detection that returns results of better quality than competing methods in noticeably shorter running times. We demonstrate the algorithm with applications to several network data sets.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Community detection in graphs

              The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.
                Bookmark

                Author and article information

                Journal
                Journal of Complex Networks
                jcomplexnetw
                Oxford University Press (OUP)
                2051-1310
                2051-1329
                August 25 2016
                September 2016
                September 2016
                November 26 2015
                : 4
                : 3
                : 363-406
                10.1093/comnet/cnv027
                © 2015

                Comments

                Comment on this article