Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “physics.soc-ph”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 937 records · Page 52Linked to original sources

The Dark Side of Micro-Task Marketplaces: Characterizing Fiverr and Automatically Detecting Crowdturfing

As human computation on crowdsourcing systems has become popular and powerful for performing tasks, malicious users have started misusing these systems by posting malicious tasks, propagating manipulated contents, and targeting popular web services such as online social networks and search engines. Recently, these malicious users moved to Fiverr, a fast-growing micro-task marketplace, where workers can post crowdturfing tasks (i.e., astroturfing campaigns run by crowd workers) and malicious customers can purchase those tasks for only $5. In this paper, we present a comprehensive analysis of Fiverr. First, we identify the most popular types of crowdturfing tasks found in this marketplace and conduct case studies for these crowdturfing tasks. Then, we build crowdturfing task detection classifiers to filter these tasks and prevent them from becoming active in the marketplace. Our experimental results show that the proposed classification approach effectively detects crowdturfing tasks, achieving 97.35% accuracy. Finally, we analyze the real world impact of crowdturfing tasks by purchasing active Fiverr tasks and quantifying their impact on a target site. As part of this analysis, we show that current security systems inadequately detect crowdsourced manipulation, which confirms the necessity of our proposed crowdturfing task detection approach.

cs.SI↗

The Hegselmann-Krause dynamics for equally spaced agents

We consider the Hegselmann-Krause bounded confidence dynamics for n equally spaced opinions on the real line, with gaps equal to the confidence bound r, which we take to be 1. We prove rigorous results on the evolution of this configuration, which confirm hypotheses previously made based on simulations for small values of n. Namely, for every n, the system evolves as follows: after every 5 time steps, a group of 3 agents become disconnected at either end and collapse to a cluster at the subsequent step. This continues until there are fewer than 6 agents left in the middle, and these finally collapse to a cluster, if n is not a multiple of 6. In particular, the final configuration consists of 2*[n/6] clusters of size 3, plus one cluster in the middle of size n (mod 6), if n is not a multiple of 6, and the number of time steps before freezing is 5n/6 + O(1). We also consider the dynamics for arbitrary, but constant, inter-agent spacings d \in [0, 1] and present three main findings. Firstly we prove that the evolution is periodic also at some other, but not all, values of d, and present numerical evidence that for all d something "close" to periodicity nevertheless holds. Secondly, we exhibit a value of d at which the behaviour is periodic and the time to freezing is n + O(1), hence slower than that for d = 1. Thirdly, we present numerical evidence that, as d --> 0, the time to freezing may be closer, in order of magnitude, to the diameter d(n-1) of the configuration rather than the number of agents n.

physics.soc-ph↗

Evolution of citation networks with the hypergraph formalism

In this paper, we proposed an evolving model via the hypergraph to illustrate the evolution of the citation network. In the evolving model, we consider the mechanism combined with preferential attachment and the aging influence. Simulation results show that the proposed model can characterize the citation distribution of the real system very well. In addition, we give the analytical result of the citation distribution using the master equation. Detailed analysis showed that the time decay factor should be the origin of the same citation distribution between the proposed model and the empirical result. The proposed model might shed some lights in understanding the underlying laws governing the structure of real citation networks.

physics.soc-ph↗

Crowds on Wall Street: Extracting Value from Social Investing Platforms

For decades, the world of financial advisors has been dominated by large investment banks such as Goldman Sachs. In recent years, user-contributed investment services such as SeekingAlpha and StockTwits have grown to millions of users. In this paper, we seek to understand the quality and impact of content on social investment platforms, by empirically analyzing complete datasets of SeekingAlpha articles (9 years) and StockTwits messages (4 years). We develop sentiment analysis tools and correlate contributed content to the historical performance of relevant stocks. While SeekingAlpha articles and StockTwits messages provide minimal correlation to stock performance in aggregate, a subset of authors contribute more valuable (predictive) content. We show that these authors can be identified via both empirical methods or by user interactions, and investments using their analysis significantly outperform broader markets. Finally, we conduct a user survey that sheds light on users views of SeekingAlpha content and stock manipulation.

