Patrick Rubin‐Delanchy

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Valid Conformal Prediction for Dynamic GNNs	2024	Edward Davis Ian Gallagher Daniel J. Lawson Patrick Rubin‐Delanchy
+	Spectral Embedding of Weighted Graphs	2023	Ian Gallagher A. Jones Anna Bertiger Carey E. Priebe Patrick Rubin‐Delanchy
+	Hierarchical clustering with dot products recovers hidden tree structure	2023	Annie Gray Alexander Modell Patrick Rubin‐Delanchy Nick Whiteley
+	Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks	2023	Alexander Modell Ian Gallagher Emma Ceccherini Nick Whiteley Patrick Rubin‐Delanchy
+	A Simple and Powerful Framework for Stable Dynamic Network Embedding	2023	Edward Davis Ian Gallagher Daniel J. Lawson Patrick Rubin‐Delanchy
+	Spectral Embedding of Weighted Graphs	2023	Ian Gallagher A. Jones Anna Bertiger Carey E. Priebe Patrick Rubin‐Delanchy
+ PDF Chat	A Statistical Interpretation of Spectral Embedding: The Generalised Random Dot Product Graph	2022	Patrick Rubin‐Delanchy Joshua Cape Minh Tang Carey E. Priebe
+	Spectral embedding and the latent geometry of multipartite networks	2022	Alexander Modell Ian Gallagher Joshua Cape Patrick Rubin‐Delanchy
+	Statistical exploration of the Manifold Hypothesis	2022	Nick Whiteley Annie Gray Patrick Rubin‐Delanchy
+	Implications of sparsity and high triangle density for graph representation learning	2022	Hannah Sansford Alexander Modell Nick Whiteley Patrick Rubin‐Delanchy
+	Matrix factorisation and the interpretation of geodesic distance	2021	Nick Whiteley Annie Gray Patrick Rubin‐Delanchy
+ PDF Chat	Spectral Clustering on Spherical Coordinates Under the Degree-Corrected Stochastic Blockmodel	2021	Francesco Sanna Passino Nicholas A. Heard Patrick Rubin‐Delanchy
+	Matrix factorisation and the interpretation of geodesic distance	2021	Nick Whiteley Annie Gray Patrick Rubin‐Delanchy
+	Spectral embedding for dynamic networks with stability guarantees	2021	Ian Gallagher A. Jones Patrick Rubin‐Delanchy
+	Spectral clustering under degree heterogeneity: a case for the random walk Laplacian	2021	Alexander Modell Patrick Rubin‐Delanchy
+	Spectral embedding for dynamic networks with stability guarantees	2021	Ian Gallagher Andrew Jones Patrick Rubin‐Delanchy
+	Matrix factorisation and the interpretation of geodesic distance	2021	Nick Whiteley Annie Gray Patrick Rubin‐Delanchy
+	Spectral clustering under degree heterogeneity: a case for the random walk Laplacian	2021	Alexander Modell Patrick Rubin‐Delanchy
+	Manifold structure in graph embeddings.	2020	Patrick Rubin‐Delanchy
+	The multilayer random dot product graph	2020	A. Jones Patrick Rubin‐Delanchy
+	Manifold structure in graph embeddings	2020	Patrick Rubin‐Delanchy
+	Persistent Homology of Graph Embeddings	2019	Vinesh Solanki Patrick Rubin‐Delanchy Ian Gallagher
+	Spectral clustering in the weighted stochastic block model.	2019	Ian Gallagher Anna Bertiger Carey E. Priebe Patrick Rubin‐Delanchy
+	Persistent Homology of Graph Embeddings	2019	Vinesh Solanki Patrick Rubin‐Delanchy Ian Gallagher
+	Spectral embedding of weighted graphs	2019	Ian Gallagher Andrew Jones Anna Bertiger Carey E. Priebe Patrick Rubin‐Delanchy
+ PDF Chat	Detecting Weak Dependence in Computer Network Traffic Patterns by Using Higher Criticism	2018	Matthew Price-Williams Nick Heard Patrick Rubin‐Delanchy
+ PDF Chat	Meta-Analysis of Mid-<i>p</i>-Values: Some New Results based on the Convex Order	2018	Patrick Rubin‐Delanchy Nicholas A. Heard Daniel J. Lawson
+ PDF Chat	Choosing between methods of combining $p$-values	2017	Nicholas A. Heard Patrick Rubin‐Delanchy
+	The generalised random dot product graph	2017	Patrick Rubin‐Delanchy Carey E. Priebe Minh Tang
+	Consistency of adjacency spectral embedding for the mixed membership stochastic blockmodel	2017	Patrick Rubin‐Delanchy Carey E. Priebe Minh Tang
+	A statistical interpretation of spectral embedding: the generalised random dot product graph	2017	Patrick Rubin‐Delanchy Joshua Cape Minh Tang Carey E. Priebe
+	Network-wide anomaly detection via the Dirichlet process	2016	Nick Heard Patrick Rubin‐Delanchy
+	On the mid-p-value of a test statistic with arbitrary real support	2015	Patrick Rubin‐Delanchy Nicholas A. Heard
+	Meta-analysis of mid-p-values: some new results based on the convex order	2015	Patrick Rubin‐Delanchy Nicholas A. Heard Daniel J. Lawson
+	Posterior predictive p-values and the convex order	2015	Patrick Rubin‐Delanchy Daniel J. Lawson
+	Distributed Monte Carlo testing	2015	Patrick Rubin‐Delanchy
+	Meta-analysis of mid-p-values: some new results based on the convex order	2015	Patrick Rubin‐Delanchy Nicholas A. Heard Daniel J. Lawson
+	A test for dependence between two point processes on the real line	2014	Patrick Rubin‐Delanchy Nicholas A. Heard
+	Posterior predictive p-values and the convex order	2014	Patrick Rubin‐Delanchy Daniel J. Lawson
+	An algorithm to compute the power of Monte Carlo tests with guaranteed precision	2013	Axel Gandy Patrick Rubin‐Delanchy
+	R-package\simctest" A Short Introduction	2013	Axel Gandy Patrick Rubin‐Delanchy
+	On Testing for Impropriety of Complex-Valued Gaussian Vectors	2008	Andrew T. Walden Patrick Rubin‐Delanchy
+	Simulation of Improper Complex-Valued Sequences	2007	Patrick Rubin‐Delanchy Andrew T. Walden

