A nonparametric two-sample hypothesis testing problem for random graphs
From MaRDI portal
Recommendations
Cited in
(32)- Hypotheses testing on infinite random graphs
- scientific article; zbMATH DE number 7415085 (Why is no real title available?)
- Overlapping community detection in networks via sparse spectral decomposition
- Scalable estimation of epidemic thresholds via node sampling
- Network representation using graph root distributions
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Further nonparametric tests for comparing dissimilarity matrices based on the relative neighborhood graph
- Two-sample test of stochastic block models
- Bayesian modeling of the structural connectome for studying Alzheimer's disease
- Network classification with applications to brain connectomics
- Two-sample hypothesis testing for inhomogeneous random graphs
- Valid two-sample graph testing via optimal transport procrustes and multiscale graph correlation with applications in connectomics
- Adaptive estimation of nonparametric geometric graphs
- scientific article; zbMATH DE number 7559095 (Why is no real title available?)
- Vertex nomination, consistent estimation, and adversarial modification
- A General Asymptotic Framework for Distribution-Free Graph-Based Two-Sample Tests
- Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals
- Testing for Equivalence of Network Distribution Using Subgraph Counts
- Statistical inference on random dot product graphs: a survey
- Spectral analysis of networks with latent space dynamics and signs
- Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure
- Testing for high-dimensional geometry in random graphs
- Two-sample test of stochastic block models via the maximum sampling entry-wise deviation
- Edgeworth expansions for network moments
- On estimation and inference in latent structure random graphs
- Subgraph nomination: query by example subgraph retrieval in networks
- statGraph
- Hypothesis testing for equality of latent positions in random graphs
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
- A practical two-sample test for weighted random graphs
- On consistent vertex nomination schemes
- Distribution-free connectivity testing for sparse graphs
This page was built for publication: A nonparametric two-sample hypothesis testing problem for random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q126088)
