Category Archives: Publication

New NERDS paper on drug traffic and migration

Displacement and disconnection: the impact of violence on migration networks and highway traffic in Mexico, by M. Coscia & R. Gutiérrez-Romero, published in Spatial Economic Analysis.

https://www.michelecoscia.com/wp-content/uploads/2026/05/image-3.png

This paper examines how violence impacts migration flows and the strength of migration networks across Mexico’s 2454 municipalities. Using a novel network algorithm and census data from 2005 to 2020, we detect structural changes in domestic and international migration beyond what net flows reveal. To identify causal effects, homicide rates are instrumented using variation in fuel prices and municipal distance to fuel pipelines, capturing exogenous shocks from large-scale fuel theft. Rising violence led to 1.12 million additional domestic emigrants, 50,200 fewer returnees from the United States, stronger emigration networks and reduced highway traffic linking violent areas to the rest of the country.

 

New NERDS publication on transport network growth

The trade-off between directness and coverage in transport network growth, by C. Sebastiao, A. Vybornova, A.R. Vierø, L.M. Aiello & M. Szell, published in Applied Network Science

We systematically study the growth of connected planar networks, quantifying functionality of the growing network structure. We compare random growth with various greedy and human-designed, manual growth strategies. We evaluate our results via the fundamental performance metrics of directness and coverage, finding non-trivial trade-offs between them. Manual strategies fare better than greedy strategies on both metrics, while random strategies perform worst and are unlikely to be Pareto efficient. Centrality-based greedy strategies tend to perform best for directness but are worse than random strategies for coverage, while coverage-based greedy strategies can achieve maximum global coverage as fast as possible but perform as poorly for directness as random strategies. Directness-based greedy strategies get stuck in local optimum traps. These results hold for a number of stylized urban transport network topologies. Our insights are crucial for applications where the order in which links are added to a spatial network is important, such as in urban or regional transport network design problems.

Two New NERDS Papers: Politician Campaigns; and Money Laundering

We have two new publications out!

  1. Disconnect between the public face and the voting behavior of political representatives by Christian Ivert Andersen and Michele Coscia, published in the journal Applied Network Science.

    One of representative democracy’s tenets is that a political candidate runs on a specific platform, which is information the electorate uses to determine whether to vote for them or not. If this promise is to be maintained, it is fundamental that the public face candidates present corresponds to their actions in parliament once elected. Such a promise has been put in question both by scholars, but also by the electorate. In different countries at different times, the people have expressed various degrees of dissatisfaction with democracy: often the feeling is that representatives put their own interests—or the interest of a powerful minority—before the ones of their constituencies. In this paper, we propose a network-based quantitative investigation of this disconnect between the public face and the voting behavior of elected representatives. By using data from Denmark, we can place politicians in two different spaces, determined by their electoral campaign promises on the one hand, and on the other hand by the votes they cast in parliament. We find that our technique makes it possible both to find clear, expected, and consistent left-right divides between the political parties; as well as a larger-than-expected disconnect between the public face and the voting behavior. Our preliminary results indicate that the aggregate voting behavior in parliament of politicians does not match with how they present themselves to the public on the salient issues discussed during the election campaign.
  2. Evaluating fraud detection algorithms in a decentralized scenario by Ada M Gige, Lasse Buschmann Alsbirk, Michele Coscia, published in the journal Royal Society Open Science.

    Financial fraud is an umbrella term including a vast number of illegal activities. These activities involve a significant fraction of the global economy. Traditional investigation techniques are labour-intensive and cannot scale to match the size of the issue. Machine learning has provided effective tools which deliver high accuracy in identifying transactions that could be involved in fraudulent activities. In this paper, we point out that the state-of-the-art in financial fraud detection has been applied to the unrealistic scenario of an omniscient centralized global authority which has access to all bank transactions globally. We propose a more realistic evaluation scenario, one made of two steps: first, the bank flags its own transactions using exclusively information it possesses; then only flagged transactions from all banks are analysed by the governmental authority for potential prosecution. We find that, in such a realistic scenario, the effectiveness of the state-of-the-art method for financial fraud detection decreases. Moreover, we show that in this decentralized scenario, it pays off to use simpler methods than the state-of-the-art, depending on the specific objective function the system wants to ensure.

New NERDS publication on candidate recommendation

