Social Diffusion Sources Can Escape Detection
@article{Waniek2021SocialDS,
title={Social Diffusion Sources Can Escape Detection},
author={Marcin Waniek and Manuel Cebrian and Petter Holme and Talal Rahwan},
journal={ArXiv},
year={2021},
volume={abs/2102.10539}
}Influencing (and being influenced by) others indirectly through social networks is fundamental to all human societies. Whether this happens through the diffusion of rumors, viruses, opinions, or knowhow, finding the source is of persistent interest to people and an algorithmic challenge of much current research interest. However, no study has considered the case of diffusion sources actively trying to avoid detection. By disregarding this assumption, we risk conflating intentional obfuscation…
Figures and Tables from this paper
figure 1 
table 1 
figure 2 
table 2 
figure 3 
table 3 
figure 4 
table 4 
figure 5 
table 5 
figure 6 
figure 7 
figure 8 
figure 9 
figure 10 
figure 11 
figure 12 
figure 13 
figure 14 
figure 15 
figure 16 
figure 17 
figure 19 
figure 21 
figure 22 
figure 23 
figure 24 
figure 25 
figure 26 
figure 27 
figure 28 
figure 29 
figure 30 
figure 31 
figure 32 
figure 33 
figure 34 
figure 35 
figure 36 
figure 37 
figure 38 
figure 39 
figure 40 
figure 41 
figure 42 
figure 43 
figure 44 
figure 45 
figure 46 
figure 47 
figure 48 
figure 49 
figure 50 
figure 51 
figure 52 
figure 53 
figure 54 
figure 55 
figure 56 
figure 57 
figure 58 
figure 59 
figure 60 
figure 61 
figure 62 
figure 63 
figure 64 
figure 65 
figure 66 
figure 67 
figure 68 
figure 69 
figure 70 
figure 71 
figure 72 
figure 73 
figure 74 
figure 75 
figure 76 
figure 77 
figure 78 
figure 79 
figure 80
2 Citations
Hiding in Temporal Networks
- Computer ScienceIEEE Transactions on Network Science and Engineering
- 2022
It is usually computationally infeasible to find the optimal way of hiding, but by manipulating one’s contacts, one could add a surprising amount of privacy by considering temporal networks of edges changing in time.
How Members of Covert Networks Conceal the Identities of Their Leaders
- Computer ScienceACM Trans. Intell. Syst. Technol.
- 2022
This work analyzes the problem of choosing a set of edges to be added to a network to decrease the leaders’ ranking according to three fundamental centrality measures, namely, degree, closeness, and betweenness and proves that this problem is NP-complete for each measure.
References
SHOWING 1-10 OF 48 REFERENCES
Hiding individuals and communities in a social network
- Computer ScienceNature Human Behaviour
- 2017
It is shown that individuals and communities can disguise themselves from detection online by standard social network analysis tools through simple changes to their social network connections.
Source detection of rumor in social network - A review
- Computer ScienceOnline Soc. Networks Media
- 2019
An analysis of social network-based Sybil defenses
- Computer ScienceSIGCOMM '10
- 2010
It is demonstrated that networks with well-defined community structure are inherently more vulnerable to Sybil attacks, and that, in such networks, Sybils can carefully target their links in order to make their attacks more effective.
How to Hide One’s Relationships from Link Prediction Algorithms
- Computer ScienceScientific Reports
- 2019
It is proved that the optimization problem faced by such an individual is NP-complete, meaning that any attempt to identify an optimal way to hide one’s relationships is futile, and effective heuristics that are readily-applicable by users of existing social media platforms to conceal any connections they deem sensitive are developed.
Fast rumor source identification via random walks
- Computer ScienceSocial Network Analysis and Mining
- 2016
This work proposes a heuristic based on the hitting time statistics of a surrogate random walk process that can be used to approximate the maximum likelihood estimator of the rumor source.
Aiding the Detection of Fake Accounts in Large Scale Social Online Services
- Computer ScienceNSDI
- 2012
A new tool in the hands of OSN operators, which relies on social graph properties to rank users according to their perceived likelihood of being fake (SybilRank), which is computationally efficient and can scale to graphs with hundreds of millions of nodes, as demonstrated by the Hadoop prototype.
Rumors in a Network: Who's the Culprit?
- Computer ScienceIEEE Transactions on Information Theory
- 2011
Simulations show that rumor centrality outperforms distance centrality in finding rumor sources in networks which are not tree-like, and it is proved that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ.
Uncovering Large Groups of Active Malicious Accounts in Online Social Networks
- Computer ScienceCCS
- 2014
This work designs and implements a malicious account detection system called SynchroTrap that clusters user accounts according to the similarity of their actions and uncovers large groups of malicious accounts that act similarly at around the same time for a sustained period of time.
SybilGuard: Defending Against Sybil Attacks via Social Networks
- Computer ScienceIEEE/ACM Transactions on Networking
- 2008
This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks, based on the ldquosocial networkrdquo among user identities, where an edge between two identities indicates a human-established trust relationship.
The spread of low-credibility content by social bots
- Computer ScienceNature Communications
- 2018
It is found that bots play a major role in the spread of low-credibility content on Twitter, and control measures for limiting thespread of misinformation are suggested.