Searcharxiv⌕ Search

arXiv subjects

Giancarlo Ruffo

Publications and source records attributed to Giancarlo Ruffo.

24 records · Page 2Linked to original sources

Network segregation in a model of misinformation and fact checking

Misinformation under the form of rumor, hoaxes, and conspiracy theories spreads on social media at alarming rates. One hypothesis is that, since social media are shaped by homophily, belief in misinformation may be more likely to thrive on those social circles that are segregated from the rest of the network. One possible antidote is fact checking which, in some cases, is known to stop rumors from spreading further. However, fact checking may also backfire and reinforce the belief in a hoax. Here we take into account the combination of network segregation, finite memory and attention, and fact-checking efforts. We consider a compartmental model of two interacting epidemic processes over a network that is segregated between gullible and skeptic users. Extensive simulation and mean-field analysis show that a more segregated network facilitates the spread of a hoax only at low forgetting rates, but has no effect when agents forget at faster rates. This finding may inform the development of mitigation techniques and overall inform on the risks of uncontrolled misinformation online.

cs.SI↗

People are Strange when you're a Stranger: Impact and Influence of Bots on Social Networks

Bots are, for many Web and social media users, the source of many dangerous attacks or the carrier of unwanted messages, such as spam. Nevertheless, crawlers and software agents are a precious tool for analysts, and they are continuously executed to collect data or to test distributed applications. However, no one knows which is the real potential of a bot whose purpose is to control a community, to manipulate consensus, or to influence user behavior. It is commonly believed that the better an agent simulates human behavior in a social network, the more it can succeed to generate an impact in that community. We contribute to shed light on this issue through an online social experiment aimed to study to what extent a bot with no trust, no profile, and no aims to reproduce human behavior, can become popular and influential in a social media. Results show that a basic social probing activity can be used to acquire social relevance on the network and that the so-acquired popularity can be effectively leveraged to drive users in their social connectivity choices. We also register that our bot activity unveiled hidden social polarization patterns in the community and triggered an emotional response of individuals that brings to light subtle privacy hazards perceived by the user base.

cs.SI↗

On the Dynamics of Human Proximity for Data Diffusion in Ad-Hoc Networks

We report on a data-driven investigation aimed at understanding the dynamics of message spreading in a real-world dynamical network of human proximity. We use data collected by means of a proximity-sensing network of wearable sensors that we deployed at three different social gatherings, simultaneously involving several hundred individuals. We simulate a message spreading process over the recorded proximity network, focusing on both the topological and the temporal properties. We show that by using an appropriate technique to deal with the temporal heterogeneity of proximity events, a universal statistical pattern emerges for the delivery times of messages, robust across all the data sets. Our results are useful to set constraints for generic processes of data dissemination, as well as to validate established models of human mobility and proximity that are frequently used to simulate realistic behaviors.

cs.NI↗

Tagging with DHARMA, a DHT-based Approach for Resource Mapping through Approximation

We introduce collaborative tagging and faceted search on structured P2P systems. Since a trivial and brute force mapping of an entire folksonomy over a DHT-based system may reduce scalability, we propose an approximated graph maintenance approach. Evaluations on real data coming from Last.fm prove that such strategies reduce vocabulary noise (i.e., representation's overfitting phenomena) and hotspots issues.

cs.DC↗

Collaborative Filtering without Explicit Feedbacks for Digital Recorders

Recommendation is usually reduced to a prediction problem over the function $r(u_a, e_i)$ that returns the expected rating of element $e_i$ for user $u_a$. In the IPTV domain, we deal with an environment where the definitions of all the parameters involved in this function (i.e., user profiles, feedback ratings and elements) are controversial. To our knowledge, this paper represents the first attempt to run collaborative filtering algorithms without inner assumptions: we start our analysis from an unstructured set of recordings, before performing a data pre-processing phase in order to extract useful information. Hence, we experiment with a real Digital Video Recorder system where EPG have not been provided to the user for selecting event timings and where explicit feedbacks were not collected.

cs.IR↗

Link creation and profile alignment in the aNobii social network

The present work investigates the structural and dynamical properties of aNobii\footnote{http://www.anobii.com/}, a social bookmarking system designed for readers and book lovers. Users of aNobii provide information about their library, reading interests and geographical location, and they can establish typed social links to other users. Here, we perform an in-depth analysis of the system's social network and its interplay with users' profiles. We describe the relation of geographic and interest-based factors to social linking. Furthermore, we perform a longitudinal analysis to investigate the interplay of profile similarity and link creation in the social network, with a focus on triangle closure. We report a reciprocal causal connection: profile similarity of users drives the subsequent closure in the social network and, reciprocally, closure in the social network induces subsequent profile alignment. Access to the dynamics of the social network also allows us to measure quantitative indicators of preferential linking.

cs.CY↗