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

      Finite-size analysis of the detectability limit of the stochastic block model

      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 references39

          • Record: found
          • Abstract: found
          • Article: not 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
            • Record: found
            • Abstract: not found
            • Article: not found

            A critical point for random graphs with a given degree sequence

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

              Maps of random walks on complex networks reveal community structure

              To comprehend the multipartite organization of large-scale biological and social systems, we introduce a new information theoretic approach that reveals community structure in weighted and directed networks. The method decomposes a network into modules by optimally compressing a description of information flows on the network. The result is a map that both simplifies and highlights the regularities in the structure and their relationships. We illustrate the method by making a map of scientific communication as captured in the citation patterns of more than 6000 journals. We discover a multicentric organization with fields that vary dramatically in size and degree of integration into the network of science. Along the backbone of the network -- including physics, chemistry, molecular biology, and medicine -- information flows bidirectionally, but the map reveals a directional pattern of citation from the applied fields to the basic sciences.
                Bookmark

                Author and article information

                Journal
                PLEEE8
                Physical Review E
                Phys. Rev. E
                American Physical Society (APS)
                2470-0045
                2470-0053
                June 2017
                June 19 2017
                : 95
                : 6
                Article
                10.1103/PhysRevE.95.062304
                fc5907f2-d48e-414c-972b-fd317746d59d
                © 2017

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

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

                History

                Comments

                Comment on this article