Two-Sample Testing for Random Graphs without Vertex Correspondence
stat.ML, cs.LG
Submitted: 2026-10-05
Updated: 2026-10-05
Sources
- Sharp Detection Threshold for Correlation among Multiple Unlabeled Gaussian Networks
- Optimal hypothesis testing for stochastic block models with growing degrees
- Low-degree lower bounds via almost orthonormal bases
- Detecting Planted Partition in Sparse Multi-Layer Networks
- Hypothesis testing for populations of networks
- Vertex misalignment and changepoint localization in network time series
- Lov'asz Meets Weisfeiler and Leman
- Detecting Arbitrary Planted Subgraphs in Random Graphs
- Testing Network Structure Using Relations Between Small Subgraph Probabilities
- Two-sample Testing Using Deep Learning
- PolyGraph Discrepancy: a classifier-based metric for graph generation
- Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio
- TUDataset: A collection of benchmark datasets for learning with graphs
- Multivariate Inference of Network Moments by Subsampling
- Graphon based Clustering and Testing of Networks: Algorithms and Theory
- Sharp Low-Degree Thresholds for Planted-vs-Planted Testing
Related papers
- Behavior of prediction performance metrics with rare events
- Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
- A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
- Efficient quadratic entropy with distance sketches
- Embedding-Bias in Conditional Independence Testing
- From Log-Odds to Shapley Values: An Explanatory Geometry for the Weighted Naive Bayes Classifier