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

      Social media and political communication: a social media analytics framework

      ,
      Social Network Analysis and Mining
      Springer Nature

      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 references37

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

          Community structure in social and biological networks

          A number of recent studies have focused on the statistical properties of networked systems such as social networks and the World-Wide Web. Researchers have concentrated particularly on a few properties which seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this paper, we highlight another property which is found in many networks, the property of community structure, in which network nodes are joined together in tightly-knit groups between which there are only looser connections. We propose a new method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer generated and real-world graphs whose community structure is already known, and find that it detects this known structure with high sensitivity and reliability. We also apply the method to two networks whose community structure is not well-known - a collaboration network and a food web - and find that it detects significant and informative community divisions in both cases.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Finding and evaluating community structure in networks

            We propose and study a set of algorithms for discovering community structure in networks -- natural divisions of network nodes into densely connected subgroups. Our algorithms all share two definitive features: first, they involve iterative removal of edges from the network to split it into communities, the edges removed being identified using one of a number of possible "betweenness" measures, and second, these measures are, crucially, recalculated after each removal. We also propose a measure for the strength of the community structure found by our algorithms, which gives us an objective metric for choosing the number of communities into which a network should be divided. We demonstrate that our algorithms are highly effective at discovering community structure in both computer-generated and real-world network data, and show how they can be used to shed light on the sometimes dauntingly complex structure of networked systems.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The Law of Group Polarization

                Bookmark

                Author and article information

                Journal
                Social Network Analysis and Mining
                Soc. Netw. Anal. Min.
                Springer Nature
                1869-5450
                1869-5469
                December 2013
                August 2012
                : 3
                : 4
                : 1277-1291
                Article
                10.1007/s13278-012-0079-3
                3dc29bcc-f6a5-4b57-b196-d80e5409b721
                © 2013
                History

                Comments

                Comment on this article