{"list":"other","total":52,"rows":[{"id":"1611.07308","title":"Variational Graph Auto-Encoders","created":"2016-11-21","cited_by_count":1382},{"id":"1810.08473","title":"From Louvain to Leiden: guaranteeing well-connected communities","created":"2018-10-19","cited_by_count":385},{"id":"1709.05454","title":"Statistical inference on random dot product graphs: a survey","created":"2017-09-16","cited_by_count":70},{"id":"1709.05506","title":"A statistical interpretation of spectral embedding: the generalised random dot product graph","created":"2017-09-16","cited_by_count":55},{"id":"1405.3133","title":"Graph Matching: Relax at Your Own Risk","created":"2014-05-13","cited_by_count":27},{"id":"1808.07801","title":"On a 'Two Truths' Phenomenon in Spectral Graph Clustering","created":"2018-08-23","cited_by_count":24},{"id":"1310.0532","title":"Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding","created":"2013-10-02","cited_by_count":23},{"id":"1503.02115","title":"Community Detection and Classification in Hierarchical Stochastic Blockmodels","created":"2015-03-07","cited_by_count":23},{"id":"1406.6625","title":"Computational Lower Bounds for Community Detection on Random Graphs","created":"2014-06-25","cited_by_count":22},{"id":"1304.7844","title":"Seeded graph matching for correlated Erd\\H{o}s-R\\'enyi graphs","created":"2013-04-30","cited_by_count":20},{"id":"1607.08601","title":"Limit theorems for eigenvectors of the normalized Laplacian for random graphs","created":"2016-07-28","cited_by_count":17},{"id":"2109.13098","title":"One-Hot Graph Encoder Embedding","created":"2021-09-27","cited_by_count":16},{"id":"1312.2638","title":"Vertex nomination schemes for membership prediction","created":"2013-12-10","cited_by_count":8},{"id":"1605.02315","title":"Information Recovery in Shuffled Graphs via Graph Matching","created":"2016-05-08","cited_by_count":8},{"id":"2301.11290","title":"Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection","created":"2023-01-18","cited_by_count":8},{"id":"1905.01776","title":"Vertex Nomination, Consistent Estimation, and Adversarial Modification","created":"2019-05-06","cited_by_count":7},{"id":"1802.04960","title":"Vertex nomination: The canonical sampling and the extended spectral nomination schemes","created":"2018-02-14","cited_by_count":6},{"id":"1803.02423","title":"Matched Filters for Noisy Induced Subgraph Detection","created":"2018-03-06","cited_by_count":6},{"id":"1812.10519","title":"Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks","created":"2018-12-26","cited_by_count":6},{"id":"2008.10055","title":"Multiple Network Embedding for Anomaly Detection in Time Series of Graphs","created":"2020-08-23","cited_by_count":6},{"id":"1310.1297","title":"Spectral Clustering for Divide-and-Conquer Graph Matching","created":"2013-10-04","cited_by_count":5},{"id":"1401.3813","title":"Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability","created":"2014-01-16","cited_by_count":5},{"id":"1508.04422","title":"Scalable Out-of-Sample Extension of Graph Embeddings Using Deep Neural Networks","created":"2015-08-18","cited_by_count":5},{"id":"1705.00674","title":"Vertex Nomination Via Seeded Graph Matching","created":"2017-05-01","cited_by_count":5},{"id":"1705.03297","title":"Semiparametric spectral modeling of the Drosophila connectome","created":"2017-05-09","cited_by_count":5},{"id":"2008.00163","title":"The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks","created":"2020-08-01","cited_by_count":5},{"id":"2011.05555","title":"The Strongish Planted Clique Hypothesis and Its Consequences","created":"2020-11-11","cited_by_count":5},{"id":"2105.10838","title":"Hypothesis Testing for Equality of Latent Positions in Random Graphs","created":"2021-05-23","cited_by_count":5},{"id":"1307.2302","title":"The blessing of transitivity in sparse and stochastic networks","created":"2013-07-08","cited_by_count":4},{"id":"1609.01672","title":"Connectome Smoothing via Low-rank Approximations","created":"2016-09-06","cited_by_count":4},{"id":"1711.05610","title":"On consistent vertex nomination schemes","created":"2017-11-15","cited_by_count":4},{"id":"2010.13152","title":"A Simple Spectral Failure Mode for Graph Convolutional Networks","created":"2020-10-25","cited_by_count":4},{"id":"2103.00624","title":"The Phantom Alignment Strength Conjecture: Practical use of graph matching alignment strength to indicate a meaningful graph match","created":"2021-02-28","cited_by_count":4},{"id":"1302.7099","title":"Community Detection in Random Networks","created":"2013-02-28","cited_by_count":3},{"id":"1401.7702","title":"A Spectral Framework for Anomalous Subgraph Detection","created":"2014-01-29","cited_by_count":3},{"id":"1603.03972","title":"Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements","created":"2016-03-12","cited_by_count":3},{"id":"1607.01369","title":"On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching","created":"2016-07-05","cited_by_count":3},{"id":"1910.07087","title":"Flowless: Extracting Densest Subgraphs Without Flow Computations","created":"2019-10-15","cited_by_count":3},{"id":"2002.01648","title":"Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question","created":"2020-02-05","cited_by_count":3},{"id":"2010.14622","title":"Vertex nomination between graphs via spectral embedding and quadratic programming","created":"2020-10-24","cited_by_count":3},{"id":"2208.08638","title":"Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels","created":"2022-08-18","cited_by_count":3},{"id":"1502.03391","title":"Fast Embedding for JOFC Using the Raw Stress Criterion","created":"2015-02-11","cited_by_count":2},{"id":"1807.04680","title":"Unseeded low-rank graph matching by transform-based unsupervised point registration","created":"2018-07-12","cited_by_count":2},{"id":"1908.02572","title":"Multiplex graph matching matched filters","created":"2019-07-23","cited_by_count":2},{"id":"2106.12621","title":"Leveraging semantically similar queries for ranking via combining representations","created":"2021-06-23","cited_by_count":2},{"id":"2205.03486","title":"Clustered Graph Matching for Label Recovery and Graph Classification","created":"2022-05-06","cited_by_count":2},{"id":"2002.09976","title":"On a complete and sufficient statistic for the correlated Bernoulli random graph model","created":"2020-02-23","cited_by_count":1},{"id":"2101.12430","title":"Subgraph nomination: Query by Example Subgraph Retrieval in Networks","created":"2021-01-29","cited_by_count":1},{"id":"2208.01365","title":"Concentration inequalities for correlated network-valued processes with applications to community estimation and changepoint analysis","created":"2022-08-02","cited_by_count":1},{"id":"2306.04016","title":"On seeded subgraph-to-subgraph matching: The ssSGM Algorithm and matchability information theory","created":"2023-06-06","cited_by_count":1},{"id":"2308.13451","title":"Gotta match 'em all: Solution diversification in graph matching matched filters","created":"2023-08-25","cited_by_count":1},{"id":"2310.18533","title":"Evaluating the effects of high-throughput structural neuroimaging predictors on whole-brain functional connectome outcomes via network-based vector-on-matrix regression","created":"2023-10-27","cited_by_count":1}],"next_cursor":null}