Common Coauthors

Coauthor	Papers Together
Ian Gallagher	12
Carey E. Priebe	8
Daniel J. Lawson	7
Nick Whiteley	7
Nicholas A. Heard	7
Alexander Modell	6
Anna Bertiger	4
A. Jones	4
Minh Tang	4
Joshua Cape	3
Annie Gray	3
Axel Gandy	2
Annie Gray	2
Edward Davis	2
Andrew T. Walden	2
Nick Heard	2
Andrew Jones	2
Francesco Sanna Passino	1
Vinesh Solanki	1
Hannah Sansford	1
Emma Ceccherini	1
Vinesh Solanki	1
Matthew Price-Williams	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Consistency of spectral clustering in stochastic block models	2014	Jing Lei Alessandro Rinaldo	8
+	Spectral clustering and the high-dimensional stochastic blockmodel	2011	Karl Rohe Sourav Chatterjee Bin Yu	8
+ PDF Chat	Stochastic blockmodels and community structure in networks	2011	Brian Karrer M. E. J. Newman	8
+ PDF Chat	Limit theorems for eigenvectors of the normalized Laplacian for random graphs	2018	Minh Tang Carey E. Priebe	6
+	The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics	2019	Joshua Cape Minh Tang Carey E. Priebe	6
+ PDF Chat	A tutorial on spectral clustering	2007	Ulrike von Luxburg	6
+ PDF Chat	Community Detection and Classification in Hierarchical Stochastic Blockmodels	2016	Vince Lyzinski Minh Tang Avanti Athreya Youngser Park Carey E. Priebe	6
+	A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs	2015	A. Manoj Athreya Carey E. Priebe Minh Tang Vince Lyzinski David J. Marchette Daniel L. Sussman	5
+ PDF Chat	Community Detection and Stochastic Block Models	2018	Emmanuel Abbé	5
+ PDF Chat	A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs	2012	Daniel L. Sussman Minh Tang Donniell E. Fishkind Carey E. Priebe	5
+ PDF Chat	A useful variant of the Davis–Kahan theorem for statisticians	2015	Yi Yu Tengyao Wang Richard J. Samworth	5
+	Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing	1995	Yoav Benjamini Yosef Hochberg	4
+	Role of normalization in spectral clustering for stochastic blockmodels	2015	Purnamrita Sarkar Peter J. Bickel	4
+ PDF Chat	Posterior Predictive $p$-Values	1994	Xiao‐Li Meng	4
+ PDF Chat	A Statistical Interpretation of Spectral Embedding: The Generalised Random Dot Product Graph	2022	Patrick Rubin‐Delanchy Joshua Cape Minh Tang Carey E. Priebe	4
+ PDF Chat	Spectral Clustering on Spherical Coordinates Under the Degree-Corrected Stochastic Blockmodel	2021	Francesco Sanna Passino Nicholas A. Heard Patrick Rubin‐Delanchy	4
+ PDF Chat	Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding	2014	Vince Lyzinski Daniel L. Sussman Minh Tang Avanti Athreya Carey E. Priebe	4
+ PDF Chat	On a two-truths phenomenon in spectral graph clustering	2019	Carey E. Priebe Youngser Park Joshua T Vogelstein John M. Conroy Vince Lyzinski Minh Tang Avanti Athreya Joshua Cape Eric Bridgeford	4
+ PDF Chat	Higher criticism for detecting sparse heterogeneous mixtures	2004	David L. Donoho Jiashun Jin	3
+	FIDUCIAL LIMITS OF THE PARAMETER OF A DISCONTINUOUS DISTRIBUTION	1950	Wallace Stevens	3
+	Large Networks and Graph Limits	2012	László Lovász	3
+	Rate-optimal graphon estimation	2015	Chao Gao Yu Lu Harrison H. Zhou	3
+	Pseudo-likelihood methods for community detection in large sparse networks	2013	Arash Amini Aiyou Chen Peter J. Bickel Elizaveta Levina	3
+ PDF Chat	Convexity according to the geometric mean	2000	Constantin P. Niculescu	3
+	Universally consistent vertex classification for latent positions graphs	2013	Minh Tang Daniel L. Sussman Carey E. Priebe	3
+	Practicing safe statistics with the mid‐p	1994	Richard Routledge	3
+	On the optimal stopping values induced by general dependence structures	2001	Alfred Müller Ludger Rüschendorf	3
+	On alleged gains in power from lower <i>P</i>‐values	1989	G. A. Barnard	3
+	The multilayer random dot product graph	2020	A. Jones Patrick Rubin‐Delanchy	3
+	Must clinical trials be large? The interpretation of <i>p</i>‐values and the combination of test results	1990	G. A. Barnard	3
+ PDF Chat	Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering	2020	Congyuan Yang Carey E. Priebe Youngser Park David J. Marchette	3
+	Statistical control of counting experiments	1952	H. O. Lancaster	3
+ PDF Chat	On spectral embedding performance and elucidating network structure in stochastic blockmodel graphs	2019	Joshua Cape Minh Tang Carey E. Priebe	3
+ PDF Chat	Point Process Modelling for Directed Interaction Networks	2013	Patrick O. Perry Patrick J. Wolfe	3
+	Statistical Methods for Research Workers.	1930	Charles C. Grove R. A. Fisher	3
+ PDF Chat	The Existence of Probability Measures with Given Marginals	1965	Volker Strassen	3
+	UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction	2018	Leland McInnes John J. Healy	2
+	Network Representation Using Graph Root Distributions	2018	Jing Lei	2
+	A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference	2017	Keith Levin Avanti Athreya Minh Tang Vince Lyzinski Youngser Park Carey E. Priebe	2
+	Consistency of adjacency spectral embedding for the mixed membership stochastic blockmodel	2017	Patrick Rubin‐Delanchy Carey E. Priebe Minh Tang	2
+ PDF Chat	Choosing between methods of combining $p$-values	2017	Nicholas A. Heard Patrick Rubin‐Delanchy	2
+	Network-wide anomaly detection via the Dirichlet process	2016	Nick Heard Patrick Rubin‐Delanchy	2
+ PDF Chat	A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing	2015	Chia-Hsiang Lin Chong‐Yung Chi Yu-Hsiang Wang Tsung‐Han Chan	2
+ PDF Chat	On fuzzy familywise error rate and false discovery rate procedures for discrete distributions	2009	Elena Kulinskaya Alex Lewin	2
+	Statistical inference on random dot product graphs: a survey	2017	Avanti Athreya Donniell E. Fishkind Keith Levin Vince Lyzinski Youngser Park Yichen Qin Daniel L. Sussman Minh Tang Joshua T Vogelstein Carey E. Priebe	2
+ PDF Chat	Signal-plus-noise matrix models: eigenvector deviations and fluctuations	2018	Joshua Cape Minh Tang Carey E. Priebe	2
+	Handbook of Parametric and Nonparametric Statistical Procedures	2004	David J. Sheskin	2
+ PDF Chat	The Non‐Gaussian Cold Spot in the 3 Year<i>Wilkinson Microwave Anisotropy Probe</i>Data	2007	M. Cruz L. Cayón E. Martínez-González P. Vielva Jiashun Jin	2
+	Model-Based Clustering, Discriminant Analysis, and Density Estimation	2002	Chris Fraley Adrian E. Raftery	2
+ PDF Chat	Randomised<i>P</i>-values and nonparametric procedures in multiple testing	2010	Joshua Habiger Edsel A. Peña	2