Searcharxiv⌕ Search

arXiv · cs/0511005

The egalitarian effect of search engines

Abstract

Search engines have become key media for our scientific, economic, and social activities by enabling people to access information on the Web in spite of its size and complexity. On the down side, search engines bias the traffic of users according to their page-ranking strategies, and some have argued that they create a vicious cycle that amplifies the dominance of established and already popular sites. We show that, contrary to these prior claims and our own intuition, the use of search engines actually has an egalitarian effect. We reconcile theoretical arguments with empirical evidence showing that the combination of retrieval by search engines and search behavior by users mitigates the attraction of popular pages, directing more traffic toward less popular sites, even in comparison to what would be expected from users randomly surfing the Web.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Santo Fortunato, Alessandro Flammini, Filippo Menczer, Alessandro Vespignani. 2006-08-23. The egalitarian effect of search engines. https://doi.org/10.1073/pnas.0605525103. https://searcharxiv.com/abs/cs/0511005

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Asymmetric Discourse Homogenization on Reddit Was a Text-Length Artifact: A Reanalysis

In the first version of this paper I reported that conservative Reddit users began writing more alike after ChatGPT was released while progressive users did not. That result came from a similarity measure that rises and falls with comment length. I redo every analysis of the original paper on all 6,056,593 comments with a sentence encoder and a dispersion measure computed within length strata, and the conservative break goes away. The two camps show no reliable difference in how within-group similarity changed after late 2022, and the ChatGPT date behaves like any of the more than two thousand other cutoffs I test. The matched flair comparison, the cumulative AI index, the stayer panel and the entropy signature each lose their support once length is held fixed. The one change that survives is older. Left and right comments drew closer to each other between 2019 and 2022, and that convergence was complete before ChatGPT arrived. I end with what this implies for studies that measure homogenization with embeddings.

cs.CY↗

Predicting Student Attrition in Competitive Programming: A Large-Scale Study Integrating Survey Insights and Global Behavioral Logs

We compared the recorded behavior of competitive programmers who became inactive on Codeforces with that of active users of similar skill. From 6,927 accounts collected via the public Codeforces API in June 2026, we excluded 888 accounts with incomplete submission histories and restricted both cohorts to a peak rating below 1500. This yielded 3,421 active accounts and 908 accounts with no submissions for at least three months, labeled as attrition. Behavioral differences between the two groups were small. Attrition accounts accepted smaller shares of their attempts overall and on mathematics and data-structure problems (rank-biserial r from -0.16 to -0.12), and solved fewer problems per rated contest (median 5.95 vs. 7.80; r = -0.13). Struggle time, upsolving, and recovery after rating drops did not differ significantly after correcting for multiple testing. Two pre-specified models trained on eight observation-window-independent features achieved cross-validated AUROCs of 0.596 (logistic regression) and 0.611 (random forest), yielding predicted probabilities barely above the base rate. Across random samples, stricter filtering rules, alternative definitions of inactivity, and tenure-matched cohorts, AUROC ranged from 0.58 to 0.66. Restricting features to activity from the 6- or 12-month windows ending three months prior to each user's final submission produced AUROCs of 0.59 to 0.65, indicating that minor behavioral differences precede inactivity but remain too weak to reliably identify individual at-risk users. All data and code are publicly archived, with a single command reproducing every reported result.

cs.CY↗

Can Power Draw Constrain Covert Compute? Limits of Analogue Verification for AI Governance

Frontier AI treaties or agreements on limiting computation require external verification; an external auditor must be able to confirm how much computation actually ran and that parties are adhering to the agreement. Analogue, off-chip measurements such as power draw provide an information channel for verification. It is unknown how well these analogue channels can constrain the amount of computation against an adversary who actively tries to subvert the audit. We derive a closed form for $β$, the largest hidden computation a power trace cannot exclude, as a fraction of the declared machine capacity. Measurements on NVIDIA A100 GPUs give $β= 1.16$ in the worst case, while an adversarial matched-energy schedule hides at least $0.41$. Analogue power measurements alone therefore constrain compute weakly. Additional restrictions granted by the threat model, such as the ability of the verifier to re-execute the declared work at an observed operating point, let the verifier push $β$ down to $0.059$ in the maximally restricted case. This gives a quantitative estimate of what analogue measurements can contribute to compute verification.

cs.CY↗