Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1312.2818

Can electoral popularity be predicted using socially generated big data?

Taha Yasseri·Jonathan Bright
View original source ↗Read source document ↗Export metadata ↓

Abstract

Today, our more-than-ever digital lives leave significant footprints in cyberspace. Large scale collections of these socially generated footprints, often known as big data, could help us to re-investigate different aspects of our social collective behaviour in a quantitative framework. In this contribution we discuss one such possibility: the monitoring and predicting of popularity dynamics of candidates and parties through the analysis of socially generated data on the web during electoral campaigns. Such data offer considerable possibility for improving our awareness of popularity dynamics. However they also suffer from significant drawbacks in terms of representativeness and generalisability. In this paper we discuss potential ways around such problems, suggesting the nature of different political systems and contexts might lend differing levels of predictive power to certain types of data source. We offer an initial exploratory test of these ideas, focussing on two data streams, Wikipedia page views and Google search queries. On the basis of this data, we present popularity dynamics from real case examples of recent elections in three different countries.

Explore related subjects

physics.soc-phcs.CYcs.SIphysics.data-an

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taha Yasseri, Jonathan Bright. 2014-08-08. Can electoral popularity be predicted using socially generated big data?. https://doi.org/10.1515/itit-2014-1046

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Who Waits the Longest? Unequal Paths to Legal Stability among Migrants and Refugees

Legal systems shape not only the recognition of migrants and refugees but also the pace and stability of their integration. Refugees often shift between multiple legal classifications, a process we refer to as the "legal journey". This journey is frequently prolonged and uncertain. Using a network-based approach, we analyze legal transitions for over 350,000 migrants in Austria (2022-2024). EU nationals such as Germans reach stable residence in under four months; refugees from conflict-affected regions face far longer and more uncertain journeys, ranging from two months for Ukrainians to nine months for Syrians and 20 months for Afghans. Refugee women, especially from Syria and Afghanistan, are more likely to gain protection. Afghan women reach stability in 14 months on average, less than half the 30 months Afghan men wait. We also find that those who cross the border without going through official border controls face higher exit rates and lower chances of securing a stable status. We show that legal integration is not a uniform process, but one structured by institutional design, entry mode, and unequal timelines.

physics.soc-ph↗
arXiv2026

Higher-order interactions reveal synergistic backbones of cycling infrastructure networks

Infrastructure networks essentially underlie human mobility and transport. Improving the quality of single links increases network performance locally. However, efficient transport requires high-quality connected corridors across multi-link paths that do not emerge from independent single-link upgrades. Here, we introduce a framework for evaluating the impact of jointly upgrading multiple links as inherently higher-order interactions, enabling us to quantify link synergies in complex transport networks. Two links are synergistic if an upgrade of one increases the benefit of upgrading the other, promoting upgrades of topologically complementary links along the same path while discouraging upgrades of redundant parallel links. By expressing these synergies as second-order derivatives of overall network performance, we develop an efficient computational framework to identify synergistic links that form a connected network backbone. We apply our theoretical framework by combining empirical street network and cycling demand data for Hamburg, Germany, with a perturbed utility route choice model for urban bicycle traffic. Our results reveal synergies from higher-order interactions, thereby enabling strategic infrastructure planning that goes beyond local link importance in complex transport and flow networks.

physics.soc-ph↗
arXiv2026

Probabilistic neighbors' selection competes with confirmation bias in a bounded confidence model

In this work, we investigate three modified versions of the classic Hegselmann-Krause opinion dynamics model, incorporating features that are typical of many real-world systems, such as uncertainty in the selection of interacting agents and a weighted evaluation of the relevance of their opinions in the influence function to enhance confirmation bias. Through extensive simulations across different network topologies, ranging from stylized network models (Barabási-Albert, Erdős-Rényi, and Watts-Strogatz networks) to empirical networks with community structure, we identify the influence of each modification on opinion evolution and convergence. Our findings reveal that they exert opposite effects on the bounded confidence threshold required for consensus. We further explore an extension based on a data-driven opinion initialization on the empirical networks, where initial opinions are drawn from Gaussian distributions specific to each detected community. While the qualitative effects of the three modified models remain consistent, this new initialization strategy reveals distinct dynamics within the network communities. These insights provide a new and comprehensive perspective on how realistic variations of the Hegselmann-Krause model, in terms of both interaction rules and initial opinion distributions, affect opinion dynamics and shed light on the mechanisms of consensus formation within structured communities.

physics.soc-ph↗