cs.SI↗

Anticipating Activity in Social Media Spikes

We propose a novel mathematical model for the activity of microbloggers during an external, event-driven spike. The model leads to a testable prediction of who would become most active if a spike were to take place. This type of information is of great interest to commercial organisations, governments and charities, as it identifies key players who can be targeted with information in real time when the network is most receptive. The model takes account of the fact that dynamic interactions evolve over an underlying, static network that records who listens to whom. The model is based on the assumption that, in the case where the entire community has become aware of an external news event, a key driver of activity is the motivation to participate by responding to incoming messages. We test the model on a large scale Twitter conversation concerning the appointment of a UK Premier League football club manager. We also present further results for a Bundesliga football match, a marketing event and a television programme. In each case we find that exploiting the underlying connectivity structure improves the prediction of who will be active during a spike. We also show how the half-life of a spike in activity can be quantified in terms of the network size and the typical response rate.

cs.SI↗

Are Social Networks Really Balanced?

There is a long-standing belief that in social networks with simultaneous friendly/hostile interactions (signed networks) there is a general tendency to a global balance. Balance represents a state of the network with lack of contentious situations. Here we introduce a method to quantify the degree of balance of any signed (social) network. It accounts for the contribution of all signed cycles in the network and gives, in agreement with empirical evidences, more weight to the shorter than to the longer cycles. We found that, contrary to what is believed, many signed social networks -- in particular very large directed online social networks -- are in general very poorly balanced. We also show that unbalanced states can be changed by tuning the weights of the social interactions among the agents in the network.

physics.soc-ph↗

Inferring the geographic focus of online documents from social media sharing patterns

Determining the geographic focus of digital media is an essential first step for modern geographic information retrieval. However, publicly-visible location annotations are remarkably sparse in online data. In this work, we demonstrate a method which infers the geographic focus of an online document by examining the locations of Twitter users who share links to the document. We apply our geotagging technique to multiple datasets built from different content: manually-annotated news articles, GDELT, YouTube, Flickr, Twitter, and Tumblr.

cs.SI↗

Leveraging Personalization To Facilitate Privacy

Online social networks have enabled new methods and modalities of collaboration and sharing. These advances bring privacy concerns: online social data is more accessible and persistent and simultaneously less contextualized than traditional social interactions. To allay these concerns, many web services allow users to configure their privacy settings based on a set of multiple-choice questions. We suggest a new paradigm for privacy options. Instead of suggesting the same defaults to each user, services can leverage knowledge of users' traits to recommend a machine-learned prediction of their privacy preferences for Facebook. As a case study, we build and evaluate MyPrivacy, a publicly available web application that suggests personalized privacy settings. An evaluation with 199 users shows that users find the suggestions to be appropriate and private; furthermore, they express intent to implement the recommendations made by MyPrivacy. This supports the proposal to put personalization to work in online communities to promote privacy and security.

cs.SI↗

On the Permanence of Vertices in Network Communities

Despite the prevalence of community detection algorithms, relatively less work has been done on understanding whether a network is indeed modular and how resilient the community structure is under perturbations. To address this issue, we propose a new vertex-based metric called "permanence", that can quantitatively give an estimate of the community-like structure of the network. The central idea of permanence is based on the observation that the strength of membership of a vertex to a community depends upon the following two factors: (i) the distribution of external connectivity of the vertex to individual communities and not the total external connectivity, and (ii) the strength of its internal connectivity and not just the total internal edges. In this paper, we demonstrate that compared to other metrics, permanence provides (i) a more accurate estimate of a derived community structure to the ground-truth community and (ii) is more sensitive to perturbations in the network. As a by-product of this study, we have also developed a community detection algorithm based on maximizing permanence. For a modular network structure, the results of our algorithm match well with ground-truth communities.

