Projects
Reading
People
Chat
SU\G
(đ¸)
/K¡U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Runbing Zheng
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
Dynamic networks clustering via mirror distance
2024
Runbing Zheng
Avanti Athreya
Marta Zlatic
Michael S. Clayton
Carey E. Priebe
+
PDF
Chat
Chain-linked Multiple Matrix Integration via Embedding Alignment
2024
Runbing Zheng
Minh Tang
+
PDF
Chat
Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
2022
Runbing Zheng
Vince Lyzinski
Carey E. Priebe
Minh Tang
+
Limit results for distributed estimation of invariant subspaces in multiple networks inference and PCA
2022
Runbing Zheng
Minh Tang
+
Vertex nomination between graphs via spectral embedding and quadratic programming
2020
Runbing Zheng
Vince Lyzinski
Carey E. Priebe
Minh Tang
Common Coauthors
Coauthor
Papers Together
Minh Tang
4
Carey E. Priebe
3
Vince Lyzinski
2
Michael S. Clayton
1
Marta Zlatic
1
Avanti Athreya
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Graph limits and exchangeable random graphs
2007
Persi Diaconis
Svante Janson
1
+
Partial singular value decomposition algorithm
1990
Sabine Van Huffel
1
+
Vertex nomination schemes for membership prediction
2015
Donniell E. Fishkind
Vince Lyzinski
Hsing-Kuo Pao
Lidian Chen
Carey E. Priebe
1
+
A nonparametric two-sample hypothesis testing problem for random dot product graphs
2014
Minh Tang
Avanti Athreya
Daniel L. Sussman
Vince Lyzinski
Carey E. Priebe
1
+
Eigenvalue Ratio Test for the Number of Factors
2013
Seung C. Ahn
Alex R. Horenstein
1
+
Vertex Nomination via Content and Context
2012
Glen Coppersmith
Carey E. Priebe
1
+
PDF
Chat
Determining the Number of Factors from Empirical Distribution of Eigenvalues
2010
Alexei Onatski
1
+
PDF
Chat
Community detection in complex networks using extremal optimization
2005
Jordi Duch
Ălex Arenas
1
+
The polynomial solvability of convex quadratic programming
1980
M.K. Kozlov
S. Yu. Tarasov
Leonid Khachiyan
1
+
PDF
Chat
Finding community structure in networks using the eigenvectors of matrices
2006
M. E. J. Newman
1
+
PDF
Chat
A useful variant of the DavisâKahan theorem for statisticians
2015
Yi Yu
Tengyao Wang
Richard J. Samworth
1
+
Bayesian Vertex Nomination
2012
Dominic S. Lee
Carey E. Priebe
1
+
PDF
Chat
Stochastic blockmodels and community structure in networks
2011
Brian Karrer
M. E. J. Newman
1
+
PDF
Chat
Community detection in graphs
2009
Santo Fortunato
1
+
PDF
Chat
Point Set Registration: Coherent Point Drift
2010
Andriy Myronenko
Xubo Song
1
+
PDF
Chat
A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
2013
Daniel A. Spielman
ShangâHua Teng
1
+
PDF
Chat
Spectra of Edge-Independent Random Graphs
2013
Linyuan LĂź
Xing Peng
1
+
PDF
Chat
Contact Patterns in a High School: A Comparison between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys
2015
Rossana Mastrandrea
Julie Fournet
Alain Barrat
1
+
Regularized Optimal Transport and the Rot Mover's Distance
2016
Arnaud Dessein
Nicolas Papadakis
Jean-Luc Rouas
1
+
Large Networks and Graph Limits
2012
LĂĄszlĂł LovĂĄsz
1
+
PDF
Chat
Computational Optimal Transport
2019
Gabriel PeyrĂŠ
Marco Cuturi
1
+
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
1
+
Smooth and Sparse Optimal Transport
2018
Mathieu Blondel
Vivien Seguy
Antoine Rolet
1
+
On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
2016
Vince Lyzinski
Keith Levin
Donniell E. Fishkind
Carey E. Priebe
1
+
PDF
Chat
Matched Filters for Noisy Induced Subgraph Detection
2019
Daniel L. Sussman
Youngser Park
Carey E. Priebe
Vince Lyzinski
1
+
PDF
Chat
Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
2018
Tommaso Cai
Anru R. Zhang
1
+
Rates of Convergence of Spectral Methods for Graphon Estimation
2017
Jiaming Xu
1
+
Vertex nomination: The canonical sampling and the extended spectral nomination schemes
2020
Jordan Yoder
Li Chen
Henry Pao
Eric Bridgeford
Keith Levin
Donniell E. Fishkind
Carey E. Priebe
Vince Lyzinski
1
+
PDF
Chat
Vertex nomination, consistent estimation, and adversarial modification
2020
Joshua Agterberg
Youngser Park
Jonathan Larson
Christopher White
Carey E. Priebe
Vince Lyzinski
1