Exploring Structural Dynamics in Retracted and Non-Retracted Author's Collaboration Networks: A Quantitative Analysis

• URL: http://arxiv.org/abs/2411.17447v1
• Date: Tue, 26 Nov 2024 14:04:36 GMT
• Title: Exploring Structural Dynamics in Retracted and Non-Retracted Author's Collaboration Networks: A Quantitative Analysis
• Abstract summary: Retractions undermine the reliability of scientific literature and the foundation of future research. This study compared the network structures of retracted and non-retracted papers. Retracted networks showed hierarchical and centralized structures, while non-retracted networks exhibited distributed collaboration with stronger clustering and connectivity.
• Score: 0.5497663232622965
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Retractions undermine the reliability of scientific literature and the foundation of future research. Analyzing collaboration networks in retracted papers can identify risk factors, such as recurring co-authors or institutions. This study compared the network structures of retracted and non-retracted papers, using data from Retraction Watch and Scopus for 30 authors with significant retractions. Collaboration networks were constructed, and network properties analyzed. Retracted networks showed hierarchical and centralized structures, while non-retracted networks exhibited distributed collaboration with stronger clustering and connectivity. Statistical tests, including $t$-tests and Cohen's $d$, revealed significant differences in metrics like Degree Centrality and Weighted Degree, highlighting distinct structural dynamics. These insights into retraction-prone collaborations can guide policies to improve research integrity.

Related papers

• Effects of Vertex Merging & Splitting on Large Coauthorship Networks: A Counterfactual Analysis [2.351268385561458]
  This study investigates how different levels of vertices merging and splitting errors are induced by name ambiguity impact network measures.<n>Initial-based disambiguation generates coauthorship networks with specific network properties underestimated.<n>In contrast, other network metric values increase, making authors appear more collaborative and embedded within less fragmented research communities.
  arXiv  Detail & Related papers  (2026-05-29T17:19:53Z)
• Beyond Code Contributions: How Network Position, Temporal Bursts, and Code Review Activities Shape Contributor Influence in Large-Scale Open Source Ecosystems [0.0]
  Open source software projects rely on complex networks of contributors whose interactions drive innovation and sustainability.<n>This study presents a comprehensive analysis of OSS contributor networks using advanced graph neural networks and temporal network analysis.
  arXiv  Detail & Related papers  (2026-02-06T06:47:52Z)
• DeepSynth-Eval: Objectively Evaluating Information Consolidation in Deep Survey Writing [53.85037373860246]
  We introduce Deep Synth-Eval, a benchmark designed to objectively evaluate information consolidation capabilities.<n>We propose a fine-grained evaluation protocol using General Checklists (for factual coverage) and Constraint Checklists (for structural organization)<n>Our results demonstrate that agentic plan-and-write significantly outperform single-turn generation.
  arXiv  Detail & Related papers  (2026-01-07T03:07:52Z)
• SciNetBench: A Relation-Aware Benchmark for Scientific Literature Retrieval Agents [12.057215000080705]
  We propose SciNetBench, the first Scientific Network Relation-aware Benchmark for literature retrieval agents.<n>Our benchmark systematically evaluates three levels of relations: ego-centric retrieval of papers with novel knowledge structures, pair-wise identification of scholarly relationships, and path-wise reconstruction of scientific evolutionary trajectories.<n>We find that their accuracy on relation-aware retrieval tasks often falls below 20%, revealing a core shortcoming of current retrieval paradigms.
  arXiv  Detail & Related papers  (2025-12-16T02:53:02Z)
• The Power of Network Pluralism: Multi-Perspective Modeling of Heterogeneous Legal Document Networks [5.170807667319542]
  This paper introduces Network Pluralism as a conceptual framework that leverages multi-perspectivity to yield more complete, meaningful, and robust results.<n>We develop and demonstrate the benefits of this approach via a hands-on analysis of complex legal systems.<n>Our work acts as a blueprint to facilitate the broader adoption of Network Pluralism in domain-driven network research.
  arXiv  Detail & Related papers  (2025-12-05T12:47:43Z)
• Relational Composition in Neural Networks: A Survey and Call to Action [54.47858085003077]
  Many neural nets appear to represent data as linear combinations of "feature vectors" We argue that this success is incomplete without an understanding of relational composition.
  arXiv  Detail & Related papers  (2024-07-19T20:50:57Z)
• On Discprecncies between Perturbation Evaluations of Graph Neural Network Attributions [49.8110352174327]
  We assess attribution methods from a perspective not previously explored in the graph domain: retraining. The core idea is to retrain the network on important (or not important) relationships as identified by the attributions. We run our analysis on four state-of-the-art GNN attribution methods and five synthetic and real-world graph classification datasets.
  arXiv  Detail & Related papers  (2024-01-01T02:03:35Z)
• Visual Analytics of Multivariate Networks with Representation Learning and Composite Variable Construction [19.265502727154473]
  This paper presents a visual analytics workflow for studying multivariate networks. It consists of a neural-network-based learning phase to classify the data, a dimensionality reduction and optimization phase, and an interpreting phase conducted by the user. A key part of our design is a composite variable construction step that remodels nonlinear features obtained by neural networks into linear features that are intuitive to interpret.
  arXiv  Detail & Related papers  (2023-03-16T18:31:18Z)
• Generalization analysis of an unfolding network for analysis-based Compressed Sensing [27.53377180094267]
  Unfolding networks have shown promising results in the Compressed Sensing (CS) field. In this paper, we perform generalization analysis of a state-of-the-art ADMM-based unfolding network.
  arXiv  Detail & Related papers  (2023-03-09T21:13:32Z)
• Reconstructing Sparse Illicit Supply Networks: A Case Study of Multiplex Drug Trafficking Networks [2.86989372262348]
  In this paper, we work on real-world multiplex drug trafficking networks extracted from an investigation report. It is found that DegEM approach achieves the best predictive performance in terms of several accuracy metrics.
  arXiv  Detail & Related papers  (2022-07-29T16:06:50Z)
• Rank Diminishing in Deep Neural Networks [71.03777954670323]
  Rank of neural networks measures information flowing across layers. It is an instance of a key structural condition that applies across broad domains of machine learning. For neural networks, however, the intrinsic mechanism that yields low-rank structures remains vague and unclear.
  arXiv  Detail & Related papers  (2022-06-13T12:03:32Z)
• A Coupled CP Decomposition for Principal Components Analysis of Symmetric Networks [11.988825533369686]
  We propose a principal components analysis (PCA) framework for sequence network data. We derive efficient algorithms for computing our proposed "Coupled CP" decomposition. We demonstrate the effectiveness of our proposal on simulated data and on examples from political science and financial economics.
  arXiv  Detail & Related papers  (2022-02-09T20:52:19Z)
• Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning [50.24174211654775]
  We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks. Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair. A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
  arXiv  Detail & Related papers  (2021-02-27T03:17:20Z)
• 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)
• 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)

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.