Testing for Equivalence of Network Distribution Using Subgraph Counts
From MaRDI portal
Publication:5065993
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
Cites Work
- Title not available (Why is that?)
- The method of moments and degree distributions for network models
- Latent Space Approaches to Social Network Analysis
- A nonparametric two-sample hypothesis testing problem for random graphs
- Two-sample Hypothesis Testing for Inhomogeneous Random Graphs
- Hypothesis testing for network data in functional neuroimaging
- Oracle inequalities for network models and sparse graphon estimation
- Testing and Modeling Dependencies Between a Network and Nodal Attributes
- Graph limits and exchangeable random graphs
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- Estimating and understanding exponential random graph models
- Common and individual structure of brain networks
- Universally consistent vertex classification for latent positions graphs
- Finding and counting given length cycles
- When are small subgraphs of a random graph normally distributed?
- A Multiscale Community Blockmodel for Network Exploration
- Subsampling bootstrap of count features of networks
- Metrics for sparse graphs
- Statistical inference on random dot product graphs: a survey
- Bayesian inference and testing of group differences in brain networks
- A distributed approach for graph mining in massive networks
- Detecting local network motifs
- Poisson approximation of subgraph counts in stochastic block models and a graphon model
Cited In (6)
- Subgraphs in preferential attachment models
- Subgraph network random effects error components models: specification and testing
- Edgeworth expansions for network moments
- Exact tests for singular network data
- Subsampling bootstrap of count features of networks
- Valid two-sample graph testing via optimal transport procrustes and multiscale graph correlation with applications in connectomics
Uses Software
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)
