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.
Independent Component Analysis Using an Extended Infomax Algorithm for Mixed Subgaussian and Supergaussian Sources
This map shows the geographic impact of Mark Girolami'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 Mark Girolami with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Girolami more than expected).
This network shows the impact of papers produced by Mark Girolami. 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 Mark Girolami. The network helps show where Mark Girolami may publish in the future.
Co-authorship network of co-authors of Mark Girolami
This figure shows the co-authorship network connecting the top 25 collaborators of Mark Girolami.
A scholar is included among the top collaborators of Mark Girolami 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 Mark Girolami. Mark Girolami is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sacks, Rafael, Ioannis Brilakis, Ergo Pikas, Haiyan Xie, & Mark Girolami. (2020). Construction with digital twin information systems. SHILAP Revista de lepidopterología. 1.326 indexed citations breakdown →
8.
Girolami, Mark, et al.. (2019). The Statistical Finite Element Method. arXiv (Cornell University).1 indexed citations
9.
Virtanen, Seppo & Mark Girolami. (2019). Precision-Recall Balanced Topic Modelling. Cambridge University Engineering Department Publications Database. 32. 6747–6756.4 indexed citations
Oates, Chris J. & Mark Girolami. (2016). Control Functionals for Quasi-Monte Carlo Integration. Cambridge University Engineering Department Publications Database. 56–65.3 indexed citations
12.
Osborne, Michael A., et al.. (2015). Probabilistic numerics and uncertainty in computations.93 indexed citations
13.
Stathopoulos, Vassilios, Veronica Zamora‐Gutierrez, Kate E. Jones, & Mark Girolami. (2014). Bat Call Identification with Gaussian Process Multinomial Probit Regression and a Dynamic Time Warping Kernel. ePrints Soton (University of Southampton). 913–921.8 indexed citations
Girolami, Mark, Anne-Marie Lyne, Heiko Strathmann, Daniel Simpson, & Yves F. Atchadé. (2013). Playing Russian Roulette with Intractable Likelihoods. arXiv (Cornell University).9 indexed citations
16.
Ying, Yiming, Colin Campbell, & Mark Girolami. (2009). Analysis of SVM with Indefinite Kernels. ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam). 22. 2205–2213.35 indexed citations
17.
Girolami, Mark & Ata Kabán. (2003). Simplicial Mixtures of Markov Chains: Distributed Modelling of Dynamic User Profiles. UCL Discovery (University College London). 16. 9–16.24 indexed citations
18.
Girolami, Mark. (2000). A generative model for sparse discrete binary data with non-uniform categorical priors.. The European Symposium on Artificial Neural Networks. 1–6.3 indexed citations
19.
Girolami, Mark & Colin Fyfe. (1997). Independence is far from normal.. The European Symposium on Artificial Neural Networks.2 indexed citations
20.
Girolami, Mark. (1996). Negentropy and Kurtosis as Projection Pursuit Indices Provide Generalised ICA Algorithms. Neural Information Processing Systems.34 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.