physics.soc-ph↗

A Generalized and Adaptive Method for Community Detection

Complex networks represent interactions between entities. They appear in various contexts such as sociology, biology, etc., and they generally contain highly connected subgroups called communities. Community detection is a well-studied problem and most of the algorithms aim to maximize the Newman-Girvan modularity function, the most popular being the Louvain method (it is well-suited on very large graphs). However, the classical modularity has many drawbacks: we can find partitions of high quality in graphs without community structure, e.g., on random graphs; it promotes large communities. Then, we have adapted the Louvain method to other quality functions. In this paper, we describe a generic version of the Louvain method. In particular, we give a sufficient condition to plug a quality function into it. We also show that global performance of this new version is similar to the classical Louvain algorithm, that promotes it to the best rank of the community detection algorithms.

cs.SI↗

A Flexible Fitness Function for Community Detection in Complex Networks

Most community detection algorithms from the literature work as optimization tools that minimize a given \textit{fitness function}, while assuming that each node belongs to a single community. Since there is no hard concept of what a community is, most proposed fitness functions focus on a particular definition. As such, these functions do not always lead to partitions that correspond to those observed in practice. This paper proposes a new flexible fitness function that allows the identification of communities with distinct characteristics. Such flexibility was evaluated through the adoption of an immune-inspired optimization algorithm, named cob-aiNet[C], to identify both disjoint and overlapping communities in a set of benchmark networks. The results have shown that the obtained partitions are much closer to the ground-truth than those obtained by the optimization of the modularity function.

cs.NE↗

Toward a Local Perspective on Online Collaboration

We study the structural properties of large scale collaboration in online communities of innovation and the role that position in the community plays in determining knowledge contribution. Contrary to previous research, we argue for a more local perspective when examining online collaboration. We demonstrate that a member's centrality and spanning within his/her local neighborhood is a better predictor of contribution than global centrality and spanning within the whole community. We contribute both theoretically and methodologically to research on large scale collaboration. On the theoretical front, a local view of position implies a more confined and local organization of work in online communities than previously thought. From a methodological perspective, evaluating the local structure of large networks involves radically different algorithms that have only recently become feasible with the increase of processing power.

cs.SI↗

SocialSpy: Browsing (Supposedly) Hidden Information in Online Social Networks

Online Social Networks are becoming the most important "places" where people share information about their lives. With the increasing concern that users have about privacy, most social networks offer ways to control the privacy of the user. Unfortunately, we believe that current privacy settings are not as effective as users might think. In this paper, we highlight this problem focusing on one of the most popular social networks, Facebook. In particular, we show how easy it is to retrieve information that a user might have set as (and hence thought as) "private". As a case study, we focus on retrieving the list of friends for users that did set this information as "hidden" (to non-friends). We propose four different strategies to achieve this goal, and we evaluate them. The results of our thorough experiments show the feasibility of our strategies as well as their effectiveness: our approach is able to retrieve a significant percentage of the names of the "hidden" friends: i.e., some 25% on average, and more than 70% for some users.

cs.SI↗

VoG: Summarizing and Understanding Large Graphs

How can we succinctly describe a million-node graph with a few simple sentences? How can we measure the "importance" of a set of discovered subgraphs in a large graph? These are exactly the problems we focus on. Our main ideas are to construct a "vocabulary" of subgraph-types that often occur in real graphs (e.g., stars, cliques, chains), and from a set of subgraphs, find the most succinct description of a graph in terms of this vocabulary. We measure success in a well-founded way by means of the Minimum Description Length (MDL) principle: a subgraph is included in the summary if it decreases the total description length of the graph. Our contributions are three-fold: (a) formulation: we provide a principled encoding scheme to choose vocabulary subgraphs; (b) algorithm: we develop \method, an efficient method to minimize the description cost, and (c) applicability: we report experimental results on multi-million-edge real graphs, including Flickr and the Notre Dame web graph.

