22,859 research outputs found
Social Bots: Human-Like by Means of Human Control?
Social bots are currently regarded an influential but also somewhat
mysterious factor in public discourse and opinion making. They are considered
to be capable of massively distributing propaganda in social and online media
and their application is even suspected to be partly responsible for recent
election results. Astonishingly, the term `Social Bot' is not well defined and
different scientific disciplines use divergent definitions. This work starts
with a balanced definition attempt, before providing an overview of how social
bots actually work (taking the example of Twitter) and what their current
technical limitations are. Despite recent research progress in Deep Learning
and Big Data, there are many activities bots cannot handle well. We then
discuss how bot capabilities can be extended and controlled by integrating
humans into the process and reason that this is currently the most promising
way to go in order to realize effective interactions with other humans.Comment: 36 pages, 13 figure
Élőlények kollektív viselkedésének statisztikus fizikája = Statistical physics of the collective behaviour of organisms
Experiments: We have carried out quantitative experiments on the collective motion of cells as a function of their density. A sharp transition could be observed from the random motility in sparse cultures to the flocking of dense islands of cells. Using ultra light GPS devices developed by us, we have determined the existing hierarchical relations within a flock of 10 homing pigeons. Modelling: From the simulations of our new model of flocking we concluded that the information exchange between particles was maximal at the critical point, in which the interplay of such factors as the level of noise, the tendency to follow the direction and the acceleration of others results in large fluctuations. Analysis: We have proposed a novel link-density based approach to finding overlapping communities in large networks. The algorithm used for the implementation of this technique is very efficient for most real networks, and provides full statistics quickly. Correspondingly, we have developed a by now popular, user-friendly, freely downloadable software for finding overlapping communities. Extending our method to the time-dependent regime, we found that large groups in evolving networks persist for longer if they are capable of dynamically altering their membership, thus, an ability to change the group composition results in better adaptability. We also showed that knowledge of the time commitment of members to a given community can be used for estimating the community's lifetime. Experiments: We have carried out quantitative experiments on the collective motion of cells as a function of their density. A sharp transition could be observed from the random motility in sparse cultures to the flocking of dense islands of cells. Using ultra light GPS devices developed by us, we have determined the existing hierarchical relations within a flock of 10 homing pigeons. Modelling: From the simulations of our new model of flocking we concluded that the information exchange between particles was maximal at the critical point, in which the interplay of such factors as the level of noise, the tendency to follow the direction and the acceleration of others results in large fluctuations. Analysis: We have proposed a novel link-density based approach to finding overlapping communities in large networks. The algorithm used for the implementation of this technique is very efficient for most real networks, and provides full statistics quickly. Correspondingly, we have developed a by now popular, user-friendly, freely downloadable software for finding overlapping communities. Extending our method to the time-dependent regime, we found that large groups in evolving networks persist for longer if they are capable of dynamically altering their membership, thus, an ability to change the group composition results in better adaptability. We also showed that knowledge of the time commitment of members to a given community can be used for estimating the community's lifetime
Network Weirdness: Exploring the Origins of Network Paradoxes
Social networks have many counter-intuitive properties, including the
"friendship paradox" that states, on average, your friends have more friends
than you do. Recently, a variety of other paradoxes were demonstrated in online
social networks. This paper explores the origins of these network paradoxes.
Specifically, we ask whether they arise from mathematical properties of the
networks or whether they have a behavioral origin. We show that sampling from
heavy-tailed distributions always gives rise to a paradox in the mean, but not
the median. We propose a strong form of network paradoxes, based on utilizing
the median, and validate it empirically using data from two online social
networks. Specifically, we show that for any user the majority of user's
friends and followers have more friends, followers, etc. than the user, and
that this cannot be explained by statistical properties of sampling. Next, we
explore the behavioral origins of the paradoxes by using the shuffle test to
remove correlations between node degrees and attributes. We find that paradoxes
for the mean persist in the shuffled network, but not for the median. We
demonstrate that strong paradoxes arise due to the assortativity of user
attributes, including degree, and correlation between degree and attribute.Comment: Accepted to ICWSM 201
Local modularity measure for network clusterizations
Many complex networks have an underlying modular structure, i.e., structural
subunits (communities or clusters) characterized by highly interconnected
nodes. The modularity has been introduced as a measure to assess the
quality of clusterizations. has a global view, while in many real-world
networks clusters are linked mainly \emph{locally} among each other
(\emph{local cluster-connectivity}). Here, we introduce a new measure,
localized modularity , which reflects local cluster structure. Optimization
of and on the clusterization of two biological networks shows that the
localized modularity identifies more cohesive clusters, yielding a
complementary view of higher granularity.Comment: 5 pages, 4 figures, RevTex4; Changed conten
Topics in social network analysis and network science
This chapter introduces statistical methods used in the analysis of social
networks and in the rapidly evolving parallel-field of network science.
Although several instances of social network analysis in health services
research have appeared recently, the majority involve only the most basic
methods and thus scratch the surface of what might be accomplished.
Cutting-edge methods using relevant examples and illustrations in health
services research are provided
- …