Analyzing the Effects of a Human-in-the-Loop Candidate Recommendation Algorithm at Jobindex, by Mesut Kaya & Toine Bogers, published in ACM Transactions on Recommender Systems

Recruiting is the process of assessing relevant candidates for an open position based on their education, work experience, and knowledge, skills, and abilities. As part of a collaborative project between academia and industry, we developed an automated candidate recommendation system to support recruiters in this time-consuming task of matching CVs to job postings. We chronicle the development and deployment of a candidate recommender system at Jobindex, expanding our focus from a pure machine learning problem to a holistic overview of the development and deployment of such a system in a real-world setting. After extensive offline and online experimentation, we integrated our algorithm into the recruiters’ everyday workflow. Our second contribution is a detailed analysis of how these recruiters have adopted this candidate recommender system, and which factors influence their engagement with the slate of suggested candidates. In this article, we present the results of 17 months of data (corresponding to 41,390 jobs) and show how engaging with these recommendations has impacted the recruiters’ work, and which factors influence their task success. While adoption of the new system was initially hindered by deeply-ingrained habits and a lack of trust in AI, over time the combination of human and automated recruitment shows considerable promise across a variety of job and recruiter characteristics.

Two new NERDS papers: data storytelling visualization, LLMs for complex information needs

We have two new publications out!

  1. The Influence of the Communication Medium on Data Storytelling, by Tamara Nagel and Toine Bogers published in CHIIR ’26: Proceedings of the 2026 ACM Conference on Human Information Interaction and Retrieval 2026

    Despite increasing interest in data storytelling, it remains unclear how the choice of communication medium shapes its effectiveness, particularly for audiences with varying levels of data literacy. This paper reports on a controlled, longitudinal experiment comparing verbal to written storytelling alongside a baseline data visualization condition. Each condition employed simple graphs and an author-driven narrative to examine their effects on recall and attitude change. Results showed mixed results of data storytelling: while storytelling did not improve recall, verbal storytelling and no storytelling facilitated long-term attitude change, whereas written storytelling did not. Higher data literacy supported long-term recall but was associated with smaller immediate attitude shifts, an effect that diminished over time. These findings challenge assumptions about the universal advantages of narrative-based communication, demonstrating that medium, topic familiarity, and audience characteristics jointly determine outcomes. The study contributes empirical evidence to the field and calls for further research into how narrative structures and visualization complexity affect the effectiveness of data storytelling.
  2. Tip-of-the-Tongue Search in the Wild: Analyzing Human and LLM Performance and Success Factors on Complex Search Requests, by Toine Bogers, Maria Gäde, Mark Hall, Marijn Koolen, Vivien Petras, and Mette Skov, published in CHIIR ’26: Proceedings of the 2026 ACM Conference on Human Information Interaction and Retrieval 2026Users often turn to online forums when searching for known books, movies, or games that they cannot identify through conventional search engines. These “tip-of-the tongue” requests present a unique challenge, appearing highly variable in formulation, context, and specificity. So far, these could mostly only be solved by other humans answering in forums. Generative AI is believed to help solve these specific questions. In this work, we manually annotated 150 requests each for books, games, and movies in the casual leisure domain to study the differences between solved and unsolved requests and identify factors that influence their difficulty. We compare human responses in forum threads with the performance of a Large Language Model (LLM) under similar conditions. Specifically, we investigate how the formulation of requests affects human and LLM success; how item properties impact LLM retrieval; how interaction and feedback within a thread shape human and LLM performance; and whether increasing the information provided to an LLM improves its chances of solving the request. Our findings offer new insights into what makes these known-item search problems easier or harder to solve. This study contributes to a better understanding of complex search behavior and the role of LLMs in helping with difficult casual-leisure information needs.

Two new NERDS papers: Algorithmic bias, street network simplification

