Testing for Equivalence of Network Distribution Using Subgraph Counts

DOI10.1080/10618600.2020.1736085OpenAlexW3105730750MaRDI QIDQ5065993FDOQ5065993

Authors Pierre-André G. Maugis, Sofia C. Olhede, P. J. Wolfe, Carey E. Priebe

Publication date 28 March 2022

Published in Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10618600.2020.1736085

zbMATH Keywords

statistical testingconnectomessubgraph count statistics

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• A distributed approach for graph mining in massive networks
• A multiscale community blockmodel for network exploration
• A nonparametric two-sample hypothesis testing problem for random graphs
• Bayesian inference and testing of group differences in brain networks
• Common and individual structure of brain networks
• Detecting local network motifs
• Estimating and understanding exponential random graph models
• Finding and counting given length cycles
• Graph limits and exchangeable random graphs
• Hypothesis testing for network data in functional neuroimaging
• Large networks and graph limits
• Latent Space Approaches to Social Network Analysis
• Metrics for sparse graphs
• Oracle inequalities for network models and sparse graphon estimation
• Poisson approximation of subgraph counts in stochastic block models and a graphon model
• Statistical inference on random dot product graphs: a survey
• Subsampling bootstrap of count features of networks
• Testing and modeling dependencies between a network and nodal attributes
• The method of moments and degree distributions for network models
• Two-sample hypothesis testing for inhomogeneous random graphs
• Universally consistent vertex classification for latent positions graphs
• When are small subgraphs of a random graph normally distributed?

Cited in

(6)

• Subgraph network random effects error components models: specification and testing
• Subgraphs in preferential attachment models
• Exact tests for singular network data
• Valid two-sample graph testing via optimal transport procrustes and multiscale graph correlation with applications in connectomics
• Edgeworth expansions for network moments
• Subsampling bootstrap of count features of networks

Describes a project that uses

Uses Software

• FSL
• Dipy

This page was built for publication: Testing for Equivalence of Network Distribution Using Subgraph Counts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065993)