Robustness and stability of enterprise intranet social networks: The impact of moderators

• URL: http://arxiv.org/abs/2105.09127v1
• Date: Wed, 19 May 2021 13:43:03 GMT
• Title: Robustness and stability of enterprise intranet social networks: The impact of moderators
• Authors: A. Fronzetti Colladon and F. Vagaggini
• Abstract summary: We analyzed more than 52,000 messages posted by approximately 12,000 employees. We removed the forum moderators, the spammers, the overly connected nodes and the nodes lying at the network periphery. Our findings can help online community managers to understand the role of moderators within intranet forums.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In this study, we tested the robustness of three communication networks extracted from the online forums included in the intranet platforms of three large companies. For each company we analyzed the communication among employees both in terms of network structure and content (language used). Over a period of eight months, we analyzed more than 52,000 messages posted by approximately 12,000 employees. Specifically, we tested the network robustness and the stability of a set of structural and semantic metrics, while applying several different node removal strategies. We removed the forum moderators, the spammers, the overly connected nodes and the nodes lying at the network periphery, also testing different combinations of these selections. Results indicate that removing spammers and very peripheral nodes can be a relatively low impact strategy in this context; accordingly, it could be used to clean the noise generated by these types of social actor and to reduce the computation complexity of the analysis. On the other hand, the removal of moderators seems to have a significant impact on the network connectivity and the shared content. The most affected variables are closeness centrality and contribution index. We also found that the removal of overly connected nodes can significantly change the network structure. Lastly, we compared the behavior of moderators with the other users, finding distinctive characteristics by which moderators can be identified when their list is unknown. Our findings can help online community managers to understand the role of moderators within intranet forums and can be useful for social network analysts who are interested in evaluating the effects of graph simplification techniques.

Related papers

• Digital cloning of online social networks for language-sensitive agent-based modeling of misinformation spread [0.0]
  We develop a simulation framework for studying misinformation spread within online social networks. We create a 'digital clone' of a known misinformation sharing network by downloading social media histories for over ten thousand of its users.
  arXiv  Detail & Related papers  (2024-01-23T06:02:03Z)
• Boosting Residual Networks with Group Knowledge [75.73793561417702]
  Recent research understands the residual networks from a new perspective of the implicit ensemble model. Previous methods such as depth and stimulative training have further improved the performance of the residual network by sampling and training of itss. We propose a group knowledge based training framework for boosting the performance of residual networks.
  arXiv  Detail & Related papers  (2023-08-26T05:39:57Z)
• Opinion Control under Adversarial Network Perturbation: A Stackelberg Game Approach [12.916992671437017]
  adversarial network perturbation greatly influences the opinion formation of the public and threatens our societies. In this work, we model the adversarial network perturbation and analyze its impact on the networks' opinion. From the adversary's perspective, we formulate a Stackelberg game and aim to control the network's opinion even under such adversarial network perturbation.
  arXiv  Detail & Related papers  (2023-04-25T03:14:39Z)
• A Systematic Evaluation of Node Embedding Robustness [77.29026280120277]
  We assess the empirical robustness of node embedding models to random and adversarial poisoning attacks. We compare edge addition, deletion and rewiring strategies computed using network properties as well as node labels. We found that node classification suffers from higher performance degradation as opposed to network reconstruction.
  arXiv  Detail & Related papers  (2022-09-16T17:20:23Z)
• Stability of Neural Networks on Manifolds to Relative Perturbations [118.84154142918214]
  Graph Neural Networks (GNNs) show impressive performance in many practical scenarios. GNNs can scale well on large size graphs, but this is contradicted by the fact that existing stability bounds grow with the number of nodes.
  arXiv  Detail & Related papers  (2021-10-10T04:37:19Z)
• Measuring the impact of spammers on e-mail and Twitter networks [0.0]
  This paper investigates if senders of large amounts of irrelevant or unsolicited information - commonly called "spammers" - distort the network structure of social networks. Two large social networks are analyzed, the first extracted from the Twitter discourse about a big telecommunication company, and the second obtained from three years of email communication of 200 managers working for a large multinational company. Results show that spammers do not significantly alter the structure of the information-carrying network, for most of the social indicators.
  arXiv  Detail & Related papers  (2021-05-21T10:13:11Z)
• Hide and Seek: Outwitting Community Detection Algorithms [17.144388833011536]
  Community affiliation plays an important role in determining a node's contextual position in a network. This study focuses on hiding such sensitive communities so that the community affiliation of the targeted nodes can be concealed. We introduce NEURAL, a novel method that greedily optimize a node-centric objective function to determine the rewiring strategy.
  arXiv  Detail & Related papers  (2021-02-22T03:50:44Z)
• NetReAct: Interactive Learning for Network Summarization [60.18513812680714]
  We present NetReAct, a novel interactive network summarization algorithm which supports the visualization of networks induced by text corpora to perform sensemaking. We show how NetReAct is successful in generating high-quality summaries and visualizations that reveal hidden patterns better than other non-trivial baselines.
  arXiv  Detail & Related papers  (2020-12-22T03:56:26Z)
• A game-theoretic analysis of networked system control for common-pool resource management using multi-agent reinforcement learning [54.55119659523629]
  Multi-agent reinforcement learning has recently shown great promise as an approach to networked system control. Common-pool resources include arable land, fresh water, wetlands, wildlife, fish stock, forests and the atmosphere.
  arXiv  Detail & Related papers  (2020-10-15T14:12:26Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• Disrupting Resilient Criminal Networks through Data Analysis: The case of Sicilian Mafia [3.863757719887419]
  We unveil the structure of Sicilian Mafia gangs, based on two real-world datasets. We gain insights as to how to efficiently disrupt them. Our work has significant practical applications for tackling criminal and terrorist networks.
  arXiv  Detail & Related papers  (2020-03-10T12:42:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.