Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Barcodes: The persistent topology of data
2007629 citationsRobert GhristBulletin of the American Mathematical Societyprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Robert Ghrist's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Robert Ghrist with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert Ghrist more than expected).
This network shows the impact of papers produced by Robert Ghrist. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Robert Ghrist. The network helps show where Robert Ghrist may publish in the future.
Co-authorship network of co-authors of Robert Ghrist
This figure shows the co-authorship network connecting the top 25 collaborators of Robert Ghrist.
A scholar is included among the top collaborators of Robert Ghrist based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Robert Ghrist. Robert Ghrist is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Ghrist, Robert, et al.. (2023). Towards Homological Methods in Graphic Statics. Journal of the International Association for Shell and Spatial Structures. 64(4). 266–277.1 indexed citations
Giusti, Chad, Robert Ghrist, & Danielle S. Bassett. (2016). Two’s company, three (or more) is a simplex. Journal of Computational Neuroscience. 41(1). 1–14.249 indexed citations
6.
Ghrist, Robert. (2013). Opinion: MOOCs and the future of mathematics. Notices of the American Mathematical Society. 60(10). 1277–1278.2 indexed citations
Baryshnikov, Yuliy, et al.. (2012). Hadwiger's Theorem for Data. arXiv (Cornell University).
9.
Ghrist, Robert & Yasuaki Hiraoka. (2011). Applications of Sheaf Cohomology and Exact Sequences to Network Coding (Frontiers in mathematical science through collaborations with other disciplines). Kyoto University Research Information Repository (Kyoto University). 1752. 31–40.2 indexed citations
Ghrist, Robert & Robert Vandervorst. (2008). Scalar parabolic PDEs and braids. Transactions of the American Mathematical Society. 361(5). 2755–2788.1 indexed citations
Ghrist, Robert. (2007). Barcodes: The persistent topology of data. Bulletin of the American Mathematical Society. 45(1). 61–75.629 indexed citations breakdown →
14.
Yershova, Anna, Benjamín Tovar, Robert Ghrist, & Steven M. LaValle. (2005). Bitbots: simple robots solving complex tasks. National Conference on Artificial Intelligence. 1336–1341.8 indexed citations
Klavins, Eric, Daniel E. Koditschek, & Robert Ghrist. (2000). Toward the Regulation and Composition of Cyclic Behaviors. ScholarlyCommons (University of Pennsylvania).7 indexed citations
Ghrist, Robert. (1995). The link of periodic orbits of a flow. UMI eBooks.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.