arXiv subjects

An Zeng

Publications and source records attributed to An Zeng.

At least 19 recordsLinked to original sources

arXiv2026

Demanding peer review is associated with higher impact in published science

Peer review shapes which scientific claims enter the published record, but its internal dynamics are hard to measure at scale because reviewer criticism and author revision are usually embedded in long, unstructured correspondence. Here we use a fixed-prompt large language model pipeline to convert the review correspondence of \textit{Nature Communications} papers published from 2017 to 2024 into structured reviewer--author interactions. We find that review pressure is concentrated in the first round and focused disproportionately on core claims rather than peripheral presentation. Higher average opinion strength is also associated with more reviewer disagreement, while review patterns vary little with broad team attributes, consistent with relatively impartial evaluation. Contrary to the intuition that stronger papers should pass review more smoothly, with greater reviewer--author agreement and less extensive revision, we find that stronger criticism, higher-quality comments, and greater revision burden are associated with higher later citation impact within accepted papers. We finally show that fields differ more in review style than in review length, pointing to disciplinary variation in how criticism is negotiated and resolved. These findings position open peer review not just as a gatekeeping mechanism but as a measurable record of how influential scientific claims are challenged, defended, and revised before entering the published record.

cs.DL↗

arXiv2026

Learning Unbiased Cluster Descriptors for Interpretable Imbalanced Concept Drift Detection