We have two new publications out!

  1. Detecting bias in algorithms used to disseminate information in social networks and mitigating it using multiobjective optimization, by Vedran Sekara, Ivan Dotu, Manuel Cebrian, Esteban Moro, Manuel Garcia−Herranz published in PNAS Nexus

    Based on extensive computer simulations on synthetic and 10 diverse real-world social networks we show that seeding information in social networks using state-of-the-art influence maximization methods creates information gaps. Our results show that these algorithms select influencers who do not disseminate information equitably, threatening to create an increasingly unequal society. To overcome this issue, we devise a multiobjective algorithm which both maximizes influence and information equity. Our results demonstrate it is possible to reduce vulnerability at a relatively low trade-off with respect to spread. This highlights that in our search for maximizing the spread of information we do not need to compromise on information equality.
  2. Adaptive continuity-preserving simplification of street networks, by Martin Fleischmann, Anastassia Vybornova, James D. Gaboardi, Anna Brázdová, Daniela Dančejová, published in Computers, Environment and Urban Systems

    Street network data is widely used to study human-based activities and urban structure. Often, these data are geared towards transportation applications, which require highly granular, directed graphs that capture the complex relationships of potential traffic patterns. While this level of network detail is critical for certain fine-grained mobility models, it represents a hindrance for studies concerned with the morphology of the street network. For the latter case, street network simplification — the process of converting a highly granular input network into its most simple morphological form — is a necessary, but highly tedious preprocessing step, especially when conducted manually. In this manuscript, we develop and present a novel adaptive algorithm for simplifying street networks that is both fully automated and able to mimic results obtained through a manual simplification routine. The algorithm — available in the neatnet Python package — outperforms current state-of-the-art procedures when comparing those methods to manually, human-simplified data, while preserving network continuity.
    See also the neatnet package: https://github.com/uscuni/neatnet

Three new NERDS publications: Polarization, image-to-text-mapping, and candidate recommendation

We have three new publications out, as always on a variety of topics!

  1. Estimating affective polarization on a social network, by Marilena Hohmann and Michele Coscia, published in PLOS ONE.

    Concerns about polarization and hate speech on social media are widespread. Affective polarization, i.e., hostility among partisans, is crucial in this regard as it links political disagreements to hostile language online. However, only a few methods are available to measure how affectively polarized an online debate is, and the existing approaches do not investigate jointly two defining features of affective polarization: hostility and social distance. To address this methodological gap, we propose a network-based measure of affective polarization that combines both aspects – which allows them to be studied independently. We show that our measure accurately captures the relation between the level of disagreement and the hostility expressed towards others (affective component) and whom individuals choose to interact with or avoid (social distance component). Applying our measure to a large-scale Twitter data set on COVID-19, we find that affective polarization was low in February 2020 and increased to high levels as more users joined the Twitter discussion in the following months.
    See also Michele’s blog post: https://www.michelecoscia.com/?p=2466
  2. Leveraging VLLMs for Visual Clustering: Image-to-Text Mapping Shows Increased Semantic Capabilities and Interpretability, by Luigi Arminio, Matteo Magnani, Matías Piqueras, Luca Rossi, and Alexandra Segerberg published in Social Science Computer Review.

    We test an approach that leverages the ability of Vision-and-Large-Language-Models (VLLMs) to generate image descriptions that incorporate connotative interpretations of the input images. In particular, we use a VLLM to generate connotative textual descriptions of a set of images related to climate debate, and cluster the images based on these textual descriptions. In parallel, we cluster the same images using a more traditional approach based on CNNs. In doing so, we compare the connotative semantic validity of clusters generated using VLLMs with those produced using CNNs, and assess their interpretability. The results show that the approach based on VLLMs greatly improves the quality score for connotative clustering. Moreover, VLLM-based approaches, leveraging textual information as a step towards clustering, offer a high level of interpretability of the results.
  3. Mapping Stakeholder Needs to Multi-Sided Fairness in Candidate Recommendation for Algorithmic Hiring, by Mesut Kaya and Toine Bogers, published in RecSys ’25: Proceedings of the Nineteenth ACM Conference on Recommender Systems

    Past analyses of fairness in algorithmic hiring have been restricted to single-side fairness, ignoring the perspectives of the other stakeholders. In this paper, we address this gap and present a multi-stakeholder approach to fairness in a candidate recommender system that recommends relevant candidate CVs to human recruiters in a human-in-the-loop algorithmic hiring scenario. We conducted semi-structured interviews with 40 different stakeholders (job seekers, companies, recruiters, and other job portal employees). We used these interviews to explore their lived experiences of unfairness in hiring, co-design definitions of fairness as well as metrics that might capture these experiences. Finally, we attempt to reconcile and map these different (and sometimes conflicting) perspectives and definitions to existing (categories of) fairness metrics that are relevant for our candidate recommendation scenario.

