Phantom collaborators—topically similar authors distant in the coauthor graph—become actual coauthors 16-33 times more often than baselines, with a 68-fold similarity gradient.
PLoS ONE , year =
5 Pith papers cite this work. Polarity classification is still indexing.
representative citing papers
Develops consistent procedures and an efficient alternating least squares algorithm for determining the number of dynamic factors and filter length in dynamic factor models, applied to US macroeconomic time series.
A graph-based technique splits ambiguous instances into multiple points in DR projections to reduce partial neighborhood embedding and reveal hidden memberships.
ClusterChirp is a freely available web tool for scalable interactive visualization, hierarchical clustering, and natural-language-guided analysis of high-dimensional omics datasets.
GraphRAG improves comprehensiveness and diversity of answers to global questions over million-token document sets by constructing entity graphs and hierarchical community summaries before combining partial responses.
citing papers explorer
-
Beyond coauthorship: semantic structure and phantom collaborators in transportation research, 1967--2025
Phantom collaborators—topically similar authors distant in the coauthor graph—become actual coauthors 16-33 times more often than baselines, with a 68-fold similarity gradient.
-
Determining the Structure of Dynamic Factor Models
Develops consistent procedures and an efficient alternating least squares algorithm for determining the number of dynamic factors and filter length in dynamic factor models, applied to US macroeconomic time series.
-
When One Point Is Not Enough: Addressing Ambiguous Instances in Dimensionality Reduction by Splitting
A graph-based technique splits ambiguous instances into multiple points in DR projections to reduce partial neighborhood embedding and reveal hidden memberships.
-
From Local to Global: A Graph RAG Approach to Query-Focused Summarization
GraphRAG improves comprehensiveness and diversity of answers to global questions over million-token document sets by constructing entity graphs and hierarchical community summaries before combining partial responses.