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

      Quantifying ideological polarization on a network using generalized Euclidean distance

      research-article

      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

          An intensely debated topic is whether political polarization on social media is on the rise. We can investigate this question only if we can quantify polarization, by taking into account how extreme the opinions of the people are, how much they organize into echo chambers, and how these echo chambers organize in the network. Current polarization estimates are insensitive to at least one of these factors: They cannot conclusively clarify the opening question. Here, we propose a measure of ideological polarization that can capture the factors we listed. The measure is based on the generalized Euclidean distance, which estimates the distance between two vectors on a network, e.g., representing people’s opinion. This measure can fill the methodological gap left by the state of the art and leads to useful insights when applied to real-world debates happening on social media and to data from the U.S. Congress.

          Abstract

          Abstract

          A previously unknown measure for estimating ideological divergence in social networks is used to study polarization.

          Related collections

          Most cited references75

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

          Modularity and community structure in networks

          M. Newman (2006)
          Many networks of interest in the sciences, including social networks, computer networks, and metabolic and regulatory networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure is one of the outstanding issues in the study of networked systems. One highly effective approach is the optimization of the quality function known as "modularity" over the possible divisions of a network. Here I show that the modularity can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which I call the modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times. I illustrate the method with applications to several published network data sets.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Epidemic processes in complex networks

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

              The Origins and Consequences of Affective Polarization in the United States

                Bookmark

                Author and article information

                Contributors
                Role: Data curationRole: Formal analysisRole: InvestigationRole: SoftwareRole: ValidationRole: Writing - original draftRole: Writing - review & editing
                Role: ConceptualizationRole: Formal analysisRole: MethodologyRole: Writing - review & editing
                Role: ConceptualizationRole: Formal analysisRole: InvestigationRole: MethodologyRole: Project administrationRole: ResourcesRole: SoftwareRole: SupervisionRole: ValidationRole: VisualizationRole: Writing - original draftRole: Writing - review & editing
                Journal
                Sci Adv
                Sci Adv
                sciadv
                advances
                Science Advances
                American Association for the Advancement of Science
                2375-2548
                March 2023
                01 March 2023
                : 9
                : 9
                : eabq2044
                Affiliations
                [ 1 ]Copenhagen Center for Social Data Science, University of Copenhagen, Øster Farimagsgade 5, Copenhagen, Denmark.
                [ 2 ]Mathematical Institute, University of Oxford, Woodstock Road, Oxford, UK.
                [ 3 ]Alan Turing Institute, Euston Road 96, London, UK.
                [ 4 ]CS Department, IT University of Copenhagen, Rued Langgaards Vej 7, Copenhagen, Denmark.
                Author notes
                [* ]Corresponding author. Email: mcos@ 123456itu.dk
                [†]

                These authors contributed equally to this work.

                Author information
                https://orcid.org/0000-0002-1625-2435
                https://orcid.org/0000-0001-5495-2443
                https://orcid.org/0000-0001-5984-5137
                Article
                abq2044
                10.1126/sciadv.abq2044
                9977176
                36857460
                8d4baad4-276b-4554-a63d-5612ed571bef
                Copyright © 2023 The Authors, some rights reserved; exclusive licensee American Association for the Advancement of Science. No claim to original U.S. Government Works. Distributed under a Creative Commons Attribution License 4.0 (CC BY).

                This is an open-access article distributed under the terms of the Creative Commons Attribution license, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

                History
                : 24 March 2022
                : 31 January 2023
                Funding
                Funded by: FundRef http://dx.doi.org/10.13039/501100000266, Engineering and Physical Sciences Research Council;
                Award ID: EP/N510129/1
                Categories
                Research Article
                Social and Interdisciplinary Sciences
                SciAdv r-articles
                Computer Science
                Network Science
                Network Science
                Custom metadata
                Adrienne Del Mundo

                Comments

                Comment on this article