A nonparametric two-sample hypothesis testing problem for random graphs
From MaRDI portal
Publication:126088
DOI10.3150/15-bej789zbMath1450.62040MaRDI QIDQ126088
Vince Lyzinski, Carey E. Priebe, Avanti Athreya, Minh Tang, Daniel L. Sussman, Vince Lyzinski, Carey E. Priebe, Avanti Athreya, Minh Tang, Daniel L. Sussman
Publication date: 1 August 2017
Published in: Bernoulli (Search for Journal in Brave)
Nonparametric hypothesis testing (62G10) Asymptotic properties of nonparametric inference (62G20) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Functional limit theorems; invariance principles (60F17)
Related Items
Overlapping community detection in networks via sparse spectral decomposition, Scalable estimation of epidemic thresholds via node sampling, Edgeworth expansions for network moments, Testing for Equivalence of Network Distribution Using Subgraph Counts, Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure, A practical two-sample test for weighted random graphs, Subgraph nomination: query by example subgraph retrieval in networks, Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals, Vertex nomination, consistent estimation, and adversarial modification, Statistical inference on random dot product graphs: a survey, Network classification with applications to brain connectomics, Bayesian modeling of the structural connectome for studying Alzheimer's disease, Two-sample Hypothesis Testing for Inhomogeneous Random Graphs, statGraph, Adaptive estimation of nonparametric geometric graphs, On estimation and inference in latent structure random graphs, Network representation using graph root distributions, Limit theorems for eigenvectors of the normalized Laplacian for random graphs, Unnamed Item, The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics, Unnamed Item
