IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2412.10524.html
   My bibliography  Save this paper

Is Polarization an Inevitable Outcome of Similarity-Based Content Recommendations? -- Mathematical Proofs and Computational Validation

Author

Listed:
  • Minhyeok Lee

Abstract

The increasing reliance on digital platforms shapes how individuals understand the world, as recommendation systems direct users toward content "similar" to their existing preferences. While this process simplifies information retrieval, there is concern that it may foster insular communities, so-called echo chambers, reinforcing existing viewpoints and limiting exposure to alternatives. To investigate whether such polarization emerges from fundamental principles of recommendation systems, we propose a minimal model that represents users and content as points in a continuous space. Users iteratively move toward the median of locally recommended items, chosen by nearest-neighbor criteria, and we show mathematically that they naturally coalesce into distinct, stable clusters without any explicit ideological bias. Computational simulations confirm these findings and explore how population size, adaptation rates, content production probabilities, and noise levels modulate clustering speed and intensity. Our results suggest that similarity-based retrieval, even in simplified scenarios, drives fragmentation. While we do not claim all systems inevitably cause polarization, we highlight that such retrieval is not neutral. Recognizing the geometric underpinnings of recommendation spaces may inform interventions, policies, and critiques that address unintended cultural and ideological divisions.

Suggested Citation

  • Minhyeok Lee, 2024. "Is Polarization an Inevitable Outcome of Similarity-Based Content Recommendations? -- Mathematical Proofs and Computational Validation," Papers 2412.10524, arXiv.org.
  • Handle: RePEc:arx:papers:2412.10524
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2412.10524
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2412.10524. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.