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

      Typical approximation performance for maximum coverage problem

      , ,
      Physical Review E
      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 references25

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

          An analysis of approximations for maximizing submodular set functions—I

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

            Random graphs with arbitrary degree distributions and their applications

            Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in the past. In this paper we develop in detail the theory of random graphs with arbitrary degree distributions. In addition to simple undirected, unipartite graphs, we examine the properties of directed and bipartite graphs. Among other results, we derive exact expressions for the position of the phase transition at which a giant component first forms, the mean component size, the size of the giant component if there is one, the mean number of vertices a certain distance away from a randomly chosen vertex, and the average vertex-vertex distance within a graph. We apply our theory to some real-world graphs, including the world-wide web and collaboration graphs of scientists and Fortune 1000 company directors. We demonstrate that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Exchange Monte Carlo Method and Application to Spin Glass Simulations

              We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is introduced. This exchange process is expected to let the system at low temperatures escape from a local minimum. By using this algorithm the three-dimensional \(\pm J\) Ising spin glass model is studied. The ergodicity time in this method is found much smaller than that of the multi-canonical method. In particular the time correlation function almost follows an exponential decay whose relaxation time is comparable to the ergodicity time at low temperatures. It suggests that the system relaxes very rapidly through the exchange process even in the low temperature phase.
                Bookmark

                Author and article information

                Journal
                PLEEE8
                Physical Review E
                Phys. Rev. E
                American Physical Society (APS)
                2470-0045
                2470-0053
                February 2018
                February 23 2018
                : 97
                : 2
                Article
                10.1103/PhysRevE.97.022138
                7e435c5a-3c73-4024-b2b2-9fbb306dc6b6
                © 2018

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

                History

                Comments

                Comment on this article