Cian Naik
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Cian Naik has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Judith Rousseau
Department of Statistics, University of Oxford, Oxford, United Kingdom
3 shared publications - Cassidy R. Sugimoto
School of Public Policy, Georgia Institute of Technology, Atlanta, USA
1 shared publication - Chenlei Leng
Department of Applied Mathematics, Hong Kong Polytechnic University
1 shared publication - François Caron
Department of Statistics University of Oxford
1 shared publication - François Caron
Department of Statistics, University of Oxford, Oxford, United Kingdom
1 shared publication - Konstantina Palla
Spotify, London, United Kingdom
1 shared publication
Latest Publications
- Open Access
- 1 May 2023
- Published by MIT Press in Quantitative Science Studies
- Vol. 4 (2) , 442-465
Impact of geographic diversity on citation of collaborative research
Diversity in human capital is widely seen as critical to creating holistic and high-quality research, especially in areas that engage with diverse cultures, environments, and challenges. Quantification of diverse academic collaborations and their effect on research quality is lacking, especially at international scale and across different domains. Here, we present the first effort to measure the impact of geographic diversity in coauthorships on the citation of their papers across different academic domains. Our results unequivocally show that geographic coauthor diversity improves paper citation, but very long distance collaborations have variable impact. We also discover “well-trodden” collaboration circles that yield much less impact than similar travel distances. These relationships are observed to exist across different subject areas, but with varying strengths. These findings can help academics identify new opportunities from a diversity perspective, as well as inform funders on areas that require additional mobility support.
- 1 May 2023
- Published by MIT Press in Quantitative Science Studies
- Vol. 4 (2) , 442-465
Open AccessImpact of geographic diversity on citation of collaborative research
Diversity in human capital is widely seen as critical to creating holistic and high-quality research, especially in areas that engage with diverse cultures, environments, and challenges. Quantification of diverse academic collaborations and their effect on research quality is lacking, especially at international scale and across different domains. Here, we present the first effort to measure the impact of geographic diversity in coauthorships on the citation of their papers across different academic domains. Our results unequivocally show that geographic coauthor diversity improves paper citation, but very long distance collaborations have variable impact. We also discover “well-trodden” collaboration circles that yield much less impact than similar travel distances. These relationships are observed to exist across different subject areas, but with varying strengths. These findings can help academics identify new opportunities from a diversity perspective, as well as inform funders on areas that require additional mobility support.
- 17 March 2023
- Published by Springer Nature
- p. 191-206
Bayesian Nonparametrics for Sparse Dynamic Networks
- 17 March 2023
- Published by Springer Nature
- p. 191-206
Bayesian Nonparametrics for Sparse Dynamic Networks
- Open Access
Fast Bayesian Coresets via Subsampling and Quasi-Newton Refinement
Bayesian coresets approximate a posterior distribution by building a small weighted subset of the data points. Any inference procedure that is too computationally expensive to be run on the full posterior can instead be run inexpensively on the coreset, with results that approximate those on the full data. However, current approaches are limited by either a significant run-time or the need for the user to specify a low-cost approximation to the full posterior. We propose a Bayesian coreset construction algorithm that first selects a uniformly random subset of data, and then optimizes the weights using a novel quasi-Newton method. Our algorithm is a simple to implement, black-box method, that does not require the user to specify a low-cost posterior approximation. It is the first to come with a general high-probability bound on the KL divergence of the output coreset posterior. Experiments demonstrate that our method provides significant improvements in coreset quality against alternatives with comparable construction times, with far less storage cost and user input required.
Open AccessFast Bayesian Coresets via Subsampling and Quasi-Newton Refinement
Bayesian coresets approximate a posterior distribution by building a small weighted subset of the data points. Any inference procedure that is too computationally expensive to be run on the full posterior can instead be run inexpensively on the coreset, with results that approximate those on the full data. However, current approaches are limited by either a significant run-time or the need for the user to specify a low-cost approximation to the full posterior. We propose a Bayesian coreset construction algorithm that first selects a uniformly random subset of data, and then optimizes the weights using a novel quasi-Newton method. Our algorithm is a simple to implement, black-box method, that does not require the user to specify a low-cost posterior approximation. It is the first to come with a general high-probability bound on the KL divergence of the output coreset posterior. Experiments demonstrate that our method provides significant improvements in coreset quality against alternatives with comparable construction times, with far less storage cost and user input required.
- Open Access
Sparse Networks with Core-Periphery Structure
We propose a statistical model for graphs with a core-periphery structure. To do this we define a precise notion of what it means for a graph to have this structure, based on the sparsity properties of the subgraphs of core and periphery nodes. We present a class of sparse graphs with such properties, and provide methods to simulate from this class, and to perform posterior inference. We demonstrate that our model can detect core-periphery structure in simulated and real-world networks.
Open AccessSparse Networks with Core-Periphery Structure
We propose a statistical model for graphs with a core-periphery structure. To do this we define a precise notion of what it means for a graph to have this structure, based on the sparsity properties of the subgraphs of core and periphery nodes. We present a class of sparse graphs with such properties, and provide methods to simulate from this class, and to perform posterior inference. We demonstrate that our model can detect core-periphery structure in simulated and real-world networks.