New NERDS publication on hitting the music charts

We have a new exciting publication out! 🎸

Is it getting harder to make a hit? Evidence from 65 years of US music chart history, by Marta Ewa Lech, Sune Lehmann & Jonas L. Juul, published in EPJ Data Science

We show that the dynamics of the Billboard Hot 100 chart have changed significantly since the chart’s founding in 1958, and, in particular, in the past 15 years. Whereas most songs spend less time on the chart now than songs did in the past, we show that top-1 songs have tripled their chart lifetime since the 1960s, and the highest-ranked songs maintain their positions for far longer than previously. At the same time, churn has increased drastically, and the lowest-ranked songs are replaced more frequently than ever. Together, these observations support two competing and seemingly contradictory theories of digital markets: The Winner-takes-all theory and the Long Tail theory. Who occupies the chart has also changed over the years: In recent years, fewer new artists make it into the chart and more positions are occupied by established hit makers. Finally, investigating how song chart trajectories have changed over time, we show that historical song trajectories cluster into clear trajectory archetypes characteristic of the time period they were part of. Our results are interesting in the context of collective attention: Whereas recent studies have documented that other cultural products such as books, news, and movies fade in popularity quicker in recent years, music hits seem to last longer now that in the past.

Two new NERDS papers: NFT markets, settlement data

We have two new publications out!

  1. Characterizing NFT Markets through a Multilayer Network Approach, by Alessia Galdeman, Lucio La Cava, Matteo Zignani, Andrea Tagarelli, Sabrina Gaito published in Blockchain: Research and Applications

    In this study, we explore a multilayer network modeling approach to analyze transactions in multiple NFT markets. We reveal previously unnoticed macroscopic and mesoscopic traits by investigating indicators that discern whether markets are independent or linked: users trading NFTs are organized in cross-market communities where multi-market users act as bridges across marketplaces, adapting to the diverse nature of the markets they operate in. We also conduct an in-depth examination of such multi-market users, studying their specific activity patterns that leave a distinctive mark on the system: the majority of multi-market users well differentiate their earnings and expenses among the markets, while a fraction of them is directed toward a more polarized money allocation based on the typology of the markets.
  2. Uncovering large inconsistencies between machine learning derived gridded settlement datasets, by Vedran Sekara, Andrea Martini, Manuel Garcia-Herranz & Do-Hyung Kim, published in EPJ Data Science

    We compare three settlement maps developed by Google (Open Buildings), Meta (High Resolution Population Density Maps) and Microsoft (Global Building Footprints), and uncover which factors drive mismatch. Our study focuses on 44 African countries. We build a global machine learning model to predict where datasets agree, and find that geographic and socio-economic factors considerably impact overlap. However, we also find there is great variability across countries, suggesting complex interactions between country morphology and dataset overlap. It is vital to understand the shortcomings of AI-derived settlement layers as international organizations, governments, and NGOs are already experimenting with incorporating these into programmatic work. We anticipate our work to be a starting point for more critical and detailed analyses of AI derived datasets for humanitarian, policy, and scientific purposes.

New NERDS publication on the BikeNodePlanner tool

We have a new publication out on a piece of software we wrote:

BikeNodePlanner: A data-driven decision support tool for bicycle node network planning, by A. Vybornova, A.R. Vierø, K.K. Hansen, and M. Szell, published in Environment and Planning B

A bicycle node network is a wayfinding system targeted at recreational cyclists, consisting of numbered signposts placed alongside already existing infrastructure. Bicycle node networks are becoming increasingly popular as they encourage sustainable tourism and rural cycling, while also being flexible and cost-effective to implement. However, the lack of a formalized methodology and data-driven tools for the planning of such networks is a hindrance to their adaptation on a larger scale. To address this need, we present the BikeNodePlanner: A fully open-source decision support tool, consisting of modular Python scripts to be run in the free and open-source geographic information system QGIS. The BikeNodePlanner allows the user to evaluate and compare bicycle node network plans through a wide range of metrics, such as land use, proximity to points of interest, and elevation across the network. The BikeNodePlanner provides data-driven decision support for bicycle node network planning and can hence be of great use for regional planning, cycling tourism, and the promotion of rural cycling.