cs.SI↗

Analysis of networking characteristics of different personality types

The MBTI personality test and a personal facebook network were used in order to gain some insights on the relationship of social network centrality and path length measures and different personality types. Although the personality classification data were scarce, there were some intuitive quantitative results supporting anecdotal statements, based on empirical observations, about the expected social behavior of personality types.

cs.SI↗

Human language reveals a universal positivity bias

Using human evaluation of 100,000 words spread across 24 corpora in 10 languages diverse in origin and culture, we present evidence of a deep imprint of human sociality in language, observing that (1) the words of natural human language possess a universal positivity bias; (2) the estimated emotional content of words is consistent between languages under translation; and (3) this positivity bias is strongly independent of frequency of word usage. Alongside these general regularities, we describe inter-language variations in the emotional spectrum of languages which allow us to rank corpora. We also show how our word evaluations can be used to construct physical-like instruments for both real-time and offline measurement of the emotional content of large-scale texts.

physics.soc-ph↗

Broker Bots: Analyzing automated activity during High Impact Events on Twitter

Twitter is now an established and a widely popular news medium. Be it normal banter or a discussion on high impact events like Boston marathon blasts, February 2014 US Icestorm, etc., people use Twitter to get updates. Twitter bots have today become very common and acceptable. People are using them to get updates about emergencies like natural disasters, terrorist strikes, etc. Twitter bots provide these users a means to perform certain tasks on Twitter that are both simple and structurally repetitive. During high impact events these Twitter bots tend to provide time critical and comprehensive information. We present how bots participate in discussions and augment them during high impact events. We identify bots in high impact events for 2013: Boston blasts, February 2014 US Icestorm, Washington Navy Yard Shooting, Oklahoma tornado, and Cyclone Phailin. We identify bots among top tweeters by getting all such accounts manually annotated. We then study their activity and present many important insights. We determine the impact bots have on information diffusion during these events and how they tend to aggregate and broker information from various sources to different users. We also analyzed their tweets, list down important differentiating features between bots and non bots (normal or human accounts) during high impact events. We also show how bots are slowly moving away from traditional API based posts towards web automation platforms like IFTTT, dlvr.it, etc. Using standard machine learning, we proposed a methodology to identify bots/non bots in real time during high impact events. This study also looks into how the bot scenario has changed by comparing data from high impact events from 2013 with data from similar type of events from 2011. Lastly, we also go through an in-depth analysis of Twitter bots who were active during 2013 Boston Marathon Blast.

cs.SI↗

Do good actions inspire good actions in others?

Actions such as sharing food and cooperating to reach a common goal have played a fundamental role in the evolution of human societies. These good actions may not maximise the actor's payoff, but they maximise the other's payoff. Consequently, their existence is puzzling for evolutionary theories. Why should you make an effort to help others, even when no reward seems to be at stake? Indeed, experiments typically show that humans are heterogeneous: some may help others, while others may not. With the aim of favouring the emergence of 'successful cultures', a number of studies has recently investigated what mechanisms promote the evolution of a particular good action. But still little is known about if and how good actions can spread from person to person. For instance, does being recipient of an altruistic act increase your probability of being cooperative with others? Plato's quote, 'Good actions give strength to ourselves and inspire good actions in others', suggests that is possible. We have conducted an experiment on Amazon Mechanical Turk to test this mechanism using economic games. We have measured willingness to be cooperative through a standard Prisoner's dilemma and willingness to act altruistically using a binary Dictator game. In the baseline treatments, the endowments needed to play were given by the experimenters, as usual; in the control treatments, they came from a good action made by someone else. Across four different comparisons and a total of 572 subjects, we have never found a significant increase of cooperation or altruism when the endowment came from a good action. We conclude that good actions do not necessarily inspire good actions in others, at least in the ideal scenario of a lab experiment with anonymous subjects.

physics.soc-ph↗