{"total":24,"rows":[{"id":"2112.11671","title":"Partial recovery and weak consistency in the non-uniform hypergraph Stochastic Block Model","created":"2021-12-22","cited_by_count":7,"area":null},{"id":"2108.03336","title":"Estimating Graph Dimension with Cross-validated Eigenvalues","created":"2021-08-06","cited_by_count":6,"area":null},{"id":"2506.13831","title":"Quantifying Structure in CLIP Embeddings: A Statistical Framework for Concept Interpretation","created":"2025-06-16","cited_by_count":6,"area":null},{"id":"2105.08678","title":"Nonparametric Modeling of Higher-Order Interactions via Hypergraphons","created":"2021-05-18","cited_by_count":4,"area":null},{"id":"2106.02803","title":"Network Estimation by Mixing: Adaptivity and More","created":"2021-06-05","cited_by_count":4,"area":null},{"id":"2504.20430","title":"Learning Laplacian Positional Encodings for Heterophilous Graphs","created":"2025-04-29","cited_by_count":4,"area":null},{"id":"2411.02835","title":"Community detection with the Bethe-Hessian","created":"2024-11-05","cited_by_count":3,"area":null},{"id":"2104.10347","title":"A class of network models recoverable by spectral clustering","created":"2021-04-21","cited_by_count":2,"area":null},{"id":"2304.13139","title":"Optimal and exact recovery on the general nonuniform Hypergraph Stochastic Block Model","created":"2023-04-25","cited_by_count":2,"area":null},{"id":"2412.14315","title":"On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models","created":"2024-12-18","cited_by_count":2,"area":null},{"id":"2505.05816","title":"On the Price of Differential Privacy for Spectral Clustering over Stochastic Block Models","created":"2025-05-09","cited_by_count":2,"area":null},{"id":"2101.00503","title":"Modularity maximisation for graphons","created":"2021-01-02","cited_by_count":1,"area":null},{"id":"2210.15277","title":"Implications of sparsity and high triangle density for graph representation learning","created":"2022-10-27","cited_by_count":1,"area":null},{"id":"2202.03945","title":"Spectral embedding and the latent geometry of multipartite networks","created":"2022-02-08","cited_by_count":0,"area":null},{"id":"2208.09710","title":"Adversarial contamination of networks in the setting of vertex nomination: a new trimming method","created":"2022-08-20","cited_by_count":0,"area":null},{"id":"2301.04771","title":"Variational Inference: Posterior Threshold Improves Network Clustering Accuracy in Sparse Regimes","created":"2023-01-12","cited_by_count":0,"area":null},{"id":"2306.12968","title":"Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model","created":"2023-06-18","cited_by_count":0,"area":null},{"id":"2410.21987","title":"Node Regression on Latent Position Random Graphs via Local Averaging","created":"2024-10-29","cited_by_count":0,"area":null},{"id":"2510.07136","title":"Differentially Private Spectral Graph Clustering: Balancing Privacy, Accuracy, and Efficiency","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2510.21669","title":"Optimal Graph Clustering without Edge Density Signals","created":"2025-10-24","cited_by_count":0,"area":null},{"id":"2511.07734","title":"Global Optimization on Graph-Structured Data via Gaussian Processes with Spectral Representations","created":"2025-11-11","cited_by_count":0,"area":null},{"id":"2608.11321","title":"Spectral graph clustering with inhomogeneous latent geometry","created":"2026-08-11","cited_by_count":0,"area":null},{"id":"2609.20520","title":"Sharp spectral norm concentration of sparse random tensors","created":"2026-09-17","cited_by_count":0,"area":null},{"id":"2610.13083","title":"The Limits of Query Monitoring against Distributed Model Extraction","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}