Corpus ID: 236469087

Hiding in Temporal Networks

@article{Waniek2021HidingIT,
  title={Hiding in Temporal Networks},
  author={Marcin Waniek and Petter Holme and Talal Rahwan},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.13174}
}
Social network analysis tools can infer various attributes just by scrutinizing one’s connections. Several researchers have studied the problem faced by an evader whose goal is to strategically rewire their social connections in order to mislead such tools, thereby concealing their private attributes. However, to date this literature has only considered static networks, while neglecting the more general case of temporal networks, where the structure evolves over time. Driven by this observation… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 58 REFERENCES
Covert Networks: How Hard is It to Hide?
TLDR
This work studies the popular core centrality measure and shows that the corresponding computational problem, called Hiding Leader, is NP-Complete even when the coreCentrality of every leader is only $3, and proves that the problem becomes polynomial time solvable for the degreeCentrality measure if the degree ofevery leader is bounded above by any constant. Expand
Hiding in Multilayer Networks
TLDR
This paper considers an "evader" who strategically chooses which connections to form in a multilayer network in order to obtain a low centrality-based ranking, reducing the chance of being highlighted as a key figure in the network-while ensuring that she remains connected to a certain group of people. Expand
Social Diffusion Sources Can Escape Detection
TLDR
It is found that identifying the source can be challenging even without foul play and, many times, it is easy to evade source-detection algorithms further, so efforts should focus on exposing concealed ties rather than planted fake entities, e.g., bots in social media. Expand
Hiding individuals and communities in a social network
TLDR
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. Expand
How to Hide One’s Relationships from Link Prediction Algorithms
TLDR
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. Expand
Strategic Social Network Analysis
TLDR
A new paradigm for social network analysis is outlined, whereby the strategic behaviour of network actors is explicitly modeled, which may assist security agencies and counter terrorism units in understanding the strategies that covert organizations use to escape detection, and give rise to new strategy-proof countermeasures. Expand
Attacking Similarity-Based Link Prediction in Social Networks
TLDR
This work offers a comprehensive algorithmic investigation of the problem of attacking similarity-based link prediction through link deletion, focusing on two broad classes of such approaches, one which uses only local information about target links, and another which uses global network information. Expand
Anonymizing Social Networks
TLDR
A framework for assessing the privacy risk of sharing anonymized network data is presented and a novel anonymization technique based on perturbing the network is proposed, demonstrating empirically that it leads to substantial reduction of the privacy threat. Expand
Analysing information flows and key mediators through temporal centrality metrics
TLDR
It is argued that dynamically evolving network topologies are inherent in many systems, including real online social and technological networks: fortunately the nature of these systems is such that they allow the gathering of large quantities of finegrained temporal data on interactions amongst the network members. Expand
On the Construction of Covert Networks
TLDR
It is proved that the hardness of choosing a set of edges that can be added to the network in order to decrease the leaders' ranking according to two fundamental centrality measures, namely degree, and closeness, is NP-complete. Expand
...
1
2
3
4
5
...