default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick Rubin-Delanchy
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Ed Davis, Ian Gallagher, Daniel John Lawson
, Patrick Rubin-Delanchy:
Valid Conformal Prediction for Dynamic GNNs. CoRR abs/2405.19230 (2024)- 2023
- [c11]Hannah Sansford, Alexander Modell, Nick Whiteley, Patrick Rubin-Delanchy:
Implications of sparsity and high triangle density for graph representation learning. AISTATS 2023: 5449-5473 - [c10]Annie Gray, Alexander Modell, Patrick Rubin-Delanchy, Nick Whiteley:
Hierarchical clustering with dot products recovers hidden tree structure. NeurIPS 2023 - [c9]Alexander Modell, Ian Gallagher, Emma Ceccherini, Nick Whiteley, Patrick Rubin-Delanchy:
Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks. NeurIPS 2023 - [i12]Annie Gray, Alexander Modell, Patrick Rubin-Delanchy, Nick Whiteley:
Hierarchical clustering with dot products recovers hidden tree structure. CoRR abs/2305.15022 (2023) - [i11]Alexander Modell, Ian Gallagher, Emma Ceccherini, Nick Whiteley, Patrick Rubin-Delanchy:
Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks. CoRR abs/2306.06155 (2023) - [i10]Ed Davis, Ian Gallagher, Daniel John Lawson, Patrick Rubin-Delanchy:
A Simple and Powerful Framework for Stable Dynamic Network Embedding. CoRR abs/2311.09251 (2023) - 2022
- [j4]Francesco Sanna Passino, Nicholas A. Heard, Patrick Rubin-Delanchy:
Spectral Clustering on Spherical Coordinates Under the Degree-Corrected Stochastic Blockmodel. Technometrics 64(3): 346-357 (2022) - [i9]Nick Whiteley, Annie Gray, Patrick Rubin-Delanchy:
Statistical exploration of the Manifold Hypothesis. CoRR abs/2208.11665 (2022) - [i8]Hannah Sansford, Alexander Modell, Nick Whiteley, Patrick Rubin-Delanchy:
Implications of sparsity and high triangle density for graph representation learning. CoRR abs/2210.15277 (2022) - 2021
- [c8]Nick Whiteley, Annie Gray, Patrick Rubin-Delanchy:
Matrix factorisation and the interpretation of geodesic distance. NeurIPS 2021: 24-38 - [c7]Ian Gallagher, Andrew Jones, Patrick Rubin-Delanchy:
Spectral embedding for dynamic networks with stability guarantees. NeurIPS 2021: 10158-10170 - [i7]Nick Whiteley, Annie Gray, Patrick Rubin-Delanchy:
Matrix factorisation and the interpretation of geodesic distance. CoRR abs/2106.01260 (2021) - [i6]Ian Gallagher, Andrew Jones, Patrick Rubin-Delanchy:
Spectral embedding for dynamic networks with stability guarantees. CoRR abs/2106.01282 (2021) - 2020
- [c6]Patrick Rubin-Delanchy:
Manifold structure in graph embeddings. NeurIPS 2020 - [i5]Patrick Rubin-Delanchy:
Manifold structure in graph embeddings. CoRR abs/2006.05168 (2020) - [i4]Andrew Jones, Patrick Rubin-Delanchy:
The multilayer random dot product graph. CoRR abs/2007.10455 (2020) - [i3]Francesco Sanna Passino, Nicholas A. Heard, Patrick Rubin-Delanchy:
Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel. CoRR abs/2011.04558 (2020)
2010 – 2019
- 2019
- [i2]Ian Gallagher, Anna Bertiger, Carey E. Priebe, Patrick Rubin-Delanchy:
Spectral clustering in the weighted stochastic block model. CoRR abs/1910.05534 (2019) - 2017
- [i1]Patrick Rubin-Delanchy, Carey E. Priebe, Minh Tang, Joshua Cape:
A statistical interpretation of spectral embedding: the generalised random dot product graph. CoRR abs/1709.05506 (2017) - 2016
- [c5]Nick Heard, Patrick Rubin-Delanchy:
Network-wide anomaly detection via the Dirichlet process. ISI 2016: 220-224 - [c4]Patrick Rubin-Delanchy, Niall M. Adams, Nicholas A. Heard:
Disassortativity of computer networks. ISI 2016: 243-247 - 2014
- [c3]Patrick Rubin-Delanchy, Daniel J. Lawson, Melissa J. Turcotte, Nicholas A. Heard, Niall M. Adams:
Three Statistical Approaches to Sessionizing Network Flow Data. JISIC 2014: 244-247 - [c2]Daniel J. Lawson, Patrick Rubin-Delanchy, Nicholas A. Heard, Niall M. Adams:
Statistical Frameworks for Detecting Tunnelling in Cyber Defence Using Big Data. JISIC 2014: 248-251 - [c1]Nick Heard, Patrick Rubin-Delanchy, Daniel J. Lawson:
Filtering Automated Polling Traffic in Computer Network Flow Data. JISIC 2014: 268-271
2000 – 2009
- 2009
- [j3]Andrew T. Walden, Patrick Rubin-Delanchy:
On Testing for Impropriety of Complex-Valued Gaussian Vectors. IEEE Trans. Signal Process. 57(3): 825-834 (2009) - 2008
- [j2]Patrick Rubin-Delanchy, Andrew T. Walden:
Kinematics of Complex-Valued Time Series. IEEE Trans. Signal Process. 56(9): 4189-4198 (2008) - 2007
- [j1]Patrick Rubin-Delanchy, Andrew T. Walden:
Simulation of Improper Complex-Valued Sequences. IEEE Trans. Signal Process. 55(11): 5517-5521 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