Unlabeled streaming data are usually collected to describe dynamic systems, where concept drift detection is a vital prerequisite to understanding the evolution of systems. However, the drifting concepts are usually imbalanced in most real cases, which brings great challenges to drift detection. That is, the dominant statistics of large clusters can easily mask the drifting of small cluster distributions (also called small concepts), which is known as the `masking effect'. Considering that most existing approaches only detect the overall existence of drift under the assumption of balanced concepts, two critical problems arise: 1) where the small concept is, and 2) how to detect its drift. To address the challenging concept drift detection for imbalanced data, we propose Imbalanced Cluster Descriptor-based Drift Detection (ICD3) approach that is unbiased to the imbalanced concepts. This approach first detects imbalanced concepts by employing a newly designed multi-distribution-granular search, which ensures that the distribution of both small and large concepts is effectively captured. Subsequently, it trains a One-Cluster Classifier (OCC) for each identified concept to carefully monitor their potential drifts in the upcoming data chunks. Since the detection is independently performed for each concept, the dominance of large clusters is thus circumvented. ICD3 demonstrates highly interpretability by specifically locating the drifted concepts, and is robust to the changing of the imbalance ratio of concepts. Comprehensive experiments with multi-aspect ablation studies conducted on various benchmark datasets demonstrate the superiority of ICD3 against the state-of-the-art counterparts.

cs.LG↗

arXiv2026

TFEC: Multivariate Time-Series Clustering via Temporal-Frequency Enhanced Contrastive Learning

Multivariate Time-Series (MTS) clustering is crucial for signal processing and data analysis. Although deep learning approaches, particularly those leveraging Contrastive Learning (CL), are prominent for MTS representation, existing CL-based models face two key limitations: 1) neglecting clustering information during positive/negative sample pair construction, and 2) introducing unreasonable inductive biases, e.g., destroying time dependence and periodicity through augmentation strategies, compromising representation quality. This paper, therefore, proposes a Temporal-Frequency Enhanced Contrastive (TFEC) learning framework. To preserve temporal structure while generating low-distortion representations, a temporal-frequency Co-EnHancement (CoEH) mechanism is introduced. Accordingly, a synergistic dual-path representation and cluster distribution learning framework is designed to jointly optimize cluster structure and representation fidelity. Experiments on six real-world benchmark datasets demonstrate TFEC's superiority, achieving 4.48% average NMI gains over SOTA methods, with ablation studies validating the design. The code of the paper is available at: https://github.com/yueliangy/TFEC.

cs.LG↗

arXiv2025

Analyzing Cascade Sizes of Stopped Projects in SourceForge: Is SOC Theory Applicable to OSSOCs?

Based on three rounds of data extraction, we first construct complex network models to identify the cascade sizes of stopped projects and their distributions in SourceForge (March 2000 to February 2013). We then analyze and discover characteristics of these cascade sizes and their distributions: most cascade sizes are 1; two extreme sizes coexist; and the cascade sizes in each Period of SourceForge's peak phase exhibit a power-law distribution while lacking scale-free properties. Finally, we discuss the limitations of this study and their implications for Self-Organized Criticality theory.

physics.soc-ph↗

arXiv2025

Reviving networked multi-dimensional dynamical systems

From gene regulatory networks to mutualistic networks, controlling a single node in the network topology can transform these complex dynamical systems from undesirable states to desirable ones. Corresponding methods have been well-studied in one-dimensional dynamical systems. However, many practical dynamical systems require description by multi-dimensional dynamical systems, such as the mutualistic symbiotic systems formed by flowering plants and pollinating insects. Existing one-dimensional methods cannot handle the cases of multi-dimensional dynamical systems. Based on this, we propose a method to control a single node to activate network connections in multi-dimensional dynamical systems. In such systems, the changes of each node are described by multiple nonlinear differential equations. All remaining nodes are stratified according to the shortest path to the controlled node, thereby reducing the dimensionality of the system. Such a large-scale dynamical system can ultimately be replaced by a very simple system. By analyzing the reduced-dimensional system, we can predict the extent of control needed to restore the system state. We apply this method to a wide range of fields, achieving activation of various real multidimensional complex dynamical systems.

math.DS↗

arXiv2025

Societal citations undermine the function of the science reward system

Citations in the scientific literature system do not simply reflect relationships between knowledge but are influenced by non-objective and societal factors. Citation bias, irresponsible citation, and citation manipulation are widespread and have become a serious and growing problem. However, it has been difficult to assess the consequences of mixing societal factors into the literature system because there was no observable literature system unmixed with societal factors for comparison. In this paper, we construct a mathematical theorem network, representing a logic-based and objective knowledge system, to address this problem. By comparing the mathematical theorem network and the scientific citation networks, we find that these two types of networks are significantly different in their structure and function. In particular, the reward function in citation networks is impaired: The scientific citation network fails to provide more recognition for more disruptive results, while the mathematical theorem network can achieve. We develop a network generation model that can create two types of links$\unicode{x2014}$logical and societal$\unicode{x2014}$to account for these differences. The model parameter $q$, which we call the human influence factor, can control the number of societal links and thus regulate the degree of mixing of societal factors in the networks. Under this design, the model successfully reproduces the differences among real networks. These results suggest that the presence of societal factors undermines the function of the scientific reward system. To improve the status quo, we advocate for reforming the reference list format in papers, urging journals to require authors to separately disclose logical references and social references.

cs.DL↗

arXiv2024

Iterative structural coarse-graining for contagion dynamics in complex networks

Contagion dynamics in complex networks drive critical phenomena such as epidemic spread and information diffusion,but their analysis remains computationally prohibitive in large-scale, high-complexity systems. Here, we introduce the Iterative Structural Coarse-Graining (ISCG) framework, a scalable methodology that reduces network complexity while preserving key contagion dynamics with high fidelity. Importantly, we derive theoretical conditions ensuring the precise preservation of both macroscopic outbreak sizes and microscopic node-level infection probabilities during network reduction. Under these conditions, extensive experiments on diverse empirical networks demonstrate that ISCG achieves significant complexity reduction without sacrificing prediction accuracy. Beyond simplification, ISCG reveals multiscale structural patterns that govern contagion processes, enabling practical solutions to longstanding challenges in contagion dynamics. Specifically, ISCG outperforms traditional adaptive centrality-based approaches in identifying influential spreaders, immunizing critical edges, and optimizing sentinel placement for early outbreak detection, offering superior accuracy and computational efficiency. By bridging computational efficiency with dynamical fidelity, ISCG provides a transformative framework for analyzing large-scale contagion processes, with broad applications for epidemiology, information dissemination, and network resilience.

physics.soc-ph↗

arXiv2024

Guiding Self-Organizing Dynamics of Residential Choice in Cities to Reduce Traffic Congestion and Carbon Emissions

Rapid urbanization and growing vehicle ownership exacerbate traffic congestion and prolong commute times. We examine the self-organizing dynamics of residential choice via a hypothetical home-swapping process to mitigate peak-hour traffic congestion and carbon emissions. Specifically, we analyze over 400,000 trajectories from 9 days in a major Chinese city, revealing that actual average commuting distance is approximately three times shorter than under random residential distribution, indicating significant self-organization. Notably, city-wide home swapping reduces commuting distance by 50.4%, substantially easing traffic congestion, thereby reducing carbon emissions by 77.3%. Even with the consideration of socio-demographic factors and individual needs, the reductions remain significant: 8.1%-10.3% in commuting distance and 27.4%-34.4% in carbon emissions. Considering the potential induction of additional non-commuting trips, the reduction in carbon emissions remains substantial. Given the primacy of distance to the city center, polycentric city layouts can enhance these benefits. For validation, we use another dataset covering China's 28 major cities to confirm these findings. Finally, we introduce a data-driven model to elucidate self-organizing dynamics of residential choice and analyze the feasibility of government coordination. These insights demonstrate that a synergistic alignment of residential choices can leverage individual and city-level benefits, effectively alleviating commuting congestion and associated emissions.

physics.soc-ph↗

arXiv2024

Multi-scale Quaternion CNN and BiGRU with Cross Self-attention Feature Fusion for Fault Diagnosis of Bearing

In recent years, deep learning has led to significant advances in bearing fault diagnosis (FD). Most techniques aim to achieve greater accuracy. However, they are sensitive to noise and lack robustness, resulting in insufficient domain adaptation and anti-noise ability. The comparison of studies reveals that giving equal attention to all features does not differentiate their significance. In this work, we propose a novel FD model by integrating multi-scale quaternion convolutional neural network (MQCNN), bidirectional gated recurrent unit (BiGRU), and cross self-attention feature fusion (CSAFF). We have developed innovative designs in two modules, namely MQCNN and CSAFF. Firstly, MQCNN applies quaternion convolution to multi-scale architecture for the first time, aiming to extract the rich hidden features of the original signal from multiple scales. Then, the extracted multi-scale information is input into CSAFF for feature fusion, where CSAFF innovatively incorporates cross self-attention mechanism to enhance discriminative interaction representation within features. Finally, BiGRU captures temporal dependencies while a softmax layer is employed for fault classification, achieving accurate FD. To assess the efficacy of our approach, we experiment on three public datasets (CWRU, MFPT, and Ottawa) and compare it with other excellent methods. The results confirm its state-of-the-art, which the average accuracies can achieve up to 99.99%, 100%, and 99.21% on CWRU, MFPT, and Ottawa datasets. Moreover, we perform practical tests and ablation experiments to validate the efficacy and robustness of the proposed approach. Code is available at https://github.com/mubai011/MQCCAF.

cs.AI↗

arXiv2024

QEAN: Quaternion-Enhanced Attention Network for Visual Dance Generation

The study of music-generated dance is a novel and challenging Image generation task. It aims to input a piece of music and seed motions, then generate natural dance movements for the subsequent music. Transformer-based methods face challenges in time series prediction tasks related to human movements and music due to their struggle in capturing the nonlinear relationship and temporal aspects. This can lead to issues like joint deformation, role deviation, floating, and inconsistencies in dance movements generated in response to the music. In this paper, we propose a Quaternion-Enhanced Attention Network (QEAN) for visual dance synthesis from a quaternion perspective, which consists of a Spin Position Embedding (SPE) module and a Quaternion Rotary Attention (QRA) module. First, SPE embeds position information into self-attention in a rotational manner, leading to better learning of features of movement sequences and audio sequences, and improved understanding of the connection between music and dance. Second, QRA represents and fuses 3D motion features and audio features in the form of a series of quaternions, enabling the model to better learn the temporal coordination of music and dance under the complex temporal cycle conditions of dance generation. Finally, we conducted experiments on the dataset AIST++, and the results show that our approach achieves better and more robust performance in generating accurate, high-quality dance movements. Our source code and dataset can be available from https://github.com/MarasyZZ/QEAN and https://google.github.io/aistplusplus_dataset respectively.

cs.GR↗

arXiv2023

Disruptive papers in science are losing impact

The impact and originality are two critical dimensions for evaluating scientific publications, measured by citation and disruption metrics respectively. Despite the extensive effort made to understand the statistical properties and evolution of each of these metrics, the relations between the two remain unclear. In this paper, we study the evolution during last 70 years of the correlation between scientific papers' citation and disruption, finding surprisingly a decreasing trend from positive to negative correlations over the years. Consequently, during the years, there are fewer and fewer disruptive works among the highly cited papers. These results suggest that highly disruptive studies nowadays attract less attention from the scientific community. The analysis on papers' references supports this trend, showing that papers citing older references, less popular references and diverse references become to have less citations. Possible explanations for the less attention phenomenon could be due to the increasing information overload in science, and citations become more and more prominent for impact. This is supported by the evidence that research fields with more papers have a more negative correlation between citation and disruption. Finally, we show the generality of our findings by analyzing and comparing six disciplines.

cs.DL↗

arXiv2022

A high-frequency mobility big-data reveals how COVID-19 spread across professions, locations and age groups

As infected and vaccinated population increases, some countries decided not to impose non-pharmaceutical intervention measures anymore and to coexist with COVID-19. However, we do not have a comprehensive understanding of its consequence , especially for China where most population has not been infected and most Omicron transmissions are silent. This paper serves as the first study to reveal the complete silent transmission dynamics of COVID-19 overlaying a big data of more than 0.7 million real individual mobility tracks without any intervention measures throughout a week in a Chinese city, with an extent of completeness and realism not attained in existing studies. Together with the empirically inferred transmission rate of COVID-19, we find surprisingly that with only 70 citizens to be infected initially, 0.33 million becomes infected silently at last. We also reveal a characteristic daily periodic pattern of the transmission dynamics, with peaks in mornings and afternoons. In addition, retailing, catering and hotel staff are more likely to get infected than other professions. Unlike all other age groups and professions, elderly and retirees are more likely to get infected at home than outside home.

physics.soc-ph↗

arXiv2022

ImageCAS: A Large-Scale Dataset and Benchmark for Coronary Artery Segmentation based on Computed Tomography Angiography Images

Cardiovascular disease (CVD) accounts for about half of non-communicable diseases. Vessel stenosis in the coronary artery is considered to be the major risk of CVD. Computed tomography angiography (CTA) is one of the widely used noninvasive imaging modalities in coronary artery diagnosis due to its superior image resolution. Clinically, segmentation of coronary arteries is essential for the diagnosis and quantification of coronary artery disease. Recently, a variety of works have been proposed to address this problem. However, on one hand, most works rely on in-house datasets, and only a few works published their datasets to the public which only contain tens of images. On the other hand, their source code have not been published, and most follow-up works have not made comparison with existing works, which makes it difficult to judge the effectiveness of the methods and hinders the further exploration of this challenging yet critical problem in the community. In this paper, we propose a large-scale dataset for coronary artery segmentation on CTA images. In addition, we have implemented a benchmark in which we have tried our best to implement several typical existing methods. Furthermore, we propose a strong baseline method which combines multi-scale patch fusion and two-stage processing to extract the details of vessels. Comprehensive experiments show that the proposed method achieves better performance than existing works on the proposed large-scale dataset. The benchmark and the dataset are published at https://github.com/XiaoweiXu/ImageCAS-A-Large-Scale-Dataset-and-Benchmark-for-Coronary-Artery-Segmentation-based-on-CT.

eess.IV↗

arXiv2022

Predicting the cascading dynamics in complex networks via the bimodal failure size distribution

Cascading failure as a systematic risk occurs in a wide range of real-world networks. Cascade size distribution is a basic and crucial characteristic of systemic cascade behaviors. Recent research works have revealed that the distribution of cascade sizes is a bimodal form indicating the existence of either very small cascades or large ones. In this paper, we aim to understand the properties and formation of such bimodal distribution of cascade sizes in complex networks, and further predict the final cascade size. We first find that the bimodal distribution of cascade sizes is ubiquitous in both synthetic and real networks. Moreover, the large cascade sizes distributed in the right peak of bimodal distribution are resulted from either the failure of nodes with high load at the first step of the cascade or multiple rounds of cascades triggered by the initial failure. Accordingly, we propose a hybrid load metric (HLM), which combines the load of the initial broken node and the load of failed nodes triggered by the initial failure, to predict the final size of cascading failures. Finally, we validate the effectiveness of HLM by computing the accuracy of identifying the cascades belonging to the right and left peaks of the bimodal distribution. The results show that HLM is a better predictor than commonly used network centrality metrics in both synthetic and real-world networks.

physics.soc-ph↗

arXiv2022

Impactful scientists have higher tendency to involve collaborators in new topics

In scientific research, collaboration is one of the most effective ways to take advantage of new ideas, skills, resources, and for performing interdisciplinary research. Although collaboration networks have been intensively studied, the question of how individual scientists choose collaborators to study a new research topic remains almost unexplored. Here, we investigate the statistics and mechanisms of collaborations of individual scientists along their careers, revealing that, in general, collaborators are involved in significantly fewer topics than expected from controlled surrogate. In particular, we find that highly productive scientists tend to have higher fraction of single-topic collaborators, while highly cited, i.e., impactful, scientists have higher fraction of multi-topic collaborators. We also suggest a plausible mechanism for this distinction. Moreover, we investigate the cases where scientists involve existing collaborators into a new topic. We find that compared to productive scientists, impactful scientists show strong preference of collaboration with high impact scientists on a new topic. Finally, we validate our findings by investigating active scientists in different years and across different disciplines.

cs.DL↗

arXiv2022

Academic mentees succeed in big groups, but thrive in small groups

Mentoring is a key component of scientific achievements, contributing to overall measures of career success for mentees and mentors. A common success metric in the scientific enterprise is acquiring a large research group, which is believed to indicate excellent mentorship and high-quality research. However, large, competitive groups might also amplify dropout rates, which are high especially among early career researchers. Here, we collect longitudinal genealogical data on mentor-mentee relations and their publication, and study the effects of a mentor's group on future academic survival and performance of their mentees. We find that mentees trained in large groups generally have better academic performance than mentees from small groups, if they continue working in academia after graduation. However, we also find two surprising results: Academic survival rate is significantly lower for (1) mentees from larger groups, and for (2) mentees with more productive mentors. These findings reveal that success of mentors has a negative effect on the academic survival rate of mentees, raising important questions about the definition of successful mentorship and providing actionable suggestions concerning career development.

physics.data-an↗

arXiv2021

Maximizing spreading in complex networks with risk in node activation

It is widely acknowledged that the initial spreaders play an important role for the wide spreading of information in complex networks. Thus, a variety of centrality-based methods have been proposed to identify the most influential spreaders. However, most of the existing studies have overlooked the fact that in real social networks it is more costly and difficult to convince influential individuals to act as initial spreaders, resulting in a high risk in maximizing the spreading. In this paper, we address this problem on the basis of the assumption that large-degree nodes are activated with a higher risk than small-degree nodes. We aim to identify the effective initial spreaders to maximize spreading when considering both the activation risk and the outbreak size of initial spreaders. On random networks, the analytical analysis reveals that the degree of optimal initial spreaders does not correspond to the largest degree of nodes in the network but rather be determined by infection probability and difference of activation risk among nodes with different degree. Here, we propose a risk-aware metric to identify the effective spreaders on real networks. The numerical simulation shows that the risk-aware metric outperforms the existing benchmark centralities in maximizing the effective spreading.

physics.soc-ph↗

arXiv2020

Limits of PageRank-based ranking methods in sports data

While PageRank has been extensively used to rank sport tournament participants (teams or individuals), its superiority over simpler ranking methods has been never clearly demonstrated. We use sports results from 18 major leagues to calibrate a state-of-art model for synthetic sports results. Model data are then used to assess the ranking performance of PageRank in a controlled setting. We find that PageRank outperforms the benchmark ranking by the number of wins only when a small fraction of all games have been played. Increased randomness in the data, such as intrinsic randomness of outcomes or advantage of home teams, further reduces the range of PageRank's superiority. We propose a new PageRank variant which outperforms PageRank in all evaluated settings, yet shares its sensitivity to increased randomness in the data. Our main findings are confirmed by evaluating the ranking algorithms on real data. Our work demonstrates the danger of using novel metrics and algorithms without considering their limits of applicability.

cs.SI↗