<?xml version="1.0" encoding="UTF-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xml:lang="en">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>Entropy-based detection of Twitter echo chambers</title>
        <author>Manuel Pratelli</author>
        <author>Fabio Saracco</author>
        <author>Marinella Petrocchi</author>
      </titleStmt>
      <publicationStmt>
        <p>Tag layer of the DHSS Meta-Tagging Project. The article text is reproduced from the
           staged copy named in sourceDesc and is not altered; the tags are held separately in
           standOff so that overlapping and nested spans are preserved.</p>
      </publicationStmt>
      <sourceDesc>
        <bibl>
          <title>Entropy-based detection of Twitter echo chambers</title>
          <date>2024</date>
          <publisher>PNAS Nexus</publisher>
          <idno type="DOI">10.1093/pnasnexus/pgae177</idno>
          
          <idno type="record">pratelli2024-entropy-twitter-echo-chambers</idno>
          <note type="staged-file">pratelli2024-entropy-twitter-echo-chambers.txt, the project's staged copy</note>
          <note type="text-sha1">c024945cf48ce454c2b3cd091f4505c172f60677</note>
          <note type="rights">cc-by</note>
        </bibl>
      </sourceDesc>
    </fileDesc>
    <profileDesc>
      <textClass><keywords><term>network-science</term></keywords></textClass>
      <particDesc>
        <person xml:id="paper"><p>the paper's own words</p></person>
        <person xml:id="tagger"><p>the tag layer; a sentence written by the tagger about the
          paper, always anchored to a quotation but not itself a quotation</p></person>
      </particDesc>
    </profileDesc>
    <revisionDesc>
      <change when="2026-10-06"
              who="build_paper_edition.py">48 spans located by searching the stored text for the quote's exact words, allowing any whitespace between them</change>
    </revisionDesc>
  </teiHeader>
  <standOff>
    <spanGrp type="tags">
      <span xml:id="t0" from="#a5" to="#a6" type="object_of_study" ana="#object_of_study" resp="#paper">echo chambers in the Italian Twitter debate on Covid-19 vaccination</span>
      <span xml:id="t1" from="#a9" to="#a10" type="research_question" ana="#research_question" resp="#paper">how to detect echo chambers without a generally accepted method, and what their characteristics and link to disinformation are</span>
      <span xml:id="t2" from="#a3" to="#a4" type="contribution" ana="#contribution" resp="#paper">an unbiased entropy-based method that detects echo chambers as the overlap of discursive and news-engagement communities</span>
      <span xml:id="t3" from="#a3" to="#a4" type="claim_type" ana="#claim_type" resp="#paper">method</span>
      <span xml:id="t4" from="#a7" to="#a8" type="phenomenon" ana="#phenomenon" resp="#paper">small but retweet-heavy echo chambers that concentrate untrustworthy news</span>
      <span xml:id="t5" from="#a45" to="#a46" type="method" ana="#method" resp="#paper">computational-model<term>computational-model</term></span>
      <span xml:id="t6" from="#a35" to="#a36" type="mechanisms" ana="#mechanisms[0]" resp="#tagger" cert="0.7">Dense mutual retweeting inside echo chambers contributes to reinforcing their members&#x27; opinions.<note>status: we can conclude</note><term>mutual retweeting reinforces opinion</term></span>
      <span xml:id="t7" from="#a49" to="#a50" type="limitations" ana="#limitations[0]" resp="#tagger" cert="0.85">Validating multiple P-values is strict and keeps only extreme events.</span>
      <span xml:id="t8" from="#a51" to="#a52" type="limitations" ana="#limitations[1]" resp="#tagger" cert="0.85">Only the retweet network is used, not friendship information.</span>
      <span xml:id="t9" from="#a47" to="#a48" type="limitations" ana="#limitations[2]" resp="#tagger" cert="0.8">Detecting discursive communities relies on verified users, which not all platforms certify.</span>
      <span xml:id="t10" from="#a1" to="#a2" type="concepts" ana="#concepts[0]" resp="#paper" cert="0.9">echo chambers<term>echo chambers</term></span>
      <span xml:id="t11" from="#a15" to="#a16" type="concepts" ana="#concepts[1]" resp="#paper" cert="0.9">discursive community<term>discursive community</term></span>
      <span xml:id="t12" from="#a13" to="#a14" type="concepts" ana="#concepts[2]" resp="#paper" cert="0.95">DiCo<term>DiCo</term></span>
      <span xml:id="t13" from="#a17" to="#a18" type="concepts" ana="#concepts[3]" resp="#paper" cert="0.9">verified users<term>verified users</term></span>
      <span xml:id="t14" from="#a19" to="#a20" type="concepts" ana="#concepts[4]" resp="#paper" cert="0.85">news engagement communities<term>news engagement communities</term></span>
      <span xml:id="t15" from="#a13" to="#a14" type="concepts" ana="#concepts[5]" resp="#paper" cert="0.95">NEC<term>NEC</term></span>
      <span xml:id="t16" from="#a11" to="#a12" type="concepts" ana="#concepts[6]" resp="#paper" cert="0.85">entropy-based null models<term>entropy-based null models</term></span>
      <span xml:id="t17" from="#a55" to="#a56" type="concepts" ana="#concepts[7]" resp="#paper" cert="0.85">Bipartite Configuration Model<term>Bipartite Configuration Model</term></span>
      <span xml:id="t18" from="#a55" to="#a56" type="concepts" ana="#concepts[8]" resp="#paper" cert="0.95">BiCM<term>BiCM</term></span>
      <span xml:id="t19" from="#a57" to="#a58" type="concepts" ana="#concepts[9]" resp="#paper" cert="0.9">bipartite network<term>bipartite network</term></span>
      <span xml:id="t20" from="#a53" to="#a54" type="concepts" ana="#concepts[10]" resp="#paper" cert="0.9">degree sequence<term>degree sequence</term></span>
      <span xml:id="t21" from="#a29" to="#a30" type="concepts" ana="#concepts[11]" resp="#paper" cert="0.9">undirected clustering coefficient<term>undirected clustering coefficient</term></span>
      <span xml:id="t22" from="#a31" to="#a32" type="concepts" ana="#concepts[12]" resp="#paper" cert="0.75">Largest Weakly Connected Component<term>Largest Weakly Connected Component</term></span>
      <span xml:id="t23" from="#a31" to="#a32" type="concepts" ana="#concepts[13]" resp="#paper" cert="0.95">LWCC<term>LWCC</term></span>
      <span xml:id="t24" from="#a63" to="#a64" type="concepts" ana="#concepts[14]" resp="#paper" cert="0.85">information diets<term>information diets</term></span>
      <span xml:id="t25" from="#a59" to="#a60" type="concepts" ana="#concepts[15]" resp="#paper" cert="0.75">Louvain algorithm<term>Louvain algorithm</term></span>
      <span xml:id="t26" from="#a61" to="#a62" type="concepts" ana="#concepts[16]" resp="#paper" cert="0.7">label propagation<term>label propagation</term></span>
      <span xml:id="t27" from="#a21" to="#a22" type="senses" ana="#senses[0]" resp="#tagger" cert="0.85">echo chamber as a three-way overlap - same news-engagement community, same discursive community, and connected by retweets</span>
      <span xml:id="t28" from="#a51" to="#a52" type="senses" ana="#senses[1]" resp="#tagger" cert="0.75">retweet as endorsement - the interaction counted between users is the retweet, not the friendship tie</span>
      <span xml:id="t29" from="#a13" to="#a14" type="concept_edges" ana="#concept_edges[0]" resp="#tagger" cert="0.9">NEC —same-as→ news engagement communities<note>the relation itself is separately evidenced · strength of the relation: 0.9 · the relation stated: ( NEC )</note><term>NEC</term><term>news engagement communities</term></span>
      <span xml:id="t30" from="#a55" to="#a56" type="concept_edges" ana="#concept_edges[1]" resp="#tagger" cert="0.95">BiCM —same-as→ Bipartite Configuration Model<note>the relation itself is separately evidenced · strength of the relation: 0.95 · the relation stated: ( BiCM</note><term>BiCM</term><term>Bipartite Configuration Model</term></span>
      <span xml:id="t31" from="#a31" to="#a32" type="concept_edges" ana="#concept_edges[2]" resp="#tagger" cert="0.95">LWCC —same-as→ Largest Weakly Connected Component<note>the relation itself is separately evidenced · strength of the relation: 0.95 · the relation stated: (LWCC)</note><term>LWCC</term><term>Largest Weakly Connected Component</term></span>
      <span xml:id="t32" from="#a5" to="#a6" type="content_tags" ana="#content_tags.findings[0]" resp="#tagger" cert="0.9">Only about 0.35 per cent of users are in echo chambers.</span>
      <span xml:id="t33" from="#a7" to="#a8" type="content_tags" ana="#content_tags.findings[1]" resp="#tagger" cert="0.9">Users in echo chambers account for nearly a third of the retweets.</span>
      <span xml:id="t34" from="#a25" to="#a26" type="content_tags" ana="#content_tags.findings[2]" resp="#tagger" cert="0.9">All but one of the 566 user-NEC users belong to the Fdi-l-media discursive community.</span>
      <span xml:id="t35" from="#a27" to="#a28" type="content_tags" ana="#content_tags.findings[3]" resp="#tagger" cert="0.9">473 users are trapped in echo chambers.</span>
      <span xml:id="t36" from="#a33" to="#a34" type="content_tags" ana="#content_tags.findings[4]" resp="#tagger" cert="0.9">Clustering in echo chambers is over three times that of other users (0.56 against 0.16).</span>
      <span xml:id="t37" from="#a37" to="#a38" type="content_tags" ana="#content_tags.findings[5]" resp="#tagger" cert="0.8">Two years on, echo-chamber users still adhere to conspiracy theories and have become more extreme.</span>
      <span xml:id="t38" from="#a41" to="#a42" type="content_tags" ana="#content_tags.findings[6]" resp="#tagger" cert="0.9">In echo chambers untrustworthy sources are about twice as frequent as trustworthy ones, reversing the dataset ratio.</span>
      <span xml:id="t39" from="#a65" to="#a66" type="content_tags" ana="#content_tags.findings[7]" resp="#tagger" cert="0.85">Most users&#x27; URL endorsement is compatible with random noise.</span>
      <span xml:id="t40" from="#a1" to="#a2" type="content_tags" ana="#content_tags.definitions[0]" resp="#tagger" cert="0.9">clusters of users exposed to news and opinions in line with their previous beliefs<term>echo chambers</term></span>
      <span xml:id="t41" from="#a15" to="#a16" type="content_tags" ana="#content_tags.definitions[1]" resp="#tagger" cert="0.9">a group of accounts contributing to the formation of a common discourse<term>discursive community</term></span>
      <span xml:id="t42" from="#a57" to="#a58" type="content_tags" ana="#content_tags.definitions[2]" resp="#tagger" cert="0.9">nodes in two layers with links only between layers<term>bipartite network</term></span>
      <span xml:id="t43" from="#a53" to="#a54" type="content_tags" ana="#content_tags.definitions[3]" resp="#tagger" cert="0.9">the number of connections per node<term>degree sequence</term></span>
      <span xml:id="t44" from="#a43" to="#a44" type="content_tags" ana="#content_tags.quantities[0]" resp="#tagger" cert="0.9">probability that a link shared in an echo chamber points to an untrustworthy source (0.129 outside)</span>
      <span xml:id="t45" from="#a23" to="#a24" type="content_tags" ana="#content_tags.quantities[1]" resp="#tagger" cert="0.9">users in user NECs, under 2 per cent of URL-posting users</span>
      <span xml:id="t46" from="#a39" to="#a40" type="content_tags" ana="#content_tags.quantities[2]" resp="#tagger" cert="0.85">retweets generated by echo chambers (569k by other users)</span>
      <span xml:id="t47" from="#a33" to="#a34" type="content_tags" ana="#content_tags.variables[0]" resp="#tagger" cert="0.85">how densely echo-chamber users interact<term>clustering coefficient</term></span>
    </spanGrp>
  </standOff>
  <text>
    <body>
        <p><anchor xml:id="a0"/> Entropy-based detection of Twitter echo chambers</p>
        <p>Abstract</p>
        <p><anchor xml:id="a1"/>Echo chambers, i.e. clusters of users exposed to news and opinions in line with their previous beliefs, were observed in many online debates on social platforms.<anchor xml:id="a2"/> <anchor xml:id="a3"/>We propose a completely unbiased entropy-based method for detecting echo chambers.<anchor xml:id="a4"/> The method is completely agnostic to the nature of the data. <anchor xml:id="a5"/>In the Italian Twitter debate about the Covid-19 vaccination, we find a limited presence of users in echo chambers (about 0.35% of all users).<anchor xml:id="a6"/> <anchor xml:id="a7"/>Nevertheless, their impact on the formation of a common discourse is strong, as users in echo chambers are responsible for nearly a third of the retweets in the original dataset.<anchor xml:id="a8"/> Moreover, in the case study observed, echo chambers appear to be a receptacle for disinformative content.</p>
        <p>Keywords: echo chambers, misinformation, Twitter, complex networks, information theory</p>
        <p><anchor xml:id="a9"/>While the concept of echo chambers is clear, a generally accepted method for their detection is still lacking in the literature.<anchor xml:id="a10"/> Our study provides a general and unbiased method for detecting echo chambers, using entropy-based null models as statistical benchmarks. The rationale is to detect groups of users with similar opinions based on the significant similarity of the main content creators and, similarly, to detect groups of users engaged with the same news. A nontrivial overlap between the two groups indicates the presence of an echo chamber. Using the Italian Twitter debate on the Covid-19 vaccination as a case study, we found that users in echo chambers, while representing a small minority, strongly contribute to the debate, often disseminating misinformation.</p>
        <p>Introduction</p>
        <p>In the virtual world, the tendency to seek out information that confirms existing beliefs and to interact with users who share similar opinions leads to the formation of echo chambers, i.e. “bounded, enclosed media spaces that have the potential to both amplify the messages delivered within it and insulate them from rebuttal” ( 1–4 ). We thus have two key events in echo chamber formation: (i) interaction between users with similar opinions; (ii) exposure of users to the same news articles.</p>
        <p>Contributions</p>
        <p>This article studies the actual presence of echo chambers in social networks by detecting the overlap of the two events. The detection is done by adopting an entropy-based technique. The platform considered in this study is Twitter/X. From now on, we will refer to the platform by its former name, Twitter, since the analyses were conducted before the change in the company name to X.</p>
        <p><anchor xml:id="a11"/>Recently, entropy-based null models have been introduced in studies of complex networks as an unbiased benchmark capable of revealing nontrivial structures of real systems ( 5 ), and thus they represent the appropriate framework for our analysis.<anchor xml:id="a12"/> Figure 1 shows how we intend to assess the occurrence of the two events, and, consequently, the occurrence of the echo chamber.</p>
        <p>Pipeline for Echo-chamber detection. <anchor xml:id="a13"/>The upper path focuses on the detection of Discursive Communities ( DiCo ), while the lower one on the detection of News Engagement Communities ( NEC ).<anchor xml:id="a14"/> Both procedures pass through the statistical validation of empirical data with an entropy-based null model.</p>
        <p>Assessing the opinions of the various accounts is not an easy task, but it can be inferred from the interaction among the various accounts. <anchor xml:id="a15"/>In Refs. ( 6–9 ), a method to infer the presence of a discursive community, i.e. a group of accounts contributing to the formation of a common discourse, was presented.<anchor xml:id="a16"/> <anchor xml:id="a17"/>It is based on verified users, i.e. those accounts for which Twitter has a procedure to check the identity of their owners.<anchor xml:id="a18"/> Verified accounts mainly belong to politicians, journalists, and celebrities; usually, they are strong creators of contents ( 6 , 7 , 9 ). Verified users are among the greatest contributors to the formation of a common discourse. It is possible, then, to let similarities emerge among the content created by verified users, based on the behavior of their common audience in terms of retweets, since retweets are considered a measure of engagement ( 10–12 ). In detail, for each pair of verified users, the number of common retweeters is counted. If the number is statistically significant with respect to an entropy-based benchmark, it is validated and we project a link between the verified users’ pair. On the monopartite network of verified users thus obtained, we run a community detection algorithm to extract groups of similar verified users (i.e. the Verified users’ DiCo s in Fig. 1 ). Then, the various communities of verified users are labeled in terms of the users who belong to them (since the users are verified, it is possible, for example, to derive their political leanings and test a posteriori the resulting communities). At this point, the labels are extended to unverified users using a label propagation algorithm ( 13 ) on the entire retweet network—thus encompassing both verified and unverified users.</p>
        <p>Once again, the use of the retweet network for label propagation is motivated by the fact that there is evidence that users belonging to communities in a retweet network share similar views ( 10–12 ). In the following, such communities will be called discursive communities (or DiCo), and their detection is sketched in the top path of Fig. 1 . Discursive communities embrace those users who contribute to the formation of a common discourse .</p>
        <p>Regarding the exposure to the same news articles, we approach its assessment by analyzing the ties between the users and the URLs present in their tweets and retweets. The bottom path of Fig. 1 shows the approach. The idea of leveraging the bipartite network of users and URLs was already considered in Ref. ( 14 ) for Facebook: in the present case, we translate the idea therein to Twitter. Again, the procedure goes through a comparison between observations and an entropy-based benchmark: if two users tweeted (or retweeted) the same URLs significantly more than the benchmark, we conclude that the two users share the same information diet in a statistically significant way. We can thus identify groups of users sharing the same URLs. <anchor xml:id="a19"/>In the following, user communities that passed the validation are called news engagement communities of users, for short user NEC s.<anchor xml:id="a20"/> User NECs contextualize the second event: exposure of users to the same news articles.</p>
        <p>Now, we were able to identify groups of users exposed to the same news articles (user NEC ) and groups of users who share a common discourse (DiCo). Users who share a group of the first type and a group of the second type form an echo chamber, provided they interact with each other. The interaction for us is that of retweets since retweets are considered as a form of endorsement to the content created by others ( 6 , 10–12 ). Verifying user interactions is an important step because accounts belonging to the same user NEC may either not belong to the same DiCo or, even in the case where they are in the same discursive community, may not interact with each other. <anchor xml:id="a21"/>In this sense, only users who (i) belong to the same user NEC and (ii) belong to the same DiCo and (iii) are connected, even indirectly, through retweets (i.e. they form a weakly connected component in the retweet network) can be said to represent an echo chamber.<anchor xml:id="a22"/></p>
        <p>As a case study for evaluating the presence of echo chambers, we consider the online debate on Twitter regarding the Covid-19 vaccination campaign. Surprisingly, compared to numerous examples found in the literature, we find a limited presence of echo chambers in the analyzed dataset, mainly due to the small dimensions of users’ NECs. Although the detected echo chambers are composed of a small number of users with respect to the total number of active users, they play a significant role in terms of retweet interactions, i.e. the echo chambers that emerged in the case study of the Covid-19 vaccination debate have a significant impact on the creation of a common and cohesive discourse that is not devoid of disinformation. Furthermore, users who belong to such echo chambers show the same ideas and opinions after years.</p>
        <p>Summarizing, the main contribution of this article is a novel unbiased method for echo chamber detection. The procedure is based on the very definition of echo chambers and involves the application of an entropy-based null model to discard signals assimilated to noise.</p>
        <p>Research questions</p>
        <p>Keeping in mind that our ultimate goal is to observe if and when discursive communities and NECs of users overlap, thus forming echo chambers, we organize the structure of the article to answer the following research questions (RQs):</p>
        <p>RQ.1: What are the characteristics of the discursive communities (DiCos) and of the news engagement communities of users (users’ NECs)? Are there users in common?;</p>
        <p>RQ.2: What is the relation between the emergent echo chambers and the presence of disinformation, if any?</p>
        <p>Results</p>
        <p>Dataset</p>
        <p>Our dataset consists of ∼1.87 M public posts in Italian and 136 k users; nearly ∼220 k tweets contain URLs. We relied on the Twitter’s streaming API and data were collected from 2021 September 1st to September 24th. The data collection was keyword-based and related to the COVID-19 vaccination online debate. The keywords are compatible with chronicles regarding the vaccination debate in Italy at time of data collection. We remind the reader that the Twitter’s streaming API returns any tweet containing those terms in the text of the tweet, as well as in its metadata. It is worth noting that it is not always necessary to have each permutation of a specific keyword in the tracking list. For example, the keyword “COVID” would return tweets that contain also both “COVID19” and “COVID-19”. The keywords for the data collection are in Section S1 .</p>
        <p>Data were downloaded using the Twitter API access for researchers (available at the time of the download) and were analyzed following X/Twitter’s policy (available at the following url: https://twitter.com/en/privacy ).</p>
        <p>Discursive communities</p>
        <p>Figure 2 (A) describes the characteristics of the main discursive communities (DiCos) that emerge from the data. We recall that it is possible to assign labels to verified accounts, as the identity of their owner has been certified by the platform. Starting from the original dataset, we run the community detection algorithm ( 15 ) on the validated network of verified users and the label propagation algorithm ( 13 ) on the network of retweets of the different communities. In our case study, two main discursive communities emerge, associated with political parties and Italian newspapers. Specifically, most of the users who are part of a DiCo belong either to the Itav-pd-media community ( ∼ 34.7 % ; the community includes journalists and exponents of the Italian parties Italia Viva and Democratic Party) or to the Fdi-l-media community ( ∼ 26.6 % ; the community includes journalists and exponents of the Italian parties Fratelli D’Italia and Lega). About 2.1 % of users belong to smaller DiCos, while ∼ 36.7 % of users do not belong to any DiCo. The Fdi-l-media community posted the most new content ( 64.3 % ), although it represents about a quarter of all users in our dataset. The Itav-pd-media community is responsible for 19.7 % of the new content, while the remaining 15.5 % is posted by users who do not belong to any particular community. In terms of retweets, Fdi-l-media is by far the most active community with 77.6 % of the retweets.</p>
        <p>Characterization of the main DiCos in terms of the number of users, tweets, and retweets. The charts in A) consider all tweets and retweets, the charts in B) only consider tweets and retweets that contain URLs.</p>
        <p>Figure 2 (B) characterizes DiCos by focusing only on posts containing URLs. In general, the observations made for the doughnut charts in panel (A) still hold, with the exception that almost half of the users who post tweets with URLs belong to the Fdi-l-media community ( 48.7 % ).</p>
        <p>NECs of users</p>
        <p><anchor xml:id="a23"/>Table 1 shows that of all users who have published at least one post with a URL ( ∼ 33 k ), only 566 are part of a user NEC, which is less than 2 % .<anchor xml:id="a24"/> Accounts in user NECs are proportionally much more active in publishing URLs than users not validated by our procedure (67.7 vs 5.90 URLs per account).</p>
        <p>Users in user NEC.</p>
        <p>Figure 3 (A) shows how the 566 users cluster into different user NECs, while Figure 3 (B) provides a statistical view of the 566 users associated with the user NEC. On the right, the top doughnut chart illustrates the largest communities based on the number of users. Each of these prominent user NECs (IDs 0, 1, 2, 3, 4, 5, and 6) accounts for at least 95 % of the total user population within this type of community. Furthermore, the lower doughnut chart shows that these communities have the highest frequency of tweets containing URLs. Communities 1, 2, 3, 4, and 5 collectively account for over 78 % of the total URL traffic generated by all user NEC communities. An analogous analysis of the URL NECs, i.e. the community detected on the validated projection on the layer of the URLs can be found in Section S2 .</p>
        <p>User NECs. A) Network representation of user NECs. B) Top: percentage (and number) of user NEC users belonging to each group. B) Percentage (and number) of URLs disseminated by users belonging to the various user NECs.</p>
        <p>Echo chambers</p>
        <p><anchor xml:id="a25"/>Our analysis shows that all but 1 of the 566 users in the user NECs are also part of the same discursive community, i.e. Fdi-l-media .<anchor xml:id="a26"/> This is the discursive community with users affiliated with political parties Fratelli D’Italia and Lega, and news outlets showing similar leanings. However, the fact that all users in the user NECs belong to the same DiCo only tells us that users with similar “information diets” contribute to the formation of the same discourse, but not that they influence each other and reinforce the opinions of their siblings. In other words, users who refer to the same news sources may never meet on the platform. In fact, the information about who interacts with whom is not used to detect user NECs.</p>
        <p>As mentioned in the Introduction section, users in an echo chamber are users who share a common discourse, are exposed to the same news sources, and are exposed to the same opinions. Being exposed to the same opinions, translated to Twitter, means that they retweet each other. In this sense, if users in the same user NEC form a (weakly) connected component in the same DiCo-induced subgraph of the retweet network (i.e. if there is a flow of influence in the retweet network that is restricted to nodes in the same discursive community), they form an echo chamber.</p>
        <p><anchor xml:id="a27"/>The analysis of the weakly connected component shows that 92 users do not belong to it. This leaves 473 users trapped in echo chambers.<anchor xml:id="a28"/> In particular, all users in user NECs 8, 9, and 10 did not retweet others in the same user NEC on the topic under analysis. Regarding the other user NECs, we observe that for each of them, most of the nodes form echo chambers. In the following, echo chambers inherit the ID of their user NEC. Some echo chambers are relatively large: for example, those induced by user NECs 1 and 2 contain more than 100 nodes.</p>
        <p><anchor xml:id="a29"/>To study how much users in echo chambers are connected, we use the undirected clustering coefficient: ignoring the direction of the edges, it captures the observed frequency of interactions between the neighbors of each node ( 16 ).<anchor xml:id="a30"/></p>
        <p><anchor xml:id="a31"/>We compare the clustering coefficients of the echo chambers with the one measured on the Largest Weakly Connected Component (LWCC) of the retweet network restricted to users in the Fdi-l-media DiCo.<anchor xml:id="a32"/> In this way, we have a benchmark that captures the main contribution to the discourse to which the echo chambers belong. <anchor xml:id="a33"/>The clustering coefficient associated with users in echo chambers is more than three times as high as that for other users within the LWCC [ 0.56 compared to 0.16 , Fig. 4 (A)].<anchor xml:id="a34"/> We then examine the average clustering coefficient within each echo chamber. Figure 4 shows that the average clustering coefficients of echo chambers 2, 4, and 11 are greater than 0.6.</p>
        <p>A) Average clustering coefficient measured on the LWCC of the retweet network restricted to users of Fdi-l-media and measured on all users belonging to echo chambers. B) Average clustering coefficient calculated on each echo chamber. Each echo chamber inherits the ID and the color from its user NEC. The number of users in the echo chamber is shown at the top of each bar.</p>
        <p><anchor xml:id="a35"/>High values of the clustering coefficient imply that accounts are highly connected and frequently retweet each other. Therefore, we can conclude that their endorsement activity contributes to the reinforcement of their opinions.<anchor xml:id="a36"/> Such a conclusion is confirmed by a manual examination of the content shared by users in echo chambers after almost 2 years. At the time of the data collection, the opinions of the users were strongly against the Covid-19 vaccination. <anchor xml:id="a37"/>After 2 years, the positions of the users there still adhere to conspiracy theories and have become particularly extreme.<anchor xml:id="a38"/></p>
        <p>To provide a concrete example, we focus on the content shared in echo chamber 4. In practice, we first manually extract the main narratives from the news shared within echo chamber 4, focusing on the users with the highest number of followers at the time of data collection. Then, still focusing on the users with the highest number of followers, we analyze whether there are signals of these narratives in their most recent posts (as of 2023 June 7) and which narratives they currently support. In echo chamber 4, there are about 1.7k unique news that have been shared about 7.3k times in total. First, we exclude the news with connection errors at the time of this analysis (1k shares) and those that have been shared less than 10 times. Then, we analyze the resulting news narratives, which amount to ∼ 3.3 k shares and 146 unique URLs from 51 different domains. By classifying only these 146 news stories, we cover about ∼ 45 % of the total URL traffic within echo chamber 4. Table 2 shows the narratives’ distribution and their descriptions: the main eight narratives are all against vaccination and government regulations.</p>
        <p>Narratives’ descriptions in echo chamber 4.</p>
        <p>Table 3 shows the narratives supported by the users in echo chamber 4 with the most followers, almost 2 years after data collection (2023 June 7). Users hold extreme views on current controversial issues such as the war in Ukraine, migrants, and LGBT issues. Remarkably, conspiracy theories about vaccines are still present in their narratives.</p>
        <p>Main narratives supported in recent posts (as of 2023 June 7) by users in echo chamber 4 with the most followers.</p>
        <p>Echo chambers, their role in the common discourse and the plague of misinformation</p>
        <p>Figure 5 shows the flow of retweets within an echo chamber and between different echo chambers.</p>
        <p>Retweet network for Fdi-l-media DiCo, aggregated with respect to echo chambers. Node − 1 represents users who do not belong to an echo chamber. Edges indicate the number of retweets between different user groups; weights less than 1 k have been filtered out.</p>
        <p>Node − 1 represents all nodes in the DiCo that are not part of an echo chamber, and an arrow indicates that tweets published by the source group are retweeted by a certain number of users in the target group. Self-loops represent retweet activity within the same group. The values on the edges indicate the number of retweets associated with each interaction. Although the echo chambers are composed of a small number of users (on the order of 10 2 , compared to the total number of DiCo users, on the order of 10 4 ), they contribute significantly to the DiCo’s retweet activity. <anchor xml:id="a39"/>Echo chambers are involved in generating about 288k retweets, while users not in echo chambers generate about 569k retweets.<anchor xml:id="a40"/> More specifically, echo chambers 2 and 3 are mainly composed of popular users (in terms of received retweets), while others are mainly composed of retweeting users (0, 1, 4).</p>
        <p>To quantify the presence of misinformation in echo chambers, we have tagged URLs in our dataset that point to news sites. The labels are those that the NewsGuard journalistic organization has assigned to online media outlets. a The use of the labels has been licensed to the authors of this article. More details about the reputability measure implemented in the present manuscript can be found in Section S3 .</p>
        <p>Figure 6 shows the number of URLs pointing to news from publishers that NewsGuard classifies as “Trustworthy” (T), “Not Trustworthy” (N), and “Unclassified” (UNC) for the entire dataset and for each type of user community. If the same URL is shared multiple times by users in the same group, this multiplicity is taken into account in the analysis.</p>
        <p>Number of distinct URLs pointing to news publishers tagged as “Trustworthy” (T), “Not trustworthy” (N), or “Unclassified” (UNC) for the entire dataset and for each type of users’ community (DiCos, user NECs, echo chambers.)</p>
        <p>The first observation is that the differences between user NECs and echo chambers are negligible. Second, DiCos cover almost the entire volume of both T and N traffic. <anchor xml:id="a41"/>Remarkably, while the ratio between untrusted and trusted URLs is around 0.5 for the entire dataset, the ratio is almost reversed for echo chambers: the frequency of N news sources is almost twice that of T news sources.<anchor xml:id="a42"/></p>
        <p>Section S4 will show even more alarming results regarding the spread of disinformation in echo chambers. We do not show these results in the main text due to space limitations, but <anchor xml:id="a43"/>i) the probability that a link shared by a user in an echo chamber refers to an untrustworthy news source is 0.377, compared to 0.129 for users outside echo chambers;<anchor xml:id="a44"/> ii) the probability that a link shared by a user in an echo chamber refers to a trustworthy news source is 0.232, compared to 0.379 for users outside echo chambers.</p>
        <p>Conclusion</p>
        <p>In this article, we propose a novel unbiased method to detect echo chambers. The method is mainly based on two observations. First, echo chambers form when users interact with others who share similar opinions and refer to the same news. Second, a proper null model should be implemented to detect a true signal. This necessity has recently been highlighted in the literature on online social networks and has been shown to be particularly important for the detection of nontrivial phenomena ( 6–8 , 17–19 ). <anchor xml:id="a45"/>Our echo chamber detection method is based on the validation of observed structures by comparison with a proper maximum entropy null model; the maximization of entropy guarantees the unbiased nature of the benchmark.<anchor xml:id="a46"/></p>
        <p>We tested our procedure on a dataset containing the Italian Twitter debate on Covid-19 vaccination: we found that our procedure detects a low presence of echo chambers (just under 0.35% of all users in our dataset belong to an echo chamber). All the echo chambers we detected are part of the same discursive community, i.e. a community of users with similar political positions. Even if their dimension in terms of the number of users is limited, their impact on the shared discourse is remarkable: echo chambers are responsible for almost a third of the retweets in their discursive communities.</p>
        <p>The methodology can be extended to other online social networks. In fact, it is based on (i) the analysis of the activity of accounts that share URLs to news sources and (ii) the detection of discursive communities. <anchor xml:id="a47"/>While the extension of the former to other online social networks is straightforward, the latter may be more problematic: in the present case, we used the activity of verified users, who are among the main content creators in Twitter ( 6 ), but not all social platforms have such certification.<anchor xml:id="a48"/> Nevertheless, when analyzing other platforms, we can still focus on users who are particularly active in creating new content, such as influential users as defined in ( 20 ).</p>
        <p>Not unlike other studies, our study has some limitations, which we believe do not affect our final conclusions. <anchor xml:id="a49"/>First, it may be argued that the validation procedure is quite strict: the validation of multiple P -values leads to the validation of extreme events.<anchor xml:id="a50"/> While this is true, it is the only way to eliminate random noise from the system and analyze the true signal (see Sections S5 and S6 for more details). <anchor xml:id="a51"/>Finally, the main idea of echo chambers is that users follow accounts with similar ideas, while in the present study only the retweet network is used, not the information about friendships.<anchor xml:id="a52"/> Still, the retweet network captures the effective interactions with interesting content as perceived by different users, whether it comes from friends or is suggested by the platform itself: focusing only on friendship will not fully capture the effect of the platform’s recommendation algorithm.</p>
        <p>Methods</p>
        <p>Network analysis methods</p>
        <p>Recently, De Clerck et al. stressed the importance of using proper statistical benchmarks for the analyses of Online Social Networks ( 18 , 19 ): in fact, such systems are affected by strong noise and detecting genuine signals is fundamental in order to drive the proper conclusions. In fact, our procedure for the detection of echo chambers is based on the statistical validation of different co-occurrence networks. Co-occurrences are implicitly based on a bipartite structure: if we count, for instance, the number of URLs that have been shared by both a pair of users, we are implicitly projecting the information contained in a bipartite network in which layers represent users and URLs on the layer of users. Therefore, including the bipartite information in the analysis of the observed co-occurrences provides a more accurate benchmark.</p>
        <p>A general framework for providing unbiased benchmarks for the analysis of complex networks was recently proposed in the literature ( 5 ), inspired by the derivation of Statistical Physics from Information Theory by Jaynes ( 21 ). The main idea is to first create an ensemble of all graphs having the same number of nodes as in real systems. We can then define the Shannon entropy associated with the ensemble: in order to have a maximally random benchmark, we maximize the Shannon entropy, constraining some defining quantities about the system. In this sense, by comparing the real network with our null model, all observations that cannot be explained by the constraints can be captured. <anchor xml:id="a53"/>Constraints can be global, as the total number of links, or local, as the degree sequence, i.e. the number of connections per node.<anchor xml:id="a54"/></p>
        <p><anchor xml:id="a55"/>In the following, we will first introduce the Bipartite Configuration Model ( BiCM , ( 22 )), i.e. the application of the procedure described above to bipartite networks in which the degree sequences are the constraints.<anchor xml:id="a56"/> Then we will describe the validation procedure for co-occurrences, proposed in Ref. ( 23 ). Both the BiCM and the validation procedure used in the present manuscript were performed using the bicm b python module included in NEMtropy; c the methods used to solve BiCM system of equations implemented in NEMtropy and bicm can be found in Ref. ( 24 ).</p>
        <p>Formalism</p>
        <p><anchor xml:id="a57"/>In a bipartite network, nodes are divided into two sets, called layers and links exist only between nodes belonging to different layers.<anchor xml:id="a58"/> Given a bipartite network G Bi , let us call its layers ⊤ and ⊥, respectively, and N ⊤ and N ⊥ their dimensions. Then, a bipartite binary network is completely described by its biadjacency matrix B , i.e. a N ⊤ × N ⊥ rectangular matrix whose generic entry b i α is either 1 or 0 if there exists a link connecting node i ∈ ⊤ and α ∈ ⊥ or not. The degree of a generic node i ∈ ⊤ ( α ∈ ⊥ ) is simply k i = ∑ α ∈ ⊥ b i α ( h α = ∑ i ∈ ⊤ b i α ). In the following, quantities related to real networks will be indicated with an asterisk *.</p>
        <p>Bipartite configuration model</p>
        <p>Let us call G Bi the ensemble of graphs of the BiCM in which each representative graph G Bi ∈ G Bi is a N ⊤ * × N ⊥ * bipartite network. d We define the Shannon entropy associated with the system as</p>
        <p>We can perform a constrained maximization of the Shannon entropy using the methods of Lagrangian multipliers, the constraints being the degree sequences of both layers, i.e. k i , ∀ i ∈ ⊤ , and h α , ∀ α ∈ ⊥ . In this way, we will achieve a benchmark that is maximally random, but, in which the average degree sequences are equal to the ones observed in the real system. Therefore, by observing deviations from the null model we will detect all structures of the real system that cannot be simply explained by the constraints. Such a procedure can be achieved through the maximization of the function S ′ defined as</p>
        <p>where S is the Shannon entropy defined in Eq. 1 and β , θ i , and η α are the Lagrangian multipliers associated, respectively, to the normalization of the probability, to the degree sequence on layer ⊤ and to the degree sequence on layer ⊥. The maximization of S ′ returns a probability per graph that can be written in terms of independent probabilities per link ( 25 ):</p>
        <p>Equation 2 is just formal since we do not know the numerical value of Lagrangian multipliers θ i and η α . This can be obtained through the maximization of the likelihood of observing the real system ( 26 , 27 ). It can be shown that maximizing the likelihood is equivalent to set:</p>
        <p>In Section S5 , the interested reader can find a detailed description of how to use the Bipartite Configuration Model as a statistical benchmark to validate the co-occurrences observed in the real network.</p>
        <p>Discursive communities</p>
        <p>As stated above and described in detail in Section S5 , the BiCM described above can be used as a statistical benchmark to highlight groups of users contributing to the formation of the same discourse. On Twitter, this translates to groups of users endorsing similar content. In Ref. ( 6 ) a procedure was proposed, later refined in Refs. ( 8 , 9 , 17 ). The rationale is to consider who are the creators of content and how to capture similarities among them. It has been observed in several studies that verified accounts, i.e. the ones for which the Twitter platform checked the identity of their owners—at least in the pre-Musk era—are strong creators of content ( 6 , 17 ). It is possible, then, to infer how similar they are perceived by the “general” public of unverified users by using a bipartite representation: if verified and unverified users are the two layers of a bipartite network in which the (undirected) links represent retweets, e we can validate the projection on the layer of verified users. In this way, we will detect nontrivial similarities in the common audience of unverified users: otherwise stated, if a couple of verified users are retweeted by the same (nonverified) users, they are probably sharing similar positions. <anchor xml:id="a59"/>In the monopartite validated projection of verified users, communities were detected using an optimized version of Louvain algorithm ( 15 ): since Louvain is known to be node-order dependent ( 28 ), the order of the nodes is shuffled 1,000 and the configuration displaying the greatest value of the modularity is chosen.<anchor xml:id="a60"/> The labels of the communities found through the community detection are then propagated in the retweet network: in fact, it is an old result that Twitter users endorse content created by others much more with retweets than with mentions ( 10–12 ). Since in many cases, some strong creators of content are not verified (and therefore run the risk of not getting a label), we run the label propagation algorithm on the undirected version of the retweet network: the rationale is that not only the sources give an indication of the user orientation but also her audience. Otherwise stated, if the majority of a user audience has a clear orientation, it is presumable that the considered user also has the same one. For propagating labels, we implemented the procedure proposed in Ref. ( 13 ). <anchor xml:id="a61"/>This algorithm assigns the unverified user the label associated with the majority of its neighbors in the retweet network.<anchor xml:id="a62"/> If an unverified user has no verified users as direct neighbors, it will be assigned the label associated with the majority of unverified neighbors that have already been labeled. This continues iteratively until it converges.</p>
        <p>The interested reader can find in Section S6 a comparison between DiCos obtained using validated or nonvalidated projections. In summary, it has been observed that politicians are particularly clustered in the validated network ( 6–9 , 17 , 29–31 ). Therefore, detecting community therein is particularly efficient in finding discursive communities about political subjects. On the contrary, the discursive communities calculated on the nonvalidated projection are much noisier.</p>
        <p>News engagement communities</p>
        <p>URL manipulation</p>
        <p>To detect similarities in users’ endorsement of pieces of news, we first need to pre-process the URLs contained in the various tweets. Sharing a compact version of a URL allows for the sharing of long URLs in tweets while maintaining the maximum character limit. For our analyses, we translated all shortened links into their original long versions. This enabled us to (i) read the top-level domain of the news source to assign a nutrition label using NewsGuard and (ii) use the long links as unique identifiers for each shared news item in our network models.</p>
        <p>NEC communities</p>
        <p><anchor xml:id="a63"/>In order to find users sharing similar “information diets”, i.e. engaging with the same URLs, we used the same approach as in Ref. ( 14 ).<anchor xml:id="a64"/> We first represented users sharing (either via tweets or retweets) URLs as a bipartite network of users and URLs. Then, we projected the information contained therein on the layer of users and finally validated the projection using the procedure described above. <anchor xml:id="a65"/>As mentioned in Section 2.3, the fraction of validated nodes, in this case, is extremely limited, i.e. nearly 1.71 % , signaling that most of the users’ endorsement to URLs (and so pieces of news) is compatible with the random noise.<anchor xml:id="a66"/> Again, in order to find communities of users in the validated projection network, the reshuffled version of Louvain was used.</p>
        <p>Literature review</p>
        <p>The detection of echo chambers has generally been approached in the literature by starting with online content whose nature is known a priori. By analyzing the social accounts that interact with specific content, e.g. through likes, shares, retweets, and comments, it has been shown how information related to specific narratives attracts particular communities. As an example, the work in ( 1 ), by Del Vicario et al., focuses on public Facebook pages divided into two groups: conspiracy theories and science news (conspiracy theories are “the pages that disseminate alternative, controversial information, often without supporting evidence” ( 1 )). The results show that users are divided into homogeneous clusters: by analyzing the accounts that share news about science and conspiracies, they are bound by friendship ties in the network. To quote the authors: “different contents generate different echo chambers, characterized by the high level of homogeneity inside them”.</p>
        <p>Homogeneity is not only about friendship but also about emotional approach and response to debunking attempts. Zollo et al., in ( 32 ), note how users polarized on conspiracies express more negative feelings in their comments than users polarized on science news. Work in ( 4 ) confirms how the echo chamber paradigm goes hand in hand with the phenomenon of confirmation bias—the tendency of users to seek out, favor, and interpret information in line with their thoughts ( 33 , 34 ), while ignoring or downplaying evidence that contradicts their beliefs: interactions with debunking posts (i.e. posts that provide fact-checked information on specific topics) are overwhelmingly from science-biased or nonbiased users.</p>
        <p>Interestingly for the purposes of this article, other studies have instead analyzed the dynamics of information exposure by looking at the news URLs present in the posts. This is the case, for example, of the work by Weaver et al. ( 35 ), which constructs the network of densely connected news articles. It starts from the number of news URLs shared by each user to arrive at the weighted network of news URLs, where the weights between two URLs indicate how many users have re-shared the URLs. Leveraging a state-of-the-art community detection algorithm, communities of co-shared news items are found, distinct in terms of political leaning (i.e. left-leaning and right-leaning). Guarino et al., in ( 14 ), consider public Facebook pages without knowing a priori the kind/quality/reputability of their content. Focusing on the activity of users sharing links to pieces of online news, the authors construct the bipartite network of users/shared URLs and apply the Bipartite Configuration Model (BiCM) to project the bipartite network at the two levels, the user level and the URL level.</p>
        <p>Supplementary Material</p>
        <p>Acknowledgments</p>
        <p>The authors thank Emanuele Brugnoli, Stefano Guarino, Walter Quattrociocchi, and Fabiana Zollo for insightful discussions. The work of F.S. is part of the joint initiative CREF-SONY.</p>
        <p>Notes</p>
        <p>Contributor Information</p>
        <p>Manuel Pratelli, IMT School For Advanced Studies Lucca, Piazza San Francesco 19, Lucca 55100, Italy; Istituto di Informatica e Telematica, CNR, via G. Moruzzi 1, Pisa 56124, Italy.</p>
        <p>Fabio Saracco, “Enrico Fermi” Research Center, Via Panisperna 89A, Rome 00184, Italy; IMT School For Advanced Studies Lucca, Piazza San Francesco 19, Lucca 55100, Italy; Institute for Applied Computing “Mauro Picone”, CNR, Via dei Taurini 19, Rome 00185, Italy.</p>
        <p>Marinella Petrocchi, Istituto di Informatica e Telematica, CNR, via G. Moruzzi 1, Pisa 56124, Italy; IMT School For Advanced Studies Lucca, Piazza San Francesco 19, Lucca 55100, Italy.</p>
        <p>Supplementary Material</p>
        <p>Supplementary material is available at PNAS Nexus online.</p>
        <p>Funding</p>
        <p>Work partially supported by project SERICS (PE00000014) under the NRRP MUR program funded by the EU - NGEU; by the Integrated Activity Project TOFFEe (TOols for Fighting FakEs) https://toffee.imtlucca.it/ ; by the IIT-CNR funded Project re-DESIRE (DissEmination of ScIentific REsults 2.0); by the project “CODE—Coupling Opinion Dynamics with Epidemics”, funded under NRRP Mission 4 “Education and Research” - Component C2 - Investment 1.1 - Next Generation EU “Fund for National Research Program and Projects of Singificant National Interest” PRIN 2022 PNRR, grant code P2022AKRZ9.</p>
        <p>Author Contributions</p>
        <p>All the authors designed the research, wrote, and reviewed the manuscript. M.Pr. performed the research and analyzed data.</p>
        <p>Previous presentation</p>
        <p>Some of the results were presented at NetSci 2023, Wien, on 2023 July 14th.</p>
        <p>Preprints</p>
        <p>An earlier version of this work is available at https://doi.org/10.48550/arXiv.2308.01750 .</p>
        <p>Data Availability</p>
        <p>The X/Twitter dataset is available at https://doi.org/10.6084/m9.figshare.25460962.v1 The dataset is completely anonymized, in agreement with X/Twitter’s policies, https://twitter.com/en/privacy . The association between the trustworthiness labels and the news sources that supports the findings of this study is proprietary Newsguard data.</p>
        <p>References</p>
        <p>Associated Data</p>
        <p>Supplementary Materials</p>
        <p>Data Availability Statement</p>
        <p>The X/Twitter dataset is available at https://doi.org/10.6084/m9.figshare.25460962.v1 The dataset is completely anonymized, in agreement with X/Twitter’s policies, https://twitter.com/en/privacy . The association between the trustworthiness labels and the news sources that supports the findings of this study is proprietary Newsguard data.<anchor xml:id="a67"/></p>
    </body>
  </text>
</TEI>
