Blog
About

18
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Linear and Optimization Hamiltonians in Clustered Exponential Random Graph Modeling

      Preprint

      Read this article at

      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.

          Abstract

          Exponential random graph theory is the complex network analog of the canonical ensemble theory from statistical physics. While it has been particularly successful in modeling networks with specified degree distributions, a naive model of a clustered network using a graph Hamiltonian linear in the number of triangles has been shown to undergo an abrupt transition into an unrealistic phase of extreme clustering via triangle condensation. Here we study a non-linear graph Hamiltonian that explicitly forbids such a condensation and show numerically that it generates an equilibrium phase with specified intermediate clustering.

          Related collections

          Most cited references 5

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

          Recent developments in exponential random graph (p*) models for social networks

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

            Goodness of Fit of Social Network Models

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

              Markov Graphs

                Bookmark

                Author and article information

                Journal
                1601.02331

                Condensed matter, Theoretical physics

                Comments

                Comment on this article